❔ Lazily evaluating Dictionary in update loop with good performance
Situation
I have an update loop which receives some data which is Dictionary-like. Due to a version difference, I receive two types of data. The receiving of this data is not a concern and is relatively cheap.The two types of data I receive are as follows:
- an array of type
(TKey, TValue)[]- two arrays of types
TKey[]TValue[]I cannot change these input types (no, I cannot change the array of tuples to an array of
KeyValuePair<TKey, TValue>I know with certainty that the keys are unique, and I know with certainty that they map to exactly one value.
Goal
I want to use this received data just like a Dictionary (anIReadOnlyDictionary<TKey, TValue>By this I mean, I do not want to populate a
Dictionary<TKey, TValue>Problem
I can safely have two types of implementations for the two different types of data received.The issue now is making accesses performant (like the hashing in Dictionaries usually is).
My current idea is the naïve way of making the evaluation linear and caching anything we've already seen. For the ContainsKey implementation, it may be possible to implement a
HashSet<TKey>I'm simply not sure how to implement this very well such that the lazy evaluation is not simply linear with a cache. Any ideas?
