void QhullLinkedList_test:: t_convert() { RboxPoints rcube("c"); { Qhull q(rcube,"Qt QR0"); // triangulation of rotated unit cube QCOMPARE(q.facetCount(), 12); QhullVertexList vs = q.vertexList(); QCOMPARE(vs.size(), 8u); QVERIFY(!vs.isEmpty()); QVERIFY(!vs.empty()); std::vector<QhullVertex> vs2= vs.toStdVector(); QCOMPARE(vs2.size(), vs.size()); QhullVertexList::Iterator i= vs.begin(); for(int k= 0; k<(int)vs2.size(); k++){ QCOMPARE(vs2[k], *i++); } QList<QhullVertex> vs3= vs.toQList(); QCOMPARE(vs3.count(), vs.count()); i= vs.begin(); for(int k= 0; k<vs3.count(); k++){ QCOMPARE(vs3[k], *i++); } QhullVertexList vs4(q.endVertex(), q.endVertex()); QVERIFY(vs4.isEmpty()); QVERIFY(vs==vs); QVERIFY(vs4==vs4); QVERIFY(vs!=vs4); } }//t_convert
void QhullLinkedList_test:: t_construct() { // QhullLinkedList vs; //private (compiler error). No memory allocation RboxPoints rcube("c"); { Qhull q(rcube,"Qt QR0"); // triangulation of rotated unit cube QCOMPARE(q.facetCount(), 12); QhullVertexList vs = QhullVertexList(q.beginVertex(), q.endVertex()); QCOMPARE(vs.count(), 8); QCOMPARE(vs.size(), 8u); QVERIFY(!vs.isEmpty()); QhullVertexList vs2 = q.vertexList(); QCOMPARE(vs2.count(), 8); QCOMPARE(vs2.size(),8u); QVERIFY(!vs2.isEmpty()); QVERIFY(!vs2.empty()); QVERIFY(vs==vs2); // vs= vs2; // disabled. Would not copy the vertices QhullVertexList vs3= vs2; // copy constructor QVERIFY(vs3==vs2); } }//t_construct