jyapayne/Nim
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Merge branch 'devel' of github.com:nim-lang/Nim into devel

Browse source
This commit is contained in:
Araq 2017-12-15 15:34:00 +01:00
commit b73bb911a9
1 changed files with 3 additions and 3 deletions
Download patch file Download diff file Expand all files Collapse all files

6
lib/pure/collections/tables.nim
View file

@ -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) ## returns the (key,val)-pair with the smallest `val`. Efficiency: O(n)
assert t.len > 0 assert t.len > 0
var minIdx = -1 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): if t.data[h].val > 0 and (minIdx == -1 or t.data[minIdx].val > t.data[h].val):
minIdx = h minIdx = h
result.key = t.data[minIdx].key result.key = t.data[minIdx].key
@ -1332,5 +1332,5 @@ when isMainModule:
block: # CountTable.smallest block: # CountTable.smallest
var t = initCountTable[int]() var t = initCountTable[int]()
for v in items([4, 4, 5, 5, 5]): t.inc(v) for v in items([0, 0, 5, 5, 5]): t.inc(v)
doAssert t.smallest == (4, 2) doAssert t.smallest == (0, 2)