SuffixAutomaton.h

Go to the documentation of this file.

 
/*
 * This file is part of Algorithms library toolkit.
 * Copyright (C) 2017 Jan Travnicek (jan.travnicek@fit.cvut.cz)
 
 * Algorithms library toolkit is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 
 * Algorithms library toolkit is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 
 * You should have received a copy of the GNU General Public License
 * along with Algorithms library toolkit.  If not, see <http://www.gnu.org/licenses/>.
 */
 
#pragma once
 
#include <ext/iostream>
 
#include <alib/string>
#include <alib/set>
 
#include <common/DefaultSymbolType.h>
 
#include <alphabet/common/SymbolNormalize.h>
 
#include <automaton/FSM/DFA.h>
 
namespace indexes {
 
namespace stringology {
 
class GeneralAlphabet;
 
template < class SymbolType = DefaultSymbolType >
class SuffixAutomaton final {
    automaton::DFA < SymbolType, unsigned > m_automaton;
 
    unsigned m_backboneLength;
 
public:
    explicit SuffixAutomaton ( automaton::DFA < SymbolType, unsigned > automaton, unsigned backboneLength );
 
    const automaton::DFA < SymbolType, unsigned > & getAutomaton ( ) const &;
 
    automaton::DFA < SymbolType, unsigned > && getAutomaton ( ) &&;
 
    const ext::set < SymbolType > & getAlphabet ( ) const & {
        return m_automaton.getInputAlphabet ( );
    }
 
    ext::set < SymbolType > && getAlphabet ( ) && {
        return std::move ( m_automaton ).getInputAlphabet ( );
    }
 
    bool removeSymbolFromAlphabet ( const SymbolType & symbol ) {
        return m_automaton.removeInputSymbol ( symbol );
    }
 
    unsigned getBackboneLength ( ) const {
        return m_backboneLength;
    }
 
    auto operator <=> ( const SuffixAutomaton & other ) const {
        return std::tie ( getAutomaton ( ) ) <=> std::tie ( other.getAutomaton ( ) );
    }
 
    bool operator == ( const SuffixAutomaton & other ) const {
        return std::tie ( getAutomaton ( ) ) == std::tie ( other.getAutomaton ( ) );
    }
 
    friend ext::ostream & operator << ( ext::ostream & out, const SuffixAutomaton & instance ) {
        return out << "(SuffixAutomaton " << instance.m_automaton << ")";
    }
 
    explicit operator automaton::DFA < SymbolType, unsigned > ( ) const;
};
 
} /* namespace stringology */
 
} /* namespace indexes */
 
namespace indexes {
 
namespace stringology {
 
template < class SymbolType >
SuffixAutomaton < SymbolType >::SuffixAutomaton ( automaton::DFA < SymbolType, unsigned > automaton, unsigned backboneLength ) : m_automaton ( std::move ( automaton ) ), m_backboneLength ( backboneLength ) {
}
 
template < class SymbolType >
const automaton::DFA < SymbolType, unsigned > & SuffixAutomaton < SymbolType >::getAutomaton ( ) const & {
    return m_automaton;
}
 
template < class SymbolType >
automaton::DFA < SymbolType, unsigned > && SuffixAutomaton < SymbolType >::getAutomaton ( ) && {
    return std::move ( m_automaton );
}
 
template < class SymbolType >
SuffixAutomaton < SymbolType >::operator automaton::DFA < SymbolType, unsigned > ( ) const {
    return getAutomaton ( );
}
 
} /* namespace stringology */
 
} /* namespace indexes */
 
namespace core {
 
template < class SymbolType >
struct normalize < indexes::stringology::SuffixAutomaton < SymbolType > > {
    static indexes::stringology::SuffixAutomaton < > eval ( indexes::stringology::SuffixAutomaton < SymbolType > && value ) {
        ext::set < DefaultSymbolType > alphabet = alphabet::SymbolNormalize::normalizeAlphabet ( std::move ( std::move ( value ).getAutomaton ( ) ).getInputAlphabet ( ) );
        ext::set < unsigned > states = std::move ( std::move ( value ).getAutomaton ( ) ).getStates ( );
        unsigned initialState = std::move ( std::move ( value ).getAutomaton ( ) ).getInitialState ( );
        ext::set < unsigned > finalStates = std::move ( std::move ( value ).getAutomaton ( ) ).getFinalStates ( );
 
        automaton::DFA < DefaultStateType, unsigned > res ( std::move ( states ), std::move ( alphabet ), initialState, std::move ( finalStates ) );
 
        for ( std::pair < ext::pair < unsigned, SymbolType >, unsigned > && transition : ext::make_mover ( std::move ( std::move ( value ).getAutomaton ( ) ).getTransitions ( ) ) ) {
            unsigned from = transition.first.first;
            DefaultSymbolType input = alphabet::SymbolNormalize::normalizeSymbol ( std::move ( transition.first.second ) );
            unsigned to = transition.second;
 
            res.addTransition ( from, std::move ( input ), to );
        }
 
        return indexes::stringology::SuffixAutomaton < > ( std::move ( res ), std::move ( value ).getBackboneLength ( ) );
    }
};
 
} /* namespace core */