|
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 int | key_type |
| |
typedef std::pair< int,
RefCountedP< BCondBase< T, D,
M, C > > > | value_type |
| |
| typedef dummy_less< int > | 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 |
| |
|
| 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< int, RefCountedP< BCondBase< T, D, M, C > >, dummy_less< int > > &x) |
| |
| void | reserve (size_type n) |
| |
| | vmap (const dummy_less< int > &comp=dummy_less< int >()) |
| |
| | vmap (const vmap< int, RefCountedP< BCondBase< T, D, M, C > >, dummy_less< int > > &x) |
| |
vmap< int, RefCountedP
< BCondBase< T, D, M, C >
>, dummy_less< int > > & | operator= (const vmap< int, RefCountedP< BCondBase< T, D, M, C > >, dummy_less< int > > &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) |
| |
RefCountedP< BCondBase< T, D,
M, C > > & | operator[] (const key_type &k) |
| |
const RefCountedP< BCondBase
< T, D, M, C > > & | 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 |
| |
template<class T, unsigned D, class M, class C>
class BConds< T, D, M, C >
Definition at line 31 of file BCond.h.