21 using std::ostringstream;
64 QVERIFY(!rs.isEmpty());
66 QCOMPARE(
r2.dimension(), 2);
69 QCOMPARE(r.dimension(), 2);
92 cout << r.
id() << endl;
95 QVERIFY(r.
id()>=0 && r.
id()<9*27);
114 QCOMPARE(vs.
count(), 2);
116 QVERIFY(f.vertices().contains(v));
122 QList<QhullVertex> vs;
124 while(!count || r2!=r){
127 QVERIFY2(r2.
hasNextRidge3d(f),
"A cube should only have non-simplicial facets.");
129 QVERIFY(!vs.contains(v));
134 QCOMPARE(vs.count(), rs.count());
135 QCOMPARE(count, rs.count());
149 os <<
"Ridges\n" << rs <<
"Ridge\n" <<
r;
150 os << r.print(
"\nRidge with message");
152 QString s= QString::fromStdString(os.str());
153 QCOMPARE(s.count(
" r"), 6);
159 #include "moc/QhullRidge_test.moc" QhullFacet otherFacet(const QhullFacet &f) const
QhullRidge – Qhull's ridge structure, ridgeT, as a C++ class.
A QhullFacet is the C++ equivalent to Qhull's facetT*.
Faster then interator/const_iterator due to T::base_type.
QhullFacet firstFacet() const
QhullFacet bottomFacet() const
QhullRidge nextRidge3d(const QhullFacet &f) const
countT vertexCount() const
Interface to Qhull from C++.
bool hasNextRidge3d(const QhullFacet &f) const
void cleanup()
Executed after each test.
void add_QhullRidge_test()
QhullVertexSet vertices() const
countT count(const T &t) const
QhullFacet topFacet() const
countT facetCount() const