1 files changed, 0 insertions, 123 deletions
diff --git a/nim/bitsets.pas b/nim/bitsets.pas
deleted file mode 100755
index 78c6d1f36..000000000
--- a/nim/bitsets.pas
+++ /dev/null
@@ -1,123 +0,0 @@
-//
-//
-//           The Nimrod Compiler
-//        (c) Copyright 2008 Andreas Rumpf
-//
-//    See the file "copying.txt", included in this
-//    distribution, for details about the copyright.
-//
-unit bitsets;
-
-// this unit handles Nimrod sets; it implements bit sets
-// the code here should be reused in the Nimrod standard library
-
-interface
-
-{$include 'config.inc'}
-
-{@ignore}
-uses
-  nsystem;
-{@emit}
-
-type
-  TBitSet = array of Byte; // we use byte here to avoid issues with
-                           // cross-compiling; uint would be more efficient
-                           // however
-
-const
-  ElemSize = sizeof(Byte) * 8;
-
-procedure BitSetInit(out b: TBitSet; len: int);
-procedure BitSetUnion(var x: TBitSet; const y: TBitSet);
-procedure BitSetDiff(var x: TBitSet; const y: TBitSet);
-procedure BitSetSymDiff(var x: TBitSet; const y: TBitSet);
-procedure BitSetIntersect(var x: TBitSet; const y: TBitSet);
-procedure BitSetIncl(var x: TBitSet; const elem: BiggestInt);
-procedure BitSetExcl(var x: TBitSet; const elem: BiggestInt);
-
-function BitSetIn(const x: TBitSet; const e: BiggestInt): Boolean;
-function BitSetEquals(const x, y: TBitSet): Boolean;
-function BitSetContains(const x, y: TBitSet): Boolean;
-
-implementation
-
-function BitSetIn(const x: TBitSet; const e: BiggestInt): Boolean;
-begin
-  result := (x[int(e div ElemSize)] and toU8(int(1 shl (e mod ElemSize)))) <> toU8(0)
-end;
-
-procedure BitSetIncl(var x: TBitSet; const elem: BiggestInt);
-begin
-  assert(elem >= 0);
-  x[int(elem div ElemSize)] := x[int(elem div ElemSize)] or 
-    toU8(int(1 shl (elem mod ElemSize)))
-end;
-
-procedure BitSetExcl(var x: TBitSet; const elem: BiggestInt);
-begin
-  x[int(elem div ElemSize)] := x[int(elem div ElemSize)] and
-                          not toU8(int(1 shl (elem mod ElemSize)))
-end;
-
-procedure BitSetInit(out b: TBitSet; len: int);
-begin
-{@ignore}
-  setLength(b, len);
-  fillChar(b[0], length(b)*sizeof(b[0]), 0);
-{@emit
-  newSeq(b, len);
-}
-end;
-
-procedure BitSetUnion(var x: TBitSet; const y: TBitSet);
-var
-  i: int;
-begin
-  for i := 0 to high(x) do x[i] := x[i] or y[i]
-end;
-
-procedure BitSetDiff(var x: TBitSet; const y: TBitSet);
-var
-  i: int;
-begin
-  for i := 0 to high(x) do x[i] := x[i] and not y[i]
-end;
-
-procedure BitSetSymDiff(var x: TBitSet; const y: TBitSet);
-var
-  i: int;
-begin
-  for i := 0 to high(x) do x[i] := x[i] xor y[i]
-end;
-
-procedure BitSetIntersect(var x: TBitSet; const y: TBitSet);
-var
-  i: int;
-begin
-  for i := 0 to high(x) do x[i] := x[i] and y[i]
-end;
-
-function BitSetEquals(const x, y: TBitSet): Boolean;
-var
-  i: int;
-begin
-  for i := 0 to high(x) do
-    if x[i] <> y[i] then begin
-      result := false; exit;
-    end;
-  result := true
-end;
-
-function BitSetContains(const x, y: TBitSet): Boolean;
-var
-  i: int;
-begin
-  for i := 0 to high(x) do
-    if (x[i] and not y[i]) <> byte(0) then begin
-      result := false; exit;
-    end;
-  result := true
-end;
-
-end.