reflect current rakudo/nom state

Author: coke

S03-metaops/zip.t

@@ -28,6 +28,8 @@ is (1 Z* 3), (3), 'zip-product works with scalar both sides';
 
 # L<S03/"Hyper operators"/is assumed to be infinitely extensible>
 
+#?rakudo todo 'nom regression'
+{
 is (<a b c d> Z 'x', 'z', *), <a x b z c z d z>, 'non-meta zip extends right argument ending with *';
 is (1, 2, 3, * Z 10, 20, 30, 40, 50),
     (1, 10, 2, 20, 3, 30, 3, 40, 3, 50), 'non-meta zip extends left argument ending with *';
@@ -36,9 +38,14 @@ is (2, 10, * Z 3, 4, 5, *).munch(10),
     'non-meta zip extends two arguments ending with *';
 
 is (<a b c d> Z~ 'x', 'z', *), <ax bz cz dz>, 'zip-concat extends right argument ending with *';
+}
+
+#?rakudo 2 skip 'nom regression'
+{
 is (1, 2, 3, * Z+ 10, 20, 30, 40, 50), (11, 22, 33, 43, 53), 'zip-plus extends left argument ending with *';
 is (2, 10, * Z* 3, 4, 5, *).munch(5),
     (6, 40, 50, 50, 50), 'zip-product extends two arguments ending with *';
+}
 
 done;
 

S03-operators/binding-ro.t

@@ -10,7 +10,9 @@ plan 9;
     my $y = 3;
     $x ::= $y;
     is $x, 3, '::= on scalars took the value from the RHS';
+    #?rakudo todo 'nom regression'
     dies_ok { $x = 5 }; '... and made the LHS RO';
+    #?rakudo todo 'nom regression'
     is $x, 3, 'variable is still 3';
 }
 

S03-operators/binding-scalars.t

@@ -21,7 +21,6 @@ plan 29;
   my $y := $x;
   is($y, 'Just Another', 'y is now bound to x');
 
-  #?rakudo todo 'binding, =:='
   ok($y =:= $x, 'y is bound to x (we checked with the =:= identity op)');
 
   my $z = $x;
@@ -99,11 +98,13 @@ plan 29;
   is $a, 42, "bound readonly sub param was bound correctly (1)";
   $val++;
   #?niecza skip "difference of interpretation on ro binding"
+  #?rakudo todo 'nom regression'
   is $a, 43, "bound readonly sub param was bound correctly (2)";
 
   dies_ok { $a = 23 },
     "bound readonly sub param remains readonly (1)";
   #?niecza skip "difference of interpretation on ro binding"
+  #?rakudo todo 'nom regression'
   is $a, 43,
     "bound readonly sub param remains readonly (2)";
   is $val, 43,

S03-operators/eqv.t

@@ -45,7 +45,6 @@ plan 53;
   ok \@a eqv \@b, '\@array of two bound arrays are eqv';
 }
 
-#?rakudo skip 'backslashes'
 {
   my $a = \3;
   my $b = \3;
@@ -57,7 +56,7 @@ plan 53;
   ok (\$a !eqv \$b), "eqv on scalar references (1-4)";
 }
 
-#?
+#?rakudo skip 'nom regression'
 {
   my $a = { 3 };
   my $b = { 3 };
@@ -69,6 +68,7 @@ plan 53;
   ok !($a eqv { 5 }), 'eqv on sub references (1-4)';
 }
 
+#?rakudo skip 'nom regression'
 {
   ok  (&say eqv &say), "eqv on sub references (2-1)";
   ok  (&map eqv &map), "eqv on sub references (2-2)";
@@ -93,6 +93,7 @@ plan 53;
 {
   ok !({a => 1} eqv {a => 2}), "eqv on anonymous hash references (-)";
   ok  ({a => 1} eqv {a => 1}), "eqv on anonymous hash references (+)";
+  #?rakudo todo 'nom regression'
   ok ({a => 2, b => 1} eqv { b => 1, a => 2}), 'order really does not matter'; 
   ok !({a => 1} eqv {a => 1, b => 2}), 'hashes: different number of pairs';
 }
@@ -131,6 +132,7 @@ plan 53;
     is(0 eqv 1, Bool::False, 'eqv returns Bool::False when false');
 }
 
+#?rakudo skip 'nom regression'
 {
     is Mu eqv Mu, Bool::True, 'Mu eqv Mu';
     is Any eqv Any, Bool::True, 'Any eqv Any';

S03-operators/increment.t

@@ -13,10 +13,10 @@ Verify that autoincrement/autodecrement work properly.
 
 =end description
 
-#?rakudo skip 'unimpl Mu++'
 my $a = Mu;
 is($a++, 0, 'Mu++ == 0');
 
+#?rakudo todo 'nom regression'
 $a = Mu;
 nok(defined($a--), 'Mu-- is undefined');
 

S03-operators/numeric-context.t

@@ -21,26 +21,35 @@ isa_ok(+'1.9e3', Num, "+'1.9e3' is a Num");
 is(+'Inf', Inf, "+'Inf' is Inf");
 is(+'Info', 0, "+'Info' is 0");
 is(+'-Inf', -Inf, "+'-Inf' is -Inf");
+#?rakudo todo 'nom regression'
 is(+'-Info', 0, "+'-Info' is 0");
 is(+'NaN', NaN, "+'NaN' is NaN");
 is(+'NaNa', 0, "+'NaNa' is 0");
 
 {
     # XXX Not sure whether the following tests are correct
+    #?rakudo todo 'nom regression'
     is(+'Inf ',      Inf, "numification of strings with whitspace (1)");
     is(+'Inf o',       0, "numification of strings with whitspace (2)");
+    #?rakudo todo 'nom regression'
     is(+'NaN ',      NaN, "numification of strings with whitspace (3)");
     is(+'NaN a',       0, "numification of strings with whitspace (4)");
+    #?rakudo todo 'nom regression'
     is(+"Inf\t",     Inf, "numification of strings with whitspace (5)");
     is(+"Inf\to",      0, "numification of strings with whitspace (6)");
+    #?rakudo todo 'nom regression'
     is(+"NaN\t",     NaN, "numification of strings with whitspace (7)");
     is(+"NaN\ta",      0, "numification of strings with whitspace (8)");
+    #?rakudo todo 'nom regression'
     is(+"Inf\n",     Inf, "numification of strings with whitspace (9)");
     is(+"Inf\no",      0, "numification of strings with whitspace (10)");
+    #?rakudo todo 'nom regression'
     is(+"NaN\n",     NaN, "numification of strings with whitspace (11)");
     is(+"NaN\na",      0, "numification of strings with whitspace (12)");
+    #?rakudo todo 'nom regression'
     is(+"Inf\n\t ",  Inf, "numification of strings with whitspace (13)");
     is(+"Inf\n\t o",   0, "numification of strings with whitspace (14)");
+    #?rakudo todo 'nom regression'
     is(+"NaN\n\t ",  NaN, "numification of strings with whitspace (15)");
     is(+"NaN\n\t a",   0, "numification of strings with whitspace (16)");
     is(+"3 ",          3, "numification of strings with whitspace (17)");

S03-operators/precedence.t

@@ -67,8 +67,10 @@ ok(?((2 ~ 2 | 4 ~ 1) == 41), "and ~ binds tighter than |");
 
 # junctive and
 
+#?rakudo skip 'nom regression'
 ok(  ?(   (1 & 2 | 3) ==3), '& binds tighter than |');
 ok((!(1 & 2 | 3) < 2), "ditto");
+#?rakudo skip 'nom regression'
 ok(?((1 & 2 ^ 3) < 3), "and also ^");
 ok(?(!(1 & 2 ^ 4) != 3), "blah blah blah");
 
@@ -80,11 +82,13 @@ ok(?(!(1 & 2 ^ 4) != 3), "blah blah blah");
     eval_dies_ok 'my Mu $a = (1 ^ 2 | 3)', '^ and | may not associate';
 };
 
+#?rakudo skip 'nom regression'
 {
     my Mu $a = (abs -1 ^ -1); # read as abs(-1 ^ -1) -> (1^1)
     ok(!($a == 1), 'junctive or binds more tightly then abs (1)');
 }
 
+#?rakudo skip 'nom regression'
 {
     my Mu $b = ((abs -1) ^ -1); # -> (1 ^ -1)
     ok($b == 1, "this is true because only one is == 1");
@@ -212,6 +216,7 @@ ok ((1 => 2 => 3).value ~~ Pair), '=> is right-assoc (2)';
 eval_dies_ok '1, 2 Z 3, 4 X 5, 6',
     'list associativity only works between identical operators';
 
+#?rakudo skip 'nom regression'
 {
     # Check a 3 != 3 vs 3 !=3 parsing issue that can cropped up in Rakudo.
     # Needs careful following of STD to get it right. :-)

S03-smartmatch/any-hash-pair.t

@@ -9,6 +9,7 @@ plan 7;
     ok !(%a ~~ b => 'ugh'),         '%hash ~~ Pair (Str, -)';
     ok  (%a ~~ a => 1.0),           '%hash ~~ Pair (Num, +)';
     ok  (%a ~~ :b<foo>),            '%hash ~~ Colonpair';
+    #?rakudo 2 todo 'nom regression'
     ok  (%a ~~ c => !*.defined),    '%hash ~~ Pair (!*.defined, Mu)';
     ok  (%a ~~ d => !*.defined),    '%hash ~~ Pair (!*.defined, Nil)';
     ok !(%a ~~ a => 'foo'),         '%hash ~~ Pair (key and val not paired)';

S03-smartmatch/disorganized.t

@@ -11,7 +11,6 @@ This tests the smartmatch operator, defined in L<S03/"Smart matching">
 sub eval_elsewhere($code){ eval($code) }
 
 #L<S03/Smart matching/Any undef undefined not .defined>
-#?rakudo skip 'syntactic smar-matching'
 { 
     ok("foo" ~~ .defined, "foo is ~~ .defined");
     nok "foo" !~~ .defined,   'not foo !~~ .defined';
@@ -65,31 +64,34 @@ caught that case.
         $result = all(@x) ~~ { $_ < 21 };
         $parsed = 1;
     };
+    #?rakudo 2 todo 'nom regression'
     ok $parsed, 'C<all(@x) ~~ { ... }> parses';
     ok ?$result, 'C<all(@x) ~~ { ... } when true for all';
 
     $result = 0;
     try {
         $result = !(all(@x) ~~ { $_ < 20 });
     };
+    #?rakudo todo 'nom regression'
     ok $result,
         'C<all(@x) ~~ {...} when true for one';
 
     $result = 0;
     try {
         $result = !(all(@x) ~~ { $_ < 12 });
     };
-    ok $result,
-        'C<all(@x) ~~ {...} when true for most';
+    #?rakudo todo 'nom regression'
+    ok $result, 'C<all(@x) ~~ {...} when true for most';
 
     $result = 0;
     try {
         $result = !(all(@x) ~~ { $_ < 1  });
     };
-    ok $result,
-        'C<all(@x) ~~ {...} when true for one';
+    #?rakudo todo 'nom regression'
+    ok $result, 'C<all(@x) ~~ {...} when true for one';
 };
 
+#?rakudo todo 'nom regression'
 ok NaN ~~ NaN, 'NaN ~~ NaN is True';
 
 # need to test in eval() since class definitions happen at compile time,
@@ -145,6 +147,7 @@ eval_lives_ok 'class A { method foo { return "" ~~ * } }; A.new.foo',
 }
 
 ok "foo" ~~ *, 'thing ~~ * is true';
+#?rakudo todo 'nom regression'
 ok ("foo" ~~ *) ~~ Bool, 'thing ~~ * is a boolean';
 
 done();

S04-declarations/multiple.t

@@ -10,6 +10,7 @@ eval_lives_ok 'my $x; my $x',
               'it is legal to declare my $x twice in the same scope.';
 
 #?niecza skip 'Not working'
+#?rakudo todo 'nom regression'
 eval_lives_ok 'state $x; state $x', 
               'it is legal to declare state $x twice in the same scope.';
 
@@ -29,6 +30,7 @@ eval_dies_ok 'only sub foo {1; }; sub foo($x) {1; };',
              'multiple declarations need multi or proto';
 
 #?niecza skip "MMD"
+#?rakudo todo 'nom regression'
 eval_lives_ok 'proto foo {1; }; sub foo {1; }; sub foo($x) {1; };',
              'multiple declarations need multi or proto';