stl_set.h File Reference

#include <bits/concept_check.h>

Include dependency graph for stl_set.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Namespaces
namespace	std
Classes
class	std::set< Key, Compare, Alloc >
	A standard container made up of unique keys, which can be retrieved in logarithmic time. More...
Functions
template<class Key, class Compare, class Alloc> bool	operator== (const set< Key, Compare, Alloc > &x, const set< Key, Compare, Alloc > &y)
	Set equality comparison.
template<class Key, class Compare, class Alloc> bool	operator< (const set< Key, Compare, Alloc > &x, const set< Key, Compare, Alloc > &y)
	Set ordering relation.
template<class Key, class Compare, class Alloc> bool	operator!= (const set< Key, Compare, Alloc > &x, const set< Key, Compare, Alloc > &y)
	Returns !(x == y).
template<class Key, class Compare, class Alloc> bool	operator> (const set< Key, Compare, Alloc > &x, const set< Key, Compare, Alloc > &y)
	Returns y < x.
template<class Key, class Compare, class Alloc> bool	operator<= (const set< Key, Compare, Alloc > &x, const set< Key, Compare, Alloc > &y)
	Returns !(y < x).
template<class Key, class Compare, class Alloc> bool	operator>= (const set< Key, Compare, Alloc > &x, const set< Key, Compare, Alloc > &y)
	Returns !(x < y).
template<class Key, class Compare, class Alloc> void	swap (set< Key, Compare, Alloc > &x, set< Key, Compare, Alloc > &y)
	See std::set::swap().

---

Detailed Description

This is an internal header file, included by other library headers. You should not attempt to use it directly.

Definition in file stl_set.h.

---

Function Documentation

template<class Key, class Compare, class Alloc> bool operator!= (  const set< Key, Compare, Alloc > &  x, const set< Key, Compare, Alloc > &  y )  [inline]

Returns !(x == y). Definition at line 560 of file stl_set.h.

template<class Key, class Compare, class Alloc> bool std::operator< (  const set< Key, Compare, Alloc > &  x, const set< Key, Compare, Alloc > &  y )  [inline]

Set ordering relation. Parameters: x  A set. y  A set of the same type as x. Returns: True iff x is lexicographically less than y. This is a total ordering relation. It is linear in the size of the maps. The elements must be comparable with <. See std::lexicographical_compare() for how the determination is made. Definition at line 553 of file stl_set.h.

template<class Key, class Compare, class Alloc> bool operator<= (  const set< Key, Compare, Alloc > &  x, const set< Key, Compare, Alloc > &  y )  [inline]

Returns !(y < x). Definition at line 574 of file stl_set.h.

template<class Key, class Compare, class Alloc> bool std::operator== (  const set< Key, Compare, Alloc > &  x, const set< Key, Compare, Alloc > &  y )  [inline]

Set equality comparison. Parameters: x  A set. y  A set of the same type as x. Returns: True iff the size and elements of the sets are equal. This is an equivalence relation. It is linear in the size of the sets. Sets are considered equivalent if their sizes are equal, and if corresponding elements compare equal. Definition at line 536 of file stl_set.h.

template<class Key, class Compare, class Alloc> bool operator> (  const set< Key, Compare, Alloc > &  x, const set< Key, Compare, Alloc > &  y )  [inline]

Returns y < x. Definition at line 567 of file stl_set.h. References std::operator>().

template<class Key, class Compare, class Alloc> bool operator>= (  const set< Key, Compare, Alloc > &  x, const set< Key, Compare, Alloc > &  y )  [inline]

Returns !(x < y). Definition at line 581 of file stl_set.h. References std::operator>=().

template<class Key, class Compare, class Alloc> void swap (  set< Key, Compare, Alloc > &  x, set< Key, Compare, Alloc > &  y )  [inline]

See std::set::swap(). Definition at line 588 of file stl_set.h. References std::set< Key, Compare, Alloc >::swap(), and std::swap().

---