| /third_party/boost/libs/graph/test/ |
| D | test_graphs.cpp | 41 Graph g; in main() local
57 Graph g; in main() local
73 Graph g; in main() local
80 Graph g; in main() local
108 Graph g; in main() local
126 Graph g; in main() local
141 Graph g(N); in main() local
154 Graph g(N); in main() local
171 Graph g; in main() local
|
| D | labeled_graph.cpp | 53 template < typename Graph > void init_graph(Graph& g) in init_graph()
61 template < typename Graph > void label_graph(Graph& g) in label_graph()
72 template < typename Graph > void build_graph(Graph& g) in build_graph()
94 Graph g; in test_norm() local
101 Graph g; in test_norm() local
115 Graph g(6); in test_temp() local
133 Graph g; in test_bacon() local
144 Graph g; in test_bacon() local
|
| /third_party/boost/boost/graph/ |
| D | directed_graph.hpp | 138 directed_graph& operator=(directed_graph const& g) in operator =()
331 void swap(directed_graph& g) in swap()
380 typename DIRECTED_GRAPH::edge_descriptor e, DIRECTED_GRAPH const& g) in source()
387 typename DIRECTED_GRAPH::edge_descriptor e, DIRECTED_GRAPH const& g) in target()
394 typename DIRECTED_GRAPH::vertex_descriptor v, DIRECTED_GRAPH const& g) in out_degree()
402 out_edges(typename DIRECTED_GRAPH::vertex_descriptor v, DIRECTED_GRAPH const& g) in out_edges()
410 typename DIRECTED_GRAPH::vertex_descriptor v, DIRECTED_GRAPH const& g) in in_degree()
418 in_edges(typename DIRECTED_GRAPH::vertex_descriptor v, DIRECTED_GRAPH const& g) in in_edges()
425 typename DIRECTED_GRAPH::vertex_descriptor v, DIRECTED_GRAPH const& g) in degree()
435 typename DIRECTED_GRAPH::vertex_descriptor v, DIRECTED_GRAPH const& g) in adjacent_vertices()
[all …]
|
| D | undirected_graph.hpp | 140 undirected_graph& operator=(undirected_graph const& g) in operator =()
334 void swap(undirected_graph& g) in swap()
383 typename UNDIRECTED_GRAPH::edge_descriptor e, UNDIRECTED_GRAPH const& g) in source()
390 typename UNDIRECTED_GRAPH::edge_descriptor e, UNDIRECTED_GRAPH const& g) in target()
397 typename UNDIRECTED_GRAPH::vertex_descriptor v, UNDIRECTED_GRAPH const& g) in out_degree()
406 typename UNDIRECTED_GRAPH::vertex_descriptor v, UNDIRECTED_GRAPH const& g) in out_edges()
414 typename UNDIRECTED_GRAPH::vertex_descriptor v, UNDIRECTED_GRAPH const& g) in in_degree()
423 typename UNDIRECTED_GRAPH::vertex_descriptor v, UNDIRECTED_GRAPH const& g) in in_edges()
432 typename UNDIRECTED_GRAPH::vertex_descriptor v, UNDIRECTED_GRAPH const& g) in incident_edges()
439 typename UNDIRECTED_GRAPH::vertex_descriptor v, UNDIRECTED_GRAPH const& g) in degree()
[all …]
|
| D | leda_graph.hpp | 53 adjacency_iterator( in adjacency_iterator()
71 const leda::GRAPH< vtype, etype >* g; member in boost::graph_traits::adjacency_iterator
81 out_edge_iterator( in out_edge_iterator()
99 const leda::GRAPH< vtype, etype >* g; member in boost::graph_traits::out_edge_iterator
109 in_edge_iterator( in in_edge_iterator()
127 const leda::GRAPH< vtype, etype >* g; member in boost::graph_traits::in_edge_iterator
137 vertex_iterator( in vertex_iterator()
155 const leda::GRAPH< vtype, etype >* g; member in boost::graph_traits::vertex_iterator
165 edge_iterator( in edge_iterator()
183 const leda::GRAPH< vtype, etype >* g; member in boost::graph_traits::edge_iterator
[all …]
|
| D | neighbor_bfs.hpp | 53 Graph g; member
64 void initialize_vertex(Vertex u, Graph& g) in initialize_vertex()
69 void discover_vertex(Vertex u, Graph& g) in discover_vertex()
74 void examine_vertex(Vertex u, Graph& g) in examine_vertex()
78 template < class Edge, class Graph > void examine_out_edge(Edge e, Graph& g) in examine_out_edge()
82 template < class Edge, class Graph > void tree_out_edge(Edge e, Graph& g) in tree_out_edge()
87 void non_tree_out_edge(Edge e, Graph& g) in non_tree_out_edge()
91 template < class Edge, class Graph > void gray_target(Edge e, Graph& g) in gray_target()
95 template < class Edge, class Graph > void black_target(Edge e, Graph& g) in black_target()
99 template < class Edge, class Graph > void examine_in_edge(Edge e, Graph& g) in examine_in_edge()
[all …]
|
| D | wavefront.hpp | 29 typename graph_traits< Graph >::vertex_descriptor i, const Graph& g, in ith_wavefront()
64 typename graph_traits< Graph >::vertex_descriptor i, const Graph& g) in ith_wavefront()
71 const Graph& g, VertexIndexMap index) in max_wavefront()
83 typename graph_traits< Graph >::vertices_size_type max_wavefront(const Graph& g) in max_wavefront()
89 double aver_wavefront(const Graph& g, VertexIndexMap index) in aver_wavefront()
100 template < typename Graph > double aver_wavefront(const Graph& g) in aver_wavefront()
106 double rms_wavefront(const Graph& g, VertexIndexMap index) in rms_wavefront()
118 template < typename Graph > double rms_wavefront(const Graph& g) in rms_wavefront()
|
| D | depth_first_search.hpp | 55 Graph g; member in boost::DFSVisitorConcept
92 void call_finish_edge(Vis& vis, E e, const G& g) in call_finish_edge()
125 void depth_first_visit_impl(const IncidenceGraph& g, in depth_first_visit_impl()
222 void depth_first_visit_impl(const IncidenceGraph& g, in depth_first_visit_impl()
266 void depth_first_search(const VertexListGraph& g, DFSVisitor vis, in depth_first_search()
305 const VertexListGraph& g, DFSVisitor vis, ColorMap color) in depth_first_search()
322 void initialize_vertex(Vertex u, const Graph& g) in initialize_vertex()
327 void start_vertex(Vertex u, const Graph& g) in start_vertex()
332 void discover_vertex(Vertex u, const Graph& g) in discover_vertex()
337 void examine_edge(Edge u, const Graph& g) in examine_edge()
[all …]
|
| D | clustering_coefficient.hpp | 22 const Graph& g, std::size_t k, directed_tag) in possible_edges()
31 const Graph& g, size_t k, undirected_tag) in possible_edges()
40 const Graph& g, typename graph_traits< Graph >::vertex_descriptor u, in count_edges()
52 const Graph& g, typename graph_traits< Graph >::vertex_descriptor u, in count_edges()
62 num_paths_through_vertex(const Graph& g, Vertex v) in num_paths_through_vertex()
80 const Graph& g, Vertex v) in num_triangles_on_vertex()
105 inline T clustering_coefficient(const Graph& g, Vertex v) in clustering_coefficient()
113 inline double clustering_coefficient(const Graph& g, Vertex v) in clustering_coefficient()
120 all_clustering_coefficients(const Graph& g, ClusteringMap cm) in all_clustering_coefficients()
141 mean_clustering_coefficient(const Graph& g, ClusteringMap cm) in mean_clustering_coefficient()
|
| D | bellman_ford_shortest_paths.hpp | 48 Graph g; member
58 template < class Edge, class Graph > void examine_edge(Edge u, Graph& g) in examine_edge()
62 template < class Edge, class Graph > void edge_relaxed(Edge u, Graph& g) in edge_relaxed()
66 template < class Edge, class Graph > void edge_not_relaxed(Edge u, Graph& g) in edge_not_relaxed()
70 template < class Edge, class Graph > void edge_minimized(Edge u, Graph& g) in edge_minimized()
75 void edge_not_minimized(Edge u, Graph& g) in edge_not_minimized()
93 bool bellman_ford_shortest_paths(EdgeListGraph& g, Size N, WeightMap weight, in bellman_ford_shortest_paths()
143 bool bellman_dispatch2(VertexAndEdgeListGraph& g, in bellman_dispatch2()
170 bool bellman_dispatch2(VertexAndEdgeListGraph& g, param_not_found, Size N, in bellman_dispatch2()
186 bool bellman_dispatch(EdgeListGraph& g, Size N, WeightMap weight, in bellman_dispatch()
[all …]
|
| /third_party/boost/libs/callable_traits/example/ |
| D | apply_member_pointer.cpp | 22 using g = ct::apply_member_pointer_t<f, foo>; in main() typedef
30 using g = ct::apply_member_pointer_t<f, foo>; in main() typedef
45 using g = ct::apply_member_pointer_t<f, foo>; in main() typedef
52 using g = ct::apply_member_pointer_t<f, foo>; in main() typedef
61 using g = ct::apply_member_pointer_t<f, foo>; in main() typedef
70 using g = ct::apply_member_pointer_t<f, foo>; in main() typedef
77 using g = ct::apply_member_pointer_t<int, foo>; in main() typedef
88 using g = ct::apply_member_pointer_t<f, foo>; in main() typedef
|
| /third_party/musl/ndk-test/sanitize/cfi/src/ |
| D | simple-pass.cpp | 21 void A::g() {} in g() function in A
29 void A2::g() {} in g() function in A2
33 void g() {} in g() function
38 void g() {} in g() function
49 void C::g() {} in g() function in __anon5d33e4f90111::C
57 void C2::g() {} in g() function in __anon5d33e4f90111::C2
61 void g() {} in g() function
66 void g() {} in g() function
73 void g() {} in g() function
78 void g() {} in g() function
|
| /third_party/mindspore/mindspore/ccsrc/minddata/dataset/api/python/bindings/dataset/engine/gnn/ |
| D | bindings.cc | 42 [](gnn::GraphData &g, gnn::NodeType node_type) { in __anon696ce9ab0102()
48 [](gnn::GraphData &g, gnn::EdgeType edge_type) { in __anon696ce9ab0102()
54 [](gnn::GraphData &g, std::vector<gnn::NodeIdType> edge_list) { in __anon696ce9ab0102()
60 … [](gnn::GraphData &g, const std::vector<std::pair<gnn::NodeIdType, gnn::NodeIdType>> &node_list) { in __anon696ce9ab0102()
73 …[](gnn::GraphData &g, std::vector<gnn::NodeIdType> node_list, std::vector<gnn::NodeIdType> neighbo… in __anon696ce9ab0102()
80 … [](gnn::GraphData &g, std::vector<gnn::NodeIdType> node_list, gnn::NodeIdType neighbor_num, in __anon696ce9ab0102()
87 …[](gnn::GraphData &g, std::shared_ptr<Tensor> node_list, std::vector<gnn::FeatureType> feature_typ… in __anon696ce9ab0102()
93 …[](gnn::GraphData &g, std::shared_ptr<Tensor> edge_list, std::vector<gnn::FeatureType> feature_typ… in __anon696ce9ab0102()
99 [](gnn::GraphData &g) { in __anon696ce9ab0102()
111 .def("stop", [](gnn::GraphData &g) { THROW_IF_ERROR(g.Stop()); }); in __anon696ce9ab0102()
[all …]
|
| /third_party/boost/libs/graph/example/ |
| D | labeled_graph.cpp | 34 Graph g; in main() local
43 Graph g; in main() local
50 Graph g; in main() local
58 Digraph g; in main() local
67 Graph g; in main() local
|
| /third_party/jerryscript/tests/jerry/es2015/ |
| D | let3.js | 16 var g = -1; variable
24 function g() { return 1 }; function
45 function g() { return 1 }; function
76 function g() { return 2 }; function
|
| D | let4.js | 16 var g = -1; variable
24 function g() { return 1 }; function
45 function g() { return 1 }; function
76 function g() { return 2 }; function
|
| /third_party/boost/boost/graph/distributed/ |
| D | vertex_list_adaptor.hpp | 70 make_distribution_global_index_map(const Graph& g, const Distribution& d) in make_distribution_global_index_map()
140 vertex_list_adaptor(const Graph& g, in vertex_list_adaptor()
176 const Graph* g; member in boost::graph::vertex_list_adaptor
183 make_vertex_list_adaptor(const Graph& g, const GlobalIndexMap& index_map) in make_vertex_list_adaptor()
203 make_vertex_list_adaptor(const Graph& g) in make_vertex_list_adaptor()
221 const vertex_list_adaptor<Graph, GlobalIndexMap>& g) in source()
227 const vertex_list_adaptor<Graph, GlobalIndexMap>& g) in target()
235 const vertex_list_adaptor<Graph, GlobalIndexMap>& g) in out_edges()
241 const vertex_list_adaptor<Graph, GlobalIndexMap>& g) in out_degree()
252 const vertex_list_adaptor<Graph, GlobalIndexMap>& g) in in_edges()
[all …]
|
| D | local_subgraph.hpp | 48 is_local_edge(DistributedGraph& g) : g(&g), owner(get(vertex_owner, g)) {} in is_local_edge()
56 DistributedGraph* g; member in boost::is_local_edge
69 is_local_vertex(DistributedGraph& g) : g(&g), owner(get(vertex_owner, g)) { } in is_local_vertex()
79 DistributedGraph* g; member in boost::is_local_vertex
114 local_subgraph(DistributedGraph& g) in local_subgraph()
141 DistributedGraph& g; member in boost::local_subgraph
159 get(PropertyTag p, local_subgraph<DistributedGraph>& g) in get()
165 get(PropertyTag p, const local_subgraph<DistributedGraph>& g) in get()
170 make_local_subgraph(DistributedGraph& g) in make_local_subgraph()
|
| /third_party/boost/boost/pool/ |
| D | singleton_pool.hpp | 136 details::pool::guard<Mutex> g(p); in BOOST_PREVENT_MACRO_SUBSTITUTION() local
142 details::pool::guard<Mutex> g(p); in ordered_malloc() local
148 details::pool::guard<Mutex> g(p); in ordered_malloc() local
155 details::pool::guard<Mutex> g(p); in is_from() local
161 details::pool::guard<Mutex> g(p); in BOOST_PREVENT_MACRO_SUBSTITUTION() local
167 details::pool::guard<Mutex> g(p); in ordered_free() local
173 details::pool::guard<Mutex> g(p); in BOOST_PREVENT_MACRO_SUBSTITUTION() local
179 details::pool::guard<Mutex> g(p); in ordered_free() local
185 details::pool::guard<Mutex> g(p); in release_memory() local
191 details::pool::guard<Mutex> g(p); in purge_memory() local
|
| /third_party/boost/boost/geometry/index/ |
| D | predicates.hpp | 48 contains(Geometry const& g) in contains()
79 covered_by(Geometry const& g) in covered_by()
110 covers(Geometry const& g) in covers()
141 disjoint(Geometry const& g) in disjoint()
174 intersects(Geometry const& g) in intersects()
205 overlaps(Geometry const& g) in overlaps()
233 touches(Geometry const& g) in touches()
266 within(Geometry const& g) in within()
|
| /third_party/typescript/tests/baselines/reference/ |
| D | declFileTypeAnnotationTupleType.js | 34 var g = /** @class */ (function () { function
35 function g() { function
41 var g = /** @class */ (function () { function
42 function g() { function
59 class g<T> { class
|
| D | declFileTypeAnnotationUnionType.js | 38 var g = /** @class */ (function () { function
39 function g() { function
45 var g = /** @class */ (function () { function
46 function g() { function
65 class g<T> { class
|
| D | declFileTypeAnnotationTypeReference.js | 59 var g = /** @class */ (function () { function
60 function g() { function
66 var g = /** @class */ (function () { function
67 function g() { function
107 class g<T> { class
|
| D | declFileTypeAnnotationTypeQuery.js | 59 var g = /** @class */ (function () { function
60 function g() { function
66 var g = /** @class */ (function () { function
67 function g() { function
107 class g<T> { class
|
| D | spreadMethods.js | 5 get g() { return 0; } getter in K
23 let i: I = { p: 12, m() { }, get g() { return 0; } }; getter
33 let o = { p: 12, m() { }, get g() { return 0; } }; getter
50 get g() { return 0; } getter in K
61 let i = { p: 12, m() { }, get g() { return 0; } }; getter
70 let o = { p: 12, m() { }, get g() { return 0; } }; getter
|