ulist< T > Class Template Reference

#include <ulist.h>

List of all members.


Detailed Description

template<class T>
class ulist< T >

Unsorted list container.

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)
iterator begin ()
iterator end ()
size_t size ()

Protected Member Functions

void swap (ulist< T > *other)

Classes

struct  iterator


Constructor & Destructor Documentation

template<class T>
ulist< T >.ulist ( size_t  initial  ) 


Member Function Documentation

template<class T>
void ulist< T >.swap ( ulist< T > *  other  )  [protected]

template<class T>
void ulist< T >.push_back ( T &  t  ) 

template<class T>
T& ulist< T >.back (  ) 

template<class T>
void ulist< T >.erase ( iterator  i  ) 

template<class T>
iterator ulist< T >.find ( T *  t  ) 

template<class T>
iterator ulist< T >.begin (  ) 

template<class T>
iterator ulist< T >.end (  ) 

template<class T>
size_t ulist< T >.size (  ) 


The documentation for this class was generated from the following file:

Genereated on Tue Mar 11 19:26:04 2008 by Doxygen.

(c) Copyright 2005, 2008 The Apache Software Foundation or its licensors, as applicable.