6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2024-07-18 12:29:27 +00:00
Code Issues Projects Releases Wiki Activity

add a version of insert that takes the key and value.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@33856 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2007-02-04 00:42:41 +00:00
parent 6734b57d1b
commit 28f72279f5
1 changed files with 26 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

37
include/llvm/ADT/DenseMap.h
View File

@ -111,6 +111,16 @@ public:
return end();
}
bool insert(const std::pair<KeyT, ValueT> &KV) {
BucketT *TheBucket;
if (LookupBucketFor(KV.first, TheBucket))
return false; // Already in map.
// Otherwise, insert the new element.
InsertIntoBucket(KV.first, KV.second, TheBucket);
return true;
}
bool erase(const KeyT &Val) {
BucketT *TheBucket;
if (!LookupBucketFor(Val, TheBucket))
@ -129,23 +139,28 @@ public:
return true;
}
ValueT &operator[](const KeyT &Val) {
ValueT &operator[](const KeyT &Key) {
BucketT *TheBucket;
if (LookupBucketFor(Val, TheBucket))
if (LookupBucketFor(Key, TheBucket))
return TheBucket->second;
// If the load of the hash table is more than 3/4, grow it.
if (NumEntries*4 >= NumBuckets*3) {
this->grow();
LookupBucketFor(Val, TheBucket);
}
++NumEntries;
TheBucket->first = Val;
new (&TheBucket->second) ValueT();
return TheBucket->second;
return InsertIntoBucket(Key, ValueT(), TheBucket)->second;
}
private:
BucketT *InsertIntoBucket(const KeyT &Key, const ValueT &Value,
BucketT *TheBucket) {
// If the load of the hash table is more than 3/4, grow it.
if (NumEntries*4 >= NumBuckets*3) {
this->grow();
LookupBucketFor(Key, TheBucket);
}
++NumEntries;
TheBucket->first = Key;
new (&TheBucket->second) ValueT(Value);
return TheBucket;
}
static unsigned getHashValue(const KeyT &Val) {
return DenseMapKeyInfo<KeyT>::getHashValue(Val);
}