PCTreeIterators.h

Go to the documentation of this file.

 
#pragma once
 
#include <ogdf/basic/pctree/PCEnum.h>
#include <ogdf/basic/pctree/PCNode.h>
 
#include <deque>
#include <utility>
 
namespace ogdf::pc_tree {
class OGDF_EXPORT PCNodeIterator {
    friend struct PCNodeChildrenIterable;
    friend struct PCNodeNeighborsIterable;
 
    PCNode* m_node = nullptr;
    PCNode* m_pred = nullptr;
    PCNode* m_curr = nullptr;
 
    PCNodeIterator(PCNode* node, PCNode* pred, PCNode* curr)
        : m_node(node), m_pred(pred), m_curr(curr) { }
 
public:
    using iterator_category = std::forward_iterator_tag;
    using value_type = PCNode;
    using pointer = PCNode*;
    using reference = PCNode&;
    using difference_type = std::ptrdiff_t;
 
    PCNodeIterator() = default;
 
    PCNode& operator->() const { return *m_curr; }
 
    PCNode* operator*() const { return m_curr; }
 
    PCNodeIterator& operator++();
 
    PCNodeIterator operator++(int);
 
    bool operator==(const PCNodeIterator& rhs) const {
        return m_node == rhs.m_node && m_pred == rhs.m_pred && m_curr == rhs.m_curr;
    }
 
    bool operator!=(const PCNodeIterator& rhs) const { return !(rhs == *this); }
 
    PCNode* nodeOf() const { return m_node; }
 
    bool isParent();
};
 
struct OGDF_EXPORT PCNodeChildrenIterable {
    PCNode* const m_node;
 
    explicit PCNodeChildrenIterable(PCNode* node) : m_node(node) { }
 
    PCNodeIterator begin() const noexcept;
 
    PCNodeIterator end() const noexcept;
 
    unsigned long count() const;
};
 
struct OGDF_EXPORT PCNodeNeighborsIterable {
    PCNode* const m_node;
    PCNode* const m_first;
 
    explicit PCNodeNeighborsIterable(PCNode* node, PCNode* first = nullptr)
        : m_node(node)
        , m_first(first != nullptr
                          ? first
                          : (node->m_child1 != nullptr ? node->m_child1 : node->getParent())) {
        if (this->m_first == nullptr) {
            OGDF_ASSERT(this->m_node->getDegree() == 0);
        } else {
            OGDF_ASSERT(this->m_node->isParentOf(this->m_first)
                    || this->m_first->isParentOf(this->m_node));
        }
    }
 
    PCNodeIterator begin() const noexcept;
 
    PCNodeIterator end() const noexcept;
 
    unsigned long count() const;
};
 
template<bool dfs, bool reverse = false>
class FilteringPCTreeWalk {
    using container_type =
            typename std::conditional<dfs, std::vector<PCNode*>, std::deque<PCNode*>>::type;
 
    container_type m_pending;
    std::function<bool(PCNode*)> m_visit;
    std::function<bool(PCNode*)> m_descend;
 
public:
    // iterator traits
    using iterator_category = std::input_iterator_tag;
    using value_type = PCNode*;
    using difference_type = std::ptrdiff_t;
    using pointer = PCNode**;
    using reference = PCNode*&;
 
    static bool return_true([[maybe_unused]] PCNode* n) { return true; }
 
    explicit FilteringPCTreeWalk() = default;
 
    explicit FilteringPCTreeWalk([[maybe_unused]] const PCTree& T, PCNode* start,
            std::function<bool(PCNode*)> visit = return_true,
            std::function<bool(PCNode*)> descend_from = return_true)
        : m_pending({start}), m_visit(std::move(visit)), m_descend(std::move(descend_from)) {
        if (!m_pending.empty() && !m_visit(top())) {
            next();
        }
    }
 
    bool operator==(const FilteringPCTreeWalk& rhs) const { return m_pending == rhs.m_pending; }
 
    bool operator!=(const FilteringPCTreeWalk& rhs) const { return m_pending != rhs.m_pending; }
 
    FilteringPCTreeWalk& begin() { return *this; }
 
    FilteringPCTreeWalk end() const { return FilteringPCTreeWalk(); }
 
    PCNode* top() {
        OGDF_ASSERT(!m_pending.empty());
        if constexpr (dfs) {
            return m_pending.back();
        } else {
            return m_pending.front();
        }
    }
 
    PCNode* operator*() { return top(); }
 
    FilteringPCTreeWalk& operator++() {
        next();
        return *this;
    }
 
    OGDF_DEPRECATED("Calling FilteringPCTreeWalk++ will copy the array of pending nodes")
 
    FilteringPCTreeWalk operator++(int) {
        FilteringPCTreeWalk before = *this;
        next();
        return before;
    }
 
    void next() {
        do {
            OGDF_ASSERT(!m_pending.empty());
            PCNode* node = top();
            if constexpr (dfs) {
                m_pending.pop_back();
            } else {
                m_pending.pop_front();
            }
            if (m_descend(node)) {
                std::copy(node->children().begin(), node->children().end(),
                        std::back_inserter(m_pending));
                if constexpr (reverse) {
                    std::reverse(m_pending.end() - node->getChildCount(), m_pending.end());
                }
            }
        } while (!m_pending.empty() && !m_visit(top()));
    }
 
    explicit operator bool() const { return valid(); }
 
    bool valid() const { return !m_pending.empty(); }
 
    void append(PCNode* a) { m_pending.push(a); }
 
    int pendingCount() const { return m_pending.size(); }
};
 
using FilteringPCTreeDFS = FilteringPCTreeWalk<true>;
using FilteringPCTreeBFS = FilteringPCTreeWalk<false>;
}