bimap.h

/*

  MusicXML Library
  Copyright (C) 2003  Grame

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

  This library 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
  Lesser General Public License for more details.

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

  Grame Research Laboratory, 9 rue du Garet, 69001 Lyon - France
  grame@grame.fr

*/

#ifndef __bimap__
#define __bimap__

#include <map>
#include <iterator>
#include <utility>
using namespace std;

template <typename T1, typename T2> 
class bimap {
    public:
        bimap() {}
        bimap(const T1 tbl1[], const T2 tbl2[], int n);
        virtual ~bimap() {}
        
        const T2 operator[] (const T1 key)      { return fT1Map[key]; }
        const T1 operator[] (const T2 key)      { return fT2Map[key]; }
        long size()     { return fT1Map.size(); }

        bimap& add (const T1& v1, const T2& v2) 
            { fT1Map[v1]=v2; fT2Map[v2]=v1; return *this; }

    private:
        map<T1, T2> fT1Map;
        map<T2, T1> fT2Map;
};

template <typename T1, typename T2>
bimap<T1, T2>::bimap(const T1 tbl1[], const T2 tbl2[], int n)
{ 
    for (int i=0; i<n; i++) {
        add(tbl1[i], tbl2[i]);
    }
}

template <typename T1, typename T2> 
class pairmap : public multimap<T1,T2> {
    public:
        pairmap() {}
        virtual ~pairmap() {}

#ifdef __MWERKS__ // this is for Code Warrior version 8.3
        multimap<T1,T2>::iterator insert (const pair<T1,T2>& x)  
            { return exist (x) ? end() : multimap<T1,T2>::insert(x); }

        multimap<T1,T2>::iterator insert (multimap<T1,T2>::iterator position, const pair<T1,T2>& x)  
            { return exist (x) ? end() : multimap<T1,T2>::insert(position, x); }
#else
        typedef typename pairmap<T1,T2>::iterator iterator;
        typedef typename pairmap<T1,T2>::const_iterator const_iterator;

        iterator insert (const pair<T1,T2>& x)  
            { return exist (x) ? end() : multimap<T1,T2>::insert(x); }

        iterator insert (iterator position, const pair<T1,T2>& x)  
            { return exist (x) ? end() : multimap<T1,T2>::insert(position, x); }
#endif

    private:
        // the method is private so that pairmap and multimap remains fully interchangeable
        bool exist (const pair<T1,T2>& x) const { 
                for (const_iterator i=find(x.first); (i!=end()) && (i->first==x.first); i++)
                    if (i->second == x.second) return true;
                return false;
            }

};


#endif

---