NodeArray.h

Go to the documentation of this file.

 
#pragma once
 
#include <ogdf/basic/Graph_d.h>
 
namespace ogdf {
 
 
 
class NodeArrayBase {
    ListIterator<NodeArrayBase*> m_it;
 
public:
    const Graph* m_pGraph; 
 
    NodeArrayBase() : m_pGraph(nullptr) { }
 
    explicit NodeArrayBase(const Graph* pG) : m_pGraph(pG) {
        if (pG) {
            m_it = pG->registerArray(this);
        }
    }
 
    NodeArrayBase(NodeArrayBase& base) : m_it(base.m_it), m_pGraph(base.m_pGraph) {
        if (m_pGraph) {
            m_pGraph->moveRegisterArray(m_it, this);
        }
        base.m_pGraph = nullptr;
        base.m_it = ListIterator<NodeArrayBase*>();
    }
 
    // destructor, unregisters the array
    virtual ~NodeArrayBase() {
        if (m_pGraph) {
            m_pGraph->unregisterArray(m_it);
        }
    }
 
    // event interface used by Graph
    virtual void enlargeTable(int newTableSize) = 0;
    virtual void reinit(int initTableSize) = 0;
    virtual void disconnect() = 0;
 
    void reregister(const Graph* pG) {
        if (m_pGraph) {
            m_pGraph->unregisterArray(m_it);
        }
        if ((m_pGraph = pG) != nullptr) {
            m_it = pG->registerArray(this);
        }
    }
 
    void moveRegister(NodeArrayBase& base) {
        if (m_pGraph) {
            m_pGraph->unregisterArray(m_it);
        }
        m_pGraph = base.m_pGraph;
        m_it = base.m_it;
        base.m_pGraph = nullptr;
        base.m_it = ListIterator<NodeArrayBase*>();
        if (m_pGraph != nullptr) {
            m_pGraph->moveRegisterArray(m_it, this);
        }
    }
};
 
 
template<class T>
class NodeArray : private Array<T>, protected NodeArrayBase {
    T m_x; 
 
public:
    using key_type = node; 
    using value_type = T; 
 
    using iterator =
            internal::GraphArrayIterator<NodeArray<T>>; 
    using const_iterator =
            internal::GraphArrayConstIterator<NodeArray<T>>; 
 
    NodeArray() : Array<T>(), NodeArrayBase() { }
 
    NodeArray(const Graph& G) : Array<T>(G.nodeArrayTableSize()), NodeArrayBase(&G) { }
 
 
    NodeArray(const Graph& G, const T& x)
        : Array<T>(0, G.nodeArrayTableSize() - 1, x), NodeArrayBase(&G), m_x(x) { }
 
 
    NodeArray(const NodeArray<T>& A) : Array<T>(A), NodeArrayBase(A.m_pGraph), m_x(A.m_x) { }
 
 
    NodeArray(NodeArray<T>&& A) : Array<T>(std::move(A)), NodeArrayBase(A), m_x(A.m_x) { }
 
 
    bool valid() const { return Array<T>::low() <= Array<T>::high(); }
 
    const Graph* graphOf() const { return m_pGraph; }
 
    const T& operator[](node v) const {
        OGDF_ASSERT(v != nullptr);
        OGDF_ASSERT(v->graphOf() == m_pGraph);
        return Array<T>::operator[](v->index());
    }
 
    T& operator[](node v) {
        OGDF_ASSERT(v != nullptr);
        OGDF_ASSERT(v->graphOf() == m_pGraph);
        return Array<T>::operator[](v->index());
    }
 
    const T& operator()(node v) const {
        OGDF_ASSERT(v != nullptr);
        OGDF_ASSERT(v->graphOf() == m_pGraph);
        return Array<T>::operator[](v->index());
    }
 
    T& operator()(node v) {
        OGDF_ASSERT(v != nullptr);
        OGDF_ASSERT(v->graphOf() == m_pGraph);
        return Array<T>::operator[](v->index());
    }
 
    OGDF_DEPRECATED("NodeArrays should be indexed by a node, not an integer index.")
 
    const T& operator[](int index) const { return Array<T>::operator[](index); }
 
    OGDF_DEPRECATED("NodeArrays should be indexed by a node, not an integer index.")
 
    T& operator[](int index) { return Array<T>::operator[](index); }
 
 
 
 
    iterator begin() { return iterator(m_pGraph->firstNode(), this); }
 
 
    const_iterator begin() const { return const_iterator(m_pGraph->firstNode(), this); }
 
 
    const_iterator cbegin() const { return const_iterator(m_pGraph->firstNode(), this); }
 
 
    iterator end() { return iterator(nullptr, this); }
 
 
    const_iterator end() const { return const_iterator(nullptr, this); }
 
 
    const_iterator cend() const { return const_iterator(nullptr, this); }
 
 
 
    void init() {
        Array<T>::init();
        reregister(nullptr);
    }
 
    void init(const Graph& G) {
        Array<T>::init(G.nodeArrayTableSize());
        reregister(&G);
    }
 
 
    void init(const Graph& G, const T& x) {
        Array<T>::init(0, G.nodeArrayTableSize() - 1, m_x = x);
        reregister(&G);
    }
 
    void fill(const T& x) {
        int high = m_pGraph->maxNodeIndex();
        if (high >= 0) {
            Array<T>::fill(0, high, x);
        }
    }
 
    NodeArray<T>& operator=(const NodeArray<T>& a) {
        Array<T>::operator=(a);
        m_x = a.m_x;
        reregister(a.m_pGraph);
        return *this;
    }
 
 
    NodeArray<T>& operator=(NodeArray<T>&& a) {
        Array<T>::operator=(std::move(a));
        m_x = a.m_x;
        moveRegister(a);
        return *this;
    }
 
 
 
    static key_type findSuccKey(key_type key) { return key->succ(); }
 
    static key_type findPredKey(key_type key) { return key->pred(); }
 
 
private:
    virtual void enlargeTable(int newTableSize) { Array<T>::resize(newTableSize, m_x); }
 
    virtual void reinit(int initTableSize) { Array<T>::init(0, initTableSize - 1, m_x); }
 
    virtual void disconnect() {
        Array<T>::init();
        m_pGraph = nullptr;
    }
 
    OGDF_NEW_DELETE
};
 
}