Skip to content

Commit

Permalink
Browse files Browse the repository at this point in the history
rakudo unfudges
  • Loading branch information
moritz committed Aug 8, 2011
1 parent f735ef3 commit 754bc98
Show file tree
Hide file tree
Showing 23 changed files with 0 additions and 36 deletions.
2 changes: 0 additions & 2 deletions S02-builtin_data_types/declare.t
Expand Up @@ -230,13 +230,11 @@ plan 84;
isa_ok($pare,Blob );
}

#?rakudo skip 'Instant not implemented'
{
my Instant $paci;
isa_ok($paci,Instant );
}

#?rakudo skip 'Duration not implemented'
{
my Duration $pavo;
isa_ok($pavo,Duration );
Expand Down
1 change: 0 additions & 1 deletion S02-builtin_data_types/flattening.t
Expand Up @@ -59,7 +59,6 @@ plan 33;
nok(%hash<22>.defined, 'nothing at key "22"');
}

#?rakudo skip 'dubious use of backslash for creating "references"'
{
my @a;
push @a, 1;
Expand Down
2 changes: 0 additions & 2 deletions S02-builtin_data_types/nil.t
Expand Up @@ -51,7 +51,6 @@ ok (my $rt93980 = Nil) === Any, 'Nil assigned to scalar produces an Any'; #OK
#?rakudo skip 'RT 93980'
ok (my Str $str93980 = Nil) === Str; #OK

#?rakudo 2 skip 'triage'
is Nil.gist, 'Nil', 'Nil.gist eq "Nil"';
ok !Nil.new.defined, 'Nil.new is not defined';

Expand All @@ -64,7 +63,6 @@ ok !Nil.new.defined, 'Nil.new is not defined';
ok $x === Int, 'assigns to base-type object';
}

#?rakudo skip 'triage'
{
my $z := Nil;
ok $z ~~ Nil, 'can bind to Nil';
Expand Down
6 changes: 0 additions & 6 deletions S03-junctions/misc.t
Expand Up @@ -195,7 +195,6 @@ sub j (Mu $j) { return $j.perl }
is($note, "Low roll", '| junction threading ==');
}

#?rakudo skip 'Junctions as subscripts'
{
# L<S03/Junctive operators/Junctions work through subscripting>
my $got;
Expand Down Expand Up @@ -329,7 +328,6 @@ ok(!(?(1&0) != ?(1&&0)), 'boolean context');
ok Mu & Mu ~~ Mu, 'Mu & Mu ~~ Mu works';

## See also S03-junctions/autothreading.t
#?rakudo skip 'substr on junctions'
{
is substr("abcd", 1, 2), "bc", "simple substr";
my Mu $res = substr(any("abcd", "efgh"), 1, 2);
Expand All @@ -338,31 +336,27 @@ ok Mu & Mu ~~ Mu, 'Mu & Mu ~~ Mu works';
ok $res eq "fg", "substr on junctions: fg";
}

#?rakudo skip 'substr on junctions'
{
my Mu $res = substr("abcd", 1|2, 2);
isa_ok $res, Junction;
ok $res eq "bc", "substr on junctions: bc";
ok $res eq "cd", "substr on junctions: cd";
}

#?rakudo skip 'substr on junctions'
{
my Mu $res = substr("abcd", 1, 1|2);
isa_ok $res, Junction;
ok $res eq "bc", "substr on junctions: bc";
ok $res eq "b", "substr on junctions: b";
}

#?rakudo skip 'index on junctions'
{
my Mu $res = index(any("abcd", "qwebdd"), "b");
isa_ok $res, Junction;
ok $res == 1, "index on junctions: 1";
ok $res == 3, "index on junctions: 3";
}

#?rakudo skip 'index on junctions'
{
my Mu $res = index("qwebdd", "b"|"w");
isa_ok $res, Junction;
Expand Down
1 change: 0 additions & 1 deletion S03-operators/also.t
Expand Up @@ -4,7 +4,6 @@ plan 8;
# L<S03/"Junctive and (all) precedence"/"infix:<&>">

ok ?(1 S& 2), "basic infix:<S&>";
#?rakudo skip "multiple S& NYI"
ok ?(1 S& 2 S& 3), "basic infix:<S&> (multiple S&'s)";
#?rakudo todo 'nom regression'
ok !(0 S& 1), "S& has and-semantics (first term 0)";
Expand Down
1 change: 0 additions & 1 deletion S03-operators/assign.t
Expand Up @@ -782,7 +782,6 @@ sub l () { 1, 2 };
ok %part1 eqv %both, ',= works for hashes (hash modified)';
}

#?rakudo skip 'subst'
{
my $s = 'abc';
$s .= subst('b','d');
Expand Down
1 change: 0 additions & 1 deletion S03-operators/bit.t
Expand Up @@ -39,7 +39,6 @@ plan 26;
is( $foo ~^ $bar, ';' x 75 ~ $zap, 'long string bitwise ~^, no truncation' );

# "interesting" tests from a long time back...
#?rakudo 2 skip 'bitwise string manipulation'
#?niecza 2 skip 'string bitops'
is( "ok \xFF\xFF\n" ~& "ok 19\n", "ok 19\n", 'stringwise ~&, arbitrary string' );
is( "ok 20\n" ~| "ok \0\0\n", "ok 20\n", 'stringwise ~|, arbitrary string' );
Expand Down
3 changes: 0 additions & 3 deletions S03-operators/boolean-bitwise.t
Expand Up @@ -58,15 +58,12 @@ plan 43;
ok( ?(False?^False == False), '?^ works with Bools');
ok( ?(False?^True == True), '?^ works with Bools');
ok( ?(True ?^False == True), '?^ works with Bools');
#?rakudo skip 'segmentation fault'
ok( ?(True ?^True == False), '?^ works with Bools');

ok( ?('' ?^'' == False), '?^ works');
ok( ?(Any ?^ 1 == True), '?^ works');
ok( ?(-1 ?^ Any == True), '?^ works');
#?rakudo skip 'segmentation fault'
ok( ?(42 ?^ 42 == False), '?^ works');
#?rakudo skip 'segmentation fault'
ok( ?(42 ?^ 41 == False), '?^ works');

ok( ?(infix:<?^>(True) == True), '?^ works with one argument');
Expand Down
1 change: 0 additions & 1 deletion S03-operators/misc.t
Expand Up @@ -88,7 +88,6 @@ ok(?((any(1..6) == one(1|2|3|4|5|6))), "any elements will match via junction");
}

# L<S03/Hyper operators/hyper operator distributes over them as lists>
#?rakudo skip "nom regression: 'Could not find sub &METAOP_HYPER'"
{
my @rv;
@rv = (1,2,3,4) >>+<< (1,2,3,4);
Expand Down
1 change: 0 additions & 1 deletion S03-operators/reduce-le1arg.t
Expand Up @@ -58,7 +58,6 @@ is ([!eqv] ()), Bool::True, "[!eqv] () eq True";
is ([&&] ()), Bool::True, "[&&] () eq True";
is ([||] ()), Bool::False, "[||] () eq False";
# RT #65164 implement [^^]
#?rakudo skip '[^^]'
is ([^^] ()), Bool::False, "[^^] () eq False";
is ([//] ()), Any, "[//] () is Any";
is ([,] ()), (), "[,] () eq ()";
Expand Down
4 changes: 0 additions & 4 deletions S03-operators/short-circuit.t
Expand Up @@ -165,7 +165,6 @@ sub accumtest($expect, $op) {
is((42 xor 0), 42, "xor operator working (one true)");
is((0 xor 42), 42, "xor operator working (one true)");
is((42 xor 0), 42, "xor operator working (one true)");
#?rakudo skip 'segmentation fault'
ok(!(1 xor 42), "xor operator working (both true)");
ok(!(0 xor 0), "xor operator working (both false)");
}
Expand Down Expand Up @@ -206,12 +205,9 @@ sub accumtest($expect, $op) {

is (@a ^^ @c), '1 2 3', 'Array ^^ true returns true array';
is (@c ^^ @a), '1 2 3', 'Array ^^ true returns true array';
#?rakudo skip 'segmentation fault'
ok (@a ^^ @b) == (), 'Array ^^ true returns empty list';
ok (@c ^^ @d) == (), 'Array ^^ true returns empty list';
#?rakudo skip 'segmentation fault'
is (@a ^^ ()), '1 2 3', 'True array ^^ empty list returns array';
#?rakudo skip 'segmentation fault'
is (() ^^ @a), '1 2 3', 'Empty list ^^ true array returns array';
ok (() ^^ @c) == (), 'Empty list ^^ empty array returns ()';
}
Expand Down
1 change: 0 additions & 1 deletion S04-declarations/my.t
Expand Up @@ -258,7 +258,6 @@ eval_lives_ok 'my $x = 3; class A { has $.y = $x; }; say A.new.y',
#RT #72814

{
#?rakudo skip 'RT 72814'
#?niecza skip 'a not predeclared'
lives_ok {my ::a $a}, 'typing a my-declared variable as ::a works.'; #OK not used
}
Expand Down
2 changes: 0 additions & 2 deletions S06-multi/positional-vs-named.t
Expand Up @@ -30,7 +30,6 @@ is( earth(her => 3, him => 2, me => 1), 'me 1 him 2 her 3', 'named her named him

is( earth('b', you => 4), 'pos b you 4', 'pos, named you');
is( earth('c', her => 3), 'pos c her 3', 'pos, named her');
#?rakudo skip 'No applicable candidates found '
is( earth('d', 'e'), 'pos d pos e', 'pos, pos');
is( earth('f', 'g', her => 3), 'pos f pos g her 3', 'pos, pos, named');

Expand Down Expand Up @@ -59,7 +58,6 @@ is( wind(her => 3, him => 2, me => 1), 'me 1 him 2 her 3', 'named her named him

is( wind('b', you => 4), 'pos b you 4', 'pos, named you');
is( wind('c', her => 3), 'pos c her 3', 'pos, named her');
#?rakudo skip 'No applicable candidates found '
is( wind('d', 'e'), 'pos d pos e', 'pos, pos');
is( wind('f', 'g', her => 3), 'pos f pos g her 3', 'pos, pos, named');

Expand Down
1 change: 0 additions & 1 deletion S06-multi/syntax.t
Expand Up @@ -81,7 +81,6 @@ ok(~&foo ~~ /foo/, 'a multi stringifies sensibly');
multi rt68234(:$key!) { 'with key' }; #OK not used
multi rt68234(*%_) { 'unknown' }; #OK not used
is rt68234(:key), 'with key', 'can find multi method with key';
#?rakudo skip 'RT #68234'
is rt68234(:unknown), 'unknown', 'can find multi method with slurpy';
}

Expand Down
1 change: 0 additions & 1 deletion S06-multi/value-based.t
Expand Up @@ -33,7 +33,6 @@ plan 8;
}

# RT #88562
#?rakudo skip 'RT 88562'
{
multi m3(0 , $ ) { 'a' };
multi m3(Int $n, Str $a = 'A') { 'b' };
Expand Down
1 change: 0 additions & 1 deletion S09-subscript_slice/slice.t
Expand Up @@ -47,7 +47,6 @@ plan 23;
my %slice = (0=>3, 1=>7, 2=>9);
is((3,7,9), [@array[%slice.keys].sort], "values from hash keys, part 1");
is((3,7,9), [@array[%slice.keys.sort]], "values from hash keys, part 2");
#?rakudo skip "nom regression: 'Could not find sub &METAOP_HYPER'"
is((3,7,9), [@array[(0,1,1)>>+<<(0,0,1)]], "calculated slice: hyperop");
}

Expand Down
1 change: 0 additions & 1 deletion S12-construction/construction.t
Expand Up @@ -89,7 +89,6 @@ is Foo.new("a string").a, 'a string', "our own 'new' was called";
}

# RT #76476
#?rakudo skip 'RT 76476, augment'
{
use MONKEY_TYPING;
class MonkeyNew { has $.x is rw };
Expand Down
1 change: 0 additions & 1 deletion S12-introspection/methods.t
Expand Up @@ -107,7 +107,6 @@ ok +@methods > 0, 'can get methods for Str (instance)';
ok +List.^methods() > +Any.^methods(), 'List has more methods than Any';
ok +Any.^methods() > +Mu.^methods(), 'Any has more methods than Mu';

#?rakudo skip 'nom regression'
ok +(D.^methods>>.name) > 0, 'can get names of methods in and out of our own classes';
ok D.^methods.perl, 'can get .perl of output of .^methods';

Expand Down
1 change: 0 additions & 1 deletion S16-filehandles/io.t
Expand Up @@ -89,7 +89,6 @@ is(@lines4[0], "Hello World", 'lines($in) worked in list context');
is(@lines4[1], "Foo Bar Baz", 'lines($in) worked in list context');
is(@lines4[2], "The End", 'lines($in) worked in list context');
is(@lines4[3], "... Its not over yet!", 'lines($in) worked in list context');
#?rakudo skip 'nom regression'
ok($in4.close, 'file closed okay (4)');

#?rakudo skip "prototype of sub lines(...) doesn't have limit yet"
Expand Down
1 change: 0 additions & 1 deletion S32-array/kv.t
Expand Up @@ -62,7 +62,6 @@ is( 42.kv, [0, 42], "(42).kv works");
}

# RT #71086
#?rakudo skip 'augment class...'
{
use MONKEY_TYPING;
augment class Parcel {
Expand Down
1 change: 0 additions & 1 deletion S32-list/pick.t
Expand Up @@ -82,7 +82,6 @@ is (<a b c d>.pick(*).sort).Str, 'a b c d', 'pick(*) returns all the items in th
}

# enums + pick
#?rakudo skip 'enums'
{
is Bool.pick(*).elems, 2, 'Bool.pick works';

Expand Down
1 change: 0 additions & 1 deletion integration/99problems-31-to-40.t
Expand Up @@ -128,7 +128,6 @@ plan 67;
is prime_factors(315), (3,3,5,7), 'prime factors of 315 are 3,3,5,7';
}

#?rakudo skip 'nom regression - cannot see prime_factors_mult'
#?DOES 5
{
# P36 (**) Determine the prime factors of a given positive integer (2).
Expand Down
1 change: 0 additions & 1 deletion integration/advent2009-day07.t
Expand Up @@ -61,7 +61,6 @@ for @array.kv -> $index, $item { $a ~= "$index $item " };
is $a, '0 a 1 b 2 c 3 d ', '.kv, multiple topics';


#?rakudo skip "can't string together Z's"
{
my @one = <11 12 13>;
my @two = <21 22 23>;
Expand Down

0 comments on commit 754bc98

Please sign in to comment.