Removed redundant conditions in CritBitTree.inc, speedup it.
This commit is contained in:
parent
fbd91a474a
commit
3e799d7876
1 changed files with 1 additions and 4 deletions
|
|
@ -165,11 +165,8 @@ proc containsOrIncl*(c: var CritBitTree[void], key: string): bool =
|
||||||
|
|
||||||
proc inc*(c: var CritBitTree[int]; key: string, val: int = 1) =
|
proc inc*(c: var CritBitTree[int]; key: string, val: int = 1) =
|
||||||
## increments `c[key]` by `val`.
|
## increments `c[key]` by `val`.
|
||||||
let oldCount = c.count
|
|
||||||
var n = rawInsert(c, key)
|
var n = rawInsert(c, key)
|
||||||
if c.count >= oldCount or oldCount == 0:
|
inc n.val, val
|
||||||
# not a new key:
|
|
||||||
inc n.val, val
|
|
||||||
|
|
||||||
proc incl*(c: var CritBitTree[void], key: string) =
|
proc incl*(c: var CritBitTree[void], key: string) =
|
||||||
## includes `key` in `c`.
|
## includes `key` in `c`.
|
||||||
|
|
|
||||||
Loading…
Add table
Add a link
Reference in a new issue