Add HashSeq for feature parity with HashList#134
Merged
Conversation
4d58a63 to
9984869
Compare
etan-status
commented
Jan 8, 2026
Add cached flavor for EIP-7916 progressive list (`seq[T]` in Nim) so that it has feature parity with regular list (`List[T, N]` in Nim). Name is `HashSeq[T]` to match `HashList[T, N]`. Implementation reuses existing caches, it reuses `HashArray` style cache for completed trees of the progressive forest, and then uses `HashList` style cache for the in-progress tree. Luckily, once complete it matches the cache format for `HashArray` and can simply be reused.
00879ba to
495ae1a
Compare
3e820fd to
eca88bd
Compare
9023b40 to
f7768d6
Compare
351baac to
e7003a6
Compare
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.
Add cached flavor for EIP-7916 progressive list (
seq[T]in Nim) so that it has feature parity with regular list (List[T, N]in Nim). Name isHashSeq[T]to matchHashList[T, N].Implementation reuses existing caches, it reuses
HashArraystyle cache for completed trees of the progressive forest, and then usesHashListstyle cache for the in-progress tree. Luckily, once complete it matches the cache format forHashArrayand can simply be reused.