User Documentation
Centre for Vision, Speech & Signal Processing
DEVELOP IN NAMESPACE AMMA TREE ROOT AMMA SEARCH AMMA HOME
 

  PUBLIC
PermIterC::PermIterC(UIntT)
PermIterC::PermIterC(const PermIterC &)
PermIterC::Copy(void) const
PermIterC::Iter(UIntT)
PermIterC::InsLast(UIntT,const T &)
PermIterC::InsLast(const T &)
PermIterC::InsLast(UIntT,DListC &)
PermIterC::Del(UIntT)
PermIterC::First(void)
PermIterC::Next(void)
PermIterC::IsElm(void) const
PermIterC::Data(UIntT) const
PermIterC::Data(void) const
PermIterC::Reset(UIntT)
PermIterC::Arity(void) const
PermIterC::Empty(void)
PermIterC::GetIter(int) const
PermIterC<class T>
 
Iterate permutations.
 
include "amma/PermIter.hh"
User Level:Default
Library:MiscAlg
Example:exBnd.cc
Section:Misc
In Scope:std

Comments:
Basicly this generates a list for each position in an array then iterates through all the possible combinations of values.

Variables:
Methods:
PermIterC(UIntT nArity = 0)
Default constructor.

PermIterC(const PermIterC & Oth)
Copy constructor.

PermIterC<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.

BooleanT First(void)
Goto first permutation.

BooleanT Next(void)
Goto Next permutation.

BooleanT 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.


Programmer:Charles Galambos, Documentation by CxxDoc: Tue Mar 20 10:48:08 2001