| /third_party/ninja/src/ |
| D | graph.h | 140 struct Edge { struct
147 Edge() : rule_(NULL), pool_(NULL), dyndep_(NULL), env_(NULL), in Edge() argument
173 const Rule* rule_;
174 Pool* pool_;
175 vector<Node*> inputs_;
176 vector<Node*> outputs_;
177 Node* dyndep_;
178 BindingEnv* env_;
179 VisitMark mark_;
180 bool outputs_ready_;
[all …]
|
| /third_party/boost/libs/graph/test/ |
| D | adj_list_cc.cpp | 23 typedef graph_traits< Graph >::edge_descriptor Edge; in main() typedef
44 typedef graph_traits< Graph >::edge_descriptor Edge; in main() typedef
66 typedef graph_traits< Graph >::edge_descriptor Edge; in main() typedef
85 typedef graph_traits< Graph >::edge_descriptor Edge; in main() typedef
105 typedef graph_traits< Graph >::edge_descriptor Edge; in main() typedef
127 typedef graph_traits< Graph >::edge_descriptor Edge; in main() typedef
146 typedef graph_traits< Graph >::edge_descriptor Edge; in main() typedef
|
| D | stanford_graph_cc.cpp | 29 typedef graph_traits< Graph >::edge_descriptor Edge; in main() typedef
43 typedef graph_traits< Graph >::edge_descriptor Edge; in main() typedef
|
| D | adj_matrix_cc.cpp | 42 typedef graph_traits< Graph >::edge_descriptor Edge; in main() typedef
62 typedef graph_traits< Graph >::edge_descriptor Edge; in main() typedef
|
| D | reverse_graph_cc.cpp | 29 typedef graph_traits< Graph >::edge_descriptor Edge; in main() typedef
50 typedef graph_traits< Graph >::edge_descriptor Edge; in main() typedef
|
| D | test_destruction.hpp | 72 typedef typename graph_traits< Graph >::edge_descriptor Edge; in disconnect_graph() typedef
100 typedef typename boost::graph_traits< Graph >::edge_descriptor Edge; in disconnect_graph() typedef
|
| D | edge_list_cc.cpp | 28 typedef graph_traits< EdgeList >::edge_descriptor Edge; in main() typedef
|
| D | leda_graph_cc.cpp | 19 typedef graph_traits< Graph >::edge_descriptor Edge; in main() typedef
|
| D | core_numbers_test.cpp | 81 typedef std::pair< int, int > Edge; in test_2() typedef
115 typedef std::pair< int, int > Edge; in test_3() typedef
|
| D | csr_graph_test.cpp | 394 struct Edge struct
396 Edge(double weight) : weight(weight), centrality(0.0) {} in Edge() argument
405 typedef compressed_sparse_row_graph< directedS, Vertex, Edge > in test_vertex_and_edge_properties() argument
|
| D | grid_graph_cc.cpp | 21 typedef typename graph_traits< Graph >::edge_descriptor Edge; in check() typedef
|
| D | adj_list_invalidation.cpp | 51 typedef typename graph_traits< Graph >::edge_descriptor Edge; in invalidate_edges() typedef
85 typedef typename graph_traits< Graph >::edge_descriptor Edge; in invalidate_out_edges() typedef
|
| D | read_propmap.cpp | 27 typedef graph_traits< graph_t >::edge_descriptor Edge; in main() typedef
|
| /third_party/skia/src/gpu/geometry/ |
| D | GrTriangulator.h | 378 struct GrTriangulator::Edge { struct
379 Edge(Vertex* top, Vertex* bottom, int winding, EdgeType type) in Edge() function
403 EdgeType fType; argument
404 Edge* fLeft; // The linked list of edges in the active edge list. argument
405 Edge* fRight; // " argument
406 Edge* fPrevEdgeAbove; // The linked list of edges in the bottom Vertex's "edges above". argument
407 Edge* fNextEdgeAbove; // " argument
408 Edge* fPrevEdgeBelow; // The linked list of edges in the top Vertex's "edges below". argument
409 Edge* fNextEdgeBelow; // " argument
412 Edge* fLeftPolyPrev; argument
[all …]
|
| /third_party/skia/third_party/externals/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
|
| /third_party/skia/third_party/externals/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
|
| /third_party/flutter/skia/src/core/ |
| D | SkRegion_path.cpp | 392 struct Edge { struct
403 Edge* fNext; argument
420 static void find_link(Edge* base, Edge* stop) { in find_link() argument
|
| /third_party/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
|
| /third_party/boost/libs/yap/example/autodiff_library/ |
| D | Edge.cpp | 14 Edge::Edge(Node* a_,Node* b_):a(a_),b(b_) { in Edge() function in AutoDiff::Edge
23 Edge::Edge(const Edge& e) in Edge() function in AutoDiff::Edge
|
| /third_party/skia/third_party/externals/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()
|
| /third_party/boost/libs/graph/example/ |
| D | remove_edge_if_dir.cpp | 43 typedef std::pair< std::size_t, std::size_t > Edge; in main() typedef
|
| D | bron_kerbosch_clique_number.cpp | 23 typedef graph_traits< Graph >::edge_descriptor Edge; typedef
|
| D | tiernan_girth_circumference.cpp | 21 typedef graph_traits< Graph >::edge_descriptor Edge; typedef
|
| /third_party/flutter/skia/src/gpu/ |
| D | GrTessellator.cpp | 341 struct Edge { struct
342 enum class Type { kInner, kOuter, kConnector };
343 Edge(Vertex* top, Vertex* bottom, int winding, Type type) in Edge() function
364 int fWinding; // 1 == edge goes downward; -1 = edge goes upward.
365 Vertex* fTop; // The top vertex in vertex-sort-order (sweep_lt).
366 Vertex* fBottom; // The bottom vertex in vertex-sort-order.
367 Type fType;
368 Edge* fLeft; // The linked list of edges in the active edge list.
369 Edge* fRight; // "
370 Edge* fPrevEdgeAbove; // The linked list of edges in the bottom Vertex's "edges above".
[all …]
|
| /third_party/skia/third_party/externals/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;
|