Go to the documentation of this file.
21 using std::ostringstream;
60 QVERIFY(!
r.isValid());
61 QCOMPARE(
r.dimension(),2);
66 QCOMPARE(
r2.dimension(), 2);
69 QCOMPARE(
r.dimension(), 2);
85 QCOMPARE(
q.facetCount(), 6);
86 QCOMPARE(
q.vertexCount(), 8);
92 cout <<
r.id() << endl;
93 QVERIFY(
r.bottomFacet()!=
r.topFacet());
94 QCOMPARE(
r.dimension(), 2);
95 QVERIFY(
r.id()>=0 &&
r.id()<9*27);
99 QCOMPARE(
r.otherFacet(
r.bottomFacet()),
r.topFacet());
100 QCOMPARE(
r.otherFacet(
r.topFacet()),
r.bottomFacet());
114 QCOMPARE(vs.
count(), 2);
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));
131 r2=
r2.nextRidge3d(f);
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"
QhullRidge – Qhull's ridge structure, ridgeT, as a C++ class.
void add_QhullRidge_test()
Faster then interator/const_iterator due to T::base_type.
Interface to Qhull from C++.
bool contains(const T &t) const
countT count(const T &t) const
QhullVertexSet vertices() const
A QhullFacet is the C++ equivalent to Qhull's facetT*.
QhullRidgeSet ridges() const
void cleanup()
Executed after each test.
hpp-fcl
Author(s):
autogenerated on Fri Aug 2 2024 02:45:15