#include <boost/geometry/algorithms/equals.hpp>
#include <boost/geometry/algorithms/make.hpp>
+#include <boost/geometry/strategies/strategies.hpp>
#include "../tests.h"
#include <deal.II/numerics/rtree.h>
+#include <boost/geometry/algorithms/buffer.hpp>
+
#include "../tests.h"
namespace bgi = boost::geometry::index;
else
deallog << "OK." << std::endl;
}
-}
\ No newline at end of file
+}
// z-value of the midpoint is either
// 0 or 1, then the z-values of all
// vertices of the quad is like that
- if ((middle(2) == 0) || (middle(2) == 1))
+ if (dim == 3 && (middle(dim - 1) == 0) || (middle(dim - 1) == 1))
return middle;
double x = middle(0), y = middle(1);
// z-value of the midpoint is either
// 0 or 1, then the z-values of all
// vertices of the quad is like that
- if ((middle(2) == 0) || (middle(2) == 1))
+ if (dim == 3 && (middle(dim - 1) == 0) || (middle(dim - 1) == 1))
return middle;
double x = middle(0), y = middle(1);
{
// sort and merge the constraint matrices on proc 0, generate a checksum
// and output that into the deallog
- system(
+ int return_value = system(
(std::string("cat ") + base + "cm_?.dot|sort -n|uniq >" + base + "cm")
.c_str());
{
deallog << "checksum: " << checksum(str.begin(), str.end())
<< std::endl;
}
+ (void)return_value;
// delete the file created by processor 0
std::remove((base + "cm").c_str());
}
{
// sort and merge the constraint matrices on proc 0, generate a checksum
// and output that into the deallog
- system((std::string("cat ") + base + "cm_*.dot | sort -n | uniq > " +
- base + "cm")
- .c_str());
+ int return_value = system((std::string("cat ") + base +
+ "cm_*.dot | sort -n | uniq > " + base + "cm")
+ .c_str());
{
std::ifstream file((base + "cm").c_str());
std::stringstream ss;
deallog << "checksum: " << checksum(str.begin(), str.end())
<< std::endl;
}
+ (void)return_value;
// delete the file created by processor 0
std::remove((base + "cm").c_str());
}