From f502d52e65d1fb3a73218f70e772d3165325d3b8 Mon Sep 17 00:00:00 2001 From: "copilot-swe-agent[bot]" <198982749+Copilot@users.noreply.github.com> Date: Thu, 8 Jan 2026 11:51:25 +0000 Subject: [PATCH 1/2] Initial plan From d5722bf24770204fa3bd4f3db59da0c9ed81c389 Mon Sep 17 00:00:00 2001 From: "copilot-swe-agent[bot]" <198982749+Copilot@users.noreply.github.com> Date: Thu, 8 Jan 2026 11:56:11 +0000 Subject: [PATCH 2/2] Fix typo in class name: StrictRawScopedTrieStoce -> StrictRawScopedTrieStore Co-authored-by: asdacap <1841324+asdacap@users.noreply.github.com> --- .../PatriciaTreeBulkSetterTests.cs | 14 +++++++------- 1 file changed, 7 insertions(+), 7 deletions(-) diff --git a/src/Nethermind/Nethermind.State.Test/PatriciaTreeBulkSetterTests.cs b/src/Nethermind/Nethermind.State.Test/PatriciaTreeBulkSetterTests.cs index 4e94cb9803c..e11940237cb 100644 --- a/src/Nethermind/Nethermind.State.Test/PatriciaTreeBulkSetterTests.cs +++ b/src/Nethermind/Nethermind.State.Test/PatriciaTreeBulkSetterTests.cs @@ -273,7 +273,7 @@ public void BulkSet(List<(Hash256 key, byte[] value)> existingItems, List<(Hash2 long newWriteCount = 0; { TestMemDb db = new TestMemDb(); - IScopedTrieStore trieStore = new StrictRawScopedTrieStoce(new RawScopedTrieStore(db)); + IScopedTrieStore trieStore = new StrictRawScopedTrieStore(new RawScopedTrieStore(db)); PatriciaTree pTree = new PatriciaTree(trieStore, LimboLogs.Instance); pTree.RootHash = Keccak.EmptyTreeHash; @@ -324,7 +324,7 @@ public void BulkSetRootHashUpdated(List<(Hash256 key, byte[] value)> existingIte (Hash256 root, TimeSpan baselineTime, long baselineWriteCount, string originalDump) = CalculateBaseline(existingItems, items, recordDump); TestMemDb db = new TestMemDb(); - IScopedTrieStore trieStore = new StrictRawScopedTrieStoce(new RawScopedTrieStore(db)); + IScopedTrieStore trieStore = new StrictRawScopedTrieStore(new RawScopedTrieStore(db)); PatriciaTree pTree = new PatriciaTree(trieStore, LimboLogs.Instance); pTree.RootHash = Keccak.EmptyTreeHash; @@ -356,7 +356,7 @@ public void BulkSetPreSorted(List<(Hash256 key, byte[] value)> existingItems, Li long preSortedWriteCount; { TestMemDb db = new TestMemDb(); - IScopedTrieStore trieStore = new StrictRawScopedTrieStoce(new RawScopedTrieStore(db)); + IScopedTrieStore trieStore = new StrictRawScopedTrieStore(new RawScopedTrieStore(db)); PatriciaTree pTree = new PatriciaTree(trieStore, LimboLogs.Instance); pTree.RootHash = Keccak.EmptyTreeHash; @@ -414,7 +414,7 @@ public void BulkSetOneByOne(List<(Hash256 key, byte[] value)> existingItems, Lis { // Just the bulk set one stack TestMemDb db = new TestMemDb(); - IScopedTrieStore trieStore = new StrictRawScopedTrieStoce(new RawScopedTrieStore(db)); + IScopedTrieStore trieStore = new StrictRawScopedTrieStore(new RawScopedTrieStore(db)); PatriciaTree pTree = new PatriciaTree(trieStore, LimboLogs.Instance); pTree.RootHash = Keccak.EmptyTreeHash; @@ -466,7 +466,7 @@ private static (Hash256, TimeSpan, long, string originalDump) CalculateBaseline( long baselineWriteCount = 0; { TestMemDb db = new TestMemDb(); - IScopedTrieStore trieStore = new StrictRawScopedTrieStoce(new RawScopedTrieStore(db)); + IScopedTrieStore trieStore = new StrictRawScopedTrieStore(new RawScopedTrieStore(db)); PatriciaTree pTree = new PatriciaTree(trieStore, LimboLogs.Instance); pTree.RootHash = Keccak.EmptyTreeHash; @@ -502,7 +502,7 @@ private static (Hash256, TimeSpan, long, string originalDump) CalculateBaseline( [Test] public void BulkSet_ShouldThrowOnNonUniqueEntries() { - IScopedTrieStore trieStore = new StrictRawScopedTrieStoce(new RawScopedTrieStore(new TestMemDb())); + IScopedTrieStore trieStore = new StrictRawScopedTrieStore(new RawScopedTrieStore(new TestMemDb())); PatriciaTree pTree = new PatriciaTree(trieStore, LimboLogs.Instance); pTree.RootHash = Keccak.EmptyTreeHash; @@ -734,7 +734,7 @@ public void HexarySearch(int nibIndex, List paths, List