Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
FullAndLinearIndexConstruction.h
Go to the documentation of this file.
1
6#pragma once
7
13
14namespace arbology {
15
16namespace indexing {
17
24public:
30 template < class SymbolType, template < typename > class StringIndex = indexes::stringology::PositionHeap, class StringIndexConstructionAlgo = stringology::indexing::PositionHeapNaive >
32
33 template < class SymbolType, template < typename > class StringIndex = indexes::stringology::PositionHeap, class StringIndexConstructionAlgo = stringology::indexing::PositionHeapNaive >
35};
36
37template < class SymbolType, template < typename > class StringIndex, class StringIndexConstructionAlgo >
40}
41
42template < class SymbolType, template < typename > class StringIndex, class StringIndexConstructionAlgo >
45}
46
47} /* namespace indexing */
48
49} /* namespace arbology */
50
Definition: FullAndLinearIndexConstruction.h:23
static indexes::arbology::FullAndLinearIndex< SymbolType, StringIndex > construct(const tree::PrefixRankedTree< SymbolType > &w)
Definition: FullAndLinearIndexConstruction.h:38
Definition: ranked_symbol.hpp:20
Full and linear tree index. The index serves as a adaptor of string index so that searching for tree ...
Definition: FullAndLinearIndex.h:49
Position heap string index. Tree like representation of all suffixes. The suffixes are themselves rep...
Definition: PositionHeap.h:56
Linear string.
Definition: LinearString.h:57
Definition: PositionHeapNaive.h:23
Tree structure represented as linear sequece as result of preorder traversal with additional bar symb...
Definition: PrefixRankedBarTree.h:78
Tree structure represented as linear sequece as result of preorder traversal. The representation is s...
Definition: PrefixRankedTree.h:71
static ext::vector< int > compute(const tree::PrefixRankedBarTree< SymbolType > &subject)
Definition: SubtreeJumpTable.h:49
Definition: BoyerMooreHorspool.h:22