AdjEntryArray.h

Go to the documentation of this file.

/*
 * $Revision: 2615 $
 *
 * last checkin:
 *   $Author: gutwenger $
 *   $Date: 2012-07-16 14:23:36 +0200 (Mo, 16. Jul 2012) $
 ***************************************************************/

#ifdef _MSC_VER
#pragma once
#endif

#ifndef OGDF_ADJ_ENTRY_ARRAY_H
#define OGDF_ADJ_ENTRY_ARRAY_H


#include <ogdf/basic/Graph.h>


namespace ogdf {



class AdjEntryArrayBase {
    ListIterator<AdjEntryArrayBase*> m_it;

public:
    const Graph *m_pGraph; 

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

    // destructor, unregisters the array
    virtual ~AdjEntryArrayBase() {
        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;
    virtual void resetIndex(int newIndex, int oldIndex) = 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 AdjEntryArrayBase



template<class T> class AdjEntryArray : private Array<T>, protected AdjEntryArrayBase {
    T m_x; 

public:
    AdjEntryArray() : Array<T>(), AdjEntryArrayBase() { }
    AdjEntryArray(const Graph &G) : Array<T>(G.adjEntryArrayTableSize()), AdjEntryArrayBase(&G) { }

    AdjEntryArray(const Graph &G, const T &x) :
        Array<T>(0,G.adjEntryArrayTableSize()-1,x), AdjEntryArrayBase(&G), m_x(x) { }

    AdjEntryArray(const AdjEntryArray<T> &A) : Array<T>(A), AdjEntryArrayBase(A.m_pGraph), m_x(A.m_x) { }

    bool valid() const { return (Array<T>::low() <= Array<T>::high()); }

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

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


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


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

    AdjEntryArray<T> &operator=(const AdjEntryArray<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.adjEntryArrayTableSize()); reregister(&G);
    }


    void init(const Graph &G, const T &x) {
        Array<T>::init(0,G.adjEntryArrayTableSize()-1, m_x = x); reregister(&G);
    }

    void fill(const T &x) {
        int high = m_pGraph->maxAdjEntryIndex();
        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 resetIndex(int newIndex, int oldIndex) {
        Array<T>::operator [](newIndex) = Array<T>::operator [](oldIndex);
    }

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

    OGDF_NEW_DELETE

}; // class AdjEntryArray<T>


} // end namespace ogdf


#endif