Short answer: no. Long answer: nope. It should be noted that C++14‘s support for transparent comparators eliminates the need for Boost.Bimap 90% of the time*: when you need to key off of any given property of an object (stored or computed), often a simple, bitwise-comparable unique identifier inherent to/present in the object anyway. With transparent … Read more
Since the Map consists of Entrys and it is not Iterable you can use Map#entries instead. It will be mapped to Map#entrySet to create a backed view of Set<Entry>, for example: val reversed = map.entries.associateBy({ it.value }) { it.key } OR use Iterable#associate, which will create additional Pairs. val reversed = map.entries.associate{(k,v)-> v to k} … Read more
There is a certain problem with double-storing your data in all simple implementations of a bimap. If you can break it down to a bimap of pointers from outside, then you can readily ignore this and simply keep both maps of the form std::map<A*,B*> like Arkaitz Jimenez already suggested (though contrary to his answer you … Read more