6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2024-12-14 11:32:34 +00:00
Code Issues Projects Releases Wiki Activity

Allow DenseMAp to take an explicit DenseMapKeyInfo

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@34134 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2007-02-10 06:34:58 +00:00
parent 7cad3cf448
commit a76b1febd4
1 changed files with 20 additions and 19 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -40,12 +40,15 @@ struct DenseMapKeyInfo<T*> {
static bool isPod() { return true; }
};
template<typename KeyT, typename ValueT>
template<typename KeyT, typename ValueT,
typename KeyInfoT = DenseMapKeyInfo<KeyT> >
class DenseMapIterator;
template<typename KeyT, typename ValueT>
template<typename KeyT, typename ValueT,
typename KeyInfoT = DenseMapKeyInfo<KeyT> >
class DenseMapConstIterator;
template<typename KeyT, typename ValueT>
template<typename KeyT, typename ValueT,
typename KeyInfoT = DenseMapKeyInfo<KeyT> >
class DenseMap {
typedef std::pair<KeyT, ValueT> BucketT;
unsigned NumBuckets;
@ -68,21 +71,19 @@ public:
delete[] (char*)Buckets;
}
typedef DenseMapIterator<KeyT, ValueT> iterator;
typedef DenseMapConstIterator<KeyT, ValueT> const_iterator;
typedef DenseMapIterator<KeyT, ValueT, KeyInfoT> iterator;
typedef DenseMapConstIterator<KeyT, ValueT, KeyInfoT> const_iterator;
inline iterator begin() {
return DenseMapIterator<KeyT, ValueT>(Buckets, Buckets+NumBuckets);
return iterator(Buckets, Buckets+NumBuckets);
}
inline iterator end() {
return DenseMapIterator<KeyT, ValueT>(Buckets+NumBuckets,
Buckets+NumBuckets);
return iterator(Buckets+NumBuckets, Buckets+NumBuckets);
}
inline const_iterator begin() const {
return DenseMapConstIterator<KeyT, ValueT>(Buckets, Buckets+NumBuckets);
return const_iterator(Buckets, Buckets+NumBuckets);
}
inline const_iterator end() const {
return DenseMapConstIterator<KeyT, ValueT>(Buckets+NumBuckets,
Buckets+NumBuckets);
return const_iterator(Buckets+NumBuckets, Buckets+NumBuckets);
}
bool empty() const { return NumEntries == 0; }
@ -181,13 +182,13 @@ private:
}
static unsigned getHashValue(const KeyT &Val) {
return DenseMapKeyInfo<KeyT>::getHashValue(Val);
return KeyInfoT::getHashValue(Val);
}
static const KeyT getEmptyKey() {
return DenseMapKeyInfo<KeyT>::getEmptyKey();
return KeyInfoT::getEmptyKey();
}
static const KeyT getTombstoneKey() {
return DenseMapKeyInfo<KeyT>::getTombstoneKey();
return KeyInfoT::getTombstoneKey();
}
/// LookupBucketFor - Lookup the appropriate bucket for Val, returning it in
@ -285,7 +286,7 @@ private:
}
};
template<typename KeyT, typename ValueT>
template<typename KeyT, typename ValueT, typename KeyInfoT>
class DenseMapIterator {
typedef std::pair<KeyT, ValueT> BucketT;
protected:
@ -320,16 +321,16 @@ public:
private:
void AdvancePastEmptyBuckets() {
const KeyT Empty = DenseMapKeyInfo<KeyT>::getEmptyKey();
const KeyT Tombstone = DenseMapKeyInfo<KeyT>::getTombstoneKey();
const KeyT Empty = KeyInfoT::getEmptyKey();
const KeyT Tombstone = KeyInfoT::getTombstoneKey();
while (Ptr != End && (Ptr->first == Empty || Ptr->first == Tombstone))
++Ptr;
}
};
template<typename KeyT, typename ValueT>
class DenseMapConstIterator : public DenseMapIterator<KeyT, ValueT> {
template<typename KeyT, typename ValueT, typename KeyInfoT>
class DenseMapConstIterator : public DenseMapIterator<KeyT, ValueT, KeyInfoT> {
public:
DenseMapConstIterator(const std::pair<KeyT, ValueT> *Pos,
const std::pair<KeyT, ValueT> *E)