| /external/quake/quake/src/WinQuake/ |
| r_bsp.cpp | 180 // clip edges to BSP plane
224 // split into two edges, one on each side, and remember entering
229 Con_Printf ("Out of edges for bmodel\n");
267 // if anything was clipped, reconstitute and add the edges along the clip
273 Con_Printf ("Out of edges for bmodel\n");
343 pedges = pmodel->edges;
358 // copy the edges to bedges, flipping if necessary so always
360 // FIXME: if edges and vertices get caches, these assignments must move
392 pbedge[j-1].pnext = NULL; // mark end of edges
398 Sys_Error ("no edges in bmodel");
[all...] |
| gl_warp.cpp | 158 // convert edges back to a normal polygon
166 vec = loadmodel->vertexes[loadmodel->edges[lindex].v[0]].position;
168 vec = loadmodel->vertexes[loadmodel->edges[-lindex].v[1]].position;
|
| gl_model.cpp | 622 loadmodel->edges = out;
722 v = &loadmodel->vertexes[loadmodel->edges[e].v[0]];
724 v = &loadmodel->vertexes[loadmodel->edges[-e].v[1]];
[all...] |
| model.cpp | 631 loadmodel->edges = out;
731 v = &loadmodel->vertexes[loadmodel->edges[e].v[0]];
733 v = &loadmodel->vertexes[loadmodel->edges[-e].v[1]];
[all...] |
| gl_rsurf.cpp | [all...] |
| /external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/ |
| DFA.as | 110 // what about predicated edges coming from EOT
|
| /external/quake/quake/src/QW/client/ |
| gl_warp.c | 157 // convert edges back to a normal polygon
165 vec = loadmodel->vertexes[loadmodel->edges[lindex].v[0]].position;
167 vec = loadmodel->vertexes[loadmodel->edges[-lindex].v[1]].position;
|
| gl_model.c | 622 loadmodel->edges = out;
722 v = &loadmodel->vertexes[loadmodel->edges[e].v[0]];
724 v = &loadmodel->vertexes[loadmodel->edges[-e].v[1]];
[all...] |
| model.c | 613 loadmodel->edges = out;
713 v = &loadmodel->vertexes[loadmodel->edges[e].v[0]];
715 v = &loadmodel->vertexes[loadmodel->edges[-e].v[1]];
[all...] |
| gl_rsurf.c | 1494 pedges = currentmodel->edges;
[all...] |
| /external/webkit/Source/WebCore/inspector/front-end/ |
| HeapSnapshotView.js | 385 var rootEdgesIter = snapshot.rootNode.edges;
394 for (var innerIter = node.edges; innerIter.hasNext(); innerIter.next()) {
[all...] |
| Toolbar.js | 93 // of the window at the edges.
|
| DetailedHeapshotView.js | 757 for (var iter = s.rootNode.edges; iter.hasNext(); iter.next())
[all...] |
| /gdk/samples/quake/jni/ |
| gl_warp.cpp | 158 // convert edges back to a normal polygon
166 vec = loadmodel->vertexes[loadmodel->edges[lindex].v[0]].position;
168 vec = loadmodel->vertexes[loadmodel->edges[-lindex].v[1]].position;
|
| gl_model.cpp | 622 loadmodel->edges = out;
722 v = &loadmodel->vertexes[loadmodel->edges[e].v[0]];
724 v = &loadmodel->vertexes[loadmodel->edges[-e].v[1]];
[all...] |
| gl_rsurf.cpp | [all...] |
| /external/freetype/src/autofit/ |
| afloader.c | 189 AF_Edge edge1 = axis->edges; /* leftmost edge */
|
| /external/chromium/chrome/common/extensions/docs/examples/extensions/benchmark/jst/ |
| jstemplate.js | 322 * - edges are state transitions, implemented as calls to the pending
324 * - pre-order function calls are downward edges (recursion into call).
325 * - post-order function calls are upward edges (return from call).
[all...] |
| /external/chromium/chrome/common/extensions/docs/examples/extensions/irc/servlet/jstemplate/ |
| jstemplate.js | 322 * - edges are state transitions, implemented as calls to the pending
324 * - pre-order function calls are downward edges (recursion into call).
325 * - post-order function calls are upward edges (return from call).
[all...] |
| /external/libvpx/vp8/common/ppc/ |
| filter_altivec.asm | 765 ;# Two pass filtering. First pass is Horizontal edges, second pass is vertical
766 ;# edges. One of the filters can be null, but both won't be. Needs to use a
|
| /external/opencv/cv/include/ |
| cv.h | [all...] |
| /external/opencv/cxcore/include/ |
| cxtypes.h | [all...] |
| cxcore.h | [all...] |
| /external/opencv/cxcore/src/ |
| cxpersistence.cpp | [all...] |
| /external/opencv/cvaux/src/ |
| cvlee.cpp | 672 Description : Function computes intersection of two edges. Intersection
676 pEdge1,pEdge2: in, two edges
683 : -1, if edges have no intersections
693 Description : Function computes intersection of two edges. Intersection
705 : -1, if edges have no intersections
715 Description : Function computes intersection of two edges. Intersection
727 : -1, if edges have no intersections
[all...] |
