#include <cassert>#include <iterator>#include <vector>

Go to the source code of this file.
Classes | |
| class | utils::smart_list< Data > |
| This is a variant on a list that never invalidates iterators (unless, of course, the list ceases to exist). More... | |
| struct | utils::smart_list< Data >::node_t |
| Nodes in the smart list. More... | |
| class | utils::smart_list< Data >::iterator_base< Value, Reversed > |
| The base for the list's iterator classes. More... | |
| struct | utils::smart_list< Data >::iterator |
| struct | utils::smart_list< Data >::const_iterator |
| struct | utils::smart_list< Data >::reverse_iterator |
| struct | utils::smart_list< Data >::const_reverse_iterator |
Namespaces | |
| utils | |
Functions | |
| template<class Data > | |
| bool | utils::operator== (const smart_list< Data > &a, const smart_list< Data > &b) |
| Equality, if lists contain equal elements in the same order. More... | |
| template<class Data > | |
| bool | utils::operator< (const smart_list< Data > &a, const smart_list< Data > &b) |
| Lexicographical order. More... | |
1.8.8