1 //===-- <Support/ilist> - Intrusive Linked List Template ---------*- C++ -*--=//
3 // This file defines classes to implement an intrusive doubly linked list class
4 // (ie each node of the list must contain a next and previous field for the
7 // The ilist_traits trait class is used to gain access to the next and previous
8 // fields of the node type that the list is instantiated with. If it is not
9 // specialized, the list defaults to using the getPrev(), getNext() method calls
10 // to get the next and previous pointers.
12 // The ilist class itself, should be a plug in replacement for list, assuming
13 // that the nodes contain next/prev pointers. This list replacement does not
14 // provides a constant time size() method, so be careful to use empty() when you
15 // really want to know if it's empty.
17 // The ilist class is implemented by allocating a 'tail' node when the list is
18 // created (using ilist_traits<>::createEndMarker()). This tail node is
19 // absolutely required because the user must be able to compute end()-1. Because
20 // of this, users of the direct next/prev links will see an extra link on the
21 // end of the list, which should be ignored.
23 // Requirements for a user of this list:
25 // 1. The user must provide {g|s}et{Next|Prev} methods, or specialize
26 // ilist_traits to provide an alternate way of getting and setting next and
29 //===----------------------------------------------------------------------===//
31 #ifndef INCLUDED_SUPPORT_ILIST
32 #define INCLUDED_SUPPORT_ILIST
36 #include <Support/iterator>
38 template<typename NodeTy, typename Traits> class iplist;
39 template<typename NodeTy> class ilist_iterator;
41 // Template traits for intrusive list. By specializing this template class, you
42 // can change what next/prev fields are used to store the links...
43 template<typename NodeTy>
45 static NodeTy *getPrev(NodeTy *N) { return N->getPrev(); }
46 static NodeTy *getNext(NodeTy *N) { return N->getNext(); }
47 static const NodeTy *getPrev(const NodeTy *N) { return N->getPrev(); }
48 static const NodeTy *getNext(const NodeTy *N) { return N->getNext(); }
50 static void setPrev(NodeTy *N, NodeTy *Prev) { N->setPrev(Prev); }
51 static void setNext(NodeTy *N, NodeTy *Next) { N->setNext(Next); }
53 static NodeTy *createNode() { return new NodeTy(); }
54 static NodeTy *createNode(const NodeTy &V) { return new NodeTy(V); }
57 void addNodeToList(NodeTy *NTy) {}
58 void removeNodeFromList(NodeTy *NTy) {}
59 void transferNodesFromList(iplist<NodeTy, ilist_traits> &L2,
60 ilist_iterator<NodeTy> first,
61 ilist_iterator<NodeTy> last) {}
64 // Const traits are the same as nonconst traits...
66 struct ilist_traits<const Ty> : public ilist_traits<Ty> {};
69 //===----------------------------------------------------------------------===//
70 // ilist_iterator<Node> - Iterator for intrusive list.
72 template<typename NodeTy>
74 : public bidirectional_iterator<NodeTy, ptrdiff_t> {
75 typedef ilist_traits<NodeTy> Traits;
76 typedef bidirectional_iterator<NodeTy, ptrdiff_t> super;
78 typedef typename super::pointer pointer;
79 typedef typename super::reference reference;
82 typedef size_t size_type;
84 ilist_iterator(pointer NP) : NodePtr(NP) {}
85 ilist_iterator() : NodePtr(0) {}
87 // This is templated so that we can allow constructing a const iterator from
88 // a nonconst iterator...
89 template<class node_ty>
90 ilist_iterator(const ilist_iterator<node_ty> &RHS)
91 : NodePtr(RHS.getNodePtrUnchecked()) {}
93 // This is templated so that we can allow assigning to a const iterator from
94 // a nonconst iterator...
95 template<class node_ty>
96 const ilist_iterator &operator=(const ilist_iterator<node_ty> &RHS) {
97 NodePtr = RHS.getNodePtrUnchecked();
102 operator pointer() const {
103 assert(Traits::getNext(NodePtr) != 0 && "Dereferencing end()!");
107 reference operator*() const {
108 assert(Traits::getNext(NodePtr) != 0 && "Dereferencing end()!");
111 pointer operator->() { return &operator*(); }
112 const pointer operator->() const { return &operator*(); }
114 // Comparison operators
115 bool operator==(const ilist_iterator &RHS) const {
116 return NodePtr == RHS.NodePtr;
118 bool operator!=(const ilist_iterator &RHS) const {
119 return NodePtr != RHS.NodePtr;
122 // Increment and decrement operators...
123 ilist_iterator &operator--() { // predecrement - Back up
124 NodePtr = Traits::getPrev(NodePtr);
125 assert(NodePtr && "--'d off the beginning of an ilist!");
128 ilist_iterator &operator++() { // preincrement - Advance
129 NodePtr = Traits::getNext(NodePtr);
130 assert(NodePtr && "++'d off the end of an ilist!");
133 ilist_iterator operator--(int) { // postdecrement operators...
134 ilist_iterator tmp = *this;
138 ilist_iterator operator++(int) { // postincrement operators...
139 ilist_iterator tmp = *this;
145 // Dummy operators to make errors apparent...
146 template<class X> void operator+(X Val) {}
147 template<class X> void operator-(X Val) {}
149 // Internal interface, do not use...
150 pointer getNodePtrUnchecked() const { return NodePtr; }
154 //===----------------------------------------------------------------------===//
156 // iplist - The subset of list functionality that can safely be used on nodes of
157 // polymorphic types, ie a heterogeneus list with a common base class that holds
158 // the next/prev pointers...
160 template<typename NodeTy, typename Traits=ilist_traits<NodeTy> >
161 class iplist : public Traits {
164 static bool op_less(NodeTy &L, NodeTy &R) { return L < R; }
165 static bool op_equal(NodeTy &L, NodeTy &R) { return L == R; }
167 typedef NodeTy *pointer;
168 typedef const NodeTy *const_pointer;
169 typedef NodeTy &reference;
170 typedef const NodeTy &const_reference;
171 typedef NodeTy value_type;
172 typedef ilist_iterator<NodeTy> iterator;
173 typedef ilist_iterator<const NodeTy> const_iterator;
174 typedef size_t size_type;
175 typedef ptrdiff_t difference_type;
176 typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
177 typedef std::reverse_iterator<iterator> reverse_iterator;
179 iplist() : Head(createNode()), Tail(Head) {
183 ~iplist() { clear(); delete Tail; }
185 // Iterator creation methods...
186 iterator begin() { return iterator(Head); }
187 const_iterator begin() const { return const_iterator(Head); }
188 iterator end() { return iterator(Tail); }
189 const_iterator end() const { return const_iterator(Tail); }
191 // reverse iterator creation methods...
192 reverse_iterator rbegin() { return reverse_iterator(end()); }
193 const_reverse_iterator rbegin() const{ return const_reverse_iterator(end()); }
194 reverse_iterator rend() { return reverse_iterator(begin()); }
195 const_reverse_iterator rend() const {return const_reverse_iterator(begin());}
197 // Miscellaneous inspection routines...
198 size_type max_size() const { return size_type(-1); }
199 bool empty() const { return Head == Tail; }
201 // Front and back accessor functions...
203 assert(!empty() && "Called front() on empty list!");
206 const_reference front() const {
207 assert(!empty() && "Called front() on empty list!");
211 assert(!empty() && "Called back() on empty list!");
212 return *getPrev(Tail);
214 const_reference back() const {
215 assert(!empty() && "Called back() on empty list!");
216 return *getPrev(Tail);
219 void swap(iplist &RHS) {
220 abort(); // Swap does not use list traits callback correctly yet!
221 std::swap(Head, RHS.Head);
222 std::swap(Tail, RHS.Tail);
225 iterator insert(iterator where, NodeTy *New) {
226 NodeTy *CurNode = where.getNodePtrUnchecked(), *PrevNode = getPrev(CurNode);
227 setNext(New, CurNode);
228 setPrev(New, PrevNode);
231 setNext(PrevNode, New);
234 setPrev(CurNode, New);
236 addNodeToList(New); // Notify traits that we added a node...
240 NodeTy *remove(iterator &IT) {
241 assert(IT != end() && "Cannot remove end of list!");
243 NodeTy *NextNode = getNext(Node);
244 NodeTy *PrevNode = getPrev(Node);
247 setNext(PrevNode, NextNode);
250 setPrev(NextNode, PrevNode);
252 removeNodeFromList(Node); // Notify traits that we added a node...
256 NodeTy *remove(const iterator &IT) {
258 return remove(MutIt);
261 // erase - remove a node from the controlled sequence... and delete it.
262 iterator erase(iterator where) {
263 delete remove(where);
269 // transfer - The heart of the splice function. Move linked list nodes from
270 // [first, last) into position.
272 void transfer(iterator position, iplist &L2, iterator first, iterator last) {
273 assert(first != last && "Should be checked by callers");
274 if (position != last) {
275 // Remove [first, last) from its old position.
276 NodeTy *First = &*first, *Prev = getPrev(First);
277 NodeTy *Next = last.getNodePtrUnchecked(), *Last = getPrev(Next);
284 // Splice [first, last) into its new position.
285 NodeTy *PosNext = position.getNodePtrUnchecked();
286 NodeTy *PosPrev = getPrev(PosNext);
288 // Fix head of list...
290 setNext(PosPrev, First);
293 setPrev(First, PosPrev);
295 // Fix end of list...
296 setNext(Last, PosNext);
297 setPrev(PosNext, Last);
299 transferNodesFromList(L2, First, PosNext);
305 //===----------------------------------------------------------------------===
306 // Functionality derived from other functions defined above...
309 size_type size() const {
311 size_type Result = std::distance(begin(), end());
313 size_type Result = 0;
314 std::distance(begin(), end(), Result);
319 iterator erase(iterator first, iterator last) {
320 while (first != last)
321 first = erase(first);
325 void clear() { erase(begin(), end()); }
327 // Front and back inserters...
328 void push_front(NodeTy *val) { insert(begin(), val); }
329 void push_back(NodeTy *val) { insert(end(), val); }
331 assert(!empty() && "pop_front() on empty list!");
335 assert(!empty() && "pop_back() on empty list!");
336 iterator t = end(); erase(--t);
339 // Special forms of insert...
340 template<class InIt> void insert(iterator where, InIt first, InIt last) {
341 for (; first != last; ++first) insert(where, *first);
344 // Splice members - defined in terms of transfer...
345 void splice(iterator where, iplist &L2) {
347 transfer(where, L2, L2.begin(), L2.end());
349 void splice(iterator where, iplist &L2, iterator first) {
350 iterator last = first; ++last;
351 if (where == first || where == last) return; // No change
352 transfer(where, L2, first, last);
354 void splice(iterator where, iplist &L2, iterator first, iterator last) {
355 if (first != last) transfer(where, L2, first, last);
360 //===----------------------------------------------------------------------===
361 // High-Level Functionality that shouldn't really be here, but is part of list
364 // These two functions are actually called remove/remove_if in list<>, but
365 // they actually do the job of erase, rename them accordingly.
367 void erase(const NodeTy &val) {
368 for (iterator I = begin(), E = end(); I != E; ) {
369 iterator next = I; ++next;
370 if (*I == val) erase(I);
374 template<class Pr1> void erase_if(Pr1 pred) {
375 for (iterator I = begin(), E = end(); I != E; ) {
376 iterator next = I; ++next;
377 if (pred(*I)) erase(I);
382 template<class Pr2> void unique(Pr2 pred) {
384 for (iterator I = begin(), E = end(), Next = begin(); ++Next != E;) {
392 void unique() { unique(op_equal); }
394 template<class Pr3> void merge(iplist &right, Pr3 pred) {
395 iterator first1 = begin(), last1 = end();
396 iterator first2 = right.begin(), last2 = right.end();
397 while (first1 != last1 && first2 != last2)
398 if (pred(*first2, *first1)) {
399 iterator next = first2;
400 transfer(first1, right, first2, ++next);
405 if (first2 != last2) transfer(last1, right, first2, last2);
407 void merge(iplist &right) { return merge(right, op_less); }
409 template<class Pr3> void sort(Pr3 pred);
410 void sort() { sort(op_less); }
415 template<typename NodeTy>
416 struct ilist : public iplist<NodeTy> {
417 typedef typename iplist<NodeTy>::size_type size_type;
418 typedef typename iplist<NodeTy>::iterator iterator;
421 ilist(const ilist &right) {
422 insert(begin(), right.begin(), right.end());
424 explicit ilist(size_type count) {
425 insert(begin(), count, NodeTy());
427 ilist(size_type count, const NodeTy &val) {
428 insert(begin(), count, val);
430 template<class InIt> ilist(InIt first, InIt last) {
431 insert(begin(), first, last);
435 // Forwarding functions: A workaround for GCC 2.95 which does not correctly
436 // support 'using' declarations to bring a hidden member into scope.
438 iterator insert(iterator a, NodeTy *b){ return iplist<NodeTy>::insert(a, b); }
439 void push_front(NodeTy *a) { iplist<NodeTy>::push_front(a); }
440 void push_back(NodeTy *a) { iplist<NodeTy>::push_back(a); }
443 // Main implementation here - Insert for a node passed by value...
444 iterator insert(iterator where, const NodeTy &val) {
445 return insert(where, createNode(val));
449 // Front and back inserters...
450 void push_front(const NodeTy &val) { insert(begin(), val); }
451 void push_back(const NodeTy &val) { insert(end(), val); }
453 // Special forms of insert...
454 template<class InIt> void insert(iterator where, InIt first, InIt last) {
455 for (; first != last; ++first) insert(where, *first);
457 void insert(iterator where, size_type count, const NodeTy &val) {
458 for (; count != 0; --count) insert(where, val);
461 // Assign special forms...
462 void assign(size_type count, const NodeTy &val) {
463 iterator I = begin();
464 for (; I != end() && count != 0; ++I, --count)
467 insert(end(), n, val);
471 template<class InIt> void assign(InIt first, InIt last) {
472 iterator first1 = begin(), last1 = end();
473 for ( ; first1 != last1 && first2 != last2; ++first1, ++first2)
476 erase(first1, last1);
478 insert(last1, first2, last2);
483 void resize(size_type newsize, NodeTy val) {
484 iterator i = begin();
486 for ( ; i != end() && len < newsize; ++i, ++len) /* empty*/ ;
491 insert(end(), newsize - len, val);
493 void resize(size_type newsize) { resize(newsize, NodeTy()); }
497 // Ensure that swap uses the fast list swap...
499 void swap(iplist<Ty> &Left, iplist<Ty> &Right) {
502 } // End 'std' extensions...