Cadabra
Computer algebra system for field theory problems
|
An iterator over all boxes of a tableau, left to right, top to bottom.
#include <YoungTab.hh>
Public Member Functions | |
iterator (unsigned int r, unsigned int c, filled_tableau< T > *) | |
T & | operator* () const |
T * | operator-> () const |
iterator & | operator++ () |
iterator | operator++ (int) |
iterator & | operator-- () |
iterator | operator-- (int) |
iterator | operator+ (unsigned int) const |
iterator | operator- (unsigned int) const |
iterator & | operator+= (unsigned int) |
iterator & | operator-= (unsigned int) |
bool | operator< (const iterator &other) const |
bool | operator> (const iterator &other) const |
ptrdiff_t | operator- (const iterator &) const |
bool | operator== (const iterator &) const |
bool | operator!= (const iterator &) const |
Private Attributes | |
filled_tableau< T > * | tab |
unsigned int | column_number |
unsigned int | row_number |
Friends | |
class | filled_tableau< T > |
class | filled_tableau< T >::const_iterator |
Additional Inherited Members | |
Public Types inherited from yngtab::filled_tableau< T >::iterator_base | |
typedef T | value_type |
typedef T * | pointer |
typedef T & | reference |
typedef size_t | size_type |
typedef ptrdiff_t | difference_type |
typedef std::random_access_iterator_tag | iterator_category |
yngtab::filled_tableau< T >::iterator::iterator | ( | unsigned int | r, |
unsigned int | c, | ||
filled_tableau< T > * | t | ||
) |
bool yngtab::filled_tableau< T >::iterator::operator!= | ( | const iterator & | other | ) | const |
T & yngtab::filled_tableau< T >::iterator::operator* |
filled_tableau< T >::iterator yngtab::filled_tableau< T >::iterator::operator+ | ( | unsigned int | n | ) | const |
filled_tableau< T >::iterator & yngtab::filled_tableau< T >::iterator::operator++ |
filled_tableau< T >::iterator yngtab::filled_tableau< T >::iterator::operator++ | ( | int | ) |
filled_tableau< T >::iterator & yngtab::filled_tableau< T >::iterator::operator+= | ( | unsigned int | n | ) |
ptrdiff_t yngtab::filled_tableau< T >::iterator::operator- | ( | const iterator & | other | ) | const |
filled_tableau< T >::iterator yngtab::filled_tableau< T >::iterator::operator- | ( | unsigned int | n | ) | const |
filled_tableau< T >::iterator & yngtab::filled_tableau< T >::iterator::operator-- |
filled_tableau< T >::iterator yngtab::filled_tableau< T >::iterator::operator-- | ( | int | ) |
filled_tableau< T >::iterator & yngtab::filled_tableau< T >::iterator::operator-= | ( | unsigned int | n | ) |
T * yngtab::filled_tableau< T >::iterator::operator-> |
bool yngtab::filled_tableau< T >::iterator::operator< | ( | const iterator & | other | ) | const |
bool yngtab::filled_tableau< T >::iterator::operator== | ( | const iterator & | other | ) | const |
bool yngtab::filled_tableau< T >::iterator::operator> | ( | const iterator & | other | ) | const |
|
friend |
|
friend |
|
private |
|
private |
|
private |