UnrankedTree.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 UnrankedTree;
 
} /* namespace tree */
 
 
#include <ext/iostream>
#include <ext/algorithm>
 
#include <alib/string>
#include <alib/set>
#include <alib/tree>
 
#include <core/components.hpp>
 
#include <tree/TreeException.h>
#include <tree/common/TreeAuxiliary.h>
 
#include <core/normalize.hpp>
#include <tree/common/TreeNormalize.h>
 
#include "../ranked/RankedTree.h"
 
namespace tree {
 
class GeneralAlphabet;
 
template < class SymbolType >
class UnrankedTree final : public core::Components < UnrankedTree < SymbolType >, ext::set < SymbolType >, component::Set, GeneralAlphabet > {
    ext::tree < SymbolType > m_content;
 
    void checkAlphabet ( const ext::tree < SymbolType > & data ) const;
 
public:
    explicit UnrankedTree ( ext::set < SymbolType > alphabet, ext::tree < SymbolType > tree );
 
    explicit UnrankedTree ( ext::tree < SymbolType > pattern );
 
    explicit UnrankedTree ( const RankedTree < 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 ( ) );
    }
 
    void extendAlphabet ( const ext::set < SymbolType > & symbols ) {
        this->template accessComponent < GeneralAlphabet > ( ).add ( symbols );
    }
 
    const ext::tree < SymbolType > & getContent ( ) const &;
 
    ext::tree < SymbolType > && getContent ( ) &&;
 
    void setTree ( ext::tree < SymbolType > data );
 
    auto operator <=> ( const UnrankedTree & other ) const {
        return std::tie ( m_content, getAlphabet() ) <=> std::tie ( other.m_content, other.getAlphabet() );
    }
 
    bool operator == ( const UnrankedTree & other ) const {
        return std::tie ( m_content, getAlphabet() ) == std::tie ( other.m_content, other.getAlphabet() );
    }
 
    friend ext::ostream & operator << ( ext::ostream & out, const UnrankedTree & instance ) {
        out << "(UnrankedTree";
        out << " alphabet = " << instance.getAlphabet ( );
        out << " content = " << instance.getContent ( );
        out << ")";
        return out;
    }
 
    void nicePrint ( ext::ostream & os ) const;
};
 
template < class SymbolType >
UnrankedTree < SymbolType >::UnrankedTree ( ext::set < SymbolType > alphabet, ext::tree < SymbolType > tree ) : core::Components < UnrankedTree, ext::set < SymbolType >, component::Set, GeneralAlphabet > ( std::move ( alphabet ) ), m_content ( std::move ( tree ) ) {
    checkAlphabet ( m_content );
}
 
template < class SymbolType >
UnrankedTree < SymbolType >::UnrankedTree ( ext::tree < SymbolType > pattern ) : UnrankedTree ( ext::set < SymbolType > ( pattern.prefix_begin ( ), pattern.prefix_end ( ) ), pattern ) {
}
 
template < class SymbolType >
UnrankedTree < SymbolType >::UnrankedTree ( const RankedTree < SymbolType > & other ) : UnrankedTree ( TreeAuxiliary::unrankSymbols ( other.getAlphabet ( ) ), TreeAuxiliary::rankedToUnranked ( other.getContent ( ) ) ) {
}
 
template < class SymbolType >
const ext::tree < SymbolType > & UnrankedTree < SymbolType >::getContent ( ) const & {
    return m_content;
}
 
template < class SymbolType >
ext::tree < SymbolType > && UnrankedTree < SymbolType >::getContent ( ) && {
    return std::move ( m_content );
}
 
template < class SymbolType >
void UnrankedTree < SymbolType >::checkAlphabet ( const ext::tree < SymbolType > & data ) const {
    ext::set < SymbolType > minimalAlphabet ( data.prefix_begin ( ), data.prefix_end ( ) );
    std::set_difference ( minimalAlphabet.begin ( ), minimalAlphabet.end ( ), getAlphabet ( ).begin ( ), getAlphabet ( ).end ( ), ext::callback_iterator ( [ ] ( const SymbolType & ) {
            throw TreeException ( "Input symbols not in the alphabet." );
        } ) );
}
 
template < class SymbolType >
void UnrankedTree < SymbolType >::setTree ( ext::tree < SymbolType > data ) {
    checkAlphabet ( data );
 
    this->m_content = std::move ( data );
}
 
template < class SymbolType >
void UnrankedTree < SymbolType >::nicePrint ( ext::ostream & os ) const {
    m_content.nicePrint ( os );
}
 
} /* namespace tree */
 
namespace core {
 
template < class SymbolType >
class SetConstraint< tree::UnrankedTree < SymbolType >, SymbolType, tree::GeneralAlphabet > {
public:
    static bool used ( const tree::UnrankedTree < SymbolType > & tree, const SymbolType & symbol ) {
        const ext::tree<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::UnrankedTree < SymbolType > &, const SymbolType & ) {
        return true;
    }
 
    static void valid ( const tree::UnrankedTree < SymbolType > &, const SymbolType & ) {
    }
};
 
template < class SymbolType >
struct normalize < tree::UnrankedTree < SymbolType > > {
    static tree::UnrankedTree < > eval ( tree::UnrankedTree < SymbolType > && value ) {
        ext::set < DefaultSymbolType > alphabet = alphabet::SymbolNormalize::normalizeAlphabet ( std::move ( value ).getAlphabet ( ) );
        ext::tree < DefaultSymbolType > content = tree::TreeNormalize::normalizeTree ( std::move ( value ).getContent ( ) );
 
        return tree::UnrankedTree < > ( std::move ( alphabet ), std::move ( content ) );
    }
};
 
} /* namespace core */
 
extern template class tree::UnrankedTree < >;