Go to the source code of this file.
temporarily make this a really big loop to test no memory leakage
Definition at line 11 of file test_point.cxx.
14 Point pp1(1, -500, -495);
15 Point pp2(1, 500, -495);
19 AssertMsg(2==results.size(),
"failed to insert");
48 Assert (
p1.norm().magnitude() == 1.0);
50 double eps = (1-1
e-11);
53 <<
" peps=" << peps <<
endl;
60 for (
auto pit = pset.begin(); pit != pset.end(); ++pit) {
63 AssertMsg(pset.size() == 2,
"tolerance set broken");
71 for (
int ind =0; ind<1000; ++ind) {
77 const Ray r1(
Point(3.75, -323.316, -500),
Point(3.75, 254.034, 500));
78 const Ray r2(
Point(2.5, -254.034, 500),
Point(2.5, 323.316, -500));
80 cerr <<
"r1=" << r1 <<
"\n" 81 <<
"r2=" << r2 <<
"\n" 82 <<
"rp=" << c12 <<
"\n";
90 cerr <<
" valid: " <<
p <<
endl;
96 cerr <<
"revalid: " <<
p <<
endl;
std::pair< Point, Point > Ray
A line segment running from a first (tail) to a second (head) point.
Q_EXPORT QTSManip setprecision(int p)
std::tuple< double, double, const reco::ClusterHit3D * > Point
Definitions used by the VoronoiDiagram algorithm.
std::set< Point, ComparePoints > PointSet
bool inside(const Point &point) const
Return true if point is inside bounding box.
std::vector< float > Vector
Ray ray_pitch(const Ray &ray1, const Ray &ray2)
constexpr Point origin()
Returns a origin position with a point of the specified type.
QTextStream & endl(QTextStream &s)