// Copyright (C) 2018 xaizek <xaizek@posteo.net>
//
// This file is part of zograscope.
//
// zograscope is free software: you can redistribute it and/or modify
// it under the terms of version 3 of the GNU Affero General Public License as
// published by the Free Software Foundation.
//
// zograscope 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 Affero General Public License for more details.
//
// You should have received a copy of the GNU Affero General Public License
// along with zograscope. If not, see <http://www.gnu.org/licenses/>.
#ifndef ZOGRASCOPE_NODERANGE_HPP_
#define ZOGRASCOPE_NODERANGE_HPP_
#include <algorithm>
#include <iterator>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <boost/range/adaptor/reversed.hpp>
#include <boost/range/iterator_range.hpp>
#include "tree.hpp"
namespace guts {
// Storage for range iterator data.
struct NodeRangeData
{
// Initializes data from a node.
explicit NodeRangeData(const Node *node)
{
toVisit.emplace(node);
current = nullptr;
}
std::stack<const Node *> toVisit; // Unvisited nodes.
const Node *current; // Current node.
};
// Iterator over all nodes.
class NodeIterator
: public boost::iterator_facade<
NodeIterator,
const Node *,
std::input_iterator_tag
>
{
friend class boost::iterator_core_access;
public:
// Constructs empty (end) iterator.
NodeIterator() : rd(nullptr)
{ }
// Constructs non-empty iterator.
NodeIterator(NodeRangeData *rd) : rd(rd)
{ increment(); }
private:
// Advances to the next node.
void increment()
{
while (!rd->toVisit.empty()) {
const Node &node = *rd->toVisit.top();
rd->toVisit.pop();
if (node.next != nullptr) {
rd->toVisit.push(node.next);
continue;
}
for (const Node *child : boost::adaptors::reverse(node.children)) {
rd->toVisit.push(child);
}
rd->current = &node;
return;
}
// Turn into end iterator.
*this = NodeIterator();
}
// Checks whether two iterators are equal.
bool equal(const NodeIterator &that) const
{ return rd == that.rd; }
// Retrieves value of a valid iterator (not end iterator).
const Node * & dereference() const
{ return rd->current; }
private:
// Pointer to data storage.
NodeRangeData *rd;
};
using NodeRangeBase = boost::iterator_range<NodeIterator>;
}
// Range iterator over all nodes of a tree.
class NodeRange : private guts::NodeRangeData, public guts::NodeRangeBase
{
public:
explicit NodeRange(const Node *node)
: guts::NodeRangeData(node),
guts::NodeRangeBase(guts::NodeIterator(this), guts::NodeIterator())
{ }
};
#endif // ZOGRASCOPE_NODERANGE_HPP_
Before first commit, do not forget to setup your git environment:
git config --global user.name "your_name_here"
git config --global user.email "your@email_here"
Clone this repository using HTTP(S):
git clone https://code.reversed.top/user/xaizek/zograscope
Clone this repository using ssh (do not forget to upload a key first):
git clone ssh://rocketgit@code.reversed.top/user/xaizek/zograscope
You are allowed to anonymously push to this repository.
This means that your pushed commits will automatically be transformed into a
pull request:
... clone the repository ...
... make some changes and some commits ...
git push origin master