| /art/test/482-checker-loop-back-edge-use/ |
| info.txt | 2 at back edges.
|
| /external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/tool/templates/dot/ |
| dfa.st | 5 <edges; separator="\n">
|
| nfa.st | 5 <edges; separator="\n">
|
| /external/opencv3/samples/cpp/tutorial_code/ImgProc/ |
| Morphology_3.cpp | 94 // Extract edges and smooth image according to the logic
95 // 1. extract edges
96 // 2. dilate(edges)
99 // 5. smooth.copyTo(src, edges)
102 Mat edges; local
103 adaptiveThreshold(vertical, edges, 255, CV_ADAPTIVE_THRESH_MEAN_C, THRESH_BINARY, 3, -2);
104 imshow("edges", edges);
108 dilate(edges, edges, kernel)
[all...] |
| /external/chromium-trace/catapult/telemetry/third_party/altgraph/doc/ |
| graphstat.rst | 13 Groups the number of edges per node into *bin_num* bins
19 the mininum and maximum number of edges that get binned (that
21 and 10 edges get counted.
24 outgoing (``'out'``) edges. The default is to count the outgoing
25 edges.
|
| graph.rst | 8 represents a directed graph with *N* nodes and *E* edges.
10 .. class:: Graph([edges])
13 *edges* parameter is supplied, updates the graph by adding the
14 specified edges.
16 All of the elements in *edges* should be tuples with two or three
40 Hides a *node* from the graph. The incoming and outgoing edges of
50 edges of the node are also restored.
83 and incoming edges for the node.
101 Return the list of outgoing edges for *node*
105 Return the list of incoming edges for *node
[all...] |
| graphalgo.rst | 17 This code does not verify this property for all edges (only the edges examined until the end
19 edges, and will raise an exception if it discovers that a negative edge has caused it to make a mistake.
|
| /external/skia/src/gpu/effects/ |
| GrConvexPolyEffect.h | 31 * edges is a set of n edge equations where n is limited to kMaxEdges. It contains 3*n values.
32 * The edges should form a convex polygon. The positive half-plane is considered to be the
36 * Currently the edges are specified in device space. In the future we may prefer to specify
42 const SkScalar edges[]) {
46 return new GrConvexPolyEffect(edgeType, n, edges);
51 * inverse filled, or has too many edges, this will return nullptr. If offset is non-nullptr, then
58 * Creates an effect that fills inside the rect with AA edges..
73 GrConvexPolyEffect(GrPrimitiveEdgeType edgeType, int n, const SkScalar edges[]);
|
| GrConvexPolyEffect.cpp | 116 // The amount of coverage removed in x and y by the edges is computed as a pair of negative
194 "edges",
254 SkScalar edges[3 * kMaxEdges]; local
273 edges[3 * n] = v.fY;
274 edges[3 * n + 1] = -v.fX;
276 edges[3 * n] = -v.fY;
277 edges[3 * n + 1] = v.fX;
280 edges[3 * n + 2] = -(edges[3 * n] * p.fX + edges[3 * n + 1] * p.fY)
340 SkScalar edges[kMaxEdges * 3]; local
[all...] |
| /external/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph_tests/ |
| test_altgraph.py | 10 self.edges = [
16 # these are the edges
19 for head, tail in self.edges:
26 self.assertEqual(self.g.number_of_edges(), len(self.edges))
|
| test_dot.py | 37 edges = {}
39 edges[head] = {}
41 edges[head][tail] = {}
43 self.assertEqual(dot.edges[1], edges[1])
44 self.assertEqual(dot.edges, edges)
68 edges = {}
70 edges[head] = {}
73 edges[head][tail] = {'label': (head, tail)
[all...] |
| /external/opencv3/modules/imgproc/perf/ |
| perf_canny.cpp | 30 Mat edges(img.size(), img.type());
32 declare.in(img).out(edges);
34 TEST_CYCLE() Canny(img, edges, thresh_low, thresh_high, aperture, useL2);
36 SANITY_CHECK(edges);
|
| /external/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph/ |
| Graph.py | 21 The Graph class represents a directed graph with *N* nodes and *E* edges.
26 that operate on the outgoing, incoming or all edges of that node.
29 computed over the incoming edges (the number of neighbours linking to
33 orientation of the edges used in the method with respect to the node.
36 edges to traverse the graph (goes forward).
39 def __init__(self, edges=None):
45 self.nodes, self.edges = {}, {}
48 if edges is not None:
49 for item in edges:
61 return '<Graph: %d nodes, %d edges>' %
[all...] |
| /external/opencv3/doc/py_tutorials/py_imgproc/py_canny/ |
| py_canny.markdown | 34 Gradient direction is always perpendicular to edges. It is rounded to one of four angles
49 In short, the result you get is a binary image with "thin edges".
53 This stage decides which are all edges are really edges and which are not. For this, we need two
54 threshold values, minVal and maxVal. Any edges with intensity gradient more than maxVal are sure to
55 be edges and those below minVal are sure to be non-edges, so discarded. Those who lie between these
56 two thresholds are classified edges or non-edges based on their connectivity. If they are connected
57 to "sure-edge" pixels, they are considered to be part of edges. Otherwise, they are also discarded
[all...] |
| /external/opencv3/samples/cpp/tutorial_code/ImgTrans/ |
| HoughLines_Demo.cpp | 19 Mat src, edges;
53 Canny( src_gray, edges, 50, 200, 3 );
89 cvtColor( edges, standard_hough, COLOR_GRAY2BGR );
92 HoughLines( edges, s_lines, 1, CV_PI/180, min_threshold + s_trackbar, 0, 0 );
116 cvtColor( edges, probabilistic_hough, COLOR_GRAY2BGR );
119 HoughLinesP( edges, p_lines, 1, CV_PI/180, min_threshold + p_trackbar, 30, 10 );
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
| Graph.java | 32 /** A generic graph with edges; Each node as a single Object payload.
40 List<Node> edges; // points at which nodes? field in class:Graph.Node
45 if ( edges==null ) edges = new ArrayList<Node>();
46 if ( !edges.contains(n) ) edges.add(n);
99 if ( n.edges!=null ) {
100 for (Iterator it = n.edges.iterator(); it.hasNext();) {
|
| /external/testng/src/main/java/org/testng/internal/ |
| Tarjan.java | 62 String[] edges = new String[] { local
70 for (int i = 0; i < edges.length; i += 2) {
71 g.addPredecessor(edges[i], edges[i+1]);
|
| /external/opencv3/modules/cudalegacy/src/cuda/ |
| ccomponetns.cu | 129 enum Edges { UP = 1, DOWN = 2, LEFT = 4, RIGHT = 8, EMPTY = 0xF0 };
208 void computeEdges(const PtrStepSzb& image, PtrStepSzb edges, const float4& lo, const float4& hi, cudaStream_t stream)
216 computeConnectivity<T, Int_t><<<grid, block, 0, stream>>>(static_cast<const PtrStepSz<T> >(image), edges, inInt);
223 template void computeEdges<uchar> (const PtrStepSzb& image, PtrStepSzb edges, const float4& lo, const float4& hi, cudaStream_t stream);
224 template void computeEdges<uchar3> (const PtrStepSzb& image, PtrStepSzb edges, const float4& lo, const float4& hi, cudaStream_t stream);
225 template void computeEdges<uchar4> (const PtrStepSzb& image, PtrStepSzb edges, const float4& lo, const float4& hi, cudaStream_t stream);
226 template void computeEdges<ushort> (const PtrStepSzb& image, PtrStepSzb edges, const float4& lo, const float4& hi, cudaStream_t stream);
227 template void computeEdges<ushort3>(const PtrStepSzb& image, PtrStepSzb edges, const float4& lo, const float4& hi, cudaStream_t stream);
228 template void computeEdges<ushort4>(const PtrStepSzb& image, PtrStepSzb edges, const float4& lo, const float4& hi, cudaStream_t stream);
229 template void computeEdges<int> (const PtrStepSzb& image, PtrStepSzb edges, const float4& lo, const float4& hi, cudaStream_t stream)
[all...] |
| /external/guice/extensions/grapher/src/com/google/inject/grapher/ |
| EdgeCreator.java | 22 * Creator of graph edges to render. All edges will be rendered on the graph after node aliasing is
30 /** Returns edges for the given dependency graph. */
|
| /external/opencv3/samples/winrt_universal/VideoCaptureXAML/video_capture_xaml/video_capture_xaml.Shared/ |
| main.cpp | 119 Mat edges; local
120 cvtColor(frame, edges, COLOR_RGB2GRAY);
121 GaussianBlur(edges, edges, Size(7, 7), 1.5, 1.5);
122 Canny(edges, edges, 0, 30, 3);
123 cvtColor(edges, frame, COLOR_GRAY2RGB);
|
| /external/guice/extensions/grapher/test/com/google/inject/grapher/ |
| AbstractInjectorGrapherTest.java | 49 final Set<Edge> edges = Sets.newHashSet(); field in class:AbstractInjectorGrapherTest.FakeGrapher
53 edges.clear();
72 assertFalse(edges.contains(edge));
73 edges.add(edge);
77 assertFalse(edges.contains(edge));
78 edges.add(edge);
141 assertEquals(expectedEdges, grapher.edges);
166 assertEquals("wrong edges", expectedEdges, grapher.edges);
182 assertEquals(expectedEdges, grapher.edges);
[all...] |
| /external/opencv/cvaux/src/ |
| cvdpstereo.cpp | 110 uchar* edges = (uchar*)cvAlloc(sizeof(uchar)*imgW*imgH); local
160 edges[y*imgW] = edges[y*imgW+1] = edges[y*imgW+2] = 2;
161 edges[y*imgW+imgW-1] = edges[y*imgW+imgW-2] = edges[y*imgW+imgW-3] = 1;
164 edges[y*imgW+j] = 0;
169 edges[y*imgW+j] |= 1;
174 edges[y*imgW+j] |= 2
[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...] |
| /frameworks/base/packages/WallpaperCropper/src/com/android/wallpapercropper/ |
| CropView.java | 120 final RectF edges = mTempEdges; local
121 getEdgesHelper(edges);
124 float cropLeft = -edges.left / scale;
125 float cropTop = -edges.top / scale;
202 final RectF edges = mTempEdges; local
203 getEdgesHelper(edges);
205 mCenterX += Math.ceil(edges.left / scale);
285 final RectF edges = mTempEdges; local
286 getEdgesHelper(edges);
296 if (edges.left > 0)
[all...] |
| /packages/apps/Launcher3/WallpaperPicker/src/com/android/launcher3/ |
| CropView.java | 121 final RectF edges = mTempEdges; local
122 getEdgesHelper(edges);
125 float cropLeft = -edges.left / scale;
126 float cropTop = -edges.top / scale;
210 final RectF edges = mTempEdges; local
211 getEdgesHelper(edges);
213 mCenterX += Math.ceil(edges.left / scale);
297 final RectF edges = mTempEdges; local
298 getEdgesHelper(edges);
308 if (edges.left > 0)
[all...] |
