Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Is there a data structure that can replace the following two maps:
Dictionary<TypeA, TypeB> map;
Dictionary<TypeB, TypeA> reverse_map;
so that I will always be able to get TypeB from TypaA, and TypeA from TypeB? My current solution requires adding key->value to map 1 and value->key to map 2.
What you need is called a ‘Bidirectional Map’ like Google’s BiMap which is part of Google Collections (java library).
A related SO thread is here. This thread has a simple TwoWayHashmap java implementation posted by me. This uses two Maps to simulate a two-way-map. Although the code is java specific, I think it would be easy to generalize this as a data structure.