Ensure flexicache is LRU cached #679
Merged
Add this suggestion to a batch that can be applied as a single commit. This suggestion is invalid because no changes were made to the code. Suggestions cannot be applied while the pull request is closed. Suggestions cannot be applied while viewing a subset of changes. Only one suggestion per line can be applied in a batch. Add this suggestion to a batch that can be applied as a single commit. Applying suggestions on deleted lines is not supported. You must change the existing code in this line in order to create a valid suggestion. Outdated suggestions cannot be applied. This suggestion has been applied or marked resolved. Suggestions cannot be applied from pending reviews. Suggestions cannot be applied on multi-line comments. Suggestions cannot be applied while the pull request is queued to merge. Suggestion cannot be applied right now. Please check back later.
Originating ticket: #678
Problem
The Python docs say that dict.popitem is LIFO, which means it is Last In First Out. That is the opposite of FIFO, which is part of the algorithm often used in LRU (Least Recently Used).
Reference: https://docs.python.org/3/library/stdtypes.html#dict.popitem
Solution
Since the cache is constantly being popped and reset, treat the order of the cache keys as an iterator and pick the first cache key set. To do this we just call the
nextcommand once oniter(cache).Tests
As cache invalidation is hard, new tests are added to flexicache that document cache invalidation and resetting.
Alternative approach: OrderedDict
collections.OrderedDicthas apopitem()method with alastboolean that replicates our design, as show in the code example below:I rejected this approach because it adds an extra import and
cache.popitem()is probably a very tiny bit slower thandel cache[next(iter(cache))]. However, this approach is arguably more clear. In any case, I'm not opposed to changing out the current solution for the one presented here.