NonlinearCompressedBitParallelTreeIndex.h File Reference

#include <alib/set>
#include <alib/map>
#include <alib/string>
#include <common/ranked_symbol.hpp>
#include <core/components.hpp>
#include <exception/CommonException.h>
#include <common/SparseBoolVector.hpp>
#include <alphabet/common/SymbolNormalize.h>

Include dependency graph for NonlinearCompressedBitParallelTreeIndex.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Data Structures
class	indexes::arbology::NonlinearCompressedBitParallelTreeIndex< SymbolType >
	Compressed bit parallel nonlinear tree index. Stores a bit vector for each symbol of the alphabet. The bit vector of symbol a contains true on index i if symbol a is on i-th position in the indexed string. The class does not check whether the bit vectors actually represent valid index. The bit vectors are compressed with run length encoding packing runs of false values. Additionally the index contains a subtree jump table representing positions after a jump over a subtree. The index is supposed to be able to provide data to search for nonlinear tree patterns. Therefore it also contains representation of subtree repeats. More...
class	core::SetConstraint< indexes::arbology::NonlinearCompressedBitParallelTreeIndex< SymbolType >, common::ranked_symbol< SymbolType >, indexes::arbology::GeneralAlphabet >
struct	core::normalize< indexes::arbology::NonlinearCompressedBitParallelTreeIndex< SymbolType > >

Namespaces
namespace	indexes
namespace	indexes::arbology
namespace	core