| /third_party/boost/boost/graph/detail/ |
| D | adjacency_list.hpp | 604 edges(const directed_edges_helper< Config >& g_) in edges() argument
608 const graph_type& cg = static_cast< const graph_type& >(g_); in edges()
636 typename Config::vertex_descriptor v, directed_graph_helper< Config >& g_) in remove_edge()
640 graph_type& g = static_cast< graph_type& >(g_); in remove_edge()
646 Predicate pred, directed_graph_helper< Config >& g_) in remove_out_edge_if()
649 graph_type& g = static_cast< graph_type& >(g_); in remove_out_edge_if()
658 inline void remove_edge_if(Predicate pred, directed_graph_helper< Config >& g_) in remove_edge_if() argument
661 graph_type& g = static_cast< graph_type& >(g_); in remove_edge_if()
670 EdgeOrIter e_or_iter, directed_graph_helper< Config >& g_) in remove_edge()
672 g_.remove_edge(e_or_iter); in remove_edge()
[all …]
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/synchronization/internal/ |
| D | graphcycles_test.cc | 357 GraphCycles g_; member in absl::synchronization_internal::GraphCyclesTest
370 id_[i] = g_.GetId(Ptr(i)); in GraphCyclesTest()
372 CheckInvariants(g_); in GraphCyclesTest()
376 return g_.InsertEdge(Get(id_, x), Get(id_, y)); in AddEdge()
385 CheckInvariants(g_); in AddMultiples()
390 int np = g_.FindPath(Get(id_, x), Get(id_, y), ABSL_ARRAYSIZE(path), path); in Path()
399 snprintf(buf, sizeof(buf), "%d", Num(g_.Ptr(path[i]))); in Path()
408 CheckInvariants(g_); in TEST_F()
415 CheckInvariants(g_); in TEST_F()
421 CheckInvariants(g_); in TEST_F()
[all …]
|
| /third_party/abseil-cpp/absl/synchronization/internal/ |
| D | graphcycles_test.cc | 357 GraphCycles g_; member in absl::synchronization_internal::GraphCyclesTest
370 id_[i] = g_.GetId(Ptr(i)); in GraphCyclesTest()
372 CheckInvariants(g_); in GraphCyclesTest()
376 return g_.InsertEdge(Get(id_, x), Get(id_, y)); in AddEdge()
385 CheckInvariants(g_); in AddMultiples()
390 int np = g_.FindPath(Get(id_, x), Get(id_, y), ABSL_ARRAYSIZE(path), path); in Path()
399 snprintf(buf, sizeof(buf), "%d", Num(g_.Ptr(path[i]))); in Path()
408 CheckInvariants(g_); in TEST_F()
415 CheckInvariants(g_); in TEST_F()
421 CheckInvariants(g_); in TEST_F()
[all …]
|
| /third_party/glib/glib/ |
| D | gmem.h | 240 __p = g_##func (__n); \
243 __p = g_##func (__n * __s); \
245 __p = g_##func##_n (__n, __s); \
254 __p = g_##func (__p, __n); \
257 __p = g_##func (__p, __n * __s); \
259 __p = g_##func##_n (__p, __n, __s); \
268 ((struct_type *) g_##func##_n ((n_structs), sizeof (struct_type)))
270 ((struct_type *) g_##func##_n (mem, (n_structs), sizeof (struct_type)))
|
| /third_party/boost/libs/proto/test/ |
| D | flatten.cpp | 89 boost::proto::terminal<char>::type g_ = {'g'}; in test1() local
118 boost::fusion::for_each(flatten(a_ >> b_ | c_ >> d_ | e_ >> f_ >> g_), to_string(sout)); in test1()
122 boost::fusion::for_each(flatten(a_ >> b_ | c_ >> d_ | e_ >> (f_ | g_) >> h_), to_string(sout)); in test1()
127 boost::fusion::for_each(flatten(a_(b_(c_ >> d_, e_ | f_), g_ >> h_)(i_)), to_string(sout)); in test1()
157 My<boost::proto::terminal<char>::type> g_ = {{'g'}}; in test2() local
186 boost::fusion::for_each(flatten(a_ >> b_ | c_ >> d_ | e_ >> f_ >> g_), to_string(sout)); in test2()
190 boost::fusion::for_each(flatten(a_ >> b_ | c_ >> d_ | e_ >> (f_ | g_) >> h_), to_string(sout)); in test2()
195 boost::fusion::for_each(flatten(a_(b_(c_ >> d_, e_ | f_), g_ >> h_)(i_)), to_string(sout)); in test2()
|
| /third_party/boost/boost/spirit/home/classic/phoenix/ |
| D | actor.hpp | 423 A& a_, B& b_, C& c_, D& d_, E& e_, F& f_, G& g_ in operator ()()
428 (a_, b_, c_, d_, e_, f_, g_) in operator ()()
441 A& a_, B& b_, C& c_, D& d_, E& e_, F& f_, G& g_, H& h_ in operator ()() argument
446 (a_, b_, c_, d_, e_, f_, g_, h_) in operator ()()
459 A& a_, B& b_, C& c_, D& d_, E& e_, F& f_, G& g_, H& h_, I& i_ in operator ()() argument
464 (a_, b_, c_, d_, e_, f_, g_, h_, i_) in operator ()()
478 A& a_, B& b_, C& c_, D& d_, E& e_, F& f_, G& g_, H& h_, I& i_, J& j_ in operator ()() argument
483 (a_, b_, c_, d_, e_, f_, g_, h_, i_, j_) in operator ()()
497 A& a_, B& b_, C& c_, D& d_, E& e_, F& f_, G& g_, H& h_, I& i_, J& j_, in operator ()() argument
503 (a_, b_, c_, d_, e_, f_, g_, h_, i_, j_, k_) in operator ()()
[all …]
|
| D | tuples.hpp | 821 typename call_traits<G>::param_type g_ in tuple()
823 f(f_), g(g_) {} in tuple()
871 typename call_traits<G>::param_type g_, in tuple()
874 f(f_), g(g_), h(h_) {} in tuple()
923 typename call_traits<G>::param_type g_, in tuple()
927 f(f_), g(g_), h(h_), i(i_) {} in tuple()
975 typename call_traits<G>::param_type g_, in tuple()
980 f(f_), g(g_), h(h_), i(i_), j(j_) {} in tuple()
1029 typename call_traits<G>::param_type g_, in tuple()
1035 f(f_), g(g_), h(h_), i(i_), j(j_), in tuple()
[all …]
|
| D | composite.hpp | 605 F const& f_, G const& g_) in composite()
607 f(f_), g(g_) {} in composite()
676 F const& f_, G const& g_, H const& h_) in composite()
678 f(f_), g(g_), h(h_) {} in composite()
749 F const& f_, G const& g_, H const& h_, I const& i_) in composite()
751 f(f_), g(g_), h(h_), i(i_) {} in composite()
822 F const& f_, G const& g_, H const& h_, I const& i_, J const& j_) in composite()
824 f(f_), g(g_), h(h_), i(i_), j(j_) {} in composite()
899 F const& f_, G const& g_, H const& h_, I const& i_, J const& j_, in composite()
902 f(f_), g(g_), h(h_), i(i_), j(j_), in composite()
[all …]
|
| /third_party/boost/boost/graph/ |
| D | edge_list.hpp | 105 edges(const edge_list_impl< G, EI, T, D >& g_) in edges() argument
107 const G& g = static_cast< const G& >(g_); in edges()
196 edges(const edge_list_impl_ra< G, EI, T, D >& g_) in edges() argument
198 const G& g = static_cast< const G& >(g_); in edges()
206 const edge_list_impl_ra< G, EI, T, D >& g_) in source()
208 const G& g = static_cast< const G& >(g_); in source()
214 const edge_list_impl_ra< G, EI, T, D >& g_) in target()
216 const G& g = static_cast< const G& >(g_); in target()
|
| D | push_relabel_max_flow.hpp | 124 push_relabel(Graph& g_, EdgeCapacityMap cap, in push_relabel() argument
127 : g(g_) in push_relabel()
128 , n(num_vertices(g_)) in push_relabel()
133 , excess_flow_data(num_vertices(g_)) in push_relabel()
135 , current_data(num_vertices(g_), out_edges(*vertices(g_).first, g_)) in push_relabel()
137 , distance_data(num_vertices(g_)) in push_relabel()
139 , color_data(num_vertices(g_)) in push_relabel()
143 , layers(num_vertices(g_)) in push_relabel()
145 num_vertices(g_), layers.front().inactive_vertices.end()) in push_relabel()
|
| D | successive_shortest_path_nonnegative_weights.hpp | 47 : g_(g), weight_(w), distance_(d), rev_(r) in MapReducedWeight()
53 return get(distance_, source(v, g_)) - get(distance_, target(v, g_)) in operator []()
58 const Graph& g_; member in boost::detail::MapReducedWeight
|
| D | adjacency_matrix.hpp | 693 const adjacency_matrix< directedS, VP, EP, GP, A >& g_) in out_edges()
696 Graph& g = const_cast< Graph& >(g_); in out_edges()
716 const adjacency_matrix< undirectedS, VP, EP, GP, A >& g_) in out_edges()
719 Graph& g = const_cast< Graph& >(g_); in out_edges()
776 const adjacency_matrix< directedS, VP, EP, GP, A >& g_) in in_edges()
779 Graph& g = const_cast< Graph& >(g_); in in_edges()
799 const adjacency_matrix< undirectedS, VP, EP, GP, A >& g_) in in_edges()
802 Graph& g = const_cast< Graph& >(g_); in in_edges()
837 const adjacency_matrix< D, VP, EP, GP, A >& g_) in adjacent_vertices()
840 const Graph& cg = static_cast< const Graph& >(g_); in adjacent_vertices()
[all …]
|
| /third_party/mindspore/mindspore/lite/include/registry/ |
| D | pass_registry.h | 70 static mindspore::registry::PassRegistry g_##name##PassReg(#name, std::make_shared<pass>());
76 #define REG_SCHEDULED_PASS(position, names) static mindspore::registry::PassRegistry g_##position(p…
|
| D | register_kernel_interface.h | 100 …static mindspore::registry::KernelInterfaceReg g_##provider##op_type##_inter_reg(#provider, op_typ…
110 …static mindspore::registry::KernelInterfaceReg g_##provider##op_type##_custom_inter_reg(#provider,…
|
| D | register_kernel.h | 129 …static mindspore::registry::KernelReg g_##arch##provider##data_type##op_type##kernelReg(#arch, #pr…
142 …static mindspore::registry::KernelReg g_##arch##provider##data_type##op_type##kernelReg(#arch, #pr…
|
| D | node_parser_registry.h | 54 …static mindspore::registry::NodeParserRegistry g_##fmk_type##node_type##ParserReg(fmk_type, #node_…
|
| D | model_parser_registry.h | 58 static mindspore::registry::ModelParserRegistry g_##type##fmk##ModelParserReg(fmk, parserCreator);
|
| /third_party/mindspore/mindspore/ccsrc/fl/server/kernel/ |
| D | aggregation_kernel_factory.h | 60 …static const AggregationKernelRegister g_##NAME##_##T##_aggregation_kernel_reg( …
66 …static const AggregationKernelRegister g_##NAME##_##T##_##S##_aggregation_kernel_reg( …
|
| /third_party/boost/libs/graph/example/ |
| D | remove_edge_if_bidir.cpp | 49 has_weight_greater_than(int w_, Graph& g_) : w(w_), g(g_) {} in has_weight_greater_than()
|
| D | remove_edge_if_undir.cpp | 48 has_weight_greater_than(int w_, Graph& g_) : w(w_), g(g_) {} in has_weight_greater_than()
|
| D | gerdemann.cpp | 100 get_edge_name(const Graph& g_) : g(g_) {} in get_edge_name()
|
| D | quick_tour.cpp | 22 exercise_vertex(Graph& g_, const char name_[]) : g(g_), name(name_) {} in exercise_vertex()
|
| /third_party/mindspore/mindspore/lite/tools/converter/acl/mapper/ |
| D | primitive_mapper_register.h | 51 static RegisterPrimitiveMapper g_##name##PrimMapper(name, std::make_shared<mapper>());
|
| /third_party/glib/gobject/ |
| D | glib-enumtypes.c.template | 31 g_@type@_register_static (g_intern_static_string ("@EnumName@"), values);
|
| /third_party/glib/gio/ |
| D | gioenumtypes.c.template | 31 g_@type@_register_static (g_intern_static_string ("@EnumName@"), values);
|