| /external/skqp/src/gpu/effects/ |
| D | GrConvexPolyEffect.cpp | 74 if (0 != memcmp(fPrevEdges, cpe.getEdges(), byteSize)) { in onSetData()
75 pdman.set3fv(fEdgeUniform, cpe.getEdgeCount(), cpe.getEdges()); in onSetData()
76 memcpy(fPrevEdges, cpe.getEdges(), byteSize); in onSetData()
|
| D | GrConvexPolyEffect.h | 70 const SkScalar* getEdges() const { return fEdges; } in getEdges() function
|
| /external/skia/src/gpu/effects/ |
| D | GrConvexPolyEffect.cpp | 74 if (0 != memcmp(fPrevEdges, cpe.getEdges(), byteSize)) { in onSetData()
75 pdman.set3fv(fEdgeUniform, cpe.getEdgeCount(), cpe.getEdges()); in onSetData()
76 memcpy(fPrevEdges, cpe.getEdges(), byteSize); in onSetData()
|
| D | GrConvexPolyEffect.h | 64 const SkScalar* getEdges() const { return fEdges; } in getEdges() function
|
| /external/guice/extensions/grapher/src/com/google/inject/grapher/ |
| D | EdgeCreator.java | 31 Iterable<Edge> getEdges(Iterable<Binding<?>> bindings); in getEdges() method
|
| D | DefaultEdgeCreator.java | 43 public Iterable<Edge> getEdges(Iterable<Binding<?>> bindings) { in getEdges() method in DefaultEdgeCreator
|
| D | AbstractInjectorGrapher.java | 114 createEdges(edgeCreator.getEdges(bindings), aliases); in graph()
|
| /external/s2-geometry-library-java/src/com/google/common/geometry/ |
| D | S2EdgeIndex.java | 384 private int[] getEdges(long cell1, long cell2) { in getEdges() method in S2EdgeIndex
436 int[] bounds = getEdges(parentCell.id(), parentCell.id()); in getEdgesInParentCells()
499 int[] bounds = getEdges(cell.rangeMin().id(), cell.rangeMax().id()); in getEdgesInChildrenCells()
506 bounds = getEdges(cell.id(), cell.id()); in getEdgesInChildrenCells()
|
| /external/llvm-project/llvm/lib/Analysis/ |
| D | DDG.cpp | 98 OS << (N.getEdges().empty() ? " Edges:none!\n" : " Edges:\n"); in operator <<()
99 for (auto &E : N.getEdges()) in operator <<()
284 assert(A.getEdges().size() == 1 && EdgeToFold.getTargetNode() == B && in mergeNodes()
|
| D | DependenceGraphBuilder.cpp | 395 if (N->getEdges().size() != 1) in simplify()
441 assert(Src.getEdges().size() == 1 && in simplify()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/ |
| D | DirectedGraph.h | 131 const EdgeListTy &getEdges() const { return Edges; } in getEdges() function
132 EdgeListTy &getEdges() { in getEdges() function
|
| /external/llvm-project/llvm/include/llvm/ADT/ |
| D | DirectedGraph.h | 131 const EdgeListTy &getEdges() const { return Edges; } in getEdges() function
132 EdgeListTy &getEdges() { in getEdges() function
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/ |
| D | DDG.cpp | 93 OS << (N.getEdges().empty() ? " Edges:none!\n" : " Edges:\n"); in operator <<()
94 for (auto &E : N.getEdges()) in operator <<()
|
| /external/testng/src/main/java/org/testng/internal/thread/graph/ |
| D | GraphThreadPoolExecutor.java | 44 throw new TestNGException("The graph of methods contains a cycle:" + graph.getEdges()); in GraphThreadPoolExecutor()
|
| /external/testng/src/main/java/org/testng/internal/ |
| D | DynamicGraph.java | 211 public ListMultiMap<T, T> getEdges() { in getEdges() method in DynamicGraph
|
| /external/llvm-project/llvm/unittests/ADT/ |
| D | DirectedGraphTest.cpp | 240 EXPECT_TRUE(N3.getEdges().empty()); in TEST()
|