1 files changed, 20 insertions, 20 deletions
diff --git a/compiler/bitsets.nim b/compiler/bitsets.nim
index a2324f4e2..5454ef5e7 100644
--- a/compiler/bitsets.nim
+++ b/compiler/bitsets.nim
@@ -10,12 +10,12 @@
 # this unit handles Nim sets; it implements bit sets
 # the code here should be reused in the Nim standard library
 
-type 
+type
   TBitSet* = seq[int8]        # we use byte here to avoid issues with
                               # cross-compiling; uint would be more efficient
                               # however
 
-const 
+const
   ElemSize* = sizeof(int8) * 8
 
 proc bitSetInit*(b: var TBitSet, length: int)
@@ -30,42 +30,42 @@ proc bitSetEquals*(x, y: TBitSet): bool
 proc bitSetContains*(x, y: TBitSet): bool
 # implementation
 
-proc bitSetIn(x: TBitSet, e: BiggestInt): bool = 
+proc bitSetIn(x: TBitSet, e: BiggestInt): bool =
   result = (x[int(e div ElemSize)] and toU8(int(1 shl (e mod ElemSize)))) !=
       toU8(0)
 
-proc bitSetIncl(x: var TBitSet, elem: BiggestInt) = 
+proc bitSetIncl(x: var TBitSet, elem: BiggestInt) =
   assert(elem >= 0)
   x[int(elem div ElemSize)] = x[int(elem div ElemSize)] or
       toU8(int(1 shl (elem mod ElemSize)))
 
-proc bitSetExcl(x: var TBitSet, elem: BiggestInt) = 
+proc bitSetExcl(x: var TBitSet, elem: BiggestInt) =
   x[int(elem div ElemSize)] = x[int(elem div ElemSize)] and
       not toU8(int(1 shl (elem mod ElemSize)))
 
-proc bitSetInit(b: var TBitSet, length: int) = 
+proc bitSetInit(b: var TBitSet, length: int) =
   newSeq(b, length)
 
-proc bitSetUnion(x: var TBitSet, y: TBitSet) = 
+proc bitSetUnion(x: var TBitSet, y: TBitSet) =
   for i in countup(0, high(x)): x[i] = x[i] or y[i]
-  
-proc bitSetDiff(x: var TBitSet, y: TBitSet) = 
+
+proc bitSetDiff(x: var TBitSet, y: TBitSet) =
   for i in countup(0, high(x)): x[i] = x[i] and not y[i]
-  
-proc bitSetSymDiff(x: var TBitSet, y: TBitSet) = 
+
+proc bitSetSymDiff(x: var TBitSet, y: TBitSet) =
   for i in countup(0, high(x)): x[i] = x[i] xor y[i]
-  
-proc bitSetIntersect(x: var TBitSet, y: TBitSet) = 
+
+proc bitSetIntersect(x: var TBitSet, y: TBitSet) =
   for i in countup(0, high(x)): x[i] = x[i] and y[i]
-  
-proc bitSetEquals(x, y: TBitSet): bool = 
-  for i in countup(0, high(x)): 
-    if x[i] != y[i]: 
+
+proc bitSetEquals(x, y: TBitSet): bool =
+  for i in countup(0, high(x)):
+    if x[i] != y[i]:
       return false
   result = true
 
-proc bitSetContains(x, y: TBitSet): bool = 
-  for i in countup(0, high(x)): 
-    if (x[i] and not y[i]) != int8(0): 
+proc bitSetContains(x, y: TBitSet): bool =
+  for i in countup(0, high(x)):
+    if (x[i] and not y[i]) != int8(0):
       return false
   result = true