Lines Matching refs:ndx
84 for (size_t ndx = 0; ndx + 2 < numVertices; ndx += 3)
85 *(outputIterator++) = Triangle(vertices[ndx], vertices[ndx+1], vertices[ndx+2], provokingOffset);
106 size_t ndx = 2;
111 if (ndx >= numVertices)
114 *(outputIterator++) = Triangle(vert0, vert1, vertices[ndx], (provokingConvention == rr::PROVOKINGVERTEX_FIRST) ? (0) : (2));
115 vert0 = vertices[ndx];
117 ndx++;
121 if (ndx >= numVertices)
124 *(outputIterator++) = Triangle(vert0, vert1, vertices[ndx], (provokingConvention == rr::PROVOKINGVERTEX_FIRST) ? (1) : (2));
125 vert1 = vertices[ndx];
127 ndx++;
152 for (size_t ndx = 1; ndx + 1 < numVertices; ++ndx)
153 *(outputIterator++) = Triangle(first, vertices[ndx], vertices[ndx+1], provokingOffset);
209 for (size_t ndx = 0; ndx + 1 < numVertices; ndx += 2)
210 *(outputIterator++) = Line(vertices[ndx], vertices[ndx+1], provokingOffset);
231 for (size_t ndx = 1; ndx < numVertices; ++ndx)
233 *(outputIterator++) = Line(prev, vertices[ndx], (provokingConvention == rr::PROVOKINGVERTEX_FIRST) ? (0) : (1));
234 prev = vertices[ndx];
257 for (size_t ndx = 1; ndx < numVertices; ++ndx)
259 *(outputIterator++) = Line(prev, vertices[ndx], (provokingConvention == rr::PROVOKINGVERTEX_FIRST) ? (0) : (1));
260 prev = vertices[ndx];
300 for (size_t ndx = 0; ndx < numVertices; ++ndx)
301 *(outputIterator++) = Point(vertices[ndx]);
362 for (size_t ndx = 0; ndx + 3 < numVertices; ndx += 4)
363 *(outputIterator++) = LineAdjacency(vertices[ndx], vertices[ndx+1], vertices[ndx+2], vertices[ndx+3], provokingOffset);
379 for (size_t ndx = 0; ndx + 3 < numVertices; ++ndx)
380 *(outputIterator++) = LineAdjacency(vertices[ndx], vertices[ndx+1], vertices[ndx+2], vertices[ndx+3], provokingOffset);
448 for (size_t ndx = 0; ndx + 5 < numVertices; ndx += 6)
449 *(outputIterator++) = TriangleAdjacency(vertices[ndx], vertices[ndx+1], vertices[ndx+2], vertices[ndx+3], vertices[ndx+4], vertices[ndx+5], provokingOffset);