Home
last modified time | relevance | path

Searched defs:g_ (Results 1 – 14 of 14) sorted by relevance

/third_party/boost/boost/spirit/home/classic/phoenix/
Dactor.hpp441 A& a_, B& b_, C& c_, D& d_, E& e_, F& f_, G& g_, H& h_ in operator ()()
459 A& a_, B& b_, C& c_, D& d_, E& e_, F& f_, G& g_, H& h_, I& 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 ()()
497 A& a_, B& b_, C& c_, D& d_, E& e_, F& f_, G& g_, H& h_, I& i_, J& j_, in operator ()()
517 A& a_, B& b_, C& c_, D& d_, E& e_, F& f_, G& g_, H& h_, I& i_, J& j_, in operator ()()
538 A& a_, B& b_, C& c_, D& d_, E& e_, F& f_, G& g_, H& h_, I& i_, J& j_, in operator ()()
558 A& a_, B& b_, C& c_, D& d_, E& e_, F& f_, G& g_, H& h_, I& i_, J& j_, in operator ()()
578 A& a_, B& b_, C& c_, D& d_, E& e_, F& f_, G& g_, H& h_, I& i_, J& j_, in operator ()()
/third_party/boost/boost/graph/detail/
Dadjacency_list.hpp604 edges(const directed_edges_helper< Config >& g_) in edges()
635 inline void remove_edge(typename Config::vertex_descriptor u, in remove_edge()
645 inline void remove_out_edge_if(typename Config::vertex_descriptor u, in remove_out_edge_if()
658 inline void remove_edge_if(Predicate pred, directed_graph_helper< Config >& g_) in remove_edge_if()
669 inline void remove_edge( in remove_edge()
678 inline void clear_vertex( in clear_vertex()
693 inline void clear_out_edges( in clear_out_edges()
705 inline typename Config::edges_size_type num_edges( in num_edges()
721 add_edge(typename Config::vertex_descriptor u, in add_edge()
740 inline std::pair< typename Config::edge_descriptor, bool > add_edge( in add_edge()
[all …]
/third_party/boost/libs/proto/test/
Dflatten.cpp89 boost::proto::terminal<char>::type g_ = {'g'}; in test1() local
157 My<boost::proto::terminal<char>::type> g_ = {{'g'}}; in test2() local
/third_party/boost/boost/graph/
Dedge_list.hpp105 edges(const edge_list_impl< G, EI, T, D >& g_) in edges()
196 edges(const edge_list_impl_ra< G, EI, T, D >& g_) in edges()
204 typename edge_list_impl_ra< G, EI, T, D >::vertex_descriptor source( in source()
212 typename edge_list_impl_ra< G, EI, T, D >::vertex_descriptor target( in target()
Dadjacency_matrix.hpp691 out_edges( in out_edges()
713 out_edges( in out_edges()
774 in_edges( in in_edges()
796 in_edges( in in_edges()
835 adjacent_vertices( in adjacent_vertices()
855 vertices(const adjacency_matrix< D, VP, EP, GP, A >& g_) in vertices()
875 edges(const adjacency_matrix< D, VP, EP, GP, A >& g_) in edges()
Dsuccessive_shortest_path_nonnegative_weights.hpp58 const Graph& g_; member in boost::detail::MapReducedWeight
Dgraph_concepts.hpp463 void const_constraints(const Graph& g_) in const_constraints()
Dpush_relabel_max_flow.hpp124 push_relabel(Graph& g_, EdgeCapacityMap cap, in push_relabel()
/third_party/weston/libweston/
Dpixel-formats.c56 #define BITS_RGBA_FIXED(r_, g_, b_, a_) \ argument
/third_party/skia/tests/
DSkVxTest.cpp308 float8 g_ = (4*d*xx + 2*c)*x; in DEF_TEST() local
/third_party/skia/third_party/externals/swiftshader/src/Renderer/
DColor.hpp283 inline Color<T>::Color(T r_, T g_, T b_, T a_) in Color()
/third_party/abseil-cpp/absl/synchronization/internal/
Dgraphcycles_test.cc357 GraphCycles g_; member in absl::synchronization_internal::GraphCyclesTest
/third_party/skia/third_party/externals/abseil-cpp/absl/synchronization/internal/
Dgraphcycles_test.cc357 GraphCycles g_; member in absl::synchronization_internal::GraphCyclesTest
/third_party/boost/boost/graph/distributed/
Dadjacency_list.hpp1019 vec_adj_list_impl<Graph, Config, Base>& g_) in add_local_edge()