feat: add doubly-linked list implementation #970
Merged
Conversation
This file contains 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
Add doubly-linked list implemented as a circular list. The API of the `List` class is almost identical to the `Deque` API. A `List` uses more memory than a `Queue`, but a `List` takes O(1) time to do insertions and removals anywhere in the list, whereas a `Queue` only takes O(1) time to do insertions and removals at the front and back of the queue, and O(n) everywhere else. Also add a testsuite for the `List` class.
Add remove(value) to remove a value from the cache independently from the eviction policy.
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.
Add doubly-linked list implemented as a circular list. The API of
the
Listclass is almost identical to theDequeAPI.A
Listuses more memory than aQueue, but aListtakes O(1)time to do insertions and removals anywhere in the list, whereas a
Queueonly takes O(1) time to do insertions and removals at thefront and back of the queue, and O(n) everywhere else.
Also add a testsuite for the
Listclass.