| /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 | 406 struct GrTriangulator::Edge { struct
407 Edge(Vertex* top, Vertex* bottom, int winding, EdgeType type) in Edge() function
431 EdgeType fType; argument
432 Edge* fLeft; // The linked list of edges in the active edge list. argument
433 Edge* fRight; // " argument
434 Edge* fPrevEdgeAbove; // The linked list of edges in the bottom Vertex's "edges above". argument
435 Edge* fNextEdgeAbove; // " argument
436 Edge* fPrevEdgeBelow; // The linked list of edges in the top Vertex's "edges below". argument
437 Edge* fNextEdgeBelow; // " argument
440 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() 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/angle/third_party/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/swiftshader/third_party/llvm-16.0/llvm/lib/Transforms/Utils/ |
| D | SampleProfileInference.cpp | 113 for (auto &Edge : Edges[Src]) { in run() local
163 for (const auto &Edge : Edges[Src]) { in getFlow() local
173 for (const auto &Edge : Edges[Src]) { in getFlow() local
220 auto &Edge = Edges[Pred][Nodes[Now].ParentEdgeIndex]; in computeAugmentingPathCapacity() local
270 auto &Edge = Edges[Src][EdgeIdx]; in findAugmentingPath() local
298 auto &Edge = Edges[Pred][Nodes[Now].ParentEdgeIndex]; in augmentFlowAlongPath() local
346 auto &Edge = Edges[NodeIdx][EdgeIdx]; in findAugmentingDAG() local
386 for (auto &Edge : Edges[Src]) { in findAugmentingDAG() local
409 for (auto &Edge : AugmentingEdges[Src]) { in augmentFlowAlongDAG() local
422 for (auto &Edge : AugmentingEdges[Src]) { in augmentFlowAlongDAG() local
[all …]
|
| /external/tensorflow/tensorflow/lite/delegates/gpu/common/memory_management/ |
| D | min_cost_flow_assignment.cc | 145 struct Edge { struct in tflite::gpu::__anon93a389f90111::MinCostFlowSolver
146 Edge(size_t dst, int cap, int cost) : dst(dst), cap(cap), cost(cost) {} in Edge() argument
148 size_t dst;
149 int cap;
150 int cost;
|
| /external/skia/src/core/ |
| D | SkRegion_path.cpp | 445 struct Edge { struct
456 Edge* fNext; argument
473 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/swiftshader/third_party/llvm-16.0/llvm/lib/Transforms/Instrumentation/ |
| D | GCOVProfiling.cpp | 178 struct Edge { struct
181 const BasicBlock *SrcBB;
182 const BasicBlock *DestBB;
183 uint64_t Weight;
184 BasicBlock *Place = nullptr;
185 uint32_t SrcNumber, DstNumber;
186 bool InMST = false;
187 bool Removed = false;
188 bool IsCritical = false;
190 Edge(const BasicBlock *Src, const BasicBlock *Dest, uint64_t W = 1) in Edge() function
[all …]
|
| /external/rust/crates/bindgen/ir/ |
| D | traversal.rs | 15 pub(crate) struct Edge { struct
17 kind: EdgeKind, argument
20 impl Edge { argument
22 pub(crate) fn new(to: ItemId, kind: EdgeKind) -> Edge { in new()
|
| /external/swiftshader/third_party/llvm-16.0/llvm/lib/Support/ |
| D | SuffixTree.cpp | 42 unsigned StartIdx, unsigned Edge) { in insertLeaf()
55 unsigned EndIdx, unsigned Edge) { in insertInternalNode()
|
| /external/perfetto/src/trace_processor/perfetto_sql/intrinsics/table_functions/ |
| D | dfs_weight_bounded.cc | 46 struct Edge { struct
47 uint32_t id;
48 uint32_t weight;
|
| /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-16.0/llvm/lib/LTO/ |
| D | SummaryBasedOptimizations.cpp | 53 auto GetCallSiteRelFreq = [](FunctionSummary::EdgeTy &Edge) { in computeSyntheticCounts()
76 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/apache-commons-math/src/main/java/org/apache/commons/math3/geometry/spherical/twod/ |
| D | Edge.java | 31 public class Edge { class
51 Edge(final Vertex start, final Vertex end, final double length, final Circle circle) { in Edge() method in Edge
|
| /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/swiftshader/third_party/llvm-16.0/llvm/lib/IR/ |
| D | ModuleSummaryIndex.cpp | 383 struct Edge { struct
384 uint64_t SrcMod;
385 int Hotness;
386 GlobalValue::GUID Src;
387 GlobalValue::GUID Dst;
|
| /external/swiftshader/third_party/llvm-16.0/llvm/lib/Analysis/ |
| D | DDGPrinter.cpp | 130 const DDGNode *Src, const DDGEdge *Edge, const DataDependenceGraph *G) { in getSimpleEdgeAttributes()
139 const DDGNode *Src, const DDGEdge *Edge, const DataDependenceGraph *G) { in getVerboseEdgeAttributes()
|
| /external/rappor/analysis/cpp/ |
| D | find_cliques.cc | 111 struct Edge { struct
123 int operator() (const Edge& edge) const { in operator ()() argument
|