diff options
author | Andreas Rumpf <rumpf_a@web.de> | 2016-07-29 17:35:51 +0200 |
---|---|---|
committer | Andreas Rumpf <rumpf_a@web.de> | 2016-07-29 23:51:01 +0200 |
commit | 60b187513ed8e2a061816a912e372a1c81794d50 (patch) | |
tree | 9ee88f0234c633d232b55fc9bbe2cca38b2b0866 /lib/pure/collections/sets.nim | |
parent | 9ee5b5eabca9455f0c31a89c865013afa5a2c39e (diff) | |
download | Nim-60b187513ed8e2a061816a912e372a1c81794d50.tar.gz |
stdlib and compiler don't use .immediate anymore
Diffstat (limited to 'lib/pure/collections/sets.nim')
-rw-r--r-- | lib/pure/collections/sets.nim | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/lib/pure/collections/sets.nim b/lib/pure/collections/sets.nim index 20e06aaae..da32c1950 100644 --- a/lib/pure/collections/sets.nim +++ b/lib/pure/collections/sets.nim @@ -286,7 +286,7 @@ proc excl*[A](s: var HashSet[A], key: A) = var r = j # though may be adaptable to other simple sequences. s.data[i].hcode = 0 # mark current EMPTY s.data[i].key = default(type(s.data[i].key)) - doWhile ((i >= r and r > j) or (r > j and j > i) or (j > i and i >= r)): + doWhile((i >= r and r > j) or (r > j and j > i) or (j > i and i >= r)): i = (i + 1) and msk # increment mod table size if isEmpty(s.data[i].hcode): # end of collision cluster; So all done return @@ -615,7 +615,7 @@ proc card*[A](s: OrderedSet[A]): int {.inline.} = ## <http://en.wikipedia.org/wiki/Cardinality>`_ of a set. result = s.counter -template forAllOrderedPairs(yieldStmt: stmt) {.dirty, immediate.} = +template forAllOrderedPairs(yieldStmt: untyped) {.dirty.} = var h = s.first while h >= 0: var nxt = s.data[h].next |