Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
|
#include <CompressedBitParallelTreeIndex.h>
Static Public Member Functions | |
static bool | used (const indexes::arbology::CompressedBitParallelTreeIndex< common::ranked_symbol< SymbolType > > &index, const common::ranked_symbol< SymbolType > &symbol) |
static bool | available (const indexes::arbology::CompressedBitParallelTreeIndex< SymbolType > &, const common::ranked_symbol< SymbolType > &) |
static void | valid (const indexes::arbology::CompressedBitParallelTreeIndex< SymbolType > &, const common::ranked_symbol< SymbolType > &) |
Helper class specifying constraints for the internal alphabet component of the index.
SymbolType | used for the symbol part of the ranked symbol |
|
inlinestatic |
Returns true as all symbols are possibly available to be elements of the alphabet.
index | the tested index |
symbol | the tested symbol |
|
inlinestatic |
Returns true if the symbol is still used as key in mapping symbol to bit vector.
index | the tested index |
symbol | the tested symbol |
|
inlinestatic |
All symbols are valid as symbols of the alphabet.
index | the tested index |
symbol | the tested symbol |