FormalRTEIteration.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 "FormalRTEElement.h"
#include "FormalRTESymbolSubst.h"
 
#include <exception/CommonException.h>
 
#include <ext/utility>
 
namespace rte {
 
template < class SymbolType >
class FormalRTEIteration : public ext::UnaryNode < FormalRTEElement < SymbolType > > {
    FormalRTESymbolSubst < SymbolType > m_substitutionSymbol;
 
    void accept ( typename FormalRTEElement < SymbolType >::ConstVisitor & visitor ) const override {
        visitor.visit ( * this );
    }
 
    void accept ( typename FormalRTEElement < SymbolType >::Visitor & visitor ) override {
        visitor.visit ( * this );
    }
 
public:
    explicit FormalRTEIteration ( FormalRTEElement < SymbolType > && element, FormalRTESymbolSubst < SymbolType > substitutionSymbol );
 
    explicit FormalRTEIteration ( const FormalRTEElement < SymbolType > & element, FormalRTESymbolSubst < SymbolType > substitutionSymbol );
 
    FormalRTEIteration < SymbolType > * clone ( ) const & override;
 
    FormalRTEIteration < SymbolType > * clone ( ) && override;
 
    bool testSymbol ( const common::ranked_symbol < SymbolType > & symbol ) const override;
 
    void computeMinimalAlphabet ( ext::set < common::ranked_symbol < SymbolType > > & alphabetF, ext::set < common::ranked_symbol < SymbolType > > & alphabetK ) const override;
 
    bool checkAlphabet ( const ext::set < common::ranked_symbol < SymbolType > > & alphabetF, const ext::set < common::ranked_symbol < SymbolType > > & alphabetK ) const override;
 
    const FormalRTEElement < SymbolType > & getElement ( ) const;
 
    const FormalRTESymbolSubst < SymbolType > & getSubstitutionSymbol ( ) const;
 
    FormalRTEElement < SymbolType > & getElement ( );
 
    FormalRTESymbolSubst < SymbolType > & getSubstitutionSymbol ( );
 
    void setElement ( const FormalRTEElement < SymbolType > & element );
 
    void setElement ( FormalRTEElement < SymbolType > && element );
 
    void setSubstitutionSymbol ( FormalRTESymbolSubst < SymbolType > symbol );
 
    std::strong_ordering operator <=> ( const FormalRTEElement < SymbolType > & other ) const override {
        if ( ext::type_index ( typeid ( * this ) ) == ext::type_index ( typeid ( other ) ) ) return * this <=> static_cast < decltype ( ( * this ) ) > ( other );
 
        return ext::type_index ( typeid ( * this ) ) <=> ext::type_index ( typeid ( other ) );
    }
 
    std::strong_ordering operator <=> ( const FormalRTEIteration < SymbolType > & ) const;
 
    bool operator == ( const FormalRTEElement < SymbolType > & other ) const override {
        if ( ext::type_index ( typeid ( * this ) ) == ext::type_index ( typeid ( other ) ) ) return * this == static_cast < decltype ( ( * this ) ) > ( other );
 
        return false;
    }
 
    bool operator == ( const FormalRTEIteration < SymbolType > & ) const;
 
    void operator >>( ext::ostream & out ) const override;
 
    ext::smart_ptr < FormalRTEElement < DefaultSymbolType > > normalize ( ) && override {
        FormalRTESymbolSubst < DefaultSymbolType > subst ( alphabet::SymbolNormalize::normalizeRankedSymbol ( std::move ( m_substitutionSymbol ).getSymbol ( ) ) );
        return ext::smart_ptr < FormalRTEElement < DefaultSymbolType > > ( new FormalRTEIteration < DefaultSymbolType > ( std::move ( * std::move ( getElement ( ) ).normalize ( ) ), std::move ( subst ) ) );
    }
};
 
template < class SymbolType >
FormalRTEIteration < SymbolType >::FormalRTEIteration ( FormalRTEElement < SymbolType > && element, FormalRTESymbolSubst < SymbolType > substitutionSymbol ) : ext::UnaryNode < FormalRTEElement < SymbolType > > ( std::move ( element ) ), m_substitutionSymbol ( std::move ( substitutionSymbol ) ) {
}
 
template < class SymbolType >
FormalRTEIteration < SymbolType >::FormalRTEIteration ( const FormalRTEElement < SymbolType > & element, FormalRTESymbolSubst < SymbolType > substitutionSymbol ) : FormalRTEIteration ( ext::move_copy ( element ), std::move ( substitutionSymbol ) ) {
}
 
template < class SymbolType >
const FormalRTEElement < SymbolType > & FormalRTEIteration < SymbolType >::getElement ( ) const {
    return this->getChild ( );
}
 
template < class SymbolType >
FormalRTEElement < SymbolType > & FormalRTEIteration < SymbolType >::getElement ( ) {
    return this->getChild ( );
}
 
template < class SymbolType >
const FormalRTESymbolSubst < SymbolType > & FormalRTEIteration < SymbolType >::getSubstitutionSymbol ( ) const {
    return m_substitutionSymbol;
}
 
template < class SymbolType >
FormalRTESymbolSubst < SymbolType > & FormalRTEIteration < SymbolType >::getSubstitutionSymbol ( ) {
    return m_substitutionSymbol;
}
 
template < class SymbolType >
void FormalRTEIteration < SymbolType >::setElement ( const FormalRTEElement < SymbolType > & element ) {
    setElement ( ext::move_copy ( element ) );
}
 
template < class SymbolType >
void FormalRTEIteration < SymbolType >::setElement ( FormalRTEElement < SymbolType > && element ) {
    this->setChild ( std::move ( element ) );
}
 
template < class SymbolType >
void FormalRTEIteration < SymbolType >::setSubstitutionSymbol ( FormalRTESymbolSubst < SymbolType > symbol ) {
    m_substitutionSymbol = std::move ( symbol );
}
 
template < class SymbolType >
FormalRTEIteration < SymbolType > * FormalRTEIteration < SymbolType >::clone ( ) const & {
    return new FormalRTEIteration ( * this );
}
 
template < class SymbolType >
FormalRTEIteration < SymbolType > * FormalRTEIteration < SymbolType >::clone ( ) && {
    return new FormalRTEIteration ( std::move ( * this ) );
}
 
template < class SymbolType >
std::strong_ordering FormalRTEIteration < SymbolType >::operator <=> ( const FormalRTEIteration < SymbolType > & other ) const {
    return getElement ( ) <=> other.getElement ( );
}
 
template < class SymbolType >
bool FormalRTEIteration < SymbolType >::operator == ( const FormalRTEIteration < SymbolType > & other ) const {
    return getElement ( ) == other.getElement ( );
}
 
template < class SymbolType >
void FormalRTEIteration < SymbolType >::operator >>( ext::ostream & out ) const {
    out << "(FormalRTEIteration " << m_substitutionSymbol << " " << getElement ( ) << ")";
}
 
template < class SymbolType >
bool FormalRTEIteration < SymbolType >::testSymbol ( const common::ranked_symbol < SymbolType > & symbol ) const {
    return this->getElement ( ).testSymbol ( symbol );
}
 
template < class SymbolType >
void FormalRTEIteration < SymbolType >::computeMinimalAlphabet ( ext::set < common::ranked_symbol < SymbolType > > & alphabetF, ext::set < common::ranked_symbol < SymbolType > > & alphabetK ) const {
    alphabetK.insert ( m_substitutionSymbol.getSymbol ( ) );
    this->getElement ( ).computeMinimalAlphabet ( alphabetF, alphabetK );
}
 
template < class SymbolType >
bool FormalRTEIteration < SymbolType >::checkAlphabet ( const ext::set < common::ranked_symbol < SymbolType > > & alphabetF, const ext::set < common::ranked_symbol < SymbolType > > & alphabetK ) const {
    return alphabetK.count ( getSubstitutionSymbol ( ).getSymbol ( ) ) > 0 && getElement ( ).checkAlphabet ( alphabetF, alphabetK );
}
 
} /* namespace rte */
 
extern template class rte::FormalRTEIteration < DefaultSymbolType >;