1 //===--- ImmutableMap.h - Immutable (functional) map interface --*- C++ -*-===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file defines the ImmutableMap class.
12 //===----------------------------------------------------------------------===//
14 #ifndef LLVM_ADT_IMMAP_H
15 #define LLVM_ADT_IMMAP_H
17 #include "llvm/ADT/ImmutableSet.h"
21 /// ImutKeyValueInfo -Traits class used by ImmutableMap. While both the first and
22 /// second elements in a pair are used to generate profile information,
23 /// only the first element (the key) is used by isEqual and isLess.
24 template <typename T, typename S>
25 struct ImutKeyValueInfo {
26 typedef const std::pair<T,S> value_type;
27 typedef const value_type& value_type_ref;
28 typedef const T key_type;
29 typedef const T& key_type_ref;
30 typedef const S data_type;
31 typedef const S& data_type_ref;
33 static inline key_type_ref KeyOfValue(value_type_ref V) {
37 static inline data_type_ref DataOfValue(value_type_ref V) {
41 static inline bool isEqual(key_type_ref L, key_type_ref R) {
42 return ImutContainerInfo<T>::isEqual(L,R);
44 static inline bool isLess(key_type_ref L, key_type_ref R) {
45 return ImutContainerInfo<T>::isLess(L,R);
48 static inline bool isDataEqual(data_type_ref L, data_type_ref R) {
49 return ImutContainerInfo<S>::isEqual(L,R);
52 static inline void Profile(FoldingSetNodeID& ID, value_type_ref V) {
53 ImutContainerInfo<T>::Profile(ID, V.first);
54 ImutContainerInfo<S>::Profile(ID, V.second);
59 template <typename KeyT, typename ValT,
60 typename ValInfo = ImutKeyValueInfo<KeyT,ValT> >
63 typedef typename ValInfo::value_type value_type;
64 typedef typename ValInfo::value_type_ref value_type_ref;
65 typedef typename ValInfo::key_type key_type;
66 typedef typename ValInfo::key_type_ref key_type_ref;
67 typedef typename ValInfo::data_type data_type;
68 typedef typename ValInfo::data_type_ref data_type_ref;
69 typedef ImutAVLTree<ValInfo> TreeTy;
75 /// Constructs a map from a pointer to a tree root. In general one
76 /// should use a Factory object to create maps instead of directly
77 /// invoking the constructor, but there are cases where make this
78 /// constructor public is useful.
79 explicit ImmutableMap(TreeTy* R) : Root(R) {}
82 typename TreeTy::Factory F;
87 ImmutableMap GetEmptyMap() { return ImmutableMap(F.GetEmptyTree()); }
89 ImmutableMap Add(ImmutableMap Old, key_type_ref K, data_type_ref D) {
90 return ImmutableMap(F.Add(Old.Root,
91 std::make_pair<key_type,data_type>(K,D)));
94 ImmutableMap Remove(ImmutableMap Old, key_type_ref K) {
95 return ImmutableMap(F.Remove(Old.Root,K));
99 Factory(const Factory& RHS) {};
100 void operator=(const Factory& RHS) {};
103 friend class Factory;
105 bool contains(key_type_ref K) const {
106 return Root ? Root->contains(K) : false;
110 bool operator==(ImmutableMap RHS) const {
111 return Root && RHS.Root ? Root->isEqual(*RHS.Root) : Root == RHS.Root;
114 bool operator!=(ImmutableMap RHS) const {
115 return Root && RHS.Root ? Root->isNotEqual(*RHS.Root) : Root != RHS.Root;
118 TreeTy* getRoot() const { return Root; }
120 bool isEmpty() const { return !Root; }
122 //===--------------------------------------------------===//
123 // Foreach - A limited form of map iteration.
124 //===--------------------------------------------------===//
127 template <typename Callback>
130 void operator()(value_type_ref V) { C(V.first,V.second); }
133 template <typename Callback>
134 struct CBWrapperRef {
136 CBWrapperRef(Callback& c) : C(c) {}
138 void operator()(value_type_ref V) { C(V.first,V.second); }
142 template <typename Callback>
143 void foreach(Callback& C) {
145 CBWrapperRef<Callback> CB(C);
150 template <typename Callback>
153 CBWrapper<Callback> CB;
158 //===--------------------------------------------------===//
160 //===--------------------------------------------------===//
162 void verify() const { if (Root) Root->verify(); }
164 //===--------------------------------------------------===//
166 //===--------------------------------------------------===//
169 typename TreeTy::iterator itr;
172 iterator(TreeTy* t) : itr(t) {}
173 friend class ImmutableMap;
176 inline value_type_ref operator*() const { return itr->getValue(); }
177 inline key_type_ref getKey() const { return itr->getValue().first; }
178 inline data_type_ref getData() const { return itr->getValue().second; }
180 inline iterator& operator++() { ++itr; return *this; }
181 inline iterator operator++(int) { iterator tmp(*this); ++itr; return tmp; }
182 inline iterator& operator--() { --itr; return *this; }
183 inline iterator operator--(int) { iterator tmp(*this); --itr; return tmp; }
184 inline bool operator==(const iterator& RHS) const { return RHS.itr == itr; }
185 inline bool operator!=(const iterator& RHS) const { return RHS.itr != itr; }
188 iterator begin() const { return iterator(Root); }
189 iterator end() const { return iterator(); }
191 TreeTy* SlimFind(key_type_ref K) const {
193 TreeTy* T = Root->find(K);
200 // FIXME: Add 'find' that returns an iterator instead of a TreeTy*.
202 //===--------------------------------------------------===//
204 //===--------------------------------------------------===//
206 inline unsigned getHeight() const { return Root ? Root->getHeight() : 0; }
208 static inline void Profile(FoldingSetNodeID& ID, const ImmutableMap& M) {
209 ID.AddPointer(M.Root);
212 inline void Profile(FoldingSetNodeID& ID) const {
213 return Profile(ID,*this);
217 } // end namespace llvm