NodeSet.h

Go to the documentation of this file.

 
#pragma once
 
#include <ogdf/basic/List.h>
#include <ogdf/basic/NodeArray.h>
 
namespace ogdf {
 
 
template<bool SupportFastSizeQuery = true>
class NodeSet {
public:
    using ListType =
            typename std::conditional<SupportFastSizeQuery, List<node>, ListPure<node>>::type;
 
    explicit NodeSet(const Graph& G) : m_it(G) { }
 
 
    void insert(node v) {
        OGDF_ASSERT(v->graphOf() == m_it.graphOf());
        ListIterator<node>& itV = m_it[v];
 
        if (!itV.valid()) {
            itV = m_nodes.pushBack(v);
        }
    }
 
 
    void remove(node v) {
        OGDF_ASSERT(v->graphOf() == m_it.graphOf());
        ListIterator<node>& itV = m_it[v];
 
        if (itV.valid()) {
            m_nodes.del(itV);
            itV = ListIterator<node>();
        }
    }
 
 
    void clear() {
        m_it.init(graphOf());
        m_nodes.clear();
    }
 
 
    bool isMember(node v) const {
        OGDF_ASSERT(v->graphOf() == m_it.graphOf());
        return m_it[v].valid();
    }
 
    const ListType& nodes() const { return m_nodes; }
 
    const Graph& graphOf() const { return *m_it.graphOf(); }
 
 
    int size() const { return m_nodes.size(); }
 
    template<bool OtherSupportsFastSizeQuery>
    NodeSet(const NodeSet<OtherSupportsFastSizeQuery>& other) : m_it(other.graphOf()) {
        this = other;
    }
 
    template<bool OtherSupportsFastSizeQuery>
    NodeSet& operator=(const NodeSet<OtherSupportsFastSizeQuery>& other) {
        m_nodes.clear();
        m_it.init(other.graphOf());
        for (node v : other.nodes()) {
            insert(v);
        }
    }
 
private:
    NodeArray<ListIterator<node>> m_it;
 
    ListType m_nodes;
};
 
}