Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
RestrictedApproximateCoversComputation.h
Go to the documentation of this file.
1
6#pragma once
7
8#include <string/LinearString.h>
10
11namespace stringology::cover {
12
14public:
22 template < class SymbolType >
23 static ext::set < ext::pair < string::LinearString < SymbolType >, unsigned int > > compute ( const string::LinearString < SymbolType > & pattern, unsigned int k );
24};
25
26template < class SymbolType >
29}
30
31} /* namespace stringology::cover */
32
Definition: set.hpp:44
Linear string.
Definition: LinearString.h:57
static ext::set< ext::pair< string::LinearString< SymbolType >, unsigned > > compute(const string::LinearString< SymbolType > &pattern, unsigned k, bool restricted=false)
Definition: ApproximateCoversComputation.h:49
Definition: RestrictedApproximateCoversComputation.h:13
static ext::set< ext::pair< string::LinearString< SymbolType >, unsigned int > > compute(const string::LinearString< SymbolType > &pattern, unsigned int k)
Definition: RestrictedApproximateCoversComputation.h:27
Definition: ApproximateCoversComputation.cpp:9