Sheffield | 25-SDC-Nov | Hassan Osman | Sprint 2 | Implement an LRU cache in Python#126
Open
HassanOHOsman wants to merge 12 commits intoCodeYourFuture:mainfrom
Open
Sheffield | 25-SDC-Nov | Hassan Osman | Sprint 2 | Implement an LRU cache in Python#126HassanOHOsman wants to merge 12 commits intoCodeYourFuture:mainfrom
HassanOHOsman wants to merge 12 commits intoCodeYourFuture:mainfrom
Conversation
…y and it's associated value corretly inside the cache structure
…n keys order and thus be able to eventually remove the least recently used one.
…rk as most recently used by moving it to be the tail
… greater than its limit and if so the least recently used key is removed
…sent in cache - else do nothing
…pitem() method so the oldest item (least cently used) gets removed for cache
…en the cash limit is zero and below - This leads to passing the last remaining unit test
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
Self checklist
In this pull request, I implemented an LRU (Least Recently Used) cache using Python. The cache uses get and set methods and enforces a fixed limit by evicting the least recently used entry when the limit is exceeded.