| 42 | EdgeData::EdgeData() : isClosed( false ) {} |
| 43 | |
| 44 | void EdgeData::log( Log *l ) |
| 45 | { |
| 46 | EdgeGroupList::iterator i, iend; |
| 47 | EdgeList::iterator ei, eiend; |
| 48 | TriangleList::iterator ti, tiend; |
| 49 | tiend = triangles.end(); |
| 50 | l->logMessage( "Edge Data" ); |
| 51 | l->logMessage( "---------" ); |
| 52 | size_t num = 0; |
| 53 | for( ti = triangles.begin(); ti != tiend; ++ti, ++num ) |
| 54 | { |
| 55 | Triangle &t = *ti; |
| 56 | l->logMessage( "Triangle " + StringConverter::toString( num ) + " = {" + |
| 57 | "indexSet=" + StringConverter::toString( t.indexSet ) + ", " + |
| 58 | "vertexSet=" + StringConverter::toString( t.vertexSet ) + ", " + |
| 59 | "v0=" + StringConverter::toString( t.vertIndex[0] ) + ", " + |
| 60 | "v1=" + StringConverter::toString( t.vertIndex[1] ) + ", " + |
| 61 | "v2=" + StringConverter::toString( t.vertIndex[2] ) + "}" ); |
| 62 | } |
| 63 | iend = edgeGroups.end(); |
| 64 | for( i = edgeGroups.begin(); i != iend; ++i ) |
| 65 | { |
| 66 | num = 0; |
| 67 | eiend = i->edges.end(); |
| 68 | l->logMessage( "Edge Group vertexSet=" + StringConverter::toString( i->vertexSet ) ); |
| 69 | for( ei = i->edges.begin(); ei != eiend; ++ei, ++num ) |
| 70 | { |
| 71 | Edge &e = *ei; |
| 72 | l->logMessage( "Edge " + StringConverter::toString( num ) + " = {\n" + |
| 73 | " tri0=" + StringConverter::toString( e.triIndex[0] ) + ", \n" + |
| 74 | " tri1=" + StringConverter::toString( e.triIndex[1] ) + ", \n" + |
| 75 | " v0=" + StringConverter::toString( e.vertIndex[0] ) + ", \n" + |
| 76 | " v1=" + StringConverter::toString( e.vertIndex[1] ) + |
| 77 | ", \n" |
| 78 | " degenerate=" + |
| 79 | StringConverter::toString( e.degenerate ) + |
| 80 | " \n" |
| 81 | "}" ); |
| 82 | } |
| 83 | } |
| 84 | } |
| 85 | //--------------------------------------------------------------------- |
| 86 | EdgeListBuilder::EdgeListBuilder() : mEdgeData( 0 ) {} |
| 87 | //--------------------------------------------------------------------- |
no test coverage detected