UnorderedRankedTree.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 tree {
 
template < class SymbolType = DefaultSymbolType >
class UnorderedRankedTree;
 
} /* namespace tree */
 
 
#include <ext/iostream>
#include <ext/algorithm>
 
#include <alib/string>
#include <alib/set>
#include <alib/tree>
 
#include <core/components.hpp>
#include <common/ranked_symbol.hpp>
 
#include <tree/TreeException.h>
#include <tree/common/TreeAuxiliary.h>
 
#include <core/normalize.hpp>
#include <tree/common/TreeNormalize.h>
 
#include <tree/ranked/RankedTree.h>
 
namespace tree {
 
class GeneralAlphabet;
 
template < class SymbolType >
class UnorderedRankedTree final : public core::Components < UnorderedRankedTree < SymbolType >, ext::set < common::ranked_symbol < SymbolType > >, component::Set, GeneralAlphabet > {
    ext::tree < common::ranked_symbol < SymbolType > > m_content;
 
    void checkAlphabet ( const ext::tree < common::ranked_symbol < SymbolType > > & data ) const;
 
    void checkArities ( const ext::tree < common::ranked_symbol < SymbolType > > & data ) const;
 
public:
    explicit UnorderedRankedTree ( ext::set < common::ranked_symbol < SymbolType > > alphabet, ext::tree < common::ranked_symbol < SymbolType > > tree );
 
    explicit UnorderedRankedTree ( ext::tree < common::ranked_symbol < SymbolType > > tree );
 
    explicit UnorderedRankedTree ( const RankedTree < SymbolType > & tree );
 
    const ext::set < common::ranked_symbol < SymbolType > > & getAlphabet ( ) const & {
        return this->template accessComponent < GeneralAlphabet > ( ).get ( );
    }
 
    ext::set < common::ranked_symbol < SymbolType > > && getAlphabet ( ) && {
        return std::move ( this->template accessComponent < GeneralAlphabet > ( ).get ( ) );
    }
 
    void extendAlphabet ( const ext::set < common::ranked_symbol < SymbolType > > & symbols ) {
        this->template accessComponent < GeneralAlphabet > ( ).add ( symbols );
    }
 
    const ext::tree < common::ranked_symbol < SymbolType > > & getContent ( ) const &;
 
    ext::tree < common::ranked_symbol < SymbolType > > && getContent ( ) &&;
 
    void setTree ( ext::tree < common::ranked_symbol < SymbolType > > tree );
 
    auto operator <=> ( const UnorderedRankedTree & other ) const {
        return std::tie ( m_content, getAlphabet() ) <=> std::tie ( other.m_content, other.getAlphabet() );
    }
 
    bool operator == ( const UnorderedRankedTree & other ) const {
        return std::tie ( m_content, getAlphabet() ) == std::tie ( other.m_content, other.getAlphabet() );
    }
 
    friend ext::ostream & operator << ( ext::ostream & out, const UnorderedRankedTree & instance ) {
        out << "(UnorderedRankedTree";
        out << " alphabet = " << instance.getAlphabet ( );
        out << " content = " << instance.getContent ( );
        out << ")";
        return out;
    }
 
    void nicePrint ( ext::ostream & os ) const;
};
 
template < class SymbolType >
UnorderedRankedTree < SymbolType >::UnorderedRankedTree ( ext::set < common::ranked_symbol < SymbolType > > alphabet, ext::tree < common::ranked_symbol < SymbolType > > tree ) : core::Components < UnorderedRankedTree, ext::set < common::ranked_symbol < SymbolType > >, component::Set, GeneralAlphabet > ( std::move ( alphabet ) ), m_content ( TreeAuxiliary::sort ( std::move ( tree ) ) ) {
    checkAlphabet ( m_content );
    checkArities ( m_content );
}
 
template < class SymbolType >
UnorderedRankedTree < SymbolType >::UnorderedRankedTree ( ext::tree < common::ranked_symbol < SymbolType > > tree ) : UnorderedRankedTree ( ext::set < common::ranked_symbol < SymbolType > > ( tree.prefix_begin ( ), tree.prefix_end ( ) ), tree ) {
}
 
template < class SymbolType >
UnorderedRankedTree < SymbolType >::UnorderedRankedTree ( const RankedTree < SymbolType > & tree ) : UnorderedRankedTree ( tree.getAlphabet ( ), tree.getContent ( ) ) {
}
 
template < class SymbolType >
const ext::tree < common::ranked_symbol < SymbolType > > & UnorderedRankedTree < SymbolType >::getContent ( ) const & {
    return m_content;
}
 
template < class SymbolType >
ext::tree < common::ranked_symbol < SymbolType > > && UnorderedRankedTree < SymbolType >::getContent ( ) && {
    return std::move ( m_content );
}
 
template < class SymbolType >
void UnorderedRankedTree < SymbolType >::checkAlphabet ( const ext::tree < common::ranked_symbol < SymbolType > > & data ) const {
    ext::set < common::ranked_symbol < SymbolType > > minimalAlphabet ( data.prefix_begin ( ), data.prefix_end ( ) );
    std::set_difference ( minimalAlphabet.begin ( ), minimalAlphabet.end ( ), getAlphabet ( ).begin ( ), getAlphabet ( ).end ( ), ext::callback_iterator ( [ ] ( const common::ranked_symbol < SymbolType > & ) {
            throw TreeException ( "Input symbols not in the alphabet." );
        } ) );
}
 
template < class SymbolType >
void UnorderedRankedTree < SymbolType >::checkArities ( const ext::tree < common::ranked_symbol < SymbolType > > & data ) const {
    if ( data.getData ( ).getRank ( ) != data.getChildren ( ).size ( ) )
        throw exception::CommonException ( "Invalid rank." );
 
    for ( const ext::tree < common::ranked_symbol < SymbolType > > & child : data )
        checkArities ( child );
}
 
template < class SymbolType >
void UnorderedRankedTree < SymbolType >::setTree ( ext::tree < common::ranked_symbol < SymbolType > > tree ) {
    checkAlphabet ( tree );
    checkArities ( tree );
 
    this->m_content = TreeAuxiliary::sort ( std::move ( tree ) );
}
 
template < class SymbolType >
void UnorderedRankedTree < SymbolType >::nicePrint ( ext::ostream & os ) const {
    m_content.nicePrint ( os );
}
 
} /* namespace tree */
 
namespace core {
 
template < class SymbolType >
class SetConstraint< tree::UnorderedRankedTree < SymbolType >, common::ranked_symbol < SymbolType >, tree::GeneralAlphabet > {
public:
    static bool used ( const tree::UnorderedRankedTree < SymbolType > & tree, const common::ranked_symbol < SymbolType > & symbol ) {
        const ext::tree < common::ranked_symbol < SymbolType > > & m_content = tree.getContent ( );
        return std::find(m_content.prefix_begin(), m_content.prefix_end(), symbol) != m_content.prefix_end();
    }
 
    static bool available ( const tree::UnorderedRankedTree < SymbolType > &, const common::ranked_symbol < SymbolType > & ) {
        return true;
    }
 
    static void valid ( const tree::UnorderedRankedTree < SymbolType > &, const common::ranked_symbol < SymbolType > & ) {
    }
};
 
template < class SymbolType >
struct normalize < tree::UnorderedRankedTree < SymbolType > > {
    static tree::UnorderedRankedTree < > eval ( tree::UnorderedRankedTree < SymbolType > && value ) {
        ext::set < common::ranked_symbol < DefaultSymbolType > > alphabet = alphabet::SymbolNormalize::normalizeRankedAlphabet ( std::move ( value ).getAlphabet ( ) );
        ext::tree < common::ranked_symbol < DefaultSymbolType > > content = tree::TreeNormalize::normalizeRankedTree ( std::move ( value ).getContent ( ) );
 
        return tree::UnorderedRankedTree < > ( std::move ( alphabet ), std::move ( content ) );
    }
};
 
} /* namespace core */
 
extern template class tree::UnorderedRankedTree < >;