UnboundedRegExpAlternation.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/ptr_vector>
 
#include <exception/CommonException.h>
 
#include "UnboundedRegExpElement.h"
 
namespace regexp {
 
template < class SymbolType >
class UnboundedRegExpAlternation : public ext::VararyNode < 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 UnboundedRegExpAlternation ( ) = default;
 
    UnboundedRegExpAlternation < SymbolType > * clone ( ) const & override;
 
    UnboundedRegExpAlternation < 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;
 
    const ext::ptr_vector < UnboundedRegExpElement < SymbolType > > & getElements ( ) const;
 
    const ext::ptr_vector < UnboundedRegExpElement < SymbolType > > & getElements ( );
 
    void appendElement ( UnboundedRegExpElement < SymbolType > && element );
 
    void appendElement ( const UnboundedRegExpElement < SymbolType > & element );
 
    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 UnboundedRegExpAlternation < 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 UnboundedRegExpAlternation < SymbolType > & ) const;
 
    void operator >>( ext::ostream & out ) const override;
 
    ext::smart_ptr < UnboundedRegExpElement < DefaultSymbolType > > normalize ( ) && override {
        UnboundedRegExpAlternation < DefaultSymbolType > * res = new UnboundedRegExpAlternation < DefaultSymbolType > ( );
 
        for ( UnboundedRegExpElement < SymbolType > && element : ext::make_mover ( std::move ( * this ).getChildren ( ) ) )
            res->appendElement ( std::move ( * std::move ( element ).normalize ( ) ) );
 
        return ext::smart_ptr < UnboundedRegExpElement < DefaultSymbolType > > ( res );
    }
};
 
} /* namespace regexp */
 
#include "../formal/FormalRegExpAlternation.h"
#include "../formal/FormalRegExpEmpty.h"
 
namespace regexp {
 
template < class SymbolType >
const ext::ptr_vector < UnboundedRegExpElement < SymbolType > > & UnboundedRegExpAlternation < SymbolType >::getElements ( ) const {
    return this->getChildren();
}
 
template < class SymbolType >
const ext::ptr_vector < UnboundedRegExpElement < SymbolType > > & UnboundedRegExpAlternation < SymbolType >::getElements ( ) {
    return this->getChildren();
}
 
template < class SymbolType >
void UnboundedRegExpAlternation < SymbolType >::appendElement ( UnboundedRegExpElement < SymbolType > && element ) {
    this->pushBackChild ( std::move ( element ) );
}
 
template < class SymbolType >
void UnboundedRegExpAlternation < SymbolType >::appendElement ( const UnboundedRegExpElement < SymbolType > & element ) {
    this->appendElement ( ext::move_copy ( element ) );
}
 
template < class SymbolType >
UnboundedRegExpAlternation < SymbolType > * UnboundedRegExpAlternation < SymbolType >::clone ( ) const & {
    return new UnboundedRegExpAlternation ( * this );
}
 
template < class SymbolType >
UnboundedRegExpAlternation < SymbolType > * UnboundedRegExpAlternation < SymbolType >::clone ( ) && {
    return new UnboundedRegExpAlternation ( std::move ( * this ) );
}
 
template < class SymbolType >
ext::smart_ptr < FormalRegExpElement < SymbolType > > UnboundedRegExpAlternation < SymbolType >::asFormal ( ) const {
    if ( getElements ( ).empty ( ) ) return ext::smart_ptr < FormalRegExpElement < SymbolType > > ( new FormalRegExpEmpty < SymbolType > ( ) );
 
    ext::smart_ptr < FormalRegExpElement < SymbolType > > res = getElements ( ) [ getElements ( ).size ( ) - 1 ].asFormal ( );
 
    for ( size_t i = getElements ( ).size ( ) - 1; i >= 1; i-- )
        res = ext::smart_ptr < FormalRegExpElement < SymbolType > > ( new FormalRegExpAlternation < SymbolType > ( std::move ( * getElements ( ) [ i - 1 ].asFormal ( ) ), std::move ( * res ) ) );
 
    return res;
}
 
template < class SymbolType >
std::strong_ordering UnboundedRegExpAlternation < SymbolType >::operator <=> ( const UnboundedRegExpAlternation < SymbolType > & other ) const {
    return getElements ( ) <=> other.getElements ( );
}
 
template < class SymbolType >
bool UnboundedRegExpAlternation < SymbolType >::operator == ( const UnboundedRegExpAlternation < SymbolType > & other ) const {
    return getElements ( ) == other.getElements ( );
}
 
template < class SymbolType >
void UnboundedRegExpAlternation < SymbolType >::operator >>( ext::ostream & out ) const {
    out << "(UnboundedRegExpAlternation";
 
    for ( const UnboundedRegExpElement < SymbolType > & element : this->getElements ( ) )
        out << " " << element;
 
    out << ")";
}
 
template < class SymbolType >
bool UnboundedRegExpAlternation < SymbolType >::testSymbol ( const SymbolType & symbol ) const {
    for ( const UnboundedRegExpElement < SymbolType > & element : this->getElements ( ) )
        if ( element.testSymbol ( symbol ) ) return true;
 
    return false;
}
 
template < class SymbolType >
bool UnboundedRegExpAlternation < SymbolType >::checkAlphabet ( const ext::set < SymbolType > & alphabet ) const {
    for ( const UnboundedRegExpElement < SymbolType > & element : this->getElements ( ) )
        if ( ! element.checkAlphabet ( alphabet ) ) return false;
 
    return true;
}
 
template < class SymbolType >
void UnboundedRegExpAlternation < SymbolType >::computeMinimalAlphabet ( ext::set < SymbolType > & alphabet ) const {
    for ( const UnboundedRegExpElement < SymbolType > & element : this->getElements ( ) )
        element.computeMinimalAlphabet ( alphabet );
}
 
} /* namespace regexp */
 
extern template class regexp::UnboundedRegExpAlternation < DefaultSymbolType >;