attempt to fix a critical memory leak in Nim's collections
This commit is contained in:
parent
50756d8859
commit
5f83e869fa
2 changed files with 12 additions and 0 deletions
|
|
@ -261,6 +261,8 @@ template doWhile(a: expr, b: stmt): stmt =
|
|||
b
|
||||
if not a: break
|
||||
|
||||
proc default[T](t: typedesc[T]): T {.inline.} = discard
|
||||
|
||||
proc excl*[A](s: var HashSet[A], key: A) =
|
||||
## Excludes `key` from the set `s`.
|
||||
##
|
||||
|
|
@ -277,11 +279,13 @@ proc excl*[A](s: var HashSet[A], key: A) =
|
|||
var msk = high(s.data)
|
||||
if i >= 0:
|
||||
s.data[i].hcode = 0
|
||||
s.data[i].key = default(type(s.data[i].key))
|
||||
dec(s.counter)
|
||||
while true: # KnuthV3 Algo6.4R adapted for i=i+1 instead of i=i-1
|
||||
var j = i # The correctness of this depends on (h+1) in nextTry,
|
||||
var r = j # though may be adaptable to other simple sequences.
|
||||
s.data[i].hcode = 0 # mark current EMPTY
|
||||
s.data[i].key = default(type(s.data[i].key))
|
||||
doWhile ((i >= r and r > j) or (r > j and j > i) or (j > i and i >= r)):
|
||||
i = (i + 1) and msk # increment mod table size
|
||||
if isEmpty(s.data[i].hcode): # end of collision cluster; So all done
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue