status-im
/
nim-stew
mirror of https://github.com/status-im/nim-stew.git
2
0
Fork 0
Code Issues Projects Releases Wiki Activity

Reduce declared but unused warnings in keyed-queue (#224)

This commit is contained in:
andri lim 2024-07-19 14:30:22 +07:00 committed by GitHub
parent e00fea1f6e
commit 54cc67cbb8
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
stew/keyed_queue.nim
View File

@ -272,7 +272,7 @@ proc append*[K, V](rq: var KeyedQueue[K, V], key: K, val: V): bool =
## All the items on the queue different from the one just added are ## All the items on the queue different from the one just added are
## called *previous* or *left hand* items while the item just added ## called *previous* or *left hand* items while the item just added
## is the *right-most* item. ## is the *right-most* item.
rq.tab.withValue(key, item): rq.tab.withValue(key, _):
return false return false
do: do:
rq.appendImpl(key, val) rq.appendImpl(key, val)
@ -310,7 +310,7 @@ proc prepend*[K, V](rq: var KeyedQueue[K, V], key: K, val: V): bool =
## All the items on the queue different from the item just added are ## All the items on the queue different from the item just added are
## called *following* or *right hand* items while the item just added ## called *following* or *right hand* items while the item just added
## is the *left-most* item. ## is the *left-most* item.
rq.tab.withValue(key, item): rq.tab.withValue(key, _):
return false return false
do: do:
rq.prependImpl(key, val) rq.prependImpl(key, val)
@ -330,10 +330,10 @@ proc shift*[K, V](rq: var KeyedQueue[K, V]): Opt[KeyedQueuePair[K, V]] =
type T = KeyedQueuePair[K, V] type T = KeyedQueuePair[K, V]
if 0 < rq.tab.len: if 0 < rq.tab.len:
rq.tab.withValue(rq.kFirst, item): rq.tab.withValue(rq.kFirst, item):
let res = Opt.some KeyedQueuePair[K, V](key: rq.kFirst, data: move(item[].data)) let res = Opt.some T(key: rq.kFirst, data: move(item[].data))
rq.shiftImpl rq.shiftImpl
return res return res
Opt.none(KeyedQueuePair[K, V]) Opt.none(T)
proc shiftKey*[K, V](rq: var KeyedQueue[K, V]): Opt[K] = proc shiftKey*[K, V](rq: var KeyedQueue[K, V]): Opt[K] =
## Similar to `shift()` but with different return value. ## Similar to `shift()` but with different return value.