Home
last modified time | relevance | path

Searched refs:key_comp (Results 1 - 9 of 9) sorted by relevance

/third_party/skia/third_party/externals/abseil-cpp/absl/container/
H A Dbtree_set.h342 // btree_set::key_comp();
345 using Base::key_comp;
351 // sibling member function `key_comp` are equivalent.
645 // btree_multiset::key_comp();
648 using Base::key_comp;
654 // and its sibling member function `key_comp` are equivalent.
H A Dbtree_map.h424 // btree_map::key_comp();
427 using Base::key_comp;
732 // btree_multimap::key_comp();
735 using Base::key_comp;
H A Dbtree_test.cc1713 EXPECT_TRUE(s.key_comp()(1, 2)); in TEST()
1714 EXPECT_FALSE(s.key_comp()(2, 2)); in TEST()
1715 EXPECT_FALSE(s.key_comp()(2, 1)); in TEST()
1718 EXPECT_TRUE(m1.key_comp()(1, 2)); in TEST()
1719 EXPECT_FALSE(m1.key_comp()(2, 2)); in TEST()
1720 EXPECT_FALSE(m1.key_comp()(2, 1)); in TEST()
1723 // heterogeneous, the comparator we expose through key_comp() is the original in TEST()
1726 EXPECT_TRUE(m2.key_comp()("a", "b")); in TEST()
1727 EXPECT_FALSE(m2.key_comp()("b", "b")); in TEST()
1728 EXPECT_FALSE(m2.key_comp()(" in TEST()
[all...]
/third_party/gn/src/base/containers/
H A Dflat_tree.h258 key_compare key_comp() const;
357 explicit KeyValueCompare(const key_compare& key_comp) in KeyValueCompare()
358 : key_comp_(key_comp) {} in KeyValueCompare()
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)) {
H A Dflat_map.h127 // key_compare key_comp() const;
291 if (found == tree::end() || tree::key_comp()(key, found->first))
300 if (found == tree::end() || tree::key_comp()(key, found->first))
/third_party/protobuf/src/google/protobuf/
H A Ddescriptor_database.cc643 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/skia/third_party/externals/abseil-cpp/absl/container/internal/
H A Dbtree.h93 // Allow converting to std::less for use in key_comp()/value_comp().
125 // Allow converting to std::greater for use in key_comp()/value_comp().
1193 : btree(other.key_comp(), alloc) { in btree()
1203 : btree(other.key_comp(), alloc) { in btree()
1352 const key_compare &key_comp() const noexcept {
1357 return compare_internal::compare_result_as_less_than(key_comp()(a, b)); in compare_keys()
1361 return value_compare(original_key_compare(key_comp())); in value_comp()
2098 *mutable_key_comp() = other.key_comp();
2133 *mutable_key_comp() = other.key_comp();
2534 iter.node->lower_bound(key, key_comp());
[all...]
H A Dbtree_container.h218 key_compare key_comp() const { return key_compare(tree_.key_comp()); } in key_comp() function in absl::container_internal::btree_container
/third_party/json/tests/thirdparty/fifo_map/
H A Dfifo_map.hpp468 key_compare key_comp() const in key_comp() function in nlohmann::fifo_map

Completed in 16 milliseconds