2 * InspIRCd -- Internet Relay Chat Daemon
4 * Copyright (C) 2013-2014 Attila Molnar <attilamolnar@hush.com>
6 * This file is part of InspIRCd. InspIRCd is free software: you can
7 * redistribute it and/or modify it under the terms of the GNU General Public
8 * License as published by the Free Software Foundation, version 2.
10 * This program is distributed in the hope that it will be useful, but WITHOUT
11 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
12 * FOR A PARTICULAR PURPOSE. See the GNU General Public License for more
15 * You should have received a copy of the GNU General Public License
16 * along with this program. If not, see <http://www.gnu.org/licenses/>.
24 struct intrusive_list_def_tag { };
26 template <typename T, typename Tag = intrusive_list_def_tag> class intrusive_list;
28 template <typename T, typename Tag = intrusive_list_def_tag>
29 class intrusive_list_node
37 ptr_next->intrusive_list_node<T, Tag>::ptr_prev = this->ptr_prev;
39 ptr_prev->intrusive_list_node<T, Tag>::ptr_next = this->ptr_next;
40 ptr_next = ptr_prev = NULL;
50 friend class intrusive_list<T, Tag>;
53 template <typename T, typename Tag>
57 class iterator : public std::iterator<std::bidirectional_iterator_tag, T*>
67 iterator& operator++()
69 curr = curr->intrusive_list_node<T, Tag>::ptr_next;
73 iterator operator++(int)
80 iterator& operator--()
82 curr = curr->intrusive_list_node<T, Tag>::ptr_prev;
86 iterator operator--(int)
93 bool operator==(const iterator& other) const { return (curr == other.curr); }
94 bool operator!=(const iterator& other) const { return (curr != other.curr); }
95 T* operator*() const { return curr; }
98 typedef iterator const_iterator;
108 return (size() == 0);
116 iterator begin() const
118 return iterator(listhead);
136 void push_front(T* x)
140 x->intrusive_list_node<T, Tag>::ptr_next = listhead;
141 listhead->intrusive_list_node<T, Tag>::ptr_prev = x;
146 void erase(const iterator& it)
154 listhead = x->intrusive_list_node<T, Tag>::ptr_next;
155 x->intrusive_list_node<T, Tag>::unlink();