X-Git-Url: http://git.vpit.fr/?a=blobdiff_plain;f=lib%2FTest%2FLeaner.pm;h=14cb2421dcfa619328be55b25334f34112c707d5;hb=0a0b6b3837e088a72ac0aabac8644e3360269c13;hp=d88ecf6779afe7397af9342eff79ebd8aa0d0562;hpb=627cfc1e101ffcd0a1e0039e7eb333d5efd15d8a;p=perl%2Fmodules%2FTest-Leaner.git diff --git a/lib/Test/Leaner.pm b/lib/Test/Leaner.pm index d88ecf6..14cb242 100644 --- a/lib/Test/Leaner.pm +++ b/lib/Test/Leaner.pm @@ -4,9 +4,78 @@ use 5.006; use strict; use warnings; +=head1 NAME + +Test::Leaner - A slimmer Test::More for when you favor performance over completeness. + +=head1 VERSION + +Version 0.01 + +=cut + our $VERSION = '0.01'; -use Exporter (); +=head1 SYNOPSIS + + use Test::Leaner tests => 10_000; + for (1 .. 10_000) { + ... + is $one, 1, "checking situation $_"; + } + + +=head1 DESCRIPTION + +When profiling some L-based test script that contained about 10 000 unit tests, I realized that 60% of the time was spent in L itself, even though every single test actually involved a costly C. + +This module aims to be a partial replacement to L in those situations where you want to run a large number of simple tests. +Its functions behave the same as their L counterparts, except for the following differences : + +=over 4 + +=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. + +=item * + +L, L, L, L, L, L, L and L are all guaranteed to return the truth value of the test. + +=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). + +=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 Scalar::Util (); BEGIN { if ($] >= 5.008 and $INC{'threads.pm'}) { @@ -25,8 +94,7 @@ BEGIN { } } -my $TAP_STREAM = *STDOUT; -my $DIAG_STREAM = *STDERR; +my ($TAP_STREAM, $DIAG_STREAM); my ($plan, $test, $failed, $no_diag, $done_testing); @@ -35,7 +103,7 @@ sub SKIP_ALL () { -2 } BEGIN { if (THREADSAFE) { - threads::shared::share($_) for $plan, $test, $failed, $no_diag; + threads::shared::share($_) for $plan, $test, $failed, $no_diag, $done_testing; } lock $plan if THREADSAFE; @@ -57,12 +125,20 @@ sub croak { die @_, " at $file line $line.\n"; } -sub sanitize_comment { +sub _sanitize_comment { $_[0] =~ s/\n+\z//; $_[0] =~ s/#/\\#/g; $_[0] =~ s/\n/\n# /g; } +=head1 FUNCTIONS + +The following functions from L are implemented and exported by default. + +=head2 C<< plan [ tests => $count | 'no_plan' | skip_all => $reason ] >> + +=cut + sub plan { my ($key, $value) = @_; @@ -88,7 +164,7 @@ sub plan { $plan = SKIP_ALL; $plan_str = '1..0 # SKIP'; if (defined $value) { - sanitize_comment($value); + _sanitize_comment($value); $plan_str .= " $value" if length $value; } } else { @@ -96,12 +172,6 @@ sub plan { croak("plan() doesn't understand @args"); } - { - my $fh = select $TAP_STREAM; - $|++; - select $fh; - } - if (defined $plan_str) { local $\; print $TAP_STREAM "$plan_str\n"; @@ -114,7 +184,6 @@ sub plan { our @EXPORT = qw< plan - skip_all skip done_testing pass @@ -122,9 +191,10 @@ our @EXPORT = qw< ok is isnt - cmp_ok like unlike + cmp_ok + is_deeply diag note BAIL_OUT @@ -143,6 +213,7 @@ sub import { push @imports, @{ $_[$i+1] }; $splice = 2; } elsif ($item eq 'no_diag') { + lock $plan if THREADSAFE; $no_diag = 1; $splice = 1; } @@ -163,10 +234,9 @@ sub import { goto &Exporter::import; } -sub skip_all { - @_ = (skip_all => $_[0]); - goto &plan; -} +=head2 C<< skip $reason => $count >> + +=cut sub skip { my ($reason, $count) = @_; @@ -183,22 +253,26 @@ sub skip { } for (1 .. $count) { + ++$test; + my $skip_str = "ok $test # skip"; if (defined $reason) { - sanitize_comment($reason); + _sanitize_comment($reason); $skip_str .= " $reason" if length $reason; } local $\; print $TAP_STREAM "$skip_str\n"; - - $test++; } no warnings 'exiting'; last SKIP; } +=head2 C + +=cut + sub done_testing { my ($count) = @_; @@ -226,6 +300,10 @@ sub done_testing { return 1; } +=head2 C + +=cut + sub ok ($;$) { my ($ok, $desc) = @_; @@ -239,7 +317,7 @@ sub ok ($;$) { ++$failed; } if (defined $desc) { - sanitize_comment($desc); + _sanitize_comment($desc); $test_str .= " - $desc" if length $desc; } @@ -249,60 +327,27 @@ sub ok ($;$) { return $ok; } +=head2 C + +=cut + sub pass (;$) { unshift @_, 1; goto &ok; } +=head2 C + +=cut + sub fail (;$) { unshift @_, 0; goto &ok; } -my %binops; -BEGIN { - %binops = ( - 'or' => 'or', - 'and' => 'and', - 'xor' => 'xor', - - '||' => 'hor', - '&&' => 'hand', - - 'lt' => 'lt', - 'le' => 'le', - 'gt' => 'gt', - 'ge' => 'ge', - 'eq' => 'eq', - 'ne' => 'ne', - 'cmp' => 'cmp', - - '<' => 'nlt', - '<=' => 'nle', - '>' => 'ngt', - '>=' => 'nge', - '==' => 'neq', - '!=' => 'nne', - '<=>' => 'ncmp', - - '=~' => 'like', - '!~' => 'unlike', - '~~' => 'smartmatch', - ); +=head2 C - for my $op (sort keys %binops) { - my $name = $binops{$op}; - local $@; - eval <<"IS_BINOP"; -sub is_$name (\$\$;\$) { - my (\$got, \$expected, \$desc) = \@_; - \@_ = ((\$got $op \$expected), \$desc); - goto &ok; -} -IS_BINOP - die $@ if $@; - } -} +=cut sub is ($$;$) { my ($got, $expected, $desc) = @_; @@ -314,6 +359,10 @@ sub is ($$;$) { goto &ok; } +=head2 C + +=cut + sub isnt ($$;$) { my ($got, $expected, $desc) = @_; no warnings 'uninitialized'; @@ -324,19 +373,158 @@ sub isnt ($$;$) { goto &ok; } +my %binops = ( + 'or' => 'or', + 'xor' => 'xor', + 'and' => 'and', + + '||' => 'hor', + ('//' => 'dor') x ($] >= 5.010), + '&&' => 'hand', + + '|' => 'bor', + '^' => 'bxor', + '&' => 'band', + + 'lt' => 'lt', + 'le' => 'le', + 'gt' => 'gt', + 'ge' => 'ge', + 'eq' => 'eq', + 'ne' => 'ne', + 'cmp' => 'cmp', + + '<' => 'nlt', + '<=' => 'nle', + '>' => 'ngt', + '>=' => 'nge', + '==' => 'neq', + '!=' => 'nne', + '<=>' => 'ncmp', + + '=~' => 'like', + '!~' => 'unlike', + ('~~' => 'smartmatch') x ($] >= 5.010), + + '+' => 'add', + '-' => 'substract', + '*' => 'multiply', + '/' => 'divide', + '%' => 'modulo', + '<<' => 'lshift', + '>>' => 'rshift', + + '.' => 'concat', + '..' => 'flipflop', + '...' => 'altflipflop', + ',' => 'comma', + '=>' => 'fatcomma', +); + +my %binop_handlers; + +sub _create_binop_handler { + my ($op) = @_; + my $name = $binops{$op}; + croak("Operator $op not supported") unless defined $name; + { + local $@; + eval <<"IS_BINOP"; +sub is_$name (\$\$;\$) { + my (\$got, \$expected, \$desc) = \@_; + \@_ = (scalar(\$got $op \$expected), \$desc); + goto &ok; +} +IS_BINOP + die $@ if $@; + } + $binop_handlers{$op} = do { + no strict 'refs'; + \&{__PACKAGE__."::is_$name"}; + } +} + +=head2 C + +=cut + +=head2 C + +=cut + { no warnings 'once'; - *like = \&is_like; - *unlike = \&is_unlike; + *like = _create_binop_handler('=~'); + *unlike = _create_binop_handler('!~'); } +=head2 C + +=cut + sub cmp_ok ($$$;$) { my ($got, $op, $expected, $desc) = @_; - my $name = $binops{$op}; - croak("Operator $op not supported") unless defined $name; + my $handler = $binop_handlers{$op}; + unless ($handler) { + local $Test::More::Level = ($Test::More::Level || 0) + 1; + $handler = _create_binop_handler($op); + } @_ = ($got, $expected, $desc); - no strict 'refs'; - goto &{__PACKAGE__."::is_$name"}; + goto $handler; +} + +=head2 C + +=cut + +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; + + if ($ry eq 'ARRAY') { + if ($#$x == $#$y) { + # Prevent vivification of deleted elements by fetching the array values. + my ($ex, $ey); + _deep_check($ex = $x->[$_], $ey = $y->[$_]) or return 0 for 0 .. $#$x; + return 1; + } + } elsif ($ry eq 'HASH') { + if (keys(%$x) == keys(%$y)) { + (exists $x->{$_} and _deep_check($x->{$_}, $y->{$_})) + or return 0 for keys %$y; + return 1; + } + } elsif ($ry eq 'SCALAR' or $ry eq 'REF') { + return _deep_check($$x, $$y); + } + + return 0; +}; + +sub is_deeply { + @_ = ( + &_deep_check, + $_[2], + ); + goto &ok; } sub _diag_fh { @@ -348,7 +536,7 @@ sub _diag_fh { return if $no_diag; my $msg = join '', map { defined($_) ? $_ : 'undef' } @_; - sanitize_comment($msg); + _sanitize_comment($msg); return unless length $msg; local $\; @@ -357,16 +545,28 @@ sub _diag_fh { return 0; }; +=head2 C + +=cut + sub diag { unshift @_, $DIAG_STREAM; goto &_diag_fh; } +=head2 C + +=cut + sub note { unshift @_, $TAP_STREAM; goto &_diag_fh; } +=head2 C + +=cut + sub BAIL_OUT { my ($desc) = @_; @@ -374,7 +574,7 @@ sub BAIL_OUT { my $bail_out_str = 'Bail out!'; if (defined $desc) { - sanitize_comment($desc); + _sanitize_comment($desc); $bail_out_str .= " $desc" if length $desc; # Two spaces } @@ -401,4 +601,94 @@ END { } } +=pod + +L also provides some functions of its own, which are never exported. + +=head2 C + +Read/write accessor for the filehandle to which the tests are outputted. +On write, it also turns autoflush on onto C<$fh>. + +Note that it can only be used as a write accessor before you start any thread, as L cannot reliably share filehandles. + +Defaults to C. + +=cut + +sub tap_stream (;*) { + if (@_) { + $TAP_STREAM = $_[0]; + + my $fh = select $TAP_STREAM; + $|++; + select $fh; + } + + return $TAP_STREAM; +} + +tap_stream *STDOUT; + +=head2 C + +Read/write accessor for the filehandle to which the diagnostics are printed. +On write, it also turns autoflush on onto C<$fh>. + +Just like L, it can only be used as a write accessor before you start any thread, as L cannot reliably share filehandles. + +Defaults to C. + +=cut + +sub diag_stream (;*) { + if (@_) { + $DIAG_STREAM = $_[0]; + + my $fh = select $DIAG_STREAM; + $|++; + select $fh; + } + + return $DIAG_STREAM; +} + +diag_stream *STDERR; + +=head2 C + +This constant evaluates to true if and only if L is thread-safe, i.e. when this version of C is at least 5.8, has been compiled with C defined, and L has been loaded B L. +In that case, it also needs a working L. + +=head1 DEPENDENCIES + +L 5.6. + +L, L, L. + +=head1 AUTHOR + +Vincent Pit, C<< >>, L. + +You can contact me by mail or on C (vincent). + +=head1 BUGS + +Please report any bugs or feature requests to C, or through the web interface at L. +I will be notified, and then you'll automatically be notified of progress on your bug as I make changes. + +=head1 SUPPORT + +You can find documentation for this module with the perldoc command. + + perldoc Test::Leaner + +=head1 COPYRIGHT & LICENSE + +Copyright 2010 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. + +=cut + 1; # End of Test::Leaner