A combinatorial chain. More...
#include <combchain.h>
Public Types | |
| typedef CellT | CellType |
| The type of cells in the combinatorial chain. | |
Public Member Functions | |
| tCombChain () | |
| The default constructor of an empty combinatorial chain. | |
| tCombChain (const CellT &c) | |
| The constructor of a combinatorial chain containing one cell. | |
| int_t | size () const |
| Returns the number of elements in the combinatorial chain. | |
| bool | empty () const |
| Returns true if and only if the chain is zero (empty set). | |
| const CellT & | operator[] (int_t n) const |
| Returns the n-th element of the combinatorial chain. | |
| int_t | position (const CellT &c) const |
| Returns the position of the given cell in the chain or -1 if the cell is not there. | |
| bool | contains (const CellT &c) const |
| Checks if the given cell appears in the chain. | |
| void | add (const CellT &c) |
| Adds a given cell to the combinatorial chain. | |
| void | add (const tCombChain< CellT > &ch) |
| Adds a given chain to the combinatorial chain. | |
| bool | operator== (const tCombChain< CellT > &ch) const |
| Compares if the two chains are equal. | |
| void | swap (tCombChain< CellT > &ch) |
| Swaps the data with another chain. | |
Private Attributes | |
| chomp::homology::hashedset< CellT > | cells |
| The set of elements in the combinatorial chain. | |
A combinatorial chain.
This is in fact a finite set of cells. It corresponds to chains with coefficients in F_2 (a.k.a. Z_2).
Definition at line 48 of file combchain.h.
| typedef CellT tCombChain< CellT >::CellType |
The type of cells in the combinatorial chain.
Definition at line 52 of file combchain.h.
| tCombChain< CellT >::tCombChain | ( | ) | [inline] |
The default constructor of an empty combinatorial chain.
Definition at line 97 of file combchain.h.
| tCombChain< CellT >::tCombChain | ( | const CellT & | c ) | [inline, explicit] |
The constructor of a combinatorial chain containing one cell.
Definition at line 104 of file combchain.h.
References tCombChain< CellT >::add(), and tCombChain< CellT >::cells.
| void tCombChain< CellT >::add | ( | const CellT & | c ) | [inline] |
Adds a given cell to the combinatorial chain.
Definition at line 142 of file combchain.h.
Referenced by tCombChain< CellT >::tCombChain().
| void tCombChain< CellT >::add | ( | const tCombChain< CellT > & | ch ) | [inline] |
Adds a given chain to the combinatorial chain.
Definition at line 153 of file combchain.h.
| bool tCombChain< CellT >::contains | ( | const CellT & | c ) | const [inline] |
Checks if the given cell appears in the chain.
Definition at line 136 of file combchain.h.
| bool tCombChain< CellT >::empty | ( | ) | const [inline] |
Returns true if and only if the chain is zero (empty set).
Definition at line 118 of file combchain.h.
| bool tCombChain< CellT >::operator== | ( | const tCombChain< CellT > & | ch ) | const [inline] |
Compares if the two chains are equal.
Definition at line 162 of file combchain.h.
| const CellT & tCombChain< CellT >::operator[] | ( | int_t | n ) | const [inline] |
Returns the n-th element of the combinatorial chain.
Definition at line 124 of file combchain.h.
| int_t tCombChain< CellT >::position | ( | const CellT & | c ) | const [inline] |
Returns the position of the given cell in the chain or -1 if the cell is not there.
Definition at line 130 of file combchain.h.
| int_t tCombChain< CellT >::size | ( | ) | const [inline] |
Returns the number of elements in the combinatorial chain.
Definition at line 112 of file combchain.h.
| void tCombChain< CellT >::swap | ( | tCombChain< CellT > & | ch ) | [inline] |
Swaps the data with another chain.
Definition at line 178 of file combchain.h.
chomp::homology::hashedset<CellT> tCombChain< CellT >::cells [private] |
The set of elements in the combinatorial chain.
Definition at line 90 of file combchain.h.
Referenced by tCombChain< CellT >::tCombChain().
1.7.2