PrefixRankedPattern.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 PrefixRankedPattern;
 
} /* 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 <tree/common/TreeAuxiliary.h>
 
#include <alphabet/WildcardSymbol.h>
 
#include <core/normalize.hpp>
#include <tree/common/TreeNormalize.h>
 
#include <string/LinearString.h>
 
#include "RankedPattern.h"
#include "PrefixRankedTree.h"
 
namespace tree {
 
class GeneralAlphabet;
class SubtreeWildcard;
 
template < class SymbolType >
class PrefixRankedPattern final : public core::Components < PrefixRankedPattern < SymbolType >, ext::set < common::ranked_symbol < SymbolType > >, component::Set, GeneralAlphabet, common::ranked_symbol < SymbolType >, component::Value, SubtreeWildcard > {
    ext::vector < common::ranked_symbol < SymbolType > > m_Data;
 
    void arityChecksum ( const ext::vector < common::ranked_symbol < SymbolType > > & data );
 
public:
    explicit PrefixRankedPattern ( common::ranked_symbol < SymbolType > subtreeWildcard, ext::set < common::ranked_symbol < SymbolType > > alphabet, ext::vector < common::ranked_symbol < SymbolType > > data );
 
    explicit PrefixRankedPattern ( common::ranked_symbol < SymbolType > subtreeWildcard, ext::vector < common::ranked_symbol < SymbolType > > data );
 
    explicit PrefixRankedPattern ( const PrefixRankedTree < SymbolType > & tree );
 
    explicit PrefixRankedPattern ( const RankedPattern < 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 common::ranked_symbol < SymbolType > & getSubtreeWildcard ( ) const & {
        return this->template accessComponent < SubtreeWildcard > ( ).get ( );
    }
 
    common::ranked_symbol < SymbolType > && getSubtreeWildcard ( ) && {
        return std::move ( this->template accessComponent < SubtreeWildcard > ( ).get ( ) );
    }
 
    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 PrefixRankedPattern & other ) const {
        return std::tie ( m_Data, getAlphabet ( ), getSubtreeWildcard ( ) ) <=> std::tie ( other.m_Data, other.getAlphabet ( ), other.getSubtreeWildcard ( ) );
    }
 
    bool operator == ( const PrefixRankedPattern & other ) const {
        return std::tie ( m_Data, getAlphabet ( ), getSubtreeWildcard ( ) ) == std::tie ( other.m_Data, other.getAlphabet ( ), other.getSubtreeWildcard ( ) );
    }
 
    friend ext::ostream & operator << ( ext::ostream & out, const PrefixRankedPattern & instance ) {
        out << "(PrefixRankedPattern";
        out << " alphabet = " << instance.getAlphabet ( );
        out << " content = " << instance.getContent ( );
        out << " subtreeWildcard = " << instance.getSubtreeWildcard ( );
        out << ")";
        return out;
    }
 
    explicit operator string::LinearString < common::ranked_symbol < SymbolType > > ( ) const {
        return string::LinearString < common::ranked_symbol < SymbolType > > ( getAlphabet ( ), getContent ( ) );
    }
};
 
template < class SymbolType >
PrefixRankedPattern < SymbolType >::PrefixRankedPattern ( common::ranked_symbol < SymbolType > subtreeWildcard, ext::set < common::ranked_symbol < SymbolType > > alphabet, ext::vector < common::ranked_symbol < SymbolType > > data ) : core::Components < PrefixRankedPattern, ext::set < common::ranked_symbol < SymbolType > >, component::Set, GeneralAlphabet, common::ranked_symbol < SymbolType >, component::Value, SubtreeWildcard > ( std::move ( alphabet ), std::move ( subtreeWildcard ) ) {
    setContent ( std::move ( data ) );
}
 
template < class SymbolType >
PrefixRankedPattern < SymbolType >::PrefixRankedPattern ( common::ranked_symbol < SymbolType > subtreeWildcard, ext::vector < common::ranked_symbol < SymbolType > > data ) : PrefixRankedPattern ( subtreeWildcard, ext::set < common::ranked_symbol < SymbolType > > ( data.begin ( ), data.end ( ) ) + ext::set < common::ranked_symbol < SymbolType > > { subtreeWildcard }, data ) {
}
 
template < class SymbolType >
PrefixRankedPattern < SymbolType >::PrefixRankedPattern ( const PrefixRankedTree < SymbolType > & tree ) : PrefixRankedPattern ( alphabet::WildcardSymbol::instance < common::ranked_symbol < SymbolType > > ( ), tree.getAlphabet ( ) + ext::set < common::ranked_symbol < SymbolType > > { alphabet::WildcardSymbol::instance < common::ranked_symbol < SymbolType > > ( ) }, tree.getContent ( ) ) {
}
 
template < class SymbolType >
PrefixRankedPattern < SymbolType >::PrefixRankedPattern ( const RankedPattern < SymbolType > & tree ) : PrefixRankedPattern ( tree.getSubtreeWildcard ( ), tree.getAlphabet ( ), TreeAuxiliary::treeToPrefix ( tree.getContent ( ) ) ) {
}
 
template < class SymbolType >
const ext::vector < common::ranked_symbol < SymbolType > > & PrefixRankedPattern < SymbolType >::getContent ( ) const & {
    return this->m_Data;
}
 
template < class SymbolType >
ext::vector < common::ranked_symbol < SymbolType > > && PrefixRankedPattern < SymbolType >::getContent ( ) && {
    return std::move ( this->m_Data );
}
 
template < class SymbolType >
void PrefixRankedPattern < 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 PrefixRankedPattern < 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 PrefixRankedPattern < SymbolType >::isEmpty ( ) const {
    return this->m_Data.empty ( );
}
 
} /* namespace tree */
 
namespace core {
 
template < class SymbolType >
class SetConstraint< tree::PrefixRankedPattern < SymbolType >, common::ranked_symbol < SymbolType >, tree::GeneralAlphabet > {
public:
    static bool used ( const tree::PrefixRankedPattern < SymbolType > & pattern, const common::ranked_symbol < SymbolType > & symbol ) {
        const ext::vector < common::ranked_symbol < SymbolType > > & content = pattern.getContent ( );
 
        return std::find ( content.begin ( ), content.end ( ), symbol ) != content.end ( ) || pattern.template accessComponent < tree::SubtreeWildcard > ( ).get ( ) == symbol;
    }
 
    static bool available ( const tree::PrefixRankedPattern < SymbolType > &, const common::ranked_symbol < SymbolType > & ) {
        return true;
    }
 
    static void valid ( const tree::PrefixRankedPattern < SymbolType > &, const common::ranked_symbol < SymbolType > & ) {
    }
};
 
template < class SymbolType >
class ElementConstraint< tree::PrefixRankedPattern < SymbolType >, common::ranked_symbol < SymbolType >, tree::SubtreeWildcard > {
public:
    static bool available ( const tree::PrefixRankedPattern < SymbolType > & pattern, const common::ranked_symbol < SymbolType > & symbol ) {
        return pattern.template accessComponent < tree::GeneralAlphabet > ( ).get ( ).count ( symbol );
    }
 
    static void valid ( const tree::PrefixRankedPattern < SymbolType > &, const common::ranked_symbol < SymbolType > & symbol) {
        if( symbol.getRank() != 0 )
            throw tree::TreeException ( "SubtreeWildcard symbol has nonzero arity" );
    }
};
 
template < class SymbolType >
struct normalize < tree::PrefixRankedPattern < SymbolType > > {
    static tree::PrefixRankedPattern < > eval ( tree::PrefixRankedPattern < SymbolType > && value ) {
        common::ranked_symbol < DefaultSymbolType > wildcard = alphabet::SymbolNormalize::normalizeRankedSymbol ( std::move ( value ).getSubtreeWildcard ( ) );
        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::PrefixRankedPattern < > ( std::move ( wildcard ), std::move ( alphabet ), std::move ( content ) );
    }
};
 
} /* namespace core */
 
extern template class tree::PrefixRankedPattern < >;