1 files changed, 0 insertions, 62 deletions
diff --git a/tests/run/tsets2.nim b/tests/run/tsets2.nim
deleted file mode 100755
index 89935072f..000000000
--- a/tests/run/tsets2.nim
+++ /dev/null
@@ -1,62 +0,0 @@
-discard """
-  output: '''true'''
-  cmd: "nimrod cc --gc:none --hints:on $# $#"
-"""
-
-import hashes, sets
-
-const
-  data = [
-    "34", "12",
-    "90", "0",
-    "1", "2",
-    "3", "4",
-    "5", "6",
-    "7", "8",
-    "9", "---00",
-    "10", "11", "19",
-    "20", "30", "40",
-    "50", "60", "70",
-    "80"]
-
-block tableTest1:
-  var t = initSet[tuple[x, y: int]]()
-  t.incl((0,0))
-  t.incl((1,0))
-  assert(not t.containsOrIncl((0,1)))
-  t.incl((1,1))
-
-  for x in 0..1:
-    for y in 0..1:
-      assert((x,y) in t)
-  #assert($t == 
-  #  "{(x: 0, y: 0), (x: 0, y: 1), (x: 1, y: 0), (x: 1, y: 1)}")
-
-block setTest2:
-  var t = initSet[string]()
-  t.incl("test")
-  t.incl("111")
-  t.incl("123")
-  t.excl("111")
-  
-  t.incl("012")
-  t.incl("123") # test duplicates
-  
-  assert "123" in t
-  assert "111" notin t # deleted
-  
-  for key in items(data): t.incl(key)
-  for key in items(data): assert key in t
-  
-
-block orderedSetTest1:
-  var t = data.toOrderedSet
-  for key in items(data): assert key in t
-  var i = 0
-  # `items` needs to yield in insertion order:
-  for key in items(t):
-    assert key == data[i]
-    inc(i)
-
-echo "true"
-