| /third_party/boost/boost/graph/planar_detail/ |
| D | add_edge_visitors.hpp | 26 template < typename EdgeIndexMap > struct edge_index_update_visitor
30 typename property_traits< EdgeIndexMap >::value_type edge_index_value_t;
33 EdgeIndexMap em, edge_index_value_t next_index_available) in edge_index_update_visitor()
48 EdgeIndexMap m_em;
|
| D | boyer_myrvold_impl.hpp | 1020 template < typename OutputIterator, typename EdgeIndexMap >
1021 void extract_kuratowski_subgraph(OutputIterator o_itr, EdgeIndexMap em) in extract_kuratowski_subgraph()
1083 EdgeIndexMap > in extract_kuratowski_subgraph()
|
| /third_party/boost/boost/graph/ |
| D | make_biconnected_planar.hpp | 24 template < typename Graph, typename PlanarEmbedding, typename EdgeIndexMap,
27 Graph& g, PlanarEmbedding embedding, EdgeIndexMap em, AddEdgeVisitor& vis) in make_biconnected_planar()
36 EdgeIndexMap > in make_biconnected_planar()
80 template < typename Graph, typename PlanarEmbedding, typename EdgeIndexMap >
82 Graph& g, PlanarEmbedding embedding, EdgeIndexMap em) in make_biconnected_planar()
|
| D | r_c_shortest_paths.hpp | 166 template < class Graph, class VertexIndexMap, class EdgeIndexMap,
171 const EdgeIndexMap& /*edge_index_map*/, in r_c_shortest_paths_dispatch() argument
531 template < class Graph, class VertexIndexMap, class EdgeIndexMap,
535 const EdgeIndexMap& edge_index_map, in r_c_shortest_paths()
558 template < class Graph, class VertexIndexMap, class EdgeIndexMap,
562 const EdgeIndexMap& edge_index_map, in r_c_shortest_paths()
594 template < class Graph, class VertexIndexMap, class EdgeIndexMap,
598 const EdgeIndexMap& edge_index_map, in r_c_shortest_paths()
620 template < class Graph, class VertexIndexMap, class EdgeIndexMap,
624 const EdgeIndexMap& edge_index_map, in r_c_shortest_paths()
|
| D | planar_face_traversal.hpp | 38 typename EdgeIndexMap >
40 Visitor& visitor, EdgeIndexMap em) in planar_face_traversal()
56 typename distinguished_edge_storage_t::iterator, EdgeIndexMap > in planar_face_traversal()
60 typename distinguished_edge_to_edge_storage_t::iterator, EdgeIndexMap > in planar_face_traversal()
|
| D | make_maximal_planar.hpp | 181 typename EdgeIndexMap, typename AddEdgeVisitor >
183 EdgeIndexMap em, AddEdgeVisitor& vis) in make_maximal_planar()
191 typename EdgeIndexMap >
193 Graph& g, PlanarEmbedding embedding, VertexIndexMap vm, EdgeIndexMap em) in make_maximal_planar()
|
| D | howard_cycle_ratio.hpp | 587 typename EdgeWeightMap, typename EdgeIndexMap >
589 VertexIndexMap vim, EdgeWeightMap ewm, EdgeIndexMap eim, in maximum_cycle_mean()
601 typename EdgeIndexMap >
603 EdgeWeightMap ewm, EdgeIndexMap eim, in maximum_cycle_mean()
612 typename EdgeWeightMap, typename EdgeIndexMap >
614 VertexIndexMap vim, EdgeWeightMap ewm, EdgeIndexMap eim, in minimum_cycle_mean()
626 typename EdgeIndexMap >
628 EdgeWeightMap ewm, EdgeIndexMap eim, in minimum_cycle_mean()
|
| D | edge_list.hpp | 158 edge_index_t >::type EdgeIndexMap; in get() typedef
159 return EdgeIndexMap(); in get()
249 edge_index_t >::type EdgeIndexMap; in get() typedef
250 return EdgeIndexMap(); in get()
|
| D | subgraph.hpp | 351 typedef typename property_map< Graph, edge_index_t >::type EdgeIndexMap; typedef in boost::subgraph
353 typename property_traits< EdgeIndexMap >::value_type edge_index_type;
|
| /third_party/boost/libs/graph/example/ |
| D | exterior_properties.cpp | 114 EdgeIndexMap; in main() typedef
115 EdgeIndexMap edge_id = boost::get(boost::edge_index, G); in main()
117 typedef boost::iterator_property_map< int*, EdgeIndexMap, int, int& > in main()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/ |
| D | LazyCallGraph.cpp | 44 EdgeIndexMap.insert({&TargetN, Edges.size()}); in insertEdgeInternal()
49 Edges[EdgeIndexMap.find(&TargetN)->second].setKind(EK); in setEdgeKind()
53 auto IndexMapI = EdgeIndexMap.find(&TargetN); in removeEdgeInternal()
54 if (IndexMapI == EdgeIndexMap.end()) in removeEdgeInternal()
58 EdgeIndexMap.erase(IndexMapI); in removeEdgeInternal()
63 DenseMap<LazyCallGraph::Node *, int> &EdgeIndexMap, in addEdge() argument
65 if (!EdgeIndexMap.insert({&N, Edges.size()}).second) in addEdge()
107 addEdge(Edges->Edges, Edges->EdgeIndexMap, G->get(*Callee), in populateSlow()
121 addEdge(Edges->Edges, Edges->EdgeIndexMap, G->get(F), in populateSlow()
129 addEdge(Edges->Edges, Edges->EdgeIndexMap, G->get(*F), in populateSlow()
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/ |
| D | LazyCallGraph.h | 263 assert(EdgeIndexMap.find(&N) != EdgeIndexMap.end() && "No such edge!");
264 auto &E = Edges[EdgeIndexMap.find(&N)->second];
270 auto EI = EdgeIndexMap.find(&N); in lookup()
271 if (EI == EdgeIndexMap.end()) in lookup()
296 DenseMap<Node *, int> EdgeIndexMap; variable
|