add a new form of insert.

[oota-llvm.git] / include / llvm / ADT / IndexedMap.h

diff --git a/include/llvm/ADT/IndexedMap.h b/include/llvm/ADT/IndexedMap.h
index 9d713d97c363f49176dfa65c60af1da5ea8b4f62..740ecd38c3a914286a86fdd5a5f6c9b2acd20f48 100644 (file)
--- a/include/llvm/ADT/IndexedMap.h
+++ b/include/llvm/ADT/IndexedMap.h
@@ -1,10 +1,10 @@
-//===- DenseMap.h - A dense map implmentation -------------------*- C++ -*-===//
-// 
+//===- llvm/ADT/DenseMap.h - A dense map implmentation ----------*- C++ -*-===//
+//
 //                     The LLVM Compiler Infrastructure
 //
 // This file was developed by the LLVM research group and is distributed under
 // the University of Illinois Open Source License. See LICENSE.TXT for details.
-// 
+//
 //===----------------------------------------------------------------------===//
 //
 // This file implements a dense map. A dense map template takes two
@@ -17,46 +17,58 @@
 //
 //===----------------------------------------------------------------------===//
 
-#ifndef SUPPORT_DENSEMAP_H
-#define SUPPORT_DENSEMAP_H
+#ifndef LLVM_ADT_DENSEMAP_H
+#define LLVM_ADT_DENSEMAP_H
 
+#include <functional>
 #include <vector>
+#include <cassert>
 
 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:
-    DenseMap() { }
+  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_);
+    }
+
+    typename StorageT::size_type size() const {
+      return storage_.size();
     }
-};
+  };
 
 } // End llvm namespace