You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
This repository has been archived by the owner on Oct 25, 2024. It is now read-only.
Given it is implemented as a circular buffer, it would be (reasonably) easy to support deque-like operations. E.g.: addFront/addBack, peekFront/peekBack, removeFront/removeBack, iterator/descendingIterator`
From what I can tell, doing it would require changes to the file format.
E.g., we can add the length of each element twice, both before and after the payload, so that the list can be traversed on both directions.
The text was updated successfully, but these errors were encountered:
Sign up for freeto subscribe to this conversation on GitHub.
Already have an account?
Sign in.
Hello, and thanks for this great library.
Given it is implemented as a circular buffer, it would be (reasonably) easy to support deque-like operations. E.g.:
addFront
/addBack
,peekFront
/peekBack
,removeFront
/removeBack
,iterator
/descendingIterator`From what I can tell, doing it would require changes to the file format.
E.g., we can add the length of each element twice, both before and after the payload, so that the list can be traversed on both directions.
The text was updated successfully, but these errors were encountered: