Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
UnrankedTree.h
Go to the documentation of this file.
1
6/*
7 * This file is part of Algorithms library toolkit.
8 * Copyright (C) 2017 Jan Travnicek (jan.travnicek@fit.cvut.cz)
9
10 * Algorithms library toolkit is free software: you can redistribute it and/or modify
11 * it under the terms of the GNU General Public License as published by
12 * the Free Software Foundation, either version 3 of the License, or
13 * (at your option) any later version.
14
15 * Algorithms library toolkit is distributed in the hope that it will be useful,
16 * but WITHOUT ANY WARRANTY; without even the implied warranty of
17 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18 * GNU General Public License for more details.
19
20 * You should have received a copy of the GNU General Public License
21 * along with Algorithms library toolkit. If not, see <http://www.gnu.org/licenses/>.
22 */
23
24#pragma once
25
28#include "../common/TreeFromXMLParser.h"
29#include "../common/TreeToXMLComposer.h"
30
31namespace core {
32
33template < class SymbolType >
34struct xmlApi < tree::UnrankedTree < SymbolType > > {
42 static std::string xmlTagName() {
43 return "UnrankedTree";
44 }
45
53 static bool first ( const ext::deque < sax::Token >::const_iterator & input ) {
55 }
56
65
72 static void compose ( ext::deque < sax::Token > & out, const tree::UnrankedTree < SymbolType > & tree );
73};
74
75template < class SymbolType >
78 ext::set < SymbolType > rankedAlphabet = tree::TreeFromXMLParser::parseAlphabet < SymbolType > ( input );
79 ext::tree < SymbolType > root = tree::TreeFromXMLParser::parseTreeContent < SymbolType > ( input );
80 tree::UnrankedTree < SymbolType > tree ( std::move ( rankedAlphabet ), std::move ( root ) );
81
83 return tree;
84}
85
86template < class SymbolType >
88 out.emplace_back ( xmlTagName ( ), sax::Token::TokenType::START_ELEMENT );
89 tree::TreeToXMLComposer::composeAlphabet ( out, tree.getAlphabet ( ) );
90 tree::TreeToXMLComposer::composeContent ( out, tree.getContent ( ) );
91 out.emplace_back ( xmlTagName ( ), sax::Token::TokenType::END_ELEMENT );
92}
93
94} /* namespace core */
95
Class extending the deque class from the standard library. Original reason is to allow printing of th...
Definition: deque.hpp:44
Definition: set.hpp:44
Class introducing a tree with interface trying to be close to the interface of standard library conta...
Definition: tree.hpp:52
static void popToken(ext::deque< Token >::iterator &input, Token::TokenType type, const std::string &data)
Definition: FromXMLParserHelper.cpp:39
static bool isToken(ext::deque< Token >::const_iterator input, Token::TokenType type, const std::string &data)
Definition: FromXMLParserHelper.cpp:29
static void composeAlphabet(ext::deque< sax::Token > &out, const ext::set< SymbolType > &symbols)
Definition: TreeToXMLComposer.h:86
static void composeContent(ext::deque< sax::Token > &out, const ext::vector< SymbolType > &content)
Definition: TreeToXMLComposer.h:96
Tree represented in its natural representation. The representation is so called unranked,...
Definition: UnrankedTree.h:69
Definition: normalize.hpp:10
Definition: BackwardOccurrenceTest.h:17
static bool first(const ext::deque< sax::Token >::const_iterator &input)
Tests whether the token stream starts with this type.
Definition: UnrankedTree.h:53
static std::string xmlTagName()
The XML tag name of class.
Definition: UnrankedTree.h:42
Definition: xmlApi.hpp:27