Searched refs:edges (Results 1 – 11 of 11) sorted by relevance
73 ArrayList<T> edges = mGraph.get(node); in addEdge() local74 if (edges == null) { in addEdge()76 edges = getEmptyList(); in addEdge()77 mGraph.put(node, edges); in addEdge()80 edges.add(incomingEdge); in addEdge()103 ArrayList<T> edges = mGraph.valueAt(i); in getOutgoingEdges() local104 if (edges != null && edges.contains(node)) { in getOutgoingEdges()116 ArrayList<T> edges = mGraph.valueAt(i); in hasOutgoingEdges() local117 if (edges != null && edges.contains(node)) { in hasOutgoingEdges()129 ArrayList<T> edges = mGraph.valueAt(i); in clear() local[all …]
1505 final List<View> edges = mChildDag.getIncomingEdges(child); in getDependents() local1507 if (edges != null) { in getDependents()1508 mTempDependenciesList.addAll(edges); in getDependents()
120 final RectF edges = mTempEdges; in getCrop() local121 getEdgesHelper(edges); in getCrop()124 float cropLeft = -edges.left / scale; in getCrop()125 float cropTop = -edges.top / scale; in getCrop()202 final RectF edges = mTempEdges; in moveToLeft() local203 getEdgesHelper(edges); in moveToLeft()205 mCenterX += Math.ceil(edges.left / scale); in moveToLeft()285 final RectF edges = mTempEdges; in onTouchEvent() local286 getEdgesHelper(edges); in onTouchEvent()296 if (edges.left > 0) { in onTouchEvent()[all …]
195 edges = Freelist()202 edge_ix, cursor = edges.next(cursor)205 all(edges.is_free(ix + s) for s in succ) and206 ((not use_node) or edges.is_free(ix))):209 ix, _ = edges.next(0)219 edges.use(ix)221 edges.use(ix + s)
1377 public boolean isEdgeTouched(int edges) { in isEdgeTouched() argument1380 if (isEdgeTouched(edges, i)) { in isEdgeTouched()1397 public boolean isEdgeTouched(int edges, int pointerId) { in isEdgeTouched() argument1398 return isPointerDown(pointerId) && (mInitialEdgesTouched[pointerId] & edges) != 0; in isEdgeTouched()
329 int[] edges = new int[sorted.length]; in getEndEdges() local333 edges[i] = sorted[i][0].getLeft(); in getEndEdges()337 edges[i] = sorted[i][sorted[i].length - 1].getRight(); in getEndEdges()342 edges[i] = sorted[i][sorted[i].length - 1].getBottom(); in getEndEdges()345 return edges; in getEndEdges()348 protected void verifyEdgesSame(int[] edges, int[] edges2) { in verifyEdgesSame() argument349 assertEquals(edges.length, edges2.length); in verifyEdgesSame()350 for (int i = 0; i < edges.length; i++) { in verifyEdgesSame()351 assertEquals(edges[i], edges2[i]); in verifyEdgesSame()
1597 # from the root by following a path via at most 3 edges will be shown. Nodes1608 # enabling this option may lead to badly anti-aliased labels on the edges of
1869 # from the root by following a path via at most 3 edges will be shown. Nodes1880 # enabling this option may lead to badly anti-aliased labels on the edges of
2259 # root by following a path via at most 3 edges will be shown. Nodes that lay2274 # badly anti-aliased labels on the edges of a graph (i.e. they become hard to
2268 # root by following a path via at most 3 edges will be shown. Nodes that lay2283 # badly anti-aliased labels on the edges of a graph (i.e. they become hard to
META-INF/ META-INF/MANIFEST.MF android/ android/databinding/ android/ ...