vmap< Key, T, Compare > Class Template Reference

#include <vmap.h>

Inheritance diagram for vmap< Key, T, Compare >:


Public Types
typedef Key	key_type
typedef pair< Key, T >	value_type
typedef Compare	key_compare
typedef rep_type::reference	reference
typedef rep_type::const_reference	const_reference
typedef rep_type::iterator	iterator
typedef rep_type::const_iterator	const_iterator
typedef rep_type::reverse_iterator	reverse_iterator
typedef rep_type::const_reverse_iterator	const_reverse_iterator
typedef rep_type::size_type	size_type
typedef rep_type::difference_type	difference_type
Public Member Functions
iterator	begin ()
iterator	end ()
reverse_iterator	rbegin ()
reverse_iterator	rend ()
const_iterator	begin () const
const_iterator	end () const
const_reverse_iterator	rbegin () const
const_reverse_iterator	rend () const
key_compare	key_comp () const
value_compare	value_comp () const
bool	empty () const
size_type	size () const
size_type	max_size () const
size_type	capacity () const
void	swap (vmap< Key, T, Compare > &x)
void	reserve (size_type n)
	vmap (const Compare &comp=Compare())
	vmap (const vmap< Key, T, Compare > &x)
vmap< Key, T, Compare > &	operator= (const vmap< Key, T, Compare > &x)
pair< iterator, bool >	insert (const value_type &x)
iterator	insert (iterator hint_i, const value_type &x)
void	insert (const value_type first, const value_type last)
void	erase (iterator position_i)
void	erase (iterator first_i, iterator last_i)
size_type	erase (const key_type &x)
T &	operator[] (const key_type &k)
iterator	find (const key_type &x)
iterator	lower_bound (const key_type &x)
iterator	upper_bound (const key_type &x)
pair< iterator, iterator >	equal_range (const key_type &x)
size_type	count (const key_type &x) const
const T &	operator[] (const key_type &k) const
const_iterator	find (const key_type &x) const
const_iterator	lower_bound (const key_type &x) const
const_iterator	upper_bound (const key_type &x) const
pair< const_iterator, const_iterator >	equal_range (const key_type &x) const
Classes
class	value_compare

Detailed Description

template<class Key, class T, class Compare = dummy_less<Key>>
class vmap< Key, T, Compare >

Definition at line 76 of file vmap.h.

Member Typedef Documentation

template<class Key, class T, class Compare = dummy_less<Key>>

typedef rep_type::const_iterator vmap< Key, T, Compare >::const_iterator

Reimplemented in BConds< T, D, M, C >, and BConds< T, Dim, M, C >.
Definition at line 130 of file vmap.h.

template<class Key, class T, class Compare = dummy_less<Key>>

typedef rep_type::const_reference vmap< Key, T, Compare >::const_reference

Definition at line 128 of file vmap.h.

template<class Key, class T, class Compare = dummy_less<Key>>

typedef rep_type::const_reverse_iterator vmap< Key, T, Compare >::const_reverse_iterator

Definition at line 132 of file vmap.h.

template<class Key, class T, class Compare = dummy_less<Key>>

typedef rep_type::difference_type vmap< Key, T, Compare >::difference_type

Definition at line 134 of file vmap.h.

template<class Key, class T, class Compare = dummy_less<Key>>

typedef rep_type::iterator vmap< Key, T, Compare >::iterator

Reimplemented in BConds< T, D, M, C >, and BConds< T, Dim, M, C >.
Definition at line 129 of file vmap.h.

template<class Key, class T, class Compare = dummy_less<Key>>

typedef Compare vmap< Key, T, Compare >::key_compare

Definition at line 83 of file vmap.h.

template<class Key, class T, class Compare = dummy_less<Key>>

typedef Key vmap< Key, T, Compare >::key_type

Definition at line 81 of file vmap.h.

template<class Key, class T, class Compare = dummy_less<Key>>

typedef rep_type::reference vmap< Key, T, Compare >::reference

Definition at line 127 of file vmap.h.

template<class Key, class T, class Compare = dummy_less<Key>>

typedef rep_type::reverse_iterator vmap< Key, T, Compare >::reverse_iterator

Definition at line 131 of file vmap.h.

template<class Key, class T, class Compare = dummy_less<Key>>

typedef rep_type::size_type vmap< Key, T, Compare >::size_type

Definition at line 133 of file vmap.h.

template<class Key, class T, class Compare = dummy_less<Key>>

typedef pair<Key, T> vmap< Key, T, Compare >::value_type

Definition at line 82 of file vmap.h.

Constructor & Destructor Documentation

template<class Key, class T, class Compare = dummy_less<Key>>

vmap< Key, T, Compare >::vmap ( const Compare & comp = Compare() ) [inline]

Definition at line 160 of file vmap.h.

template<class Key, class T, class Compare>

vmap< Key, T, Compare >::vmap ( const vmap< Key, T, Compare > & x )

Definition at line 45 of file vmap.cpp.
References CT, TAU_PROFILE, TAU_TYPE_STRING, TAU_UTILITY, and vmap< Key, T, Compare >::V_c.

Member Function Documentation

template<class Key, class T, class Compare = dummy_less<Key>>

const_iterator vmap< Key, T, Compare >::begin ( ) const [inline]

Definition at line 143 of file vmap.h.

template<class Key, class T, class Compare = dummy_less<Key>>

iterator vmap< Key, T, Compare >::begin ( ) [inline]

Definition at line 138 of file vmap.h.
Referenced by BConds< T, D, M, C >::apply(), DiscMeta::begin(), Field< T, Dim, Mesh, Centering >::begin_BConds(), BareField< T, Dim >::begin_if(), RegionLayout< T, Dim, Mesh >::begin_iv(), FieldLayout< Dim >::begin_iv(), FieldLayout< Dim >::begin_rdv(), FieldLayout< Dim >::begin_rgdv(), UserList::begin_user(), BConds< T, D, M, C >::changesPhysicalCells(), vmap< Key, T, Compare >::equal_range(), vmap< Key, T, Compare >::insert(), vmap< Key, T, Compare >::lower_bound(), vmap< Key, T, Compare >::operator[](), ACLVISParticleBaseDataSource< PLayout >::update(), and vmap< Key, T, Compare >::upper_bound().

template<class Key, class T, class Compare = dummy_less<Key>>

size_type vmap< Key, T, Compare >::capacity ( ) const [inline]

Definition at line 153 of file vmap.h.

template<class Key, class T, class Compare>

vmap< Key, T, Compare >::size_type vmap< Key, T, Compare >::count ( const key_type & x ) const

Definition at line 324 of file vmap.cpp.
References CT, vmap< Key, T, Compare >::equal_range(), TAU_PROFILE, TAU_TYPE_STRING, and TAU_UTILITY.
Referenced by UserList::haveUser().
Here is the call graph for this function:

template<class Key, class T, class Compare = dummy_less<Key>>

bool vmap< Key, T, Compare >::empty ( ) const [inline]

Definition at line 150 of file vmap.h.
Referenced by vmap< Key, T, Compare >::insert().

template<class Key, class T, class Compare = dummy_less<Key>>

const_iterator vmap< Key, T, Compare >::end ( ) const [inline]

Definition at line 144 of file vmap.h.

template<class Key, class T, class Compare = dummy_less<Key>>

iterator vmap< Key, T, Compare >::end ( ) [inline]

Definition at line 139 of file vmap.h.
Referenced by BareField< T, Dim >::BareField(), FieldLayout< Dim >::checkin(), DiscMeta::end(), Field< T, Dim, Mesh, Centering >::end_BConds(), BareField< T, Dim >::end_if(), RegionLayout< T, Dim, Mesh >::end_iv(), FieldLayout< Dim >::end_iv(), FieldLayout< Dim >::end_rdv(), FieldLayout< Dim >::end_rgdv(), UserList::end_user(), vmap< Key, T, Compare >::equal_range(), vmap< Key, T, Compare >::find(), vmap< Key, T, Compare >::insert(), vmap< Key, T, Compare >::lower_bound(), ACLVISParticleBaseDataSource< PLayout >::update(), and vmap< Key, T, Compare >::upper_bound().

template<class Key, class T, class Compare>

pair< typename vmap< Key, T, Compare >::const_iterator, typename vmap< Key, T, Compare >::const_iterator > vmap< Key, T, Compare >::equal_range ( const key_type & x ) const

Definition at line 389 of file vmap.cpp.
References vmap< Key, T, Compare >::begin(), CT, vmap< Key, T, Compare >::end(), TAU_PROFILE, TAU_TYPE_STRING, and TAU_UTILITY.
Here is the call graph for this function:

template<class Key, class T, class Compare>

pair< typename vmap< Key, T, Compare >::iterator, typename vmap< Key, T, Compare >::iterator > vmap< Key, T, Compare >::equal_range ( const key_type & x )

Definition at line 274 of file vmap.cpp.
References vmap< Key, T, Compare >::begin(), CT, vmap< Key, T, Compare >::end(), TAU_PROFILE, TAU_TYPE_STRING, and TAU_UTILITY.
Referenced by vmap< Key, T, Compare >::count(), and vmap< Key, T, Compare >::erase().
Here is the call graph for this function:

template<class Key, class T, class Compare>

vmap< Key, T, Compare >::size_type vmap< Key, T, Compare >::erase ( const key_type & x )

Definition at line 201 of file vmap.cpp.
References CT, vmap< Key, T, Compare >::equal_range(), vmap< Key, T, Compare >::erase(), TAU_PROFILE, TAU_TYPE_STRING, and TAU_UTILITY.
Here is the call graph for this function:

template<class Key, class T, class Compare>

void vmap< Key, T, Compare >::erase ( iterator first_i,

iterator last_i

)

Definition at line 187 of file vmap.cpp.
References CT, TAU_PROFILE, TAU_TYPE_STRING, and TAU_UTILITY.

template<class Key, class T, class Compare>

void vmap< Key, T, Compare >::erase ( iterator position_i )

Definition at line 174 of file vmap.cpp.
References CT, TAU_PROFILE, TAU_TYPE_STRING, and TAU_UTILITY.
Referenced by UserList::checkoutUser(), vmap< Key, T, Compare >::erase(), and ACLVISParticleBaseDataSource< PLayout >::update().

template<class Key, class T, class Compare>

vmap< Key, T, Compare >::const_iterator vmap< Key, T, Compare >::find ( const key_type & x ) const

Definition at line 340 of file vmap.cpp.
References CT, vmap< Key, T, Compare >::end(), vmap< Key, T, Compare >::lower_bound(), TAU_PROFILE, TAU_TYPE_STRING, and TAU_UTILITY.
Here is the call graph for this function:

template<class Key, class T, class Compare>

vmap< Key, T, Compare >::iterator vmap< Key, T, Compare >::find ( const key_type & x )

Definition at line 223 of file vmap.cpp.
References CT, vmap< Key, T, Compare >::end(), vmap< Key, T, Compare >::lower_bound(), TAU_PROFILE, TAU_TYPE_STRING, and TAU_UTILITY.
Referenced by FieldLayout< Dim >::checkin(), UserList::checkoutUser(), and UserList::getUser().
Here is the call graph for this function:

template<class Key, class T, class Compare>

void vmap< Key, T, Compare >::insert ( const value_type * first,

const value_type * last

)

Definition at line 154 of file vmap.cpp.
References CT, vmap< Key, T, Compare >::end(), vmap< Key, T, Compare >::insert(), TAU_PROFILE, TAU_TYPE_STRING, and TAU_UTILITY.
Here is the call graph for this function:

template<class Key, class T, class Compare>

vmap< Key, T, Compare >::iterator vmap< Key, T, Compare >::insert ( iterator hint_i,

const value_type & x

)

Definition at line 121 of file vmap.cpp.
References vmap< Key, T, Compare >::begin(), CT, vmap< Key, T, Compare >::empty(), vmap< Key, T, Compare >::end(), TAU_PROFILE, TAU_TYPE_STRING, TAU_UTILITY, and vmap< Key, T, Compare >::upper_bound().
Here is the call graph for this function:

template<class Key, class T, class Compare>

pair< typename vmap< Key, T, Compare >::iterator, bool > vmap< Key, T, Compare >::insert ( const value_type & x )

Definition at line 82 of file vmap.cpp.
References vmap< Key, T, Compare >::begin(), CT, vmap< Key, T, Compare >::end(), vmap< Key, T, Compare >::lower_bound(), vmap< Key, T, Compare >::size(), TAU_PROFILE, TAU_TYPE_STRING, and TAU_UTILITY.
Referenced by BareField< T, Dim >::BareField(), DiscMeta::DiscMeta(), FieldLayout< Dim >::FieldLayout(), FieldLayout< Dim >::initialize(), and vmap< Key, T, Compare >::insert().
Here is the call graph for this function:

template<class Key, class T, class Compare = dummy_less<Key>>

key_compare vmap< Key, T, Compare >::key_comp ( ) const [inline]

Definition at line 148 of file vmap.h.

template<class Key, class T, class Compare>

vmap< Key, T, Compare >::const_iterator vmap< Key, T, Compare >::lower_bound ( const key_type & x ) const

Definition at line 360 of file vmap.cpp.
References vmap< Key, T, Compare >::begin(), CT, vmap< Key, T, Compare >::end(), TAU_PROFILE, TAU_TYPE_STRING, and TAU_UTILITY.
Here is the call graph for this function:

template<class Key, class T, class Compare>

vmap< Key, T, Compare >::iterator vmap< Key, T, Compare >::lower_bound ( const key_type & x )

Definition at line 245 of file vmap.cpp.
References vmap< Key, T, Compare >::begin(), CT, vmap< Key, T, Compare >::end(), TAU_PROFILE, TAU_TYPE_STRING, and TAU_UTILITY.
Referenced by vmap< Key, T, Compare >::find(), vmap< Key, T, Compare >::insert(), and vmap< Key, T, Compare >::operator[]().
Here is the call graph for this function:

template<class Key, class T, class Compare = dummy_less<Key>>

size_type vmap< Key, T, Compare >::max_size ( ) const [inline]

Definition at line 152 of file vmap.h.

template<class Key, class T, class Compare>

vmap< Key, T, Compare > & vmap< Key, T, Compare >::operator= ( const vmap< Key, T, Compare > & x )

Definition at line 60 of file vmap.cpp.
References CT, vmap< Key, T, Compare >::Lt, TAU_PROFILE, TAU_TYPE_STRING, TAU_UTILITY, and vmap< Key, T, Compare >::V_c.

template<class Key, class T, class Compare>

const T & vmap< Key, T, Compare >::operator[] ( const key_type & k ) const

Definition at line 405 of file vmap.cpp.
References CT, vmap< Key, T, Compare >::lower_bound(), TAU_PROFILE, TAU_TYPE_STRING, and TAU_UTILITY.
Here is the call graph for this function:

template<class Key, class T, class Compare>

T & vmap< Key, T, Compare >::operator[] ( const key_type & k )

Definition at line 289 of file vmap.cpp.
References vmap< Key, T, Compare >::begin(), CT, TAU_PROFILE, TAU_TYPE_STRING, and TAU_UTILITY.
Here is the call graph for this function:

template<class Key, class T, class Compare = dummy_less<Key>>

const_reverse_iterator vmap< Key, T, Compare >::rbegin ( ) const [inline]

Definition at line 145 of file vmap.h.

template<class Key, class T, class Compare = dummy_less<Key>>

reverse_iterator vmap< Key, T, Compare >::rbegin ( ) [inline]

Definition at line 140 of file vmap.h.

template<class Key, class T, class Compare = dummy_less<Key>>

const_reverse_iterator vmap< Key, T, Compare >::rend ( ) const [inline]

Definition at line 146 of file vmap.h.

template<class Key, class T, class Compare = dummy_less<Key>>

reverse_iterator vmap< Key, T, Compare >::rend ( ) [inline]

Definition at line 141 of file vmap.h.

template<class Key, class T, class Compare = dummy_less<Key>>

void vmap< Key, T, Compare >::reserve ( size_type n ) [inline]

Definition at line 156 of file vmap.h.
Referenced by BareField< T, Dim >::BareField().

template<class Key, class T, class Compare = dummy_less<Key>>

size_type vmap< Key, T, Compare >::size ( void ) const [inline]

Definition at line 151 of file vmap.h.
Referenced by UserList::getNumUsers(), vmap< Key, T, Compare >::insert(), DiscMeta::size(), BareField< T, Dim >::size_if(), RegionLayout< T, Dim, Mesh >::size_iv(), FieldLayout< Dim >::size_iv(), FieldLayout< Dim >::size_rdv(), FieldLayout< Dim >::size_rgdv(), and FieldLayout< Dim >::write().

template<class Key, class T, class Compare = dummy_less<Key>>

void vmap< Key, T, Compare >::swap ( vmap< Key, T, Compare > & x ) [inline]

Definition at line 155 of file vmap.h.

template<class Key, class T, class Compare>

vmap< Key, T, Compare >::const_iterator vmap< Key, T, Compare >::upper_bound ( const key_type & x ) const

Definition at line 375 of file vmap.cpp.
References vmap< Key, T, Compare >::begin(), CT, vmap< Key, T, Compare >::end(), TAU_PROFILE, TAU_TYPE_STRING, and TAU_UTILITY.
Here is the call graph for this function:

template<class Key, class T, class Compare>

vmap< Key, T, Compare >::iterator vmap< Key, T, Compare >::upper_bound ( const key_type & x )

Definition at line 260 of file vmap.cpp.
References vmap< Key, T, Compare >::begin(), CT, vmap< Key, T, Compare >::end(), TAU_PROFILE, TAU_TYPE_STRING, and TAU_UTILITY.
Referenced by vmap< Key, T, Compare >::insert().
Here is the call graph for this function:

template<class Key, class T, class Compare = dummy_less<Key>>

value_compare vmap< Key, T, Compare >::value_comp ( ) const [inline]

Definition at line 149 of file vmap.h.

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

src/Utility/vmap.h
src/Utility/vmap.cpp

Generated on Mon Jan 16 14:48:19 2006 for IPPL by

1.4.6

vmap< Key, T, Compare > Class Template Reference

Public Types

Public Member Functions

Classes

Detailed Description

template<class Key, class T, class Compare = dummy_less<Key>> class vmap< Key, T, Compare >

Member Typedef Documentation

Constructor & Destructor Documentation

Member Function Documentation

template<class Key, class T, class Compare = dummy_less<Key>>
class vmap< Key, T, Compare >