| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/tool/templates/dot/ |
| dot.stg | 33 dfa(decisionRanks,states,edges,rankdir,startState,useBox) ::= <<
38 <edges; separator="\n">
42 nfa(decisionRanks,states,edges,rankdir,startState) ::= <<
47 <edges; separator="\n">
|
| /external/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph/ |
| Dot.py | 23 edges = [ (1,2), (1,3), (3,4), (3,5), (4,5), (5,4) ]
24 graph = Graph.Graph(edges)
56 valid :command:`dot` parameters for the nodes and edges. For a list of all
136 # self.edges: edge styles
137 self.nodes, self.edges = {}, {}
165 if head not in self.edges:
166 self.edges[head] = {}
167 self.edges[head][tail] = {}
195 if node not in self.edges:
196 self.edges[node] = {
[all...] |
| /external/llvm/test/Transforms/Mem2Reg/ |
| 2003-04-24-MultipleIdenticalSuccessors.ll | 2 ; multiple incoming edges from a block.
|
| /external/skia/samplecode/ |
| SamplePathClip.cpp | 78 static int clip_line(const SkRect& bounds, SkPoint p0, SkPoint p1, SkPoint edges[]) {
79 SkPoint* edgesStart = edges;
112 *edges++ = p0;
113 *edges++ = p1;
118 *edges++ = p0;
119 *edges++ = p1;
125 *edges++ = SkPoint::Make(bounds.left(), p0.fY);
126 *edges++ = SkPoint::Make(bounds.left(), y);
131 *edges++ = p0;
132 *edges++ = SkPoint::Make(bounds.right(), y)
[all...] |
| /external/freetype/src/autofit/ |
| afhints.c | 107 AF_Edge edges; local
112 if ( axis->edges == NULL )
114 axis->edges = axis->embedded.edges;
135 if ( axis->edges == axis->embedded.edges )
137 if ( FT_NEW_ARRAY( axis->edges, new_max ) )
139 ft_memcpy( axis->edges, axis->embedded.edges,
140 sizeof ( axis->embedded.edges ) );
304 AF_Edge edges = axis->edges; local
434 AF_Edge edges = axis->edges; local
1112 AF_Edge edges = axis->edges; local
[all...] |
| afcjk.c | 931 /* We begin by generating a sorted table of edges for the current */
940 /* Note that the edges table is sorted along the segment/edge */
962 AF_Edge edge = axis->edges + ee;
1064 AF_Edge edges = axis->edges; local
1065 AF_Edge edge_limit = edges + axis->num_edges;
1069 for ( edge = edges; edge < edge_limit; edge++ )
1082 for ( edge = edges; edge < edge_limit; edge++ )
1717 AF_Edge edges = axis->edges; local
2096 AF_Edge edges = axis->edges; local
[all...] |
| aflatin.c | 1667 AF_Edge edges = axis->edges; local
2298 AF_Edge edges = axis->edges; local
[all...] |
| /external/opencv/cvaux/src/ |
| decomppoly.cpp | 261 // this edge intersects some other initial edges
328 int* edges,
344 if( edges[ mainEdgeIdx * 2 ] == vtxIdx ) {
347 x0_end = contour[ edges[ mainEdgeIdx * 2 + 1 ] ].x;
348 y0_end = contour[ edges[ mainEdgeIdx * 2 + 1 ] ].y;
353 //x0 = contour[ edges[ mainEdgeIdx * 2 ] ].x;
354 //y0 = contour[ edges[ mainEdgeIdx * 2 ] ].y;
359 x0_end = contour[ edges[ mainEdgeIdx * 2 ] ].x;
360 y0_end = contour[ edges[ mainEdgeIdx * 2 ] ].y;
368 ( edges[ i * 2 ] == vtxIdx || edges[ i * 2 + 1 ] == vtxIdx )
[all...] |
| /external/opencv3/modules/cudaimgproc/src/ |
| mssegmentation.cpp | 96 std::vector<Edge> edges; member in class:__anon21474::Graph
182 Graph<T>::Graph(int numv_, int nume_max_) : start(numv_, -1), edges(nume_max_)
193 edges[nume] = Edge(to, start[from], val);
321 for (int e_it = g.start[v]; e_it != -1; e_it = g.edges[e_it].next)
324 int c2 = comps.find(g.edges[e_it].to);
325 if (c1 != c2 && g.edges[e_it].val.dr < hr && g.edges[e_it].val.dsp < hsp)
330 std::vector<SegmLink> edges; local
331 edges.reserve(g.numv);
333 // Prepare edges connecting differnet component
[all...] |
| generalized_hough.cpp | 61 int buildEdgePointList_gpu(PtrStepSzb edges, PtrStepSzb dx, PtrStepSzb dy, unsigned int* coordList, float* thetaList);
110 void setTemplateImpl(InputArray edges, InputArray dx, InputArray dy, Point templCenter);
113 void detectImpl(InputArray edges, InputArray dx, InputArray dy, OutputArray positions, OutputArray votes);
115 void buildEdgePointList(const GpuMat& edges, const GpuMat& dx, const GpuMat& dy);
144 void calcEdges(InputArray src, GpuMat& edges, GpuMat& dx, GpuMat& dy);
180 void GeneralizedHoughBase::calcEdges(InputArray _src, GpuMat& edges, GpuMat& dx, GpuMat& dy)
193 ensureSizeIsEnough(src.size(), CV_8UC1, edges);
197 canny_->detect(dx, dy, edges);
220 void GeneralizedHoughBase::setTemplateImpl(InputArray edges, InputArray dx, InputArray dy, Point templCenter)
222 edges.getGpuMat().copyTo(templEdges_)
[all...] |
| canny.cpp | 79 void detect(InputArray image, OutputArray edges, Stream& stream);
80 void detect(InputArray dx, InputArray dy, OutputArray edges, Stream& stream);
114 void CannyCaller(GpuMat& edges, Stream& stream);
144 GpuMat edges = _edges.getGpuMat();
167 CannyCaller(edges, stream);
188 GpuMat edges = _edges.getGpuMat();
192 CannyCaller(edges, stream);
218 void CannyImpl::CannyCaller(GpuMat& edges, Stream& stream)
227 canny::getEdges(map_, edges, StreamAccessor::getStream(stream));
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/lib/gcc/x86_64-w64-mingw32/4.8.3/plugin/include/ |
| cfg-flags.def | 1 /* Flags on basic blocks and edges.
21 edges. Source files define DEF_BASIC_BLOCK_FLAG or DEF_EDGE_FLAG
109 edges are fallthru edges. In cfgrtl mode, this flag really means
119 ABNORMAL_CALL edges also have ABNORMAL set.
123 /* Exception edge. Exception handling edges represent possible control
125 EH edges also have ABNORMAL set for the RTL CFG. */
129 to prevent merging away edges to the post-landing-pad basic block.
138 /* A back edge, marked in a depth-first search of the CFG. Back edges
162 SIBCALL edges also have ABNORMAL set
[all...] |
| /external/replicaisland/tools/ |
| ExtractPoints.js | 20 * each path in the current document and generates a list of edges and normals
53 // Walk the list of paths and extract edges and normals. Store these in
67 tile.edges = new Array();
111 tile.edges.push(edge);
138 // For each tile print the edges to a string.
142 for (var y = 0; y < tile.edges.length; y++) {
143 var edge = tile.edges[y];
191 // Render the edges and normals to the new document.
195 // draw the edges to make sure everything works
224 for (var y = 0; y < tile.edges.length; y++)
[all...] |
| /external/opencv3/modules/imgproc/src/ |
| generalized_hough.cpp | 69 void setTemplateImpl(InputArray edges, InputArray dx, InputArray dy, Point templCenter);
72 void detectImpl(InputArray edges, InputArray dx, InputArray dy, OutputArray positions, OutputArray votes);
97 void calcEdges(InputArray src, Mat& edges, Mat& dx, Mat& dy);
110 void GeneralizedHoughBase::calcEdges(InputArray _src, Mat& edges, Mat& dx, Mat& dy)
117 Canny(src, edges, cannyLowThresh_, cannyHighThresh_);
135 void GeneralizedHoughBase::setTemplateImpl(InputArray edges, InputArray dx, InputArray dy, Point templCenter)
137 edges.getMat().copyTo(templEdges_);
179 void GeneralizedHoughBase::detectImpl(InputArray edges, InputArray dx, InputArray dy, OutputArray positions, OutputArray votes)
181 edges.getMat().copyTo(imageEdges_);
335 void setTemplate(InputArray edges, InputArray dx, InputArray dy, Point templCenter) { setTemplateImpl(edges, dx, dy, templCenter);
[all...] |
| /external/opencv3/doc/py_tutorials/py_imgproc/py_filtering/ |
| py_filtering.markdown | 16 in finding edges in the images.
50 removing noises. It actually removes high frequency content (eg: noise, edges) from the image. So
51 edges are blurred a little bit in this operation. (Well, there are blurring techniques which doesn't
52 blur the edges too). OpenCV provides mainly four types of blurring techniques.
124 **cv2.bilateralFilter()** is highly effective in noise removal while keeping edges sharp. But the
129 not. So it blurs the edges also, which we don't want to do.
134 similar intensity to central pixel is considered for blurring. So it preserves the edges since
135 pixels at edges will have large intensity variation.
145 See, the texture on the surface is gone, but edges are still preserved.
|
| /external/chromium-trace/catapult/telemetry/third_party/altgraph/doc/ |
| graphutil.rst | 13 with *node_num* nodes randomly connected by *edge_num* edges.
15 When *self_loops* is present and True there can be edges that point from
18 When *multi_edge* is present and True there can be duplicate edges.
|
| /external/opencv3/doc/tutorials/introduction/windows_visual_studio_image_watch/ |
| windows_visual_studio_image_watch.markdown | 73 cout << "Detecting edges in input image" << endl;
74 Mat edges;
75 Canny(input, edges, 10, 100);
92 Mat edges;
125 *edges*.
133 Note that the second image in the list, *edges*, is shown as "invalid". This indicates that some
135 width). This is expected at this point in the program, since the C++ constructor for *edges* has not
140 pixels change: if you step once, over the *Mat edges;* statement, the *edges* image will change from
146 *edges* image into the viewer by selecting it in the *Image List* and zoom into a region with
[all...] |
| /external/skia/src/gpu/batches/ |
| GrPLSPathRenderer.h | 29 * Our approach is complicated by the need to perform antialiasing on straight edges as well,
33 * not. This gives us MSAA4 edges on triangles which line up nicely with no seams. We similarly face
34 * problems on the back (flat) edges of quads, where we have to ensure that the back edge is
|
| /external/llvm/lib/Transforms/Instrumentation/ |
| PGOInstrumentation.cpp | 18 // those edges not on the spanning tree. Knuth proves this method instruments
19 // the minimum number of edges.
22 // edges have higher frequencies (more likely to execute). The idea is to
23 // instrument those less frequently executed edges to reduce the runtime
77 STATISTIC(NumOfPGOInstrument, "Number of edges instrumented.");
78 STATISTIC(NumOfPGOEdge, "Number of edges.");
171 // This class implements the CFG edges. Note the CFG can be a multi-graph.
172 // So there might be multiple edges with same SrcBB and DestBB.
203 // This class implements the CFG edges. Note the CFG can be a multi-graph.
225 // Dump edges and BB information
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| EdgeBundles.h | 1 //===-------- EdgeBundles.h - Bundles of CFG edges --------------*- c++ -*-===//
10 // The EdgeBundles analysis forms equivalence classes of CFG edges such that all
11 // edges leaving a machine basic block are in the same bundle, and all edges
|
| /external/llvm/test/Analysis/Dominators/ |
| 2006-10-02-BreakCritEdges.ll | 1 ; RUN: opt < %s -domtree -break-crit-edges -analyze -domtree | FileCheck %s
|
| /external/llvm/test/Transforms/JumpThreading/ |
| degenerate-phi.ll | 5 ; "%phi = phi i16" when it removes all edges leading to %unreachable.
|
| /external/opencv3/samples/cpp/tutorial_code/ImgTrans/ |
| Laplace_Demo.cpp | 3 * @brief Sample code showing how to detect edges using the Laplace operator
|
| /frameworks/base/packages/SystemUI/res/values-xhdpi/ |
| dimens.xml | 21 <!-- Fraction value to smooth the edges of the battery icon. The path will be inset by this
|
| /frameworks/base/packages/SystemUI/res/values-xxhdpi/ |
| dimens.xml | 21 <!-- Fraction value to smooth the edges of the battery icon. The path will be inset by this
|
