SuffixTrieFactors.h

Go to the documentation of this file.

 
#pragma once
 
#include <indexes/stringology/SuffixTrie.h>
#include <string/LinearString.h>
 
namespace stringology {
 
namespace query {
 
class SuffixTrieFactors {
    template < class SymbolType >
    static void accumulateResult ( const ext::trie < SymbolType, std::optional < unsigned > > & trie, ext::set < unsigned > & res ) {
        if ( trie.getData ( ) )
            res.insert ( trie.getData ( ).value ( ) );
 
        for ( const std::pair < const SymbolType, ext::trie < SymbolType, std::optional < unsigned > > > & child : trie.getChildren ( ) ) {
            accumulateResult ( child.second, res );
        }
    }
 
public:
    template < class SymbolType >
    static ext::set < unsigned > query ( const indexes::stringology::SuffixTrie < SymbolType > & suffixTrie, const string::LinearString < SymbolType > & string );
 
};
 
template < class SymbolType >
ext::set < unsigned > SuffixTrieFactors::query ( const indexes::stringology::SuffixTrie < SymbolType > & suffixTrie, const string::LinearString < SymbolType > & string ) {
    const ext::trie < SymbolType, std::optional < unsigned > > * node = & suffixTrie.getRoot ( );
    for ( const SymbolType & symbol : string.getContent ( ) ) {
        auto iter = node->getChildren ( ).find ( symbol );
        if ( iter == node->getChildren ( ).end ( ) ) {
            return {};
        }
        node = & iter->second;
    }
 
    ext::set < unsigned > res;
    accumulateResult ( * node, res );
    return res;
}
 
} /* namespace query */
 
} /* namespace stringology */