---

mapc.h

Go to the documentation of this file.

/*
Copyright (C) 1999  Carsten Winkelholz

Address:  FGAN Forschungsgesellschaft f�r Angewandte Naturwissenschaften e. V.
      Neuenahrer Str. 20
      D - 53343 Wachtberg
      
Email:    winkelholz@fgan.de

This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License
as published by the Free Software Foundation; either version 2
of the License, or (at your option) any later version.

This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU General Public License for more details.

You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
*/


#ifndef MAPC_H
#define MAPC_H



#include <assert.h>
#include "idmapc.h"

#include "../oawconfig.h"

OAW_BEGIN_NAMESPACE

template <class Key, class Value>
class MapC
{
public:
  MapC(){}
  MapC(const MapC<Key,Value>& a){
    m_keys = a.m_keys;
    m_values = a.m_values;
    m_occupied = a.m_occupied;
    m_freeIndexes = a.m_freeIndexes;
    m_blanc = a.m_blanc;
  }

  void SetBlanc(const Value& t){m_blanc = t;}

  void set(Key k, const Value& v){
    long ix = lookupIndex(k);
    if(ix<=0){
      if(m_freeIndexes.size()==0){
        m_values.push_back(v);
        m_keys.push_back(k);
        m_occupied.push_back(1);
      }else{
        m_freeIndexes.pop_back(ix);
        m_values[ix]=v;
        m_keys[ix]=k;
        m_occupied[ix]=1;
      }
    }else{
      m_values[ix]=v;
    }
  }

  inline const Value& get(const Key& k) const{
    long ix = lookupIndex(k);
    if(ix<0){return m_blanc;}
    return m_values.get(ix);
  }

  void RemoveKey(const Key& key){
    long ix = lookupIndex(i);
    if(ix<0){return;}
    m_occupied[ix]=0;
    m_freeIndexes.push_back(ix);
  }

  void Empty(){
    m_values.Empty();
    m_keys.Empty();
  }

  const MapC<Key,Value>& operator = (const MapC<Key,Value>& a){
    m_keys = a.m_keys;
    m_values = a.m_values;
    m_occupied = a.m_occupied;
    m_freeIndexes = a.m_freeIndexes;
    m_blanc = a.m_blanc;
    return *this;
  }

  inline long size() const {return m_keys.size();}

protected:

  long lookupIndex(const Key& k) const{
    long i;
    for(i=0;i<m_keys.size();i++){
      if(m_occupied.get(i) && m_keys.get(i)==k){
        return i;
      }
    }
    return -1;
  }

protected:
  ArrayC<Key> m_keys;
  ArrayC<Value> m_values;
  Value m_blanc;

  ArrayC<long> m_freeIndexes;
  ArrayC<short> m_occupied;
};

OAW_END_NAMESPACE


#endif

---