| /third_party/boost/libs/container/test/ |
| D | flat_set_test.cpp | 167 flat_set<int> fset(ordered_unique_range, int_set.begin(), int_set.end()); in flat_tree_ordered_insertion_test()
172 fset.insert(ordered_unique_range, int_set.begin(), int_set.end()); in flat_tree_ordered_insertion_test()
176 fset.insert(ordered_unique_range, int_set.begin(), int_set.end()); in flat_tree_ordered_insertion_test()
182 fset.insert(ordered_unique_range, int_set2.begin(), int_set2.end()); in flat_tree_ordered_insertion_test()
192 fset.insert(ordered_unique_range, int_even_set.begin(), int_even_set.end()); in flat_tree_ordered_insertion_test()
204 fset.insert(ordered_unique_range, int_even_set.begin(), int_even_set.end()); in flat_tree_ordered_insertion_test()
212 fset.insert(ordered_unique_range, int_even_set.begin(), int_even_set.end()); in flat_tree_ordered_insertion_test()
223 fset.insert(ordered_unique_range, int_even_set.begin(), int_even_set.end()); in flat_tree_ordered_insertion_test()
231 fset.insert(ordered_unique_range, int_even_set.begin(), int_even_set.end()); in flat_tree_ordered_insertion_test()
246 fset.insert(ordered_unique_range, int_even_set.begin(), int_even_set.end()); in flat_tree_ordered_insertion_test()
[all …]
|
| D | flat_map_test.cpp | 147 flat_map<int, int> fmap(ordered_unique_range, int_map.begin(), int_map.end()); in flat_tree_ordered_insertion_test()
152 fmap.insert(ordered_unique_range, int_map.begin(), int_map.end()); in flat_tree_ordered_insertion_test()
156 fmap.insert(ordered_unique_range, int_map.begin(), int_map.end()); in flat_tree_ordered_insertion_test()
162 fmap.insert(ordered_unique_range, int_map2.begin(), int_map2.end()); in flat_tree_ordered_insertion_test()
172 fmap.insert(ordered_unique_range, int_even_map.begin(), int_even_map.end()); in flat_tree_ordered_insertion_test()
241 auto fmap = flat_map(ordered_unique_range, int_map.begin(), int_map.end()); in constructor_template_auto_deduction_test()
250 auto fmap = flat_map(ordered_unique_range, int_map.begin(), int_map.end(), comp_int_t()); in constructor_template_auto_deduction_test()
259 …auto fmap = flat_map(ordered_unique_range, int_map.begin(), int_map.end(), comp_int_t(), alloc_pai… in constructor_template_auto_deduction_test()
268 … auto fmap = flat_map(ordered_unique_range, int_map.begin(), int_map.end(),alloc_pair_int_t()); in constructor_template_auto_deduction_test()
338 fmap.adopt_sequence(ordered_unique_range, boost::move(seq)); in flat_tree_extract_adopt_test()
|
| D | set_test.hpp | 270 ( ordered_unique_range in set_test()
835 SetType sil_ordered(ordered_unique_range, ilu); in test_set_methods_with_initializer_list_as_argument_for()
884 SetType s0(ordered_unique_range, il); in instantiate_constructors()
885 SetType s1(ordered_unique_range, il,comp); in instantiate_constructors()
886 SetType s3(ordered_unique_range, il,comp, a); in instantiate_constructors()
890 SetType s0(ordered_unique_range, &value, &value); in instantiate_constructors()
891 SetType s1(ordered_unique_range, &value, &value ,comp); in instantiate_constructors()
892 SetType s2(ordered_unique_range, &value, &value ,comp, a); in instantiate_constructors()
|
| D | set_test.cpp | 267 auto fset = set(ordered_unique_range, int_set.begin(), int_set.end()); in constructor_template_auto_deduction_test()
276 auto fset = set(ordered_unique_range, int_set.begin(), int_set.end(), comp_int_t()); in constructor_template_auto_deduction_test()
285 …auto fset = set(ordered_unique_range, int_set.begin(), int_set.end(), comp_int_t(), alloc_int_t()); in constructor_template_auto_deduction_test()
294 auto fset = set(ordered_unique_range, int_set.begin(), int_set.end(), alloc_int_t()); in constructor_template_auto_deduction_test()
|
| D | map_test.cpp | 415 auto fmap = map(ordered_unique_range, int_map.begin(), int_map.end()); in constructor_template_auto_deduction_test()
424 auto fmap = map(ordered_unique_range, int_map.begin(), int_map.end(), comp_int_t()); in constructor_template_auto_deduction_test()
433 …auto fmap = map(ordered_unique_range, int_map.begin(), int_map.end(), comp_int_t(), alloc_pair_int… in constructor_template_auto_deduction_test()
442 auto fmap = map(ordered_unique_range, int_map.begin(), int_map.end(),alloc_pair_int_t()); in constructor_template_auto_deduction_test()
|
| D | map_test.hpp | 1155 const MapType sil_ordered(ordered_unique_range, il); in test_map_support_for_initialization_list_for()
1205 MapType s0(ordered_unique_range, il); in instantiate_constructors()
1206 MapType s1(ordered_unique_range, il, comp); in instantiate_constructors()
1207 MapType s3(ordered_unique_range, il, comp, a); in instantiate_constructors()
1211 MapType s0(ordered_unique_range, &value, &value); in instantiate_constructors()
1212 MapType s1(ordered_unique_range, &value, &value ,comp); in instantiate_constructors()
1213 MapType s2(ordered_unique_range, &value, &value ,comp, a); in instantiate_constructors()
|
| /third_party/boost/boost/interprocess/containers/ |
| D | containers_fwd.hpp | 35 using boost::container::ordered_unique_range;
|
| /third_party/boost/boost/container/ |
| D | flat_set.hpp | 225 : tree_t(ordered_unique_range, first, last) in flat_set()
241 : tree_t(ordered_unique_range, first, last, comp) in flat_set()
257 : tree_t(ordered_unique_range, first, last, comp, a) in flat_set()
273 : tree_t(ordered_unique_range, first, last, Compare(), a) in flat_set()
324 : tree_t(ordered_unique_range, il.begin(), il.end()) in flat_set()
338 : tree_t(ordered_unique_range, il.begin(), il.end(), comp) in flat_set()
352 : tree_t(ordered_unique_range, il.begin(), il.end(), comp, a) in flat_set()
725 { this->tree_t::insert_unique(ordered_unique_range, first, last); } in insert()
747 { this->tree_t::insert_unique(ordered_unique_range, il.begin(), il.end()); } in insert()
|
| D | container_fwd.hpp | 342 static const ordered_unique_range_t ordered_unique_range = ordered_unique_range_t(); variable
372 (void)ordered_unique_range; in dummy()
|
| D | flat_map.hpp | 397 : m_flat_tree(ordered_unique_range in flat_map()
413 : m_flat_tree(ordered_unique_range in flat_map()
430 : m_flat_tree( ordered_unique_range in flat_map()
1154 { m_flat_tree.insert_unique(ordered_unique_range, first, last); } in insert()
1183 m_flat_tree.insert_unique(ordered_unique_range in insert()
|
| /third_party/boost/libs/interprocess/test/ |
| D | set_test.hpp | 117 ( ordered_unique_range in set_test()
|
| D | map_test.hpp | 139 ( ordered_unique_range in map_test()
|
| /third_party/boost/libs/container/bench/ |
| D | bench_set.hpp | 382 …C c(boost::container::ordered_unique_range, sorted_unique_range.begin(), sorted_unique_range.end()… in extensions_time()
|
| /third_party/boost/libs/container/doc/ |
| D | container.qbk | 570 …e_insertion Ordered range insertion for associative containers (['ordered_unique_range], ['ordered…
1511 …oost.org/trac/boost/ticket/12117 Trac #12117: ['"flat_set constructor with ordered_unique_range"]].
|
| /third_party/boost/doc/html/ |
| D | doc_HTML.manifest | 830 boost/container/ordered_unique_range.html
|