mirror of
https://github.com/logos-storage/logos-storage-nim.git
synced 2026-01-02 13:33:10 +00:00
1cac3e2a11
* cleanup imports and logs * add BlockHandle type * revert deps * refactor: async error handling and future tracking improvements - Update async procedures to use explicit raises annotation - Modify TrackedFutures to handle futures with no raised exceptions - Replace `asyncSpawn` with explicit future tracking - Update test suites to use `unittest2` - Standardize error handling across network and async components - Remove deprecated error handling patterns This commit introduces a more robust approach to async error handling and future management, improving type safety and reducing potential runtime errors. * bump nim-serde * remove asyncSpawn * rework background downloads and prefetch * imporove logging * refactor: enhance async procedures with error handling and raise annotations * misc cleanup * misc * refactor: implement allFinishedFailed to aggregate future results with success and failure tracking * refactor: update error handling in reader procedures to raise ChunkerError and CancelledError * refactor: improve error handling in wantListHandler and accountHandler procedures * refactor: simplify LPStreamReadError creation by consolidating parameters * refactor: enhance error handling in AsyncStreamWrapper to catch unexpected errors * refactor: enhance error handling in advertiser and discovery loops to improve resilience * misc * refactor: improve code structure and readability * remove cancellation from addSlotToQueue * refactor: add assertion for unexpected errors in local store checks * refactor: prevent tracking of finished futures and improve test assertions * refactor: improve error handling in local store checks * remove usage of msgDetail * feat: add initial implementation of discovery engine and related components * refactor: improve task scheduling logic by removing unnecessary break statement * break after scheduling a task * make taskHandler cancelable * refactor: update async handlers to raise CancelledError * refactor(advertiser): streamline error handling and improve task flow in advertise loops * fix: correct spelling of "divisible" in error messages and comments * refactor(discovery): simplify discovery task loop and improve error handling * refactor(engine): filter peers before processing in cancelBlocks procedure
112 lines
2.9 KiB
Nim
112 lines
2.9 KiB
Nim
import pkg/unittest2
|
|
|
|
import pkg/codex/merkletree
|
|
|
|
proc testGenericTree*[H, K, U](
|
|
name: string,
|
|
data: openArray[H],
|
|
zero: H,
|
|
compress: proc(z, y: H, key: K): H,
|
|
makeTree: proc(data: seq[H]): U,
|
|
) =
|
|
let data = @data
|
|
|
|
suite "Correctness tests - " & name:
|
|
test "Should build correct tree for even bottom layer":
|
|
let expectedRoot = compress(
|
|
compress(
|
|
compress(data[0], data[1], K.KeyBottomLayer),
|
|
compress(data[2], data[3], K.KeyBottomLayer),
|
|
K.KeyNone,
|
|
),
|
|
compress(
|
|
compress(data[4], data[5], K.KeyBottomLayer),
|
|
compress(data[6], data[7], K.KeyBottomLayer),
|
|
K.KeyNone,
|
|
),
|
|
K.KeyNone,
|
|
)
|
|
|
|
let tree = makeTree(data[0 .. 7])
|
|
|
|
check:
|
|
tree.root.tryGet == expectedRoot
|
|
|
|
test "Should build correct tree for odd bottom layer":
|
|
let expectedRoot = compress(
|
|
compress(
|
|
compress(data[0], data[1], K.KeyBottomLayer),
|
|
compress(data[2], data[3], K.KeyBottomLayer),
|
|
K.KeyNone,
|
|
),
|
|
compress(
|
|
compress(data[4], data[5], K.KeyBottomLayer),
|
|
compress(data[6], zero, K.KeyOddAndBottomLayer),
|
|
K.KeyNone,
|
|
),
|
|
K.KeyNone,
|
|
)
|
|
|
|
let tree = makeTree(data[0 .. 6])
|
|
|
|
check:
|
|
tree.root.tryGet == expectedRoot
|
|
|
|
test "Should build correct tree for even bottom and odd upper layers":
|
|
let expectedRoot = compress(
|
|
compress(
|
|
compress(
|
|
compress(data[0], data[1], K.KeyBottomLayer),
|
|
compress(data[2], data[3], K.KeyBottomLayer),
|
|
K.KeyNone,
|
|
),
|
|
compress(
|
|
compress(data[4], data[5], K.KeyBottomLayer),
|
|
compress(data[6], data[7], K.KeyBottomLayer),
|
|
K.KeyNone,
|
|
),
|
|
K.KeyNone,
|
|
),
|
|
compress(
|
|
compress(compress(data[8], data[9], K.KeyBottomLayer), zero, K.KeyOdd),
|
|
zero,
|
|
K.KeyOdd,
|
|
),
|
|
K.KeyNone,
|
|
)
|
|
|
|
let tree = makeTree(data[0 .. 9])
|
|
|
|
check:
|
|
tree.root.tryGet == expectedRoot
|
|
|
|
test "Should get and validate correct proofs":
|
|
let expectedRoot = compress(
|
|
compress(
|
|
compress(
|
|
compress(data[0], data[1], K.KeyBottomLayer),
|
|
compress(data[2], data[3], K.KeyBottomLayer),
|
|
K.KeyNone,
|
|
),
|
|
compress(
|
|
compress(data[4], data[5], K.KeyBottomLayer),
|
|
compress(data[6], data[7], K.KeyBottomLayer),
|
|
K.KeyNone,
|
|
),
|
|
K.KeyNone,
|
|
),
|
|
compress(
|
|
compress(compress(data[8], data[9], K.KeyBottomLayer), zero, K.KeyOdd),
|
|
zero,
|
|
K.KeyOdd,
|
|
),
|
|
K.KeyNone,
|
|
)
|
|
|
|
let tree = makeTree(data)
|
|
|
|
for i in 0 ..< data.len:
|
|
let proof = tree.getProof(i).tryGet
|
|
check:
|
|
proof.verify(tree.leaves[i], expectedRoot).isOk
|