bimap.h

/*
  MusicXML Library
  Copyright (C) Grame 2006-2013
 
  This Source Code Form is subject to the terms of the Mozilla Public
  License, v. 2.0. If a copy of the MPL was not distributed with this
  file, You can obtain one at http://mozilla.org/MPL/2.0/.
 
  Grame Research Laboratory, 11, cours de Verdun Gensoul 69002 Lyon - France
  research@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() {}
 
        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) ? this->end() : multimap<T1,T2>::insert(x); }
        iterator insert (iterator position, const pair<T1,T2>& x)  
            { return exist (x) ? this->end() : multimap<T1,T2>::insert(position, x); }
 
    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!=this->end()) && (i->first==x.first); i++)
                    if (i->second == x.second) return true;
                return false;
            }
 
};
 
 
#endif