mirror of
https://github.com/logos-storage/logos-storage-nim.git
synced 2026-04-02 10:53:07 +00:00
wip
This commit is contained in:
Dmitriy Ryajov
parent
5b4d762600
commit
621c5d4c49
@ -1,4 +1,3 @@
|
||||
import pkg/unittest2
|
||||
import pkg/questionable
|
||||
import pkg/codex/contracts/requests
|
||||
import pkg/codex/sales/states/filling
|
||||
|
||||
@ -23,234 +23,25 @@ proc toSortedSeq[T](h: AsyncHeapQueue[T], queueType = QueueType.Min): seq[T] =
|
||||
result.add(popNoWait(tmp).tryGet())
|
||||
|
||||
suite "Synchronous tests":
|
||||
test "Test pushNoWait - Min":
|
||||
var heap = newAsyncHeapQueue[int]()
|
||||
let data = [1, 3, 5, 7, 9, 2, 4, 6, 8, 0]
|
||||
for item in data:
|
||||
check heap.pushNoWait(item).isOk
|
||||
|
||||
check heap[0] == 0
|
||||
check heap.toSortedSeq == @[0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
|
||||
|
||||
test "Test pushNoWait - Max":
|
||||
var heap = newAsyncHeapQueue[int](queueType = QueueType.Max)
|
||||
let data = [1, 3, 5, 7, 9, 2, 4, 6, 8, 0]
|
||||
for item in data:
|
||||
check heap.pushNoWait(item).isOk
|
||||
|
||||
check heap[0] == 9
|
||||
check heap.toSortedSeq(QueueType.Max) == @[9, 8, 7, 6, 5, 4, 3, 2, 1, 0]
|
||||
|
||||
test "Test popNoWait":
|
||||
var heap = newAsyncHeapQueue[int]()
|
||||
let data = [1, 3, 5, 7, 9, 2, 4, 6, 8, 0]
|
||||
for item in data:
|
||||
check heap.pushNoWait(item).isOk
|
||||
|
||||
var res: seq[int]
|
||||
while heap.len > 0:
|
||||
let r = heap.popNoWait()
|
||||
if r.isOk:
|
||||
res.add(r.get)
|
||||
|
||||
check res == @[0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
|
||||
|
||||
test "Test popNoWait - Max":
|
||||
var heap = newAsyncHeapQueue[int](queueType = QueueType.Max)
|
||||
let data = [1, 3, 5, 7, 9, 2, 4, 6, 8, 0]
|
||||
for item in data:
|
||||
check heap.pushNoWait(item).isOk
|
||||
|
||||
var res: seq[int]
|
||||
while heap.len > 0:
|
||||
let r = heap.popNoWait()
|
||||
if r.isOk:
|
||||
res.add(r.get)
|
||||
|
||||
check res == @[9, 8, 7, 6, 5, 4, 3, 2, 1, 0]
|
||||
|
||||
test "Test del":
|
||||
var heap = newAsyncHeapQueue[int]()
|
||||
let data = [1, 3, 5, 7, 9, 2, 4, 6, 8, 0]
|
||||
for item in data:
|
||||
check heap.pushNoWait(item).isOk
|
||||
|
||||
heap.del(0)
|
||||
doAssert(heap[0] == 1)
|
||||
|
||||
heap.del(heap.find(7))
|
||||
check heap.toSortedSeq == @[1, 2, 3, 4, 5, 6, 8, 9]
|
||||
|
||||
heap.del(heap.find(5))
|
||||
check heap.toSortedSeq == @[1, 2, 3, 4, 6, 8, 9]
|
||||
|
||||
heap.del(heap.find(6))
|
||||
check heap.toSortedSeq == @[1, 2, 3, 4, 8, 9]
|
||||
|
||||
heap.del(heap.find(2))
|
||||
check heap.toSortedSeq == @[1, 3, 4, 8, 9]
|
||||
|
||||
test "Test del last":
|
||||
var heap = newAsyncHeapQueue[int]()
|
||||
let data = [1, 2, 3]
|
||||
for item in data:
|
||||
check heap.pushNoWait(item).isOk
|
||||
|
||||
heap.del(2)
|
||||
check heap.toSortedSeq == @[1, 2]
|
||||
|
||||
heap.del(1)
|
||||
check heap.toSortedSeq == @[1]
|
||||
|
||||
heap.del(0)
|
||||
check heap.toSortedSeq == newSeq[int]() # empty seq has no type
|
||||
|
||||
test "Should throw popping from an empty queue":
|
||||
var heap = newAsyncHeapQueue[int]()
|
||||
let err = heap.popNoWait()
|
||||
check err.isErr
|
||||
check err.error == AsyncHQErrors.Empty
|
||||
|
||||
test "Should throw pushing to an full queue":
|
||||
var heap = newAsyncHeapQueue[int](1)
|
||||
check heap.pushNoWait(1).isOk
|
||||
let err = heap.pushNoWait(2)
|
||||
check err.isErr
|
||||
check err.error == AsyncHQErrors.Full
|
||||
|
||||
test "Test clear":
|
||||
var heap = newAsyncHeapQueue[int]()
|
||||
let data = [1, 3, 5, 7, 9, 2, 4, 6, 8, 0]
|
||||
for item in data:
|
||||
check heap.pushNoWait(item).isOk
|
||||
|
||||
check heap.len == 10
|
||||
heap.clear()
|
||||
check heap.len == 0
|
||||
|
||||
asyncchecksuite "Asynchronous Tests":
|
||||
test "Test push":
|
||||
var heap = newAsyncHeapQueue[int]()
|
||||
let data = [1, 3, 5, 7, 9, 2, 4, 6, 8, 0]
|
||||
for item in data:
|
||||
await push(heap, item)
|
||||
check heap[0] == 0
|
||||
check heap.toSortedSeq == @[0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
|
||||
|
||||
test "Test push and pop with maxSize":
|
||||
var heap = newAsyncHeapQueue[int](5)
|
||||
let data = [1, 9, 5, 3, 7, 4, 2]
|
||||
|
||||
proc pushTask() {.async.} =
|
||||
for item in data:
|
||||
await push(heap, item)
|
||||
|
||||
let pushFut = pushTask()
|
||||
|
||||
check heap.len == 5
|
||||
check heap[0] == 1 # because we haven't pushed 0 yet
|
||||
|
||||
check (await heap.pop) == 1
|
||||
check (await heap.pop) == 3
|
||||
check (await heap.pop) == 5
|
||||
check (await heap.pop) == 7
|
||||
check (await heap.pop) == 9
|
||||
|
||||
await sleepAsync(1.milliseconds) # allow poll to run once more
|
||||
check (await heap.pop) == 2
|
||||
check (await heap.pop) == 4
|
||||
await pushFut
|
||||
|
||||
test "Test single push when empty":
|
||||
let heap = newAsyncHeapQueue[int](1)
|
||||
|
||||
check heap.empty()
|
||||
let popFut = heap.pop()
|
||||
|
||||
proc pushTask() {.async.} =
|
||||
await heap.push(1)
|
||||
|
||||
let pushFut = pushTask()
|
||||
await allFutures(@[FutureBase(pushFut), FutureBase(popFut)])
|
||||
check (await popFut) == 1
|
||||
await pushFut
|
||||
|
||||
test "Test multiple pushes when empty - single producer, multiple consumers":
|
||||
let heap = newAsyncHeapQueue[int](1)
|
||||
|
||||
proc pushTask() {.async.} =
|
||||
var pushes = 2
|
||||
for i in 0 .. 100:
|
||||
echo "Pushing ", i
|
||||
await heap.push(i)
|
||||
pushes -= 1
|
||||
if pushes == 0:
|
||||
echo "Sleeping"
|
||||
await sleepAsync(10.millis) # allow poll to run once more
|
||||
pushes = 2
|
||||
|
||||
let pushFut = pushTask()
|
||||
|
||||
var popTasks = 0
|
||||
proc popTask() {.async.} =
|
||||
echo "starting pop task: ", popTasks
|
||||
let thisTask = popTasks
|
||||
popTasks += 1
|
||||
await sleepAsync(100.millis)
|
||||
var i = 0
|
||||
while not pushFut.finished:
|
||||
let fut = heap.pop()
|
||||
if heap.empty():
|
||||
await sleepAsync(1.millis) # allow poll to run once more
|
||||
let popRes = await fut
|
||||
echo "Task # ", thisTask, " popRes: ", popRes
|
||||
check popRes == i
|
||||
i += 1
|
||||
|
||||
var popFuts = newSeq[Future[void]]()
|
||||
for i in 0 ..< 10:
|
||||
popFuts.add(popTask())
|
||||
|
||||
await allFutures(popFuts.mapIt(FutureBase(it)) & @[FutureBase(pushFut)])
|
||||
|
||||
test "Test update":
|
||||
var heap = newAsyncHeapQueue[Task](5)
|
||||
let data = [("a", 4), ("b", 3), ("c", 2)]
|
||||
|
||||
test "Test pushNoWait - Min":
|
||||
var heap = newAsyncHeapQueue[int]()
|
||||
let data = [1, 3, 5, 7, 9, 2, 4, 6, 8, 0]
|
||||
for item in data:
|
||||
check heap.pushNoWait(item).isOk
|
||||
|
||||
check heap[0] == (name: "c", priority: 2)
|
||||
check heap.update((name: "a", priority: 1))
|
||||
check heap[0] == (name: "a", priority: 1)
|
||||
|
||||
test "Test pushOrUpdate - update":
|
||||
var heap = newAsyncHeapQueue[Task](3)
|
||||
let data = [("a", 4), ("b", 3), ("c", 2)]
|
||||
check heap[0] == 0
|
||||
check heap.toSortedSeq == @[0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
|
||||
|
||||
test "Test pushNoWait - Max":
|
||||
var heap = newAsyncHeapQueue[int](queueType = QueueType.Max)
|
||||
let data = [1, 3, 5, 7, 9, 2, 4, 6, 8, 0]
|
||||
for item in data:
|
||||
check heap.pushNoWait(item).isOk
|
||||
|
||||
check heap[0] == (name: "c", priority: 2)
|
||||
await heap.pushOrUpdate((name: "a", priority: 1))
|
||||
check heap[0] == (name: "a", priority: 1)
|
||||
check heap[0] == 9
|
||||
check heap.toSortedSeq(QueueType.Max) == @[9, 8, 7, 6, 5, 4, 3, 2, 1, 0]
|
||||
|
||||
test "Test pushOrUpdate - push":
|
||||
var heap = newAsyncHeapQueue[Task](2)
|
||||
let data = [("a", 4), ("b", 3)]
|
||||
|
||||
for item in data:
|
||||
check heap.pushNoWait(item).isOk
|
||||
|
||||
check heap[0] == ("b", 3) # sanity check for order
|
||||
|
||||
let fut = heap.pushOrUpdate(("c", 2)) # attempt to push a non existen item but block
|
||||
check heap.popNoWait().tryGet() == ("b", 3) # pop one off
|
||||
await fut # wait for push to complete
|
||||
|
||||
check heap[0] == (name: "c", priority: 2) # check order again
|
||||
|
||||
test "Test pop":
|
||||
test "Test popNoWait":
|
||||
var heap = newAsyncHeapQueue[int]()
|
||||
let data = [1, 3, 5, 7, 9, 2, 4, 6, 8, 0]
|
||||
for item in data:
|
||||
@ -258,17 +49,227 @@ asyncchecksuite "Asynchronous Tests":
|
||||
|
||||
var res: seq[int]
|
||||
while heap.len > 0:
|
||||
res.add((await heap.pop()))
|
||||
let r = heap.popNoWait()
|
||||
if r.isOk:
|
||||
res.add(r.get)
|
||||
|
||||
check res == @[0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
|
||||
|
||||
test "Test delete":
|
||||
var heap = newAsyncHeapQueue[Task]()
|
||||
let data = ["d", "b", "c", "a", "h", "e", "f", "g"]
|
||||
|
||||
test "Test popNoWait - Max":
|
||||
var heap = newAsyncHeapQueue[int](queueType = QueueType.Max)
|
||||
let data = [1, 3, 5, 7, 9, 2, 4, 6, 8, 0]
|
||||
for item in data:
|
||||
check heap.pushNoWait((name: item, priority: Rng.instance().rand(data.len))).isOk
|
||||
check heap.pushNoWait(item).isOk
|
||||
|
||||
let del = heap[3]
|
||||
heap.delete(del)
|
||||
check heap.find(del) < 0
|
||||
var res: seq[int]
|
||||
while heap.len > 0:
|
||||
let r = heap.popNoWait()
|
||||
if r.isOk:
|
||||
res.add(r.get)
|
||||
|
||||
check res == @[9, 8, 7, 6, 5, 4, 3, 2, 1, 0]
|
||||
|
||||
test "Test del":
|
||||
var heap = newAsyncHeapQueue[int]()
|
||||
let data = [1, 3, 5, 7, 9, 2, 4, 6, 8, 0]
|
||||
for item in data:
|
||||
check heap.pushNoWait(item).isOk
|
||||
|
||||
heap.del(0)
|
||||
doAssert(heap[0] == 1)
|
||||
|
||||
heap.del(heap.find(7))
|
||||
check heap.toSortedSeq == @[1, 2, 3, 4, 5, 6, 8, 9]
|
||||
|
||||
heap.del(heap.find(5))
|
||||
check heap.toSortedSeq == @[1, 2, 3, 4, 6, 8, 9]
|
||||
|
||||
heap.del(heap.find(6))
|
||||
check heap.toSortedSeq == @[1, 2, 3, 4, 8, 9]
|
||||
|
||||
heap.del(heap.find(2))
|
||||
check heap.toSortedSeq == @[1, 3, 4, 8, 9]
|
||||
|
||||
test "Test del last":
|
||||
var heap = newAsyncHeapQueue[int]()
|
||||
let data = [1, 2, 3]
|
||||
for item in data:
|
||||
check heap.pushNoWait(item).isOk
|
||||
|
||||
heap.del(2)
|
||||
check heap.toSortedSeq == @[1, 2]
|
||||
|
||||
heap.del(1)
|
||||
check heap.toSortedSeq == @[1]
|
||||
|
||||
heap.del(0)
|
||||
check heap.toSortedSeq == newSeq[int]() # empty seq has no type
|
||||
|
||||
test "Should throw popping from an empty queue":
|
||||
var heap = newAsyncHeapQueue[int]()
|
||||
let err = heap.popNoWait()
|
||||
check err.isErr
|
||||
check err.error == AsyncHQErrors.Empty
|
||||
|
||||
test "Should throw pushing to an full queue":
|
||||
var heap = newAsyncHeapQueue[int](1)
|
||||
check heap.pushNoWait(1).isOk
|
||||
let err = heap.pushNoWait(2)
|
||||
check err.isErr
|
||||
check err.error == AsyncHQErrors.Full
|
||||
|
||||
test "Test clear":
|
||||
var heap = newAsyncHeapQueue[int]()
|
||||
let data = [1, 3, 5, 7, 9, 2, 4, 6, 8, 0]
|
||||
for item in data:
|
||||
check heap.pushNoWait(item).isOk
|
||||
|
||||
check heap.len == 10
|
||||
heap.clear()
|
||||
check heap.len == 0
|
||||
|
||||
asyncchecksuite "Asynchronous Tests":
|
||||
test "Test push":
|
||||
var heap = newAsyncHeapQueue[int]()
|
||||
let data = [1, 3, 5, 7, 9, 2, 4, 6, 8, 0]
|
||||
for item in data:
|
||||
await push(heap, item)
|
||||
check heap[0] == 0
|
||||
check heap.toSortedSeq == @[0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
|
||||
|
||||
test "Test push and pop with maxSize":
|
||||
var heap = newAsyncHeapQueue[int](5)
|
||||
let data = [1, 9, 5, 3, 7, 4, 2]
|
||||
|
||||
proc pushTask() {.async.} =
|
||||
for item in data:
|
||||
await push(heap, item)
|
||||
|
||||
let pushFut = pushTask()
|
||||
|
||||
check heap.len == 5
|
||||
check heap[0] == 1 # because we haven't pushed 0 yet
|
||||
|
||||
check (await heap.pop) == 1
|
||||
check (await heap.pop) == 3
|
||||
check (await heap.pop) == 5
|
||||
check (await heap.pop) == 7
|
||||
check (await heap.pop) == 9
|
||||
|
||||
await sleepAsync(1.milliseconds) # allow poll to run once more
|
||||
check (await heap.pop) == 2
|
||||
check (await heap.pop) == 4
|
||||
await pushFut
|
||||
|
||||
test "Test single push when empty":
|
||||
let heap = newAsyncHeapQueue[int](1)
|
||||
|
||||
check heap.empty()
|
||||
let popFut = heap.pop()
|
||||
|
||||
proc pushTask() {.async.} =
|
||||
await heap.push(1)
|
||||
|
||||
let pushFut = pushTask()
|
||||
await allFutures(@[FutureBase(pushFut), FutureBase(popFut)])
|
||||
check (await popFut) == 1
|
||||
await pushFut
|
||||
|
||||
test "Test multiple pushes when empty - single producer, multiple consumers":
|
||||
let heap = newAsyncHeapQueue[int](1)
|
||||
|
||||
proc pushTask() {.async.} =
|
||||
var pushes = 2
|
||||
for i in 0 .. 100:
|
||||
echo "Pushing ", i
|
||||
await heap.push(i)
|
||||
pushes -= 1
|
||||
if pushes == 0:
|
||||
echo "Sleeping"
|
||||
await sleepAsync(10.millis) # allow poll to run once more
|
||||
pushes = 2
|
||||
|
||||
let pushFut = pushTask()
|
||||
|
||||
var popTasks = 0
|
||||
proc popTask() {.async.} =
|
||||
echo "starting pop task: ", popTasks
|
||||
let thisTask = popTasks
|
||||
popTasks += 1
|
||||
await sleepAsync(100.millis)
|
||||
var i = 0
|
||||
while not pushFut.finished:
|
||||
let fut = heap.pop()
|
||||
if heap.empty():
|
||||
await sleepAsync(1.millis) # allow poll to run once more
|
||||
let popRes = await fut
|
||||
echo "Task # ", thisTask, " popRes: ", popRes
|
||||
check popRes == i
|
||||
i += 1
|
||||
|
||||
var popFuts = newSeq[Future[void]]()
|
||||
for i in 0 ..< 10:
|
||||
popFuts.add(popTask())
|
||||
|
||||
await allFutures(popFuts.mapIt(FutureBase(it)) & @[FutureBase(pushFut)])
|
||||
|
||||
test "Test update":
|
||||
var heap = newAsyncHeapQueue[Task](5)
|
||||
let data = [("a", 4), ("b", 3), ("c", 2)]
|
||||
|
||||
for item in data:
|
||||
check heap.pushNoWait(item).isOk
|
||||
|
||||
check heap[0] == (name: "c", priority: 2)
|
||||
check heap.update((name: "a", priority: 1))
|
||||
check heap[0] == (name: "a", priority: 1)
|
||||
|
||||
test "Test pushOrUpdate - update":
|
||||
var heap = newAsyncHeapQueue[Task](3)
|
||||
let data = [("a", 4), ("b", 3), ("c", 2)]
|
||||
|
||||
for item in data:
|
||||
check heap.pushNoWait(item).isOk
|
||||
|
||||
check heap[0] == (name: "c", priority: 2)
|
||||
await heap.pushOrUpdate((name: "a", priority: 1))
|
||||
check heap[0] == (name: "a", priority: 1)
|
||||
|
||||
test "Test pushOrUpdate - push":
|
||||
var heap = newAsyncHeapQueue[Task](2)
|
||||
let data = [("a", 4), ("b", 3)]
|
||||
|
||||
for item in data:
|
||||
check heap.pushNoWait(item).isOk
|
||||
|
||||
check heap[0] == ("b", 3) # sanity check for order
|
||||
|
||||
let fut = heap.pushOrUpdate(("c", 2))
|
||||
# attempt to push a non existen item but block
|
||||
check heap.popNoWait().tryGet() == ("b", 3) # pop one off
|
||||
await fut # wait for push to complete
|
||||
|
||||
check heap[0] == (name: "c", priority: 2) # check order again
|
||||
|
||||
test "Test pop":
|
||||
var heap = newAsyncHeapQueue[int]()
|
||||
let data = [1, 3, 5, 7, 9, 2, 4, 6, 8, 0]
|
||||
for item in data:
|
||||
check heap.pushNoWait(item).isOk
|
||||
|
||||
var res: seq[int]
|
||||
while heap.len > 0:
|
||||
res.add((await heap.pop()))
|
||||
|
||||
check res == @[0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
|
||||
|
||||
test "Test delete":
|
||||
var heap = newAsyncHeapQueue[Task]()
|
||||
let data = ["d", "b", "c", "a", "h", "e", "f", "g"]
|
||||
|
||||
for item in data:
|
||||
check heap.pushNoWait((name: item, priority: Rng.instance().rand(data.len))).isOk
|
||||
|
||||
let del = heap[3]
|
||||
heap.delete(del)
|
||||
check heap.find(del) < 0
|
||||
|
||||
2
vendor/nim-ethers
vendored
2
vendor/nim-ethers
vendored
@ -1 +1 @@
|
||||
Subproject commit 1cfccb9695fa47860bf7ef3d75da9019096a3933
|
||||
Subproject commit 7081e6922fbcceb4ec3d7579e928576466c72d4f
|
||||
Loading…
x
Reference in New Issue
Block a user