UnboundedRegExpEmpty.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 "UnboundedRegExpElement.h"
 
namespace regexp {
 
template < class SymbolType >
class UnboundedRegExpEmpty : public ext::NullaryNode < UnboundedRegExpElement < SymbolType > > {
    void accept ( typename UnboundedRegExpElement < SymbolType >::Visitor & visitor ) const & override {
        visitor.visit ( * this );
    }
 
    void accept ( typename UnboundedRegExpElement < SymbolType >::RvalueVisitor & visitor ) && override {
        visitor.visit ( std::move ( * this ) );
    }
 
public:
    explicit UnboundedRegExpEmpty ( ) = default;
 
    UnboundedRegExpEmpty < SymbolType > * clone ( ) const & override;
 
    UnboundedRegExpEmpty < SymbolType > * clone ( ) && override;
 
    ext::smart_ptr < FormalRegExpElement < SymbolType > > asFormal ( ) 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;
 
    std::strong_ordering operator <=> ( const UnboundedRegExpElement < 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 UnboundedRegExpEmpty < SymbolType > & ) const;
 
    bool operator == ( const UnboundedRegExpElement < 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 UnboundedRegExpEmpty < SymbolType > & ) const;
 
    void operator >>( ext::ostream & out ) const override;
 
    ext::smart_ptr < UnboundedRegExpElement < DefaultSymbolType > > normalize ( ) && override {
        return ext::smart_ptr < UnboundedRegExpElement < DefaultSymbolType > > ( new UnboundedRegExpEmpty < DefaultSymbolType > ( ) );
    }
};
 
} /* namespace regexp */
 
#include "../formal/FormalRegExpEmpty.h"
 
namespace regexp {
 
template < class SymbolType >
UnboundedRegExpEmpty < SymbolType > * UnboundedRegExpEmpty < SymbolType >::clone ( ) const & {
    return new UnboundedRegExpEmpty ( * this );
}
 
template < class SymbolType >
UnboundedRegExpEmpty < SymbolType > * UnboundedRegExpEmpty < SymbolType >::clone ( ) && {
    return new UnboundedRegExpEmpty ( std::move ( * this ) );
}
 
template < class SymbolType >
ext::smart_ptr < FormalRegExpElement < SymbolType > > UnboundedRegExpEmpty < SymbolType >::asFormal ( ) const {
    return ext::smart_ptr < FormalRegExpElement < SymbolType > > ( new FormalRegExpEmpty < SymbolType > ( ) );
}
 
template < class SymbolType >
std::strong_ordering UnboundedRegExpEmpty < SymbolType >::operator <=> ( const UnboundedRegExpEmpty < SymbolType > & ) const {
    return std::strong_ordering::equal;
}
 
template < class SymbolType >
bool UnboundedRegExpEmpty < SymbolType >::operator == ( const UnboundedRegExpEmpty < SymbolType > & ) const {
    return true;
}
 
template < class SymbolType >
void UnboundedRegExpEmpty < SymbolType >::operator >>( ext::ostream & out ) const {
    out << "(UnboundedRegExpEmpty)";
}
 
template < class SymbolType >
bool UnboundedRegExpEmpty < SymbolType >::testSymbol ( const SymbolType & ) const {
    return false;
}
 
template < class SymbolType >
bool UnboundedRegExpEmpty < SymbolType >::checkAlphabet ( const ext::set < SymbolType > & ) const {
    return true;
}
 
template < class SymbolType >
void UnboundedRegExpEmpty < SymbolType >::computeMinimalAlphabet ( ext::set < SymbolType > & ) const {
}
 
} /* namespace regexp */
 
extern template class regexp::UnboundedRegExpEmpty < DefaultSymbolType >;