| /external/skia/src/core/ |
| SkDistanceFieldGen.cpp | 66 static void init_glyph_data(DFData* data, unsigned char* edges, const unsigned char* image,
72 edges += (pad*dataWidth + pad);
95 *edges = 255; // using 255 makes for convenient debug rendering
99 ++edges;
102 edges += 2*pad;
148 static void init_distances(DFData* data, unsigned char* edges, int width, int height) {
156 if (*edges) {
187 ++edges;
362 // create initial distance data, particularly at edges
|
| /external/opencv3/modules/core/test/ |
| test_io.cpp | 134 int edges[][2] = {{0,1},{1,2},{2,0},{0,3},{3,4},{4,1}}; local
141 cvGraphAddEdge(graph, edges[i][0], edges[i][1], 0, &edge);
360 graph2->edges->active_count != ecount || graph3->edges->active_count != ecount)
362 ts->printf( cvtest::TS::LOG, "the cloned or read graph have wrong number of vertices or edges\n" );
369 CvGraphEdge* edge2 = cvFindGraphEdge(graph2, edges[i][0], edges[i][1]);
370 CvGraphEdge* edge3 = cvFindGraphEdge(graph3, edges[i][0], edges[i][1])
[all...] |
| test_ds.cpp | 223 /* remove all the corresponding edges */
1468 CvSet* edges = graph->edges; local
1939 int vtx_count = -1, edge_count = 0, edges[][3] = local
[all...] |
| /system/core/libpixelflinger/ |
| trap.cpp | 32 // enable to see triangles edges
650 triangle_dump_edges( Edge* edges,
654 for ( ; count > 0; count--, edges++ )
655 edge_dump( edges );
663 Edge* edges,
672 Edge* edge = edges + *pcount;
728 // sort the edges horizontally
765 Edge edges[3]; local
770 edge_setup( edges, &num_edges, v0, v1, ymin, ymax );
771 edge_setup( edges, &num_edges, v0, v2, ymin, ymax )
[all...] |
| /external/antlr/antlr-3.4/runtime/Python/unittests/ |
| testdottreegen.py | 33 " $edges$\n" +
|
| /external/libgdx/gdx/src/com/badlogic/gdx/graphics/g3d/particles/values/ |
| CylinderSpawnShapeValue.java | 28 //Where generate the point, on edges or inside ?
29 if(edges ){
|
| RectangleSpawnShapeValue.java | 21 //Where generate the point, on edges or inside ?
22 if(edges)
|
| EllipseSpawnShapeValue.java | 28 //Where generate the point, on edges or inside ?
38 //Where generate the point, on edges or inside ?
39 if(edges){
|
| /external/antlr/antlr-3.4/runtime/C/src/ |
| antlr3collections.c | 2417 pANTLR3_BITSET edges; local
[all...] |
| /external/opencv/cxcore/src/ |
| cxdrawing.cpp | 61 icvCollectPolyEdges( CvMat* img, CvSeq* v, CvContour* edges,
66 icvFillEdgeCollection( CvMat* img, CvContour* edges, const void* color );
943 CvContour* edges;
948 CV_CALL( edges = (CvContour*)cvCreateSeq( 0, sizeof(CvContour), sizeof(CvPolyEdge), st ));
954 CV_CALL( icvCollectPolyEdges( img, &vtx, edges, color, line_type, XY_SHIFT ));
955 CV_CALL( icvFillEdgeCollection( img, edges, color ));
999 int edges = npts;
2423 CvContour* edges = 0; local
[all...] |
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
| DotTreeGenerator.cs | 104 var edges = DefineEdges( tree, adaptor );
111 foreach ( var s in edges )
|
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Utility/Antlr.Utility.Tree/ |
| DOTTreeGenerator.cs | 101 var edges = DefineEdges(tree, adaptor);
108 foreach (var s in edges)
|
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
| DotTreeGenerator.cs | 104 var edges = DefineEdges( tree, adaptor );
111 foreach ( var s in edges )
|
| /external/eigen/Eigen/src/Core/arch/AltiVec/ |
| PacketMath.h | 309 Packet16uc MSQ, LSQ, edges; local
314 edgeAlign = vec_lvsl(0, to); // permute map to extract edges
315 edges=vec_perm(LSQ,MSQ,edgeAlign); // extract the edges
317 MSQ = vec_perm(edges,(Packet16uc)from,align); // misalign the data (MSQ)
318 LSQ = vec_perm((Packet16uc)from,edges,align); // misalign the data (LSQ)
327 Packet16uc MSQ, LSQ, edges; local
332 edgeAlign = vec_lvsl(0, to); // permute map to extract edges
333 edges=vec_perm(LSQ, MSQ, edgeAlign); // extract the edges
[all...] |
| /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/CollisionShapes/ |
| btConvexPolyhedron.cpp | 104 btHashMap<btInternalVertexPair,btInternalEdge> edges; local
117 btInternalEdge* edptr = edges.find(vp);
148 edges.insert(vp,ed);
163 btInternalEdge* edptr = edges.find(vp);
|
| btPolyhedralConvexShape.cpp | 113 const btConvexHullComputer::Edge* firstEdge = &convexUtil->edges[face];
116 btVector3 edges[3]; local
132 edges[numEdges++] = newEdge;
142 faceNormals[i] = edges[0].cross(edges[1]);
|
| /external/opencv3/modules/imgproc/perf/opencl/ |
| perf_imgproc.cpp | 316 UMat edges(img.size(), CV_8UC1);
318 declare.in(img, WARMUP_RNG).out(edges);
320 OCL_TEST_CYCLE() cv::Canny(img, edges, 50.0, 100.0, apertureSize, L2Grad);
323 SANITY_CHECK(edges);
|
| /external/v8/tools/turbolizer/ |
| graph-view.js | 8 constructor (d3, id, nodes, edges, broker) {
16 graph.edges = edges || [];
138 graph.edges.filter(function(e) { e.visible = true; })
255 var edges = inEdges ? element.__data__.inputs : element.__data__.outputs;
257 edges.forEach(function(edge) {
272 // Control key toggles edges rather than just turning them on
317 this.edges = [];
348 g.edges = [];
349 data.edges.forEach(function(e, i)
[all...] |
| /external/opencv3/modules/stitching/src/ |
| motion_estimators.cpp | 816 std::vector<GraphEdge> edges; local
818 // Construct images graph and remember its edges
827 edges.push_back(GraphEdge(i, j, conf));
836 sort(edges.begin(), edges.end(), std::greater<GraphEdge>());
837 for (size_t i = 0; i < edges.size(); ++i)
839 int comp1 = comps.findSetByElem(edges[i].from);
840 int comp2 = comps.findSetByElem(edges[i].to);
844 span_tree.addEdge(edges[i].from, edges[i].to, edges[i].weight)
[all...] |
| /external/guice/extensions/grapher/src/com/google/inject/grapher/graphviz/ |
| GraphvizGrapher.java | 51 private final List<GraphvizEdge> edges = Lists.newArrayList(); field in class:GraphvizGrapher
66 edges.clear();
84 for (GraphvizEdge edge : edges) {
299 edges.add(gedge);
319 edges.add(gedge);
|
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/CPP/ |
| CPP.stg | 881 dfaState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
885 <edges; separator="\nelse ">
904 dfaOptionalBlockState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
908 <edges; separator="\nelse ">
917 dfaLoopbackState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
921 <edges; separator="\nelse "><\n>
949 dfaStateSwitch(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
951 <edges; separator="\n">
963 dfaOptionalBlockStateSwitch(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
965 <edges; separator="\n"
[all...] |
| /external/ImageMagick/MagickCore/ |
| draw.c | 138 *edges;
401 Compare two edges.
433 p=polygon_info->edges;
504 polygon_info->edges=(EdgeInfo *) AcquireQuantumMemory(number_edges,
505 sizeof(*polygon_info->edges));
506 if (polygon_info->edges == (EdgeInfo *) NULL)
508 (void) ResetMagickMemory(polygon_info->edges,0,number_edges*
509 sizeof(*polygon_info->edges));
531 polygon_info->edges=(EdgeInfo *) ResizeQuantumMemory(
532 polygon_info->edges,(size_t) number_edges
135 *edges; member in struct:_PolygonInfo
[all...] |
| /external/valgrind/coregrind/ |
| m_transtab.c | 107 /* In edges ("to-me") in the graph created by chaining. */
119 /* Out edges ("from-me") in the graph created by chaining. */
137 } edges; member in struct:__anon25277
149 } edges; member in struct:__anon25279
217 backwards and forwards edges in the graph of patched-together
284 edges in the graph are not uniquely determined by a
288 If A has multiple edges to B then B will mention A multiple
511 return VG_(sizeXA)(iea->edges.var);
522 VG_(deleteXA)(iea->edges.var);
523 iea->edges.var = NULL
[all...] |
| /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/ |
| dot.rb | 79 | <%= @edges.join("\n ") %>
109 tree_template = Context.new( tree_template, :nodes => [], :edges => [] )
158 tree_template[ :edges ] << edge_template
|
| /external/chromium-trace/catapult/third_party/py_vulcanize/py_vulcanize/ |
| project.py | 207 self.edges = []
225 self.edges.append(edge)
229 '\n'.join(self.nodes), '\n'.join(self.edges))
|
