Lines Matching defs:key
30 LRUOrderingNode(const Key& key, const Value& value)
32 fKey(key),
77 status_t Put(const Key& key, const Value& value)
79 LRUNode* node = fMap.Get(key);
87 node = new(std::nothrow) LRUNode(key, value);
90 status_t result = fMap.Put(key, node);
102 Value Remove(const Key& key)
104 LRUNode* node = fMap.Get(key);
108 fMap.Remove(key);
125 Value Get(const Key& key)
127 LRUNode* node = fMap.Get(key);
135 bool ContainsKey(const Key& key) const
137 return fMap.ContainsKey(key);