pm::Set< E, Comparator > Class Template Reference

An associative container based on a balanced binary search (AVL) tree. Comparator is a functor defining a total ordering on the element value domain. In the most cases, the default choice (lexicographical order) will suffice for your needs. More...

Inheritance diagram for pm::Set< E, Comparator >:

[legend]

Collaboration diagram for pm::Set< E, Comparator >:

[legend]

List of all members.

Public Member Functions
	Set ()
	Create an empty set.
	Set (const Comparator &cmp_arg)
	Create an empty set with a non-default Comparator.
template<typename Iterator>
	Set (Iterator src, Iterator end)
	Create a Set from an iterator.
	Set (const GenericSet< Set, E, Comparator > &s)
	Copy of a disguised Set object.
template<typename Set2>
	Set (const GenericSet< Set2, E, Comparator > &s)
	Copy of an abstract set of the same element type.
template<typename Set2, typename E2, typename Comparator2>
	Set (const GenericSet< Set2, E2, Comparator2 > &s)
	Copy of an abstract set with element conversion.
Set &	operator= (const GenericSet< Set, E, Comparator > &s)
	Assign elements from a disguised Set object.
void	clear ()
	Make the set empty.
void	swap (Set &s)
	Swap the content with another Set.
template<typename Permutation>
Set	copy_permuted (const Permutation &perm) const
	Return the (pointwise) image of this under a permutation.
template<typename Permutation>
Set	copy_permuted_inv (const Permutation &perm) const
	Return the (pointwise) image of this under the inverse of a given permutation.

---

Detailed Description

template<typename E, typename Comparator>
class pm::Set< E, Comparator >

An associative container based on a balanced binary search (AVL) tree. Comparator is a functor defining a total ordering on the element value domain. In the most cases, the default choice (lexicographical order) will suffice for your needs.

The data tree is attached to the Set object via a smart pointer.

---

Member Function Documentation

template<typename E, typename Comparator>

void pm::Set< E, Comparator >::swap

(

Set< E, Comparator > &

s

)

[inline]

Swap the content with another Set.

Parameters:

s

the other Set

---

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

• include/core/polymake/Set.h