ne_map.h

Go to the documentation of this file. Or view the newest version in sPHENIX GitHub for file ne_map.h

/* This software is distributed under the GNU Lesser General Public License */
//==========================================================================
//
//   ne_map.h - common implementation of node_map and edge_map
//
//==========================================================================
// $Id: ne_map.h,v 1.20 2005/06/14 12:22:12 raitner Exp $

#ifndef GTL_NE_MAP_H
#define GTL_NE_MAP_H

#include <GTL/GTL.h>

#include <vector>
#include <cassert>

//--------------------------------------------------------------------------
//   Class declaration
//--------------------------------------------------------------------------

__GTL_BEGIN_NAMESPACE

template <class Key, class Value, class Graph, class Alloc = allocator<Value> > 
class ne_map
{
protected:
    
    //================================================== Constructors

    ne_map();

    explicit ne_map(const Graph &g, Value def=Value());

    //================================================== Operations
    
public:

    void init(const Graph &, Value def=Value());

#if defined(__GTL_MSVCC) && _MSC_VER < 1310
    typedef Value& value_reference;
#else
    typedef typename vector<Value, Alloc>::reference value_reference;
#endif

#if defined(__GTL_MSVCC) && _MSC_VER < 1310
    typedef const Value& const_value_reference;
#else
    typedef typename vector<Value, Alloc>::const_reference const_value_reference;
#endif
    
    value_reference operator[](Key key);

    const_value_reference operator[](Key key) const;

    void clear ();

    //================================================== Implementation
    
private:
    vector<Value, Alloc> data;
};

// Implementation Begin

template <class Key, class Value, class Graph, class Alloc>
  ne_map<Key,Value,Graph,Alloc>::ne_map()
{
}

template <class Key, class Value, class Graph, class Alloc>
ne_map<Key,Value,Graph,Alloc>::ne_map(const Graph &g, Value t2) :
    data(g.number_of_ids(Key()), t2)
{
}

template <class Key, class Value, class Graph, class Alloc>
void ne_map<Key,Value,Graph,Alloc>::init(const Graph &g, Value t2)
{
    int n = g.number_of_ids(Key());
    data.resize(n);
    fill_n(data.begin(), n, t2);
}

template <class Key, class Value, class Graph, class Alloc>
typename ne_map<Key,Value,Graph,Alloc>::value_reference ne_map<Key,Value,Graph,Alloc>::operator[](Key t1)
{
    if(t1.id() >= (signed)data.size())
    {
        if (t1.id() >= (signed)data.capacity()) {
            data.reserve((6 * t1.id()) / 5 + 1);
        }

        data.insert(data.end(), t1.id()+1-data.size(), Value());
    }
    return data.operator[](t1.id());
}

template <class Key, class Value, class Graph, class Alloc>
typename ne_map<Key,Value,Graph,Alloc>::const_value_reference ne_map<Key,Value,Graph,Alloc>::operator[](Key t1) const
{
    assert(t1.id() < (signed)data.size());
    return data.operator[](t1.id());
}

template <class Key, class Value, class Graph, class Alloc>
void ne_map<Key,Value,Graph,Alloc>::clear ()
{
    data.clear();
}

// Implementation End

__GTL_END_NAMESPACE

#endif // GTL_NE_MAP_H

//--------------------------------------------------------------------------
//   end of file
//--------------------------------------------------------------------------