Marmote Core
The project aims at realizing the prototype of a software environment dedicated to modeling with Markov chains.
marmoteInterval.h
1 /* marmoteInterval.h ---
2  *
3  * Author: Alain Jean-Marie
4  */
5 
6 /* Commentary:
7  *
8  */
9 
10 /* Change log:
11  *
12  */
13 
14 
15 #ifndef MARMOTEINTERVAL_H
16 #define MARMOTEINTERVAL_H
17 #include "marmoteSet.h"
18 
24 
25  protected:
26  int _min;
27  int _max;
29  public:
37  marmoteInterval( int min, int max );
38 
39  public:
45  bool isFinite() { return true; };
46  bool isZero(int* buffer);
51  void firstState(int* buffer);
55  void nextState(int *buffer);
59  void decodeState(int index, int* buf);
63  int index(int* buf);
67  void printState(FILE* out, int *buffer);
68 
69  public:
74  void enumerate();
75 
76 };
77 
78 #endif // MARMOTEINTERVAL_H
void enumerate()
Enumeration procedure.
marmoteInterval(int min, int max)
Definition: marmoteInterval.cpp:20
bool isFinite()
Test if the set is finite. These sets always are.
Definition: marmoteInterval.h:45
void printState(FILE *out, int *buffer)
Definition: marmoteInterval.cpp:79
int index(int *buf)
Definition: marmoteInterval.cpp:71
void decodeState(int index, int *buf)
Definition: marmoteInterval.cpp:65
void firstState(int *buffer)
Initializes some state buffer with the first state of the set.
Definition: marmoteInterval.cpp:51
int _min
Definition: marmoteInterval.h:26
The mother class representing abstract sets.
Definition: marmoteSet.h:33
int _max
Definition: marmoteInterval.h:27
void nextState(int *buffer)
Procedure to compute the state following a given state in the set order. The new state is computed in...
Definition: marmoteInterval.cpp:57
The class describing a finite integer interval.
Definition: marmoteInterval.h:23