simplify SuffixTrie and PositionHeap create algos

alib2algo/src/stringology/indexing/PositionHeapNaive.h

@@ -47,7 +47,7 @@ indexes::PositionHeap < SymbolType > PositionHeapNaive::construct ( const string
 		unsigned k = i - 1;
 		std::trie < SymbolType, unsigned > * n = & trie;
-		while ( k < w.getContent ( ).size ( ) && n->getChildren ( ).count ( w.getContent ( )[k] ) )
+		while ( n->getChildren ( ).count ( w.getContent ( )[k] ) )
 			n = & n->getChildren ( ).find ( w.getContent ( )[k++] )->second;
 		unsigned node = w.getContent ( ).size ( ) - i + 1;

alib2algo/src/stringology/indexing/SuffixTrieNaive.h

@@ -46,7 +46,7 @@ indexes::SuffixTrie < SymbolType > SuffixTrieNaive::construct ( const string::Li
 		std::trie < SymbolType, std::variant < void, unsigned > > * n = & trie;
 		 // inlined slow_find_one from MI-EVY lectures
-		while ( k < w.getContent ( ).size ( ) && n->getChildren ( ).count ( w.getContent ( )[k] ) )
+		while ( n->getChildren ( ).count ( w.getContent ( )[k] ) )
 			n = & n->getChildren ( ).find ( w.getContent ( )[k++] )->second;
 		for ( ; k < w.getContent ( ).size ( ); k++ ) {