Skip to content

Fix typo in test class name: StrictRawScopedTrieStoce → StrictRawScopedTrieStore #10146

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.

Sign up for GitHub

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

Merged
asdacap merged 2 commits into from
Jan 8, 2026
Merged

Fix typo in test class name: StrictRawScopedTrieStoce → StrictRawScopedTrieStore #10146

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
f502d52
Initial plan
Copilot Jan 8, 2026
d5722bf
Fix typo in class name: StrictRawScopedTrieStoce -> StrictRawScopedTr…
Copilot Jan 8, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
14 changes: 7 additions & 7 deletions src/Nethermind/Nethermind.State.Test/PatriciaTreeBulkSetterTests.cs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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;

Expand Down Expand Up @@ -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;

Expand Down Expand Up @@ -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;

Expand Down Expand Up @@ -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;

Expand Down Expand Up @@ -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;

Expand Down Expand Up @@ -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;

Expand Down Expand Up @@ -734,7 +734,7 @@ public void HexarySearch(int nibIndex, List<ValueHash256> paths, List<ValueHash2

}

public class StrictRawScopedTrieStoce(IScopedTrieStore baseTrieStore) : IScopedTrieStore
public class StrictRawScopedTrieStore(IScopedTrieStore baseTrieStore) : IScopedTrieStore
{
public TrieNode FindCachedOrUnknown(in TreePath path, Hash256 hash)
{
Expand Down