Is there any .NET type that would represent a set of key-value pairs where each key will only be paired with a single value (like a regular Dictionary), but also each value will only be paired with a single key? I’ve been thinking of this as an “invertible” dictionary because you could swap the keys with the values without any collisions. It shouldn’t be hard to write such a class, and add methods like “TryGetKey” for a given value. However, I wanted to check if such a thing already existed somewhere, perhaps under a different name that I haven’t thought of.
Also, considering the elegant answer to this question, would it be worthwhile for me to create a class to represent this invertible dictionary, when I could just as easily use LINQ to convert any dictionary to its value-key equivalent?
I don’t believe there is a class in the framework that does this, directly.
The answer to both of your questions really depends on how you are going to be accessing your data. If you need fast, constant time access based on key and value, you are most likely going to want to make your own collection.
This could be done very, very easily, though. Just wrap two Dictionary instances inside your class, and when you add in a new element, add to both – one with key/value and one with value/key. Your lookup routines can just pull from the appropriate collection, and it will remain near O(1) for access time.
If, however, memory is more of a concern, you could just use a single collection, and use LINQ to parse it. This is going to make your “reverse” lookup quite a bit slower, as you’ll need to re-parse each time.