| /third_party/boost/boost/graph/ |
| D | one_bit_color_map.hpp | 42 template < typename IndexMap = identity_property_map > struct one_bit_color_map
47 IndexMap index;
50 typedef typename property_traits< IndexMap >::key_type key_type;
56 std::size_t n, const IndexMap& index = IndexMap()) in one_bit_color_map()
64 template < typename IndexMap >
65 inline one_bit_color_type get(const one_bit_color_map< IndexMap >& pm, in get()
66 typename property_traits< IndexMap >::key_type key) in get()
69 int, bits_per_char = one_bit_color_map< IndexMap >::bits_per_char); in get()
70 typename property_traits< IndexMap >::value_type i = get(pm.index, key); in get()
76 template < typename IndexMap >
[all …]
|
| D | two_bit_color_map.hpp | 44 template < typename IndexMap = identity_property_map > struct two_bit_color_map
47 IndexMap index;
53 typedef typename property_traits< IndexMap >::key_type key_type;
59 std::size_t n, const IndexMap& index = IndexMap()) in two_bit_color_map()
67 template < typename IndexMap >
68 inline two_bit_color_type get(const two_bit_color_map< IndexMap >& pm, in get()
69 typename property_traits< IndexMap >::key_type key) in get()
72 elements_per_char = two_bit_color_map< IndexMap >::elements_per_char); in get()
73 typename property_traits< IndexMap >::value_type i = get(pm.index, key); in get()
80 template < typename IndexMap >
[all …]
|
| D | dijkstra_shortest_paths.hpp | 230 template < class Graph, class IndexMap, class Value, bool KnownNumVertices >
235 template < class Graph, class IndexMap, class Value >
236 struct vertex_property_map_generator_helper< Graph, IndexMap, Value, true >
238 typedef boost::iterator_property_map< Value*, IndexMap > type;
239 static type build(const Graph& g, const IndexMap& index, in build()
249 template < class Graph, class IndexMap, class Value >
250 struct vertex_property_map_generator_helper< Graph, IndexMap, Value, false >
252 typedef boost::vector_property_map< Value, IndexMap > type;
253 static type build(const Graph& g, const IndexMap& index, in build()
260 template < class Graph, class IndexMap, class Value >
[all …]
|
| D | bipartite.hpp | 199 template < typename Graph, typename IndexMap, typename PartitionMap >
201 const Graph& graph, const IndexMap index_map, PartitionMap partition_map) in is_bipartite()
242 template < typename Graph, typename IndexMap >
243 bool is_bipartite(const Graph& graph, const IndexMap index_map) in is_bipartite()
245 typedef one_bit_color_map< IndexMap > partition_map_t; in is_bipartite()
280 template < typename Graph, typename IndexMap, typename PartitionMap,
282 OutputIterator find_odd_cycle(const Graph& graph, const IndexMap index_map, in find_odd_cycle()
295 typedef iterator_property_map< typename predecessors_t::iterator, IndexMap, in find_odd_cycle()
375 template < typename Graph, typename IndexMap, typename OutputIterator >
377 const Graph& graph, const IndexMap index_map, OutputIterator result) in find_odd_cycle()
[all …]
|
| D | dominator_tree.hpp | 65 template < class Graph, class IndexMap, class TimeMap, class PredMap,
82 const IndexMap& indexMap, DomTreePredMap domTreePredMap) in dominator_visitor()
201 typename std::vector< std::deque< Vertex > >::iterator, IndexMap >
234 template < class Graph, class IndexMap, class TimeMap, class PredMap,
238 const IndexMap& indexMap, TimeMap dfnumMap, PredMap parentMap, in lengauer_tarjan_dominator_tree_without_dfs()
252 detail::dominator_visitor< Graph, IndexMap, TimeMap, PredMap, in lengauer_tarjan_dominator_tree_without_dfs()
289 template < class Graph, class IndexMap, class TimeMap, class PredMap,
293 const IndexMap& indexMap, TimeMap dfnumMap, PredMap parentMap, in lengauer_tarjan_dominator_tree()
335 typedef typename property_map< Graph, vertex_index_t >::const_type IndexMap; in lengauer_tarjan_dominator_tree() typedef
337 typename std::vector< VerticesSizeType >::iterator, IndexMap > in lengauer_tarjan_dominator_tree()
[all …]
|
| D | stoer_wagner_min_cut.hpp | 32 template < typename ParityMap, typename WeightMap, typename IndexMap >
35 typedef one_bit_color_map< IndexMap > InternalParityMap;
43 IndexMap index_map) in mas_min_cut_visitor()
148 class IndexMap >
152 KeyedUpdatablePriorityQueue& pq, IndexMap index_map) in stoer_wagner_min_cut()
167 detail::mas_min_cut_visitor< ParityMap, WeightMap, IndexMap > vis( in stoer_wagner_min_cut()
204 class IndexMap >
208 IndexMap index_map) in stoer_wagner_min_cut()
|
| D | boykov_kolmogorov_max_flow.hpp | 73 class IndexMap >
94 DistanceMap dist, IndexMap idx, vertex_descriptor src, in bk_max_flow()
893 IndexMap m_index_map;
906 iterator_property_map< std::vector< bool >::iterator, IndexMap >
914 iterator_property_map< std::vector< bool >::iterator, IndexMap >
919 iterator_property_map< std::vector< long >::iterator, IndexMap >
936 class DistanceMap, class IndexMap >
940 PredecessorMap pre_map, ColorMap color, DistanceMap dist, IndexMap idx, in boykov_kolmogorov_max_flow()
968 BOOST_CONCEPT_ASSERT((ReadablePropertyMapConcept< IndexMap, in boykov_kolmogorov_max_flow()
973 ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap > in boykov_kolmogorov_max_flow()
[all …]
|
| D | dag_shortest_paths.hpp | 80 class WeightMap, class ColorMap, class IndexMap, class Params >
83 DistanceMap distance, WeightMap weight, ColorMap color, IndexMap /*id*/, in dag_sp_dispatch2() argument
101 class WeightMap, class ColorMap, class IndexMap, class Params >
104 DistanceMap distance, WeightMap weight, ColorMap color, IndexMap id, in dag_sp_dispatch1()
|
| D | write_dimacs.hpp | 47 template < class Graph, class CapacityMap, class IndexMap >
48 void write_dimacs_max_flow(const Graph& g, CapacityMap capacity, IndexMap idx, in write_dimacs_max_flow()
|
| /third_party/boost/boost/property_map/ |
| D | vector_property_map.hpp | 19 template<typename T, typename IndexMap = identity_property_map>
24 vector_property_map<T, IndexMap> >
27 typedef typename property_traits<IndexMap>::key_type key_type;
33 vector_property_map(const IndexMap& index = IndexMap()) in vector_property_map()
38 const IndexMap& index = IndexMap()) in vector_property_map()
62 IndexMap& get_index_map() { return index; } in get_index_map()
63 const IndexMap& get_index_map() const { return index; } in get_index_map()
71 typename property_traits<IndexMap>::value_type i = get(index, v); in operator []()
85 IndexMap index;
88 template<typename T, typename IndexMap>
[all …]
|
| D | shared_array_property_map.hpp | 18 template <class T, class IndexMap>
20 : public boost::put_get_helper<T&, shared_array_property_map<T, IndexMap> >
23 typedef typename property_traits<IndexMap>::key_type key_type;
32 const IndexMap& _id = IndexMap()) in shared_array_property_map()
41 IndexMap index;
44 template <class T, class IndexMap>
45 shared_array_property_map<T, IndexMap>
46 make_shared_array_property_map(size_t n, const T&, const IndexMap& index) { in make_shared_array_property_map()
47 return shared_array_property_map<T, IndexMap>(n, index); in make_shared_array_property_map()
|
| D | property_map.hpp | 318 class IndexMap
328 iterator_property_map<RandomAccessIterator, IndexMap,
332 typedef typename property_traits<IndexMap>::key_type key_type;
339 const IndexMap& _id = IndexMap() ) in iterator_property_map()
344 IndexMap index;
371 class IndexMap
381 safe_iterator_property_map<RandomAccessIterator, IndexMap,
385 typedef typename property_traits<IndexMap>::key_type key_type;
393 const IndexMap& _id = IndexMap() ) in safe_iterator_property_map()
400 typename property_traits<IndexMap>::value_type size() const { return n; } in size()
[all …]
|
| /third_party/boost/boost/graph/detail/ |
| D | indexed_properties.hpp | 35 typename IndexMap >
42 typename std::vector< Property >::iterator, IndexMap >
45 typename std::vector< Property >::const_iterator, IndexMap >
60 const IndexMap& index_map = IndexMap()) in get_vertex_bundle()
66 const IndexMap& index_map = IndexMap()) const in get_vertex_bundle()
113 template < typename Derived, typename Descriptor, typename IndexMap >
114 class indexed_vertex_properties< Derived, void, Descriptor, IndexMap >
142 typename IndexMap >
150 typename std::vector< Property >::iterator, IndexMap >
153 typename std::vector< Property >::const_iterator, IndexMap >
[all …]
|
| /third_party/boost/boost/graph/distributed/ |
| D | dijkstra_shortest_paths.hpp | 33 typename WeightMap, typename IndexMap, typename ColorMap,
41 WeightMap weight, IndexMap index_map, ColorMap color_map, in run()
56 typename WeightMap, typename IndexMap, typename ColorMap,
64 WeightMap weight, IndexMap index_map, ColorMap color_map, in run()
79 typename Lookahead, typename WeightMap, typename IndexMap,
87 WeightMap weight, IndexMap index_map, ColorMap color_map, in run()
103 typename Lookahead, typename WeightMap, typename IndexMap,
110 Lookahead lookahead, WeightMap weight, IndexMap index_map, in run_impl()
126 typename Lookahead, typename WeightMap, typename IndexMap,
133 Lookahead lookahead, WeightMap weight, IndexMap index_map, in run()
[all …]
|
| D | breadth_first_search.hpp | 61 template<typename IndexMap>
68 has_not_been_seen(std::size_t n, IndexMap index_map) in has_not_been_seen()
88 IndexMap index_map;
91 template<typename IndexMap>
93 swap(has_not_been_seen<IndexMap>& x, has_not_been_seen<IndexMap>& y) in swap()
|
| D | vertex_list_adaptor.hpp | 83 template<typename IndexMap>
84 class stored_global_index_map : public IndexMap
89 stored_global_index_map(const IndexMap& index_map) : IndexMap(index_map) { in stored_global_index_map()
106 template<typename IndexMap, typename ForwardIterator>
108 initialize_global_index_map(stored_global_index_map<IndexMap>& p, in initialize_global_index_map()
113 typedef typename property_traits<IndexMap>::value_type size_t; in initialize_global_index_map()
|
| /third_party/boost/libs/graph/example/ |
| D | put-get-helper-eg.cpp | 20 template < class RandomAccessIterator, class IndexMap >
24 iterator_property_map< RandomAccessIterator, IndexMap > >
35 const IndexMap& _id = IndexMap()) in iterator_property_map()
46 IndexMap index;
|
| D | tiernan_print_cycles.cpp | 32 typename property_map< Graph, vertex_index_t >::const_type IndexMap; in cycle() typedef
33 IndexMap indices = get(vertex_index, g); in cycle()
|
| D | hawick_circuits.cpp | 32 boost::vertex_index_t >::const_type IndexMap; in cycle() typedef
34 IndexMap indices = get(boost::vertex_index, g); in cycle()
|
| /third_party/boost/boost/property_map/parallel/ |
| D | global_index_map.hpp | 18 template<typename IndexMap, typename GlobalMap>
22 typedef typename property_traits<IndexMap>::key_type key_type;
23 typedef typename property_traits<IndexMap>::value_type value_type;
29 IndexMap index_map, GlobalMap global) in global_index_map()
64 IndexMap index_map;
|
| /third_party/boost/libs/property_map/test/ |
| D | property_map_cc.cpp | 63 typedef readable_property_map_archetype<Key, std::ptrdiff_t> IndexMap; in main() typedef
64 typedef iterator_property_map<Iterator, IndexMap in main()
75 typedef readable_property_map_archetype<Key, std::ptrdiff_t> IndexMap; in main() typedef
76 typedef iterator_property_map<Iterator, IndexMap in main()
110 typedef readable_property_map_archetype<Key, std::ptrdiff_t> IndexMap; in main() typedef
111 typedef shared_array_property_map<Value, IndexMap> PMap; in main()
|
| /third_party/boost/libs/graph/test/ |
| D | index_graph.cpp | 17 typedef typename property_map< Graph, vertex_index_t >::type IndexMap; in test() typedef
22 (void)(IndexMap) get(vertex_index, g); in test()
72 typedef typename property_map< Graph, vertex_index_t >::type IndexMap; in build() typedef
79 (void)(IndexMap) get(vertex_index, g); in build()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/ |
| D | HexagonBlockRanges.cpp | 290 void HexagonBlockRanges::computeInitialLiveRanges(InstrIndexMap &IndexMap, in computeInitialLiveRanges() argument
294 MachineBasicBlock &B = IndexMap.getBlock(); in computeInitialLiveRanges()
318 IndexType Index = IndexMap.getIndex(&In); in computeInitialLiveRanges()
422 InstrIndexMap &IndexMap) { in computeLiveMap() argument
424 LLVM_DEBUG(dbgs() << __func__ << ": index map\n" << IndexMap << '\n'); in computeLiveMap()
425 computeInitialLiveRanges(IndexMap, LiveMap); in computeLiveMap()
432 InstrIndexMap &IndexMap, RegToRangeMap &LiveMap) { in computeDeadMap() argument
435 auto addDeadRanges = [&IndexMap,&LiveMap,&DeadMap] (RegisterRef R) -> void { in computeDeadMap()
447 IndexType DE = IndexMap.getPrevIndex(A->start()); in computeDeadMap()
456 IndexType DS = IndexMap.getNextIndex(AE); in computeDeadMap()
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/DebugInfo/CodeView/ |
| D | TypeStreamMerger.cpp | 66 : IndexMap(SourceToDest) { in TypeStreamMerger()
120 return remapIndex(Idx, IndexMap); in remapTypeIndex()
124 return remapIndex(Idx, IndexMap); in remapItemIndex()
193 SmallVectorImpl<TypeIndex> &IndexMap; member in __anone8f39a730111::TypeStreamMerger
208 assert(IndexMap.size() == slotForIndex(CurIndex) && in addMapping()
210 IndexMap.push_back(Idx); in addMapping()
212 assert(slotForIndex(CurIndex) < IndexMap.size()); in addMapping()
213 IndexMap[slotForIndex(CurIndex)] = Idx; in addMapping()
381 assert((IsSecondPass || IndexMap.size() == slotForIndex(CurIndex)) && in remapType()
|
| /third_party/boost/libs/parameter/test/literate/ |
| D | predicate-requirements0.cpp | 119 template <typename Size, typename IndexMap>
122 , IndexMap
126 default_color_map(Size num_vertices, IndexMap const& index_map) in default_color_map()
131 , IndexMap in default_color_map()
|