| /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/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:__anon25740
149 } edges; member in struct:__anon25742
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))
|
| /external/opencv/cv/src/ |
| cvsubdivision2d.cpp | 88 edge = (CvQuadEdge2D*)cvSetNew( (CvSet*)subdiv->edges );
182 cvSetRemoveByPtr( (CvSet*)(subdiv->edges), quadedge );
533 cvClearSet( (CvSet *) (subdiv->edges) );
585 total = subdiv->edges->total;
586 elem_size = subdiv->edges->elem_size;
588 cvStartReadSeq( (CvSeq *) (subdiv->edges), &reader, 0 );
640 total = subdiv->edges->total;
641 elem_size = subdiv->edges->elem_size;
645 cvStartReadSeq( (CvSeq *) (subdiv->edges), &reader, 0 );
650 /* skip first three edges (bounding triangle) *
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/ActionScript/ |
| ActionScript.stg | 818 dfaState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
820 <edges; separator="\nelse ">
837 dfaOptionalBlockState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
839 <edges; separator="\nelse ">
848 dfaLoopbackState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
850 <edges; separator="\nelse "><\n>
852 <if(!edges)>
853 alt<decisionNumber>=<eotPredictsAlt>; <! if no edges, don't gen ELSE !>
880 dfaStateSwitch(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
882 <edges; separator="\n"
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Java/ |
| Java.stg | 892 dfaState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
894 <edges; separator="\nelse ">
913 dfaOptionalBlockState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
915 <edges; separator="\nelse ">
924 dfaLoopbackState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
926 <edges; separator="\nelse "><\n>
928 <if(!edges)>
929 alt<decisionNumber>=<eotPredictsAlt>; <! if no edges, don't gen ELSE !>
956 dfaStateSwitch(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
958 <edges; separator="\n"
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Perl5/ |
| Perl5.stg | 851 dfaState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
853 <edges; separator="\nels">
877 dfaOptionalBlockState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
879 <edges; separator="\nels">
888 dfaLoopbackState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
890 <edges; separator="\nels"><\n>
892 <if(!edges)>
893 $alt<decisionNumber> = <eotPredictsAlt>; <! if no edges, don't gen ELSE !>
920 dfaStateSwitch(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
922 <edges; separator="\n"
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Python/ |
| Python.stg | 977 dfaState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
979 <edges; separator="\nel">
996 dfaOptionalBlockState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
998 <edges; separator="\nel">
1007 dfaLoopbackState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
1009 <edges; separator="\nel"><\n>
1011 <if(!edges)>
1012 alt<decisionNumber> = <eotPredictsAlt> <! if no edges, don't gen ELSE !>
1038 dfaStateSwitch(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
1046 <edges; separator="\nel"
[all...] |
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/codegen/templates/Scala/ |
| Scala.stg | 886 dfaState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
888 <edges; separator="\nelse ">
906 dfaOptionalBlockState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
908 <edges; separator="\nelse ">
917 dfaLoopbackState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
919 <edges; separator="\nelse "><\n>
921 <if(!edges)>
922 alt<decisionNumber>=<eotPredictsAlt> <! if no edges, don't gen ELSE !>
949 dfaStateSwitch(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
951 <edges; separator="\n"
[all...] |
| /external/opencv3/modules/cudaimgproc/src/cuda/ |
| generalized_hough.cu | 64 __global__ void buildEdgePointList(const PtrStepSzb edges, const PtrStep<T> dx, const PtrStep<T> dy,
79 if (y < edges.rows)
82 const uchar* edgesRow = edges.ptr(y);
86 for (int i = 0, xx = x; i < PIXELS_PER_THREAD && xx < edges.cols; ++i, xx += blockDim.x)
139 int buildEdgePointList_gpu(PtrStepSzb edges, PtrStepSzb dx, PtrStepSzb dy, unsigned int* coordList, float* thetaList)
149 const dim3 grid(divUp(edges.cols, block.x * PIXELS_PER_THREAD), divUp(edges.rows, block.y));
153 buildEdgePointList<T, PIXELS_PER_THREAD><<<grid, block>>>(edges, (PtrStepSz<T>) dx, (PtrStepSz<T>) dy, coordList, thetaList);
164 template int buildEdgePointList_gpu<short>(PtrStepSzb edges, PtrStepSzb dx, PtrStepSzb dy, unsigned int* coordList, float* thetaList);
165 template int buildEdgePointList_gpu<int>(PtrStepSzb edges, PtrStepSzb dx, PtrStepSzb dy, unsigned int* coordList, float* thetaList)
[all...] |
| /external/freetype/src/autofit/ |
| afhints.h | 36 /* i.e., vertical segments & edges */
38 /* i.e., horizontal segments & edges */
80 * Edges
83 * edges.
86 * edges. An edge corresponds to a single position on the main
91 * edges, then to align segments on the edges unless it detects that
178 * interpolated linearly between their two closest edges, even if these
204 * alignment of edges and strong points, thus weak points are processed
287 FT_Fixed scale; /* used to speed up interpolation between edges */
314 AF_Edge edges; \/* edges array *\/ member in struct:AF_AxisHintsRec_
322 AF_EdgeRec edges[AF_EDGES_EMBEDDED]; member in struct:AF_AxisHintsRec_::__anon12113
[all...] |
| /external/guice/extensions/grapher/src/com/google/inject/grapher/ |
| AbstractInjectorGrapher.java | 133 /** Performs any post processing required after all nodes and edges have been added. */
155 private void createEdges(Iterable<Edge> edges, Map<NodeId, NodeId> aliases) throws IOException {
156 for (Edge edge : edges) {
|
| /external/opencv3/modules/imgproc/src/ |
| drawing.cpp | 62 std::vector<PolyEdge>& edges, const void* color, int line_type,
66 FillEdgeCollection( Mat& img, std::vector<PolyEdge>& edges, const void* color );
[all...] |
| /frameworks/minikin/tools/ |
| mk_hyb_file.py | 195 edges = Freelist()
202 edge_ix, cursor = edges.next(cursor)
205 all(edges.is_free(ix + s) for s in succ) and
206 ((not use_node) or edges.is_free(ix))):
209 ix, _ = edges.next(0)
219 edges.use(ix)
221 edges.use(ix + s)
|
| /external/opencv3/modules/cudalegacy/src/ |
| graphcuts.cpp | 59 void labelComponents(const PtrStepSzb& edges, PtrStepSzi comps, int flags, cudaStream_t stream);
62 void computeEdges(const PtrStepSzb& image, PtrStepSzb edges, const float4& lo, const float4& hi, cudaStream_t stream);
80 typedef void (*func_t)(const PtrStepSzb& image, PtrStepSzb edges, const float4& lo, const float4& hi, cudaStream_t stream);
|
| /external/antlr/antlr-3.4/runtime/Python/antlr3/ |
| dottreegen.py | 60 " $edges$\n" +
150 treeST.setAttribute("edges", edgeST)
|
| /external/skia/src/core/ |
| SkRegion_path.cpp | 452 edge++; // skip over "used" edges
505 SkTDArray<Edge> edges;
508 Edge* edge = edges.append(2);
513 int count = edges.count();
514 Edge* start = edges.begin();
|
| /external/skia/src/gpu/ |
| GrTessellator.cpp | 28 * 2) Build a mesh of edges connecting the vertices (build_edges()).
30 * 4) Simplify the mesh by inserting new vertices at intersecting edges (simplify()).
37 * Stages (4) and (5) use an active edge list, which a list of all edges for which the
39 * left-to-right based on the point where both edges are active (when both top vertices
41 * (shared), it's sorted based on the last point where both edges are active, so the
51 * neighbouring edges at the top or bottom vertex. This is handled by merging the
52 * edges (merge_collinear_edges()).
75 * that the "left" and "right" orientation in the code remains correct (edges to the left are
76 * increasing in Y; edges to the right are decreasing in Y). That is, the setting rotates 90
151 Edge* fFirstEdgeAbove; // Linked list of edges above this vertex
[all...] |
| /system/update_engine/payload_generator/ |
| inplace_generator.h | 86 // Cuts 'edges' from 'graph' according to the AU algorithm. This means
94 const std::set<Edge>& edges,
97 // Creates all the edges for the graph. Writers of a block point to
126 // Takes a |graph|, which has edges that must be cut, as listed in
127 // |cuts|. Cuts the edges. Maintains a list in which the operations
129 // |reverse_op_indexes|). Cutting edges requires scratch space, and
155 // and finding temp space to resolve broken edges.
|
| /packages/apps/Gallery2/src/com/android/gallery3d/ui/ |
| PositionController.java | 671 int edges = getImageAtEdges(); local
672 if ((velocityX > 0 && (edges & IMAGE_AT_LEFT_EDGE) != 0) ||
673 (velocityX < 0 && (edges & IMAGE_AT_RIGHT_EDGE) != 0)) {
676 if ((velocityY > 0 && (edges & IMAGE_AT_TOP_EDGE) != 0) ||
677 (velocityY < 0 && (edges & IMAGE_AT_BOTTOM_EDGE) != 0)) {
1217 int edges = 0; local
[all...] |
| /external/opencv3/modules/cudaimgproc/include/opencv2/ |
| cudaimgproc.hpp | 282 /** @brief Finds edges in an image using the @cite Canny86 algorithm.
285 @param edges Output edge map. It has the same size and type as image.
288 virtual void detect(InputArray image, OutputArray edges, Stream& stream = Stream::Null()) = 0;
292 @param edges Output edge map. It has the same size and type as image.
295 virtual void detect(InputArray dx, InputArray dy, OutputArray edges, Stream& stream = Stream::Null()) = 0;
|
| /external/bison/src/ |
| ielr.c | 125 edges rather than an array because it is possible that
127 that we could end up with redundant edges. With the
128 possibility of redundant edges, it's hard to know ahead of
242 * follow (that is, it's computed by internal and successor edges) of goto
245 * successor follow edges. \c edge_counts has not been updated.
286 fprintf (stderr, "always follow edges:\n");
346 goto_number **edges; local
351 &edges, &edge_counts);
352 ielr_compute_follow_kernel_items (ritem_sees_lookahead_set, edges,
356 ielr_compute_always_follows (&edges, edge_counts, always_followsp)
[all...] |
