GenericSet.h File Reference

Declaration of pm::GenericSet class. More...

Classes
class	pm::Set
	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 most cases, the default choice (lexicographical order) will suffice for your needs. More...
class	pm::PowerSet
	A Set with elements of type Set<E>, providing methods for adding elements while preserving subset or superset independence. Comparator is a functor defining a total ordering on Set<E>. More...
class	pm::SingleElementSetCmp< ElemRef, Comparator >
	A set consisting of exactly one element. More...
class	pm::Complement< SetRef >
	Complement as GenericSet. More...
class	pm::GenericSet
	Generic type for ordered sets More...
class	pm::GenericSet
	Generic type for ordered sets More...
class	pm::SingleElementSetCmp< ElemRef, Comparator >
	A set consisting of exactly one element. More...
class	pm::Complement< SetRef >
	Complement as GenericSet. More...
class	pm::Set_with_dim< SetRef >
	Set_with_dim as GenericSet. More...

Namespaces
	pm
	global namespace for all classes from the polymake project
	operations
	functors for operations on GenericSet objects
	polymake
	namespace to be used for client code

Functions
template<typename Comparator , typename E >
auto	pm::scalar2set (E &&x)
	construct an one-element set with explicitly specified comparator type
template<typename E >
auto	pm::scalar2set (E &&x)
	construct an one-element set with standard (lexicographical) comparator type
template<typename Set1 , typename Set2 , typename E1 , typename E2 , class Comparator >
Int	pm::incl (const GenericSet< Set1, E1, Comparator > &s1, const GenericSet< Set2, E2, Comparator > &s2)

Detailed Description

Declaration of pm::GenericSet class.

Implementation of various kinds of pm::GenericSet types