arbology::indexing::FullAndLinearIndexConstruction Class Reference

#include <FullAndLinearIndexConstruction.h>

Static Public Member Functions
template<class SymbolType , template< typename > class StringIndex = indexes::stringology::PositionHeap, class StringIndexConstructionAlgo = stringology::indexing::PositionHeapNaive>
static indexes::arbology::FullAndLinearIndex< SymbolType, StringIndex >	construct (const tree::PrefixRankedTree< SymbolType > &w)
template<class SymbolType , template< typename > class StringIndex = indexes::stringology::PositionHeap, class StringIndexConstructionAlgo = stringology::indexing::PositionHeapNaive>
static indexes::arbology::FullAndLinearIndex< SymbolType, StringIndex >	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 , template< typename > class StringIndex, class StringIndexConstructionAlgo >

indexes::arbology::FullAndLinearIndex< SymbolType, StringIndex > arbology::indexing::FullAndLinearIndexConstruction::construct ( const tree::PrefixRankedBarTree< SymbolType > &  w )

static

Here is the call graph for this function:

construct() [2/2]

template<class SymbolType , template< typename > class StringIndex, class StringIndexConstructionAlgo >

indexes::arbology::FullAndLinearIndex< SymbolType, StringIndex > arbology::indexing::FullAndLinearIndexConstruction::construct ( const tree::PrefixRankedTree< SymbolType > &  w )

static

Creates compressed bit parallel index for trees

Parameters

tree	tree 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:

• alib2algo/src/arbology/indexing/FullAndLinearIndexConstruction.h