C# Collection Data Structure With 1:1 Key/Value Mapping

Question

Are there any built-in C# data structures that are like a hash table but requires both the Keys and the Values to be unique among each other? I basically want a way to look up my Key object in a table via a unique Value and vice-versa. Next to maintaining two hash tables or iterating over each key in the hash table (which is slow), I cannot think of a better way to implement this.

Is the fact that I even have this request a sign that I am designing something incorrectly in my code?

score 8 · Accepted Answer · edited May 23 '17 at 11:43

8

It's not necessarily a design flaw, but there's nothing built into the framework. Fortunately, there was a very similar question recently, and I wrote an answer which should serve you well.

edited May 23 '17 at 11:43

Community

1
1

answered Nov 05 '08 at 19:36

Jon Skeet

1,421,763
867
9,128
9,194

Looks to be exactly what I was looking for! Thank you. – Matthew Ruston Nov 05 '08 at 20:17

score 3 · Answer 2 · edited Mar 07 '13 at 17:22

3

Google Collections calls this a BiMap. Maybe you could port this to C#?

edited Mar 07 '13 at 17:22

Janus Troelsen

20,267
14
135
196

answered Nov 05 '08 at 19:36

erickson

265,237
58
395
493

C# Collection Data Structure With 1:1 Key/Value Mapping

2 Answers2