|
Augustus 3.4.0
|
data structure to store possible endOfPred positions to iterate directly only over those endOfPred positions, that are possible in the inner loop of the Viterbi algorithm. More...
#include <statemodel.hh>
Public Member Functions | |
| void | clear () |
| void | init () |
| void | decrement (int &endOfPred) |
| void | update (int endOfPred) |
Public Attributes | |
| list< int > | possibleEndOfPreds |
| list< int >::iterator | eopit |
| bool | inCache |
data structure to store possible endOfPred positions to iterate directly only over those endOfPred positions, that are possible in the inner loop of the Viterbi algorithm.