-
Notifications
You must be signed in to change notification settings - Fork 117
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
chore(lib/trie): use map for trie.getInsertedNodeHashes
to reduce memory pressure
#2115
Conversation
Codecov Report
@@ Coverage Diff @@
## development #2115 +/- ##
===============================================
+ Coverage 61.49% 61.50% +0.01%
===============================================
Files 213 213
Lines 27429 27437 +8
===============================================
+ Hits 16867 16875 +8
+ Misses 8692 8691 -1
- Partials 1870 1871 +1
Flags with carried forward coverage won't be shown. Click here to find out more.
Continue to review full report at Codecov.
|
dbc59e5
to
ea0cee4
Compare
e868e6c
to
4e40f48
Compare
288b369
to
d310edf
Compare
4e40f48
to
43859ea
Compare
d310edf
to
f5c72bc
Compare
43859ea
to
e404d13
Compare
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
looks good! nice replacement!
3eac291
to
8a64b5b
Compare
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
looks good! btw, this pruning code isn't run by default, by default the node is archive
- Avoid confusion about slice order of hashes - Faster to return a map than transforming it to a slice
- Uniformize together with inserted keys - Refactor calling code
8a64b5b
to
08c9d92
Compare
Does this relate to #1973? |
Changes
getInsertedNodeHashes
getinsertedNodeHashes
to use a map (set) in order to:deletedKeys
in order to simplify calling codeTests
Issues
Primary Reviewer