| |
Version 4.0.0 |
#include <Coder.h>
Public Member Functions | |
| Coder (short order, short size) | |
| constructor with the markovian order+1 == length of words and the size of the alphabet | |
| Coder (short order, short size, long first_code, short sizeword) | |
| Coder () | |
| empty constructor | |
| Coder (const Coder &c) | |
| copy constructor | |
| ~Coder () | |
| destructor | |
| void | init (long code, short sizeword) |
| intial code is an initial word of size sizeword | |
| void | init (long code) |
| intial code is an initial word. The size sizeword is computed. | |
| void | init (const vector< short > &X) |
| initial by coding the word X, using only the last _order+1 | |
| void | init (const short *X) |
| initial by coding the word "X(-_order)...X(-1)X(0)" | |
| void | restrict_init (const short *X, short pseudo_order) |
| initial by coding the word "X(-pseudo_order)...X(1)X(0)" | |
| void | clear () |
| put code down to -1 | |
| void | push_back (short i) |
| add a letter at the end of the coded-word | |
| long | virtual_push_back (short i) const |
| return the code obtained by adding a letter at the end of the coded-word but don't touch _code | |
| void | push_front (short i) |
| add a letter at the beginning of the coded-word | |
| long | virtual_push_front (short i) const |
| return the code obtained by adding a letter at the beginning of the coded-word but don't touch _code | |
| void | erase_back () |
| erase the last letter | |
| short | pop_back () |
| erase the last letter of the coded-word and return it | |
| void | erase_front () |
| erase the first letter of the coded-word | |
| short | pop_front () |
| erase the first letter and return it | |
| bool | empty () const |
| checks if coder is empty (no word coded) | |
| short | length () const |
| length of the current coded word | |
| long | tell_nbvalue () const |
| return nb of possible codes == words from a singleton to a order+1-word | |
| long | tell_jump (short i) const |
| return the ith jump to codes of word of i (and more than i) letters | |
| long | tell_jump () const |
| return the ith jump to codes of word of _order+1 letters | |
| long * | get_jump () const |
| allows a const access to the vector jump | |
| vector< long > & | list_suffixed (short sizeprefix) |
| returns the vector of the code of words suffixed by the current _code with prefixes of size sizeprefix | |
| vector< long > & | list_suffixed () |
| returns the vector of the code of words suffixed by the current _code with prefixes adapted to (_order+1)-words | |
| vector< long > & | bound_prefixed (short sizesuffix) |
| returns in a vect the 2 bound-codes between them all (including both of them) codes are prefixed by the current _code with suffixes of size sizesuffix | |
| vector< long > & | bound_prefixed () |
| returns in a vect the 2 bound-codes between them all (including both of them) codes are prefixed by the current _code with suffixes adapted to (_order+1)-words | |
Public Attributes | |
| long | _code |
| code | |
| short | _sizeword |
| size of the coded word | |
Management of a code related to a word
|
||||||||||||||||||||
|
constructor with the markovian order+1 == length of words and the size of the alphabet first_code is an initial word of size sizeword |
| Download seq++ 4.0.0 |
| Download previous versions |
| Statistique & Genome Home |
| Contributors : M.Baudry, P.Y.Bourguignon, M.Hoebeke, V.Miele, P.Nicolas, G.Nuel, H.Richard, D.Robelin |
1.3.9.1