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
94 lines
2.6 KiB
Nim
94 lines
2.6 KiB
Nim
import std/sequtils
|
|
|
|
import pkg/unittest2
|
|
import pkg/questionable/results
|
|
import pkg/stew/byteutils
|
|
import pkg/libp2p
|
|
|
|
import pkg/codex/codextypes
|
|
import pkg/codex/merkletree
|
|
import pkg/codex/utils/digest
|
|
|
|
import ./helpers
|
|
import ./generictreetests
|
|
|
|
# TODO: Generalize to other hashes
|
|
|
|
const
|
|
data = [
|
|
"00000000000000000000000000000001".toBytes,
|
|
"00000000000000000000000000000002".toBytes,
|
|
"00000000000000000000000000000003".toBytes,
|
|
"00000000000000000000000000000004".toBytes,
|
|
"00000000000000000000000000000005".toBytes,
|
|
"00000000000000000000000000000006".toBytes,
|
|
"00000000000000000000000000000007".toBytes,
|
|
"00000000000000000000000000000008".toBytes,
|
|
"00000000000000000000000000000009".toBytes,
|
|
"00000000000000000000000000000010".toBytes,
|
|
]
|
|
sha256 = Sha256HashCodec
|
|
|
|
suite "Test CodexTree":
|
|
test "Cannot init tree without any multihash leaves":
|
|
check:
|
|
CodexTree.init(leaves = newSeq[MultiHash]()).isErr
|
|
|
|
test "Cannot init tree without any cid leaves":
|
|
check:
|
|
CodexTree.init(leaves = newSeq[Cid]()).isErr
|
|
|
|
test "Cannot init tree without any byte leaves":
|
|
check:
|
|
CodexTree.init(sha256, leaves = newSeq[ByteHash]()).isErr
|
|
|
|
test "Should build tree from multihash leaves":
|
|
var expectedLeaves = data.mapIt(MultiHash.digest($sha256, it).tryGet())
|
|
|
|
var tree = CodexTree.init(leaves = expectedLeaves)
|
|
check:
|
|
tree.isOk
|
|
tree.get().leaves == expectedLeaves.mapIt(it.digestBytes)
|
|
tree.get().mcodec == sha256
|
|
|
|
test "Should build tree from cid leaves":
|
|
var expectedLeaves = data.mapIt(
|
|
Cid.init(CidVersion.CIDv1, BlockCodec, MultiHash.digest($sha256, it).tryGet).tryGet
|
|
)
|
|
|
|
let tree = CodexTree.init(leaves = expectedLeaves)
|
|
|
|
check:
|
|
tree.isOk
|
|
tree.get().leaves == expectedLeaves.mapIt(it.mhash.tryGet.digestBytes)
|
|
tree.get().mcodec == sha256
|
|
|
|
test "Should build from raw digestbytes (should not hash leaves)":
|
|
let tree = CodexTree.init(sha256, leaves = data).tryGet
|
|
|
|
check:
|
|
tree.mcodec == sha256
|
|
tree.leaves == data
|
|
|
|
test "Should build from nodes":
|
|
let
|
|
tree = CodexTree.init(sha256, leaves = data).tryGet
|
|
fromNodes = CodexTree.fromNodes(
|
|
nodes = toSeq(tree.nodes), nleaves = tree.leavesCount
|
|
).tryGet
|
|
|
|
check:
|
|
tree.mcodec == sha256
|
|
tree == fromNodes
|
|
|
|
let
|
|
mhash = sha256.mhash().tryGet
|
|
zero: seq[byte] = newSeq[byte](mhash.size)
|
|
compress = proc(x, y: seq[byte], key: ByteTreeKey): seq[byte] =
|
|
compress(x, y, key, mhash).tryGet
|
|
|
|
makeTree = proc(data: seq[seq[byte]]): CodexTree =
|
|
CodexTree.init(sha256, leaves = data).tryGet
|
|
|
|
testGenericTree("CodexTree", @data, zero, compress, makeTree)
|