Class
RankDictionary
A rank dictionary is a data structure to store the rank of an element of a sequence at every position of the
sequence.
RankDictionary | |||||||||||||||||
![]() | ![]() | ||||||||||||||||
| |||||||||||||||||
Include Headers
seqan/index.h
Parameters
The rank dictionary specialisation. Default: WaveletTree |
Specializations
| The string set bit string dictionary is a string set of rank support bit strings for constant time acces of the rank of a specified character at a specified position. | |
| A wavelet tree is a tree like binary encoding of a text. |
Metafunctions
| Type of a specific container member (fibre). |
Functions
| Clears the rank dictionary. | |
| Returns the number of occurrences of a specified character from the start to a specified position. | |
| This functions creates the dictionary. | |
| This functions creates the dictionary structure. | |
| Returns whether or not the rank dictionary is empty. | |
| Returns a specific fibre of a dictionary. | |
| Returns the character used to substitute the sentinel sign. | |
| Returns the character of a specified position. | |
| This functions loads a dictionary from disk. | |
| This functions saves a dictionary to disk. | |
| Sets the sentinel position.. | |
| Sets the character used to substitute the sentinel sign. |
SeqAn - Sequence Analysis Library - www.seqan.de
