Add registrations of all WildcardLinearString implementations in...

Add registrations of all WildcardLinearString implementations in stringology::matching::*Automaton classes.

alib2algo/src/stringology/matching/GeneralizedLevenshteinMatchingAutomaton.cpp

@@ -12,7 +12,10 @@ namespace stringology {
 namespace matching {
-auto GeneralizedLevenshteinMatchingAutomatonInstance = registration::AbstractRegister < GeneralizedLevenshteinMatchingAutomaton, automaton::EpsilonNFA < DefaultSymbolType, void, ext::pair<unsigned int, unsigned int> >, const string::LinearString < > & , unsigned int> ( GeneralizedLevenshteinMatchingAutomaton::construct );
+auto GeneralizedLevenshteinMatchingAutomatonLinearString = registration::AbstractRegister < GeneralizedLevenshteinMatchingAutomaton, automaton::EpsilonNFA < DefaultSymbolType, void, ext::pair<unsigned int, unsigned int> >, const string::LinearString < > & , unsigned int> ( GeneralizedLevenshteinMatchingAutomaton::construct );
+
+auto GeneralizedLevenshteinMatchingAutomatonWildcardLinearString = registration::AbstractRegister < GeneralizedLevenshteinMatchingAutomaton, automaton::EpsilonNFA < DefaultSymbolType, void, ext::pair<unsigned int, unsigned int> >, const string::WildcardLinearString < > & , unsigned int> ( GeneralizedLevenshteinMatchingAutomaton::construct );
+
 } /* namespace matching */

alib2algo/src/stringology/matching/GeneralizedLevenshteinSequenceMatchingAutomaton.cpp

@@ -14,6 +14,8 @@ namespace matching {
 auto GeneralizedLevenshteinSequenceMatchingAutomatonLinearString = registration::AbstractRegister <GeneralizedLevenshteinSequenceMatchingAutomaton, automaton::EpsilonNFA < DefaultSymbolType, void, ext::pair<unsigned int, unsigned int> >, const string::LinearString < > &, unsigned > ( GeneralizedLevenshteinSequenceMatchingAutomaton::construct );
+auto GeneralizedLevenshteinSequenceMatchingAutomatonWildcardLinearString = registration::AbstractRegister <GeneralizedLevenshteinSequenceMatchingAutomaton, automaton::EpsilonNFA < DefaultSymbolType, void, ext::pair<unsigned int, unsigned int> >, const string::WildcardLinearString < > &, unsigned > ( GeneralizedLevenshteinSequenceMatchingAutomaton::construct );
+
 } /* namespace matching */
 } /* namespace stringology */

alib2algo/src/stringology/matching/HammingMatchingAutomaton.cpp

@@ -14,6 +14,9 @@ namespace matching {
 auto HammingMatchingAutomatonLinearString = registration::AbstractRegister <HammingMatchingAutomaton, automaton::NFA < DefaultSymbolType, ext::pair<unsigned int, unsigned int> >, const string::LinearString < > &, unsigned > ( HammingMatchingAutomaton::construct );
+auto HammingMatchingAutomatonWildcardLinearString = registration::AbstractRegister <HammingMatchingAutomaton, automaton::NFA < DefaultSymbolType, ext::pair<unsigned int, unsigned int> >, const string::WildcardLinearString < > &, unsigned > ( HammingMatchingAutomaton::construct );
+
+
 } /* namespace matching */
 } /* namespace stringology */

alib2algo/src/stringology/matching/HammingSequenceMatchingAutomaton.cpp

@@ -14,6 +14,8 @@ namespace matching {
 auto HammingSequenceMatchingAutomatonLinearString = registration::AbstractRegister <HammingSequenceMatchingAutomaton, automaton::NFA < DefaultSymbolType, ext::pair<unsigned int, unsigned int> >, const string::LinearString < > &, unsigned > ( HammingSequenceMatchingAutomaton::construct );
+auto HammingSequenceMatchingAutomatonWildcardStringLinearString = registration::AbstractRegister <HammingSequenceMatchingAutomaton, automaton::NFA < DefaultSymbolType, ext::pair<unsigned int, unsigned int> >, const string::WildcardLinearString < > &, unsigned > ( HammingSequenceMatchingAutomaton::construct );
+
 } /* namespace matching */
 } /* namespace stringology */

alib2algo/src/stringology/matching/LevenshteinMatchingAutomaton.cpp

@@ -14,6 +14,8 @@ namespace matching {
 auto LevenshteinMatchingAutomatonLinearString = registration::AbstractRegister <LevenshteinMatchingAutomaton, automaton::EpsilonNFA < DefaultSymbolType, void, ext::pair<unsigned int, unsigned int>>, const string::LinearString < > &, unsigned > ( LevenshteinMatchingAutomaton::construct );
+auto LevenshteinMatchingAutomatonWildcardLinearString = registration::AbstractRegister <LevenshteinMatchingAutomaton, automaton::EpsilonNFA < DefaultSymbolType, void, ext::pair<unsigned int, unsigned int>>, const string::WildcardLinearString < > &, unsigned > ( LevenshteinMatchingAutomaton::construct );
+
 } /* namespace matching */
 } /* namespace stringology */

alib2algo/src/stringology/matching/LevenshteinSequenceMatchingAutomaton.cpp

@@ -14,6 +14,8 @@ namespace matching {
 auto LevenshteinSequenceMatchingAutomatonLinearString = registration::AbstractRegister <LevenshteinSequenceMatchingAutomaton, automaton::EpsilonNFA < DefaultSymbolType, void, ext::pair<unsigned int, unsigned int> >, const string::LinearString < > &, unsigned > ( LevenshteinSequenceMatchingAutomaton::construct );
+auto LevenshteinSequenceMatchingAutomatonWildcardLinearString = registration::AbstractRegister <LevenshteinSequenceMatchingAutomaton, automaton::EpsilonNFA < DefaultSymbolType, void, ext::pair<unsigned int, unsigned int> >, const string::WildcardLinearString < > &, unsigned > ( LevenshteinSequenceMatchingAutomaton::construct );
+
 } /* namespace matching */
 } /* namespace stringology */