Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
Static Public Member Functions
arbology::indexing::CompressedBitParallelIndexConstruction Class Reference

#include <CompressedBitParallelIndexConstruction.h>

Static Public Member Functions

template<class SymbolType >
static indexes::arbology::CompressedBitParallelTreeIndex< SymbolType > construct (const tree::PrefixRankedTree< SymbolType > &w)
 
template<class SymbolType >
static indexes::arbology::CompressedBitParallelTreeIndex< SymbolType > construct (const tree::PrefixRankedBarTree< SymbolType > &w)
 

Detailed Description

Constructs a compressed bit parallel index for given tree.

Member Function Documentation

◆ construct() [1/2]

template<class SymbolType >
indexes::arbology::CompressedBitParallelTreeIndex< SymbolType > arbology::indexing::CompressedBitParallelIndexConstruction::construct ( const tree::PrefixRankedBarTree< SymbolType > &  w)
static
Here is the call graph for this function:

◆ construct() [2/2]

template<class SymbolType >
indexes::arbology::CompressedBitParallelTreeIndex< SymbolType > arbology::indexing::CompressedBitParallelIndexConstruction::construct ( const tree::PrefixRankedTree< SymbolType > &  w)
static

Creates compressed bit parallel index for trees

Parameters
treetree to construct the index for
Returns
the index
Here is the call graph for this function:

The documentation for this class was generated from the following file: