Cadabra
Computer algebra system for field theory problems
|
#include <YoungTab.hh>
Classes | |
class | in_column_iterator |
An iterator which stays inside a given column of a tableau. More... | |
class | iterator |
An iterator over all boxes of a tableau, left to right, top to bottom. More... | |
class | iterator_base |
Public Types | |
typedef T | value_type |
Public Member Functions | |
virtual | ~filled_tableau () |
virtual unsigned int | number_of_rows () const |
virtual unsigned int | row_size (unsigned int row) const |
virtual void | add_box (unsigned int row) |
virtual void | remove_box (unsigned int row) |
std::pair< int, int > | find (const T &) const |
virtual void | clear () |
void | copy_shape (const tableau &) |
T & | operator() (unsigned int row, unsigned int col) |
const T & | operator() (unsigned int row, unsigned int col) const |
const T & | operator[] (unsigned int boxnum) const |
void | add_box (unsigned int rownum, T val) |
void | swap_columns (unsigned int c1, unsigned int c2) |
bool | compare_without_multiplicity (const filled_tableau< T > &other) const |
bool | has_nullifying_trace () const |
void | sort_within_columns () |
void | sort_columns () |
void | canonicalise () |
Sort equal-length columns and sort within columns. More... | |
std::pair< int, int > | nonstandard_loc () const |
template<class StrictWeakOrdering > | |
void | sort_within_columns (StrictWeakOrdering comp) |
template<class StrictWeakOrdering > | |
void | sort_columns (StrictWeakOrdering comp) |
template<class StrictWeakOrdering > | |
void | canonicalise (StrictWeakOrdering comp, bool only_col_ex=false) |
void | projector (combin::symmetriser< T > &, bool modulo_monoterm=false) const |
void | projector (combin::symmetriser< T > &, combin::range_vector_t &) const |
yngrat_t | projector_normalisation () const |
filled_tableau< T > & | operator= (const filled_tableau< T > &) |
in_column_iterator | begin_column (unsigned int column_number) |
in_column_iterator | end_column (unsigned int column_number) |
iterator | begin () const |
iterator | end () const |
template<class OutputIterator > | |
OutputIterator | Garnir_set (OutputIterator, unsigned int, unsigned int) const |
Public Member Functions inherited from yngtab::tableau | |
virtual | ~tableau () |
tableau & | operator= (const tableau &) |
Public Member Functions inherited from yngtab::tableau_base | |
tableau_base () | |
virtual | ~tableau_base () |
virtual unsigned int | column_size (unsigned int col) const |
virtual void | add_row (unsigned int row_size) |
yngint_t | dimension (unsigned int) const |
unsigned long | hook_length (unsigned int row, unsigned int col) const |
yngint_t | hook_length_prod () const |
Private Types | |
typedef std::vector< T > | box_row |
typedef std::vector< box_row > | row_stack |
Private Attributes | |
row_stack | rows |
Additional Inherited Members | |
Public Attributes inherited from yngtab::tableau_base | |
yngrat_t | multiplicity |
int | selfdual_column |
|
private |
|
private |
typedef T yngtab::filled_tableau< T >::value_type |
|
virtual |
|
virtual |
Reimplemented from yngtab::tableau.
void yngtab::filled_tableau< T >::add_box | ( | unsigned int | rownum, |
T | val | ||
) |
filled_tableau< T >::iterator yngtab::filled_tableau< T >::begin | ( | ) | const |
filled_tableau< T >::in_column_iterator yngtab::filled_tableau< T >::begin_column | ( | unsigned int | column_number | ) |
void yngtab::filled_tableau< T >::canonicalise | ( | ) |
Sort equal-length columns and sort within columns.
void yngtab::filled_tableau< T >::canonicalise | ( | StrictWeakOrdering | comp, |
bool | only_col_ex = false |
||
) |
|
virtual |
Reimplemented from yngtab::tableau.
bool yngtab::filled_tableau< T >::compare_without_multiplicity | ( | const filled_tableau< T > & | other | ) | const |
void yngtab::filled_tableau< T >::copy_shape | ( | const tableau & | other | ) |
filled_tableau< T >::iterator yngtab::filled_tableau< T >::end | ( | ) | const |
filled_tableau< T >::in_column_iterator yngtab::filled_tableau< T >::end_column | ( | unsigned int | column_number | ) |
std::pair< int, int > yngtab::filled_tableau< T >::find | ( | const T & | obj | ) | const |
OutputIterator yngtab::filled_tableau< T >::Garnir_set | ( | OutputIterator | it, |
unsigned int | row, | ||
unsigned int | col | ||
) | const |
bool yngtab::filled_tableau< T >::has_nullifying_trace | ( | ) | const |
std::pair< int, int > yngtab::filled_tableau< T >::nonstandard_loc | ( | ) | const |
|
virtual |
Reimplemented from yngtab::tableau.
T & yngtab::filled_tableau< T >::operator() | ( | unsigned int | row, |
unsigned int | col | ||
) |
const T & yngtab::filled_tableau< T >::operator() | ( | unsigned int | row, |
unsigned int | col | ||
) | const |
filled_tableau< T > & yngtab::filled_tableau< T >::operator= | ( | const filled_tableau< T > & | other | ) |
const T & yngtab::filled_tableau< T >::operator[] | ( | unsigned int | boxnum | ) | const |
void yngtab::filled_tableau< T >::projector | ( | combin::symmetriser< T > & | sym, |
bool | modulo_monoterm = false |
||
) | const |
void yngtab::filled_tableau< T >::projector | ( | combin::symmetriser< T > & | sym, |
combin::range_vector_t & | sublengths_scattered | ||
) | const |
anti-symmetrise over boxes in columns
yngrat_t yngtab::filled_tableau< T >::projector_normalisation | ( | ) | const |
|
virtual |
Reimplemented from yngtab::tableau.
|
virtual |
Reimplemented from yngtab::tableau.
void yngtab::filled_tableau< T >::sort_columns | ( | ) |
void yngtab::filled_tableau< T >::sort_columns | ( | StrictWeakOrdering | comp | ) |
void yngtab::filled_tableau< T >::sort_within_columns | ( | ) |
void yngtab::filled_tableau< T >::sort_within_columns | ( | StrictWeakOrdering | comp | ) |
void yngtab::filled_tableau< T >::swap_columns | ( | unsigned int | c1, |
unsigned int | c2 | ||
) |
|
private |