Open Graph Drawing Framework  v.2007.11

Overview Class Hierarchy Class Index Class List Members Namespaces Source Files Search for:

NodeArray.h

Go to the documentation of this file.

/*
 * $Revision: 1.3 $
 * 
 * last checkin:
 *   $Author: gutwenger $ 
 *   $Date: 2007-11-08 16:10:37 +0100 (Do, 08 Nov 2007) $ 
 ***************************************************************/
 
#ifdef _MSC_VER
#pragma once
#endif

#ifndef OGDF_NODE_ARRAY_H
#define OGDF_NODE_ARRAY_H


#include <ogdf/basic/Graph_d.h>


namespace ogdf {



class NodeArrayBase {
    ListIterator<NodeArrayBase*> m_it;

public:
    const Graph *m_pGraph; 

    NodeArrayBase() : m_pGraph(0) { }
    NodeArrayBase(const Graph *pG) : m_pGraph(pG) {
        m_it = pG->registerArray(this);
    }

    // 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) != 0) m_it = pG->registerArray(this);
    }
}; // class NodeArrayBase



template<class T> class NodeArray : private Array<T>, protected NodeArrayBase {
    T m_x; 

public:
    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) { }

    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 != 0 && v->graphOf() == m_pGraph)
        return Array<T>::operator [](v->index());
    }

    T &operator[](node v) {
        OGDF_ASSERT(v != 0 && v->graphOf() == m_pGraph)
        return Array<T>::operator [](v->index());
    }


    const T &operator[](int index) const {
        return Array<T>::operator [](index);
    }


    T &operator[](int index) {
        return Array<T>::operator [](index);
    }

    NodeArray<T> &operator=(const NodeArray<T> &a) {
        Array<T>::operator =(a);
        m_x = a.m_x;
        reregister(a.m_pGraph);
        return *this;
    }

    void init() {
        Array<T>::init(); reregister(0);
    }

    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);
    }

private:
    virtual void enlargeTable(int newTableSize) {
        Array<T>::grow(newTableSize-Array<T>::size(),m_x);
    }

    virtual void reinit(int initTableSize) {
        Array<T>::init(0,initTableSize-1,m_x);
    }

    virtual void disconnect() {
        Array<T>::init();
        m_pGraph = 0;
    }

    OGDF_NEW_DELETE

}; // class NodeArray<T>


} // end namespace ogdf

#include <ogdf/basic/Graph.h>

#endif

---