Improve TrieStore Dictionary use and Hashing #6979
Merged
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.
Changes
Hash256
ValueHash256.GetChainedHashCode(uint previousHash)
; if previous hash is randomised seeded can just use that as input for next hash, rather than starting with randomised seed and then combining at end (saving 2 hash combines)TreePath.Equals
checkLength
first rather than last as simpler compareAddOrUpdate
on ConcurrentDictionary rather thanContains
+ setref CollectionsMarshal.GetValueRefOrAddDefault
on Dictionary rather thanContainsKey
+ setTypes of changes
What types of changes does your code introduce?
Testing
Requires testing