Main Page   Namespace List   Class Hierarchy   Alphabetical List   Compound List   File List   Compound Members   File Members  

ordered_vector< Key, Compare > Class Template Reference

#include <ordered_vector.h>

Inheritance diagram for ordered_vector< Key, Compare >:

ov_multiset< Key, Compare > ov_set< Key, Compare > List of all members.

Public Types

typedef Key KEY_TYPE
typedef Key VALUE_TYPE
typedef Key & REFERENCE
typedef const Key & CONST_REFERENCE
typedef Compare KEY_COMPARE
typedef Compare VALUE_COMPARE
typedef TYPENAME Vector::iterator ITERATOR
typedef TYPENAME Vector::const_iterator CONST_ITERATOR
typedef TYPENAME Vector::reverse_iterator REVERSE_ITERATOR
typedef TYPENAME Vector::const_reverse_iterator CONST_REVERSE_ITERATOR
typedef TYPENAME Vector::difference_type DIFFERENCE_TYPE
typedef TYPENAME Vector::size_type SIZE_TYPE
typedef KEY_TYPE key_type
typedef VALUE_TYPE value_type
typedef REFERENCE reference
typedef CONST_REFERENCE const_reference
typedef KEY_COMPARE key_compare
typedef VALUE_COMPARE value_compare
typedef ITERATOR iterator
typedef CONST_ITERATOR const_iterator
typedef REVERSE_ITERATOR reverse_iterator
typedef CONST_REVERSE_ITERATOR const_reverse_iterator
typedef DIFFERENCE_TYPE difference_type
typedef SIZE_TYPE size_type

Public Member Functions

INLINE ordered_vector (const Compare &compare=Compare())
INLINE ordered_vector (const ordered_vector< Key, Compare > &copy)
INLINE ordered_vector< Key,
Compare > & 
operator= (const ordered_vector< Key, Compare > &copy)
INLINE ~ordered_vector ()
INLINE ITERATOR begin ()
INLINE ITERATOR end ()
INLINE REVERSE_ITERATOR rbegin ()
INLINE REVERSE_ITERATOR rend ()
INLINE CONST_ITERATOR begin () const
INLINE CONST_ITERATOR end () const
INLINE CONST_REVERSE_ITERATOR rbegin () const
INLINE CONST_REVERSE_ITERATOR rend () const
INLINE reference operator[] (SIZE_TYPE n)
INLINE const_reference operator[] (SIZE_TYPE n) const
INLINE SIZE_TYPE size () const
INLINE SIZE_TYPE max_size () const
INLINE bool empty () const
INLINE bool operator== (const ordered_vector< Key, Compare > &other) const
INLINE bool operator!= (const ordered_vector< Key, Compare > &other) const
INLINE bool operator< (const ordered_vector< Key, Compare > &other) const
INLINE bool operator> (const ordered_vector< Key, Compare > &other) const
INLINE bool operator<= (const ordered_vector< Key, Compare > &other) const
INLINE bool operator>= (const ordered_vector< Key, Compare > &other) const
ITERATOR insert_unique (ITERATOR position, const VALUE_TYPE &key)
ITERATOR insert_nonunique (ITERATOR position, const VALUE_TYPE &key)
INLINE pair< ITERATOR, bool > insert_unique (const VALUE_TYPE &key)
INLINE ITERATOR insert_nonunique (const VALUE_TYPE &key)
INLINE ITERATOR erase (ITERATOR position)
INLINE SIZE_TYPE erase (const KEY_TYPE &key)
INLINE void erase (ITERATOR first, ITERATOR last)
INLINE void clear ()
INLINE ITERATOR find (const KEY_TYPE &key)
INLINE CONST_ITERATOR find (const KEY_TYPE &key) const
INLINE ITERATOR find_particular (const KEY_TYPE &key)
INLINE CONST_ITERATOR find_particular (const KEY_TYPE &key) const
INLINE SIZE_TYPE count (const KEY_TYPE &key) const
INLINE ITERATOR lower_bound (const KEY_TYPE &key)
INLINE CONST_ITERATOR lower_bound (const KEY_TYPE &key) const
INLINE ITERATOR upper_bound (const KEY_TYPE &key)
INLINE CONST_ITERATOR upper_bound (const KEY_TYPE &key) const
INLINE pair< ITERATOR, ITERATORequal_range (const KEY_TYPE &key)
INLINE pair< CONST_ITERATOR,
CONST_ITERATOR
equal_range (const KEY_TYPE &key) const
INLINE void swap (ordered_vector< Key, Compare > &other)
INLINE void reserve (SIZE_TYPE n)
INLINE void sort_unique ()
INLINE void sort_nonunique ()
bool verify_list_unique () const
bool verify_list_nonunique () const
INLINE void push_back (const VALUE_TYPE &key)

Private Types

typedef pvector< Key > Vector

Private Member Functions

INLINE ITERATOR nci (CONST_ITERATOR i)
INLINE ITERATOR find_insert_position (ITERATOR first, ITERATOR last, const KEY_TYPE &key)
ITERATOR r_find_insert_position (ITERATOR first, ITERATOR last, const KEY_TYPE &key)
CONST_ITERATOR r_find (CONST_ITERATOR first, CONST_ITERATOR last, CONST_ITERATOR not_found, const KEY_TYPE &key) const
CONST_ITERATOR r_find_particular (CONST_ITERATOR first, CONST_ITERATOR last, CONST_ITERATOR not_found, const KEY_TYPE &key) const
SIZE_TYPE r_count (CONST_ITERATOR first, CONST_ITERATOR last, const KEY_TYPE &key) const
CONST_ITERATOR r_lower_bound (CONST_ITERATOR first, CONST_ITERATOR last, const KEY_TYPE &key) const
CONST_ITERATOR r_upper_bound (CONST_ITERATOR first, CONST_ITERATOR last, const KEY_TYPE &key) const
pair< CONST_ITERATOR, CONST_ITERATORr_equal_range (CONST_ITERATOR first, CONST_ITERATOR last, const KEY_TYPE &key) const

Private Attributes

Compare _compare
Vector _vector

template<class Key, class Compare = less<Key>>
class ordered_vector< Key, Compare >


Member Typedef Documentation

template<class Key, class Compare = less<Key>>
typedef CONST_ITERATOR ordered_vector< Key, Compare >::const_iterator
 

Definition at line 126 of file ordered_vector.h.

template<class Key, class Compare = less<Key>>
typedef TYPENAME Vector::const_iterator ordered_vector< Key, Compare >::CONST_ITERATOR
 

Definition at line 109 of file ordered_vector.h.

template<class Key, class Compare = less<Key>>
typedef CONST_REFERENCE ordered_vector< Key, Compare >::const_reference
 

Definition at line 122 of file ordered_vector.h.

template<class Key, class Compare = less<Key>>
typedef const Key& ordered_vector< Key, Compare >::CONST_REFERENCE
 

Definition at line 101 of file ordered_vector.h.

template<class Key, class Compare = less<Key>>
typedef CONST_REVERSE_ITERATOR ordered_vector< Key, Compare >::const_reverse_iterator
 

Definition at line 128 of file ordered_vector.h.

template<class Key, class Compare = less<Key>>
typedef TYPENAME Vector::const_reverse_iterator ordered_vector< Key, Compare >::CONST_REVERSE_ITERATOR
 

Definition at line 111 of file ordered_vector.h.

template<class Key, class Compare = less<Key>>
typedef DIFFERENCE_TYPE ordered_vector< Key, Compare >::difference_type
 

Definition at line 129 of file ordered_vector.h.

template<class Key, class Compare = less<Key>>
typedef TYPENAME Vector::difference_type ordered_vector< Key, Compare >::DIFFERENCE_TYPE
 

Definition at line 113 of file ordered_vector.h.

template<class Key, class Compare = less<Key>>
typedef ITERATOR ordered_vector< Key, Compare >::iterator
 

Definition at line 125 of file ordered_vector.h.

template<class Key, class Compare = less<Key>>
typedef TYPENAME Vector::iterator ordered_vector< Key, Compare >::ITERATOR
 

Reimplemented in ov_set< Key, Compare >, and ov_multiset< Key, Compare >.

Definition at line 108 of file ordered_vector.h.

template<class Key, class Compare = less<Key>>
typedef KEY_COMPARE ordered_vector< Key, Compare >::key_compare
 

Definition at line 123 of file ordered_vector.h.

template<class Key, class Compare = less<Key>>
typedef Compare ordered_vector< Key, Compare >::KEY_COMPARE
 

Definition at line 102 of file ordered_vector.h.

template<class Key, class Compare = less<Key>>
typedef KEY_TYPE ordered_vector< Key, Compare >::key_type
 

Definition at line 119 of file ordered_vector.h.

template<class Key, class Compare = less<Key>>
typedef Key ordered_vector< Key, Compare >::KEY_TYPE
 

Definition at line 98 of file ordered_vector.h.

template<class Key, class Compare = less<Key>>
typedef REFERENCE ordered_vector< Key, Compare >::reference
 

Definition at line 121 of file ordered_vector.h.

template<class Key, class Compare = less<Key>>
typedef Key& ordered_vector< Key, Compare >::REFERENCE
 

Definition at line 100 of file ordered_vector.h.

template<class Key, class Compare = less<Key>>
typedef REVERSE_ITERATOR ordered_vector< Key, Compare >::reverse_iterator
 

Definition at line 127 of file ordered_vector.h.

template<class Key, class Compare = less<Key>>
typedef TYPENAME Vector::reverse_iterator ordered_vector< Key, Compare >::REVERSE_ITERATOR
 

Definition at line 110 of file ordered_vector.h.

template<class Key, class Compare = less<Key>>
typedef SIZE_TYPE ordered_vector< Key, Compare >::size_type
 

Definition at line 130 of file ordered_vector.h.

template<class Key, class Compare = less<Key>>
typedef TYPENAME Vector::size_type ordered_vector< Key, Compare >::SIZE_TYPE
 

Definition at line 114 of file ordered_vector.h.

template<class Key, class Compare = less<Key>>
typedef VALUE_COMPARE ordered_vector< Key, Compare >::value_compare
 

Definition at line 124 of file ordered_vector.h.

template<class Key, class Compare = less<Key>>
typedef Compare ordered_vector< Key, Compare >::VALUE_COMPARE
 

Definition at line 103 of file ordered_vector.h.

template<class Key, class Compare = less<Key>>
typedef VALUE_TYPE ordered_vector< Key, Compare >::value_type
 

Definition at line 120 of file ordered_vector.h.

template<class Key, class Compare = less<Key>>
typedef Key ordered_vector< Key, Compare >::VALUE_TYPE
 

Reimplemented in ov_set< Key, Compare >, and ov_multiset< Key, Compare >.

Definition at line 99 of file ordered_vector.h.

template<class Key, class Compare = less<Key>>
typedef pvector<Key> ordered_vector< Key, Compare >::Vector [private]
 

Definition at line 94 of file ordered_vector.h.


Constructor & Destructor Documentation

template<class Key, class Compare = less<Key>>
INLINE ordered_vector< Key, Compare >::ordered_vector const Compare &  compare = Compare()  ) 
 

template<class Key, class Compare = less<Key>>
INLINE ordered_vector< Key, Compare >::ordered_vector const ordered_vector< Key, Compare > &  copy  ) 
 

template<class Key, class Compare = less<Key>>
INLINE ordered_vector< Key, Compare >::~ordered_vector  ) 
 


Member Function Documentation

template<class Key, class Compare = less<Key>>
INLINE CONST_ITERATOR ordered_vector< Key, Compare >::begin  )  const
 

template<class Key, class Compare = less<Key>>
INLINE ITERATOR ordered_vector< Key, Compare >::begin  ) 
 

Referenced by PT().

template<class Key, class Compare = less<Key>>
INLINE void ordered_vector< Key, Compare >::clear  ) 
 

template<class Key, class Compare = less<Key>>
INLINE SIZE_TYPE ordered_vector< Key, Compare >::count const KEY_TYPE key  )  const
 

template<class Key, class Compare = less<Key>>
INLINE bool ordered_vector< Key, Compare >::empty  )  const
 

template<class Key, class Compare = less<Key>>
INLINE CONST_ITERATOR ordered_vector< Key, Compare >::end  )  const
 

template<class Key, class Compare = less<Key>>
INLINE ITERATOR ordered_vector< Key, Compare >::end  ) 
 

Referenced by PT(), and VirtualFileSimple::scan_local_directory().

template<class Key, class Compare = less<Key>>
INLINE pair<CONST_ITERATOR, CONST_ITERATOR> ordered_vector< Key, Compare >::equal_range const KEY_TYPE key  )  const
 

template<class Key, class Compare = less<Key>>
INLINE pair<ITERATOR, ITERATOR> ordered_vector< Key, Compare >::equal_range const KEY_TYPE key  ) 
 

template<class Key, class Compare = less<Key>>
INLINE void ordered_vector< Key, Compare >::erase ITERATOR  first,
ITERATOR  last
 

template<class Key, class Compare = less<Key>>
INLINE SIZE_TYPE ordered_vector< Key, Compare >::erase const KEY_TYPE key  ) 
 

template<class Key, class Compare = less<Key>>
INLINE ITERATOR ordered_vector< Key, Compare >::erase ITERATOR  position  ) 
 

template<class Key, class Compare = less<Key>>
INLINE CONST_ITERATOR ordered_vector< Key, Compare >::find const KEY_TYPE key  )  const
 

template<class Key, class Compare = less<Key>>
INLINE ITERATOR ordered_vector< Key, Compare >::find const KEY_TYPE key  ) 
 

Referenced by VirtualFileSimple::scan_local_directory().

template<class Key, class Compare = less<Key>>
INLINE ITERATOR ordered_vector< Key, Compare >::find_insert_position ITERATOR  first,
ITERATOR  last,
const KEY_TYPE key
[private]
 

template<class Key, class Compare = less<Key>>
INLINE CONST_ITERATOR ordered_vector< Key, Compare >::find_particular const KEY_TYPE key  )  const
 

template<class Key, class Compare = less<Key>>
INLINE ITERATOR ordered_vector< Key, Compare >::find_particular const KEY_TYPE key  ) 
 

template<class Key, class Compare = less<Key>>
INLINE ITERATOR ordered_vector< Key, Compare >::insert_nonunique const VALUE_TYPE key  ) 
 

template<class Key, class Compare = less<Key>>
ITERATOR ordered_vector< Key, Compare >::insert_nonunique ITERATOR  position,
const VALUE_TYPE key
 

template<class Key, class Compare = less<Key>>
INLINE pair<ITERATOR, bool> ordered_vector< Key, Compare >::insert_unique const VALUE_TYPE key  ) 
 

template<class Key, class Compare = less<Key>>
ITERATOR ordered_vector< Key, Compare >::insert_unique ITERATOR  position,
const VALUE_TYPE key
 

template<class Key, class Compare = less<Key>>
INLINE CONST_ITERATOR ordered_vector< Key, Compare >::lower_bound const KEY_TYPE key  )  const
 

template<class Key, class Compare = less<Key>>
INLINE ITERATOR ordered_vector< Key, Compare >::lower_bound const KEY_TYPE key  ) 
 

template<class Key, class Compare = less<Key>>
INLINE SIZE_TYPE ordered_vector< Key, Compare >::max_size  )  const
 

template<class Key, class Compare = less<Key>>
INLINE ITERATOR ordered_vector< Key, Compare >::nci CONST_ITERATOR  i  )  [private]
 

template<class Key, class Compare = less<Key>>
INLINE bool ordered_vector< Key, Compare >::operator!= const ordered_vector< Key, Compare > &  other  )  const
 

template<class Key, class Compare = less<Key>>
INLINE bool ordered_vector< Key, Compare >::operator< const ordered_vector< Key, Compare > &  other  )  const
 

template<class Key, class Compare = less<Key>>
INLINE bool ordered_vector< Key, Compare >::operator<= const ordered_vector< Key, Compare > &  other  )  const
 

template<class Key, class Compare = less<Key>>
INLINE ordered_vector<Key, Compare>& ordered_vector< Key, Compare >::operator= const ordered_vector< Key, Compare > &  copy  ) 
 

template<class Key, class Compare = less<Key>>
INLINE bool ordered_vector< Key, Compare >::operator== const ordered_vector< Key, Compare > &  other  )  const
 

template<class Key, class Compare = less<Key>>
INLINE bool ordered_vector< Key, Compare >::operator> const ordered_vector< Key, Compare > &  other  )  const
 

template<class Key, class Compare = less<Key>>
INLINE bool ordered_vector< Key, Compare >::operator>= const ordered_vector< Key, Compare > &  other  )  const
 

template<class Key, class Compare = less<Key>>
INLINE const_reference ordered_vector< Key, Compare >::operator[] SIZE_TYPE  n  )  const
 

template<class Key, class Compare = less<Key>>
INLINE reference ordered_vector< Key, Compare >::operator[] SIZE_TYPE  n  ) 
 

template<class Key, class Compare = less<Key>>
INLINE void ordered_vector< Key, Compare >::push_back const VALUE_TYPE key  ) 
 

template<class Key, class Compare = less<Key>>
SIZE_TYPE ordered_vector< Key, Compare >::r_count CONST_ITERATOR  first,
CONST_ITERATOR  last,
const KEY_TYPE key
const [private]
 

template<class Key, class Compare = less<Key>>
pair<CONST_ITERATOR, CONST_ITERATOR> ordered_vector< Key, Compare >::r_equal_range CONST_ITERATOR  first,
CONST_ITERATOR  last,
const KEY_TYPE key
const [private]
 

template<class Key, class Compare = less<Key>>
CONST_ITERATOR ordered_vector< Key, Compare >::r_find CONST_ITERATOR  first,
CONST_ITERATOR  last,
CONST_ITERATOR  not_found,
const KEY_TYPE key
const [private]
 

template<class Key, class Compare = less<Key>>
ITERATOR ordered_vector< Key, Compare >::r_find_insert_position ITERATOR  first,
ITERATOR  last,
const KEY_TYPE key
[private]
 

template<class Key, class Compare = less<Key>>
CONST_ITERATOR ordered_vector< Key, Compare >::r_find_particular CONST_ITERATOR  first,
CONST_ITERATOR  last,
CONST_ITERATOR  not_found,
const KEY_TYPE key
const [private]
 

template<class Key, class Compare = less<Key>>
CONST_ITERATOR ordered_vector< Key, Compare >::r_lower_bound CONST_ITERATOR  first,
CONST_ITERATOR  last,
const KEY_TYPE key
const [private]
 

template<class Key, class Compare = less<Key>>
CONST_ITERATOR ordered_vector< Key, Compare >::r_upper_bound CONST_ITERATOR  first,
CONST_ITERATOR  last,
const KEY_TYPE key
const [private]
 

template<class Key, class Compare = less<Key>>
INLINE CONST_REVERSE_ITERATOR ordered_vector< Key, Compare >::rbegin  )  const
 

template<class Key, class Compare = less<Key>>
INLINE REVERSE_ITERATOR ordered_vector< Key, Compare >::rbegin  ) 
 

template<class Key, class Compare = less<Key>>
INLINE CONST_REVERSE_ITERATOR ordered_vector< Key, Compare >::rend  )  const
 

template<class Key, class Compare = less<Key>>
INLINE REVERSE_ITERATOR ordered_vector< Key, Compare >::rend  ) 
 

template<class Key, class Compare = less<Key>>
INLINE void ordered_vector< Key, Compare >::reserve SIZE_TYPE  n  ) 
 

template<class Key, class Compare = less<Key>>
INLINE SIZE_TYPE ordered_vector< Key, Compare >::size  )  const
 

template<class Key, class Compare = less<Key>>
INLINE void ordered_vector< Key, Compare >::sort_nonunique  ) 
 

template<class Key, class Compare = less<Key>>
INLINE void ordered_vector< Key, Compare >::sort_unique  ) 
 

template<class Key, class Compare = less<Key>>
INLINE void ordered_vector< Key, Compare >::swap ordered_vector< Key, Compare > &  other  ) 
 

template<class Key, class Compare = less<Key>>
INLINE CONST_ITERATOR ordered_vector< Key, Compare >::upper_bound const KEY_TYPE key  )  const
 

template<class Key, class Compare = less<Key>>
INLINE ITERATOR ordered_vector< Key, Compare >::upper_bound const KEY_TYPE key  ) 
 

template<class Key, class Compare = less<Key>>
bool ordered_vector< Key, Compare >::verify_list_nonunique  )  const
 

template<class Key, class Compare = less<Key>>
bool ordered_vector< Key, Compare >::verify_list_unique  )  const
 


Member Data Documentation

template<class Key, class Compare = less<Key>>
Compare ordered_vector< Key, Compare >::_compare [private]
 

Definition at line 245 of file ordered_vector.h.

template<class Key, class Compare = less<Key>>
Vector ordered_vector< Key, Compare >::_vector [private]
 

Definition at line 246 of file ordered_vector.h.


The documentation for this class was generated from the following file:
Generated on Fri Apr 18 00:12:56 2003 for Panda by doxygen1.3