List of all members.
Features: common insertion time O(1), worst case O(log N) if collection has N elements linear iteration with ability to erase elements as we go mapping from payload pointer to iterator O(log N) notification about moved elements memory overhead O(log N) interface similar to std.list
BEWARE: element ordering is not preserved on modifications iterator-- may not usable for dereference operation
Public Member Functions
|ulist (size_t initial)|
|void||push_back (T &t)|
|T &||back ()|
|void||erase (iterator i)|
|iterator||find (T *t)|
Protected Member Functions
|void||swap (ulist< T > *other)|
|void ulist< T >.push_back||(||T &||t||)|
|T& ulist< T >.back||(||)|
|size_t ulist< T >.size||(||)|
Genereated on Tue Mar 11 19:26:04 2008 by Doxygen.
(c) Copyright 2005, 2008 The Apache Software Foundation or its licensors, as applicable.