summaryrefslogtreecommitdiff
path: root/include/llvm/ADT/IndexedMap.h
diff options
context:
space:
mode:
authorAlkis Evlogimenos <alkis@evlogimenos.com>2004-08-26 03:37:28 +0000
committerAlkis Evlogimenos <alkis@evlogimenos.com>2004-08-26 03:37:28 +0000
commit5501e568b396f3e58f3d642e77139c790eda9df9 (patch)
tree446bb1f6ab318d378b8c948f269cd81a288cef73 /include/llvm/ADT/IndexedMap.h
parent07b52b367f2c89e21c8c8d8430760575a81adfe7 (diff)
downloadllvm-5501e568b396f3e58f3d642e77139c790eda9df9.tar.gz
llvm-5501e568b396f3e58f3d642e77139c790eda9df9.tar.bz2
llvm-5501e568b396f3e58f3d642e77139c790eda9df9.tar.xz
Add default index functor (an identity functor). You could use a
vector directly to get the same functionality but using a DenseMap makes the code more readable IMO. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@16052 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'include/llvm/ADT/IndexedMap.h')
-rw-r--r--include/llvm/ADT/IndexedMap.h30
1 files changed, 18 insertions, 12 deletions
diff --git a/include/llvm/ADT/IndexedMap.h b/include/llvm/ADT/IndexedMap.h
index 9d55435c91..2cf5990617 100644
--- a/include/llvm/ADT/IndexedMap.h
+++ b/include/llvm/ADT/IndexedMap.h
@@ -24,39 +24,45 @@
namespace llvm {
-template <typename T, typename ToIndexT>
-class DenseMap {
+ struct IdentityFunctor : std::unary_function<unsigned, unsigned> {
+ unsigned operator()(unsigned Index) const {
+ return Index;
+ }
+ };
+
+ template <typename T, typename ToIndexT = IdentityFunctor>
+ class DenseMap {
typedef typename ToIndexT::argument_type IndexT;
typedef std::vector<T> StorageT;
StorageT storage_;
T nullVal_;
ToIndexT toIndex_;
-public:
+ public:
DenseMap() : nullVal_(T()) { }
explicit DenseMap(const T& val) : nullVal_(val) { }
typename StorageT::reference operator[](IndexT n) {
- assert(toIndex_(n) < storage_.size() && "index out of bounds!");
- return storage_[toIndex_(n)];
+ assert(toIndex_(n) < storage_.size() && "index out of bounds!");
+ return storage_[toIndex_(n)];
}
typename StorageT::const_reference operator[](IndexT n) const {
- assert(toIndex_(n) < storage_.size() && "index out of bounds!");
- return storage_[toIndex_(n)];
+ assert(toIndex_(n) < storage_.size() && "index out of bounds!");
+ return storage_[toIndex_(n)];
}
void clear() {
- storage_.clear();
+ storage_.clear();
}
void grow(IndexT n) {
- unsigned NewSize = toIndex_(n) + 1;
- if (NewSize > storage_.size())
- storage_.resize(NewSize, nullVal_);
+ unsigned NewSize = toIndex_(n) + 1;
+ if (NewSize > storage_.size())
+ storage_.resize(NewSize, nullVal_);
}
-};
+ };
} // End llvm namespace