| /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/JavaScript/ |
| JavaScript.stg | 827 dfaState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
829 <edges; separator="\nelse ">
848 dfaOptionalBlockState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
850 <edges; separator="\nelse ">
859 dfaLoopbackState(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
861 <edges; separator="\nelse "><\n>
863 <if(!edges)>
864 alt<decisionNumber>=<eotPredictsAlt>; <! if no edges, don't gen ELSE !>
891 dfaStateSwitch(k,edges,eotPredictsAlt,description,stateNumber,semPredState) ::= <<
893 <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/clang/lib/Analysis/ |
| ThreadSafetyTIL.cpp | 182 // following back-edges. The dominator is serialized before any predecessors,
188 // critical edges, and (3) the entry block is reachable from the exit block
189 // and no blocks are accessable via traversal of back-edges from the exit that
190 // weren't accessable via forward edges from the entry.
213 // Skip back-edges
240 // Skip back-edges
|
| CallGraph.cpp | 25 STATISTIC(NumObjCCallEdges, "Number of Objective-C method call edges");
26 STATISTIC(NumBlockCallEdges, "Number of block call edges");
67 // Adds may-call edges for the ObjC message sends.
|
| /external/freetype/src/cff/ |
| cf2blues.c | 150 * Construct hint edges suitable for synthetic ghost hints at top
213 /* adjust both edges of top zone upward by twice darkening amount */
342 /* adjust edges of top zone upward by twice darkening amount */
450 * Zero, one or both edges may be valid; only valid edges can be
561 /* move both edges and flag them `locked' */
|
| /external/mesa3d/src/mesa/program/ |
| register_allocate.c | 34 * edges in the graph between nodes that interfere (can't be allocated
37 * During the "simplify" process, any any node with fewer edges than
40 * pushed on a stack and removed (with its edges) from the graph.
44 * stack, their edges restored, and assigned a color different from
63 * basic graph coloring test of "fewer edges from this node than there
512 * "count number of edges" approach of traditional graph coloring,
|
| /external/pdfium/third_party/freetype/src/cff/ |
| cf2blues.c | 150 * Construct hint edges suitable for synthetic ghost hints at top
213 /* adjust both edges of top zone upward by twice darkening amount */
342 /* adjust edges of top zone upward by twice darkening amount */
450 * Zero, one or both edges may be valid; only valid edges can be
561 /* move both edges and flag them `locked' */
|
| /external/valgrind/auxprogs/ |
| DotToScc.hs | 34 = do edges <- read_dot_file dot_file_name
35 let sccs = gen_sccs edges
52 -- Read a .dot file and return a list of edges
57 let edges = [(s,d) | Just (s,d) <- map maybe_mk_edge linez]
58 return edges
69 -- Take the list of edges and return a topologically sorted list of
|
| /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/tool/src/main/java/org/antlr/codegen/ |
| ACyclicDFACodeGenerator.java | 63 // the default templates for generating a state and its edges
150 dfaST.add("edges", edgeST);
184 dfaST.add("edges", edgeST);
|
| /external/llvm/include/llvm/CodeGen/ |
| ScheduleDAG.h | 91 /// models may provide additional information about specific edges.
97 /// have null SDep edges.
207 /// considered DAG edges for height computation and other heuristics, but do
233 /// only valid on Data, Anti, and Output edges. On Data edges, this
242 /// only valid on Data, Anti, and Output edges. On Anti and Output
243 /// edges, this value must not be zero. On Data edges, the value may
373 /// BoundaryNodes can have DAG edges, including Data edges, but they do no
[all...] |
| /external/opencv3/doc/tutorials/features2d/trackingmotion/harris_detector/ |
| harris_detector.markdown | 29 - Edges
37 - Because, since it is the intersection of two edges, it represents a point in which the
38 directions of these two edges *change*. Hence, the gradient of the image (in both directions)
|
| /external/opencv3/doc/tutorials/imgproc/imgtrans/sobel_derivatives/ |
| sobel_derivatives.markdown | 22 detect the *edges* present in the image. For instance:
40 -# So, from the explanation above, we can deduce that a method to detect edges in an image can be
107 - Applies the *Sobel Operator* and generates as output an image with the detected *edges*
|
| /packages/apps/Dialer/InCallUI/res/values/ |
| dimens.xml | 36 <!-- Padding at the left and right edges of the "call banner". -->
38 <!-- Padding at the top and bottom edges of the "call banner". -->
44 <!-- Padding at the top and bottom edges of the "provider information" -->
|
| /development/samples/ApiDemos/res/layout/ |
| overscan_activity.xml | 20 of the top-level view may be obscured around the edges by the display, leaving the
|
| /external/androidplot/AndroidPlot-Core/src/main/java/com/androidplot/ui/ |
| SizeMetrics.java | 78 * Same as getRectF but with edges rounded to the nearest full pixel.
|
| /external/chromium-trace/catapult/telemetry/third_party/altgraph/doc/ |
| dot.rst | 27 edges = [ (1,2), (1,3), (3,4), (3,5), (4,5), (5,4) ]
28 graph = Graph.Graph(edges)
62 valid :command:`dot` parameters for the nodes and edges. For a list of all
126 add edges to the dot file unless both the head and tail of the edge
|
| /external/chromium-trace/catapult/tracing/docs/ |
| coordinate-systems.md | 22 padding so the edges of boxes do not sit against the edge of the world. For
|
| /external/deqp/doc/testspecs/GLES31/ |
| functional.tessellation.txt | 43 + Test for absence of cracks at shared edges of primitives
83 segment length growth, and the requirement that two edges with identical clamped
132 mode) that have shared edges, and check that no cracks appear at the edges. For
|
| /external/freetype/src/autofit/ |
| afcjk.h | 80 FT_Pos edge_distance_threshold; /* used for creating edges */
|
| /external/guice/extensions/grapher/src/com/google/inject/grapher/graphviz/ |
| GraphvizEdge.java | 25 * Data object to encapsulate the attributes of Graphviz edges that we're
|
| /external/llvm/include/llvm/Analysis/ |
| BlockFrequencyInfoImpl.h | 203 ExitMap Exits; ///< Successor edges (and weights).
274 /// there are no irreducible edges to Node, then it will have complexity
322 /// All edges in the original function are 32-bit. However, exit edges from
367 /// Combines multiple edges to the same \a Weight::TargetNode and scales
389 /// \brief Add all edges out of a packaged loop to the distribution.
391 /// Adds all edges from LocalLoopHead to Dist. Calls addToDist() to add each
541 /// graphs for most edges, but getting others from \a LoopData::ExitMap. The
557 std::deque<const IrrNode *> Edges;
561 iterator pred_begin() const { return Edges.begin();
[all...] |
