Lines Matching refs:key
41 // hash code of the entry's key.
68 ssize_t find(ssize_t index, hash_t hash, const void* __restrict__ key) const;
91 virtual bool compareBucketKey(const Bucket& bucket, const void* __restrict__ key) const = 0;
146 * within an array. The basic operations are finding entries by key,
155 * TKey: The key type.
163 * const TKey& getKey() const; // get the key from the entry
267 /* Finds the index of an entry with the specified key.
271 * key, then the sequence of entries returned is arbitrary.
274 * index: The index of the previous entry with the specified key, or -1 to
276 * hash: The hashcode of the key.
277 * key: The key.
279 inline ssize_t find(ssize_t index, hash_t hash, const TKey& key) const {
280 return BasicHashtableImpl::find(index, hash, &key);
285 * If an entry with the same key already exists, then a duplicate entry is added.
289 * hash: The hashcode of the key.
340 virtual bool compareBucketKey(const Bucket& bucket, const void* __restrict__ key) const;
370 const void* __restrict__ key) const {
371 return entryFor(bucket).getKey() == *static_cast<const TKey*>(key);