Marmote Core
The project aims at realizing the prototype of a software environment dedicated to modeling with Markov chains.
|
The mother class representing abstract sets. More...
#include <marmoteSet.h>
Public Member Functions | |
marmoteSet (marmoteSet **list, int nb, opType t) | |
Constructor for composite sets, from smaller sets. More... | |
virtual | ~marmoteSet () |
virtual long int | cardinal () |
Cardinal of the set. More... | |
virtual bool | isFinite ()=0 |
Test if the set is finite. More... | |
bool | isSimple () |
Test if the set is a simple, elementary set. More... | |
bool | isUnion () |
Test if the set is a composite, product set. More... | |
bool | isProduct () |
Test if the set is a composite, product set. More... | |
int | totNbDims () |
Read accessor to the total number of dimensions. More... | |
virtual void | enumerate () |
Enumerates the set: lists all elements of the set. PROBLEM: enumerate where? in a file? to be specified more precisely. More... | |
virtual void | firstState (int *buffer) |
virtual void | nextState (int *buffer) |
Procedure to compute the state following a given state in the set order. The new state is computed in place: the original state is erased. By convention, the state following the last state is the first state. More... | |
virtual void | decodeState (int index, int *buffer) |
virtual bool | isZero (int *buffer) |
virtual void | printState (FILE *out, int *buffer) |
virtual void | printState (FILE *out, int index) |
marmoteSet (marmoteSet **list, int nb, opType t) | |
Constructor for composite sets, from smaller sets. More... | |
virtual | ~marmoteSet () |
virtual long int | cardinal () |
Cardinal of the set. More... | |
virtual bool | isFinite ()=0 |
Test if the set is finite. More... | |
bool | isSimple () |
Test if the set is a simple, elementary set. More... | |
bool | isUnion () |
Test if the set is a composite, product set. More... | |
bool | isProduct () |
Test if the set is a composite, product set. More... | |
int | totNbDims () |
Read accessor to the total number of dimensions. More... | |
virtual void | enumerate () |
Enumerates the set: lists all elements of the set. PROBLEM: enumerate where? in a file? to be specified more precisely. More... | |
virtual void | firstState (int *buffer) |
virtual void | nextState (int *buffer) |
Procedure to compute the state following a given state in the set order. The new state is computed in place: the original state is erased. By convention, the state following the last state is the first state. More... | |
virtual void | decodeState (int index, int *buffer) |
virtual bool | isZero (int *buffer) |
virtual void | printState (FILE *out, int *buffer) |
virtual void | printState (FILE *out, int index) |
Protected Attributes | |
bool | _isSimple |
bool | _isUnion |
bool | _isProduct |
int | _nbDimensions |
int | _nbZones |
long int | _cardinal |
marmoteSet ** | _zone |
marmoteSet ** | _dimension |
int * | _zeroState |
The mother class representing abstract sets.
marmoteSet::marmoteSet | ( | marmoteSet ** | list, |
int | nb, | ||
opType | t | ||
) |
Constructor for composite sets, from smaller sets.
list | the list of elements in the composite |
nb | the number of elements in the composite |
t | the type of composite: UNION or PRODUCT |
|
virtual |
Destructor for general sets. Essentially for composite structures.
marmoteSet::marmoteSet | ( | marmoteSet ** | list, |
int | nb, | ||
opType | t | ||
) |
Constructor for composite sets, from smaller sets.
list | the list of elements in the composite |
nb | the number of elements in the composite |
t | the type of composite: UNION or PRODUCT |
|
virtual |
Destructor for general sets. Essentially for composite structures.
|
virtual |
Cardinal of the set.
|
virtual |
Cardinal of the set.
|
virtual |
Enumerates the set: lists all elements of the set. PROBLEM: enumerate where? in a file? to be specified more precisely.
Reimplemented in marmoteInterval, and marmoteInterval.
|
virtual |
Enumerates the set: lists all elements of the set. PROBLEM: enumerate where? in a file? to be specified more precisely.
Reimplemented in marmoteInterval, and marmoteInterval.
|
pure virtual |
Test if the set is finite.
Implemented in marmoteInterval, marmoteBox, marmoteInterval, and marmoteBox.
|
pure virtual |
Test if the set is finite.
Implemented in marmoteInterval, marmoteBox, marmoteInterval, and marmoteBox.
|
inline |
Test if the set is a composite, product set.
|
inline |
Test if the set is a composite, product set.
|
inline |
Test if the set is a simple, elementary set.
|
inline |
Test if the set is a simple, elementary set.
|
inline |
Test if the set is a composite, product set.
|
inline |
Test if the set is a composite, product set.
|
virtual |
Procedure to compute the state following a given state in the set order. The new state is computed in place: the original state is erased. By convention, the state following the last state is the first state.
buffer | the reference state |
Reimplemented in marmoteBox, marmoteInterval, marmoteBox, and marmoteInterval.
|
virtual |
Procedure to compute the state following a given state in the set order. The new state is computed in place: the original state is erased. By convention, the state following the last state is the first state.
buffer | the reference state |
Reimplemented in marmoteBox, marmoteInterval, marmoteBox, and marmoteInterval.
|
inline |
Read accessor to the total number of dimensions.
|
inline |
Read accessor to the total number of dimensions.
|
protected |
cardinal of the set
|
protected |
array of dimensions, in case of a product
|
protected |
indicator that the set is a cartesian product of other sets
|
protected |
indicator that the set is simple (elementary)
|
protected |
indicator that the set is a union of other sets
|
protected |
number of dimensions if this is a product
|
protected |
number of subsets if this is a union
|
protected |
the representation of the initial state (static)
|
protected |
array of zones, in case of a union