| /frameworks/support/design/src/android/support/design/widget/ |
| DirectedAcyclicGraph.java | 73 ArrayList<T> edges = mGraph.get(node); local
74 if (edges == null) {
75 // If edges is null, we should try and get one from the pool and add it to the graph
76 edges = getEmptyList();
77 mGraph.put(node, edges);
80 edges.add(incomingEdge);
84 * Get any incoming edges from the given node.
86 * @return a list containing any incoming edges, or null if there are none.
94 * Get any outgoing edges for the given node (i.e. nodes which have an incoming edge
97 * @return a list containing any outgoing edges, or null if there are none
103 ArrayList<T> edges = mGraph.valueAt(i); local
116 ArrayList<T> edges = mGraph.valueAt(i); local
129 ArrayList<T> edges = mGraph.valueAt(i); local
169 final ArrayList<T> edges = mGraph.get(node); local
[all...] |
| /external/v8/tools/gyp/tools/ |
| graphviz.py | 23 """Load the edges map from the dump file, and filter it to only
27 edges = json.load(file)
30 # Copy out only the edges we're interested in from the full edge list.
37 target_edges[src] = edges[src]
38 to_visit.extend(edges[src])
43 def WriteGraph(edges):
45 |edges| is a map of target to a list of other targets it depends on."""
49 for src, dst in edges.items():
58 # its file grouping before writing out any edges that may refer
78 # the edges between nodes
[all...] |
| /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/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/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/libgdx/gdx/src/com/badlogic/gdx/graphics/g3d/particles/values/ |
| PrimitiveSpawnShapeValue.java | 21 boolean edges = false; field in class:PrimitiveSpawnShapeValue
45 return edges;
48 public void setEdges (boolean edges) {
49 this.edges = edges;
89 edges = shape.edges;
101 json.writeValue("edges", edges);
110 edges = json.readValue("edges", boolean.class, jsonData)
[all...] |
| /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/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/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_tests/ |
| 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...] |
| 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))
|
| /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 );
|
| /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/WallpaperPicker/src/com/android/wallpaperpicker/ |
| CropView.java | 120 final RectF edges = mTempEdges; local
121 getEdgesHelper(edges);
124 float cropLeft = -edges.left / scale;
125 float cropTop = -edges.top / scale;
213 final RectF edges = mTempEdges; local
214 getEdgesHelper(edges);
216 mCenterX += Math.ceil(edges.left / scale);
296 final RectF edges = mTempEdges; local
297 getEdgesHelper(edges);
307 if (edges.left > 0)
[all...] |
| /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/opencv3/modules/cudaimgproc/test/ |
| test_canny.cpp | 86 cv::cuda::GpuMat edges; local
87 canny->detect(loadMat(img, useRoi), edges); local
92 EXPECT_MAT_SIMILAR(edges_gold, edges, 2e-2);
|
| /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/v8/tools/gyp/pylib/gyp/generator/ |
| dump_dependency_json.py | 76 edges = {}
83 if target in edges:
85 edges[target] = []
88 edges[target].append(dep)
97 json.dump(edges, f)
|
| /external/opencv3/modules/cudaimgproc/src/ |
| mssegmentation.cpp | 96 std::vector<Edge> edges; member in class:__anon20870::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...] |
| 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));
|
| /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...] |
| 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/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/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]);
|
