X-Git-Url: http://demsky.eecs.uci.edu/git/?a=blobdiff_plain;f=include%2Fllvm%2FADT%2FImmutableMap.h;h=27148e6083d81a409f3722f62aa8f5ff782d90bf;hb=fc82fabe00b0b820e3c0d7fc9e289bace0295f11;hp=ac4f1651b3ef2169fe6a517fb1e6dc9bf6aab0eb;hpb=0a8cabb17892746ba71a94f494a5d293a716edfd;p=oota-llvm.git diff --git a/include/llvm/ADT/ImmutableMap.h b/include/llvm/ADT/ImmutableMap.h index ac4f1651b3e..27148e6083d 100644 --- a/include/llvm/ADT/ImmutableMap.h +++ b/include/llvm/ADT/ImmutableMap.h @@ -34,14 +34,21 @@ struct ImutKeyValueInfo { return V.first; } - static inline bool isEqual(key_type_ref L, key_type_ref R) { - return ImutContainerInfo::isEqual(L,R); + static inline data_type_ref DataOfValue(value_type_ref V) { + return V.second; } + static inline bool isEqual(key_type_ref L, key_type_ref R) { + return ImutContainerInfo::isEqual(L,R); + } static inline bool isLess(key_type_ref L, key_type_ref R) { return ImutContainerInfo::isLess(L,R); } + static inline bool isDataEqual(data_type_ref L, data_type_ref R) { + return ImutContainerInfo::isEqual(L,R); + } + static inline void Profile(FoldingSetNodeID& ID, value_type_ref V) { ImutContainerInfo::Profile(ID, V.first); ImutContainerInfo::Profile(ID, V.second); @@ -52,20 +59,24 @@ struct ImutKeyValueInfo { template > class ImmutableMap { +public: typedef typename ValInfo::value_type value_type; typedef typename ValInfo::value_type_ref value_type_ref; typedef typename ValInfo::key_type key_type; typedef typename ValInfo::key_type_ref key_type_ref; typedef typename ValInfo::data_type data_type; typedef typename ValInfo::data_type_ref data_type_ref; + typedef ImutAVLTree TreeTy; -private: - typedef ImutAVLTree TreeTy; +private: TreeTy* Root; - - ImmutableMap(TreeTy* R) : Root(R) {} - + public: + /// Constructs a map from a pointer to a tree root. In general one + /// should use a Factory object to create maps instead of directly + /// invoking the constructor, but there are cases where make this + /// constructor public is useful. + explicit ImmutableMap(TreeTy* R) : Root(R) {} class Factory { typename TreeTy::Factory F; @@ -73,6 +84,9 @@ public: public: Factory() {} + Factory(BumpPtrAllocator& Alloc) + : F(Alloc) {} + ImmutableMap GetEmptyMap() { return ImmutableMap(F.GetEmptyTree()); } ImmutableMap Add(ImmutableMap Old, key_type_ref K, data_type_ref D) { @@ -94,15 +108,7 @@ public: bool contains(key_type_ref K) const { return Root ? Root->contains(K) : false; } - - data_type* find(key_type_ref K) const { - if (Root) { - TreeTy* T = Root->find(K); - if (T) return &T->getValue().second; - } - - return NULL; - } + bool operator==(ImmutableMap RHS) const { return Root && RHS.Root ? Root->isEqual(*RHS.Root) : Root == RHS.Root; @@ -112,6 +118,8 @@ public: return Root && RHS.Root ? Root->isNotEqual(*RHS.Root) : Root != RHS.Root; } + TreeTy* getRoot() const { return Root; } + bool isEmpty() const { return !Root; } //===--------------------------------------------------===// @@ -165,7 +173,7 @@ public: iterator() {} iterator(TreeTy* t) : itr(t) {} - friend class ImmutableSet; + friend class ImmutableMap; public: inline value_type_ref operator*() const { return itr->getValue(); } @@ -183,13 +191,24 @@ public: iterator begin() const { return iterator(Root); } iterator end() const { return iterator(); } + TreeTy* SlimFind(key_type_ref K) const { + if (Root) { + TreeTy* T = Root->find(K); + if (T) return T; + } + + return NULL; + } + + // FIXME: Add 'find' that returns an iterator instead of a TreeTy*. + //===--------------------------------------------------===// // Utility methods. //===--------------------------------------------------===// inline unsigned getHeight() const { return Root ? Root->getHeight() : 0; } - static inline void Profile(FoldingSetNodeID& ID, const ImmutableMap& M) { + static inline void Profile(FoldingSetNodeID& ID, const ImmutableMap& M) { ID.AddPointer(M.Root); }