ustl::set< T > Class Template Reference
[Sequence Containers]

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

#include <ustl.h>

Inheritance diagram for ustl::set< T >:

List of all members.

Public Types
typedef vector< T >::value_type	key_type
typedef vector< T >::value_type	data_type
typedef vector< T >::value_type	value_type
typedef vector< T >::size_type	size_type
typedef vector< T >::pointer	pointer
typedef vector< T >::const_pointer	const_pointer
typedef vector< T >::reference	reference
typedef vector< T >::const_reference	const_reference
typedef vector< T >::const_iterator	const_iterator
typedef vector< T >::iterator	iterator
typedef vector< T >::reverse_iterator	reverse_iterator
typedef vector< T >::const_reverse_iterator	const_reverse_iterator
Public Member Functions
	set (void)
	Default constructor.
	set (size_type n)
	Creates a container able to hold at least n elements.
	set (const set< T > &v)
	Creates a copy of v.
	set (const_iterator i1, const_iterator i2)
	Inserts elements from range [i1,i2), which does not have to be sorted.
const set< T > &	operator= (const set< T > &v)
	Copies the contents of v.
void	assign (const_iterator i1, const_iterator i2)
	Copies the contents of range [i1,i2).
void	push_back (const_reference v)
	Inserts v into the container, maintaining the sort order.
const_iterator	find (const_reference v) const
	Returns the iterator to an element with value of v.
iterator	find (const_reference v)
	Returns the iterator to an element with value of v.
iterator	insert (const_reference v)
	Inserts v into the container, maintaining the sort order.
void	insert (const_iterator i1, const_iterator i2)
	Inserts the contents of range [i1,i2).
void	erase (const_reference v)
	Erases the element with value v.
iterator	erase (iterator ep)
	Erases the element at ep.
iterator	erase (iterator ep1, iterator ep2)
	Erases the range [ep1,ep2).
void	clear (void)
	Resizes the block to 0.
size_type	size (void) const
	Returns the size of the block.
iterator	begin (void)
	Returns the pointer to the first element.
const_iterator	begin (void) const
	Returns the pointer to the first element.
iterator	end (void)
	Returns the pointer to the last element.
const_iterator	end (void) const
	Returns the pointer to the last element.

---

Detailed Description

template<typename T>
class ustl::set< T >

Unique sorted container. Sorted vector with all values unique.

---

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

• uset.h

---