mirror of
https://github.com/logos-storage/logos-storage-nim.git
synced 2026-01-02 21:43:11 +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
79 lines
2.0 KiB
Nim
79 lines
2.0 KiB
Nim
import std/sequtils
|
|
|
|
import pkg/unittest2
|
|
import pkg/poseidon2
|
|
import pkg/poseidon2/io
|
|
import pkg/questionable/results
|
|
import pkg/results
|
|
import pkg/stew/byteutils
|
|
import pkg/stew/arrayops
|
|
|
|
import pkg/codex/merkletree
|
|
|
|
import ./generictreetests
|
|
import ./helpers
|
|
|
|
const data = [
|
|
"0000000000000000000000000000001".toBytes,
|
|
"0000000000000000000000000000002".toBytes,
|
|
"0000000000000000000000000000003".toBytes,
|
|
"0000000000000000000000000000004".toBytes,
|
|
"0000000000000000000000000000005".toBytes,
|
|
"0000000000000000000000000000006".toBytes,
|
|
"0000000000000000000000000000007".toBytes,
|
|
"0000000000000000000000000000008".toBytes,
|
|
"0000000000000000000000000000009".toBytes,
|
|
# note one less to account for padding of field elements
|
|
]
|
|
|
|
suite "Test Poseidon2Tree":
|
|
var expectedLeaves: seq[Poseidon2Hash]
|
|
|
|
setup:
|
|
expectedLeaves = toSeq(data.concat().elements(Poseidon2Hash))
|
|
|
|
test "Should fail init tree from empty leaves":
|
|
check:
|
|
Poseidon2Tree.init(leaves = newSeq[Poseidon2Hash](0)).isErr
|
|
|
|
test "Init tree from poseidon2 leaves":
|
|
let tree = Poseidon2Tree.init(leaves = expectedLeaves).tryGet
|
|
|
|
check:
|
|
tree.leaves == expectedLeaves
|
|
|
|
test "Init tree from byte leaves":
|
|
let tree = Poseidon2Tree.init(
|
|
leaves = expectedLeaves.mapIt(array[31, byte].initCopyFrom(it.toBytes))
|
|
).tryGet
|
|
|
|
check:
|
|
tree.leaves == expectedLeaves
|
|
|
|
test "Should build from nodes":
|
|
let
|
|
tree = Poseidon2Tree.init(leaves = expectedLeaves).tryGet
|
|
fromNodes = Poseidon2Tree.fromNodes(
|
|
nodes = toSeq(tree.nodes), nleaves = tree.leavesCount
|
|
).tryGet
|
|
|
|
check:
|
|
tree == fromNodes
|
|
|
|
let
|
|
compressor = proc(
|
|
x, y: Poseidon2Hash, key: PoseidonKeysEnum
|
|
): Poseidon2Hash {.noSideEffect.} =
|
|
compress(x, y, key.toKey)
|
|
|
|
makeTree = proc(data: seq[Poseidon2Hash]): Poseidon2Tree =
|
|
Poseidon2Tree.init(leaves = data).tryGet
|
|
|
|
testGenericTree(
|
|
"Poseidon2Tree",
|
|
toSeq(data.concat().elements(Poseidon2Hash)),
|
|
zero,
|
|
compressor,
|
|
makeTree,
|
|
)
|