RankedPattern.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 <tree/ranked/RankedPattern.h>
#include <sax/FromXMLParserHelper.h>
#include <alphabet/xml/RankedSymbol.h>
#include "../common/TreeFromXMLParser.h"
#include "../common/TreeToXMLComposer.h"
 
namespace core {
 
template < class SymbolType >
struct xmlApi < tree::RankedPattern < SymbolType > > {
    static std::string xmlTagName() {
        return "RankedPattern";
    }
 
    static bool first ( const ext::deque < sax::Token >::const_iterator & input ) {
        return sax::FromXMLParserHelper::isToken ( input, sax::Token::TokenType::START_ELEMENT, xmlTagName ( ) );
    }
 
    static tree::RankedPattern < SymbolType > parse ( ext::deque < sax::Token >::iterator & input );
 
    static void compose ( ext::deque < sax::Token > & out, const tree::RankedPattern < SymbolType > & pattern );
};
 
template < class SymbolType >
tree::RankedPattern < SymbolType > xmlApi < tree::RankedPattern < SymbolType > >::parse ( ext::deque < sax::Token >::iterator & input ) {
    sax::FromXMLParserHelper::popToken ( input, sax::Token::TokenType::START_ELEMENT, xmlTagName ( ) );
    common::ranked_symbol < SymbolType > subtreeWildcardSymbol = tree::TreeFromXMLParser::parseWildcardSymbol < common::ranked_symbol < SymbolType > > ( input );
    ext::set < common::ranked_symbol < SymbolType > > rankedAlphabet = tree::TreeFromXMLParser::parseAlphabet < common::ranked_symbol < SymbolType > > ( input );
    ext::tree < common::ranked_symbol < SymbolType > > root = tree::TreeFromXMLParser::parseTreeContent < common::ranked_symbol < SymbolType > > ( input );
    tree::RankedPattern < SymbolType > tree ( std::move ( subtreeWildcardSymbol ), std::move ( rankedAlphabet ), std::move ( root ) );
 
    sax::FromXMLParserHelper::popToken ( input, sax::Token::TokenType::END_ELEMENT, xmlTagName ( ) );
    return tree;
}
 
template < class SymbolType >
void xmlApi < tree::RankedPattern < SymbolType > >::compose ( ext::deque < sax::Token > & out, const tree::RankedPattern < SymbolType > & pattern ) {
    out.emplace_back ( xmlTagName ( ), sax::Token::TokenType::START_ELEMENT );
    tree::TreeToXMLComposer::composeSubtreeWildcard ( out, pattern.getSubtreeWildcard() );
    tree::TreeToXMLComposer::composeAlphabet ( out, pattern.getAlphabet() );
    tree::TreeToXMLComposer::composeContent ( out, pattern.getContent ( ) );
    out.emplace_back ( xmlTagName ( ), sax::Token::TokenType::END_ELEMENT );
}
 
} /* namespace core */