C-Breeze C Compiler Infrastructure [ Project home page]

vector_set< T > Class Template Reference Vector-based set. More... #include <memoryaccess.h> Inheritance diagram for vector_set< T >: List of all members. Public Member Functions   vector_set () void  insert (T element) void  insert (typename vector< T >::const_iterator b, typename vector< T >::const_iterator e) vector< T >::const_iterator  find (T element) const vector< T >::iterator  find (T element) Detailed Description template<class T> class vector_set< T > Vector-based set. This is my own template that implements a set using the vector template for its underlying implementation. For small sets this turns out to be faster and more memory efficient that the STL set. To make a vector work like a set, we just need to implement the insert() and find() methods. We won't worry about making sure that the other vector methods preserve the set properties -- if you use the set incorrectly, too bad. Definition at line 70 of file memoryaccess.h. Constructor & Destructor Documentation template<class T> vector_set< T >::vector_set (    )  [inline]   Definition at line 74 of file memoryaccess.h. Member Function Documentation template<class T> vector< T >::iterator vector_set< T >::find (  T    element )  [inline]   Definition at line 104 of file memoryaccess.h. template<class T> vector< T >::const_iterator vector_set< T >::find (  T    element )  const [inline]   Definition at line 100 of file memoryaccess.h. template<class T> void vector_set< T >::insert (  typename vector< T >::const_iterator    b, typename vector< T >::const_iterator    e )  [inline]   Definition at line 91 of file memoryaccess.h. template<class T> void vector_set< T >::insert (  T    element )  [inline]   Definition at line 79 of file memoryaccess.h. Referenced by vector_set< memoryBlock * >::insert(). The documentation for this class was generated from the following file: memoryaccess.h

Generated on August 27, 2003
Back to the C-Breeze home page