PUBLIC

PermutationIterC::PermutationIterC(UIntT) PermutationIterC::PermutationIterC(const PermutationIterC &) PermutationIterC::Copy(void) const PermutationIterC::Iter(UIntT) PermutationIterC::InsLast(UIntT,const T &) PermutationIterC::InsLast(const T &) PermutationIterC::InsLast(UIntT,DListC &) PermutationIterC::Del(UIntT) PermutationIterC::First(void) PermutationIterC::Next(void) PermutationIterC::IsElm(void) const PermutationIterC::Data(UIntT) const PermutationIterC::Data(void) const PermutationIterC::Reset(UIntT) PermutationIterC::Arity(void) const PermutationIterC::Empty(void) PermutationIterC::GetIter(int) const

PermutationIterC(UIntT nArity = 0)

Constructor.

PermutationIterC(const PermutationIterC & Oth)

Copy constructor.

PermutationIterC<T> Copy() const

Make a copy of this iterator.
This copys the iterators but NOT the lists, so any modification made to lists will affect both iterators.

This may be changed in the future.

DLIterC<T> & Iter(UIntT i)

Access a given iterator.

void InsLast(UIntT i,const T & Item)

Add item to end of list.

void InsLast(const T & Item)

Add to all lists.

void InsLast(UIntT i,DListC<T> & Items)

Add items to end of list.

void Del(UIntT i)

Delete element from given list.

bool First(void)

Goto first permutation.

bool Next(void)

Goto Next permutation.

bool IsElm(void) const

Is a valid element ?

const T & Data(UIntT i) const

Get data.

DListC<T> Data(void) const

Make a list.

void Reset(UIntT nArity)

Clear Iter & change arity.

UIntT Arity(void) const

Get Arity of iterator.

void Empty(void)

Empty all lists.

DLIterC<T> GetIter(int i) const

Get a copy of iterator.