BinaryKmerWriter< KVpair > | |
DisjointSet | Disjoint Set data structure. Helps to test the acyclicity of the graph during construction |
FileReader< keyType, valueType > | |
compressFileReader< keyType, valueType > | |
KmerFileReader< keyType, valueType > | |
MultivalueFileReaderWriter< keyType, valueType > | |
taxoTreeBuilder< keyType, valueType > | |
Hasher32< keyType > | A hash function that hashes keyType to uint32_t. When SSE4.2 support is found, use sse4.2 instructions, otherwise use default hash function std::hash |
IOHelper< keyType, valueType > | Interface for converting a key from its raw format to a keyTypeype. Split key into groups |
ConstantLengthKmerHelper< keyType, valueType > | IOHelper for Constant-Length Kmers |
IOHelper< keyType, IOvalueType > | |
KmerReader< keyType > | |
BinaryKmerReader< keyType > | |
SortedKmerTxtReader< keyType > | Read kmer from unsorted txt file and sort |
KmerReader< KVpair > | |
BinaryKmerReader< KVpair > | |
KVpair< keyType, valueType > | |
MulOth< keyType, IOvalueType > | Describes the data structure Grouped l-Othello. It classifies keys of keyType into 2^L classes. The keys are first classifed into groups, each group is then maintained by one l-Othello |
MulOthIndex< keyType > | MulOthIndex is a extended version of OthelloIndex, it supports more than 2^29 keys. The keys are first classifed into groups, each group is then maintained by one OthelloIndex |
Othello< keyType > | Describes the data structure l-Othello. It classifies keys of keyType into 2^L classes |
OthelloIndex< keyType > | OthelloIndex is a data structure that stores a minimum perfect hash function. For n keys, the query value of keys range in [0..n-1] Query always returns uint32_t |