diff options
| author | Charles Blake <cblake@csail.mit.edu> | 2015-02-13 14:10:09 -0500 |
|---|---|---|
| committer | Charles Blake <cblake@csail.mit.edu> | 2015-02-13 14:10:09 -0500 |
| commit | 5068a5aa016fef0b65c7cd6af27eeeefda0e5c95 (patch) | |
| tree | e47b3e2a7981599dd16e4689e92c2b53b1f11085 /lib/pure/collections/tables.nim | |
| parent | 39b98fede3d982c8599c9ed80f1df1d56a4bcf18 (diff) | |
| download | Nim-5068a5aa016fef0b65c7cd6af27eeeefda0e5c95.tar.gz | |
assignment -> shallowCopy for efficiency.
Diffstat (limited to 'lib/pure/collections/tables.nim')
| -rw-r--r-- | lib/pure/collections/tables.nim | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/lib/pure/collections/tables.nim b/lib/pure/collections/tables.nim index 58305b010..25fe306c0 100644 --- a/lib/pure/collections/tables.nim +++ b/lib/pure/collections/tables.nim @@ -287,7 +287,7 @@ proc del*[A, B](t: var Table[A, B], key: A) = if isEmpty(t.data[i].hcode): # end of collision cluster; So all done return r = t.data[i].hcode and msk # "home" location of key@i - t.data[j] = t.data[i] # data[j] will be marked EMPTY next loop + shallowCopy(t.data[j], t.data[i]) # data[j] will be marked EMPTY next loop proc initTable*[A, B](initialSize=64): Table[A, B] = ## creates a new hash table that is empty. |