mirror of
https://github.com/logos-storage/nim-datastore.git
synced 2026-01-02 13:43:11 +00:00
54 lines
1.3 KiB
Nim
54 lines
1.3 KiB
Nim
import pkg/upraises
|
|
import std/algorithm
|
|
import pkg/chronos
|
|
import pkg/questionable
|
|
import pkg/questionable/results
|
|
|
|
import ./key
|
|
import ./types
|
|
|
|
export types
|
|
export options, SortOrder
|
|
|
|
type
|
|
Query* = object
|
|
key*: Key # Key to be queried
|
|
value*: bool # Flag to indicate if data should be returned
|
|
limit*: int # Max items to return - not available in all backends
|
|
offset*: int # Offset from which to start querying - not available in all backends
|
|
sort*: SortOrder # Sort order - not available in all backends
|
|
|
|
QueryResponse* = tuple[key: ?Key, data: seq[byte]]
|
|
|
|
GetNext* = proc(): Future[?!QueryResponse] {.upraises: [], gcsafe.}
|
|
IterDispose* = proc(): Future[?!void] {.upraises: [], gcsafe.}
|
|
QueryIter* {.acyclic.} = ref object
|
|
finished*: bool
|
|
next*: GetNext
|
|
dispose*: IterDispose
|
|
|
|
iterator items*(q: QueryIter): Future[?!QueryResponse] =
|
|
while not q.finished:
|
|
yield q.next()
|
|
|
|
proc defaultDispose(): Future[?!void] {.upraises: [], gcsafe, async.} =
|
|
return success()
|
|
|
|
proc new*(T: type QueryIter, dispose = defaultDispose): T =
|
|
QueryIter(dispose: dispose)
|
|
|
|
proc init*(
|
|
T: type Query,
|
|
key: Key,
|
|
value = true,
|
|
sort = SortOrder.Ascending,
|
|
offset = 0,
|
|
limit = -1): T =
|
|
|
|
T(
|
|
key: key,
|
|
value: value,
|
|
sort: sort,
|
|
offset: offset,
|
|
limit: limit)
|