Skip to content
This repository

HTTPS clone URL

Subversion checkout URL

You can clone with HTTPS or Subversion.

Download ZIP
Browse code

niecza unfudge

moritz++ # many of these from autounfudge
  • Loading branch information...
commit 5f0bdabff323072976ac425060b5636337d15eee 1 parent 4401e31
Will Coleda authored

Showing 47 changed files with 43 additions and 96 deletions. Show diff stats Hide diff stats

  1. 2  S02-lexical-conventions/unicode.t
  2. 2  S02-names/caller.t
  3. 4  S02-types/array.t
  4. 2  S02-types/hash.t
  5. 2  S02-types/mixed_multi_dimensional.t
  6. 6  S02-types/num.t
  7. 8  S03-metaops/reduce.t
  8. 2  S03-metaops/reverse.t
  9. 4  S03-operators/binding-scalars.t
  10. 2  S03-operators/range-basic.t
  11. 3  S03-operators/range.t
  12. 4  S03-operators/subscript-adverbs.t
  13. 4  S03-sequence/basic.t
  14. 2  S04-declarations/multiple.t
  15. 4  S04-declarations/my.t
  16. 2  S04-phasers/enter-leave.t
  17. 4  S04-phasers/pre-post.t
  18. 4  S04-statement-modifiers/for.t
  19. 2  S05-match/positions.t
  20. 4  S06-advanced/caller.t
  21. 2  S06-signature/errors.t
  22. 2  S12-class/stubs.t
  23. 2  S12-enums/basic.t
  24. 2  S13-type-casting/methods.t
  25. 2  S32-list/pick.t
  26. 5  S32-num/power.t
  27. 7  S32-num/rat.t
  28. 2  S32-str/capitalize.t
  29. 2  S32-str/comb.t
  30. 2  S32-str/flip.t
  31. 2  S32-str/uc.t
  32. 2  S32-str/words.t
  33. 2  S32-trig/atan2.t
  34. 2  S32-trig/cos.t
  35. 2  S32-trig/cosec.t
  36. 4  S32-trig/cosech.t
  37. 4  S32-trig/cosh.t
  38. 2  S32-trig/cotan.t
  39. 4  S32-trig/cotanh.t
  40. 2  S32-trig/sec.t
  41. 4  S32-trig/sech.t
  42. 2  S32-trig/sin.t
  43. 4  S32-trig/sinh.t
  44. 2  S32-trig/tan.t
  45. 4  S32-trig/tanh.t
  46. 1  integration/advent2009-day14.t
  47. 1  integration/advent2010-day04.t
2  S02-lexical-conventions/unicode.t
@@ -110,7 +110,7 @@ is((do { my $दूसरा = 2; sub टोटल ($x) { $x + 2 }; टोटल
110 110
 # L<S02/Unicode Semantics/Perl can count Unicode line and paragraph separators>
111 111
 
112 112
 #?rakudo: todo 'PS does not work to separate lines'
113  
-#?niecza skip 'PS does not work to separate lines'
  113
+#?niecza todo 'PS does not work to separate lines'
114 114
 eval_lives_ok "\{ 1 \} \x2029 \{ 1 \}", "Unicode 2029 can terminate lines";
115 115
 
116 116
 # L<S02/Bracketing Characters/If a character is already used>
2  S02-names/caller.t
@@ -84,7 +84,7 @@ plan 18;
84 84
   }
85 85
 
86 86
   my $abs = 23;
87  
-  #?niecza skip 'strictness'
  87
+  #?niecza todo 'strictness'
88 88
   dies_ok { bar() },
89 89
     'vars not declared "is dynamic" are not accessible via $CALLER::';
90 90
 }
4  S02-types/array.t
@@ -158,11 +158,11 @@ my @array2 = ("test", 1, Mu);
158 158
     ok(eval('@array11[2,0] = 12'), "push the value to a multidimension array");
159 159
 }
160 160
 
161  
-#?niecza skip "type constraints"
162 161
 {
163 162
     # declare the array with data type
164 163
     my Int @array;
165 164
     lives_ok { @array[0] = 23 },                   "stuffing Ints in an Int array works";
  165
+    #?niecza todo "type constraints"
166 166
     dies_ok  { @array[1] = $*ERR }, "stuffing IO in an Int array does not work";
167 167
 }
168 168
 
@@ -243,7 +243,7 @@ my @array2 = ("test", 1, Mu);
243 243
 
244 244
   eval_dies_ok '@arr[-1]', "readonly accessing [-1] of normal array is compile-time error";
245 245
   #?rakudo todo '@arr[-1] returns failure, not dies'
246  
-  #?niecza skip '@arr[-1] returns undef'
  246
+  #?niecza todo '@arr[-1] returns undef'
247 247
   dies_ok { @arr[ $minus_one ] }, "indirectly accessing [-1] " ~
248 248
                                    "through a variable is run-time error";
249 249
   dies_ok { @arr[$minus_one] = 42 }, "assigning to [-1] of a normal array is fatal";
2  S02-types/hash.t
@@ -247,7 +247,7 @@ lives_ok { Hash.new("a" => "b") }, 'Hash.new($pair) lives';
247 247
 }
248 248
 
249 249
 # Zen slices work on hashes too
250  
-#?niecza skip 'Use of uninitialized value in string context'
  250
+#?niecza todo 'Use of uninitialized value in string context'
251 251
 {
252 252
     my %h = { a => 1, b => 2, c => 3};
253 253
     is %h{*}.join('|'), %h.values.join('|'), '{*} zen slice';
2  S02-types/mixed_multi_dimensional.t
@@ -206,7 +206,7 @@ Some deeper tests were already added.
206 206
     #?rakudo 2 todo 'unknown'
207 207
     #?niecza todo
208 208
     is(+@array[1]<two>[0], 2, "two keys at level 4");
209  
-    #?niecza skip 'Use of uninitialized value in string context'
  209
+    #?niecza todo 'Use of uninitialized value in string context'
210 210
     is(@array[1]<two>[0]<f><other>, 5, "more keys at level 4");
211 211
 }
212 212
 
6  S02-types/num.t
@@ -40,35 +40,30 @@ is_approx( eval((-1.1).perl), -1.1, 'eval -1.1.Num.perl is -1.1' );
40 40
 {
41 41
     my $a = 1 / 1;
42 42
     isa_ok($a, Rat);
43  
-    #?niecza todo
44 43
     is(~$a, "1", '1/1 stringification works');
45 44
 }
46 45
 
47 46
 {
48 47
     my $a = -1.0;
49 48
     isa_ok($a, Rat);
50  
-    #?niecza todo
51 49
     is($a, "-1", '-1 stringification works');
52 50
 }
53 51
 
54 52
 {
55 53
     my $a = 0.1;
56 54
     isa_ok($a, Rat);
57  
-    #?niecza todo
58 55
     is($a, "0.1", '0.1 stringification works');
59 56
 }
60 57
 
61 58
 {
62 59
     my $a = -0.1; "$a";
63 60
     isa_ok($a, Rat);
64  
-    #?niecza todo
65 61
     is($a, "-0.1", '-0.1 stringification works');
66 62
 }
67 63
 
68 64
 {
69 65
     my $a = 10.01; "$a";
70 66
     isa_ok($a, Rat);
71  
-    #?niecza todo
72 67
     is($a, "10.01", '10.01 stringification works');
73 68
 }
74 69
 
@@ -154,7 +149,6 @@ isa_ok(1 / 1, Rat);
154 149
 }
155 150
 
156 151
 #L<S02/The C<Num> and C<Rat> Types/Perl 6 intrinsically supports big integers>
157  
-#?niecza skip 'System.FormatException: Unknown char: d'
158 152
 {
159 153
     my $a = "1.01";
160 154
     isa_ok($a.Int, Int);
8  S03-metaops/reduce.t
@@ -88,7 +88,7 @@ L<"http://groups.google.de/group/perl.perl6.language/msg/bd9eb275d5da2eda">
88 88
     is ~ ([\>]  4, 2, 3, 1).map({+$_}), "1 1 0 0", "[\\>] works (2)";
89 89
     is ~ ([\==]  4, 4, 4).map({+$_}),   "1 1 1",   "[\\==] works (1)";
90 90
     is ~ ([\==]  4, 5, 4).map({+$_}),   "1 0 0",   "[\\==] works (2)";
91  
-    #?niecza 2 skip 'this is parsed as ![=], not good'
  91
+    #?niecza 2 todo 'this is parsed as ![=], not good'
92 92
     is ~ ([\!=]  4, 5, 6).map({+$_}),   "1 1 1",   "[\\!=] works (1)";
93 93
     is ~ ([\!=]  4, 5, 5).map({+$_}),   "1 1 0",   "[\\!=] works (2)";
94 94
     is (~ [\**]  1, 2, 3),   "3 8 1",   "[\\**] (right assoc) works (1)";
@@ -98,7 +98,7 @@ L<"http://groups.google.de/group/perl.perl6.language/msg/bd9eb275d5da2eda">
98 98
 # RT #76110
99 99
 {
100 100
     is ~([\+] [\+] 1 xx 5), '1 3 6 10 15', 'two nested [\+]';
101  
-    #?niecza skip 'unary [] does not context yet'
  101
+    #?niecza todo 'unary [] does not context yet'
102 102
     is ([+] [1, 2, 3, 4]), 4,  '[+] does not flatten []-arrays';
103 103
 }
104 104
 
@@ -168,9 +168,9 @@ L<"http://groups.google.de/group/perl.perl6.language/msg/bd9eb275d5da2eda">
168 168
 }
169 169
 
170 170
 # Following two tests taken verbatim from former t/operators/reduce.t
171  
-#?niecza 2 skip 'These are hyperop tests!'
172 171
 lives_ok({my @foo = [1..3] >>+<< [1..3] >>+<< [1..3]},'Sanity Check');
173 172
 #?rakudo todo 'reduced hyper op'
  173
+#?niecza todo 'These are hyperop tests!'
174 174
 lives_ok({my @foo = [>>+<<] ([1..3],[1..3],[1..3])},'Parse [>>+<<]');
175 175
 
176 176
 # Check that user defined infix ops work with [...], too.
@@ -196,7 +196,7 @@ lives_ok({my @foo = [>>+<<] ([1..3],[1..3],[1..3])},'Parse [>>+<<]');
196 196
 
197 197
 # L<S03/"Reduction operators"/"Among the builtin operators, [+]() returns 0 and [*]() returns 1">
198 198
 
199  
-#?niecza skip '[*] identity'
  199
+#?niecza todo '[*] identity'
200 200
 is( ([*]()), 1, "[*]() returns 1");
201 201
 is( ([+]()), 0, "[+]() returns 0");
202 202
 
2  S03-metaops/reverse.t
@@ -53,9 +53,7 @@ is 4 Rcmp 5, 5 cmp 4, "4 Rcmp 5";
53 53
 isa_ok 4 Rcmp 5, (5 cmp 4).WHAT, "4 Rcmp 5 is the same type as 5 cmp 4";
54 54
 
55 55
 # precedence tests!
56  
-#?niecza todo
57 56
 is 3 R/ 9 + 5, 8, 'R/ gets precedence of /';
58  
-#?niecza todo
59 57
 is 4 R- 5 R/ 10, -2, "Rop gets the precedence of op";
60 58
 is (9 R... 1, 3), (1, 3, 5, 7, 9), "Rop gets list_infix precedence correctly";
61 59
 
4  S03-operators/binding-scalars.t
@@ -96,13 +96,13 @@ plan 30;
96 96
   $b($val);
97 97
   is $a, 42, "bound readonly sub param was bound correctly (1)";
98 98
   $val++;
99  
-  #?niecza skip "difference of interpretation on ro binding"
  99
+  #?niecza todo "difference of interpretation on ro binding"
100 100
   #?rakudo todo 'nom regression'
101 101
   is $a, 43, "bound readonly sub param was bound correctly (2)";
102 102
 
103 103
   dies_ok { $a = 23 },
104 104
     "bound readonly sub param remains readonly (1)";
105  
-  #?niecza skip "difference of interpretation on ro binding"
  105
+  #?niecza todo "difference of interpretation on ro binding"
106 106
   #?rakudo todo 'nom regression'
107 107
   is $a, 43,
108 108
     "bound readonly sub param remains readonly (2)";
2  S03-operators/range-basic.t
@@ -191,9 +191,9 @@ nok 'a' ~~ 'b'..'g',    "not 'a' ~~ 'b'..'g'";
191 191
 nok 'h' ~~ 'b'..'g',    "not 'h' ~~ 'b'..'g'";
192 192
 nok 0 ~~ 'a'..'g',      "not 0 ~~ 'a'..'g'";
193 193
 
194  
-#?niecza 4 skip 'alphabetic/* ranges'
195 194
 ok 'd' ~~ 'c'..*,       "'d' ~~ 'c'..*";
196 195
 nok 'b' ~~ 'c'..*,      "not 'b' ~~ 'c'..*";
  196
+#?niecza todo 'alphabetic/* ranges'
197 197
 ok 'b' ~~ *..'c',       "'b' ~~ *..'c'";
198 198
 nok 'd' ~~ *..'c',      "not 'd' ~~ *..'c'";
199 199
 
3  S03-operators/range.t
@@ -98,7 +98,6 @@ is (1..6 Z 'a' .. 'c').join, '1a2b3c',   'Ranges and infix:<Z>';
98 98
     # 16:16 <TimToady> ~(1.9 ^..^ 4.9) should produce 2.9, 3.9
99 99
     # 16:17 <pmichaud> and ~(1.9 ^..^ 4.5) would produce the same?
100 100
     # 16:17 <TimToady> yes
101  
-    #?niecza 4 todo
102 101
     is ~(1.1 .. 4) , "1.1 2.1 3.1", "range with float .min";
103 102
     is ~(1.9 .. 4) , "1.9 2.9 3.9", "range with float .min";
104 103
     is ~(1.1 ^.. 4), "2.1 3.1"    , "bottom exclusive range of float";
@@ -109,13 +108,11 @@ is (1..6 Z 'a' .. 'c').join, '1a2b3c',   'Ranges and infix:<Z>';
109 108
     is ~(1 ..^ 4.1), "1 2 3 4", "top exclusive range of float";
110 109
     is ~(1 ..^ 4.9), "1 2 3 4", "top exclusive range of float";
111 110
 
112  
-    #?niecza 4 todo
113 111
     is ~(1.1 .. 4.1), "1.1 2.1 3.1 4.1", "range with float .min/.max";
114 112
     is ~(1.9 .. 4.1), "1.9 2.9 3.9"    , "range with float .min/.max";
115 113
     is ~(1.1 .. 4.9), "1.1 2.1 3.1 4.1", "range with float .min/.max";
116 114
     is ~(1.9 .. 4.9), "1.9 2.9 3.9 4.9", "range with float .min/.max";
117 115
 
118  
-    #?niecza 4 todo
119 116
     is ~(1.1 ^..^ 4.1), "2.1 3.1"    , "both exclusive float range";
120 117
     is ~(1.9 ^..^ 4.1), "2.9 3.9"    , "both exclusive float range";
121 118
     is ~(1.1 ^..^ 4.9), "2.1 3.1 4.1", "both exclusive float range";
4  S03-operators/subscript-adverbs.t
@@ -25,7 +25,7 @@ plan 64;
25 25
     is ~(@array[0,1]:p), "0\ta 1\tB",
26 26
         ":p on an array returned a two-elem array consisting of the correct pairs";
27 27
 
28  
-    #?niecza skip 'Cannot use value like Pair as a number'
  28
+    #?niecza todo 'Cannot use value like Pair as a number'
29 29
     is +(@array[42,23]:p),  0, ":p on an array weeded out non-existing entries (1)";
30 30
     #?niecza todo
31 31
     is ~(@array[42,23]:p), "", ":p on an array weeded out non-existing entries (2)";
@@ -126,7 +126,7 @@ plan 64;
126 126
     is ~(%hash<0 1>:p), "0\ta 1\tB",
127 127
         ":p on a hash returned a two-elem array consisting of the correct pairs";
128 128
 
129  
-    #?niecza skip 'Cannot use value like Pair as a number'
  129
+    #?niecza todo 'Cannot use value like Pair as a number'
130 130
     is +(%hash<42 23>:p),  0, ":p on a hash weeded out non-existing entries (1)";
131 131
     #?niecza todo
132 132
     is ~(%hash<42 23>:p), "", ":p on a hash weeded out non-existing entries (2)";
4  S03-sequence/basic.t
@@ -18,7 +18,6 @@ is (1, 3 ... 9).join(', '), '1, 3, 5, 7, 9', 'simple additive sequence with two
18 18
 is (1, 0 ... -3).join(', '), '1, 0, -1, -2, -3', 'simple decreasing additive sequence with two items on the LHS';
19 19
 is (1, 3, 5 ... 9).join(', '), '1, 3, 5, 7, 9', 'simple additive sequence with three items on the LHS';
20 20
 is (1, 3, 9 ... 81).join(', '), '1, 3, 9, 27, 81', 'simple multiplicative sequence with three items on the LHS';
21  
-#?niecza todo 'Int-valued Rats written as N/1'
22 21
 is (81, 27, 9 ... 1).join(', '), '81, 27, 9, 3, 1', 'decreasing multiplicative sequence with three items on the LHS';
23 22
 is (1, { $_ + 2 } ... 9).join(', '), '1, 3, 5, 7, 9', 'simple sequence with one item and block closure on the LHS';
24 23
 is (1, *+2 ... 9).join(', '), '1, 3, 5, 7, 9', 'simple sequence with one item and * closure on the LHS';
@@ -43,7 +42,6 @@ is (1, 3 ... 10).[^6].join(', '), '1, 3, 5, 7, 9, 11', 'simple additive sequence
43 42
 is (1, 0 ... -3.5).[^6].join(', '), '1, 0, -1, -2, -3, -4', 'simple decreasing additive sequence with two items on the LHS';
44 43
 is (1, 3, 5 ... 10).[^6].join(', '), '1, 3, 5, 7, 9, 11', 'simple additive sequence with three items on the LHS';
45 44
 is (1, 3, 9 ... 100).[^6].join(', '), '1, 3, 9, 27, 81, 243', 'simple multiplicative sequence with three items on the LHS';
46  
-#?niecza todo 'Int-valued Rats written as N/1'
47 45
 is (81, 27, 9 ... 8/9).[^6], (81, 27, 9, 3, 1, 1/3), 'decreasing multiplicative sequence with three items on the LHS';
48 46
 is (1, { $_ + 2 } ... 10).[^6].join(', '), '1, 3, 5, 7, 9, 11', 'simple sequence with one item and block closure on the LHS';
49 47
 is (1, *+2 ... 10).[^6].join(', '), '1, 3, 5, 7, 9, 11', 'simple sequence with one item and * closure on the LHS';
@@ -65,7 +63,6 @@ is (1, 0 ... *).[^5].join(', '), '1, 0, -1, -2, -3', 'simple decreasing additive
65 63
 is (1, 3, 5 ... *).[^5].join(', '), '1, 3, 5, 7, 9', 'simple additive sequence with three items on the LHS';
66 64
 is (8, 7, 6 ... *).[^5].join(', '), '8, 7, 6, 5, 4', 'simple decreasing additive sequence with three items on the LHS';
67 65
 is (1, 3, 9 ... *).[^5].join(', '), '1, 3, 9, 27, 81', 'simple multiplicative sequence with three items on the LHS';
68  
-#?niecza todo 'Int-valued Rats written as N/1'
69 66
 is (81, 27, 9 ... *).[^5].join(', '), '81, 27, 9, 3, 1', 'decreasing multiplicative sequence with three items on the LHS';
70 67
 is (1, { $_ + 2 } ... *).[^5].join(', '), '1, 3, 5, 7, 9', 'simple sequence with one item and block closure on the LHS';
71 68
 is (1, *+2 ... *).[^5].join(', '), '1, 3, 5, 7, 9', 'simple sequence with one item and * closure on the LHS';
@@ -123,7 +120,6 @@ is (1, 2 ... 0).[^3], (1,2,3), 'No more: limit value is on the wrong side';
123 120
     is (1 ...^ -3).join(', '), '1, 0, -1, -2', 'exclusive decreasing sequence';
124 121
     is (1 ...^ 5.5).[^6].join(', '), '1, 2, 3, 4, 5, 6', "exclusive sequence that couldn't hit its limit anyway";
125 122
     is (1, 3, 9 ...^ 81).join(', '), '1, 3, 9, 27', 'exclusive geometric sequence';
126  
-    #?niecza todo 'Int-valued Rats written as N/1'
127 123
     is (81, 27, 9 ...^ 2).[^5].join(', '), '81, 27, 9, 3, 1', "exclusive decreasing geometric sequence that couldn't hit its limit anyway";
128 124
     is (2, -4, 8 ...^ 32).join(', '), '2, -4, 8, -16', 'exclusive alternating geometric sequence';
129 125
     is (2, -4, 8 ...^ -32).[^6].join(', '), '2, -4, 8, -16, 32, -64', 'exclusive alternating geometric sequence (not an exact match)';
2  S04-declarations/multiple.t
@@ -28,7 +28,7 @@ eval_dies_ok 'sub foo {1; }; sub foo($x) {1; };',
28 28
 eval_dies_ok 'only sub foo {1; }; sub foo($x) {1; };',
29 29
              'multiple declarations need multi or proto';
30 30
 
31  
-#?niecza skip "MMD"
  31
+#?niecza todo "MMD"
32 32
 #?rakudo todo 'nom regression'
33 33
 eval_lives_ok 'proto foo {1; }; sub foo {1; }; sub foo($x) {1; };',
34 34
              'multiple declarations need multi or proto';
4  S04-declarations/my.t
@@ -209,7 +209,7 @@ my $z = 42; #OK not used
209 209
     {
210 210
         my $a;
211 211
         #?rakudo todo 'fails'
212  
-        #?niecza 2 skip 'still fails?'
  212
+        #?niecza 2 todo 'still fails?'
213 213
         eval_lives_ok 'do { die "foo";my Int $x;CATCH { default { $a = ?($x ~~ Int) } } }';
214 214
         #?rakudo todo 'previous test skipped'
215 215
         ok $a, 'unreached declaration in effect at block start';
@@ -238,7 +238,7 @@ my $z = 42; #OK not used
238 238
         my $a = 42;
239 239
         our sub access_lexical_a() { $a }
240 240
     }
241  
-    #?niecza skip 'NYI'
  241
+    #?niecza todo 'NYI'
242 242
     is  OUR::access_lexical_a(), 42,
243 243
         'can call our-sub that accesses a lexical after the block was run';
244 244
 
2  S04-phasers/enter-leave.t
@@ -173,7 +173,7 @@ plan 19;
173 173
     is $str, '1', 'die aborts ENTER queue';
174 174
 }
175 175
 
176  
-#?niecza skip '@!'
  176
+#?niecza todo '@!'
177 177
 {
178 178
     my $str;
179 179
     try {
4  S04-phasers/pre-post.t
@@ -86,7 +86,7 @@ my $foo = PRE_Child.new;
86 86
 
87 87
 lives_ok { $foo.test(5)    }, 'PRE in methods compiles and runs';
88 88
 dies_ok  { $foo.test(-42)  }, 'PRE in child throws';
89  
-#?niecza skip 'PRE inheritance'
  89
+#?niecza todo 'PRE inheritance'
90 90
 dies_ok  { $foo.test(78)   }, 'PRE in parent throws';
91 91
 
92 92
 
@@ -164,7 +164,7 @@ dies_ok  { $pt.test(1) }, 'POST receives return value as $_ (failure)';
164 164
     is $str, '(', 'failing PRE runs nothing else';
165 165
 }
166 166
 
167  
-#?niecza skip 'I think POST runs LIFO by spec?'
  167
+#?niecza todo 'I think POST runs LIFO by spec?'
168 168
 {
169 169
     my $str;
170 170
     try {
4  S04-statement-modifiers/for.t
@@ -59,14 +59,14 @@ use Test;
59 59
     is $a, "<hello>", 'iterating one variable element works';
60 60
 }
61 61
 
62  
-#?niecza skip "closure for"
  62
+#?niecza todo "closure for"
63 63
 {
64 64
     my $a = 0;
65 65
     { $a++ } for 1..3;
66 66
     is $a, 3, 'the closure was called';
67 67
 }
68 68
 
69  
-#?niecza skip "closure for"
  69
+#?niecza todo "closure for"
70 70
 {
71 71
     my $a = 0;
72 72
     -> $i { $a += $i } for 1..3;
2  S05-match/positions.t
@@ -30,9 +30,7 @@ nok($/.from.defined,      'Match pos is undefined');
30 30
 my regex Aa { A .* a }
31 31
 #?rakudo 3 skip 'lexical lookup of <Aa>'
32 32
 ok($str ~~ m/ .*? <Aa> /, 'Subrule match from 3');
33  
-#?niecza skip 'System.InvalidCastException: Cannot cast from source type to destination type.'
34 33
 ok($/.from == 0,          'Full match pos is 0');
35  
-#?niecza skip 'Unable to resolve method from in class Any'
36 34
 ok($/<Aa>.from == 3,      'Subrule match pos is 3');
37 35
 
38 36
 
4  S06-advanced/caller.t
@@ -10,7 +10,7 @@ use Test;
10 10
 sub a_sub { b_sub() }
11 11
 sub b_sub { try { caller.subname } }
12 12
 #?pugs todo "feature"
13  
-#?niecza skip "try interferes with caller counting"
  13
+#?niecza todo "try interferes with caller counting"
14 14
 is ~a_sub(), "a_sub", "caller.sub works";
15 15
 
16 16
 # caller.file
@@ -20,7 +20,7 @@ ok index(~(try { caller.file }), "caller") >= 0, "caller.file works";
20 20
 # caller.line (XXX: make sure to edit the expected line number!)
21 21
 #?pugs 2 todo "feature"
22 22
 sub call_line { caller.line };
23  
-#?niecza skip "fudge messes up the line numbers"
  23
+#?niecza todo "fudge messes up the line numbers"
24 24
 is call_line(), 23, "caller.line works";
25 25
 
26 26
 # pugs: caller exposes a bug in the MMD mechanism where directly using autogenerated
2  S06-signature/errors.t
@@ -25,12 +25,12 @@ eval_lives_ok 'sub quuuux ($!) { ... }', 'but $! is OK';
25 25
 }
26 26
 
27 27
 # RT #71478
28  
-#?niecza skip 'Excess arguments to MAIN_3 foo, used 1 of 2 positionals'
29 28
 {
30 29
     my $success = try { eval 'sub foo(%h) { %h }; foo(1, 2); 1' };
31 30
     my $error   = "$!";
32 31
     nok $success,
33 32
         "Passing two arguments to a function expecting one hash is an error";
  33
+    #?niecza 3 todo 'error message content'
34 34
     ok $error ~~ / '%h' /,   '... error message mentions parameter';
35 35
     ok $error ~~ /:i 'type' /, '... error message mentions "type"';
36 36
     ok $error ~~ / Associative /, '... error message mentions "Associative"';
2  S12-class/stubs.t
@@ -12,7 +12,7 @@ eval_lives_ok q[ role StubB { ... }; role StubB { method foo { } }; ],
12 12
 eval_lives_ok q[ module StubC { ... }; module StubC { sub foo { } }; ],
13 13
               'Can stub a module, and later on declare it';
14 14
 
15  
-#?niecza skip 'broken in nom-derived stub model'
  15
+#?niecza todo 'broken in nom-derived stub model'
16 16
 #?rakudo todo 'nom regression'
17 17
 eval_lives_ok q[ package StubD { ... }; class StubD { method foo { } }; ],
18 18
               'Can stub a package, and later on implement it as a method';
2  S12-enums/basic.t
@@ -88,13 +88,13 @@ dies_ok({ my Color $c3 = "for the fail" }, 'enum as a type enforces checks');
88 88
 }
89 89
 
90 90
 # L<S12/The C<.pick> Method/"define a .pick method">
91  
-#?niecza skip '.pick and .roll'
92 91
 {
93 92
     lives_ok { my Color $k = Color.pick }, 'Color.pick assigns to Color var';
94 93
     isa_ok Color.pick, Color.pick.WHAT, 'Color.pick.isa';
95 94
 
96 95
     ok ?(Color.pick == any(Color::white, Color::gray, Color::black)),
97 96
             '.pick on enums';
  97
+    #?niecza todo 'picking multiple elements from an enum'
98 98
     ok Color.pick(2) == 2, '.pick(2) on enums';
99 99
 }
100 100
 
2  S13-type-casting/methods.t
@@ -12,7 +12,7 @@ class CoercionTest {
12 12
 
13 13
 my $o = CoercionTest.new();
14 14
 
15  
-#?niecza skip 'Stringy'
  15
+#?niecza todo 'Stringy'
16 16
 is ~$o, 'foo', 'method Stringy takes care of correct stringification';
17 17
 ok +$o == 1.2, 'method Numeric takes care of correct numification';
18 18
 
2  S32-list/pick.t
@@ -89,7 +89,7 @@ is (<a b c d>.pick(*).sort).Str, 'a b c d', 'pick(*) returns all the items in th
89 89
 }
90 90
 
91 91
 # enums + pick
92  
-#?niecza skip "pick(*) NYI"
  92
+#?niecza todo "pick(*) NYI"
93 93
 {
94 94
     is Bool.pick(*).elems, 2, 'Bool.pick works';
95 95
 
5  S32-num/power.t
@@ -14,7 +14,6 @@ is(4 ** 2,   16, "4 **  2 == 16");
14 14
 
15 15
 is(4 ** 0.5,  2, "4 ** .5 ==  2");
16 16
 is(4 ** (1/2), 2, "4 ** (1/2) == 2 ");
17  
-#?niecza skip 'Rat.Str'
18 17
 is(4 ** (-1/2), 0.5, "4 ** (-1/2) == 1/2 ");
19 18
 is((-2) ** 2, 4, "-2 ** 2 = 4");
20 19
 
@@ -30,7 +29,7 @@ is(0 ** NaN, NaN, "0**NaN=NaN");
30 29
 
31 30
 # Not at all sure the next three cases are correct!
32 31
 
33  
-#?niecza 2 skip 'complex NaN stringy'
  32
+#?niecza 2 todo 'complex NaN stringy'
34 33
 #?rakudo skip 'NaN**1i should be NaN'
35 34
 is(NaN ** 1i, NaN, "NaN**1i=NaN");
36 35
 #?rakudo skip '1i**NaN should be NaN'
@@ -78,9 +77,9 @@ is_approx (-1) ** -i, 23.1406926327793, "(-1) ** -i is approx 23.1406926327793";
78 77
 is_approx((4 + 0i) ** (2 + 0i), 4 ** 2, "(4+0i) ** (2+0i) == 16");
79 78
 
80 79
 # Rat ** a large number
81  
-#?niecza 2 skip 'does not work'
82 80
 ok(1.015 ** 200 !~~ NaN, "1.015 ** 200 is not NaN");
83 81
 #?rakudo todo 'big numbers'
  82
+#?niecza todo 'generates NaN'
84 83
 is_approx(1.015 ** 200, 19.6430286394751, "1.015 ** 200 == 19.6430286394751");
85 84
 
86 85
 done;
7  S32-num/rat.t
@@ -22,13 +22,9 @@ isa_ok( eval((1/3).perl), Rat, 'eval (1/3).perl is Rat' );
22 22
 is( (eval (1/3).perl).nude, (1, 3), 'eval (1/3).perl is 1/3' );
23 23
 
24 24
 # Test ~
25  
-#?niecza todo
26 25
 is(~(Rat.new(1,4)), ~(0.25e0), "Rats stringify properly");
27  
-#?niecza todo
28 26
 is(~(Rat.new(-1,2)), ~(-0.5e0), "Rats stringify properly");
29  
-#?niecza todo
30 27
 is(~(Rat.new(7,4)), ~(1.75e0), "Rats stringify properly");
31  
-#?niecza todo
32 28
 is(~(Rat.new(7,-1)), ~(-7), "Rats stringify properly");
33 29
 
34 30
 # Test new
@@ -78,7 +74,6 @@ isa_ok((2 / 3) / (5 / 4), Rat, "2/3 / 5/4 is a Rat");
78 74
 is((2 / 3) / 2, 1/3, "2/3 / 2 = 1/3");
79 75
 is(((2 / 3) / 2).nude, (1, 3), "2/3 / 2 = 1/3 is simplified internally");
80 76
 isa_ok((2 / 3) / 2, Rat, "2/3 / 2 is a Rat");
81  
-#?niecza todo
82 77
 is(2 / (1 / 3), 6, "2 / 1/3 = 6");
83 78
 isa_ok(2 / (1 / 3), Rat, "2 / 1/3 is a Rat");
84 79
 is((2 / (2 / 3)).nude, (3, 1), "2 / 2/3 = 3 is simplified internally");
@@ -147,10 +142,8 @@ is_approx sin(5.0e0), sin(10/2), 'sin(Rat) works';
147 142
 is NaN.Rat, NaN, "NaN.Rat == NaN";
148 143
 
149 144
 {
150  
-#?niecza todo
151 145
 #?rakudo todo "Inf.Rat"
152 146
 is Inf.Rat, Inf, "Inf.Rat == Inf";
153  
-#?niecza todo
154 147
 #?rakudo todo "Inf.Rat"
155 148
 is (-Inf).Rat, -Inf, "(-Inf).Rat == -Inf";
156 149
 
2  S32-str/capitalize.t
@@ -29,7 +29,7 @@ is "ab cD Ef".capitalize,      "Ab Cd Ef",       "works on ordinary string";
29 29
 is capitalize("äöü abcä"), "Äöü Abcä", "capitalize() works on non-ASCII chars";#
30 30
 
31 31
 #?rakudo 2 todo 'graphemes results wrong'
32  
-#?niecza 2 skip 'charspec'
  32
+#?niecza 2 todo 'charspec'
33 33
 is capitalize("a\c[COMBINING DIAERESIS]üö abcä"), "Äöü Abcä", 'capitalize on string with grapheme precomposed';
34 34
 is capitalize("a\c[COMBINING DOT ABOVE, COMBINING DOT BELOW] bc"),
35 35
     "A\c[COMBINING DOT BELOW, COMBINING DOT ABOVE] Bc",
2  S32-str/comb.t
@@ -17,7 +17,7 @@ is "a\nb".comb, ('a', "\n", 'b'), 'comb on string with \n';
17 17
 is "äbcd".comb, <ä b c d>, 'comb on string with non-ASCII letter';
18 18
 
19 19
 #?rakudo 2 todo 'graphemes not implemented'
20  
-#?niecza 2 skip 'charspec'
  20
+#?niecza 2 todo 'charspec'
21 21
 is "a\c[COMBINING DIAERESIS]b".comb, ("ä", "b",), 'comb on string with grapheme precomposed';
22 22
 is( "a\c[COMBINING DOT ABOVE, COMBINING DOT BELOW]b".comb,
23 23
     ("a\c[COMBINING DOT BELOW, COMBINING DOT ABOVE]", "b", ),
2  S32-str/flip.t
@@ -25,7 +25,7 @@ is( 'Hello World !'.flip.flip, 'Hello World !',
25 25
 # flip with unicode :
26 26
 is( '䀻«'.flip,   '«»€ä', "some unicode characters" );
27 27
 
28  
-#?niecza 2 skip 'graphemes not implemented'
  28
+#?niecza 2 todo 'graphemes not implemented'
29 29
 #?rakudo 2 skip 'graphemes not implemented'
30 30
 is( "a\c[COMBINING DIAERESIS]b".flip, 'bä', "grapheme precomposed" );
31 31
 is( "a\c[COMBINING DOT ABOVE, COMBINING DOT BELOW]b".flip,
2  S32-str/uc.t
@@ -36,7 +36,7 @@ is(uc(lc('HELL..')), 'HELL..', "uc/lc test");
36 36
 # Unicode 5.1.0 SpecialCasing.txt has 00DF -> 0053 0053
37 37
 # nothing maps to 1E9E, the new "capital sharp s"
38 38
 # so I think this is right -rhr
39  
-#?niecza skip 'German language weirdness'
  39
+#?niecza todo 'German language weirdness'
40 40
 is(uc("ß"), "SS", "uc() of non-ascii chars may result in two chars");
41 41
 
42 42
 {
2  S32-str/words.t
@@ -20,7 +20,7 @@ is "a\c[NO-BREAK SPACE]bc d".words, <a bc d>, 'words on string with (U+00A0 NO-B
20 20
 is "ä bc d".words, <ä bc d>, 'words on string with non-ASCII letter';
21 21
 
22 22
 #?rakudo 2 skip 'graphemes not implemented'
23  
-#?niecza 2 skip 'charspec'
  23
+#?niecza 2 todo 'charspec'
24 24
 is "a\c[COMBINING DIAERESIS] bc d".words, ("ä", "bc", "d"), 'words on string with grapheme precomposed';
25 25
 is( "a\c[COMBINING DOT ABOVE, COMBINING DOT BELOW] bc d".words,
26 26
     ("a\c[COMBINING DOT BELOW, COMBINING DOT ABOVE]", "bc", "d"),
2  S32-trig/atan2.t
@@ -182,7 +182,6 @@ is_approx(atan2(-4, -4), -3 * pi / 4, "atan2(-4, -4) is -3pi / 4");
182 182
     is_approx(atan2((1).Int, (-100).Int), 3.13159298690313, "atan2(Int, Int)");
183 183
 }
184 184
 
185  
-#?niecza skip 'Str math NYI'
186 185
 {
187 186
     # Int vs Str tests
188 187
     is_approx((-1).Int.atan2((100).Str), -0.00999966668666524, "Int.atan2(Str)");
@@ -214,7 +213,6 @@ is_approx(atan2(-4, -4), -3 * pi / 4, "atan2(-4, -4) is -3pi / 4");
214 213
     is_approx(atan2((-100).Str, (-10).Rat(1e-9)), -1.67046497928606, "atan2(Str, Rat)");
215 214
 }
216 215
 
217  
-#?niecza skip 'Str math NYI'
218 216
 {
219 217
     # Str vs Int tests
220 218
     is_approx((10).Str.atan2((-100).Int), 3.04192400109863, "Str.atan2(Int)");
2  S32-trig/cos.t
@@ -109,7 +109,6 @@ for @cosines -> $angle
109 109
     is_approx(cos((-1.57079632680947 + 2i).Complex), -5.48212707989036e-11 + 3.62686040784702i, "cos(Complex) - -1.57079632680947 + 2i");
110 110
 }
111 111
 
112  
-#?niecza skip "Str math NYI"
113 112
 {
114 113
     # Str tests
115 114
     is_approx((-1.04719755120631).Str.cos, 0.5, "Str.cos - -1.04719755120631");
@@ -164,7 +163,6 @@ for @cosines -> $angle
164 163
     is_approx(acos((0.785398163404734 + 2i).Complex), 1.22945740853541 - 1.49709293866352i, "acos(Complex) - 1.22945740853541 - 1.49709293866352i");
165 164
 }
166 165
 
167  
-#?niecza skip "Str math NYI"
168 166
 {
169 167
     # Str tests
170 168
     is_approx(((0.707106781186548).Str).acos, 0.785398163404734, "Str.acos - 0.785398163404734");
2  S32-trig/cosec.t
@@ -109,7 +109,6 @@ for @sines -> $angle
109 109
     is_approx(cosec((0.785398163404734 + 2i).Complex), 0.194833118738127 - 0.187824499973004i, "cosec(Complex) - 0.785398163404734 + 2i");
110 110
 }
111 111
 
112  
-#?niecza skip "Str math NYI"
113 112
 {
114 113
     # Str tests
115 114
     is_approx((1.57079632680947).Str.cosec, 1, "Str.cosec - 1.57079632680947");
@@ -164,7 +163,6 @@ for @sines -> $angle
164 163
     is_approx(acosec((0.785398163404734 + 2i).Complex), 0.156429673425433 - 0.425586400480703i, "acosec(Complex) - 0.156429673425433 - 0.425586400480703i");
165 164
 }
166 165
 
167  
-#?niecza skip "Str math NYI"
168 166
 {
169 167
     # Str tests
170 168
     is_approx(((1.99999999998317).Str).acosec, 0.523598775603156, "Str.acosec - 0.523598775603156");
4  S32-trig/cosech.t
@@ -87,7 +87,7 @@ for @sines -> $angle
87 87
     is_approx($zp2.cosech, $sz2, "Complex.cosech - $zp2");
88 88
 }
89 89
 
90  
-#?niecza skip "Inf results wrong"
  90
+#?niecza todo "Inf results wrong"
91 91
 {
92 92
     is(cosech(Inf), 0, "cosech(Inf) -");
93 93
     is(cosech(-Inf), "-0", "cosech(-Inf) -");
@@ -109,7 +109,6 @@ for @sines -> $angle
109 109
     is_approx(cosech((0.523598775603156 + 2i).Complex), -0.202302149262384 - 0.920006877922264i, "cosech(Complex) - 0.523598775603156 + 2i");
110 110
 }
111 111
 
112  
-#?niecza skip "Str math NYI"
113 112
 {
114 113
     # Str tests
115 114
     is_approx((0.785398163404734).Str.cosech, 1.15118387090806, "Str.cosech - 0.785398163404734");
@@ -164,7 +163,6 @@ for @sines -> $angle
164 163
     is_approx(acosech((0.785398163404734 + 2i).Complex), 0.186914543518615 - 0.439776333846415i, "acosech(Complex) - 0.186914543518615 - 0.439776333846415i");
165 164
 }
166 165
 
167  
-#?niecza skip "Str math NYI"
168 166
 {
169 167
     # Str tests
170 168
     is_approx(((1.8253055746695).Str).acosech, 0.523598775603156, "Str.acosech - 0.523598775603156");
4  S32-trig/cosh.t
@@ -87,7 +87,7 @@ for @coshes -> $angle
87 87
     is_approx($zp2.cosh, $sz2, "Complex.cosh - $zp2");
88 88
 }
89 89
 
90  
-#?niecza skip "Inf results wrong"
  90
+#?niecza todo "Inf results wrong"
91 91
 {
92 92
     is(cosh(Inf), Inf, "cosh(Inf) -");
93 93
     is(cosh(-Inf), Inf, "cosh(-Inf) -");
@@ -109,7 +109,6 @@ for @coshes -> $angle
109 109
     is_approx(cosh((0 + 2i).Complex), -0.416146836547142 + 0i, "cosh(Complex) - 0 + 2i");
110 110
 }
111 111
 
112  
-#?niecza skip "Str math NYI"
113 112
 {
114 113
     # Str tests
115 114
     is_approx((0.523598775603156).Str.cosh, 1.14023832107909, "Str.cosh - 0.523598775603156");
@@ -164,7 +163,6 @@ for @coshes -> $angle
164 163
     is_approx(acosh((0.785398163404734 + 2i).Complex), 1.49709293866352 + 1.22945740853541i, "acosh(Complex) - 1.49709293866352 + 1.22945740853541i");
165 164
 }
166 165
 
167  
-#?niecza skip "Str math NYI"
168 166
 {
169 167
     # Str tests
170 168
     is_approx(((1.14023832107909).Str).acosh, 0.523598775603156, "Str.acosh - 0.523598775603156");
2  S32-trig/cotan.t
@@ -109,7 +109,6 @@ for @sines -> $angle
109 109
     is_approx(cotan((0.785398163404734 + 2i).Complex), 0.0366189934736669 - 0.999329299738534i, "cotan(Complex) - 0.785398163404734 + 2i");
110 110
 }
111 111
 
112  
-#?niecza skip "Str math NYI"
113 112
 {
114 113
     # Str tests
115 114
     is_approx((1.57079632680947).Str.cotan, -1.45716159658652e-11, "Str.cotan - 1.57079632680947");
@@ -164,7 +163,6 @@ for @sines -> $angle
164 163
     is_approx(acotan((0.785398163404734 + 2i).Complex), 0.204860490024916 - 0.445759203696597i, "acotan(Complex) - 0.204860490024916 - 0.445759203696597i");
165 164
 }
166 165
 
167  
-#?niecza skip "Str math NYI"
168 166
 {
169 167
     # Str tests
170 168
     is_approx(((1.73205080754945).Str).acotan, 0.523598775603156, "Str.acotan - 0.523598775603156");
4  S32-trig/cotanh.t
@@ -87,7 +87,7 @@ for @sines -> $angle
87 87
     is_approx($zp2.cotanh, $sz2, "Complex.cotanh - $zp2");
88 88
 }
89 89
 
90  
-#?niecza skip "Inf results wrong"
  90
+#?niecza todo "Inf results wrong"
91 91
 {
92 92
     is(cotanh(Inf), 1, "cotanh(Inf) -");
93 93
     is(cotanh(-Inf), -1, "cotanh(-Inf) -");
@@ -109,7 +109,6 @@ for @sines -> $angle
109 109
     is_approx(cotanh((0.523598775603156 + 2i).Complex), 0.554305939075667 + 0.335770114695529i, "cotanh(Complex) - 0.523598775603156 + 2i");
110 110
 }
111 111
 
112  
-#?niecza skip "Str math NYI"
113 112
 {
114 113
     # Str tests
115 114
     is_approx((0.785398163404734).Str.cotanh, 1.52486861881241, "Str.cotanh - 0.785398163404734");
@@ -164,7 +163,6 @@ for @sines -> $angle
164 163
     is_approx(acotanh((0.785398163404734 + 2i).Complex), 0.143655432578432 - 0.417829353993379i, "acotanh(Complex) - 0.143655432578432 - 0.417829353993379i");
165 164
 }
166 165
 
167  
-#?niecza skip "Str math NYI"
168 166
 {
169 167
     # Str tests
170 168
     is_approx(((2.08128336391745).Str).acotanh, 0.523598775603156, "Str.acotanh - 0.523598775603156");
2  S32-trig/sec.t
@@ -109,7 +109,6 @@ for @cosines -> $angle
109 109
     is_approx(sec((-0.785398163404734 + 2i).Complex), 0.194833118735496 - 0.187824499975941i, "sec(Complex) - -0.785398163404734 + 2i");
110 110
 }
111 111
 
112  
-#?niecza skip "Str math NYI"
113 112
 {
114 113
     # Str tests
115 114
     is_approx((0).Str.sec, 1, "Str.sec - 0");
@@ -164,7 +163,6 @@ for @cosines -> $angle
164 163
     is_approx(asec((0.785398163404734 + 2i).Complex), 1.41436665336946 + 0.425586400480703i, "asec(Complex) - 1.41436665336946 + 0.425586400480703i");
165 164
 }
166 165
 
167  
-#?niecza skip "Str math NYI"
168 166
 {
169 167
     # Str tests
170 168
     is_approx(((1.4142135623834).Str).asec, 0.785398163404734, "Str.asec - 0.785398163404734");
4  S32-trig/sech.t
@@ -87,7 +87,7 @@ for @cosines -> $angle
87 87
     is_approx($zp2.sech, $sz2, "Complex.sech - $zp2");
88 88
 }
89 89
 
90  
-#?niecza skip "Inf results wrong"
  90
+#?niecza todo "Inf results wrong"
91 91
 {
92 92
     is(sech(Inf), 0, "sech(Inf) -");
93 93
     is(sech(-Inf), 0, "sech(-Inf) -");
@@ -109,7 +109,6 @@ for @cosines -> $angle
109 109
     is_approx(sech((-1.57079632680947 + 2i).Complex), -0.190922860876022 + 0.382612165180854i, "sech(Complex) - -1.57079632680947 + 2i");
110 110
 }
111 111
 
112  
-#?niecza skip "Str math NYI"
113 112
 {
114 113
     # Str tests
115 114
     is_approx((-1.04719755120631).Str.sech, 0.624887966291348, "Str.sech - -1.04719755120631");
@@ -164,7 +163,6 @@ for @cosines -> $angle
164 163
     is_approx(asech((0.785398163404734 + 2i).Complex), 0.425586400480703 - 1.41436665336946i, "asech(Complex) - 0.425586400480703 - 1.41436665336946i");
165 164
 }
166 165
 
167  
-#?niecza skip "Str math NYI"
168 166
 {
169 167
     # Str tests
170 168
     is_approx(((0.754939708710524).Str).asech, 0.785398163404734, "Str.asech - 0.785398163404734");
2  S32-trig/sin.t
@@ -109,7 +109,6 @@ for @sines -> $angle
109 109
     is_approx(sin((0 + 2i).Complex), 0 + 3.62686040784702i, "sin(Complex) - 0 + 2i");
110 110
 }
111 111
 
112  
-#?niecza skip "Str math NYI"
113 112
 {
114 113
     # Str tests
115 114
     is_approx((0.523598775603156).Str.sin, 0.5, "Str.sin - 0.523598775603156");
@@ -164,7 +163,6 @@ for @sines -> $angle
164 163
     is_approx(asin((0.785398163404734 + 2i).Complex), 0.341338918259482 + 1.49709293866352i, "asin(Complex) - 0.341338918259482 + 1.49709293866352i");
165 164
 }
166 165
 
167  
-#?niecza skip "Str math NYI"
168 166
 {
169 167
     # Str tests
170 168
     is_approx(((0.5).Str).asin, 0.523598775603156, "Str.asin - 0.523598775603156");
4  S32-trig/sinh.t
@@ -87,7 +87,7 @@ for @sinhes -> $angle
87 87
     is_approx($zp2.sinh, $sz2, "Complex.sinh - $zp2");
88 88
 }
89 89
 
90  
-#?niecza skip "Inf results wrong"
  90
+#?niecza todo "Inf results wrong"
91 91
 {
92 92
     is(sinh(Inf), Inf, "sinh(Inf) -");
93 93
     is(sinh(-Inf), -Inf, "sinh(-Inf) -");
@@ -109,7 +109,6 @@ for @sinhes -> $angle
109 109
     is_approx(sinh((0 + 2i).Complex), -0 + 0.909297426825682i, "sinh(Complex) - 0 + 2i");
110 110
 }
111 111
 
112  
-#?niecza skip "Str math NYI"
113 112
 {
114 113
     # Str tests
115 114
     is_approx((0.523598775603156).Str.sinh, 0.547853473893578, "Str.sinh - 0.523598775603156");
@@ -164,7 +163,6 @@ for @sinhes -> $angle
164 163
     is_approx(asinh((0.785398163404734 + 2i).Complex), 1.41841325789332 + 1.15495109689711i, "asinh(Complex) - 1.41841325789332 + 1.15495109689711i");
165 164
 }
166 165
 
167  
-#?niecza skip "Str math NYI"
168 166
 {
169 167
     # Str tests
170 168
     is_approx(((0.547853473893578).Str).asinh, 0.523598775603156, "Str.asinh - 0.523598775603156");
2  S32-trig/tan.t
@@ -109,7 +109,6 @@ for @sines -> $angle
109 109
     is_approx(tan((0 + 2i).Complex), 0 + 0.964027580075817i, "tan(Complex) - 0 + 2i");
110 110
 }
111 111
 
112  
-#?niecza skip "Str math NYI"
113 112
 {
114 113
     # Str tests
115 114
     is_approx((0.523598775603156).Str.tan, 0.577350269196102, "Str.tan - 0.523598775603156");
@@ -164,7 +163,6 @@ for @sines -> $angle
164 163
     is_approx(atan((0.785398163404734 + 2i).Complex), 1.36593583676998 + 0.445759203696597i, "atan(Complex) - 1.36593583676998 + 0.445759203696597i");
165 164
 }
166 165
 
167  
-#?niecza skip "Str math NYI"
168 166
 {
169 167
     # Str tests
170 168
     is_approx(((0.577350269196102).Str).atan, 0.523598775603156, "Str.atan - 0.523598775603156");
4  S32-trig/tanh.t
@@ -87,7 +87,7 @@ for @sines -> $angle
87 87
     is_approx($zp2.tanh, $sz2, "Complex.tanh - $zp2");
88 88
 }
89 89
 
90  
-#?niecza skip "Inf results wrong"
  90
+#?niecza todo "Inf results wrong"
91 91
 {
92 92
     is(tanh(Inf), 1, "tanh(Inf) -");
93 93
     is(tanh(-Inf), -1, "tanh(-Inf) -");
@@ -109,7 +109,6 @@ for @sines -> $angle
109 109
     is_approx(tanh((0 + 2i).Complex), -0 - 2.18503986326152i, "tanh(Complex) - 0 + 2i");
110 110
 }
111 111
 
112  
-#?niecza skip "Str math NYI"
113 112
 {
114 113
     # Str tests
115 114
     is_approx((0.523598775603156).Str.tanh, 0.480472778160188, "Str.tanh - 0.523598775603156");
@@ -164,7 +163,6 @@ for @sines -> $angle
164 163
     is_approx(atanh((0.785398163404734 + 2i).Complex), 0.143655432578432 + 1.15296697280152i, "atanh(Complex) - 0.143655432578432 + 1.15296697280152i");
165 164
 }
166 165
 
167  
-#?niecza skip "Str math NYI"
168 166
 {
169 167
     # Str tests
170 168
     is_approx(((0.480472778160188).Str).atanh, 0.523598775603156, "Str.atanh - 0.523598775603156");
1  integration/advent2009-day14.t
@@ -9,7 +9,6 @@ is (3/7).WHAT.gist, "Rat()";
9 9
 is_approx (3/7), 0.4285714;
10 10
 
11 11
 is_approx (3/7).Num + (2/7).Num + (2/7).Num - 1, -1.1102230e-16;
12  
-#?niecza todo
13 12
 is 3/7 + 2/7 + 2/7 - 1,  0;
14 13
 
15 14
 is (3/7).perl, "3/7";
1  integration/advent2010-day04.t
@@ -18,7 +18,6 @@ plan 11;
18 18
     is @Fibonacci[^10].join(" "), "0 1 1 2 3 5 8 13 21 34", "First ten Fibonacci numbers are correct";
19 19
 }
20 20
 
21  
-#?niecza todo
22 21
 {
23 22
     is (1, 1.1 ... 2).join(" "), "1 1.1 1.2 1.3 1.4 1.5 1.6 1.7 1.8 1.9 2", "1, 1.1 ... 2 is correct";
24 23
     is (1, 1.1 ... 2.01)[^14].join(" "), "1 1.1 1.2 1.3 1.4 1.5 1.6 1.7 1.8 1.9 2 2.1 2.2 2.3", 

0 notes on commit 5f0bdab

Please sign in to comment.
Something went wrong with that request. Please try again.