X-Git-Url: http://git.vpit.fr/?a=blobdiff_plain;f=lib%2FTest%2FLeaner.pm;h=8d25ca941f036109d7c39b704badb9cc163f264e;hb=9c79bce8bb6da45e4a032fe8354d5bfc73a648bb;hp=7fe001a248b394eec4daa55d02b9fdbe95432190;hpb=718844cc10b90e9ae4acc24a82539ea99c8a4cbb;p=perl%2Fmodules%2FTest-Leaner.git diff --git a/lib/Test/Leaner.pm b/lib/Test/Leaner.pm index 7fe001a..8d25ca9 100644 --- a/lib/Test/Leaner.pm +++ b/lib/Test/Leaner.pm @@ -37,7 +37,7 @@ Its functions behave the same as their L counterparts, except for th =item * Stringification isn't forced on the test operands. -However, L honors C<'bool'> overloading, L honors C<'eq'> overloading and L honors whichever overloading category corresponds to the specified operator. +However, L honors C<'bool'> overloading, L and L honor C<'eq'> overloading (and just that one) and L honors whichever overloading category corresponds to the specified operator. =item * @@ -45,18 +45,37 @@ L, L, L, L, L, L, L and L and L don't special case regular expressions that are passed as C<'/.../'> strings. +A string regexp argument is always treated as a the source of the regexp, making C and C equivalent to each other and to C (and likewise for C). + +=item * + L throws an exception if the given operator isn't a valid Perl binary operator (except C<'='> and variants). It also tests in scalar context, so C<'..'> will be treated as the flip-flop operator and not the range operator. =item * +L doesn't guard for memory cycles. +If the two first arguments present parallel memory cycles, the test may result in an infinite loop. + +=item * + +The tests don't output any kind of default diagnostic in case of failure ; the rationale being that if you have a large number of tests and a lot of them are failing, then you don't want to be flooded by diagnostics. + +=item * + C, C, C, C, C, C, C, C blocks and C are not implemented. +=item * + +L depends on L, while L does not. + =back =cut -use Exporter (); +use Exporter (); +use Scalar::Util (); BEGIN { if ($] >= 5.008 and $INC{'threads.pm'}) { @@ -118,6 +137,8 @@ The following functions from L are implemented and exported by defau =head2 C<< plan [ tests => $count | 'no_plan' | skip_all => $reason ] >> +See L. + =cut sub plan { @@ -172,9 +193,10 @@ our @EXPORT = qw< ok is isnt - cmp_ok like unlike + cmp_ok + is_deeply diag note BAIL_OUT @@ -216,6 +238,8 @@ sub import { =head2 C<< skip $reason => $count >> +See L. + =cut sub skip { @@ -251,6 +275,8 @@ sub skip { =head2 C +See L. + =cut sub done_testing { @@ -282,6 +308,8 @@ sub done_testing { =head2 C +See L. + =cut sub ok ($;$) { @@ -309,6 +337,8 @@ sub ok ($;$) { =head2 C +See L. + =cut sub pass (;$) { @@ -318,6 +348,8 @@ sub pass (;$) { =head2 C +See L. + =cut sub fail (;$) { @@ -327,6 +359,8 @@ sub fail (;$) { =head2 C +See L. + =cut sub is ($$;$) { @@ -341,6 +375,8 @@ sub is ($$;$) { =head2 C +See L. + =cut sub isnt ($$;$) { @@ -426,8 +462,12 @@ IS_BINOP =head2 C +See L. + =head2 C +See L. + =cut { @@ -438,6 +478,8 @@ IS_BINOP =head2 C +See L. + =cut sub cmp_ok ($$$;$) { @@ -451,6 +493,99 @@ sub cmp_ok ($$$;$) { goto $handler; } +=head2 C + +See L. + +=cut + +sub _deep_ref_check { + my ($x, $y, $ry) = @_; + + no warnings qw; + + if ($ry eq 'ARRAY') { + return 0 unless $#$x == $#$y; + + my ($ex, $ey); + for (0 .. $#$y) { + $ex = $x->[$_]; + $ey = $y->[$_]; + + # Inline the beginning of _deep_check + return 0 if defined $ex xor defined $ey; + + next if not(ref $ex xor ref $ey) and $ex eq $ey; + + $ry = Scalar::Util::reftype($ey); + return 0 if Scalar::Util::reftype($ex) ne $ry; + + return 0 unless $ry and _deep_ref_check($ex, $ey, $ry); + } + + return 1; + } elsif ($ry eq 'HASH') { + return 0 unless keys(%$x) == keys(%$y); + + my ($ex, $ey); + for (keys %$y) { + return 0 unless exists $x->{$_}; + $ex = $x->{$_}; + $ey = $y->{$_}; + + # Inline the beginning of _deep_check + return 0 if defined $ex xor defined $ey; + + next if not(ref $ex xor ref $ey) and $ex eq $ey; + + $ry = Scalar::Util::reftype($ey); + return 0 if Scalar::Util::reftype($ex) ne $ry; + + return 0 unless $ry and _deep_ref_check($ex, $ey, $ry); + } + + return 1; + } elsif ($ry eq 'SCALAR' or $ry eq 'REF') { + return _deep_check($$x, $$y); + } + + return 0; +} + +sub _deep_check { + my ($x, $y) = @_; + + no warnings qw; + + return 0 if defined $x xor defined $y; + + # Try object identity/eq overloading first. It also covers the case where + # $x and $y are both undefined. + # If either $x or $y is overloaded but none has eq overloading, the test will + # break at that point. + return 1 if not(ref $x xor ref $y) and $x eq $y; + + # Test::More::is_deeply happily breaks encapsulation if the objects aren't + # overloaded. + my $ry = Scalar::Util::reftype($y); + return 0 if Scalar::Util::reftype($x) ne $ry; + + # Shortcut if $x and $y are both not references and failed the previous + # $x eq $y test. + return 0 unless $ry; + + # We know that $x and $y are both references of type $ry, without overloading. + _deep_ref_check($x, $y, $ry); +} + +sub is_deeply { + @_ = ( + &_deep_check, + $_[2], + ); + goto &ok; +} + sub _diag_fh { my $fh = shift; @@ -471,6 +606,8 @@ sub _diag_fh { =head2 C +See L. + =cut sub diag { @@ -480,6 +617,8 @@ sub diag { =head2 C +See L. + =cut sub note { @@ -489,6 +628,8 @@ sub note { =head2 C +See L. + =cut sub BAIL_OUT { @@ -588,7 +729,7 @@ In that case, it also needs a working L. L 5.6. -L, L +L, L, L. =head1 AUTHOR