diff options
author | Andreas Rumpf <rumpf_a@web.de> | 2016-10-27 15:37:45 +0200 |
---|---|---|
committer | GitHub <noreply@github.com> | 2016-10-27 15:37:45 +0200 |
commit | 0f3419685fecc554f6ce28dee3e4630480358c3b (patch) | |
tree | c3796b4680f28d517714cf20127daa19f50867fe /lib | |
parent | cacbf8b32c7b910eeb6b8b5d37adf2a7dd2f343c (diff) | |
parent | a42e9b11a73c423f5be6f409cf5c5c109a4e8e1b (diff) | |
download | Nim-0f3419685fecc554f6ce28dee3e4630480358c3b.tar.gz |
Merge pull request #4964 from jangko/orderedtable_initialsize
fixes #4940
Diffstat (limited to 'lib')
-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 dd178ed4e..2bdf77125 100644 --- a/lib/pure/collections/tables.nim +++ b/lib/pure/collections/tables.nim @@ -756,7 +756,7 @@ proc newOrderedTable*[A, B](initialSize=64): OrderedTableRef[A, B] = ## values for this you could use the ``nextPowerOfTwo`` proc from the ## `math <math.html>`_ module or the ``rightSize`` proc from this module. new(result) - result[] = initOrderedTable[A, B]() + result[] = initOrderedTable[A, B](initialSize) proc newOrderedTable*[A, B](pairs: openArray[(A, B)]): OrderedTableRef[A, B] = ## creates a new ordered hash table that contains the given `pairs`. |