| /external/rust/crates/plotters-backend/src/rasterizer/ |
| D | polygon.rs | 6 struct Edge { struct
13 impl Edge { argument
14 fn horizontal_sweep(mut from: BackendCoord, mut to: BackendCoord) -> Option<Edge> { in horizontal_sweep()
31 fn vertical_sweep(from: BackendCoord, to: BackendCoord) -> Option<Edge> { in vertical_sweep()
50 impl PartialOrd for Edge { implementation
56 impl PartialEq for Edge { implementation
62 impl Eq for Edge {} implementation
64 impl Ord for Edge { implementation
|
| /external/skia/src/gpu/ganesh/geometry/ |
| D | GrTriangulator.h | 392 struct GrTriangulator::Edge { struct
393 Edge(Vertex* top, Vertex* bottom, int winding, EdgeType type) in Edge() function
417 EdgeType fType; argument
418 Edge* fLeft; // The linked list of edges in the active edge list. argument
419 Edge* fRight; // " argument
420 Edge* fPrevEdgeAbove; // The linked list of edges in the bottom Vertex's "edges above". argument
421 Edge* fNextEdgeAbove; // " argument
422 Edge* fPrevEdgeBelow; // The linked list of edges in the top Vertex's "edges below". argument
423 Edge* fNextEdgeBelow; // " argument
426 Edge* fLeftPolyPrev; argument
[all …]
|
| /external/swiftshader/third_party/SPIRV-Tools/source/opt/ |
| D | propagator.h | 33 struct Edge { struct
34 Edge(BasicBlock* b1, BasicBlock* b2) : source(b1), dest(b2) { in Edge() argument
40 bool operator<(const Edge& o) const { argument
|
| /external/angle/third_party/vulkan-deps/spirv-tools/src/source/opt/ |
| D | propagator.h | 33 struct Edge { struct
34 Edge(BasicBlock* b1, BasicBlock* b2) : source(b1), dest(b2) { in Edge() function
40 bool operator<(const Edge& o) const { argument
|
| /external/deqp-deps/SPIRV-Tools/source/opt/ |
| D | propagator.h | 33 struct Edge { struct
34 Edge(BasicBlock* b1, BasicBlock* b2) : source(b1), dest(b2) { in Edge() function
40 bool operator<(const Edge& o) const { argument
|
| /external/tensorflow/tensorflow/lite/delegates/gpu/common/memory_management/ |
| D | min_cost_flow_assignment.cc | 145 struct Edge { struct in tflite::gpu::__anon7795d4aa0111::MinCostFlowSolver
146 Edge(size_t dst, int cap, int cost) : dst(dst), cap(cap), cost(cost) {} in Edge() function
148 size_t dst;
149 int cap;
150 int cost;
|
| /external/skia/src/core/ |
| D | SkRegion_path.cpp | 391 struct Edge { struct
402 Edge* fNext; argument
419 static void find_link(Edge* base, Edge* stop) { in find_link() argument
|
| /external/ow2-asm/asm/src/main/java/org/objectweb/asm/ |
| D | Edge.java | 40 final class Edge { class
86 Edge(final int info, final Label successor, final Edge nextEdge) { in Edge() method in Edge
|
| /external/guice/extensions/grapher/src/com/google/inject/grapher/ |
| D | Edge.java | 27 public abstract class Edge { class
31 protected Edge(NodeId fromId, NodeId toId) { in Edge() method in Edge
|
| /external/tensorflow/tensorflow/core/grappler/ |
| D | graph_view.h | 96 struct Edge { struct
97 Edge(OutputPort s, InputPort d) : src(s), dst(d) {} in Edge() function
104 friend H AbslHashValue(H h, const Edge& e) { in AbslHashValue() argument
108 OutputPort src;
109 InputPort dst;
|
| /external/tensorflow/tensorflow/compiler/tf2xla/ |
| D | resource_util.cc | 86 absl::flat_hash_map<const Edge*, ResourceUsageAnalysis::NodeInfo>* in PropagateFromStackOrTensorArraySourceOp()
102 absl::flat_hash_map<const Edge*, ResourceUsageAnalysis::NodeInfo>* in PropagateFromArgOp()
137 absl::flat_hash_map<const Edge*, ResourceUsageAnalysis::NodeInfo>* in UpdateResourceUsageFromFunctionBodyAnalysis()
186 absl::flat_hash_map<const Edge*, ResourceUsageAnalysis::NodeInfo>* in PropagateThroughCallOp()
229 absl::flat_hash_map<const Edge*, ResourceUsageAnalysis::NodeInfo>* in PropagateThroughIdentityOp()
|
| /external/compiler-rt/lib/sanitizer_common/ |
| D | sanitizer_deadlock_detector.h | 396 struct Edge { struct
410 Edge edges_[BV::kSize * 32]; argument
|
| /external/rust/crates/bindgen/ir/ |
| D | traversal.rs | 15 pub struct Edge { struct
17 kind: EdgeKind, argument
20 impl Edge { argument
22 pub fn new(to: ItemId, kind: EdgeKind) -> Edge { in new()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/LTO/ |
| D | SummaryBasedOptimizations.cpp | 51 auto GetCallSiteRelFreq = [](FunctionSummary::EdgeTy &Edge) { in computeSyntheticCounts()
74 auto GetProfileCount = [&](ValueInfo V, FunctionSummary::EdgeTy &Edge) { in computeSyntheticCounts()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/IR/ |
| D | ModuleSummaryIndex.cpp | 269 struct Edge { struct
270 uint64_t SrcMod;
271 int Hotness;
272 GlobalValue::GUID Src;
273 GlobalValue::GUID Dst;
|
| /external/truth/core/src/test/java/com/google/common/truth/ |
| D | GraphMatchingTest.java | 352 private class Edge { class in GraphMatchingTest.TestInstance.Matching
358 Edge() { in Edge() method in GraphMatchingTest.TestInstance.Matching.Edge
364 Edge(Edge other) { in Edge() method in GraphMatchingTest.TestInstance.Matching.Edge
|
| /external/rappor/analysis/cpp/ |
| D | find_cliques.cc | 111 struct Edge { struct
123 int operator() (const Edge& edge) const { in operator ()() argument
|
| /external/ComputeLibrary/arm_compute/graph/ |
| D | INode.h | 41 class Edge; variable
|
| D | Edge.h | 51 …Edge(EdgeID id, INode *producer, unsigned int producer_idx, INode *consumer, unsigned int consumer… in Edge() function
|
| /external/llvm/lib/IR/ |
| D | GCOV.cpp | 185 GCOVEdge *Edge = Edges.back().get(); in readGCNO() local
409 for (const GCOVEdge *Edge : SrcEdges) in dump() local
415 for (const GCOVEdge *Edge : DstEdges) in dump() local
725 for (const GCOVEdge *Edge : Block.dsts()) { in printBranchInfo() local
|
| /external/pdfium/xfa/fwl/ |
| D | fwl_widgethit.h | 28 Edge, enumerator
|
| /external/skia/tests/ |
| D | TriangulatingPathRendererTests.cpp | 940 struct Edge { struct
941 Edge reverse() const { return {fP1, fP0}; } in reverse() argument
945 static bool operator<(const Edge& a, const Edge& b) { in operator <() argument
|
| /external/llvm/include/llvm/Analysis/ |
| D | LazyCallGraph.h | 912 inline LazyCallGraph::Edge::Edge() : Value() {} in Edge() function
913 inline LazyCallGraph::Edge::Edge(Function &F, Kind K) : Value(&F, K) {} in Edge() function
914 inline LazyCallGraph::Edge::Edge(Node &N, Kind K) : Value(&N, K) {} in Edge() function
|
| D | BranchProbabilityInfo.h | 125 typedef std::pair<const BasicBlock *, unsigned> Edge; typedef
|
| /external/perfetto/src/trace_processor/importers/memory_tracker/ |
| D | graph.cc | 24 using Edge = GlobalNodeGraph::Edge; typedef
186 Edge::Edge(Node* source, Node* target, int priority) in Edge() function in perfetto::trace_processor::Edge
|