FormalRTESymbolSubst.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 "FormalRTESymbol.h"
 
#include <exception/CommonException.h>
#include <alphabet/common/SymbolNormalize.h>
 
namespace rte {
 
template < class SymbolType >
class FormalRTESymbolSubst : public FormalRTESymbol < SymbolType >, public ext::NullaryNode < FormalRTEElement < SymbolType > > {
    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 FormalRTESymbolSubst ( common::ranked_symbol < SymbolType > symbol );
 
    FormalRTESymbolSubst < SymbolType > * clone ( ) const & override;
 
    FormalRTESymbolSubst < 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;
 
    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 FormalRTESymbolSubst < 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 FormalRTESymbolSubst < SymbolType > & ) const;
 
    void operator >>( ext::ostream & out ) const override;
 
    ext::smart_ptr < FormalRTEElement < DefaultSymbolType > > normalize ( ) && override {
        FormalRTESymbolSubst < DefaultSymbolType > res ( alphabet::SymbolNormalize::normalizeRankedSymbol ( std::move ( * this ).getSymbol ( ) ) );
        return ext::smart_ptr < FormalRTEElement < DefaultSymbolType > > ( std::move ( res ).clone ( ) );
    }
};
 
template < class SymbolType >
FormalRTESymbolSubst < SymbolType >::FormalRTESymbolSubst ( common::ranked_symbol < SymbolType > symbol ) : FormalRTESymbol < SymbolType > ( symbol ) {
}
 
template < class SymbolType >
FormalRTESymbolSubst < SymbolType > * FormalRTESymbolSubst < SymbolType >::clone ( ) const & {
    return new FormalRTESymbolSubst ( * this );
}
 
template < class SymbolType >
FormalRTESymbolSubst < SymbolType > * FormalRTESymbolSubst < SymbolType >::clone ( ) && {
    return new FormalRTESymbolSubst ( std::move ( * this ) );
}
 
template < class SymbolType >
std::strong_ordering FormalRTESymbolSubst < SymbolType >::operator <=> ( const FormalRTESymbolSubst < SymbolType > & other ) const {
    return this->getSymbol ( ) <=> other.getSymbol ( );
}
 
template < class SymbolType >
bool FormalRTESymbolSubst < SymbolType >::operator == ( const FormalRTESymbolSubst < SymbolType > & other ) const {
    return this->getSymbol ( ) == other.getSymbol ( );
}
 
template < class SymbolType >
void FormalRTESymbolSubst < SymbolType >::operator >>( ext::ostream & out ) const {
    out << "(FormalRTESymbolSubst " << " symbol = " << this->getSymbol ( ) << "})";
}
 
template < class SymbolType >
bool FormalRTESymbolSubst < SymbolType >::testSymbol ( const common::ranked_symbol < SymbolType > & symbol ) const {
    return symbol == this->getSymbol ( );
}
 
template < class SymbolType >
void FormalRTESymbolSubst < SymbolType >::computeMinimalAlphabet ( ext::set < common::ranked_symbol < SymbolType > > & /* alphabetF */, ext::set < common::ranked_symbol < SymbolType > > & alphabetK ) const {
    alphabetK.insert ( this->getSymbol ( ) );
}
 
template < class SymbolType >
bool FormalRTESymbolSubst < SymbolType >::checkAlphabet ( const ext::set < common::ranked_symbol < SymbolType > > & /* alphabetF */, const ext::set < common::ranked_symbol < SymbolType > > & alphabetK ) const {
    return alphabetK.count ( this->getSymbol ( ) ) > 0;
}
 
} /* namespace rte */
 
extern template class rte::FormalRTESymbolSubst < DefaultSymbolType >;