| /third_party/boost/boost/intrusive/detail/ |
| D | tree_value_compare.hpp | 80 BOOST_INTRUSIVE_FORCEINLINE const key_compare &key_comp() const in key_comp() function
84 { return this->key_comp()(key); } in operator ()()
87 { return this->key_comp()(KeyOfValue()(value)); } in operator ()()
92 { return this->key_comp()(nonkey); } in operator ()()
95 { return this->key_comp()(key1, key2); } in operator ()()
98 { return this->key_comp()(KeyOfValue()(value1), KeyOfValue()(value2)); } in operator ()()
101 { return this->key_comp()(key1, KeyOfValue()(value2)); } in operator ()()
104 { return this->key_comp()(KeyOfValue()(value1), key2); } in operator ()()
109 { return this->key_comp()(key1, nonkey2); } in operator ()()
114 { return this->key_comp()(nonkey1, key2); } in operator ()()
[all …]
|
| /third_party/boost/boost/container/detail/ |
| D | tree.hpp | 453 BOOST_CONTAINER_FORCEINLINE const key_compare &key_comp() const in key_comp() function
456 BOOST_CONTAINER_FORCEINLINE key_compare &key_comp() in key_comp() function
460 { return this->key_comp()(key1, key2); } in operator ()()
464 { return this->key_comp()(key1, this->key_from(nonkey2)); } in operator ()()
468 { return this->key_comp()(this->key_from(nonkey1), key2); } in operator ()()
472 { return this->key_comp()(this->key_from(nonkey1), this->key_from(nonkey2)); } in operator ()()
869 BOOST_CONTAINER_FORCEINLINE key_compare key_comp() const in key_comp() function in boost::container::dtl::tree
870 { return this->icont().value_comp().predicate().key_comp(); } in key_comp()
962 this->icont().insert_unique_check(key, KeyNodeCompare(key_comp()), data); in insert_unique_check()
971 this->icont().insert_unique_check(hint.get(), key, KeyNodeCompare(key_comp()), data); in insert_unique_check()
[all …]
|
| /third_party/boost/boost/move/algo/detail/ |
| D | adaptive_sort_merge.hpp | 274 , KeyCompare key_comp in find_next_block() argument
293 (!comp(min_val, cur_val) && key_comp(cur_key, min_key)); in find_next_block()
305 , KeyCompare key_comp in merge_blocks_bufferless() argument
317 …E_SORT_INVARIANT(boost::movelib::is_sorted_and_unique(key_first, key_first + key_count, key_comp)); in merge_blocks_bufferless()
318 …block_b || n_block_a == count_if_with(key_first, key_first + key_count, key_comp, key_first[n_bloc… in merge_blocks_bufferless()
333 …size_type const next_key_idx = find_next_block(key_range2, key_comp, f, l_block, min_check, max_ch… in merge_blocks_bufferless()
360 bool is_range2_A = key_mid == (key_first+key_count) || key_comp(*key_next, *key_mid); in merge_blocks_bufferless()
672 , KeyCompare key_comp in combine_params() argument
698 initialize_keys(keys, keys + needed_keys_count(n_block_a, n_block_b), key_comp, xbuf); in combine_params()
928 , KeyCompare key_comp in op_merge_blocks_with_irreg() argument
[all …]
|
| /third_party/boost/libs/intrusive/test/ |
| D | test_container.hpp | 290 BOOST_TEST( cc.find(key_of_value()(*di), c.key_comp()) != cc.end() ); in test_common_unordered_and_associative_container()
291 … std::pair<const_iterator, const_iterator> rdi = cc.equal_range(key_of_value()(*di), c.key_comp()); in test_common_unordered_and_associative_container()
293 …trusive::iterator_distance(rdi.first, rdi.second)) == cc.count(key_of_value()(*di), c.key_comp())); in test_common_unordered_and_associative_container()
299 std::pair<iterator, iterator> rci = c.equal_range(key_of_value()(*ci), c.key_comp()); in test_common_unordered_and_associative_container()
301 size_type const sc = c.count(key_of_value()(*ci), c.key_comp()); in test_common_unordered_and_associative_container()
303 BOOST_TEST(sc == c.erase(key_of_value()(*ci), c.key_comp())); in test_common_unordered_and_associative_container()
317 c.erase(key_of_value()(*da), c.key_comp()); in test_common_unordered_and_associative_container()
320 …size_type second_erase = c.erase_and_dispose( key_of_value()(*da), c.key_comp(), detail::null_disp… in test_common_unordered_and_associative_container()
323 BOOST_TEST( c.count(key_of_value()(*da), c.key_comp()) == 0 ); in test_common_unordered_and_associative_container()
324 BOOST_TEST( c.count(key_of_value()(*db), c.key_comp()) != 0 ); in test_common_unordered_and_associative_container()
[all …]
|
| /third_party/boost/boost/intrusive/ |
| D | bstree.hpp | 320 BOOST_INTRUSIVE_FORCEINLINE key_compare key_comp() const in key_comp() function
321 { return this->comp().key_comp(); } in key_comp()
325 { return this->lower_bound(key, this->key_comp()); } in lower_bound()
328 { return this->lower_bound(key, this->key_comp()); } in lower_bound()
346 { return this->upper_bound(key, this->key_comp()); } in upper_bound()
356 { return this->upper_bound(key, this->key_comp()); } in upper_bound()
377 { return this->find(key, this->key_comp()); } in find()
387 { return this->find(key, this->key_comp()); } in find()
398 { return this->equal_range(key, this->key_comp()); } in equal_range()
411 { return this->equal_range(key, this->key_comp()); } in equal_range()
[all …]
|
| D | sgtree.hpp | 407 key_compare key_comp() const;
454 (this->tree_type::header_ptr(), to_insert, this->key_node_comp(this->key_comp()) in insert_equal()
469 …his->tree_type::header_ptr(), hint.pointed_node(), to_insert, this->key_node_comp(this->key_comp()) in insert_equal()
490 (key_of_value()(value), this->key_comp(), commit_data); in insert_unique()
501 (hint, key_of_value()(value), this->key_comp(), commit_data); in insert_unique()
537 { return this->insert_unique_check(key, this->key_comp(), commit_data); } in insert_unique_check()
542 { return this->insert_unique_check(hint, key, this->key_comp(), commit_data); } in insert_unique_check()
643 { return this->erase(key, this->key_comp()); } in erase()
735 … ( this->header_ptr(), this->key_node_comp(this->key_comp()), this->size(), max_tree1_size in merge_unique()
765 … ( this->header_ptr(), this->key_node_comp(this->key_comp()), this->size(), max_tree1_size in merge_equal()
|
| D | treap.hpp | 348 key_compare key_comp() const;
441 , this->key_node_comp(this->key_comp()) in insert_equal()
471 , this->key_node_comp(this->key_comp()) in insert_equal()
603 …{ return this->insert_unique_check(key, this->key_comp(), prio, this->priv_pcomp(), commit_data);… in insert_unique_check()
635 …{ return this->insert_unique_check(hint, key, this->key_comp(), prio, this->priv_pcomp(), commit_… in insert_unique_check()
888 { return this->erase(key, this->key_comp()); } in erase()
1052 ( this->header_ptr(), this->key_node_comp(this->key_comp()) in merge_unique()
1077 ( this->header_ptr(), this->key_node_comp(this->key_comp()) in merge_equal()
|
| /third_party/boost/boost/phoenix/stl/container/ |
| D | container.hpp | 531 struct key_comp struct
537 struct key_comp struct
544 : result_of::key_comp<C>
548 typename result_of::key_comp<C>::type
551 return c.key_comp(); in operator ()()
806 BOOST_PHOENIX_ADAPT_CALLABLE(key_comp, stl::key_comp, 1)
|
| /third_party/boost/boost/move/algo/ |
| D | adaptive_sort.hpp | 157 , KeyCompare key_comp in adaptive_sort_combine_blocks() argument
190 combine_params( keys, key_comp, l_cur_combined in adaptive_sort_combine_blocks()
198 (keys, key_comp, combined_first, l_block, 0u, n_block_a, n_block_b, l_irreg2, comp); in adaptive_sort_combine_blocks()
202 … (keys, key_comp, combined_first, l_block, 0u, n_block_a, n_block_b, l_irreg2, comp, xbuf_used); in adaptive_sort_combine_blocks()
220 combine_params( keys, key_comp, l_cur_combined in adaptive_sort_combine_blocks()
227 … (keys, key_comp, combined_first, l_block, n_block_a, n_block_b, l_irreg2, comp, xbuf_used); in adaptive_sort_combine_blocks()
|
| /third_party/protobuf/src/google/protobuf/ |
| D | descriptor_database.cc | 643 file.name(), by_name_.key_comp())) { in AddFile()
718 FindLastLessOrEqual(&by_symbol_flat_, entry, by_symbol_.key_comp()); in AddSymbol()
758 by_extension_.key_comp())) { in AddExtension()
783 FindLastLessOrEqual(&by_symbol_flat_, name, by_symbol_.key_comp()); in FindSymbolOnlyFlat()
798 std::make_tuple(containing_type, field_number), by_extension_.key_comp()); in FindExtension()
811 s->key_comp()); in MergeIntoFlat()
831 std::make_tuple(containing_type, 0), by_extension_.key_comp()); in FindAllExtensionNumbers()
862 filename, by_name_.key_comp()); in FindFile()
|
| /third_party/abseil-cpp/absl/container/ |
| D | btree_set.h | 345 using Base::key_comp;
648 using Base::key_comp;
|
| D | btree_map.h | 428 using Base::key_comp;
736 using Base::key_comp;
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/container/ |
| D | btree_set.h | 345 using Base::key_comp;
648 using Base::key_comp;
|
| D | btree_map.h | 427 using Base::key_comp;
735 using Base::key_comp;
|
| /third_party/boost/boost/bimap/container_adaptor/ |
| D | ordered_associative_container_adaptor.hpp | 229 key_compare key_comp() const in key_comp() function in boost::bimaps::container_adaptor::ordered_associative_container_adaptor
234 this->base().key_comp(), in key_comp()
|
| /third_party/gn/src/base/containers/ |
| D | flat_tree.h | 258 key_compare key_comp() const;
357 explicit KeyValueCompare(const key_compare& key_comp)
358 : key_comp_(key_comp) {}
828 auto flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::key_comp() const
951 if (lower == end() || key_comp()(key, GetKeyFromValue()(*lower)))
963 if ((hint == begin() || key_comp()(extractor(*std::prev(hint)), key))) {
964 if (hint == end() || key_comp()(key, extractor(*hint))) {
968 if (!key_comp()(extractor(*hint), key)) {
|
| D | flat_map.h | 291 if (found == tree::end() || tree::key_comp()(key, found->first))
300 if (found == tree::end() || tree::key_comp()(key, found->first))
|
| /third_party/boost/boost/ptr_container/ |
| D | ptr_unordered_set.hpp | 66 using base_type::key_comp;
155 using base_type::key_comp;
|
| D | ptr_unordered_map.hpp | 63 using base_type::key_comp;
157 using base_type::key_comp;
|
| /third_party/boost/libs/multi_index/test/ |
| D | test_observers.cpp | 47 employee_set_by_age::key_compare c=i2.key_comp(); in test_observers()
|
| /third_party/boost/libs/ptr_container/doc/ |
| D | associative_ptr_container.rst | 57 key_compare key_comp() const;
115 - ``key_compare key_comp() const;``
|
| /third_party/boost/boost/ptr_container/detail/ |
| D | associative_ptr_container.hpp | 158 key_compare key_comp() const in key_comp() function in boost::ptr_container_detail::associative_ptr_container
160 return this->base().key_comp(); in key_comp()
|
| /third_party/boost/boost/python/suite/indexing/ |
| D | map_indexing_suite.hpp | 155 return container.key_comp()(a, b); in compare_index()
|
| /third_party/boost/boost/container/ |
| D | flat_map.hpp | 1290 BOOST_CONTAINER_FORCEINLINE key_compare key_comp() const in key_comp() function in boost::container::flat_map
1291 { return dtl::force_copy<key_compare>(m_flat_tree.key_comp()); } in key_comp()
1298 { return value_compare(dtl::force_copy<key_compare>(m_flat_tree.key_comp())); } in value_comp()
1567 if (i == end() || key_comp()(k, (*i).first)){ in priv_subscript()
1578 if (i == end() || key_comp()(k, (*i).first)){ in priv_subscript()
2630 BOOST_CONTAINER_FORCEINLINE key_compare key_comp() const in key_comp() function in boost::container::flat_multimap
2631 { return dtl::force_copy<key_compare>(m_flat_tree.key_comp()); } in key_comp()
2638 { return value_compare(dtl::force_copy<key_compare>(m_flat_tree.key_comp())); } in value_comp()
|
| /third_party/boost/libs/phoenix/doc/modules/ |
| D | stl.qbk | 53 * key_comp
103 [[`key_comp(c)`] [`c.key_comp()`]]
|