|
| vector_set_view (BOOST_DEDUCED_TYPENAME base_::base_type &c) |
|
vector_set_view & | operator= (const vector_set_view &v) |
|
BOOST_DEDUCED_TYPENAME
base_::const_reference | operator[] (BOOST_DEDUCED_TYPENAME base_::size_type n) const |
|
BOOST_DEDUCED_TYPENAME
base_::const_reference | at (BOOST_DEDUCED_TYPENAME base_::size_type n) const |
|
BOOST_DEDUCED_TYPENAME
base_::reference | operator[] (BOOST_DEDUCED_TYPENAME base_::size_type n) |
|
BOOST_DEDUCED_TYPENAME
base_::reference | at (BOOST_DEDUCED_TYPENAME base_::size_type n) |
|
void | splice (BOOST_DEDUCED_TYPENAME base_::iterator position, vector_set_view &x) |
|
void | splice (BOOST_DEDUCED_TYPENAME base_::iterator position, vector_set_view &x, BOOST_DEDUCED_TYPENAME base_::iterator i) |
|
void | splice (BOOST_DEDUCED_TYPENAME base_::iterator position, vector_set_view &x, BOOST_DEDUCED_TYPENAME base_::iterator first, BOOST_DEDUCED_TYPENAME base_::iterator last) |
|
void | remove (BOOST_DEDUCED_TYPENAME::boost::call_traits< BOOST_DEDUCED_TYPENAME base_::value_type >::param_type value) |
|
template<typename Predicate > |
void | remove_if (Predicate pred) |
|
void | unique () |
|
template<class BinaryPredicate > |
void | unique (BinaryPredicate binary_pred) |
|
void | merge (vector_set_view &x) |
|
template<class Compare > |
void | merge (vector_set_view &x, Compare comp) |
|
void | sort () |
|
template<class Compare > |
void | sort (Compare comp) |
|
void | reverse () |
|
void | relocate (BOOST_DEDUCED_TYPENAME base_::iterator position, BOOST_DEDUCED_TYPENAME base_::iterator i) |
|
void | relocate (BOOST_DEDUCED_TYPENAME base_::iterator position, BOOST_DEDUCED_TYPENAME base_::iterator first, BOOST_DEDUCED_TYPENAME base_::iterator last) |
|
template<class CoreIndex>
class boost::bimaps::views::vector_set_view< CoreIndex >
View of a bimap that is signature compatible with std::vector.
This class uses container_adaptor and iterator_adaptor to wrapped a index of the multi_index bimap core so it can be used as a std::vector.
See also const_set_view.