UnboundedRegExp.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 <common/DefaultSymbolType.h>
 
namespace regexp {
 
template < class SymbolType = DefaultSymbolType >
class UnboundedRegExp;
 
} /* namespace regexp */
 
#include <ext/iostream>
#include <ext/algorithm>
 
#include <alib/string>
#include <alib/set>
 
#include <core/components.hpp>
#include <exception/CommonException.h>
 
#include "UnboundedRegExpStructure.h"
 
#include <core/normalize.hpp>
#include <alphabet/common/SymbolNormalize.h>
 
#include "../formal/FormalRegExp.h"
 
namespace regexp {
 
class GeneralAlphabet;
 
template < class SymbolType >
class UnboundedRegExp final : public core::Components < UnboundedRegExp < SymbolType >, ext::set < SymbolType >, component::Set, GeneralAlphabet > {
    UnboundedRegExpStructure < SymbolType > m_regExp;
 
public:
    using symbol_type = SymbolType;
 
    explicit UnboundedRegExp ( );
 
    explicit UnboundedRegExp ( ext::set < SymbolType > alphabet, UnboundedRegExpStructure < SymbolType > regExp );
 
    explicit UnboundedRegExp ( UnboundedRegExpStructure < SymbolType > regExp );
 
    explicit UnboundedRegExp ( const FormalRegExp < SymbolType > & other );
 
    const ext::set < SymbolType > & getAlphabet ( ) const & {
        return this->template accessComponent < GeneralAlphabet > ( ).get ( );
    }
 
    ext::set < SymbolType > && getAlphabet ( ) && {
        return std::move ( this->template accessComponent < GeneralAlphabet > ( ).get ( ) );
    }
 
    const UnboundedRegExpStructure < SymbolType > & getRegExp ( ) const &;
 
    UnboundedRegExpStructure < SymbolType > && getRegExp ( ) &&;
 
    void setRegExp ( UnboundedRegExpStructure < SymbolType > param );
 
    auto operator <=> ( const UnboundedRegExp & other ) const {
        return std::tie ( m_regExp.getStructure ( ), getAlphabet ( ) ) <=> std::tie ( other.m_regExp.getStructure ( ), other.getAlphabet ( ) );
    }
 
    bool operator == ( const UnboundedRegExp & other ) const {
        return std::tie ( m_regExp.getStructure ( ), getAlphabet ( ) ) == std::tie ( other.m_regExp.getStructure ( ), other.getAlphabet ( ) );
    }
 
    friend ext::ostream & operator << ( ext::ostream & out, const UnboundedRegExp & instance ) {
        return out << "(UnboundedRegExp " << instance.getRegExp ( ).getStructure ( ) << ")";
    }
};
 
template < class SymbolType >
UnboundedRegExp < SymbolType >::UnboundedRegExp ( ext::set < SymbolType > alphabet, UnboundedRegExpStructure < SymbolType > regExp ) : core::Components < UnboundedRegExp, ext::set < SymbolType >, component::Set, GeneralAlphabet > ( std::move ( alphabet ) ), m_regExp ( std::move ( regExp ) ) {
    if ( !this->m_regExp.getStructure ( ).checkAlphabet ( getAlphabet ( ) ) )
        throw exception::CommonException ( "Input symbols not in the alphabet." );
}
 
template < class SymbolType >
UnboundedRegExp < SymbolType >::UnboundedRegExp ( ) : UnboundedRegExp ( ext::set < SymbolType > ( ), UnboundedRegExpStructure < SymbolType > ( ) ) {
}
 
template < class SymbolType >
UnboundedRegExp < SymbolType >::UnboundedRegExp ( UnboundedRegExpStructure < SymbolType > regExp ) : UnboundedRegExp ( regExp.getStructure ( ).computeMinimalAlphabet ( ), regExp ) {
}
 
template < class SymbolType >
UnboundedRegExp < SymbolType >::UnboundedRegExp ( const FormalRegExp < SymbolType > & other ) : UnboundedRegExp ( other.getAlphabet ( ), UnboundedRegExpStructure < SymbolType > ( other.getRegExp ( ) ) ) {
}
 
template < class SymbolType >
const UnboundedRegExpStructure < SymbolType > & UnboundedRegExp < SymbolType >::getRegExp ( ) const & {
    return m_regExp;
}
 
template < class SymbolType >
UnboundedRegExpStructure < SymbolType > && UnboundedRegExp < SymbolType >::getRegExp ( ) && {
    return std::move ( m_regExp );
}
 
template < class SymbolType >
void UnboundedRegExp < SymbolType >::setRegExp ( UnboundedRegExpStructure < SymbolType > param ) {
    if ( !param.getStructure ( ).checkAlphabet ( getAlphabet ( ) ) )
        throw exception::CommonException ( "Input symbols not in the alphabet." );
 
    this->m_regExp = std::move ( param );
}
 
} /* namespace regexp */
 
namespace core {
 
template < class SymbolType >
class SetConstraint< regexp::UnboundedRegExp < SymbolType >, SymbolType, regexp::GeneralAlphabet > {
public:
    static bool used ( const regexp::UnboundedRegExp < SymbolType > & regexp, const SymbolType & symbol ) {
        return regexp.getRegExp ( ).getStructure ( ).testSymbol ( symbol );
    }
 
    static bool available ( const regexp::UnboundedRegExp < SymbolType > &, const SymbolType & ) {
        return true;
    }
 
    static void valid ( const regexp::UnboundedRegExp < SymbolType > &, const SymbolType & ) {
    }
};
 
template < class SymbolType >
struct normalize < regexp::UnboundedRegExp < SymbolType > > {
    static regexp::UnboundedRegExp < > eval ( regexp::UnboundedRegExp < SymbolType > && value ) {
        ext::set < DefaultSymbolType > alphabet = alphabet::SymbolNormalize::normalizeAlphabet ( std::move ( value ).getAlphabet ( ) );
 
        return regexp::UnboundedRegExp < > ( alphabet, std::move ( value ).getRegExp ( ).normalize ( ) );
    }
};
 
} /* namespace core */
 
extern template class regexp::UnboundedRegExp < >;