| 
| 
  | ordered_set (const ordered_set &a) | 
|   | 
| 
template<typename InputIt >  | 
|   | ordered_set (InputIt first, InputIt last) | 
|   | 
| 
  | ordered_set (ordered_set &&a)=default | 
|   | 
| 
  | ordered_set (std::initializer_list< T > init) | 
|   | 
| 
reference  | back () const noexcept | 
|   | 
| 
const_iterator  | begin () const noexcept | 
|   | 
| 
iterator  | begin () noexcept | 
|   | 
| 
const_iterator  | cbegin () const noexcept | 
|   | 
| 
const_iterator  | cend () const noexcept | 
|   | 
| 
void  | clear () | 
|   | 
| 
size_type  | count (const T &a) const | 
|   | 
| 
const_reverse_iterator  | crbegin () const noexcept | 
|   | 
| 
const_reverse_iterator  | crend () const noexcept | 
|   | 
| 
template<class... Args>  | 
| std::pair< iterator, bool >  | emplace (Args &&...args) | 
|   | 
| 
template<class... Args>  | 
| std::pair< iterator, bool >  | emplace_back (Args &&...args) | 
|   | 
| 
bool  | empty () const noexcept | 
|   | 
| 
const_iterator  | end () const noexcept | 
|   | 
| 
iterator  | end () noexcept | 
|   | 
| 
size_type  | erase (const T &v) | 
|   | 
| 
iterator  | erase (const_iterator pos) | 
|   | 
| 
iterator  | find (const T &a) | 
|   | 
| 
const_iterator  | find (const T &a) const | 
|   | 
| 
reference  | front () const noexcept | 
|   | 
| 
std::pair< iterator, bool >  | insert (const T &v) | 
|   | 
| 
iterator  | insert (const_iterator pos, const T &v) | 
|   | 
| 
iterator  | insert (const_iterator pos, T &&v) | 
|   | 
| 
void  | insert (ordered_set::const_iterator begin, ordered_set::const_iterator end) | 
|   | 
| 
std::pair< iterator, bool >  | insert (T &&v) | 
|   | 
| 
iterator  | lower_bound (const T &a) | 
|   | 
| 
const_iterator  | lower_bound (const T &a) const | 
|   | 
| 
size_type  | max_size () const noexcept | 
|   | 
| 
bool  | operator!= (const ordered_set &a) const | 
|   | 
| 
bool  | operator< (const ordered_set &a) const | 
|   | 
| 
ordered_set &  | operator= (const ordered_set &a) | 
|   | 
| 
ordered_set &  | operator= (ordered_set &&a)=default | 
|   | 
| 
bool  | operator== (const ordered_set &a) const | 
|   | 
| 
void  | push_back (const T &v) | 
|   | 
| 
void  | push_back (T &&v) | 
|   | 
| 
const_reverse_iterator  | rbegin () const noexcept | 
|   | 
| 
reverse_iterator  | rbegin () noexcept | 
|   | 
| 
const_reverse_iterator  | rend () const noexcept | 
|   | 
| 
reverse_iterator  | rend () noexcept | 
|   | 
| 
size_type  | size () const noexcept | 
|   | 
| 
sorted_iterator  | sorted_begin () const noexcept | 
|   | 
| 
sorted_iterator  | sorted_end () const noexcept | 
|   | 
| 
iterator  | upper_bound (const T &a) | 
|   | 
| 
const_iterator  | upper_bound (const T &a) const | 
|   |