51   uint32_t refs;      // References, including cache reference, if present.
52   uint32_t hash;      // Hash of key(); used for fast sharding and comparisons
76   LRUHandle* Lookup(const Slice& key, uint32_t hash) {  in Lookup()
96   LRUHandle* Remove(const Slice& key, uint32_t hash) {  in Remove()
109   uint32_t length_;
110   uint32_t elems_;
116   LRUHandle** FindPointer(const Slice& key, uint32_t hash) {  in FindPointer()
126     uint32_t new_length = 4;  in Resize()
132     uint32_t count = 0;  in Resize()
133     for (uint32_t i = 0; i < length_; i++) {  in Resize()
137         uint32_t hash = h->hash;  in Resize()
162   Cache::Handle* Insert(const Slice& key, uint32_t hash,
165   Cache::Handle* Lookup(const Slice& key, uint32_t hash);
167   void Erase(const Slice& key, uint32_t hash);
255 Cache::Handle* LRUCache::Lookup(const Slice& key, uint32_t hash) {  in Lookup()
270     const Slice& key, uint32_t hash, void* value, size_t charge,  in Insert()
318 void LRUCache::Erase(const Slice& key, uint32_t hash) {  in Erase()
344   static inline uint32_t HashSlice(const Slice& s) {  in HashSlice()
348   static uint32_t Shard(uint32_t hash) {  in Shard()
363     const uint32_t hash = HashSlice(key);  in Insert()
367     const uint32_t hash = HashSlice(key);  in Lookup()
375     const uint32_t hash = HashSlice(key);  in Erase()