mirrors/Nim
1
0
Fork 0
mirror of https://github.com/nim-lang/Nim.git synced 2026-04-19 22:10:33 +00:00
Code Issues Packages Projects Releases Wiki Activity

Clarify the docs for tables.del (#8134)

Browse Source
This commit is contained in:
Yuriy Glukhov
2018-06-27 23:25:22 +03:00
committed by Andreas Rumpf
parent 9ed671b2fe
commit e66b7f3909
1 changed files with 6 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
lib/pure/collections/tables.nim
View File

@@ -280,7 +280,7 @@ iterator mvalues*[A, B](t: var Table[A, B]): var B =
if isFilled(t.data[h].hcode): yield t.data[h].val
proc del*[A, B](t: var Table[A, B], key: A) =
## deletes `key` from hash table `t`.
## deletes `key` from hash table `t`. Does nothing if the key does not exist.
delImpl()
proc take*[A, B](t: var Table[A, B], key: A, val: var B): bool =
@@ -457,7 +457,7 @@ proc add*[A, B](t: TableRef[A, B], key: A, val: B) =
t[].add(key, val)
proc del*[A, B](t: TableRef[A, B], key: A) =
## deletes `key` from hash table `t`.
## deletes `key` from hash table `t`. Does nothing if the key does not exist.
t[].del(key)
proc take*[A, B](t: TableRef[A, B], key: A, val: var B): bool =
@@ -845,7 +845,8 @@ proc sort*[A, B](t: OrderedTableRef[A, B], cmp: proc (x,y: (A, B)): int) =
t[].sort(cmp)
proc del*[A, B](t: var OrderedTable[A, B], key: A) =
## deletes `key` from ordered hash table `t`. O(n) complexity.
## deletes `key` from ordered hash table `t`. O(n) complexity. Does nothing
## if the key does not exist.
var n: OrderedKeyValuePairSeq[A, B]
newSeq(n, len(t.data))
var h = t.first
@@ -864,7 +865,8 @@ proc del*[A, B](t: var OrderedTable[A, B], key: A) =
h = nxt
proc del*[A, B](t: var OrderedTableRef[A, B], key: A) =
## deletes `key` from ordered hash table `t`. O(n) complexity.
## deletes `key` from ordered hash table `t`. O(n) complexity. Does nothing
## if the key does not exist.
t[].del(key)
# ------------------------------ count tables -------------------------------