Most efficient in-memory data structure for read-only dictionary access
问题 In C#, I have some static data that could be put in a Dictionary<int, T> where T is some reference type. The web app only needs to initialize it once, statically (it doesn't change). Since I don't have to worried about insert or delete performance, what is the best data structure to use (or should I roll my own)? I'm probably looking at something like ~100,000 entries, fairly evenly spaced. I am looking for an optimal algorithm for fetching this data. Dictionary<> isn't bad, but I would