| /third_party/boost/libs/intrusive/test/ |
| D | test_container.hpp | 178 typedef typename Container::key_of_value key_of_value; in test_common_unordered_and_associative_container() typedef
192 BOOST_TEST( cc.find(key_of_value()(*di), c.hash_function(), c.key_eq()) != cc.end() ); in test_common_unordered_and_associative_container()
193 …std::pair<const_iterator, const_iterator> rdi = cc.equal_range(key_of_value()(*di), c.hash_functio… in test_common_unordered_and_associative_container()
195 …ost::intrusive::iterator_distance(rdi.first, rdi.second)) == cc.count(key_of_value()(*di), c.hash_… in test_common_unordered_and_associative_container()
200 BOOST_TEST( c.find(key_of_value()(*ci)) != c.end() ); in test_common_unordered_and_associative_container()
201 …std::pair<iterator, iterator> rci = c.equal_range(key_of_value()(*ci), c.hash_function(), c.key_eq… in test_common_unordered_and_associative_container()
203 size_type const sc = c.count(key_of_value()(*ci), c.hash_function(), c.key_eq()); in test_common_unordered_and_associative_container()
205 BOOST_TEST(sc == c.erase(key_of_value()(*ci), c.hash_function(), c.key_eq())); in test_common_unordered_and_associative_container()
219 c.erase(key_of_value()(*da), c.hash_function(), c.key_eq()); in test_common_unordered_and_associative_container()
223 ( key_of_value()(*da), c.hash_function(), c.key_eq(), detail::null_disposer() ); in test_common_unordered_and_associative_container()
[all …]
|
| D | generic_multiset_test.hpp | 183 typedef typename multiset_type::key_of_value key_of_value; in test_merge() typedef
209 BOOST_TEST (*testset2.find(key_of_value()(cmp_val)) == values[5]); in test_merge()
211 BOOST_TEST (&*(++testset2.find(key_of_value()(cmp_val))) == &values[1]); in test_merge()
220 BOOST_TEST (*testset1.find(key_of_value()(cmp_val)) == values[5]); in test_merge()
222 BOOST_TEST (&*(++testset1.find(key_of_value()(cmp_val))) == &values[1]); in test_merge()
232 typedef typename multiset_type::key_of_value key_of_value; in test_find() typedef
241 iterator i = testset.find (key_of_value()(cmp_val)); in test_find()
245 std::pair<iterator,iterator> range = testset.equal_range (key_of_value()(cmp_val)); in test_find()
253 BOOST_TEST (testset.find(key_of_value()(cmp_val)) == testset.end()); in test_find()
267 …range = testset.bounded_range (key_of_value()(cmp_val_lower), key_of_value()(cmp_val_upper), true,… in test_find()
[all …]
|
| D | generic_set_test.hpp | 199 typedef typename set_type::key_of_value key_of_value; in test_insert_advanced() typedef
211 BOOST_TEST ((!testset.insert_check(key_of_value()(v), priority_of_value()(v), data).second)); in test_insert_advanced()
212 …BOOST_TEST ((!testset.insert_check(testset.begin(), key_of_value()(v), priority_of_value()(v), dat… in test_insert_advanced()
223 typedef typename set_type::key_of_value key_of_value; in test_insert_advanced() typedef
232 BOOST_TEST ((!testset.insert_check(key_of_value()(v), data).second)); in test_insert_advanced()
234 BOOST_TEST ((!testset.insert_check(testset.begin(), key_of_value()(v), data).second)); in test_insert_advanced()
313 typedef typename set_type::key_of_value key_of_value; in test_find() typedef
321 iterator i = testset.find(key_of_value()(cmp_val)); in test_find()
326 std::pair<iterator,iterator> range = testset.equal_range (key_of_value()(cmp_val)); in test_find()
334 BOOST_TEST (testset.find (key_of_value()(cmp_val)) == testset.end()); in test_find()
[all …]
|
| D | test_common.hpp | 26 …typedef typename pack_options< empty_default, KeyOfValueOption >::type::key_of_value key_of_value_…
29 … , key_of_value<int_holder_key_of_value<typename Map::value_type> >
36 BOOST_STATIC_ASSERT(( boost::intrusive::detail::is_same< typename Map::key_of_value
48 BOOST_STATIC_ASSERT(( boost::intrusive::detail::is_same< typename Map::key_of_value
|
| D | unordered_test.hpp | 154 typedef typename unordered_set_type::key_of_value key_of_value; in test_insert() typedef
163 BOOST_TEST ((!testset.insert_check(key_of_value()(values[2]), commit_data).second)); in test_insert()
164 BOOST_TEST (( testset.insert_check(key_of_value()(values[0]), commit_data).second)); in test_insert()
626 typedef typename unordered_type::key_of_value key_of_value; in test_find() typedef
637 BOOST_TEST (testset.count(key_of_value()(cmp_val)) == (is_multikey ? 2 : 1)); in test_find()
638 iterator i = testset.find (key_of_value()(cmp_val)); in test_find()
644 std::pair<iterator,iterator> range = testset.equal_range (key_of_value()(cmp_val)); in test_find()
650 BOOST_TEST (testset.find (key_of_value()(cmp_val)) == testset.end()); in test_find()
651 BOOST_TEST (testset.count(key_of_value()(cmp_val)) == 0); in test_find()
|
| D | unordered_test_common.hpp | 62 < Map, key_of_value<int_holder_key_of_value<value_type> >, void
|
| D | bs_test_common.hpp | 55 < Map, key_of_value<int_holder_key_of_value<value_type> >, void
|
| /third_party/boost/boost/intrusive/detail/ |
| D | key_nodeptr_comp.hpp | 47 >::type key_of_value; typedef
49 <typename ValueTraits::pointer, KeyTypeKeyCompare, key_of_value> base_t;
72 typedef typename types_t::key_of_value key_of_value; typedef
91 { return base().get()(key_of_value()(*traits_->to_value_ptr(t1))); } in operator ()()
|
| D | tree_value_compare.hpp | 57 typedef KeyOfValue key_of_value; typedef
134 typedef KeyOfValue key_of_value; typedef
|
| /third_party/abseil-cpp/absl/container/ |
| D | btree_benchmark.cc | 66 typename KeyOfValue<typename T::key_type, V>::type key_of_value; in BM_InsertImpl() local
82 container.erase(key_of_value(values[x])); in BM_InsertImpl()
119 typename KeyOfValue<typename T::key_type, V>::type key_of_value; in BM_InsertEnd() local
127 typename T::key_type k = key_of_value(v); in BM_InsertEnd()
161 typename KeyOfValue<typename T::key_type, V>::type key_of_value; in BM_LookupImpl() local
171 benchmark::DoNotOptimize(container.find(key_of_value(values[idx]))); in BM_LookupImpl()
193 typename KeyOfValue<typename T::key_type, V>::type key_of_value; in BM_Delete() local
204 container.erase(key_of_value(values[x])); in BM_Delete()
220 typename KeyOfValue<typename T::key_type, V>::type key_of_value; in BM_DeleteRange() local
235 auto itr = container.find(key_of_value(values[start_index])); in BM_DeleteRange()
[all …]
|
| D | btree_test.cc | 131 typename TreeType::value_type>::type key_of_value; in value_check() local
132 const key_type &key = key_of_value(v); in value_check()
410 typename KeyOfValue<typename T::key_type, V>::type key_of_value; in DoTest() local
428 CheckPairEquals(*b_copy.find(key_of_value(values[i])), values[i]); in DoTest()
435 CheckPairEquals(*b_range.find(key_of_value(values[i])), values[i]); in DoTest()
447 CheckPairEquals(*b_range.find(key_of_value(values[i])), values[i]); in DoTest()
465 CheckPairEquals(*b_range.find(key_of_value(values[i])), values[i]); in DoTest()
474 CheckPairEquals(*b_range.find(key_of_value(values[i])), values[i]); in DoTest()
480 mutable_b.erase(key_of_value(values[i])); in DoTest()
482 ASSERT_EQ(mutable_b.erase(key_of_value(values[i])), 0); in DoTest()
[all …]
|
| /third_party/boost/boost/container/detail/ |
| D | pair_key_mapped_of_value.hpp | 34 const key_type & key_of_value(const Pair &p) const in key_of_value() function
42 key_type & key_of_value(Pair &p) const in key_of_value() function
|
| D | compare_functors.hpp | 83 typedef KeyOfValue key_of_value; typedef
89 return key_of_value()(n.get_data()); in key_from()
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/container/ |
| D | btree_benchmark.cc | 66 typename KeyOfValue<typename T::key_type, V>::type key_of_value; in BM_InsertImpl() local
82 container.erase(key_of_value(values[x])); in BM_InsertImpl()
128 typename KeyOfValue<typename T::key_type, V>::type key_of_value; in BM_LookupImpl() local
138 benchmark::DoNotOptimize(container.find(key_of_value(values[idx]))); in BM_LookupImpl()
160 typename KeyOfValue<typename T::key_type, V>::type key_of_value; in BM_Delete() local
171 container.erase(key_of_value(values[x])); in BM_Delete()
187 typename KeyOfValue<typename T::key_type, V>::type key_of_value; in BM_DeleteRange() local
202 auto itr = container.find(key_of_value(values[start_index])); in BM_DeleteRange()
233 typename KeyOfValue<typename T::key_type, V>::type key_of_value; in BM_QueueAddRem() local
282 container.erase(key_of_value(g(offset - half + remove_keys[idx]))); in BM_QueueAddRem()
[all …]
|
| D | btree_test.cc | 132 typename TreeType::value_type>::type key_of_value; in value_check() local
133 const key_type &key = key_of_value(v); in value_check()
411 typename KeyOfValue<typename T::key_type, V>::type key_of_value; in DoTest() local
429 CheckPairEquals(*b_copy.find(key_of_value(values[i])), values[i]); in DoTest()
436 CheckPairEquals(*b_range.find(key_of_value(values[i])), values[i]); in DoTest()
448 CheckPairEquals(*b_range.find(key_of_value(values[i])), values[i]); in DoTest()
466 CheckPairEquals(*b_range.find(key_of_value(values[i])), values[i]); in DoTest()
475 CheckPairEquals(*b_range.find(key_of_value(values[i])), values[i]); in DoTest()
481 mutable_b.erase(key_of_value(values[i])); in DoTest()
483 ASSERT_EQ(mutable_b.erase(key_of_value(values[i])), 0); in DoTest()
[all …]
|
| /third_party/boost/libs/intrusive/example/ |
| D | doc_map.cpp | 44 typedef set< MyClass, key_of_value<first_int_is_key> > OrderedMap;
45 typedef unordered_set< MyClass, key_of_value<first_int_is_key> > UnorderedMap;
|
| /third_party/boost/boost/intrusive/ |
| D | options.hpp | 70 BOOST_INTRUSIVE_OPTION_TYPE(key_of_value, KeyOfValue, KeyOfValue, key_of_value)
|
| D | bstree.hpp | 73 typedef void key_of_value; typedef
261 < VoidOrKeyOfValue, value_type>::type key_of_value; typedef
262 typedef typename key_of_value::type key_type;
267 <ValuePtr, key_compare, key_of_value> value_compare;
292 typedef typename key_types::key_of_value key_of_value; typedef
367 { typedef detail::key_nodeptr_comp<KeyTypeKeyCompare, value_traits, key_of_value> type; };
372 …return detail::key_nodeptr_comp<KeyTypeKeyCompare, value_traits, key_of_value>(comp, &this->get_va… in key_node_comp()
638 …pedef BOOST_INTRUSIVE_IMPDEF(typename data_type::key_of_value) key_of_… typedef in boost::intrusive::bstree_impl
1137 … (this->header_ptr(), key_of_value()(value), this->key_node_comp(this->key_comp()), commit_data)); in insert_unique()
1163 …(this->header_ptr(), hint.pointed_node(), key_of_value()(value), this->key_node_comp(this->key_com… in insert_unique()
[all …]
|
| D | hashtable.hpp | 591 typedef void key_of_value; typedef
1044 < VoidOrKeyOfValue, T>::type key_of_value; typedef
1045 typedef typename key_of_value::type key_type;
1084 typedef typename hash_key_types_base<value_type, VoidOrKeyOfValue>::key_of_value key_of_value; typedef
1104 { return this->priv_hasher()(key_of_value()(v)); } in priv_stored_or_compute_hash()
1400 typedef typename hash_types_base::key_of_value key_of_value; typedef
1693 typedef typename hash_types_base::key_of_value key_of_value; typedef in boost::intrusive::hashtable_impl
2098 … (key_of_value()(value), this->priv_hasher(), this->priv_equal(), bucket_num, hash_value, prev); in insert_equal()
2141 std::pair<iterator, bool> ret = this->insert_unique_check(key_of_value()(value), commit_data); in insert_unique()
3120 std::pair<const_iterator, const_iterator> eqx(x.equal_range(key_of_value()(*ix))), in operator ==()
[all …]
|
| D | set.hpp | 67 typedef typename implementation_defined::key_of_value key_of_value; typedef in boost::intrusive::set_impl
484 , typename packed_options::key_of_value
604 typedef typename implementation_defined::key_of_value key_of_value; typedef in boost::intrusive::multiset_impl
978 , typename packed_options::key_of_value
|
| D | avl_set.hpp | 65 typedef typename implementation_defined::key_of_value key_of_value; typedef in boost::intrusive::avl_set_impl
484 , typename packed_options::key_of_value
604 typedef typename implementation_defined::key_of_value key_of_value; typedef in boost::intrusive::avl_multiset_impl
978 , typename packed_options::key_of_value
|
| D | treap_set.hpp | 67 typedef typename implementation_defined::key_of_value key_of_value; typedef in boost::intrusive::treap_set_impl
497 , typename packed_options::key_of_value
625 typedef typename implementation_defined::key_of_value key_of_value; typedef in boost::intrusive::treap_multiset_impl
1012 , typename packed_options::key_of_value
|
| D | splay_set.hpp | 65 typedef typename implementation_defined::key_of_value key_of_value; typedef in boost::intrusive::splay_set_impl
505 , typename packed_options::key_of_value
625 typedef typename implementation_defined::key_of_value key_of_value; typedef in boost::intrusive::splay_multiset_impl
1015 , typename packed_options::key_of_value
|
| D | sg_set.hpp | 65 typedef typename implementation_defined::key_of_value key_of_value; typedef in boost::intrusive::sg_set_impl
493 , typename packed_options::key_of_value
613 typedef typename implementation_defined::key_of_value key_of_value; typedef in boost::intrusive::sg_multiset_impl
999 , typename packed_options::key_of_value
|
| D | treap.hpp | 120 typedef typename implementation_defined::key_of_value key_of_value; typedef in boost::intrusive::treap_impl
517 …std::pair<iterator, bool> ret = this->insert_unique_check(key_of_value()(value), priority_of_value… in insert_unique()
541 …std::pair<iterator, bool> ret = this->insert_unique_check(hint, key_of_value()(value), priority_of… in insert_unique()
1268 , typename packed_options::key_of_value
|