| /fuchsia/zircon/system/utest/fbl/include/fbl/tests/intrusive_containers/ |
| H A D | ordered_associative_container_test_environment.h | 50 return KeyTraits::LessThan(key, bound_key);
63 return KeyTraits::LessThan(key, bound_key) || KeyTraits::EqualTo(key, bound_key);
84 EXPECT_TRUE (KeyTraits::LessThan(prev_key, iter_key), "");
85 EXPECT_FALSE(KeyTraits::LessThan(iter_key, prev_key), "");
123 EXPECT_TRUE (KeyTraits::LessThan(iter_key, prev_key), "");
124 EXPECT_FALSE(KeyTraits::LessThan(prev_key, iter_key), "");
183 KeyTraits::LessThan(tmp_key, KeyTraits::GetKey(*test.bound))))
|
| H A D | associative_container_test_environment.h | 130 : KeyTraits::LessThan(max_key_, obj_key) ? obj_key : max_key_;
|
| /fuchsia/zircon/system/ulib/fuzz-utils/include/fuzz-utils/ |
| H A D | string-map.h | 62 static bool LessThan(const char* key1, const char* key2) { return strcmp(key1, key2) < 0; } function in struct:fuzzing::final::KeyTraits
|
| /fuchsia/zircon/system/ulib/fs/include/fs/ |
| H A D | pseudo-dir.h | 96 static bool LessThan(uint64_t key1, uint64_t key2) { return key1 < key2; } function in struct:fs::PseudoDir::KeyByIdTraits
104 static bool LessThan(const fbl::String& key1, const fbl::String& key2) { function in struct:fs::PseudoDir::KeyByNameTraits
|
| /fuchsia/zircon/system/ulib/fbl/include/fbl/ |
| H A D | intrusive_container_utils.h | 22 // LessThan : A static method which takes two keys (key1 and key2) and returns
35 // LessThan(A, B) and LessThan(B, C) implies LessThan(A, C)
38 // LessThan(A, B) if-and-only-if EqualTo(B, A) or (not LessThan(B, A))
44 // the purpose of generating implementation of LessThan and EqualTo.
48 static bool LessThan(const KeyType& key1, const KeyType& key2) { return key1 < key2; } function in struct:fbl::DefaultKeyedObjectTraits
|
| H A D | intrusive_wavl_tree.h | 34 // order (as defined by the KeyTraits::LessThan operation).
300 node = PtrTraits::GetRaw(KeyTraits::LessThan(key, node_key) ? ns.left_ : ns.right_);
543 return KeyTraits::EqualTo(node_key, key) || KeyTraits::LessThan(node_key, key);
549 return KeyTraits::LessThan(node_key, key);
733 if (KeyTraits::LessThan(key, parent_key)) {
|
| /fuchsia/zircon/system/utest/fbl/ |
| H A D | intrusive_hash_table_sll_tests.cpp | 35 static bool LessThan(const OtherKeyType& key1, const OtherKeyType& key2) { function in struct:fbl::tests::intrusive_containers::OtherHashTraits
|
| H A D | intrusive_hash_table_dll_tests.cpp | 35 static bool LessThan(const OtherKeyType& key1, const OtherKeyType& key2) { function in struct:fbl::tests::intrusive_containers::OtherHashTraits
|
| H A D | algorithm_tests.cpp | 251 struct LessThan { struct in namespace:__anon1340
260 LessThan lessThan;
|
| H A D | intrusive_wavl_tree_tests.cpp | 32 static bool LessThan(const KeyType& key1, const KeyType& key2) { return key1 < key2; } function in struct:fbl::tests::intrusive_containers::OtherTreeTraits
|
| /fuchsia/zircon/system/ulib/region-alloc/include/region-alloc/ |
| H A D | region-alloc.h | 271 static bool LessThan(const ralloc_region_t& k1, const ralloc_region_t& k2) { function in struct:RegionAllocator::Region::KeyTraitsSortBySize
|
| /fuchsia/zircon/system/ulib/blobfs/include/blobfs/ |
| H A D | blobfs.h | 297 static bool LessThan(const uint8_t* k1, const uint8_t* k2) { function in struct:blobfs::MerkleRootTraits
|