I'm creating a library which I'm performance testing. In it I generate a Dictionary<Type, X> once. The items are currently inserted in a random order. The dictionary remains unchanged during the application lifetime.
It's then frequently used to lookup items. The lookup is one of the larger bottlenecks in the library.
Yes, I'm micro-optimizing, but to learn. I'm wondering if there are a better way to get lookup performance?
No comments:
Post a Comment