template nondeterminstic exact suffix automaton construction algorithm

alib2algo/src/stringology/indexing/NondeterministicExactSuffixAutomaton.cpp

@@ -9,23 +9,6 @@ namespace stringology {
 namespace indexing {
-automaton::EpsilonNFA < DefaultSymbolType, DefaultEpsilonType, unsigned > NondeterministicExactSuffixAutomaton::construct ( const string::LinearString < > & pattern ) {
-	automaton::EpsilonNFA < DefaultSymbolType, DefaultEpsilonType, unsigned > nfaSuffixAutomaton ( 0 );
-
-	nfaSuffixAutomaton.setInputAlphabet ( pattern.getAlphabet ( ) );
-
-	unsigned i = 0;
-	for ( const DefaultSymbolType & symbol : pattern.getContent ( ) ) {
-		nfaSuffixAutomaton.addState ( i++ );
-		nfaSuffixAutomaton.addTransition ( i - 1, symbol, i );
-		nfaSuffixAutomaton.addTransition ( 0, i );
-	}
-
-	nfaSuffixAutomaton.addFinalState ( i );
-
-	return nfaSuffixAutomaton;
-}
-
 auto SuffixAutomatonNondeterministicLinearString = registration::AbstractRegister < NondeterministicExactSuffixAutomaton, automaton::EpsilonNFA < DefaultSymbolType, DefaultEpsilonType, unsigned >, const string::LinearString < > & > ( NondeterministicExactSuffixAutomaton::construct );
 } /* namespace indexing */

alib2algo/src/stringology/indexing/NondeterministicExactSuffixAutomaton.h

@@ -18,10 +18,29 @@ public:
 	 * Nondeterministic construction of nondeterministic suffix automaton for given pattern.
 	 * @return nondeterministic suffix automaton for given pattern.
 	 */
-	static automaton::EpsilonNFA < DefaultSymbolType, DefaultEpsilonType, unsigned > construct ( const string::LinearString < > & pattern );
+	template < class SymbolType >
+	static automaton::EpsilonNFA < SymbolType, DefaultEpsilonType, unsigned > construct ( const string::LinearString < SymbolType > & pattern );
 };
+template < class SymbolType >
+automaton::EpsilonNFA < SymbolType, DefaultEpsilonType, unsigned > NondeterministicExactSuffixAutomaton::construct ( const string::LinearString < SymbolType > & pattern ) {
+	automaton::EpsilonNFA < SymbolType, DefaultEpsilonType, unsigned > nfaSuffixAutomaton ( 0 );
+
+	nfaSuffixAutomaton.setInputAlphabet ( pattern.getAlphabet ( ) );
+
+	unsigned i = 0;
+	for ( const SymbolType & symbol : pattern.getContent ( ) ) {
+		nfaSuffixAutomaton.addState ( i++ );
+		nfaSuffixAutomaton.addTransition ( i - 1, symbol, i );
+		nfaSuffixAutomaton.addTransition ( 0, i );
+	}
+
+	nfaSuffixAutomaton.addFinalState ( i );
+
+	return nfaSuffixAutomaton;
+}
+
 } /* namespace indexing */
 } /* namespace stringology */