diff options
author | andri lim <jangko128@gmail.com> | 2016-10-27 11:32:14 +0700 |
---|---|---|
committer | andri lim <jangko128@gmail.com> | 2016-10-27 11:32:14 +0700 |
commit | a42e9b11a73c423f5be6f409cf5c5c109a4e8e1b (patch) | |
tree | cf0353b20afcbad6dfd22fabc4a9c5b5fb4a5a94 | |
parent | 38ad7400fa4ecc475b587456770e4d981dc9d037 (diff) | |
download | Nim-a42e9b11a73c423f5be6f409cf5c5c109a4e8e1b.tar.gz |
fixes #4940
-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`. |