FormalRegExpSymbol.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 "FormalRegExpElement.h"
#include <alphabet/common/SymbolNormalize.h>
 
namespace regexp {
 
template < class SymbolType >
class FormalRegExpSymbol : public ext::NullaryNode < FormalRegExpElement < SymbolType > > {
    SymbolType m_symbol;
 
    void accept ( typename FormalRegExpElement < SymbolType >::Visitor & visitor ) const override {
        visitor.visit ( * this );
    }
 
public:
    explicit FormalRegExpSymbol ( SymbolType symbol );
 
    FormalRegExpSymbol < SymbolType > * clone ( ) const & override;
 
    FormalRegExpSymbol < SymbolType > * clone ( ) && override;
 
    ext::smart_ptr < UnboundedRegExpElement < SymbolType > > asUnbounded ( ) const override;
 
    bool testSymbol ( const SymbolType & symbol ) const override;
 
    void computeMinimalAlphabet ( ext::set < SymbolType > & alphabet ) const override;
 
    bool checkAlphabet ( const ext::set < SymbolType > & alphabet ) const override;
 
    const SymbolType & getSymbol ( ) const &;
 
    SymbolType && getSymbol ( ) &&;
 
    std::strong_ordering operator <=> ( const FormalRegExpElement < 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 FormalRegExpSymbol < SymbolType > & ) const;
 
    bool operator == ( const FormalRegExpElement < 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 FormalRegExpSymbol < SymbolType > & ) const;
 
    void operator >>( ext::ostream & out ) const override;
 
    ext::smart_ptr < FormalRegExpElement < DefaultSymbolType > > normalize ( ) && override {
        return ext::smart_ptr < FormalRegExpElement < DefaultSymbolType > > ( new FormalRegExpSymbol < DefaultSymbolType > ( alphabet::SymbolNormalize::normalizeSymbol ( std::move ( m_symbol ) ) ) );
    }
};
 
} /* namespace regexp */
 
#include "../unbounded/UnboundedRegExpSymbol.h"
 
namespace regexp {
 
template < class SymbolType >
FormalRegExpSymbol < SymbolType >::FormalRegExpSymbol ( SymbolType symbol ) : m_symbol ( std::move ( symbol ) ) {
}
 
template < class SymbolType >
FormalRegExpSymbol < SymbolType > * FormalRegExpSymbol < SymbolType >::clone ( ) const & {
    return new FormalRegExpSymbol ( * this );
}
 
template < class SymbolType >
FormalRegExpSymbol < SymbolType > * FormalRegExpSymbol < SymbolType >::clone ( ) && {
    return new FormalRegExpSymbol ( std::move ( * this ) );
}
 
template < class SymbolType >
ext::smart_ptr < UnboundedRegExpElement < SymbolType > > FormalRegExpSymbol < SymbolType >::asUnbounded ( ) const {
    return ext::smart_ptr < UnboundedRegExpElement < SymbolType > > ( new UnboundedRegExpSymbol < SymbolType > ( this->m_symbol ) );
}
 
template < class SymbolType >
std::strong_ordering FormalRegExpSymbol < SymbolType >::operator <=> ( const FormalRegExpSymbol < SymbolType > & other ) const {
    return m_symbol <=> other.m_symbol;
}
 
template < class SymbolType >
bool FormalRegExpSymbol < SymbolType >::operator == ( const FormalRegExpSymbol < SymbolType > & other ) const {
    return m_symbol == other.m_symbol;
}
 
template < class SymbolType >
void FormalRegExpSymbol < SymbolType >::operator >>( ext::ostream & out ) const {
    out << "(FormalRegExpSymbol " << m_symbol << ")";
}
 
template < class SymbolType >
bool FormalRegExpSymbol < SymbolType >::testSymbol ( const SymbolType & symbol ) const {
    return symbol == this->m_symbol;
}
 
template < class SymbolType >
void FormalRegExpSymbol < SymbolType >::computeMinimalAlphabet ( ext::set < SymbolType > & alphabet ) const {
    alphabet.insert ( m_symbol );
}
 
template < class SymbolType >
bool FormalRegExpSymbol < SymbolType >::checkAlphabet ( const ext::set < SymbolType > & alphabet ) const {
    return alphabet.count ( m_symbol );
}
 
template < class SymbolType >
const SymbolType & FormalRegExpSymbol < SymbolType >::getSymbol ( ) const & {
    return this->m_symbol;
}
 
template < class SymbolType >
SymbolType && FormalRegExpSymbol < SymbolType >::getSymbol ( ) && {
    return std::move ( this->m_symbol );
}
 
} /* namespace regexp */
 
extern template class regexp::FormalRegExpSymbol < DefaultSymbolType >;