| /external/libgdx/extensions/gdx-bullet/jni/src/bullet/LinearMath/ |
| btConvexHullComputer.h | 51 const Edge* getNextEdgeOfVertex() const // clockwise list of all edges of a vertex
56 const Edge* getNextEdgeOfFace() const // counter-clockwise list of all edges of a face
71 // Edges of the output hull
72 btAlignedObjectArray<Edge> edges; member in class:btConvexHullComputer
74 // Faces of the convex hull. Each entry is an index into the "edges" array pointing to an edge of the face. Faces are planar n-gons
87 The output convex hull can be found in the member variables "vertices", "edges", "faces".
|
| btConvexHull.h | 132 short ea; // the other half of the edge (index into edges list)
145 btAlignedObjectArray<HalfEdge> edges; member in class:ConvexH
|
| /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/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...] |
| /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/guice/extensions/grapher/src/com/google/inject/grapher/ |
| DefaultEdgeCreator.java | 43 List<Edge> edges = Lists.newArrayList(); local
46 edges.addAll(binding.acceptTargetVisitor(visitor));
48 return edges;
52 * {@link BindingTargetVisitor} that adds edges to the graph based on the visited {@link Binding}.
62 * edges
|
| /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/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]);
|
| /frameworks/support/v17/leanback/src/android/support/v17/leanback/util/ |
| StateMachine.java | 179 // S: Set of all nodes with no incoming edges
181 HashMap<State, ArrayList<State>> edges = new HashMap<State, ArrayList<State>>(); local
185 edges.put(state, new ArrayList<State>(state.mPriorStates));
197 edges.entrySet().iterator(); iterator.hasNext();) {
204 // insert the toState to S if it has no more incoming edges
211 if (edges.size() > 0) {
|
| /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/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/libgdx/gdx/src/com/badlogic/gdx/math/ |
| DelaunayTriangulator.java | 36 private final IntArray edges = new IntArray();
field in class:DelaunayTriangulator
99 IntArray edges = this.edges;
local
100 edges.ensureCapacity(count / 2);
116 // If x,y lies inside the circumcircle of a triangle, the edges are stored and the triangle removed.
155 edges.add(p1);
156 edges.add(p2);
157 edges.add(p2);
158 edges.add(p3);
159 edges.add(p3);
[all...] |
| /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/CollisionShapes/ |
| btConvexPolyhedron.cpp | 104 btHashMap<btInternalVertexPair,btInternalEdge> edges; local
117 btInternalEdge* edptr = edges.find(vp);
148 edges.insert(vp,ed);
163 btInternalEdge* edptr = edges.find(vp);
|
| btPolyhedralConvexShape.cpp | 113 const btConvexHullComputer::Edge* firstEdge = &convexUtil->edges[face];
116 btVector3 edges[3]; local
132 edges[numEdges++] = newEdge;
142 faceNormals[i] = edges[0].cross(edges[1]);
|
| /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/opencv3/modules/cudaimgproc/perf/ |
| perf_hough.cpp | 242 cv::Mat edges; local
243 cv::Canny(image, edges, 50, 100);
253 const cv::cuda::GpuMat d_edges(edges);
272 TEST_CYCLE() alg->detect(edges, dx, dy, positions);
311 cv::Mat edges; local
312 cv::Canny(image, edges, 50, 100);
324 const cv::cuda::GpuMat d_edges(edges);
343 TEST_CYCLE() alg->detect(edges, dx, dy, positions);
|
| /external/opencv3/modules/cudaimgproc/src/ |
| mssegmentation.cpp | 96 std::vector<Edge> edges; member in class:__anon22312::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...] |
| /external/opencv3/modules/imgproc/src/ |
| gcgraph.hpp | 78 std::vector<Edge> edges; member in class:GCGraph
100 edges.reserve( edgeCount + 2 );
121 if( !edges.size() )
122 edges.resize( 2 );
128 vtcs[i].first = (int)edges.size();
129 edges.push_back( fromI );
134 vtcs[j].first = (int)edges.size();
135 edges.push_back( toI );
160 Edge *edgePtr = &edges[0];
261 // modify weights of the edges along the path and collect orphan
[all...] |
| /external/opencv3/samples/cpp/ |
| autofocus.cpp | 133 Mat edges; local
134 cvtColor(frame, edges, CV_BGR2GRAY);
135 GaussianBlur(edges, edges, Size(7, 7), 1.5, 1.5);
136 Canny(edges, edges, 0, 30, 3);
139 for (it = edges.begin<uchar>(), end = edges.end<uchar>(); it != end; ++it)
209 "Simple implementation of autofocus is based on edges detection.\n"
|
| /external/skia/src/gpu/effects/ |
| 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/runtime/C/include/ |
| antlr3collections.h | 409 * A vector of vectors of edges, built by calling the addEdge method()
414 pANTLR3_BITSET * edges; member in struct:ANTLR3_TOPO_struct
425 * as a stack and each time we descend a node to one of its edges we
435 * A flag that indicates the algorithm found a cycle in the edges
452 * One more than the largest node index that is contained in edges/sorted.
465 * while building these edges, it is perfectly OK to add nodes out of
466 * sequence. So, if you have edges:
|
| /external/antlr/antlr-3.4/runtime/C/src/ |
| antlr3collections.c | 2417 pANTLR3_BITSET edges; local
[all...] |
| /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...] |
