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
45 lines
1.3 KiB
Nim
45 lines
1.3 KiB
Nim
import pkg/unittest2
|
|
|
|
import pkg/questionable/results
|
|
import pkg/stew/byteutils
|
|
|
|
import pkg/codex/merkletree
|
|
import ./helpers
|
|
|
|
const data = [
|
|
"00000000000000000000000000000001".toBytes,
|
|
"00000000000000000000000000000002".toBytes,
|
|
"00000000000000000000000000000003".toBytes,
|
|
"00000000000000000000000000000004".toBytes,
|
|
"00000000000000000000000000000005".toBytes,
|
|
"00000000000000000000000000000006".toBytes,
|
|
"00000000000000000000000000000007".toBytes,
|
|
"00000000000000000000000000000008".toBytes,
|
|
"00000000000000000000000000000009".toBytes, "00000000000000000000000000000010".toBytes,
|
|
]
|
|
|
|
suite "merkletree - coders":
|
|
test "encoding and decoding a tree yields the same tree":
|
|
let
|
|
tree = CodexTree.init(Sha256HashCodec, data).tryGet()
|
|
encodedBytes = tree.encode()
|
|
decodedTree = CodexTree.decode(encodedBytes).tryGet()
|
|
|
|
check:
|
|
tree == decodedTree
|
|
|
|
test "encoding and decoding a proof yields the same proof":
|
|
let
|
|
tree = CodexTree.init(Sha256HashCodec, data).tryGet()
|
|
proof = tree.getProof(4).tryGet()
|
|
|
|
check:
|
|
proof.verify(tree.leaves[4], tree.root.tryGet).isOk
|
|
|
|
let
|
|
encodedBytes = proof.encode()
|
|
decodedProof = CodexProof.decode(encodedBytes).tryGet()
|
|
|
|
check:
|
|
proof == decodedProof
|