109 lines
2.7 KiB
C++
109 lines
2.7 KiB
C++
/*
|
|
<bimap.h>
|
|
Copyright (C) DOLPHIN Project-Team, INRIA Lille - Nord Europe, 2006-2012
|
|
|
|
Alexandre Quemy, Thibault Lasnier - INSA Rouen
|
|
|
|
This software is governed by the CeCILL license under French law and
|
|
abiding by the rules of distribution of free software. You can ue,
|
|
modify and/ or redistribute the software under the terms of the CeCILL
|
|
license as circulated by CEA, CNRS and INRIA at the following URL
|
|
"http://www.cecill.info".
|
|
|
|
In this respect, the user's attention is drawn to the risks associated
|
|
with loading, using, modifying and/or developing or reproducing the
|
|
software by the user in light of its specific status of free software,
|
|
that may mean that it is complicated to manipulate, and that also
|
|
therefore means that it is reserved for developers and experienced
|
|
professionals having in-depth computer knowledge. Users are therefore
|
|
encouraged to load and test the software's suitability as regards their
|
|
requirements in conditions enabling the security of their systems and/or
|
|
data to be ensured and, more generally, to use and operate it in the
|
|
same conditions as regards security.
|
|
The fact that you are presently reading this means that you have had
|
|
knowledge of the CeCILL license and that you accept its terms.
|
|
|
|
ParadisEO WebSite : http://paradiseo.gforge.inria.fr
|
|
Contact: paradiseo-help@lists.gforge.inria.fr
|
|
*/
|
|
|
|
#ifndef SMP_BIMAP_MODEL_H_
|
|
#define SMP_BIMAP_MODEL_H_
|
|
|
|
#include <set>
|
|
#include <map>
|
|
|
|
namespace paradiseo
|
|
{
|
|
namespace smp
|
|
{
|
|
/** Bimap
|
|
|
|
Bidirectional map in order to create a bijection between islands and vertices.
|
|
A and B objects are stocked in two std::map, then if you would like to avoid instances duplications,
|
|
template A and B with pointers.
|
|
|
|
**/
|
|
template<class A, class B>
|
|
class Bimap
|
|
{
|
|
public:
|
|
/**
|
|
* Add a relation
|
|
* @param A right key
|
|
* @param B left key
|
|
*/
|
|
void add(A& a, B& b)
|
|
{
|
|
rightAssociation[a] = b;
|
|
leftAssociation[b] = a;
|
|
}
|
|
|
|
std::map<A,B> getRight() const
|
|
{
|
|
return rightAssociation;
|
|
}
|
|
|
|
std::map<B,A> getLeft() const
|
|
{
|
|
return leftAssociation;
|
|
}
|
|
|
|
void removeFromRight(const A& a)
|
|
{
|
|
for(auto& it : leftAssociation)
|
|
if(it->second == a)
|
|
leftAssociation.erase(it);
|
|
|
|
rightAssociation.erase(a);
|
|
}
|
|
|
|
void removeFromLeft(const B& b)
|
|
{
|
|
for(auto& it : rightAssociation)
|
|
if(it->second == b)
|
|
rightAssociation.erase(it);
|
|
|
|
leftAssociation.erase(b);
|
|
}
|
|
|
|
unsigned size() const
|
|
{
|
|
return leftAssociation.size();
|
|
}
|
|
|
|
bool empty() const
|
|
{
|
|
return leftAssociation.empty();
|
|
}
|
|
|
|
protected:
|
|
std::map<A,B> rightAssociation;
|
|
std::map<B,A> leftAssociation;
|
|
};
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|