Lines Matching refs:Val
101 bool count(const KeyT &Val) const {
103 return LookupBucketFor(Val, TheBucket);
106 iterator find(const KeyT &Val) {
108 if (LookupBucketFor(Val, TheBucket))
112 const_iterator find(const KeyT &Val) const {
114 if (LookupBucketFor(Val, TheBucket))
125 iterator find_as(const LookupKeyT &Val) {
127 if (LookupBucketFor(Val, TheBucket))
132 const_iterator find_as(const LookupKeyT &Val) const {
134 if (LookupBucketFor(Val, TheBucket))
141 ValueT lookup(const KeyT &Val) const {
143 if (LookupBucketFor(Val, TheBucket))
170 bool erase(const KeyT &Val) {
172 if (!LookupBucketFor(Val, TheBucket))
313 static unsigned getHashValue(const KeyT &Val) {
314 return KeyInfoT::getHashValue(Val);
317 static unsigned getHashValue(const LookupKeyT &Val) {
318 return KeyInfoT::getHashValue(Val);
438 /// LookupBucketFor - Lookup the appropriate bucket for Val, returning it in
443 bool LookupBucketFor(const LookupKeyT &Val,
457 assert(!KeyInfoT::isEqual(Val, EmptyKey) &&
458 !KeyInfoT::isEqual(Val, TombstoneKey) &&
461 unsigned BucketNo = getHashValue(Val) & (NumBuckets-1);
465 // Found Val's bucket? If so, return it.
466 if (KeyInfoT::isEqual(Val, ThisBucket->first)) {
481 // If this is a tombstone, remember it. If Val ends up not in the map, we
494 bool LookupBucketFor(const LookupKeyT &Val, BucketT *&FoundBucket) {
497 ->LookupBucketFor(Val, ConstFoundBucket);