| /rocksdb-6.9/util/ |
| D | hash_test.cc | 19 using ROCKSDB_NAMESPACE::Hash;
31 EXPECT_EQ(Hash("", 0, kSeed), 3164544308u); in TEST()
32 EXPECT_EQ(Hash("\x08", 1, kSeed), 422599524u); in TEST()
33 EXPECT_EQ(Hash("\x17", 1, kSeed), 3168152998u); in TEST()
34 EXPECT_EQ(Hash("\x9a", 1, kSeed), 3195034349u); in TEST()
35 EXPECT_EQ(Hash("\x1c", 1, kSeed), 2651681383u); in TEST()
36 EXPECT_EQ(Hash("\x4d\x76", 2, kSeed), 2447836956u); in TEST()
37 EXPECT_EQ(Hash("\x52\xd5", 2, kSeed), 3854228105u); in TEST()
38 EXPECT_EQ(Hash("\x91\xf7", 2, kSeed), 31066776u); in TEST()
39 EXPECT_EQ(Hash("\xd6\x27", 2, kSeed), 1806091603u); in TEST()
[all …]
|
| D | hash.h | 52 extern uint32_t Hash(const char* data, size_t n, uint32_t seed);
56 return Hash(key.data(), key.size(), 0xbc9f1d34); in BloomHash()
69 return Hash(s.data(), s.size(), 397); in GetSliceHash()
|
| D | hash.cc | 18 uint32_t Hash(const char* data, size_t n, uint32_t seed) { in Hash() function
|
| /rocksdb-6.9/utilities/persistent_cache/ |
| D | hash_table_evictable.h | 24 template <class T, class Hash, class Equal>
25 class EvictableHashTable : private HashTable<T*, Hash, Equal> {
27 typedef HashTable<T*, Hash, Equal> hash_table;
32 : HashTable<T*, Hash, Equal>(capacity, load_factor, nlocks),
43 const uint64_t h = Hash()(t); in Insert()
63 const uint64_t h = Hash()(t); in Find()
94 const uint64_t h = Hash()(t);
|
| D | hash_table.h | 64 template <class T, class Hash, class Equal>
100 const uint64_t h = Hash()(t); in Insert()
115 const uint64_t h = Hash()(t); in Find()
136 const uint64_t h = Hash()(t); in Erase()
150 const uint64_t h = Hash()(t); in GetMutex()
|
| D | hash_table_test.cc | 40 struct Hash { struct
48 HashTable<Node, Hash, Equal> map_;
72 struct Hash { struct
80 EvictableHashTable<Node, Hash, Equal> map_;
|
| D | block_cache_tier_metadata.h | 105 struct Hash { struct
117 typedef HashTable<BlockInfo*, Hash, Equal> BlockIndexType; argument
|
| D | hash_table_bench.cc | 257 struct Hash { struct in ROCKSDB_NAMESPACE::GranularLockImpl
269 HashTable<Node, Hash, Equal> impl_;
|
| /rocksdb-6.9/memory/ |
| D | memory_usage.h | 14 template <class Key, class Value, class Hash>
16 const std::unordered_map<Key, Value, Hash>& umap) { in ApproximateMemoryUsage()
17 typedef std::unordered_map<Key, Value, Hash> Map; in ApproximateMemoryUsage()
|
| /rocksdb-6.9/table/block_based/ |
| D | full_filter_block_test.cc | 27 hash_entries_.push_back(Hash(key.data(), key.size(), 1)); in AddKey()
60 uint32_t h = Hash(entry.data(), entry.size(), 1); in MayMatch()
81 uint32_t h = Hash(keys[i].data(), keys[i].size(), 1); in CreateFilter()
87 uint32_t h = Hash(key.data(), key.size(), 1); in KeyMayMatch()
|
| D | block_prefix_index.cc | 19 inline uint32_t Hash(const Slice& s) { in Hash() function
20 return ROCKSDB_NAMESPACE::Hash(s.data(), s.size(), 0); in Hash()
24 return Hash(prefix) % num_buckets; in PrefixToBucket()
|
| D | block_based_filter_block_test.cc | 29 uint32_t h = Hash(keys[i].data(), keys[i].size(), 1); in CreateFilter()
35 uint32_t h = Hash(key.data(), key.size(), 1); in KeyMayMatch()
|
| /rocksdb-6.9/docs/_posts/ |
| D | 2018-08-23-data-block-hash-index.markdown | 2 title: Improving Point-Lookup Using Data Block Hash Index
39 ### Data Block Hash Index Design
64 Hash index will hash different keys (keys with different content, or byte sequence) into different …
|
| D | 2014-04-02-the-1st-rocksdb-local-meetup-held-on-march-27-2014.markdown | 36 …://github.com/facebook/rocksdb/raw/gh-pages/talks/2014-03-27-RocksDB-Meetup-Siying-Prefix-Hash.pdf)
|
| D | 2014-06-23-plaintable-a-new-file-format.markdown | 15 …://github.com/facebook/rocksdb/raw/gh-pages/talks/2014-03-27-RocksDB-Meetup-Siying-Prefix-Hash.pdf)
|
| /rocksdb-6.9/db/ |
| D | comparator_db_test.cc | 205 uint32_t ha = Hash(a.data(), a.size(), 66); in Compare()
206 uint32_t hb = Hash(b.data(), b.size(), 66); in Compare()
|
| /rocksdb-6.9/memtable/ |
| D | skiplist_test.cc | 173 return Hash(reinterpret_cast<char*>(data), sizeof(data), 0); in HashNumbers()
|
| D | inlineskiplist_test.cc | 348 return Hash(reinterpret_cast<char*>(data), sizeof(data), 0); in HashNumbers()
|
| /rocksdb-6.9/db_stress_tool/ |
| D | db_stress_test_base.cc | 280 ToString(Hash(snap_state.key.c_str(), snap_state.key.size(), 0)) + in AssertSame()
|
| /rocksdb-6.9/ |
| D | HISTORY.md | 1075 * Hash index for block-based table will be materialized and reconstructed more efficiently. Previou…
|