/***************************************************************************
 *   Copyright (C) 2005 by Nicola Di Mauro                                 *
 *   ndm@di.uniba.it                                                       *
 *                                                                         *
 *   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.             *
 ***************************************************************************/



/* A dictionary is a collection of pairs of the form (k,v), where k is a key and v is the value
 * associated with the key k (equivalently, v is the value whose key is k). 
 */

/* The pair */

#ifndef _DICTIONARY_H
#define _DICTIONARY_H

template<class K, class E>
struct mypair {
  // data member
  K first;
  E second;

  // methods
  mypair(){}
  mypair(mypair<K,E>& the_pair){
    first = the_pair.first;
    second = the_pair.second;
  }
};


template <class K, class E>
class dictionary
{

public:
  virtual ~dictionary() {}
  
  virtual void create() = 0;		
      // create an empty dictionary
  virtual bool empty() const = 0;	
      // return true iff the dictionary is empty
  virtual int size() const = 0;		
      // return the number of pairs in the dictionary
  virtual mypair< K, E>* find(const K& k) const = 0;	
      // return the pair with key k
  virtual void insert( mypair< K, E>& p) = 0;		
      // insert the pair p into the dictionary
  virtual void erase(const K& k) = 0;	
      // delete the pair with key k
  virtual void modify(const K& k, const E& e) = 0;
      // modify the value of the pair with key k to e
};

#endif