X-Git-Url: http://git.vpit.fr/?a=blobdiff_plain;f=lib%2FTest%2FLeaner.pm;h=c533b4f6a44de7c6e2a2955dcc1f5f6b4a8c5ac4;hb=HEAD;hp=6f90cef1ae4663704ee01802d81ea66c00693396;hpb=653bd706f7c17c61e34d98e6fcaed75861b2f7d7;p=perl%2Fmodules%2FTest-Leaner.git diff --git a/lib/Test/Leaner.pm b/lib/Test/Leaner.pm index 6f90cef..c533b4f 100644 --- a/lib/Test/Leaner.pm +++ b/lib/Test/Leaner.pm @@ -10,11 +10,11 @@ Test::Leaner - A slimmer Test::More for when you favor performance over complete =head1 VERSION -Version 0.01 +Version 0.05 =cut -our $VERSION = '0.01'; +our $VERSION = '0.05'; =head1 SYNOPSIS @@ -37,16 +37,20 @@ 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 and L honor C<'eq'> overloading (and just that one) 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), L honors C<'ne'> overloading, and L honors whichever overloading category corresponds to the specified operator. =item * -L, L, L, L, L, L, L and L are all guaranteed to return the truth value of the test. +L, L, L, L, L, L, L, L and L are all guaranteed to return the truth value of the test. + +=item * + +C (the sub C in package C) is not aliased to L. =item * 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). +A string regexp argument is always treated as the source of the regexp, making C and C equivalent to each other and to C (and likewise for C). =item * @@ -61,24 +65,24 @@ If the two first arguments present parallel memory cycles, the test may result i =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. +Moreover, this allows a much faster variant of L. =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 Scalar::Util (); +use Exporter (); + +my $main_process; BEGIN { - if ($] >= 5.008 and $INC{'threads.pm'}) { + $main_process = $$; + + if ("$]" >= 5.008 and $INC{'threads.pm'}) { my $use_ithreads = do { require Config; no warnings 'once'; @@ -121,7 +125,7 @@ our @EXPORT = qw< =head2 C If this environment variable is set, L will replace its functions by those from L. -Moreover, the symbols that are imported you C will be those from L, but you can still only import the symbols originally defined in L (hence the functions from L that are not implemented in L will not be imported). +Moreover, the symbols that are imported when you C will be those from L, but you can still only import the symbols originally defined in L (hence the functions from L that are not implemented in L will not be imported). If your version of L is too old and doesn't have some symbols (like L or L), they will be replaced in L by croaking stubs. This may be useful if your L-based test script fails and you want extra diagnostics. @@ -161,14 +165,13 @@ if ($ENV{PERL_TEST_LEANER_USES_TEST_MORE}) { my $leaner_stash = \%Test::Leaner::; my $more_stash = \%Test::More::; - my %valid_imports; + my %stubbed; for (@EXPORT) { my $replacement = exists $more_stash->{$_} ? *{$more_stash->{$_}}{CODE} : undef; - if (defined $replacement) { - $valid_imports{$_} = 1; - } else { + unless (defined $replacement) { + $stubbed{$_}++; $replacement = sub { @_ = ("$_ is not implemented in this version of Test::More"); goto &croak; @@ -179,20 +182,33 @@ if ($ENV{PERL_TEST_LEANER_USES_TEST_MORE}) { } my $import = sub { - shift; + my $class = shift; + my @imports = &_handle_import_args; - @imports = @EXPORT unless @imports; + if (@imports == grep /^!/, @imports) { + # All imports are negated, or @imports is empty + my %negated; + /^!(.*)/ and ++$negated{$1} for @imports; + push @imports, grep !$negated{$_}, @EXPORT; + } + my @test_more_imports; for (@imports) { - if ($valid_imports{$_}) { - push @test_more_imports, $_; - } else { + if ($stubbed{$_}) { my $pkg = caller; no strict 'refs'; *{$pkg."::$_"} = $leaner_stash->{$_}; + } elsif (/^!/ or !exists $more_stash->{$_} or exists $leaner_stash->{$_}) { + push @test_more_imports, $_; + } else { + # Croak for symbols in Test::More but not in Test::Leaner + Exporter::import($class, $_); } } + my $test_more_import = 'Test::More'->can('import'); + return unless $test_more_import; + @_ = ( 'Test::More', @_, @@ -202,6 +218,7 @@ if ($ENV{PERL_TEST_LEANER_USES_TEST_MORE}) { lock $plan if THREADSAFE; push @_, 'no_diag' if $no_diag; } + goto $test_more_import; }; @@ -256,7 +273,11 @@ sub _sanitize_comment { The following functions from L are implemented and exported by default. -=head2 C<< plan [ tests => $count | 'no_plan' | skip_all => $reason ] >> +=head2 C + + plan tests => $count; + plan 'no_plan'; + plan skip_all => $reason; See L. @@ -319,7 +340,9 @@ sub import { goto &Exporter::import; } -=head2 C<< skip $reason => $count >> +=head2 C + + skip $reason => $count; See L. @@ -356,7 +379,10 @@ sub skip { last SKIP; } -=head2 C +=head2 C + + done_testing; + done_testing $count; See L. @@ -389,7 +415,10 @@ sub done_testing { return 1; } -=head2 C +=head2 C + + ok $ok; + ok $ok, $desc; See L. @@ -403,10 +432,10 @@ sub ok ($;$) { ++$test; my $test_str = "ok $test"; - unless ($ok) { + $ok or do { $test_str = "not $test_str"; ++$failed; - } + }; if (defined $desc) { _sanitize_comment($desc); $test_str .= " - $desc" if length $desc; @@ -418,7 +447,10 @@ sub ok ($;$) { return $ok; } -=head2 C +=head2 C + + pass; + pass $desc; See L. @@ -429,7 +461,10 @@ sub pass (;$) { goto &ok; } -=head2 C +=head2 C + + fail; + fail $desc; See L. @@ -440,7 +475,10 @@ sub fail (;$) { goto &ok; } -=head2 C +=head2 C + + is $got, $expected; + is $got, $expected, $desc; See L. @@ -456,7 +494,10 @@ sub is ($$;$) { goto &ok; } -=head2 C +=head2 C + + isnt $got, $expected; + isnt $got, $expected, $desc; See L. @@ -478,7 +519,7 @@ my %binops = ( 'and' => 'and', '||' => 'hor', - ('//' => 'dor') x ($] >= 5.010), + ('//' => 'dor') x ("$]" >= 5.010), '&&' => 'hand', '|' => 'bor', @@ -503,7 +544,7 @@ my %binops = ( '=~' => 'like', '!~' => 'unlike', - ('~~' => 'smartmatch') x ($] >= 5.010), + ('~~' => 'smartmatch') x ("$]" >= 5.010), '+' => 'add', '-' => 'substract', @@ -543,11 +584,17 @@ IS_BINOP } } -=head2 C +=head2 C + + like $got, $regexp_expected; + like $got, $regexp_expected, $desc; See L. -=head2 C +=head2 C + + unlike $got, $regexp_expected; + unlike $got, $regexp_expected, $desc; See L. @@ -559,7 +606,10 @@ See L. *unlike = _create_binop_handler('!~'); } -=head2 C +=head2 C + + cmp_ok $got, $op, $expected; + cmp_ok $got, $op, $expected, $desc; See L. @@ -576,12 +626,46 @@ sub cmp_ok ($$$;$) { goto $handler; } -=head2 C +=head2 C + + is_deeply $got, $expected; + is_deeply $got, $expected, $desc; See L. =cut +BEGIN { + local $@; + if (eval { require Scalar::Util; 1 }) { + *_reftype = \&Scalar::Util::reftype; + } else { + # Stolen from Scalar::Util::PP + require B; + my %tmap = qw< + B::NULL SCALAR + + B::HV HASH + B::AV ARRAY + B::CV CODE + B::IO IO + B::GV GLOB + B::REGEXP REGEXP + >; + *_reftype = sub ($) { + my $r = shift; + + return undef unless length ref $r; + + my $t = ref B::svref_2object($r); + + return exists $tmap{$t} ? $tmap{$t} + : length ref $$r ? 'REF' + : 'SCALAR' + } + } +} + sub _deep_ref_check { my ($x, $y, $ry) = @_; @@ -600,8 +684,8 @@ sub _deep_ref_check { 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; + $ry = _reftype($ey); + return 0 if _reftype($ex) ne $ry; return 0 unless $ry and _deep_ref_check($ex, $ey, $ry); } @@ -621,8 +705,8 @@ sub _deep_ref_check { 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; + $ry = _reftype($ey); + return 0 if _reftype($ex) ne $ry; return 0 unless $ry and _deep_ref_check($ex, $ey, $ry); } @@ -650,8 +734,8 @@ sub _deep_check { # 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; + my $ry = _reftype($y); + return 0 if _reftype($x) ne $ry; # Shortcut if $x and $y are both not references and failed the previous # $x eq $y test. @@ -687,7 +771,9 @@ sub _diag_fh { return 0; }; -=head2 C +=head2 C + + diag @lines; See L. @@ -698,7 +784,9 @@ sub diag { goto &_diag_fh; } -=head2 C +=head2 C + + note @lines; See L. @@ -709,7 +797,10 @@ sub note { goto &_diag_fh; } -=head2 C +=head2 C + + BAIL_OUT; + BAIL_OUT $desc; See L. @@ -733,7 +824,7 @@ sub BAIL_OUT { } END { - unless ($?) { + if ($main_process == $$ and not $?) { lock $plan if THREADSAFE; if (defined $plan) { @@ -754,7 +845,10 @@ END { L also provides some functions of its own, which are never exported. -=head2 C +=head2 C + + my $tap_fh = tap_stream; + tap_stream $fh; Read/write accessor for the filehandle to which the tests are outputted. On write, it also turns autoflush on onto C<$fh>. @@ -779,7 +873,10 @@ sub tap_stream (;*) { tap_stream *STDOUT; -=head2 C +=head2 C + + my $diag_fh = diag_stream; + diag_stream $fh; Read/write accessor for the filehandle to which the diagnostics are printed. On write, it also turns autoflush on onto C<$fh>. @@ -813,11 +910,11 @@ In that case, it also needs a working L. L 5.6. -L, L, L. +L, L. =head1 AUTHOR -Vincent Pit, C<< >>, L. +Vincent Pit C<< >>. You can contact me by mail or on C (vincent). @@ -834,7 +931,13 @@ You can find documentation for this module with the perldoc command. =head1 COPYRIGHT & LICENSE -Copyright 2010 Vincent Pit, all rights reserved. +Copyright 2010,2011,2013,2021 Vincent Pit, all rights reserved. + +This program is free software; you can redistribute it and/or modify it under the same terms as Perl itself. + +Except for the fallback implementation of the internal C<_reftype> function, which has been taken from L and is + +Copyright 1997-2007 Graham Barr, all rights reserved. This program is free software; you can redistribute it and/or modify it under the same terms as Perl itself.