HomeSort by relevance Sort by last modified time
    Searched refs:edges (Results 1 - 25 of 278) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /hardware/interfaces/tests/pointer/1.0/default/lib/
PointerHelper.cpp 11 g.edges.resize(1);
14 g.edges[0].left = &g.nodes[0];
15 g.edges[0].right = &g.nodes[1];
20 if(g.edges.size() != 1) return false;
23 if(g.edges[0].left != &g.nodes[0]) return false;
24 if(g.edges[0].right != &g.nodes[1]) return false;
29 ALOGI("%s Graph %p, %d nodes, %d edges", prefix, &g, (int)g.nodes.size(), (int)g.edges.size());
36 for(size_t i = 0; i < g.edges.size(); i++)
37 os << g.edges[i].left << " -> " << g.edges[i].right << ", "
    [all...]
  /frameworks/support/coordinatorlayout/src/main/java/androidx/coordinatorlayout/widget/
DirectedAcyclicGraph.java 81 ArrayList<T> edges = mGraph.get(node); local
82 if (edges == null) {
83 // If edges is null, we should try and get one from the pool and add it to the graph
84 edges = getEmptyList();
85 mGraph.put(node, edges);
88 edges.add(incomingEdge);
92 * Get any incoming edges from the given node.
94 * @return a list containing any incoming edges, or null if there are none.
102 * Get any outgoing edges for the given node (i.e. nodes which have an incoming edge
105 * @return a list containing any outgoing edges, or null if there are none
111 ArrayList<T> edges = mGraph.valueAt(i); local
131 ArrayList<T> edges = mGraph.valueAt(i); local
144 ArrayList<T> edges = mGraph.valueAt(i); local
184 final ArrayList<T> edges = mGraph.get(node); local
    [all...]
  /external/tensorflow/tensorflow/compiler/jit/graphcycles/
graphcycles_test.cc 40 typedef std::vector<Edge> Edges;
43 static bool IsReachable(Edges *edges, int from, int to,
47 for (int i = 0; i != edges->size(); i++) {
48 Edge *edge = &(*edges)[i];
53 IsReachable(edges, edge->to, to, seen)) {
68 static void PrintEdges(Edges *edges) {
69 LOG(INFO) << "EDGES (" << edges->size() << ")"
200 Edges edges; \/\/ from, to local
    [all...]
  /external/tensorflow/tensorflow/core/graph/
mkl_tfconversion_pass.cc 82 // Function scans the graph for candidate edges where we
208 // Get the input nodes and edges
209 std::vector<const Edge*> edges; local
210 TF_CHECK_OK(n->input_edges(&edges));
211 if (edges.size() != 4) {
219 CHECK_EQ(BaseType(edges[0]->src()->output_type(edges[0]->src_output())),
220 BaseType(edges[1]->src()->output_type(edges[1]->src_output())));
221 CHECK_EQ(BaseType(edges[0]->src()->output_type(edges[0]->src_output()))
    [all...]
mkl_tfconversion_pass_test.cc 74 std::vector<string> edges; local
80 for (const Edge* e : g->edges()) {
82 edges.push_back(strings::StrCat(EdgeId(e->src(), e->src_output()), "->",
88 std::sort(edges.begin(), edges.end());
90 str_util::Join(edges, ";"));
optimizer_cse_test.cc 70 std::vector<string> edges; local
76 for (const Edge* e : g->edges()) {
78 edges.push_back(strings::StrCat(EdgeId(e->src(), e->src_output()), "->",
84 std::sort(edges.begin(), edges.end());
86 str_util::Join(edges, ";"));
  /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/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/skia/src/gpu/effects/
GrConvexPolyEffect.cpp 47 "edges",
118 SkScalar edges[3 * kMaxEdges]; local
141 edges[3 * n] = v.fY;
142 edges[3 * n + 1] = -v.fX;
144 edges[3 * n] = -v.fY;
145 edges[3 * n + 1] = v.fX;
147 edges[3 * n + 2] = -(edges[3 * n] * pts[1].fX + edges[3 * n + 1] * pts[1].fY);
159 return Make(type, n, edges);
220 SkScalar edges[kMaxEdges * 3]; local
    [all...]
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 std::unique_ptr<GrFragmentProcessor>(new GrConvexPolyEffect(edgeType, n, edges));
51 * inverse filled, or has too many edges, this will return nullptr.
56 * Creates an effect that fills inside the rect with AA edges..
73 GrConvexPolyEffect(GrClipEdgeType edgeType, int n, const SkScalar edges[]);
  /external/skqp/src/gpu/effects/
GrConvexPolyEffect.cpp 47 "edges",
118 SkScalar edges[3 * kMaxEdges]; local
141 edges[3 * n] = v.fY;
142 edges[3 * n + 1] = -v.fX;
144 edges[3 * n] = -v.fY;
145 edges[3 * n + 1] = v.fX;
147 edges[3 * n + 2] = -(edges[3 * n] * pts[1].fX + edges[3 * n + 1] * pts[1].fY);
159 return Make(type, n, edges);
220 SkScalar edges[kMaxEdges * 3]; local
    [all...]
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 std::unique_ptr<GrFragmentProcessor>(new GrConvexPolyEffect(edgeType, n, edges));
51 * inverse filled, or has too many edges, this will return nullptr.
56 * Creates an effect that fills inside the rect with AA edges..
73 GrConvexPolyEffect(GrClipEdgeType edgeType, int n, const SkScalar edges[]);
  /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/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...]
cvsubdiv2.cpp 47 int i, j, total = subdiv->edges->total;
59 CvQuadEdge2D* edge = (CvQuadEdge2D*)cvGetSetElem(subdiv->edges,i);
114 // count number of edges in facet
166 int i, total = subdiv->edges->total;
173 CvQuadEdge2D *edge = (CvQuadEdge2D *) cvGetSetElem( subdiv->edges, i );
  /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/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/freetype/src/autofit/
afhints.c 108 AF_Edge edges; local
113 if ( !axis->edges )
115 axis->edges = axis->embedded.edges;
136 if ( axis->edges == axis->embedded.edges )
138 if ( FT_NEW_ARRAY( axis->edges, new_max ) )
140 ft_memcpy( axis->edges, axis->embedded.edges,
141 sizeof ( axis->embedded.edges ) );
292 AF_Edge edges = axis->edges; local
415 AF_Edge edges = axis->edges; local
553 AF_Edge edges = axis->edges; local
1262 AF_Edge edges = axis->edges; local
    [all...]
  /external/skia/samplecode/
SamplePathClip.cpp 74 static int clip_line(const SkRect& bounds, SkPoint p0, SkPoint p1, SkPoint edges[]) {
75 SkPoint* edgesStart = edges;
108 *edges++ = p0;
109 *edges++ = p1;
114 *edges++ = p0;
115 *edges++ = p1;
121 *edges++ = SkPoint::Make(bounds.left(), p0.fY);
122 *edges++ = SkPoint::Make(bounds.left(), y);
127 *edges++ = p0;
128 *edges++ = SkPoint::Make(bounds.right(), y)
    [all...]
  /external/skqp/samplecode/
SamplePathClip.cpp 74 static int clip_line(const SkRect& bounds, SkPoint p0, SkPoint p1, SkPoint edges[]) {
75 SkPoint* edgesStart = edges;
108 *edges++ = p0;
109 *edges++ = p1;
114 *edges++ = p0;
115 *edges++ = p1;
121 *edges++ = SkPoint::Make(bounds.left(), p0.fY);
122 *edges++ = SkPoint::Make(bounds.left(), y);
127 *edges++ = p0;
128 *edges++ = SkPoint::Make(bounds.right(), y)
    [all...]
  /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/
Graph.h 106 EdgeList edges; member in class:PBQP::Graph
123 assert(findEdge(e.getNode1(), e.getNode2()) == edges.end() &&
126 EdgeItr edgeItr = edges.insert(edges.end(), e);
157 /// This will clear the current graph, erasing any nodes and edges added,
188 /// \brief Get the number of edges in the graph.
189 /// @return Number of edges in the graph.
260 EdgeItr edgesBegin() { return edges.begin(); }
263 EdgeItr edgesEnd() { return edges.end(); }
267 /// @return Begin iterator for the set of edges connected to the given node
    [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/tensorflow/tensorflow/core/common_runtime/
memory_types.cc 77 for (const Edge* e : g->edges()) {
156 std::vector<Item> edges;
158 device_type, g, [g, &edges](const Edge* e, MemoryType sm, MemoryType dm) {
164 edges.push_back({e, sm, dm});
171 // edges contains edges in 'g' that memtype is not
176 if (!edges.empty()) {
178 for (const auto& item : edges) {

Completed in 627 milliseconds

1 2 3 4 5 6 7 8 91011>>