diff options
Diffstat (limited to 'lib')
| -rw-r--r-- | lib/pure/collections/tables.nim | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/lib/pure/collections/tables.nim b/lib/pure/collections/tables.nim index 38f8f97f5..01767956e 100644 --- a/lib/pure/collections/tables.nim +++ b/lib/pure/collections/tables.nim @@ -994,7 +994,7 @@ proc smallest*[A](t: CountTable[A]): tuple[key: A, val: int] = ## returns the (key,val)-pair with the smallest `val`. Efficiency: O(n) assert t.len > 0 var minIdx = -1 - for h in 1..high(t.data): + for h in 0..high(t.data): if t.data[h].val > 0 and (minIdx == -1 or t.data[minIdx].val > t.data[h].val): minIdx = h result.key = t.data[minIdx].key @@ -1332,5 +1332,5 @@ when isMainModule: block: # CountTable.smallest var t = initCountTable[int]() - for v in items([4, 4, 5, 5, 5]): t.inc(v) - doAssert t.smallest == (4, 2) + for v in items([0, 0, 5, 5, 5]): t.inc(v) + doAssert t.smallest == (0, 2) |