Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
BeginToEndIndex.h
Go to the documentation of this file.
1
6#pragma once
7
8#include <alib/set>
10
13
14namespace arbology {
15
16namespace transform {
17
21public:
26 template < class SymbolType >
28 template < class SymbolType >
30
31};
32
33template < class SymbolType >
35 ext::vector < int > subjectSubtreeJumpTable = tree::properties::SubtreeJumpTable::compute ( subject );
37
38 for ( unsigned index : indexes )
39 res.insert ( subjectSubtreeJumpTable[index] );
40
41 return res;
42}
43
44template < class SymbolType >
46 ext::vector < int > subjectSubtreeJumpTable = tree::properties::SubtreeJumpTable::compute ( subject );
48
49 for ( unsigned index : indexes )
50 res.insert ( subjectSubtreeJumpTable[index] );
51
52 return res;
53}
54
55} /* namespace transform */
56
57} /* namespace arbology */
58
Definition: BeginToEndIndex.h:20
static ext::set< unsigned > transform(const tree::PrefixRankedBarTree< SymbolType > &subject, const ext::set< unsigned > &indexes)
Definition: BeginToEndIndex.h:34
Definition: set.hpp:44
Class extending the vector class from the standard library. Original reason is to allow printing of t...
Definition: vector.hpp:45
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
return res
Definition: MinimizeByPartitioning.h:145
ContainerType< ResType > transform(const ContainerType< InType, Ts ... > &in, Callback transform)
In container tranformation of all elements according to the tranform.
Definition: algorithm.hpp:150
Definition: CompressedBitParallelTreeIndex.h:40