Fish - FiberLib for VISH 0.3
Fish - The Fiber Bundle API for the Vish Visualization Shell
Fiber::set< typename _Key, typename _Compare, typename _Alloc > Class Template Reference

STL class. More...

Classes

class  iterator
 STL iterator class. More...
class  const_iterator
 STL iterator class. More...
class  reverse_iterator
 STL iterator class. More...
class  const_reverse_iterator
 STL iterator class. More...

Public Types

typedef _Key key_type
typedef _Key key_type
typedef _Key value_type
typedef _Key value_type
typedef _Compare key_compare
typedef _Compare key_compare
typedef _Compare value_compare
typedef _Compare value_compare
typedef _Alloc allocator_type
typedef _Alloc allocator_type
typedef _Alloc_traits::pointer pointer
typedef _Alloc_traits::pointer pointer
typedef _Alloc_traits::const_pointer const_pointer
typedef _Alloc_traits::const_pointer const_pointer
typedef _Alloc_traits::reference reference
typedef _Alloc_traits::reference reference
typedef _Alloc_traits::const_reference const_reference
typedef _Alloc_traits::const_reference const_reference
typedef _Rep_type::const_iterator iterator
typedef _Rep_type::const_iterator iterator
typedef _Rep_type::const_iterator const_iterator
typedef _Rep_type::const_iterator const_iterator
typedef _Rep_type::const_reverse_iterator reverse_iterator
typedef _Rep_type::const_reverse_iterator reverse_iterator
typedef _Rep_type::const_reverse_iterator const_reverse_iterator
typedef _Rep_type::const_reverse_iterator const_reverse_iterator
typedef _Rep_type::size_type size_type
typedef _Rep_type::size_type size_type
typedef _Rep_type::difference_type difference_type
typedef _Rep_type::difference_type difference_type

Public Member Functions

 set (_InputIterator __first, _InputIterator __last)
 set (_InputIterator __first, _InputIterator __last, const _Compare &__comp, const allocator_type &__a=allocator_type())
 set (_InputIterator __first, _InputIterator __last, const allocator_type &__a)
 set (const _Compare &__comp, const allocator_type &__a=allocator_type())
 set (const allocator_type &__a)
 set (const set &)=default
 set (const set &__x, const __type_identity_t< allocator_type > &__a)
 set (initializer_list< value_type > __l, const _Compare &__comp=_Compare(), const allocator_type &__a=allocator_type())
 set (initializer_list< value_type > __l, const allocator_type &__a)
 set (set &&)=default
 set (set &&__x, const __type_identity_t< allocator_type > &__a) noexcept(is_nothrow_copy_constructible< _Compare >::value &&_Alloc_traits::_S_always_equal())
iterator begin () const noexcept
iterator cbegin () const noexcept
iterator cend () const noexcept
void clear () noexcept
reverse_iterator crbegin () const noexcept
reverse_iterator crend () const noexcept
std::pair< iterator, bool > emplace (_Args &&... __args)
iterator emplace_hint (const_iterator __pos, _Args &&... __args)
bool empty () const noexcept
iterator end () const noexcept
size_type erase (const key_type &__x)
_GLIBCXX_ABI_TAG_CXX11 iterator erase (const_iterator __first, const_iterator __last)
_GLIBCXX_ABI_TAG_CXX11 iterator erase (const_iterator __position)
node_type extract (const key_type &__x)
node_type extract (const_iterator __pos)
allocator_type get_allocator () const noexcept
void insert (_InputIterator __first, _InputIterator __last)
std::pair< iterator, bool > insert (const value_type &__x)
iterator insert (const_iterator __hint, node_type &&__nh)
iterator insert (const_iterator __position, const value_type &__x)
void insert (initializer_list< value_type > __l)
insert_return_type insert (node_type &&__nh)
key_compare key_comp () const
size_type max_size () const noexcept
setoperator= (const set &)=default
setoperator= (initializer_list< value_type > __l)
setoperator= (set &&)=default
reverse_iterator rbegin () const noexcept
reverse_iterator rend () const noexcept
size_type size () const noexcept
void swap (set &__x) noexcept(/*conditional */)
value_compare value_comp () const
size_type count (const key_type &__x) const
auto count (const _Kt &__x) const -> decltype(_M_t._M_count_tr(__x))
size_type count (const key_type &__x) const
auto count (const _Kt &__x) const -> decltype(_M_t._M_count_tr(__x))
bool contains (const key_type &__x) const
auto contains (const _Kt &__x) const -> decltype(_M_t._M_find_tr(__x), void(), true)
bool contains (const key_type &__x) const
auto contains (const _Kt &__x) const -> decltype(_M_t._M_find_tr(__x), void(), true)
iterator find (const key_type &__x)
const_iterator find (const key_type &__x) const
auto find (const _Kt &__x) -> decltype(iterator{_M_t._M_find_tr(__x)})
auto find (const _Kt &__x) const -> decltype(const_iterator{_M_t._M_find_tr(__x)})
iterator find (const key_type &__x)
const_iterator find (const key_type &__x) const
auto find (const _Kt &__x) -> decltype(iterator{_M_t._M_find_tr(__x)})
auto find (const _Kt &__x) const -> decltype(const_iterator{_M_t._M_find_tr(__x)})
iterator lower_bound (const key_type &__x)
const_iterator lower_bound (const key_type &__x) const
auto lower_bound (const _Kt &__x) -> decltype(iterator(_M_t._M_lower_bound_tr(__x)))
auto lower_bound (const _Kt &__x) const -> decltype(const_iterator(_M_t._M_lower_bound_tr(__x)))
iterator lower_bound (const key_type &__x)
const_iterator lower_bound (const key_type &__x) const
auto lower_bound (const _Kt &__x) -> decltype(iterator(_M_t._M_lower_bound_tr(__x)))
auto lower_bound (const _Kt &__x) const -> decltype(const_iterator(_M_t._M_lower_bound_tr(__x)))
iterator upper_bound (const key_type &__x)
const_iterator upper_bound (const key_type &__x) const
auto upper_bound (const _Kt &__x) -> decltype(iterator(_M_t._M_upper_bound_tr(__x)))
auto upper_bound (const _Kt &__x) const -> decltype(iterator(_M_t._M_upper_bound_tr(__x)))
iterator upper_bound (const key_type &__x)
const_iterator upper_bound (const key_type &__x) const
auto upper_bound (const _Kt &__x) -> decltype(iterator(_M_t._M_upper_bound_tr(__x)))
auto upper_bound (const _Kt &__x) const -> decltype(iterator(_M_t._M_upper_bound_tr(__x)))
std::pair< iterator, iteratorequal_range (const key_type &__x)
std::pair< const_iterator, const_iteratorequal_range (const key_type &__x) const
auto equal_range (const _Kt &__x) -> decltype(pair< iterator, iterator >(_M_t._M_equal_range_tr(__x)))
auto equal_range (const _Kt &__x) const -> decltype(pair< iterator, iterator >(_M_t._M_equal_range_tr(__x)))
std::pair< iterator, iteratorequal_range (const key_type &__x)
std::pair< const_iterator, const_iteratorequal_range (const key_type &__x) const
auto equal_range (const _Kt &__x) -> decltype(pair< iterator, iterator >(_M_t._M_equal_range_tr(__x)))
auto equal_range (const _Kt &__x) const -> decltype(pair< iterator, iterator >(_M_t._M_equal_range_tr(__x)))

Public Attributes

keys
 STL member.

Detailed Description

STL class.