#include <memory>
#include <vector>
#include <iterator>
#include <algorithm>
Go to the source code of this file.
Namespaces | |
| namespace | wibble |
| namespace | wibble::list |
Classes | |
| struct | wibble::list::ListIterator< List > |
| struct | wibble::list::Sorted< List > |
| struct | wibble::list::Sorted< List >::SharedVec |
| struct | wibble::list::Sorted< List >::SharedPtr |
| struct | wibble::list::Filtered< List, Predicate > |
| struct | wibble::list::Unique< List > |
| struct | wibble::list::Take< List > |
| struct | wibble::list::Map< List, F > |
| struct | wibble::list::Empty< T > |
| struct | wibble::list::Singular< T > |
| struct | wibble::list::Append< T1, T2 > |
Functions | |
| template<typename X> | |
| Singular< X > | wibble::list::singular (const X &x) |
| template<typename X, typename Y> | |
| Append< X, Y > | wibble::list::append (const X &x, const Y &y) |
| template<typename List> | |
| size_t | wibble::list::count (List l) |
| template<typename List, typename F> | |
| void | wibble::list::foreach (List l, F f) |
| template<typename List, template< typename > class F> | |
| void | wibble::list::foreach (List l, F< typename List::Type > f) |
| template<typename List, typename Pred> | |
| Filtered< List, Pred > | wibble::list::filter (List l, Pred p) |
| template<typename List, template< typename > class Pred> | |
| Filtered< List, Pred< List > > | wibble::list::filter (List l, Pred< List > p) |
| template<typename List, typename F> | |
| Map< List, F > | wibble::list::map (const List &l, const F &f) |
| template<typename List> | |
| Sorted< List > | wibble::list::sort (List l) |
| template<typename List> | |
| Unique< List > | wibble::list::unique (List l) |
| template<typename List> | |
| Take< List > | wibble::list::take (int t, List l) |
| template<typename List> | |
| ListIterator< List > | wibble::list::begin (List l) |
| template<typename List> | |
| ListIterator< List > | wibble::list::end (List) |
1.5.6