#include <BCond.h>

Inheritance diagram for BConds< T, D, M, C >:

Collaboration diagram for BConds< T, D, M, C >:

Public Types
typedef vmap< int, RefCountedP< BCondBase< T, D, M, C > > >::iterator	iterator
typedef vmap< int, RefCountedP< BCondBase< T, D, M, C > > >::const_iterator	const_iterator
typedef Key	key_type
typedef std::pair< Key, T >	value_type
typedef Compare	key_compare
typedef rep_type::reference	reference
typedef rep_type::const_reference	const_reference
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
void	apply (Field< T, D, M, C > &a)
bool	changesPhysicalCells () const
virtual void	write (std::ostream &) const
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
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)
std::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)
const T &	operator[] (const key_type &k) const
iterator	find (const key_type &x)
const_iterator	find (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 &x)
std::pair< const_iterator, const_iterator >	equal_range (const key_type &x) const
size_type	count (const key_type &x) const

Private Types
typedef std::vector< value_type >	rep_type

Private Member Functions
bool	Gt (const key_type &a, const key_type &b) const
bool	Ge (const key_type &a, const key_type &b) const
bool	Le (const key_type &a, const key_type &b) const

Private Attributes
rep_type	V_c
Compare	Lt

Detailed Description

template<class T, unsigned D, class M = UniformCartesian<D,double>, class C = typename M::DefaultCentering>
class BConds< T, D, M, C >

Definition at line 197 of file BCond.h.

Member Typedef Documentation

◆ const_iterator

template<class T, unsigned D, class M = UniformCartesian<D,double>, class C = typename M::DefaultCentering>

typedef vmap<int,RefCountedP<BCondBase<T,D,M,C>>>::const_iterator BConds< T, D, M, C >::const_iterator

Definition at line 204 of file BCond.h.

◆ const_reference

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

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

inherited

Definition at line 97 of file vmap.h.

◆ const_reverse_iterator

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

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

inherited

Definition at line 101 of file vmap.h.

◆ difference_type

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

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

inherited

Definition at line 103 of file vmap.h.

◆ iterator

template<class T, unsigned D, class M = UniformCartesian<D,double>, class C = typename M::DefaultCentering>

typedef vmap<int,RefCountedP<BCondBase<T,D,M,C>>>::iterator BConds< T, D, M, C >::iterator

Definition at line 202 of file BCond.h.

◆ key_compare

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

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

inherited

Definition at line 65 of file vmap.h.

◆ key_type

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

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

inherited

Definition at line 63 of file vmap.h.

◆ reference

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

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

inherited

Definition at line 96 of file vmap.h.

◆ rep_type

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

typedef std::vector< value_type > vmap< Key, T, Compare >::rep_type

privateinherited

Definition at line 80 of file vmap.h.

◆ reverse_iterator

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

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

inherited

Definition at line 100 of file vmap.h.

◆ size_type

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

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

inherited

Definition at line 102 of file vmap.h.

◆ value_type

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

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

inherited

Definition at line 64 of file vmap.h.

Member Function Documentation

◆ apply()

template<class T, unsigned D, class M, class C>

void BConds< T, D, M, C >::apply ( Field< T, D, M, C > & a )

Definition at line 258 of file BCond.hpp.

References a.

Referenced by Field< T, Dim, M, C >::fillGuardCells().

◆ begin() [1/2]

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

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

inlineinherited

Definition at line 107 of file vmap.h.

Referenced by operator<(), and operator==().

◆ begin() [2/2]

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

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

inlineinherited

Definition at line 112 of file vmap.h.

◆ capacity()

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

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

inlineinherited

Definition at line 122 of file vmap.h.

◆ changesPhysicalCells()

template<class T, unsigned D, class M, class C>

bool BConds< T, D, M, C >::changesPhysicalCells ( ) const

Definition at line 268 of file BCond.hpp.

References begin(), and end().

Here is the call graph for this function:

◆ count()

template<class Key, class T, class Compare>

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

inherited

Definition at line 313 of file vmap.hpp.

References equal_range().

Here is the call graph for this function:

◆ empty()

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

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

inlineinherited

Definition at line 119 of file vmap.h.

Referenced by insert().

◆ end() [1/2]

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

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

inlineinherited

Definition at line 108 of file vmap.h.

Referenced by IpplInfo::find_smp_nodes(), operator<(), and operator==().

◆ end() [2/2]

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

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

inlineinherited

Definition at line 113 of file vmap.h.

◆ equal_range() [1/2]

template<class Key, class T, class Compare>

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

inherited

Definition at line 265 of file vmap.hpp.

References begin(), end(), Lt, and value_type().

Referenced by count(), and erase().

Here is the call graph for this function:

◆ equal_range() [2/2]

template<class Key, class T, class Compare>

std::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

inherited

Definition at line 378 of file vmap.hpp.

References begin(), end(), Lt, and value_type().

Here is the call graph for this function:

◆ erase() [1/3]

template<class Key, class T, class Compare>

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

inherited

Definition at line 192 of file vmap.hpp.

References equal_range(), and erase().

Here is the call graph for this function:

◆ erase() [2/3]

template<class Key, class T, class Compare>

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

inherited

Definition at line 178 of file vmap.hpp.

References V_c.

◆ erase() [3/3]

template<class Key, class T, class Compare>

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

inherited

Definition at line 165 of file vmap.hpp.

References V_c.

Referenced by erase().

◆ find() [1/2]

template<class Key, class T, class Compare>

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

inherited

Definition at line 214 of file vmap.hpp.

References end(), Le(), and lower_bound().

Referenced by IpplInfo::find_smp_nodes().

Here is the call graph for this function:

◆ find() [2/2]

template<class Key, class T, class Compare>

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

inherited

Definition at line 329 of file vmap.hpp.

References end(), Le(), and lower_bound().

Here is the call graph for this function:

◆ Ge()

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

bool vmap< Key, T, Compare >::Ge	(	const key_type &	a,
		const key_type &	b ) const

inlineprivateinherited

Definition at line 88 of file vmap.h.

Referenced by insert().

◆ Gt()

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

bool vmap< Key, T, Compare >::Gt	(	const key_type &	a,
		const key_type &	b ) const

inlineprivateinherited

Definition at line 87 of file vmap.h.

◆ insert() [1/3]

template<class Key, class T, class Compare>

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

inherited

Definition at line 73 of file vmap.hpp.

References begin(), end(), Le(), lower_bound(), size(), and V_c.

Referenced by IpplInfo::find_smp_nodes().

Here is the call graph for this function:

◆ insert() [2/3]

template<class Key, class T, class Compare>

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

inherited

Definition at line 145 of file vmap.hpp.

◆ insert() [3/3]

template<class Key, class T, class Compare>

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

inherited

Definition at line 112 of file vmap.hpp.

References begin(), empty(), end(), Ge(), Lt, and V_c.

Here is the call graph for this function:

◆ key_comp()

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

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

inlineinherited

Definition at line 117 of file vmap.h.

◆ Le()

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

bool vmap< Key, T, Compare >::Le	(	const key_type &	a,
		const key_type &	b ) const

inlineprivateinherited

Definition at line 89 of file vmap.h.

Referenced by find(), find(), insert(), and operator[]().

◆ lower_bound() [1/2]

template<class Key, class T, class Compare>

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

inherited

Definition at line 236 of file vmap.hpp.

References begin(), end(), Lt, and value_type().

Referenced by find(), find(), insert(), operator[](), and operator[]().

Here is the call graph for this function:

◆ lower_bound() [2/2]

template<class Key, class T, class Compare>

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

inherited

Definition at line 349 of file vmap.hpp.

References begin(), end(), Lt, and value_type().

Here is the call graph for this function:

◆ max_size()

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

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

inlineinherited

Definition at line 121 of file vmap.h.

◆ operator[]() [1/2]

template<class Key, class T, class Compare>

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

inherited

Definition at line 278 of file vmap.hpp.

References begin(), end(), Le(), lower_bound(), V_c, and value_type().

Here is the call graph for this function:

◆ operator[]() [2/2]

template<class Key, class T, class Compare>

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

inherited

Definition at line 392 of file vmap.hpp.

References lower_bound().

Here is the call graph for this function:

◆ rbegin() [1/2]

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

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

inlineinherited

Definition at line 109 of file vmap.h.

◆ rbegin() [2/2]

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

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

inlineinherited

Definition at line 114 of file vmap.h.

◆ rend() [1/2]

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

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

inlineinherited

Definition at line 110 of file vmap.h.

◆ rend() [2/2]

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

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

inlineinherited

Definition at line 115 of file vmap.h.

◆ reserve()

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

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

inlineinherited

Definition at line 125 of file vmap.h.

◆ size()

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

size_type vmap< Key, T, Compare >::size ( ) const

inlineinherited

Definition at line 120 of file vmap.h.

Referenced by IpplInfo::find_smp_nodes(), insert(), and operator==().

◆ swap()

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

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

inlineinherited

Definition at line 124 of file vmap.h.

◆ upper_bound() [1/2]

template<class Key, class T, class Compare>

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

inherited

Definition at line 251 of file vmap.hpp.

References begin(), end(), Lt, and value_type().

Here is the call graph for this function:

◆ upper_bound() [2/2]

template<class Key, class T, class Compare>

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

inherited

Definition at line 364 of file vmap.hpp.

References begin(), end(), Lt, and value_type().

Here is the call graph for this function:

◆ value_comp()

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

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

inlineinherited

Definition at line 118 of file vmap.h.

◆ write()

template<class T, unsigned D, class M, class C>

void BConds< T, D, M, C >::write ( std::ostream & o ) const

virtual

Definition at line 236 of file BCond.hpp.

References begin(), and end().

Referenced by operator<<().

Here is the call graph for this function:

Member Data Documentation

◆ Lt

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

Compare vmap< Key, T, Compare >::Lt

privateinherited

Definition at line 86 of file vmap.h.

Referenced by equal_range(), equal_range(), vmap< typename Unique::type, my_auto_ptr< LField< T, Dim > > >::Ge(), vmap< typename Unique::type, my_auto_ptr< LField< T, Dim > > >::Gt(), insert(), vmap< typename Unique::type, my_auto_ptr< LField< T, Dim > > >::Le(), lower_bound(), lower_bound(), operator=(), upper_bound(), upper_bound(), and vmap().

◆ V_c

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

rep_type vmap< Key, T, Compare >::V_c

privateinherited

Definition at line 83 of file vmap.h.

Referenced by erase(), erase(), insert(), insert(), operator=(), operator[](), vmap< typename Unique::type, my_auto_ptr< LField< T, Dim > > >::swap(), and vmap().

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

Public Types

Public Member Functions

Private Types

Private Member Functions

Private Attributes

Detailed Description

Member Typedef Documentation

◆ const_iterator

◆ const_reference

◆ const_reverse_iterator

◆ difference_type

◆ iterator

◆ key_compare

◆ key_type

◆ reference

◆ rep_type

◆ reverse_iterator

◆ size_type

◆ value_type

Member Function Documentation

◆ apply()

◆ begin() [1/2]

◆ begin() [2/2]

◆ capacity()

◆ changesPhysicalCells()

◆ count()

◆ empty()

◆ end() [1/2]

◆ end() [2/2]

◆ equal_range() [1/2]

◆ equal_range() [2/2]

◆ erase() [1/3]

◆ erase() [2/3]

◆ erase() [3/3]

◆ find() [1/2]

◆ find() [2/2]

◆ Ge()

◆ Gt()

◆ insert() [1/3]

◆ insert() [2/3]

◆ insert() [3/3]

◆ key_comp()

◆ Le()

◆ lower_bound() [1/2]

◆ lower_bound() [2/2]

◆ max_size()

◆ operator[]() [1/2]

◆ operator[]() [2/2]

◆ rbegin() [1/2]

◆ rbegin() [2/2]

◆ rend() [1/2]

◆ rend() [2/2]

◆ reserve()

◆ size()

◆ swap()

◆ upper_bound() [1/2]

◆ upper_bound() [2/2]

◆ value_comp()

◆ write()

Member Data Documentation

◆ Lt

◆ V_c