Searched refs:hash_set (Results 1 - 2 of 2) sorted by relevance
/art/runtime/base/ |
H A D | hash_set_test.cc | 17 #include "hash_set.h" 67 HashSet<std::string, IsEmptyFnString> hash_set; local 69 ASSERT_TRUE(hash_set.Empty()); 70 ASSERT_EQ(hash_set.Size(), 0U); 71 hash_set.Insert(test_string); 72 auto it = hash_set.Find(test_string); 74 auto after_it = hash_set.Erase(it); 75 ASSERT_TRUE(after_it == hash_set.end()); 76 ASSERT_TRUE(hash_set.Empty()); 77 ASSERT_EQ(hash_set 83 HashSet<std::string, IsEmptyFnString> hash_set; local 115 HashSet<std::string, IsEmptyFnString> hash_set; local 162 HashSet<std::string, IsEmptyFnString> hash_set; local 200 HashSet<std::string, IsEmptyFnString> hash_set; local 218 HashSet<std::string, IsEmptyFnString> hash_set; local 327 HashSet<std::vector<int>, IsEmptyFnVectorInt, VectorIntHashEquals, VectorIntHashEquals> hash_set; local 337 HashSet<std::string, IsEmptyFnString> hash_set; local [all...] |
H A D | hash_set.h | 67 BaseIterator(HashSetType* hash_set, size_t index) : index_(index), hash_set_(hash_set) { argument 106 size_t NextNonEmptySlot(size_t index, const HashSet* hash_set) const { 107 const size_t num_buckets = hash_set->NumBuckets(); 111 } while (index < num_buckets && hash_set->IsFreeSlot(index));
|
Completed in 47 milliseconds