From 9a05fd9dcf212fc46167232a3714ca7c823a71b4 Mon Sep 17 00:00:00 2001 From: Araq Date: Thu, 15 Nov 2018 15:10:29 +0100 Subject: [PATCH] disable some tests for the C++ target; refs #7870 --- tests/closure/tclosure.nim | 2 +- tests/coroutines/texceptions.nim | 4 ++++ tests/coroutines/tgc.nim | 4 ++++ tests/coroutines/titerators.nim | 4 ++++ tests/coroutines/twait.nim | 1 + tests/exception/tonraise.nim | 34 -------------------------------- tests/flags/tgenscript.nim | 1 + tests/generics/trtree.nim | 19 +++++++++--------- 8 files changed, 25 insertions(+), 44 deletions(-) delete mode 100644 tests/exception/tonraise.nim diff --git a/tests/closure/tclosure.nim b/tests/closure/tclosure.nim index 141968462b..c213d6a4bd 100644 --- a/tests/closure/tclosure.nim +++ b/tests/closure/tclosure.nim @@ -1,5 +1,5 @@ discard """ - file: "tclosure.nim" + target: "c" output: ''' 1 3 6 11 20 foo foo88 diff --git a/tests/coroutines/texceptions.nim b/tests/coroutines/texceptions.nim index f3debf0a75..e67f954c35 100644 --- a/tests/coroutines/texceptions.nim +++ b/tests/coroutines/texceptions.nim @@ -1,3 +1,7 @@ +discard """ + target: "c" +""" + import coro var stackCheckValue = 1100220033 diff --git a/tests/coroutines/tgc.nim b/tests/coroutines/tgc.nim index 66a12ab9d4..46f4f8e838 100644 --- a/tests/coroutines/tgc.nim +++ b/tests/coroutines/tgc.nim @@ -1,3 +1,7 @@ +discard """ + target: "c" +""" + import coro var maxOccupiedMemory = 0 diff --git a/tests/coroutines/titerators.nim b/tests/coroutines/titerators.nim index e2623ce2dd..610f2771a4 100644 --- a/tests/coroutines/titerators.nim +++ b/tests/coroutines/titerators.nim @@ -1,3 +1,7 @@ +discard """ + target: "c" +""" + import coro include system/timers diff --git a/tests/coroutines/twait.nim b/tests/coroutines/twait.nim index eb2765be46..1769966ab1 100644 --- a/tests/coroutines/twait.nim +++ b/tests/coroutines/twait.nim @@ -1,6 +1,7 @@ discard """ output: "Exit 1\nExit 2" disabled: "macosx" + target: "c" """ import coro diff --git a/tests/exception/tonraise.nim b/tests/exception/tonraise.nim deleted file mode 100644 index a155f0b8e3..0000000000 --- a/tests/exception/tonraise.nim +++ /dev/null @@ -1,34 +0,0 @@ -discard """ - output: '''i: 1 -success''' -""" - -type - ESomething = object of Exception - ESomeOtherErr = object of Exception - -proc genErrors(s: string) = - if s == "error!": - raise newException(ESomething, "Test") - else: - raise newException(EsomeotherErr, "bla") - -proc foo() = - var i = 0 - try: - inc i - onRaise(proc (e: ref Exception): bool = - echo "i: ", i) - genErrors("errssor!") - except ESomething: - echo("ESomething happened") - except: - echo("Some other error happened") - - # test that raise handler is gone: - try: - genErrors("error!") - except ESomething: - echo "success" - -foo() diff --git a/tests/flags/tgenscript.nim b/tests/flags/tgenscript.nim index 6a037b5d8f..45cfbfb84c 100644 --- a/tests/flags/tgenscript.nim +++ b/tests/flags/tgenscript.nim @@ -1,5 +1,6 @@ discard """ file: "tgenscript.nim" + target: "c" """ echo "--genscript" diff --git a/tests/generics/trtree.nim b/tests/generics/trtree.nim index 75de2a1c4c..321b31df6a 100644 --- a/tests/generics/trtree.nim +++ b/tests/generics/trtree.nim @@ -1,6 +1,7 @@ discard """ output: '''1 [2, 3, 4, 7] [0, 0]''' + target: "c" """ # Nim RTree and R*Tree implementation @@ -81,13 +82,13 @@ proc distance(c1, c2: BoxCenter): auto = proc overlap(r1, r2: Box): auto = result = type(r1[0].a)(1) for i in 0 .. r1.high: - result *= (min(r1[i]. b, r2[i]. b) - max(r1[i]. a, r2[i]. a)) + result *= (min(r1[i].b, r2[i].b) - max(r1[i].a, r2[i].a)) if result <= 0: return 0 proc union(r1, r2: Box): Box = for i in 0 .. r1.high: - result[i]. a = min(r1[i]. a, r2[i]. a) - result[i]. b = max(r1[i]. b, r2[i]. b) + result[i].a = min(r1[i].a, r2[i].a) + result[i].b = max(r1[i].b, r2[i].b) proc intersect(r1, r2: Box): bool = for i in 0 .. r1.high: @@ -98,12 +99,12 @@ proc intersect(r1, r2: Box): bool = proc area(r: Box): auto = #type(r[0].a) = result = type(r[0].a)(1) for i in 0 .. r.high: - result *= r[i]. b - r[i]. a + result *= r[i].b - r[i].a proc margin(r: Box): auto = #type(r[0].a) = result = type(r[0].a)(0) for i in 0 .. r.high: - result += r[i]. b - r[i]. a + result += r[i].b - r[i].a # how much enlargement does r1 need to include r2 proc enlargement(r1, r2: Box): auto = @@ -238,12 +239,12 @@ proc rstarSplit[M, D: Dim; RT, LT](t: RStarTree[M, D, RT, LT]; n: var Node[M, D, for d2 in 0 ..< 2 * D: let d = d2 div 2 if d2 mod 2 == 0: - sortPlus(n.a, lx, proc (x, y: NL): int = cmp(x.b[d].a, y.b[d].a)) + sortPlus(n.a, lx, proc (x, y: NL): int = cmp(x.b[d].a, y.b[d].a)) else: - sortPlus(n.a, lx, proc (x, y: NL): int = cmp(x.b[d].b, y.b[d].b)) + sortPlus(n.a, lx, proc (x, y: NL): int = cmp(x.b[d].b, y.b[d].b)) for i in t.m - 1 .. n.a.high - t.m + 1: var b = lx.b - for j in 0 ..< i: # we can precalculate union() for range 0 .. t.m - 1, but that seems to give no real benefit. Maybe for very large M? + for j in 0 ..< i: # we can precalculate union() for range 0 .. t.m - 1, but that seems to give no real benefit.Maybe for very large M? #echo "x",j b = union(n.a[j].b, b) var m = margin(b) @@ -446,7 +447,7 @@ proc reInsert[M, D: Dim; RT, LT](t: RStarTree[M, D, RT, LT]; n: var Node[M, D, R while p.a[i].n != n: inc(i) let c = center(p.a[i].b) - sortPlus(n.a, lx, proc (x, y: NL): int = cmp(distance(center(x.b), c), distance(center(y.b), c))) + sortPlus(n.a, lx, proc (x, y: NL): int = cmp(distance(center(x.b), c), distance(center(y.b), c))) n.numEntries = M - t.p swap(n.a[n.numEntries], lx) inc n.numEntries