Classes | Public Types | Public Member Functions | Private Attributes | Friends | List of all members
util::VectorMap< _Key, _Tp, _Compare > Class Template Reference

#include <VectorMap.h>

Classes

class  value_compare
 

Public Types

typedef _Key key_type
 
typedef _Tp mapped_type
 
typedef std::pair< _Key, _Tp > value_type
 
typedef _Compare key_compare
 
typedef std::allocator< std::pair< _Key, _Tp > > allocator_type
 
typedef std::vector< value_type > vector_type
 
typedef vector_type::pointer pointer
 
typedef vector_type::const_pointer const_pointer
 
typedef vector_type::reference reference
 
typedef vector_type::const_reference const_reference
 
typedef vector_type::iterator iterator
 
typedef vector_type::const_iterator const_iterator
 
typedef std::reverse_iterator< const_iterator > const_reverse_iterator
 
typedef std::reverse_iterator< iterator > reverse_iterator
 
typedef size_t size_type
 
typedef ptrdiff_t difference_type
 

Public Member Functions

allocator_type get_allocator () const
 Don't write this to the ROOT file. More...
 
iterator begin ()
 
const_iterator begin () const
 
iterator end ()
 
const_iterator end () const
 
reverse_iterator rbegin ()
 
const_reverse_iterator rbegin () const
 
reverse_iterator rend ()
 
const_reverse_iterator rend () const
 
bool empty () const
 
size_t size () const
 
size_t max_size () const
 
mapped_type & operator[] (const key_type &key)
 
const mapped_type & operator[] (const key_type &__k) const
 
mapped_type & at (const key_type &__k)
 
const mapped_type & at (const key_type &__k) const
 
std::pair< iterator, bool > insert (const value_type &entry)
 
iterator insert (iterator, const value_type &entry)
 
template<typename _InputIterator >
void insert (_InputIterator __first, _InputIterator __last)
 
void erase (iterator __position)
 
size_type erase (const key_type &key)
 
void erase (iterator __first, iterator __last)
 
void swap (VectorMap &other)
 
void clear ()
 
key_compare key_comp () const
 
value_compare value_comp () const
 
iterator find (const key_type &key)
 
const_iterator find (const key_type &key) const
 
size_type count (const key_type &__x) const
 
iterator lower_bound (const key_type &__x)
 
const_iterator lower_bound (const key_type &__x) const
 
iterator upper_bound (const key_type &__x)
 
const_iterator upper_bound (const key_type &__x) const
 
std::pair< iterator, iterator > equal_range (const key_type &key)
 
const mapped_type & operator() (const size_type &index) const
 
const mapped_type & Data (const size_type &index) const
 
const key_type & Key (const size_type &index) const
 
void reserve (size_type i)
 
size_type capacity ()
 

Private Attributes

vector_type sortedVectorMap
 
value_compare valueCompare
 

Friends

template<typename _K1 , typename _T1 , typename _C1 >
bool operator== (const VectorMap< _K1, _T1, _C1 > &, const VectorMap< _K1, _T1, _C1 > &)
 
template<typename _K1 , typename _T1 , typename _C1 >
bool operator< (const VectorMap< _K1, _T1, _C1 > &, const VectorMap< _K1, _T1, _C1 > &)
 

Detailed Description

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
class util::VectorMap< _Key, _Tp, _Compare >

Definition at line 104 of file VectorMap.h.

Member Typedef Documentation

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
typedef std::allocator< std::pair<_Key, _Tp> > util::VectorMap< _Key, _Tp, _Compare >::allocator_type

Definition at line 112 of file VectorMap.h.

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
typedef vector_type::const_iterator util::VectorMap< _Key, _Tp, _Compare >::const_iterator

Definition at line 121 of file VectorMap.h.

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
typedef vector_type::const_pointer util::VectorMap< _Key, _Tp, _Compare >::const_pointer

Definition at line 117 of file VectorMap.h.

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
typedef vector_type::const_reference util::VectorMap< _Key, _Tp, _Compare >::const_reference

Definition at line 119 of file VectorMap.h.

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
typedef std::reverse_iterator<const_iterator> util::VectorMap< _Key, _Tp, _Compare >::const_reverse_iterator

Definition at line 122 of file VectorMap.h.

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
typedef ptrdiff_t util::VectorMap< _Key, _Tp, _Compare >::difference_type

Definition at line 125 of file VectorMap.h.

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
typedef vector_type::iterator util::VectorMap< _Key, _Tp, _Compare >::iterator

Definition at line 120 of file VectorMap.h.

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
typedef _Compare util::VectorMap< _Key, _Tp, _Compare >::key_compare

Definition at line 111 of file VectorMap.h.

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
typedef _Key util::VectorMap< _Key, _Tp, _Compare >::key_type

Definition at line 108 of file VectorMap.h.

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
typedef _Tp util::VectorMap< _Key, _Tp, _Compare >::mapped_type

Definition at line 109 of file VectorMap.h.

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
typedef vector_type::pointer util::VectorMap< _Key, _Tp, _Compare >::pointer

Definition at line 116 of file VectorMap.h.

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
typedef vector_type::reference util::VectorMap< _Key, _Tp, _Compare >::reference

Definition at line 118 of file VectorMap.h.

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
typedef std::reverse_iterator<iterator> util::VectorMap< _Key, _Tp, _Compare >::reverse_iterator

Definition at line 123 of file VectorMap.h.

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
typedef size_t util::VectorMap< _Key, _Tp, _Compare >::size_type

Definition at line 124 of file VectorMap.h.

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
typedef std::pair<_Key, _Tp> util::VectorMap< _Key, _Tp, _Compare >::value_type

Definition at line 110 of file VectorMap.h.

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
typedef std::vector<value_type> util::VectorMap< _Key, _Tp, _Compare >::vector_type

Definition at line 114 of file VectorMap.h.

Member Function Documentation

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
mapped_type& util::VectorMap< _Key, _Tp, _Compare >::at ( const key_type &  __k)
inline

Definition at line 272 of file VectorMap.h.

273  {
274  iterator __i = lower_bound(__k);
275  if (__i == end() || key_comp()(__k, (*__i).first))
276  throw std::out_of_range("Utilities/VectorMap::at");
277  return (*__i).second;
278  }
util::VectorMap::end
iterator end()
Definition: VectorMap.h:198
util::VectorMap::lower_bound
iterator lower_bound(const key_type &__x)
Definition: VectorMap.h:408
util::VectorMap::key_comp
key_compare key_comp() const
Definition: VectorMap.h:371
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
const mapped_type& util::VectorMap< _Key, _Tp, _Compare >::at ( const key_type &  __k) const
inline

Definition at line 280 of file VectorMap.h.

281  {
282  const_iterator __i = lower_bound(__k);
283  if (__i == end() || key_comp()(__k, (*__i).first))
284  throw std::out_of_range("Utilities/VectorMap::at");
285  return (*__i).second;
286  }
util::VectorMap::end
iterator end()
Definition: VectorMap.h:198
util::VectorMap::lower_bound
iterator lower_bound(const key_type &__x)
Definition: VectorMap.h:408
util::VectorMap::key_comp
key_compare key_comp() const
Definition: VectorMap.h:371
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
iterator util::VectorMap< _Key, _Tp, _Compare >::begin ( )
inline

Definition at line 188 of file VectorMap.h.

189  {
190  return sortedVectorMap.begin();
191  }
util::VectorMap::sortedVectorMap
vector_type sortedVectorMap
Definition: VectorMap.h:172
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
const_iterator util::VectorMap< _Key, _Tp, _Compare >::begin ( ) const
inline

Definition at line 193 of file VectorMap.h.

194  {
195  return sortedVectorMap.begin();
196  }
util::VectorMap::sortedVectorMap
vector_type sortedVectorMap
Definition: VectorMap.h:172
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
size_type util::VectorMap< _Key, _Tp, _Compare >::capacity ( )
inline

Definition at line 469 of file VectorMap.h.

470  {
471  return sortedVectorMap.capacity();
472  }
util::VectorMap::sortedVectorMap
vector_type sortedVectorMap
Definition: VectorMap.h:172
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
void util::VectorMap< _Key, _Tp, _Compare >::clear ( )
inline

Definition at line 365 of file VectorMap.h.

366  {
367  sortedVectorMap.clear();
368  }
util::VectorMap::sortedVectorMap
vector_type sortedVectorMap
Definition: VectorMap.h:172
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
size_type util::VectorMap< _Key, _Tp, _Compare >::count ( const key_type &  __x) const
inline

Definition at line 403 of file VectorMap.h.

404  {
405  return find(__x) == end() ? 0 : 1;
406  }
util::VectorMap::end
iterator end()
Definition: VectorMap.h:198
util::VectorMap::find
iterator find(const key_type &key)
Definition: VectorMap.h:383
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
const mapped_type& util::VectorMap< _Key, _Tp, _Compare >::Data ( const size_type &  index) const
inline

Definition at line 453 of file VectorMap.h.

454  {
455  return sortedVectorMap[index].second;
456  }
util::VectorMap::sortedVectorMap
vector_type sortedVectorMap
Definition: VectorMap.h:172
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
bool util::VectorMap< _Key, _Tp, _Compare >::empty ( ) const
inline

Definition at line 228 of file VectorMap.h.

229  {
230  return sortedVectorMap.empty();
231  }
util::VectorMap::sortedVectorMap
vector_type sortedVectorMap
Definition: VectorMap.h:172
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
iterator util::VectorMap< _Key, _Tp, _Compare >::end ( )
inline

Definition at line 198 of file VectorMap.h.

199  {
200  return sortedVectorMap.end();
201  }
util::VectorMap::sortedVectorMap
vector_type sortedVectorMap
Definition: VectorMap.h:172
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
const_iterator util::VectorMap< _Key, _Tp, _Compare >::end ( ) const
inline

Definition at line 203 of file VectorMap.h.

204  {
205  return sortedVectorMap.end();
206  }
util::VectorMap::sortedVectorMap
vector_type sortedVectorMap
Definition: VectorMap.h:172
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
std::pair<iterator, iterator> util::VectorMap< _Key, _Tp, _Compare >::equal_range ( const key_type &  key)
inline

Definition at line 428 of file VectorMap.h.

429  {
430  return std::equal_range(begin(),end(),key,valueCompare);
431  }
util::VectorMap::end
iterator end()
Definition: VectorMap.h:198
util::VectorMap::valueCompare
value_compare valueCompare
Definition: VectorMap.h:175
util::VectorMap::begin
iterator begin()
Definition: VectorMap.h:188
wirecell.dfp.graph.key
def key(type, name=None)
Definition: graph.py:13
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
void util::VectorMap< _Key, _Tp, _Compare >::erase ( iterator  __position)
inline

Definition at line 332 of file VectorMap.h.

333  {
334  sortedVectorMap.erase(__position);
335  }
util::VectorMap::sortedVectorMap
vector_type sortedVectorMap
Definition: VectorMap.h:172
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
size_type util::VectorMap< _Key, _Tp, _Compare >::erase ( const key_type &  key)
inline

Definition at line 339 of file VectorMap.h.

340  {
341  iterator i = find(key);
342  if ( i == end() ) return 0;
343  erase(i);
344  return 1;
345  }
util::VectorMap::end
iterator end()
Definition: VectorMap.h:198
util::VectorMap::erase
void erase(iterator __position)
Definition: VectorMap.h:332
wirecell.dfp.graph.key
def key(type, name=None)
Definition: graph.py:13
util::VectorMap::find
iterator find(const key_type &key)
Definition: VectorMap.h:383
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
void util::VectorMap< _Key, _Tp, _Compare >::erase ( iterator  __first,
iterator  __last 
)
inline

Definition at line 348 of file VectorMap.h.

349  {
350  sortedVectorMap.erase(__first, __last);
351  }
util::VectorMap::sortedVectorMap
vector_type sortedVectorMap
Definition: VectorMap.h:172
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
iterator util::VectorMap< _Key, _Tp, _Compare >::find ( const key_type &  key)
inline

Definition at line 383 of file VectorMap.h.

384  {
385  iterator i = lower_bound(key);
386  if (i == end() || key_comp()(key, (*i).first))
387  return end();
388 
389  return i;
390  }
util::VectorMap::end
iterator end()
Definition: VectorMap.h:198
wirecell.dfp.graph.key
def key(type, name=None)
Definition: graph.py:13
util::VectorMap::lower_bound
iterator lower_bound(const key_type &__x)
Definition: VectorMap.h:408
util::VectorMap::key_comp
key_compare key_comp() const
Definition: VectorMap.h:371
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
const_iterator util::VectorMap< _Key, _Tp, _Compare >::find ( const key_type &  key) const
inline

Definition at line 392 of file VectorMap.h.

393  {
394  const_iterator i = lower_bound(key);
395  if (i == end() || key_comp()(key, (*i).first))
396  return end();
397 
398  return i;
399  }
util::VectorMap::end
iterator end()
Definition: VectorMap.h:198
wirecell.dfp.graph.key
def key(type, name=None)
Definition: graph.py:13
util::VectorMap::lower_bound
iterator lower_bound(const key_type &__x)
Definition: VectorMap.h:408
util::VectorMap::key_comp
key_compare key_comp() const
Definition: VectorMap.h:371
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
allocator_type util::VectorMap< _Key, _Tp, _Compare >::get_allocator ( ) const
inline

Don't write this to the ROOT file.

Definition at line 183 of file VectorMap.h.

184  {
185  return sortedVectorMap.get_allocator();
186  }
util::VectorMap::sortedVectorMap
vector_type sortedVectorMap
Definition: VectorMap.h:172
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
std::pair<iterator,bool> util::VectorMap< _Key, _Tp, _Compare >::insert ( const value_type &  entry)
inline

Definition at line 297 of file VectorMap.h.

298  {
299  const key_type& key = entry.first;
300  iterator i = lower_bound(key);
301  if (i == end() || key_comp()(key, (*i).first))
302  {
303  // The entry was not found. In that case, lower_bound has
304  // already found the correct point at which we want to insert
305  // the entry to maintain the sort.
306  i = sortedVectorMap.insert(i, entry);
307  return std::make_pair( i, true);
308  }
309 
310  // If we get here, the entry was found. Return failure.
311  return std::make_pair( i, false );
312  }
util::VectorMap::end
iterator end()
Definition: VectorMap.h:198
entry
QList< Entry > entry
Definition: tclscanner.cpp:1150
QGList::first
QCollection::Item first()
Definition: qglist.cpp:807
util::VectorMap::sortedVectorMap
vector_type sortedVectorMap
Definition: VectorMap.h:172
wirecell.dfp.graph.key
def key(type, name=None)
Definition: graph.py:13
util::VectorMap::lower_bound
iterator lower_bound(const key_type &__x)
Definition: VectorMap.h:408
util::VectorMap::key_comp
key_compare key_comp() const
Definition: VectorMap.h:371
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
iterator util::VectorMap< _Key, _Tp, _Compare >::insert ( iterator  ,
const value_type &  entry 
)
inline

Definition at line 318 of file VectorMap.h.

319  {
320  std::pair<iterator,bool> result = insert(entry);
321  return result.first;
322  }
entry
QList< Entry > entry
Definition: tclscanner.cpp:1150
result
static QCString result
Definition: fortranscanner.cpp:56614
util::VectorMap::insert
std::pair< iterator, bool > insert(const value_type &entry)
Definition: VectorMap.h:297
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
template<typename _InputIterator >
void util::VectorMap< _Key, _Tp, _Compare >::insert ( _InputIterator  __first,
_InputIterator  __last 
)
inline

Definition at line 326 of file VectorMap.h.

327  {
328  for ( ; __first != __last; ++__first)
329  insert(*__first);
330  }
util::VectorMap::insert
std::pair< iterator, bool > insert(const value_type &entry)
Definition: VectorMap.h:297
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
const key_type& util::VectorMap< _Key, _Tp, _Compare >::Key ( const size_type &  index) const
inline

Definition at line 458 of file VectorMap.h.

459  {
460  return sortedVectorMap[index].first;
461  }
util::VectorMap::sortedVectorMap
vector_type sortedVectorMap
Definition: VectorMap.h:172
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
key_compare util::VectorMap< _Key, _Tp, _Compare >::key_comp ( ) const
inline

Definition at line 371 of file VectorMap.h.

372  {
373  return valueCompare.GetCompare();
374  }
util::VectorMap::value_compare::GetCompare
_Compare GetCompare() const
Definition: VectorMap.h:148
util::VectorMap::valueCompare
value_compare valueCompare
Definition: VectorMap.h:175
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
iterator util::VectorMap< _Key, _Tp, _Compare >::lower_bound ( const key_type &  __x)
inline

Definition at line 408 of file VectorMap.h.

409  {
410  return std::lower_bound(begin(),end(),__x,valueCompare);
411  }
util::VectorMap::end
iterator end()
Definition: VectorMap.h:198
util::VectorMap::valueCompare
value_compare valueCompare
Definition: VectorMap.h:175
util::VectorMap::begin
iterator begin()
Definition: VectorMap.h:188
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
const_iterator util::VectorMap< _Key, _Tp, _Compare >::lower_bound ( const key_type &  __x) const
inline

Definition at line 413 of file VectorMap.h.

414  {
415  return std::lower_bound(begin(),end(),__x,valueCompare);
416  }
util::VectorMap::end
iterator end()
Definition: VectorMap.h:198
util::VectorMap::valueCompare
value_compare valueCompare
Definition: VectorMap.h:175
util::VectorMap::begin
iterator begin()
Definition: VectorMap.h:188
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
size_t util::VectorMap< _Key, _Tp, _Compare >::max_size ( ) const
inline

Definition at line 238 of file VectorMap.h.

239  {
240  return sortedVectorMap.max_size();
241  }
util::VectorMap::sortedVectorMap
vector_type sortedVectorMap
Definition: VectorMap.h:172
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
const mapped_type& util::VectorMap< _Key, _Tp, _Compare >::operator() ( const size_type &  index) const
inline

Definition at line 448 of file VectorMap.h.

449  {
450  return sortedVectorMap[index].second;
451  }
util::VectorMap::sortedVectorMap
vector_type sortedVectorMap
Definition: VectorMap.h:172
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
mapped_type& util::VectorMap< _Key, _Tp, _Compare >::operator[] ( const key_type &  key)
inline

Definition at line 243 of file VectorMap.h.

244  {
245  // Do a binary search for the key.
246  iterator i = lower_bound(key);
247 
248  // If the key is not found, or i->first is less than key, then
249  // the key is not found.
250  if (i == end() || key_comp()(key, (*i).first))
251  // Insert this key into the map, with a default value. Thanks
252  // to the lower_bound call above, i already points to correct
253  // place to insert the value in the sorted vector.
254  i = sortedVectorMap.insert(i, value_type(key, mapped_type() ));
255 
256  return (*i).second;
257  }
util::VectorMap::end
iterator end()
Definition: VectorMap.h:198
util::VectorMap::sortedVectorMap
vector_type sortedVectorMap
Definition: VectorMap.h:172
wirecell.dfp.graph.key
def key(type, name=None)
Definition: graph.py:13
util::VectorMap::lower_bound
iterator lower_bound(const key_type &__x)
Definition: VectorMap.h:408
util::VectorMap::key_comp
key_compare key_comp() const
Definition: VectorMap.h:371
util::VectorMap::value_type
std::pair< _Key, _Tp > value_type
Definition: VectorMap.h:110
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
const mapped_type& util::VectorMap< _Key, _Tp, _Compare >::operator[] ( const key_type &  __k) const
inline

Definition at line 262 of file VectorMap.h.

263  {
264  const_iterator __i = lower_bound(__k);
265  if (__i == end() || key_comp()(__k, (*__i).first))
266  throw std::out_of_range("Utilities/VectorMap::operator[]");
267  return (*__i).second;
268  }
util::VectorMap::end
iterator end()
Definition: VectorMap.h:198
util::VectorMap::lower_bound
iterator lower_bound(const key_type &__x)
Definition: VectorMap.h:408
util::VectorMap::key_comp
key_compare key_comp() const
Definition: VectorMap.h:371
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
reverse_iterator util::VectorMap< _Key, _Tp, _Compare >::rbegin ( )
inline

Definition at line 208 of file VectorMap.h.

209  {
210  return sortedVectorMap.rbegin();
211  }
util::VectorMap::sortedVectorMap
vector_type sortedVectorMap
Definition: VectorMap.h:172
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
const_reverse_iterator util::VectorMap< _Key, _Tp, _Compare >::rbegin ( ) const
inline

Definition at line 213 of file VectorMap.h.

214  {
215  return sortedVectorMap.rbegin();
216  }
util::VectorMap::sortedVectorMap
vector_type sortedVectorMap
Definition: VectorMap.h:172
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
reverse_iterator util::VectorMap< _Key, _Tp, _Compare >::rend ( )
inline

Definition at line 218 of file VectorMap.h.

219  {
220  return sortedVectorMap.rend();
221  }
util::VectorMap::sortedVectorMap
vector_type sortedVectorMap
Definition: VectorMap.h:172
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
const_reverse_iterator util::VectorMap< _Key, _Tp, _Compare >::rend ( ) const
inline

Definition at line 223 of file VectorMap.h.

224  {
225  return sortedVectorMap.rend();
226  }
util::VectorMap::sortedVectorMap
vector_type sortedVectorMap
Definition: VectorMap.h:172
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
void util::VectorMap< _Key, _Tp, _Compare >::reserve ( size_type  i)
inline

Definition at line 465 of file VectorMap.h.

466  {
467  sortedVectorMap.reserve(i);
468  }
util::VectorMap::sortedVectorMap
vector_type sortedVectorMap
Definition: VectorMap.h:172
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
size_t util::VectorMap< _Key, _Tp, _Compare >::size ( void  ) const
inline

Definition at line 233 of file VectorMap.h.

234  {
235  return sortedVectorMap.size();
236  }
util::VectorMap::sortedVectorMap
vector_type sortedVectorMap
Definition: VectorMap.h:172
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
void util::VectorMap< _Key, _Tp, _Compare >::swap ( VectorMap< _Key, _Tp, _Compare > &  other)
inline

Definition at line 357 of file VectorMap.h.

358  {
359  sortedVectorMap.swap(other.sortedVectorMap);
360  value_compare temp(valueCompare);
361  valueCompare = other.valueCompare;
362  other.valueCompare = temp;
363  }
util::VectorMap::valueCompare
value_compare valueCompare
Definition: VectorMap.h:175
util::VectorMap::sortedVectorMap
vector_type sortedVectorMap
Definition: VectorMap.h:172
submit_ppfxjobs.temp
temp
Definition: submit_ppfxjobs.py:110
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
iterator util::VectorMap< _Key, _Tp, _Compare >::upper_bound ( const key_type &  __x)
inline

Definition at line 418 of file VectorMap.h.

419  {
420  return std::upper_bound(begin(),end(),__x,valueCompare);
421  }
util::VectorMap::end
iterator end()
Definition: VectorMap.h:198
util::VectorMap::valueCompare
value_compare valueCompare
Definition: VectorMap.h:175
util::VectorMap::begin
iterator begin()
Definition: VectorMap.h:188
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
const_iterator util::VectorMap< _Key, _Tp, _Compare >::upper_bound ( const key_type &  __x) const
inline

Definition at line 423 of file VectorMap.h.

424  {
425  return std::upper_bound(begin(),end(),__x,valueCompare);
426  }
util::VectorMap::end
iterator end()
Definition: VectorMap.h:198
util::VectorMap::valueCompare
value_compare valueCompare
Definition: VectorMap.h:175
util::VectorMap::begin
iterator begin()
Definition: VectorMap.h:188
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
value_compare util::VectorMap< _Key, _Tp, _Compare >::value_comp ( ) const
inline

Definition at line 378 of file VectorMap.h.

379  {
380  return valueCompare;
381  }
util::VectorMap::valueCompare
value_compare valueCompare
Definition: VectorMap.h:175

Friends And Related Function Documentation

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
template<typename _K1 , typename _T1 , typename _C1 >
bool operator< ( const VectorMap< _K1, _T1, _C1 > &  ,
const VectorMap< _K1, _T1, _C1 > &   
)
friend
template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
template<typename _K1 , typename _T1 , typename _C1 >
bool operator== ( const VectorMap< _K1, _T1, _C1 > &  ,
const VectorMap< _K1, _T1, _C1 > &   
)
friend

Member Data Documentation

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
vector_type util::VectorMap< _Key, _Tp, _Compare >::sortedVectorMap
private

Definition at line 172 of file VectorMap.h.

template<typename _Key, typename _Tp, typename _Compare = std::less<_Key>>
value_compare util::VectorMap< _Key, _Tp, _Compare >::valueCompare
private

Definition at line 175 of file VectorMap.h.

The documentation for this class was generated from the following file:
Generated by   doxygen 1.8.11