Go to the documentation of this file.
18 #include <QtCore/QList>
67 fs.defineAs(
q.qh()->other_points);
69 QCOMPARE(fs.
count(), 0);
70 QCOMPARE(fs.
size(), 0u);
76 QCOMPARE(rs.
count(), 4);
77 QCOMPARE(rs.
size(), 4u);
84 QCOMPARE(
q.facetCount(), 6);
87 QCOMPARE(fs2.
count(), 4);
88 QCOMPARE(fs2.
size(), 4u);
95 QCOMPARE(fs[1], fs2[1]);
115 QCOMPARE(rs.
count(),4);
117 QCOMPARE(rv.size(), 4u);
118 QList<QhullRidge> rv2= rs.toQList();
119 QCOMPARE(rv2.size(), 4);
120 std::vector<QhullRidge>::iterator i= rv.begin();
127 QCOMPARE(
q2.facetCount(), 12);
130 QCOMPARE(fs.
size(), 3
U);
132 QCOMPARE(vs.size(), fs.
size());
133 for(
int k= fs.
count(); k--; ){
134 QCOMPARE(vs[k], fs[k]);
136 QList<QhullFacet>
qv= fs.toQList();
137 QCOMPARE(
qv.count(), fs.
count());
138 for(
int k= fs.
count(); k--; ){
139 QCOMPARE(
qv[k], fs[k]);
155 QCOMPARE(fs.
at(1), fs[1]);
156 QCOMPARE(fs.
first(), fs[0]);
158 QCOMPARE(fs.
last(), fs.
at(3));
166 QhullFacetSet::iterator i(
q.qh(), d+4);
167 QCOMPARE(i, fs.
end());
168 QCOMPARE(d[4],
static_cast<facetT *
>(0));
171 QCOMPARE(fs.
second(), fs[1]);
177 QCOMPARE(fs.
value(2), fs[2]);
180 QCOMPARE(fs.
value(2, f), fs[2]);
181 QCOMPARE(fs.
value(4, f), f);
201 QCOMPARE(fs.
count(f2), 1);
202 QCOMPARE(fs.
count(f3), 1);
203 QCOMPARE(fs.
count(f), 0);
221 QhullFacetSet::iterator i2= fs.
begin();
232 QCOMPARE(f3.
id(), fs[0].id());
233 QCOMPARE(f2.
id(), fs[3].id());
238 QCOMPARE((*i3).id(), fs[1].id());
270 QCOMPARE(*i2, fs[1]);
273 QCOMPARE(i2, fs.
begin());
275 QCOMPARE(i2 += 4, fs.
end());
276 QCOMPARE(i2 -= 4, fs.
begin());
277 QCOMPARE(i2+0, fs.
begin());
278 QCOMPARE(i2+4, fs.
end());
283 QCOMPARE(i, fs.
begin());
301 QhullFacetSet::const_iterator i2= fs.
begin();
312 QCOMPARE(f3.
id(), fs[0].id());
313 QCOMPARE(f2.
id(), fs[3].id());
318 QCOMPARE((*i3).id(), fs[1].id());
331 QCOMPARE(*i2, fs[1]);
359 fs.defineAs(
q.qh()->other_points);
361 QCOMPARE(fs.
count(), 0);
371 QCOMPARE(fs2.
count(), 4);
402 QCOMPARE(i.
next(), f4);
404 QCOMPARE(i.
next(), f5);
405 QCOMPARE(i.
next(), f6);
406 QCOMPARE(i.
next(), f7);
409 QCOMPARE(i.
next(), f4);
420 fs.defineAs(
q.qh()->other_points);
421 cout <<
"INFO: empty set" << fs << std::endl;
424 cout <<
"INFO: Neighboring facets\n";
425 cout << fs2 << std::endl;
428 cout <<
"INFO: Ridges for a facet\n";
429 cout << rs << std::endl;
434 #include "moc/QhullSet_test.moc"
const T::base_type * constData() const
end element is NULL
countT count() const
Filtered by facet.isGood(). May be 0 when !isEmpty().
QhullSet< QhullFacet >::iterator Iterator
T value(countT idx) const
QhullRidge – Qhull's ridge structure, ridgeT, as a C++ class.
bool contains(const QhullFacet &f) const
countT indexOf(const T &t) const
std::vector< T > toStdVector() const
countT lastIndexOf(const T &t) const
QhullSet< QhullFacet >::const_iterator ConstIterator
Faster then interator/const_iterator due to T::base_type.
Interface to Qhull from C++.
const_iterator constEnd() const
countT count(const T &t) const
std::vector< QhullFacet > toStdVector() const
A QhullFacet is the C++ equivalent to Qhull's facetT*.
const T at(countT idx) const
const_iterator constBegin() const
QhullRidgeSet ridges() const
void t_qhullset_iterator()
QhullFacetSet neighborFacets() const
void cleanup()
Executed after each test.
hpp-fcl
Author(s):
autogenerated on Fri Aug 2 2024 02:45:15