PrefixRankedTree.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 PrefixRankedTree;
 
} /* namespace tree */
 
 
#include <ext/algorithm>
 
#include <alib/set>
#include <alib/vector>
#include <alib/tree>
#include <alib/deque>
 
#include <core/components.hpp>
#include <common/ranked_symbol.hpp>
 
#include <tree/TreeException.h>
 
#include <core/normalize.hpp>
#include <tree/common/TreeNormalize.h>
 
#include <string/LinearString.h>
 
#include "RankedTree.h"
 
namespace tree {
 
class GeneralAlphabet;
 
template < class SymbolType >
class PrefixRankedTree final : public core::Components < PrefixRankedTree < SymbolType >, ext::set < common::ranked_symbol < SymbolType > >, component::Set, GeneralAlphabet > {
    ext::vector < common::ranked_symbol < SymbolType > > m_Data;
 
    void arityChecksum ( const ext::vector < common::ranked_symbol < SymbolType > > & data );
 
public:
    explicit PrefixRankedTree ( ext::set < common::ranked_symbol < SymbolType > > alphabet, ext::vector < common::ranked_symbol < SymbolType > > data );
 
    explicit PrefixRankedTree ( ext::vector < common::ranked_symbol < SymbolType > > data );
 
    explicit PrefixRankedTree ( const RankedTree < SymbolType > & tree );
 
    explicit PrefixRankedTree ( const PostfixRankedTree < SymbolType > & other );
 
    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::vector < common::ranked_symbol < SymbolType > > & getContent ( ) const &;
 
    ext::vector < common::ranked_symbol < SymbolType > > && getContent ( ) &&;
 
    void setContent ( ext::vector < common::ranked_symbol < SymbolType > > data );
 
    bool isEmpty ( ) const;
 
    auto operator <=> ( const PrefixRankedTree & other ) const {
        return std::tie ( m_Data, getAlphabet() ) <=> std::tie ( other.m_Data, other.getAlphabet() );
    }
 
    bool operator == ( const PrefixRankedTree & other ) const {
        return std::tie ( m_Data, getAlphabet() ) == std::tie ( other.m_Data, other.getAlphabet() );
    }
 
    friend ext::ostream & operator << ( ext::ostream & out, const PrefixRankedTree & instance ) {
        out << "(PrefixRankedTree";
        out << " alphabet = " << instance.getAlphabet ( );
        out << " content = " << instance.getContent ( );
        out << ")";
        return out;
    }
 
    explicit operator string::LinearString < common::ranked_symbol < SymbolType > > ( ) const {
        return string::LinearString < common::ranked_symbol < SymbolType > > ( getAlphabet ( ), getContent ( ) );
    }
};
 
template < class SymbolType >
PrefixRankedTree < SymbolType >::PrefixRankedTree ( ext::set < common::ranked_symbol < SymbolType > > alphabet, ext::vector < common::ranked_symbol < SymbolType > > data ) : core::Components < PrefixRankedTree, ext::set < common::ranked_symbol < SymbolType > >, component::Set, GeneralAlphabet > ( std::move ( alphabet ) ) {
    setContent ( std::move ( data ) );
}
 
template < class SymbolType >
PrefixRankedTree < SymbolType >::PrefixRankedTree ( ext::vector < common::ranked_symbol < SymbolType > > data ) : PrefixRankedTree ( ext::set < common::ranked_symbol < SymbolType > > ( data.begin ( ), data.end ( ) ), data ) {
}
 
template < class SymbolType >
PrefixRankedTree < SymbolType >::PrefixRankedTree ( const RankedTree < SymbolType > & tree ) : PrefixRankedTree ( tree.getAlphabet ( ), TreeAuxiliary::treeToPrefix ( tree.getContent ( ) ) ) {
}
 
template < class SymbolType >
PrefixRankedTree < SymbolType >::PrefixRankedTree ( const PostfixRankedTree < SymbolType > & other) : PrefixRankedTree ( TreeAuxiliary::postfixToPrefix ( other.getContent ( ) ) ) {
}
 
template < class SymbolType >
const ext::vector < common::ranked_symbol < SymbolType > > & PrefixRankedTree < SymbolType >::getContent ( ) const & {
    return this->m_Data;
}
 
template < class SymbolType >
ext::vector < common::ranked_symbol < SymbolType > > && PrefixRankedTree < SymbolType >::getContent ( ) && {
    return std::move ( this->m_Data );
}
 
template < class SymbolType >
void PrefixRankedTree < SymbolType >::setContent ( ext::vector < common::ranked_symbol < SymbolType > > data ) {
    arityChecksum ( data );
 
    ext::set < common::ranked_symbol < SymbolType > > minimalAlphabet ( data.begin ( ), data.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." );
        } ) );
 
    this->m_Data = std::move ( data );
}
 
template < class SymbolType >
void PrefixRankedTree < SymbolType >::arityChecksum ( const ext::vector < common::ranked_symbol < SymbolType > > & data ) {
    if ( std::accumulate ( data.begin ( ), data.end ( ), 1, [ ] ( int current, const common::ranked_symbol < SymbolType > & symbol ) {
                return current + symbol.getRank ( ) - 1;
            } ) != 0 )
        throw TreeException ( "The string does not form a tree" );
}
 
template < class SymbolType >
bool PrefixRankedTree < SymbolType >::isEmpty ( ) const {
    return this->m_Data.empty ( );
}
 
} /* namespace tree */
 
namespace core {
 
template < class SymbolType >
class SetConstraint< tree::PrefixRankedTree < SymbolType >, common::ranked_symbol < SymbolType >, tree::GeneralAlphabet > {
public:
    static bool used ( const tree::PrefixRankedTree < SymbolType > & tree, const common::ranked_symbol < SymbolType > & symbol ) {
        const ext::vector < common::ranked_symbol < SymbolType > > & content = tree.getContent ( );
 
        return std::find ( content.begin ( ), content.end ( ), symbol ) != content.end ( );
    }
 
    static bool available ( const tree::PrefixRankedTree < SymbolType > &, const common::ranked_symbol < SymbolType > & ) {
        return true;
    }
 
    static void valid ( const tree::PrefixRankedTree < SymbolType > &, const common::ranked_symbol < SymbolType > & ) {
    }
};
 
template < class SymbolType >
struct normalize < tree::PrefixRankedTree < SymbolType > > {
    static tree::PrefixRankedTree < > eval ( tree::PrefixRankedTree < SymbolType > && value ) {
        ext::set < common::ranked_symbol < DefaultSymbolType > > alphabet = alphabet::SymbolNormalize::normalizeRankedAlphabet ( std::move ( value ).getAlphabet ( ) );
        ext::vector < common::ranked_symbol < DefaultSymbolType > > content = alphabet::SymbolNormalize::normalizeRankedSymbols ( std::move ( value ).getContent ( ) );
 
        return tree::PrefixRankedTree < > ( std::move ( alphabet ), std::move ( content ) );
    }
};
 
} /* namespace core */
 
extern template class tree::PrefixRankedTree < >;