llvm/ADT/AllocatorList.h

49   list_type List;
141       : AllocatorT(std::move(X.getAlloc())), List(std::move(X.List)) {}
144     List.cloneFrom(X.List, Cloner(*this), Disposer(*this));
149     List = std::move(X.List);
155     List.cloneFrom(X.List, Cloner(*this), Disposer(*this));
162     List.swap(RHS.List);
166   bool empty() { return List.empty(); }
167   size_t size() { return List.size(); }
169   iterator begin() { return iterator(List.begin()); }
170   iterator end() { return iterator(List.end()); }
171   const_iterator begin() const { return const_iterator(List.begin()); }
172   const_iterator end() const { return const_iterator(List.end()); }
173   reverse_iterator rbegin() { return reverse_iterator(List.rbegin()); }
174   reverse_iterator rend() { return reverse_iterator(List.rend()); }
176     return const_reverse_iterator(List.rbegin());
179     return const_reverse_iterator(List.rend());
182   T &back() { return List.back().V; }
183   T &front() { return List.front().V; }
184   const T &back() const { return List.back().V; }
185   const T &front() const { return List.front().V; }
188     return iterator(List.insert(I.wrapped(), *create(std::forward<Ts>(Vs)...)));
192     return iterator(List.insert(I.wrapped(), *create(std::move(V))));
195     return iterator(List.insert(I.wrapped(), *create(V)));
201       List.insert(I.wrapped(), *create(*First));
205     return iterator(List.eraseAndDispose(I.wrapped(), Disposer(*this)));
210         List.eraseAndDispose(First.wrapped(), Last.wrapped(), Disposer(*this)));
213   void clear() { List.clearAndDispose(Disposer(*this)); }
214   void pop_back() { List.eraseAndDispose(--List.end(), Disposer(*this)); }
215   void pop_front() { List.eraseAndDispose(List.begin(), Disposer(*this)); }