Public Types | Public Member Functions | List of all members
ustl::set< T, Comp > Class Template Reference

Unique sorted container. Sorted vector with all values unique. More...

#include <ustl.h>

Inheritance diagram for ustl::set< T, Comp >:
ustl::vector< T >

Public Types

typedef const set< T, Comp > & rcself_t
 
typedef vector< T > base_class
 
typedef base_class::value_type key_type
 
typedef base_class::value_type data_type
 
typedef base_class::value_type value_type
 
typedef base_class::size_type size_type
 
typedef base_class::pointer pointer
 
typedef base_class::const_pointer const_pointer
 
typedef base_class::reference reference
 
typedef base_class::const_reference const_reference
 
typedef base_class::const_iterator const_iterator
 
typedef base_class::iterator iterator
 
typedef base_class::reverse_iterator reverse_iterator
 
typedef base_class::const_reverse_iterator const_reverse_iterator
 
typedef pair< iterator, bool > insertrv_t
 
typedef pair< iterator, iterator > range_t
 
typedef pair< const_iterator, const_iterator > const_range_t
 
using initlist_t = std::initializer_list< value_type >
 
- Public Types inherited from ustl::vector< T >
typedef T value_type
 
typedef value_type * pointer
 
typedef const value_type * const_pointer
 
typedef value_type & reference
 
typedef const value_type & const_reference
 
typedef pointer iterator
 
typedef const_pointer const_iterator
 
typedef memblock::size_type size_type
 
typedef memblock::written_size_type written_size_type
 
typedef memblock::difference_type difference_type
 
typedef ::ustl::reverse_iterator< iterator > reverse_iterator
 
typedef ::ustl::reverse_iterator< const_iterator > const_reverse_iterator
 

Public Member Functions

 set (size_type n)
 
 set (rcself_t v)
 
 set (const_iterator i1, const_iterator i2)
 
rcself_t operator= (rcself_t v)
 
size_type size (void) const
 
iterator begin (void)
 
const_iterator begin (void) const
 
const_iterator cbegin (void) const
 
iterator end (void)
 
const_iterator end (void) const
 
const_iterator cend (void) const
 
const_iterator find (const_reference v) const
 
iterator find (const_reference v)
 
const_iterator lower_bound (const_reference v) const
 
iterator lower_bound (const_reference v)
 
const_iterator upper_bound (const_reference v) const
 
iterator upper_bound (const_reference v)
 
const_range_t equal_range (const_reference v) const
 
range_t equal_range (const_reference v)
 
size_type count (const_reference v) const
 
Comp value_comp (void) const
 
Comp key_comp (void) const
 
void assign (const_iterator i1, const_iterator i2)
 
void push_back (const_reference v)
 
insertrv_t insert (const_reference v)
 Inserts v into the container, maintaining the sort order.
 
iterator insert (const_iterator, const_reference v)
 
void insert (const_iterator i1, const_iterator i2)
 
void erase (const_reference v)
 
iterator erase (iterator ep)
 
iterator erase (iterator ep1, iterator ep2)
 
void clear (void)
 
void swap (set &v)
 
 set (set &&v)
 
 set (initlist_t v)
 
setoperator= (set &&v)
 
insertrv_t insert (T &&v)
 
iterator insert (const_iterator, T &&v)
 
void insert (initlist_t v)
 
template<typename... Args>
insertrv_t emplace (Args &&...args)
 
template<typename... Args>
iterator emplace_hint (const_iterator h, Args &&...args)
 
template<typename... Args>
insertrv_t emplace_back (Args &&...args)
 
- Public Member Functions inherited from ustl::vector< T >
 vector (void)
 Initializes empty vector.
 
 vector (size_type n)
 Initializes a vector of size n.
 
 vector (size_type n, const T &v)
 Copies n elements from v.
 
 vector (const vector &v)
 Copies v.
 
 vector (const_iterator i1, const_iterator i2)
 Copies range [i1, i2].
 
 ~vector (void) noexcept
 Destructor.
 
const vectoroperator= (const vector &v)
 Copies contents of v.
 
bool operator== (const vector &v) const
 
 operator cmemlink (void) const
 
 operator cmemlink (void)
 
 operator memlink (void)
 
void reserve (size_type n, bool bExact=false)
 Allocates space for at least n elements.
 
void resize (size_type n, bool bExact=true)
 Resizes the vector to contain n elements.
 
size_type capacity (void) const
 
size_type size (void) const
 
size_type max_size (void) const
 
bool empty (void) const
 
iterator begin (void)
 
const_iterator begin (void) const
 
iterator end (void)
 
const_iterator end (void) const
 
const_iterator cbegin (void) const
 
const_iterator cend (void) const
 
reverse_iterator rbegin (void)
 
const_reverse_iterator rbegin (void) const
 
reverse_iterator rend (void)
 
const_reverse_iterator rend (void) const
 
const_reverse_iterator crbegin (void) const
 
const_reverse_iterator crend (void) const
 
iterator data (void)
 
const_iterator data (void) const
 
const_iterator cdata (void) const
 
iterator iat (size_type i)
 
const_iterator iat (size_type i) const
 
reference at (size_type i)
 
const_reference at (size_type i) const
 
reference operator[] (size_type i)
 
const_reference operator[] (size_type i) const
 
reference front (void)
 
const_reference front (void) const
 
reference back (void)
 
const_reference back (void) const
 
void push_back (const T &v=T())
 Inserts value v at the end of the vector.
 
void pop_back (void)
 
void clear (void)
 
void shrink_to_fit (void)
 
void deallocate (void) noexcept
 Calls element destructors and frees storage.
 
void assign (const_iterator i1, const_iterator i2)
 Copies the range [i1, i2].
 
void assign (size_type n, const T &v)
 Copies n elements with value v.
 
void swap (vector &v)
 
iterator insert (const_iterator ip, const T &v)
 Inserts value v at offset ip.
 
iterator insert (const_iterator ip, size_type n, const T &v)
 Inserts n elements with value v at offsets ip.
 
iterator insert (const_iterator ip, const_iterator i1, const_iterator i2)
 Inserts range [i1, i2] at offset ip.
 
iterator erase (const_iterator ep, size_type n=1)
 Removes count elements at offset ep.
 
iterator erase (const_iterator ep1, const_iterator ep2)
 Removes elements from ep1 to ep2.
 
void manage (pointer p, size_type n)
 
bool is_linked (void) const
 
void unlink (void)
 
void copy_link (void)
 
void link (const_pointer p, size_type n)
 
void link (pointer p, size_type n)
 
void link (const vector &v)
 
void link (vector &v)
 
void link (const_pointer first, const_pointer last)
 
void link (pointer first, pointer last)
 
void read (istream &is)
 
void write (ostream &os) const
 
void text_write (ostringstream &os) const
 
size_t stream_size (void) const
 
 vector (vector &&v)
 
 vector (std::initializer_list< T > v)
 
vectoroperator= (vector &&v)
 
template<typename... Args>
iterator emplace (const_iterator ip, Args &&...args)
 Constructs value at ip.
 
template<typename... Args>
void emplace_back (Args &&...args)
 Constructs value at the end of the vector.
 
void push_back (T &&v)
 
iterator insert (const_iterator ip, T &&v)
 
iterator insert (const_iterator ip, std::initializer_list< T > v)
 

Additional Inherited Members

- Protected Member Functions inherited from ustl::vector< T >
iterator insert_space (const_iterator ip, size_type n)
 Inserts n uninitialized elements at ip.
 

Detailed Description

template<typename T, typename Comp = less<T>>
class ustl::set< T, Comp >

Unique sorted container. Sorted vector with all values unique.


The documentation for this class was generated from the following file:

Generated on Mon Sep 28 2015 17:58:50 for uSTL by Doxygen 1.8.10