24 using std::ostringstream;
69 QCOMPARE(v2.dimension(),3);
72 QCOMPARE(v.dimension(),3);
96 cout << v.
id() << endl;
98 QVERIFY(v.
id()>=0 && v.
id()<9);
102 QVERIFY(v.
next()!=
v);
113 cout <<
"Point " << j <<
":\n" << p << endl;
114 QVERIFY(j>=0 && j<8);
127 QCOMPARE(fs.
count(), 3);
143 os <<
"Vertex and vertices:\n";
147 os <<
"\nVertex and vertices with message:\n";
148 os << v.
print(
"Vertex");
149 os << vs.print(
"\nVertices:");
151 QString s= QString::fromStdString(os.str());
152 QCOMPARE(s.count(
"(v"), 10);
153 QCOMPARE(s.count(
": f"), 2);
160 os <<
"\nTry again with simplicial facets. No neighboring facets listed for vertices.\n";
161 os <<
"Vertex and vertices:\n";
164 os <<
"This time with neighborFacets() defined for all vertices:\n";
167 QString s= QString::fromStdString(os.str());
168 QCOMPARE(s.count(
": f"), 1);
173 os2 <<
"\nTry again with Voronoi diagram of simplicial facets. Neighboring facets automatically defined for vertices.\n";
174 os2 <<
"Vertex and vertices:\n";
177 QString s2= QString::fromStdString(os2.str());
178 QCOMPARE(s2.count(
": f"), 1);
184 #include "moc/QhullVertex_test.moc"
void t_constructConvert()
QhullRidge – Qhull's ridge structure, ridgeT, as a C++ class.
void add_QhullVertex_test()
A QhullFacet is the C++ equivalent to Qhull's facetT*.
QhullFacet firstFacet() const
QhullFacetSet neighborFacets() const
QhullVertexSet vertices() const
QhullVertexList vertexList() const
Return vertices of the convex hull.
void defineVertexNeighborFacets()
Automatically called if merging facets or Voronoi diagram.
QhullVertex beginVertex() const
bool contains(const T &t) const
countT vertexCount() const
const PrintVertexSet print(const char *message) const
countT count() const
Filtered by facet.isGood(). May be 0 when !isEmpty().
Interface to Qhull from C++.
QhullVertex previous() const
void cleanup()
Executed after each test.
countT facetCount() const