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>
9
10#include <string/LinearString.h>
11
12namespace stringology {
13
14namespace transform {
15
19public:
29 template < class SymbolType >
31};
32
33template < class SymbolType >
36
37 for ( unsigned index : indexes )
38 res.insert ( index + pattern.getContent ( ).size ( ) );
39
40 return res;
41}
42
43} /* namespace transform */
44
45} /* namespace stringology */
46
Definition: set.hpp:44
Linear string.
Definition: LinearString.h:57
const ext::vector< SymbolType > & getContent() const &
Definition: LinearString.h:238
Definition: BeginToEndIndex.h:18
static ext::set< unsigned > transform(const string::LinearString< SymbolType > &pattern, const ext::set< unsigned > &indexes)
Definition: BeginToEndIndex.h:34
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
Definition: ArithmeticCompression.h:18