#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 |
 Public Types inherited from vmap< Key, T, Compare > | |
| 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::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 | |
| void | apply (Field< T, D, M, C > &a) |
| bool | changesPhysicalCells () const |
| virtual void | write (std::ostream &) const |
| Public Member Functions inherited from vmap< Key, T, Compare > | |
| 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) |
| 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) |
| iterator | find (const key_type &x) |
| iterator | lower_bound (const key_type &x) |
| iterator | upper_bound (const key_type &x) |
| std::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 |
| std::pair< const_iterator, const_iterator > | equal_range (const key_type &x) const |
Detailed Description
template<class T, unsigned D, class M = UniformCartesian<D,double>, class C = typename M::DefaultCentering>
class BConds< T, D, M, C >
class BConds< T, D, M, C >
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 |
◆ 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 |
Member Function Documentation
◆ apply()
◆ changesPhysicalCells()
template<class T , unsigned D, class M , class C >
| bool BConds< T, D, M, C >::changesPhysicalCells | ( | ) | const |
◆ write()
template<class T , unsigned D, class M , class C >
|
virtual |
Definition at line 236 of file BCond.hpp.
References begin(), and end().
Referenced by operator<<().
Here is the call graph for this function:
The documentation for this class was generated from the following files:
