Whenever possible you should try to use one of the data structures available. If the data structures do not provide enough functionality for your needs you should consider enhancing them rather than writing something from scratch.
vector class is defined in vector.hpp and works the
same way as the standard STL
vector does except that it doesn’t
have as many constructors.
BasicList is a simple list structure which can either be
implemented as a singly or doubly linked list. It is defined in
StringMap is a associative array for strings. You should try
to use this when ever possible to avoid code bloat. It is defined in
Several hash tables are provided when
StringMap is not
appropriate. These hash tables provide a
are very similar to SGI’s STL implementation with a few exceptions.
It is defined in hash.hpp.
BlockSList provided a pool of nodes which can be used for
singly linked lists. It is defined in block_slist.hpp.