|
Public Types |
typedef std::set< typename
Graph::KnownVertex > | set_type |
typedef set_type::value_type | value_type |
typedef set_type::key_type | key_type |
typedef set_type::value_compare | value_compare |
typedef set_type::key_compare | key_compare |
typedef set_type::pointer | pointer |
typedef set_type::reference | reference |
typedef set_type::const_reference | const_reference |
typedef set_type::size_type | size_type |
typedef set_type::difference_type | difference_type |
typedef set_type::iterator | iterator |
typedef set_type::const_iterator | const_iterator |
typedef set_type::reverse_iterator | reverse_iterator |
typedef set_type::const_reverse_iterator | const_reverse_iterator |
Public Member Functions |
| SetWrapper (Graph &_g) |
pair< typename set_type::iterator,
bool > | insert (VertexID_t v) |
iterator | begin () const |
iterator | end () const |
reverse_iterator | rbegin () const |
reverse_iterator | rend () const |
size_type | size () const |
size_type | max_size () const |
bool | empty () const |
key_compare | key_comp () const |
value_compare | value_comp () const |
void | swap (SetWrapper &s) |
pair< iterator, bool > | insert (value_type v) |
iterator | insert (iterator pos, value_type v) |
template<class InputIterator> void | insert (InputIterator it_begin, InputIterator it_end) |
size_type | erase (const key_type &v) |
void | erase (iterator it) |
void | erase (iterator first, iterator last) |
void | clear () |
iterator | find (key_type v) |
size_type | count (key_type v) const |
iterator | lower_bound (key_type v) const |
iterator | upper_bound (key_type v) const |
std::pair< iterator, iterator > | equal_range (key_type v) const |