summary refs log tree commit diff stats
path: root/lib
diff options
context:
space:
mode:
authorZach Smith <subsetpark@gmail.com>2017-04-18 18:35:44 -0400
committerAndreas Rumpf <rumpf_a@web.de>2017-04-19 00:35:44 +0200
commitfa592f3aada5d07b53bef8799fa40901cf6c0d44 (patch)
treef668167af990dae7b037ee3f0b0919b4500cb820 /lib
parent03ddfddcaed5237ef48a959e45a49c4693fd72e4 (diff)
downloadNim-fa592f3aada5d07b53bef8799fa40901cf6c0d44.tar.gz
Minor: spelling correction in tables.nim (#5727)
Diffstat (limited to 'lib')
-rw-r--r--lib/pure/collections/tables.nim4
1 files changed, 2 insertions, 2 deletions
diff --git a/lib/pure/collections/tables.nim b/lib/pure/collections/tables.nim
index b6c00966f..969802cfc 100644
--- a/lib/pure/collections/tables.nim
+++ b/lib/pure/collections/tables.nim
@@ -785,7 +785,7 @@ proc sort*[A, B](t: OrderedTableRef[A, B],
   t[].sort(cmp)
 
 proc del*[A, B](t: var OrderedTable[A, B], key: A) =
-  ## deletes `key` from ordered hash table `t`. O(n) comlexity.
+  ## deletes `key` from ordered hash table `t`. O(n) complexity.
   var n: OrderedKeyValuePairSeq[A, B]
   newSeq(n, len(t.data))
   var h = t.first
@@ -804,7 +804,7 @@ 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) comlexity.
+  ## deletes `key` from ordered hash table `t`. O(n) complexity.
   t[].del(key)
 
 # ------------------------------ count tables -------------------------------