| /third_party/rust/rust/tests/ui/issues/auxiliary/ |
| D | issue-30123-aux.rs | 6 pub struct Graph<N, E, Ty = Directed> { struct
13 impl<N, E> Graph<N, E, Directed> { argument
19 impl<N, E> Graph<N, E, Undirected> { implementation
|
| /third_party/mindspore/mindspore-src/source/mindspore/lite/src/litert/cxx_api/graph/ |
| D | graph.cc | 22 Graph::Graph() : graph_data_(nullptr) {} in Graph() function in mindspore::Graph
24 Graph::Graph(const std::shared_ptr<GraphData> &graph_data) : graph_data_(graph_data) {} in Graph() function in mindspore::Graph
26 Graph::Graph(std::shared_ptr<GraphData> &&graph_data) : graph_data_(graph_data) {} in Graph() function in mindspore::Graph
30 Graph::Graph(std::nullptr_t) : graph_data_(nullptr) {} in Graph() function in mindspore::Graph
|
| /third_party/mindspore/mindspore-src/source/mindspore/ccsrc/cxx_api/graph/ |
| D | graph.cc | 21 Graph::Graph() : graph_data_(nullptr) {} in Graph() function in mindspore::Graph
23 Graph::Graph(const std::shared_ptr<GraphData> &graph_data) : graph_data_(graph_data) {} in Graph() function in mindspore::Graph
25 Graph::Graph(std::shared_ptr<GraphData> &&graph_data) : graph_data_(graph_data) {} in Graph() function in mindspore::Graph
29 Graph::Graph(std::nullptr_t) : graph_data_(nullptr) {} in Graph() function in mindspore::Graph
|
| /third_party/mindspore/mindspore-src/source/mindspore/lite/src/extendrt/cxx_api/graph/ |
| D | graph.cc | 21 Graph::Graph() : graph_data_(nullptr) {} in Graph() function in mindspore::Graph
23 Graph::Graph(const std::shared_ptr<GraphData> &graph_data) : graph_data_(graph_data) {} in Graph() function in mindspore::Graph
25 Graph::Graph(std::shared_ptr<GraphData> &&graph_data) : graph_data_(graph_data) {} in Graph() function in mindspore::Graph
29 Graph::Graph(std::nullptr_t) : graph_data_(nullptr) {} in Graph() function in mindspore::Graph
|
| /third_party/rust/rust/tests/ui/closures/2229_closure_analysis/migrations/ |
| D | issue-90024-adt-correct-subst.rs | 9 pub struct Graph<N, E, Ix> { struct
14 fn graph<N, E>() -> Graph<N, E, i32> { in graph() argument
|
| /third_party/rust/rust/compiler/rustc_middle/src/traits/ |
| D | specialization_graph.rs | 26 pub struct Graph { struct
38 impl Graph { argument
|
| /third_party/mindspore/mindspore-src/source/mindspore/lite/java/src/main/java/com/mindspore/ |
| D | Graph.java | 28 public class Graph { class
38 public Graph() { in Graph() method in Graph
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/ |
| D | DOTGraphTraitsPass.h | 54 GraphT Graph = AnalysisGraphTraitsT::getGraph(&Analysis); in runOnFunction() local
96 GraphT Graph = AnalysisGraphTraitsT::getGraph(&Analysis); in runOnFunction() local
133 GraphT Graph = AnalysisGraphTraitsT::getGraph(&getAnalysis<AnalysisT>()); in runOnModule() local
159 GraphT Graph = AnalysisGraphTraitsT::getGraph(&getAnalysis<AnalysisT>()); in runOnModule() local
|
| D | DependenceGraphBuilder.h | 155 GraphType &Graph; variable
|
| /third_party/rust/rust/tests/ui/mismatched_types/ |
| D | issue-75361-mismatched-impl.rs | 9 pub trait Graph { interface
|
| /third_party/rust/rust/tests/ui/traits/ |
| D | issue-6128.rs | 5 trait Graph<Node, Edge> { interface
|
| /third_party/rust/rust/tests/ui/typeck/ |
| D | issue-13853.rs | 5 trait Graph<N: Node> { trait
|
| /third_party/rust/rust/tests/ui/lifetimes/ |
| D | issue-55796.rs | 5 pub trait Graph<'a> { interface
|
| /third_party/rust/crates/bindgen/bindgen/ir/analysis/ |
| D | mod.rs | 265 struct Graph(HashMap<Node, Vec<Node>>); struct
267 impl Graph { impl
281 fn reverse(&self) -> Graph { in reverse()
|
| /third_party/rust/rust/compiler/rustc_trait_selection/src/traits/specialize/ |
| D | mod.rs | 271 ) -> specialization_graph::Graph { in specialization_graph_provider()
317 sg: &mut specialization_graph::Graph, in report_overlap_conflict()
356 sg: &mut specialization_graph::Graph, in report_negative_positive_conflict()
373 sg: &mut specialization_graph::Graph, in report_conflicting_impls()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/ |
| D | GraphTraits.h | 96 const GraphType &Graph; member
|
| /third_party/mindspore/mindspore-src/source/mindspore/ccsrc/pipeline/jit/pi/graph_capture/ |
| D | loop_unrolling.h | 32 class Graph; variable
|
| D | loop.h | 62 class Graph; variable
|
| /third_party/mesa3d/src/nouveau/codegen/ |
| D | nv50_ir_graph.h | 71 friend class Graph; variable
144 friend class Graph; variable
|
| /third_party/rust/rust/compiler/rustc_data_structures/src/graph/implementation/ |
| D | mod.rs | 30 pub struct Graph<N, E> { struct
31 nodes: SnapshotVec<Node<N>>,
32 edges: SnapshotVec<Edge<E>>,
87 impl<N: Debug, E: Debug> Graph<N, E> { impl
|
| /third_party/mindspore/mindspore-src/source/mindspore/ccsrc/backend/common/graph_kernel/core/ |
| D | graph_kernel_cluster.h | 30 class Graph; variable
|
| /third_party/rust/rust/compiler/rustc_middle/src/mir/ |
| D | generic_graph.rs | 7 pub fn mir_fn_to_generic_graph<'tcx>(tcx: TyCtxt<'tcx>, body: &Body<'_>) -> Graph { in mir_fn_to_generic_graph()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/ |
| D | CFLAndersAliasAnalysis.cpp | 608 const CFLGraph &Graph) { in initializeWorkList()
629 static Optional<InstantiatedValue> getNodeBelow(const CFLGraph &Graph, in getNodeBelow()
637 static void processWorkListItem(const WorkListItem &Item, const CFLGraph &Graph, in processWorkListItem()
736 static AliasAttrMap buildAttrMap(const CFLGraph &Graph, in buildAttrMap()
788 auto &Graph = GraphBuilder.getCFLGraph(); in buildInfoFrom() local
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/WebAssembly/ |
| D | WebAssemblyFixIrreducibleControlFlow.cpp | 248 ReachabilityGraph Graph(Entry, Blocks); in processRegion() local
324 const ReachabilityGraph &Graph) { in makeSingleEntryLoop()
|
| /third_party/skia/m133/tests/ |
| D | IncrTopoSortTest.cpp | 93 class Graph { class
95 Graph(int numNodesToReserve, skiatest::Reporter* reporter) in Graph() function in Graph
|