Benchmark-Timer-0.7102/0000755000076500000240000000000011246540445013741 5ustar coppitstaffBenchmark-Timer-0.7102/CHANGES0000644000076500000240000000477611237670361014753 0ustar coppitstaffVersion 0.7102: Sun Aug 9 2009 - Updated to the latest version of Module::Install Version 0.7101: Mon Jul 14 2008 - Updated to the latest version of Module::Install - Removed auto-install for better compatibility with CPAN and others - Reformatted POD in module code - Moved hosting to Google Code Version 0.7100: Tue Dec 21 2004 - Fixed version numbers, which were incompatible with some modules. (Thanks to Tassilo von Parseval for the bug report) - Removed custom installation prompts Version 0.7.0: Thu Oct 21 10:29:11 EDT 2004 - Renamed get_report to report, and added reports method. (Thanks to Aaron Wodrich for providing the impetus for the change.) - Clarified the documentation Version 0.6.2: - Switched to Test::More for better test reporting Version 0.6.1: Thu Sep 16 2004 - Modified Makefile.PL to use Module::Install::CustomInstallationPath - Changed version numbering - Fixed broken dependency specification in Makefile.PL 0.6 - September 2, 2004 - Maintenance of the module transferred to David Coppit - License changed to GNU GPL. - Improved reporting to support multiple tags - Added statistical sampling, allowing the user to time code until a certain confidence level is reached. (Added error() and confidence() to support this functionality) 0.5 - April 20, 2001 * Added functionality to skip trials when doing repeated trials via a "skip" constructor parameter, plus tests for this. * Consistently use croak() and carp() instead of die() and warn(). * Added error tests to test that error conditions are properly met. * Renamed Benchmark::Timer object to $t in the test cases to make them more conventional. 0.4 - March 29, 2001 * Changed internal method representation to an array instead of a hash, for a tiny but measureable speed increase. * Corrected timestr() to display microseconds and show integral times. * Added delta.pl, a small script that calculates the approximate overhead of using Benchmark::Timer versus plain Time::HiRes calls. 0.3 - March 26, 2001 * Renamed Time::Timer to Benchmark::Timer after some discussion on the comp.lang.perl.modules newsgroup. 0.2 - March 24, 2001 * Added $t->result, $t->results, and $t->data methods to access data. * warn() instead of puke when $t->report is called while an event is still pending (thanks Ilmari Karonen ). 0.1 - March 23, 2001 * Original version, created by Andrew Ho (andrew@zeuscat.com), rolled. Benchmark-Timer-0.7102/delta.pl0000755000076500000240000000520011037106751015363 0ustar coppitstaff#!/usr/local/bin/perl -w # ======================================================================== # delta.pl - calculate Benchmark::Timer object call overhead # Andrew Ho (andrew@zeuscat.com) # # This program contains embedded documentation in Perl POD (Plain Old # Documentation) format. Search for the string "=head1" in this document # to find documentation snippets, or use "perldoc" to read it; utilities # like "pod2man" and "pod2html" can reformat as well. # # Copyright(c) 2000-2001 Andrew Ho. # # This script is free software; you can redistribute it and/or modify # it under the same terms as Perl itself. # # Last modified March 29, 2001 # ======================================================================== =head1 NAME delta.pl - calculate Benchmark::Timer object call overhead =head1 SYNOPSIS % ./delta.pl [n] =head1 DESCRIPTION This short script calculates the approximate speed overhead, on your system, of using Benchmark::Timer to time repeated benchmark calls, rather than using Time::HiRes and lexical temporary values directly. By default, it does 10,000 trials of timing nothing. It benchmarks using first Benchmark::Timer, then bare Time::HiRes calls, and reports the average times taken to perform the no-op. Subtract the second from the first to find the approximate overhead imposed by using Benchmark::Timer. This is typically significant and consistent, but pretty tiny, on the order of microseconds. The magnitude of the overhead also falls quickly and asymptotically as the number of trials increases from one, levelling off at anything over around 100 trials. =head1 SEE ALSO L, L =head1 AUTHOR Andrew Ho Eandrew@zeuscat.comE =head1 COPYRIGHT Copyright(c) 2000-2001 Andrew Ho. This library is free software; you can redistribute it and/or modify it under the same terms as Perl itself. =cut # ------------------------------------------------------------------------ # Main loop. use strict; use Benchmark::Timer; use Time::HiRes qw( gettimeofday tv_interval ); use vars qw($N); $N = shift || 10_000; my $t = new Benchmark::Timer; foreach(1 .. $N) { $t->start('noop'); $t->stop; } my $bt = $t->result('noop'); printf "Benchmark::Timer => %s\n", Benchmark::Timer::timestr($bt); my @interval = (); foreach(1 .. $N) { my $before = [ gettimeofday ]; my $elapsed = tv_interval( $before, [ gettimeofday ] ); push @interval, $elapsed; } my $interval = 0; $interval += $_ foreach @interval; $interval /= @interval; printf "Time::HiRes => %s\n", Benchmark::Timer::timestr($interval); exit 0; # ======================================================================== __END__ Benchmark-Timer-0.7102/inc/0000755000076500000240000000000011246540445014512 5ustar coppitstaffBenchmark-Timer-0.7102/inc/Module/0000755000076500000240000000000011246540445015737 5ustar coppitstaffBenchmark-Timer-0.7102/inc/Module/Install/0000755000076500000240000000000011246540445017345 5ustar coppitstaffBenchmark-Timer-0.7102/inc/Module/Install/Base.pm0000644000076500000240000000176611246537675020602 0ustar coppitstaff#line 1 package Module::Install::Base; use strict 'vars'; use vars qw{$VERSION}; BEGIN { $VERSION = '0.91'; } # Suspend handler for "redefined" warnings BEGIN { my $w = $SIG{__WARN__}; $SIG{__WARN__} = sub { $w }; } #line 42 sub new { my $class = shift; unless ( defined &{"${class}::call"} ) { *{"${class}::call"} = sub { shift->_top->call(@_) }; } unless ( defined &{"${class}::load"} ) { *{"${class}::load"} = sub { shift->_top->load(@_) }; } bless { @_ }, $class; } #line 61 sub AUTOLOAD { local $@; my $func = eval { shift->_top->autoload } or return; goto &$func; } #line 75 sub _top { $_[0]->{_top}; } #line 90 sub admin { $_[0]->_top->{admin} or Module::Install::Base::FakeAdmin->new; } #line 106 sub is_admin { $_[0]->admin->VERSION; } sub DESTROY {} package Module::Install::Base::FakeAdmin; my $fake; sub new { $fake ||= bless(\@_, $_[0]); } sub AUTOLOAD {} sub DESTROY {} # Restore warning handler BEGIN { $SIG{__WARN__} = $SIG{__WARN__}->(); } 1; #line 154 Benchmark-Timer-0.7102/inc/Module/Install/Can.pm0000644000076500000240000000333311246537675020421 0ustar coppitstaff#line 1 package Module::Install::Can; use strict; use Config (); use File::Spec (); use ExtUtils::MakeMaker (); use Module::Install::Base (); use vars qw{$VERSION @ISA $ISCORE}; BEGIN { $VERSION = '0.91'; @ISA = 'Module::Install::Base'; $ISCORE = 1; } # check if we can load some module ### Upgrade this to not have to load the module if possible sub can_use { my ($self, $mod, $ver) = @_; $mod =~ s{::|\\}{/}g; $mod .= '.pm' unless $mod =~ /\.pm$/i; my $pkg = $mod; $pkg =~ s{/}{::}g; $pkg =~ s{\.pm$}{}i; local $@; eval { require $mod; $pkg->VERSION($ver || 0); 1 }; } # check if we can run some command sub can_run { my ($self, $cmd) = @_; my $_cmd = $cmd; return $_cmd if (-x $_cmd or $_cmd = MM->maybe_command($_cmd)); for my $dir ((split /$Config::Config{path_sep}/, $ENV{PATH}), '.') { next if $dir eq ''; my $abs = File::Spec->catfile($dir, $_[1]); return $abs if (-x $abs or $abs = MM->maybe_command($abs)); } return; } # can we locate a (the) C compiler sub can_cc { my $self = shift; my @chunks = split(/ /, $Config::Config{cc}) or return; # $Config{cc} may contain args; try to find out the program part while (@chunks) { return $self->can_run("@chunks") || (pop(@chunks), next); } return; } # Fix Cygwin bug on maybe_command(); if ( $^O eq 'cygwin' ) { require ExtUtils::MM_Cygwin; require ExtUtils::MM_Win32; if ( ! defined(&ExtUtils::MM_Cygwin::maybe_command) ) { *ExtUtils::MM_Cygwin::maybe_command = sub { my ($self, $file) = @_; if ($file =~ m{^/cygdrive/}i and ExtUtils::MM_Win32->can('maybe_command')) { ExtUtils::MM_Win32->maybe_command($file); } else { ExtUtils::MM_Unix->maybe_command($file); } } } } 1; __END__ #line 156 Benchmark-Timer-0.7102/inc/Module/Install/CheckOptional.pm0000644000076500000240000000203211246537675022436 0ustar coppitstaff#line 1 package Module::Install::CheckOptional; use strict; use 5.005; use Carp; # For module install and version checks use Module::AutoInstall; use vars qw( @ISA $VERSION ); use Module::Install::Base; @ISA = qw( Module::Install::Base Module::AutoInstall ); $VERSION = sprintf "%d.%02d%02d", q/0.10.01/ =~ /(\d+)/g; # --------------------------------------------------------------------------- sub check_optional { my $self = shift; my $module = shift; my $version = shift; my $message = shift; croak "check_optional requires a dependency and version such as \"Carp => 1.03\"" unless defined $module and defined $version; return if Module::AutoInstall::_version_cmp( Module::AutoInstall::_load($module), $version ) >= 0; print<new($host, Passive => 1, Timeout => 600); $ftp->login("anonymous", 'anonymous@example.com'); $ftp->cwd($path); $ftp->binary; $ftp->get($file) or (warn("$!\n"), return); $ftp->quit; } } elsif (my $ftp = $self->can_run('ftp')) { eval { # no Net::FTP, fallback to ftp.exe require FileHandle; my $fh = FileHandle->new; local $SIG{CHLD} = 'IGNORE'; unless ($fh->open("|$ftp -n")) { warn "Couldn't open ftp: $!\n"; chdir $dir; return; } my @dialog = split(/\n/, <<"END_FTP"); open $host user anonymous anonymous\@example.com cd $path binary get $file $file quit END_FTP foreach (@dialog) { $fh->print("$_\n") } $fh->close; } } else { warn "No working 'ftp' program available!\n"; chdir $dir; return; } unless (-f $file) { warn "Fetching failed: $@\n"; chdir $dir; return; } return if exists $args{size} and -s $file != $args{size}; system($args{run}) if exists $args{run}; unlink($file) if $args{remove}; print(((!exists $args{check_for} or -e $args{check_for}) ? "done!" : "failed! ($!)"), "\n"); chdir $dir; return !$?; } 1; Benchmark-Timer-0.7102/inc/Module/Install/Makefile.pm0000644000076500000240000001600311246537675021433 0ustar coppitstaff#line 1 package Module::Install::Makefile; use strict 'vars'; use ExtUtils::MakeMaker (); use Module::Install::Base (); use vars qw{$VERSION @ISA $ISCORE}; BEGIN { $VERSION = '0.91'; @ISA = 'Module::Install::Base'; $ISCORE = 1; } sub Makefile { $_[0] } my %seen = (); sub prompt { shift; # Infinite loop protection my @c = caller(); if ( ++$seen{"$c[1]|$c[2]|$_[0]"} > 3 ) { die "Caught an potential prompt infinite loop ($c[1]|$c[2]|$_[0])"; } # In automated testing, always use defaults if ( $ENV{AUTOMATED_TESTING} and ! $ENV{PERL_MM_USE_DEFAULT} ) { local $ENV{PERL_MM_USE_DEFAULT} = 1; goto &ExtUtils::MakeMaker::prompt; } else { goto &ExtUtils::MakeMaker::prompt; } } sub makemaker_args { my $self = shift; my $args = ( $self->{makemaker_args} ||= {} ); %$args = ( %$args, @_ ); return $args; } # For mm args that take multiple space-seperated args, # append an argument to the current list. sub makemaker_append { my $self = sShift; my $name = shift; my $args = $self->makemaker_args; $args->{name} = defined $args->{$name} ? join( ' ', $args->{name}, @_ ) : join( ' ', @_ ); } sub build_subdirs { my $self = shift; my $subdirs = $self->makemaker_args->{DIR} ||= []; for my $subdir (@_) { push @$subdirs, $subdir; } } sub clean_files { my $self = shift; my $clean = $self->makemaker_args->{clean} ||= {}; %$clean = ( %$clean, FILES => join ' ', grep { length $_ } ($clean->{FILES} || (), @_), ); } sub realclean_files { my $self = shift; my $realclean = $self->makemaker_args->{realclean} ||= {}; %$realclean = ( %$realclean, FILES => join ' ', grep { length $_ } ($realclean->{FILES} || (), @_), ); } sub libs { my $self = shift; my $libs = ref $_[0] ? shift : [ shift ]; $self->makemaker_args( LIBS => $libs ); } sub inc { my $self = shift; $self->makemaker_args( INC => shift ); } my %test_dir = (); sub _wanted_t { /\.t$/ and -f $_ and $test_dir{$File::Find::dir} = 1; } sub tests_recursive { my $self = shift; if ( $self->tests ) { die "tests_recursive will not work if tests are already defined"; } my $dir = shift || 't'; unless ( -d $dir ) { die "tests_recursive dir '$dir' does not exist"; } %test_dir = (); require File::Find; File::Find::find( \&_wanted_t, $dir ); $self->tests( join ' ', map { "$_/*.t" } sort keys %test_dir ); } sub write { my $self = shift; die "&Makefile->write() takes no arguments\n" if @_; # Check the current Perl version my $perl_version = $self->perl_version; if ( $perl_version ) { eval "use $perl_version; 1" or die "ERROR: perl: Version $] is installed, " . "but we need version >= $perl_version"; } # Make sure we have a new enough MakeMaker require ExtUtils::MakeMaker; if ( $perl_version and $self->_cmp($perl_version, '5.006') >= 0 ) { # MakeMaker can complain about module versions that include # an underscore, even though its own version may contain one! # Hence the funny regexp to get rid of it. See RT #35800 # for details. $self->build_requires( 'ExtUtils::MakeMaker' => $ExtUtils::MakeMaker::VERSION =~ /^(\d+\.\d+)/ ); $self->configure_requires( 'ExtUtils::MakeMaker' => $ExtUtils::MakeMaker::VERSION =~ /^(\d+\.\d+)/ ); } else { # Allow legacy-compatibility with 5.005 by depending on the # most recent EU:MM that supported 5.005. $self->build_requires( 'ExtUtils::MakeMaker' => 6.42 ); $self->configure_requires( 'ExtUtils::MakeMaker' => 6.42 ); } # Generate the MakeMaker params my $args = $self->makemaker_args; $args->{DISTNAME} = $self->name; $args->{NAME} = $self->module_name || $self->name; $args->{VERSION} = $self->version; $args->{NAME} =~ s/-/::/g; if ( $self->tests ) { $args->{test} = { TESTS => $self->tests }; } if ( $] >= 5.005 ) { $args->{ABSTRACT} = $self->abstract; $args->{AUTHOR} = $self->author; } if ( eval($ExtUtils::MakeMaker::VERSION) >= 6.10 ) { $args->{NO_META} = 1; } if ( eval($ExtUtils::MakeMaker::VERSION) > 6.17 and $self->sign ) { $args->{SIGN} = 1; } unless ( $self->is_admin ) { delete $args->{SIGN}; } # Merge both kinds of requires into prereq_pm my $prereq = ($args->{PREREQ_PM} ||= {}); %$prereq = ( %$prereq, map { @$_ } map { @$_ } grep $_, ($self->configure_requires, $self->build_requires, $self->requires) ); # Remove any reference to perl, PREREQ_PM doesn't support it delete $args->{PREREQ_PM}->{perl}; # merge both kinds of requires into prereq_pm my $subdirs = ($args->{DIR} ||= []); if ($self->bundles) { foreach my $bundle (@{ $self->bundles }) { my ($file, $dir) = @$bundle; push @$subdirs, $dir if -d $dir; delete $prereq->{$file}; } } if ( my $perl_version = $self->perl_version ) { eval "use $perl_version; 1" or die "ERROR: perl: Version $] is installed, " . "but we need version >= $perl_version"; } $args->{INSTALLDIRS} = $self->installdirs; my %args = map { ( $_ => $args->{$_} ) } grep {defined($args->{$_})} keys %$args; my $user_preop = delete $args{dist}->{PREOP}; if (my $preop = $self->admin->preop($user_preop)) { foreach my $key ( keys %$preop ) { $args{dist}->{$key} = $preop->{$key}; } } my $mm = ExtUtils::MakeMaker::WriteMakefile(%args); $self->fix_up_makefile($mm->{FIRST_MAKEFILE} || 'Makefile'); } sub fix_up_makefile { my $self = shift; my $makefile_name = shift; my $top_class = ref($self->_top) || ''; my $top_version = $self->_top->VERSION || ''; my $preamble = $self->preamble ? "# Preamble by $top_class $top_version\n" . $self->preamble : ''; my $postamble = "# Postamble by $top_class $top_version\n" . ($self->postamble || ''); local *MAKEFILE; open MAKEFILE, "< $makefile_name" or die "fix_up_makefile: Couldn't open $makefile_name: $!"; my $makefile = do { local $/; }; close MAKEFILE or die $!; $makefile =~ s/\b(test_harness\(\$\(TEST_VERBOSE\), )/$1'inc', /; $makefile =~ s/( -I\$\(INST_ARCHLIB\))/ -Iinc$1/g; $makefile =~ s/( "-I\$\(INST_LIB\)")/ "-Iinc"$1/g; $makefile =~ s/^(FULLPERL = .*)/$1 "-Iinc"/m; $makefile =~ s/^(PERL = .*)/$1 "-Iinc"/m; # Module::Install will never be used to build the Core Perl # Sometimes PERL_LIB and PERL_ARCHLIB get written anyway, which breaks # PREFIX/PERL5LIB, and thus, install_share. Blank them if they exist $makefile =~ s/^PERL_LIB = .+/PERL_LIB =/m; #$makefile =~ s/^PERL_ARCHLIB = .+/PERL_ARCHLIB =/m; # Perl 5.005 mentions PERL_LIB explicitly, so we have to remove that as well. $makefile =~ s/(\"?)-I\$\(PERL_LIB\)\1//g; # XXX - This is currently unused; not sure if it breaks other MM-users # $makefile =~ s/^pm_to_blib\s+:\s+/pm_to_blib :: /mg; open MAKEFILE, "> $makefile_name" or die "fix_up_makefile: Couldn't open $makefile_name: $!"; print MAKEFILE "$preamble$makefile$postamble" or die $!; close MAKEFILE or die $!; 1; } sub preamble { my ($self, $text) = @_; $self->{preamble} = $text . $self->{preamble} if defined $text; $self->{preamble}; } sub postamble { my ($self, $text) = @_; $self->{postamble} ||= $self->admin->postamble; $self->{postamble} .= $text if defined $text; $self->{postamble} } 1; __END__ #line 394 Benchmark-Timer-0.7102/inc/Module/Install/Metadata.pm0000644000076500000240000003530411246537675021443 0ustar coppitstaff#line 1 package Module::Install::Metadata; use strict 'vars'; use Module::Install::Base (); use vars qw{$VERSION @ISA $ISCORE}; BEGIN { $VERSION = '0.91'; @ISA = 'Module::Install::Base'; $ISCORE = 1; } my @boolean_keys = qw{ sign }; my @scalar_keys = qw{ name module_name abstract author version distribution_type tests installdirs }; my @tuple_keys = qw{ configure_requires build_requires requires recommends bundles resources }; my @resource_keys = qw{ homepage bugtracker repository }; my @array_keys = qw{ keywords }; sub Meta { shift } sub Meta_BooleanKeys { @boolean_keys } sub Meta_ScalarKeys { @scalar_keys } sub Meta_TupleKeys { @tuple_keys } sub Meta_ResourceKeys { @resource_keys } sub Meta_ArrayKeys { @array_keys } foreach my $key ( @boolean_keys ) { *$key = sub { my $self = shift; if ( defined wantarray and not @_ ) { return $self->{values}->{$key}; } $self->{values}->{$key} = ( @_ ? $_[0] : 1 ); return $self; }; } foreach my $key ( @scalar_keys ) { *$key = sub { my $self = shift; return $self->{values}->{$key} if defined wantarray and !@_; $self->{values}->{$key} = shift; return $self; }; } foreach my $key ( @array_keys ) { *$key = sub { my $self = shift; return $self->{values}->{$key} if defined wantarray and !@_; $self->{values}->{$key} ||= []; push @{$self->{values}->{$key}}, @_; return $self; }; } foreach my $key ( @resource_keys ) { *$key = sub { my $self = shift; unless ( @_ ) { return () unless $self->{values}->{resources}; return map { $_->[1] } grep { $_->[0] eq $key } @{ $self->{values}->{resources} }; } return $self->{values}->{resources}->{$key} unless @_; my $uri = shift or die( "Did not provide a value to $key()" ); $self->resources( $key => $uri ); return 1; }; } foreach my $key ( grep { $_ ne "resources" } @tuple_keys) { *$key = sub { my $self = shift; return $self->{values}->{$key} unless @_; my @added; while ( @_ ) { my $module = shift or last; my $version = shift || 0; push @added, [ $module, $version ]; } push @{ $self->{values}->{$key} }, @added; return map {@$_} @added; }; } # Resource handling my %lc_resource = map { $_ => 1 } qw{ homepage license bugtracker repository }; sub resources { my $self = shift; while ( @_ ) { my $name = shift or last; my $value = shift or next; if ( $name eq lc $name and ! $lc_resource{$name} ) { die("Unsupported reserved lowercase resource '$name'"); } $self->{values}->{resources} ||= []; push @{ $self->{values}->{resources} }, [ $name, $value ]; } $self->{values}->{resources}; } # Aliases for build_requires that will have alternative # meanings in some future version of META.yml. sub test_requires { shift->build_requires(@_) } sub install_requires { shift->build_requires(@_) } # Aliases for installdirs options sub install_as_core { $_[0]->installdirs('perl') } sub install_as_cpan { $_[0]->installdirs('site') } sub install_as_site { $_[0]->installdirs('site') } sub install_as_vendor { $_[0]->installdirs('vendor') } sub dynamic_config { my $self = shift; unless ( @_ ) { warn "You MUST provide an explicit true/false value to dynamic_config\n"; return $self; } $self->{values}->{dynamic_config} = $_[0] ? 1 : 0; return 1; } sub perl_version { my $self = shift; return $self->{values}->{perl_version} unless @_; my $version = shift or die( "Did not provide a value to perl_version()" ); # Normalize the version $version = $self->_perl_version($version); # We don't support the reall old versions unless ( $version >= 5.005 ) { die "Module::Install only supports 5.005 or newer (use ExtUtils::MakeMaker)\n"; } $self->{values}->{perl_version} = $version; } #Stolen from M::B my %license_urls = ( perl => 'http://dev.perl.org/licenses/', apache => 'http://apache.org/licenses/LICENSE-2.0', artistic => 'http://opensource.org/licenses/artistic-license.php', artistic_2 => 'http://opensource.org/licenses/artistic-license-2.0.php', lgpl => 'http://opensource.org/licenses/lgpl-license.php', lgpl2 => 'http://opensource.org/licenses/lgpl-2.1.php', lgpl3 => 'http://opensource.org/licenses/lgpl-3.0.html', bsd => 'http://opensource.org/licenses/bsd-license.php', gpl => 'http://opensource.org/licenses/gpl-license.php', gpl2 => 'http://opensource.org/licenses/gpl-2.0.php', gpl3 => 'http://opensource.org/licenses/gpl-3.0.html', mit => 'http://opensource.org/licenses/mit-license.php', mozilla => 'http://opensource.org/licenses/mozilla1.1.php', open_source => undef, unrestricted => undef, restrictive => undef, unknown => undef, ); sub license { my $self = shift; return $self->{values}->{license} unless @_; my $license = shift or die( 'Did not provide a value to license()' ); $self->{values}->{license} = $license; # Automatically fill in license URLs if ( $license_urls{$license} ) { $self->resources( license => $license_urls{$license} ); } return 1; } sub all_from { my ( $self, $file ) = @_; unless ( defined($file) ) { my $name = $self->name or die( "all_from called with no args without setting name() first" ); $file = join('/', 'lib', split(/-/, $name)) . '.pm'; $file =~ s{.*/}{} unless -e $file; unless ( -e $file ) { die("all_from cannot find $file from $name"); } } unless ( -f $file ) { die("The path '$file' does not exist, or is not a file"); } # Some methods pull from POD instead of code. # If there is a matching .pod, use that instead my $pod = $file; $pod =~ s/\.pm$/.pod/i; $pod = $file unless -e $pod; # Pull the different values $self->name_from($file) unless $self->name; $self->version_from($file) unless $self->version; $self->perl_version_from($file) unless $self->perl_version; $self->author_from($pod) unless $self->author; $self->license_from($pod) unless $self->license; $self->abstract_from($pod) unless $self->abstract; return 1; } sub provides { my $self = shift; my $provides = ( $self->{values}->{provides} ||= {} ); %$provides = (%$provides, @_) if @_; return $provides; } sub auto_provides { my $self = shift; return $self unless $self->is_admin; unless (-e 'MANIFEST') { warn "Cannot deduce auto_provides without a MANIFEST, skipping\n"; return $self; } # Avoid spurious warnings as we are not checking manifest here. local $SIG{__WARN__} = sub {1}; require ExtUtils::Manifest; local *ExtUtils::Manifest::manicheck = sub { return }; require Module::Build; my $build = Module::Build->new( dist_name => $self->name, dist_version => $self->version, license => $self->license, ); $self->provides( %{ $build->find_dist_packages || {} } ); } sub feature { my $self = shift; my $name = shift; my $features = ( $self->{values}->{features} ||= [] ); my $mods; if ( @_ == 1 and ref( $_[0] ) ) { # The user used ->feature like ->features by passing in the second # argument as a reference. Accomodate for that. $mods = $_[0]; } else { $mods = \@_; } my $count = 0; push @$features, ( $name => [ map { ref($_) ? ( ref($_) eq 'HASH' ) ? %$_ : @$_ : $_ } @$mods ] ); return @$features; } sub features { my $self = shift; while ( my ( $name, $mods ) = splice( @_, 0, 2 ) ) { $self->feature( $name, @$mods ); } return $self->{values}->{features} ? @{ $self->{values}->{features} } : (); } sub no_index { my $self = shift; my $type = shift; push @{ $self->{values}->{no_index}->{$type} }, @_ if $type; return $self->{values}->{no_index}; } sub read { my $self = shift; $self->include_deps( 'YAML::Tiny', 0 ); require YAML::Tiny; my $data = YAML::Tiny::LoadFile('META.yml'); # Call methods explicitly in case user has already set some values. while ( my ( $key, $value ) = each %$data ) { next unless $self->can($key); if ( ref $value eq 'HASH' ) { while ( my ( $module, $version ) = each %$value ) { $self->can($key)->($self, $module => $version ); } } else { $self->can($key)->($self, $value); } } return $self; } sub write { my $self = shift; return $self unless $self->is_admin; $self->admin->write_meta; return $self; } sub version_from { require ExtUtils::MM_Unix; my ( $self, $file ) = @_; $self->version( ExtUtils::MM_Unix->parse_version($file) ); } sub abstract_from { require ExtUtils::MM_Unix; my ( $self, $file ) = @_; $self->abstract( bless( { DISTNAME => $self->name }, 'ExtUtils::MM_Unix' )->parse_abstract($file) ); } # Add both distribution and module name sub name_from { my ($self, $file) = @_; if ( Module::Install::_read($file) =~ m/ ^ \s* package \s* ([\w:]+) \s* ; /ixms ) { my ($name, $module_name) = ($1, $1); $name =~ s{::}{-}g; $self->name($name); unless ( $self->module_name ) { $self->module_name($module_name); } } else { die("Cannot determine name from $file\n"); } } sub perl_version_from { my $self = shift; if ( Module::Install::_read($_[0]) =~ m/ ^ (?:use|require) \s* v? ([\d_\.]+) \s* ; /ixms ) { my $perl_version = $1; $perl_version =~ s{_}{}g; $self->perl_version($perl_version); } else { warn "Cannot determine perl version info from $_[0]\n"; return; } } sub author_from { my $self = shift; my $content = Module::Install::_read($_[0]); if ($content =~ m/ =head \d \s+ (?:authors?)\b \s* ([^\n]*) | =head \d \s+ (?:licen[cs]e|licensing|copyright|legal)\b \s* .*? copyright .*? \d\d\d[\d.]+ \s* (?:\bby\b)? \s* ([^\n]*) /ixms) { my $author = $1 || $2; $author =~ s{E}{<}g; $author =~ s{E}{>}g; $self->author($author); } else { warn "Cannot determine author info from $_[0]\n"; } } sub license_from { my $self = shift; if ( Module::Install::_read($_[0]) =~ m/ ( =head \d \s+ (?:licen[cs]e|licensing|copyright|legal)\b .*? ) (=head\\d.*|=cut.*|) \z /ixms ) { my $license_text = $1; my @phrases = ( 'under the same (?:terms|license) as (?:perl|the perl programming language) itself' => 'perl', 1, 'GNU general public license' => 'gpl', 1, 'GNU public license' => 'gpl', 1, 'GNU lesser general public license' => 'lgpl', 1, 'GNU lesser public license' => 'lgpl', 1, 'GNU library general public license' => 'lgpl', 1, 'GNU library public license' => 'lgpl', 1, 'BSD license' => 'bsd', 1, 'Artistic license' => 'artistic', 1, 'GPL' => 'gpl', 1, 'LGPL' => 'lgpl', 1, 'BSD' => 'bsd', 1, 'Artistic' => 'artistic', 1, 'MIT' => 'mit', 1, 'proprietary' => 'proprietary', 0, ); while ( my ($pattern, $license, $osi) = splice(@phrases, 0, 3) ) { $pattern =~ s{\s+}{\\s+}g; if ( $license_text =~ /\b$pattern\b/i ) { $self->license($license); return 1; } } } warn "Cannot determine license info from $_[0]\n"; return 'unknown'; } sub _extract_bugtracker { my @links = $_[0] =~ m#L<(\Qhttp://rt.cpan.org/\E[^>]+)>#g; my %links; @links{@links}=(); @links=keys %links; return @links; } sub bugtracker_from { my $self = shift; my $content = Module::Install::_read($_[0]); my @links = _extract_bugtracker($content); unless ( @links ) { warn "Cannot determine bugtracker info from $_[0]\n"; return 0; } if ( @links > 1 ) { warn "Found more than on rt.cpan.org link in $_[0]\n"; return 0; } # Set the bugtracker bugtracker( $links[0] ); return 1; } sub requires_from { my $self = shift; my $content = Module::Install::_readperl($_[0]); my @requires = $content =~ m/^use\s+([^\W\d]\w*(?:::\w+)*)\s+([\d\.]+)/mg; while ( @requires ) { my $module = shift @requires; my $version = shift @requires; $self->requires( $module => $version ); } } sub test_requires_from { my $self = shift; my $content = Module::Install::_readperl($_[0]); my @requires = $content =~ m/^use\s+([^\W\d]\w*(?:::\w+)*)\s+([\d\.]+)/mg; while ( @requires ) { my $module = shift @requires; my $version = shift @requires; $self->test_requires( $module => $version ); } } # Convert triple-part versions (eg, 5.6.1 or 5.8.9) to # numbers (eg, 5.006001 or 5.008009). # Also, convert double-part versions (eg, 5.8) sub _perl_version { my $v = $_[-1]; $v =~ s/^([1-9])\.([1-9]\d?\d?)$/sprintf("%d.%03d",$1,$2)/e; $v =~ s/^([1-9])\.([1-9]\d?\d?)\.(0|[1-9]\d?\d?)$/sprintf("%d.%03d%03d",$1,$2,$3 || 0)/e; $v =~ s/(\.\d\d\d)000$/$1/; $v =~ s/_.+$//; if ( ref($v) ) { # Numify $v = $v + 0; } return $v; } ###################################################################### # MYMETA Support sub WriteMyMeta { die "WriteMyMeta has been deprecated"; } sub write_mymeta_yaml { my $self = shift; # We need YAML::Tiny to write the MYMETA.yml file unless ( eval { require YAML::Tiny; 1; } ) { return 1; } # Generate the data my $meta = $self->_write_mymeta_data or return 1; # Save as the MYMETA.yml file print "Writing MYMETA.yml\n"; YAML::Tiny::DumpFile('MYMETA.yml', $meta); } sub write_mymeta_json { my $self = shift; # We need JSON to write the MYMETA.json file unless ( eval { require JSON; 1; } ) { return 1; } # Generate the data my $meta = $self->_write_mymeta_data or return 1; # Save as the MYMETA.yml file print "Writing MYMETA.json\n"; Module::Install::_write( 'MYMETA.json', JSON->new->pretty(1)->canonical->encode($meta), ); } sub _write_mymeta_data { my $self = shift; # If there's no existing META.yml there is nothing we can do return undef unless -f 'META.yml'; # We need Parse::CPAN::Meta to load the file unless ( eval { require Parse::CPAN::Meta; 1; } ) { return undef; } # Merge the perl version into the dependencies my $val = $self->Meta->{values}; my $perl = delete $val->{perl_version}; if ( $perl ) { $val->{requires} ||= []; my $requires = $val->{requires}; # Canonize to three-dot version after Perl 5.6 if ( $perl >= 5.006 ) { $perl =~ s{^(\d+)\.(\d\d\d)(\d*)}{join('.', $1, int($2||0), int($3||0))}e } unshift @$requires, [ perl => $perl ]; } # Load the advisory META.yml file my @yaml = Parse::CPAN::Meta::LoadFile('META.yml'); my $meta = $yaml[0]; # Overwrite the non-configure dependency hashs delete $meta->{requires}; delete $meta->{build_requires}; delete $meta->{recommends}; if ( exists $val->{requires} ) { $meta->{requires} = { map { @$_ } @{ $val->{requires} } }; } if ( exists $val->{build_requires} ) { $meta->{build_requires} = { map { @$_ } @{ $val->{build_requires} } }; } return $meta; } 1; Benchmark-Timer-0.7102/inc/Module/Install/Win32.pm0000644000076500000240000000340311246537675020620 0ustar coppitstaff#line 1 package Module::Install::Win32; use strict; use Module::Install::Base (); use vars qw{$VERSION @ISA $ISCORE}; BEGIN { $VERSION = '0.91'; @ISA = 'Module::Install::Base'; $ISCORE = 1; } # determine if the user needs nmake, and download it if needed sub check_nmake { my $self = shift; $self->load('can_run'); $self->load('get_file'); require Config; return unless ( $^O eq 'MSWin32' and $Config::Config{make} and $Config::Config{make} =~ /^nmake\b/i and ! $self->can_run('nmake') ); print "The required 'nmake' executable not found, fetching it...\n"; require File::Basename; my $rv = $self->get_file( url => 'http://download.microsoft.com/download/vc15/Patch/1.52/W95/EN-US/Nmake15.exe', ftp_url => 'ftp://ftp.microsoft.com/Softlib/MSLFILES/Nmake15.exe', local_dir => File::Basename::dirname($^X), size => 51928, run => 'Nmake15.exe /o > nul', check_for => 'Nmake.exe', remove => 1, ); die <<'END_MESSAGE' unless $rv; ------------------------------------------------------------------------------- Since you are using Microsoft Windows, you will need the 'nmake' utility before installation. It's available at: http://download.microsoft.com/download/vc15/Patch/1.52/W95/EN-US/Nmake15.exe or ftp://ftp.microsoft.com/Softlib/MSLFILES/Nmake15.exe Please download the file manually, save it to a directory in %PATH% (e.g. C:\WINDOWS\COMMAND\), then launch the MS-DOS command line shell, "cd" to that directory, and run "Nmake15.exe" from there; that will create the 'nmake.exe' file needed by this module. You may then resume the installation process described in README. ------------------------------------------------------------------------------- END_MESSAGE } 1; Benchmark-Timer-0.7102/inc/Module/Install/WriteAll.pm0000644000076500000240000000222211246537675021437 0ustar coppitstaff#line 1 package Module::Install::WriteAll; use strict; use Module::Install::Base (); use vars qw{$VERSION @ISA $ISCORE}; BEGIN { $VERSION = '0.91';; @ISA = qw{Module::Install::Base}; $ISCORE = 1; } sub WriteAll { my $self = shift; my %args = ( meta => 1, sign => 0, inline => 0, check_nmake => 1, @_, ); $self->sign(1) if $args{sign}; $self->admin->WriteAll(%args) if $self->is_admin; $self->check_nmake if $args{check_nmake}; unless ( $self->makemaker_args->{PL_FILES} ) { $self->makemaker_args( PL_FILES => {} ); } # Until ExtUtils::MakeMaker support MYMETA.yml, make sure # we clean it up properly ourself. $self->realclean_files('MYMETA.yml'); if ( $args{inline} ) { $self->Inline->write; } else { $self->Makefile->write; } # The Makefile write process adds a couple of dependencies, # so write the META.yml files after the Makefile. if ( $args{meta} ) { $self->Meta->write; } # Experimental support for MYMETA if ( $ENV{X_MYMETA} ) { if ( $ENV{X_MYMETA} eq 'JSON' ) { $self->Meta->write_mymeta_json; } else { $self->Meta->write_mymeta_yaml; } } return 1; } 1; Benchmark-Timer-0.7102/inc/Module/Install.pm0000644000076500000240000002411411246537675017720 0ustar coppitstaff#line 1 package Module::Install; # For any maintainers: # The load order for Module::Install is a bit magic. # It goes something like this... # # IF ( host has Module::Install installed, creating author mode ) { # 1. Makefile.PL calls "use inc::Module::Install" # 2. $INC{inc/Module/Install.pm} set to installed version of inc::Module::Install # 3. The installed version of inc::Module::Install loads # 4. inc::Module::Install calls "require Module::Install" # 5. The ./inc/ version of Module::Install loads # } ELSE { # 1. Makefile.PL calls "use inc::Module::Install" # 2. $INC{inc/Module/Install.pm} set to ./inc/ version of Module::Install # 3. The ./inc/ version of Module::Install loads # } use 5.005; use strict 'vars'; use vars qw{$VERSION $MAIN}; BEGIN { # All Module::Install core packages now require synchronised versions. # This will be used to ensure we don't accidentally load old or # different versions of modules. # This is not enforced yet, but will be some time in the next few # releases once we can make sure it won't clash with custom # Module::Install extensions. $VERSION = '0.91'; # Storage for the pseudo-singleton $MAIN = undef; *inc::Module::Install::VERSION = *VERSION; @inc::Module::Install::ISA = __PACKAGE__; } # Whether or not inc::Module::Install is actually loaded, the # $INC{inc/Module/Install.pm} is what will still get set as long as # the caller loaded module this in the documented manner. # If not set, the caller may NOT have loaded the bundled version, and thus # they may not have a MI version that works with the Makefile.PL. This would # result in false errors or unexpected behaviour. And we don't want that. my $file = join( '/', 'inc', split /::/, __PACKAGE__ ) . '.pm'; unless ( $INC{$file} ) { die <<"END_DIE" } Please invoke ${\__PACKAGE__} with: use inc::${\__PACKAGE__}; not: use ${\__PACKAGE__}; END_DIE # If the script that is loading Module::Install is from the future, # then make will detect this and cause it to re-run over and over # again. This is bad. Rather than taking action to touch it (which # is unreliable on some platforms and requires write permissions) # for now we should catch this and refuse to run. if ( -f $0 ) { my $s = (stat($0))[9]; # If the modification time is only slightly in the future, # sleep briefly to remove the problem. my $a = $s - time; if ( $a > 0 and $a < 5 ) { sleep 5 } # Too far in the future, throw an error. my $t = time; if ( $s > $t ) { die <<"END_DIE" } Your installer $0 has a modification time in the future ($s > $t). This is known to create infinite loops in make. Please correct this, then run $0 again. END_DIE } # Build.PL was formerly supported, but no longer is due to excessive # difficulty in implementing every single feature twice. if ( $0 =~ /Build.PL$/i ) { die <<"END_DIE" } Module::Install no longer supports Build.PL. It was impossible to maintain duel backends, and has been deprecated. Please remove all Build.PL files and only use the Makefile.PL installer. END_DIE # To save some more typing in Module::Install installers, every... # use inc::Module::Install # ...also acts as an implicit use strict. $^H |= strict::bits(qw(refs subs vars)); use Cwd (); use File::Find (); use File::Path (); use FindBin; sub autoload { my $self = shift; my $who = $self->_caller; my $cwd = Cwd::cwd(); my $sym = "${who}::AUTOLOAD"; $sym->{$cwd} = sub { my $pwd = Cwd::cwd(); if ( my $code = $sym->{$pwd} ) { # Delegate back to parent dirs goto &$code unless $cwd eq $pwd; } $$sym =~ /([^:]+)$/ or die "Cannot autoload $who - $sym"; my $method = $1; if ( uc($method) eq $method ) { # Do nothing return; } elsif ( $method =~ /^_/ and $self->can($method) ) { # Dispatch to the root M:I class return $self->$method(@_); } # Dispatch to the appropriate plugin unshift @_, ( $self, $1 ); goto &{$self->can('call')}; }; } sub import { my $class = shift; my $self = $class->new(@_); my $who = $self->_caller; unless ( -f $self->{file} ) { require "$self->{path}/$self->{dispatch}.pm"; File::Path::mkpath("$self->{prefix}/$self->{author}"); $self->{admin} = "$self->{name}::$self->{dispatch}"->new( _top => $self ); $self->{admin}->init; @_ = ($class, _self => $self); goto &{"$self->{name}::import"}; } *{"${who}::AUTOLOAD"} = $self->autoload; $self->preload; # Unregister loader and worker packages so subdirs can use them again delete $INC{"$self->{file}"}; delete $INC{"$self->{path}.pm"}; # Save to the singleton $MAIN = $self; return 1; } sub preload { my $self = shift; unless ( $self->{extensions} ) { $self->load_extensions( "$self->{prefix}/$self->{path}", $self ); } my @exts = @{$self->{extensions}}; unless ( @exts ) { @exts = $self->{admin}->load_all_extensions; } my %seen; foreach my $obj ( @exts ) { while (my ($method, $glob) = each %{ref($obj) . '::'}) { next unless $obj->can($method); next if $method =~ /^_/; next if $method eq uc($method); $seen{$method}++; } } my $who = $self->_caller; foreach my $name ( sort keys %seen ) { *{"${who}::$name"} = sub { ${"${who}::AUTOLOAD"} = "${who}::$name"; goto &{"${who}::AUTOLOAD"}; }; } } sub new { my ($class, %args) = @_; # ignore the prefix on extension modules built from top level. my $base_path = Cwd::abs_path($FindBin::Bin); unless ( Cwd::abs_path(Cwd::cwd()) eq $base_path ) { delete $args{prefix}; } return $args{_self} if $args{_self}; $args{dispatch} ||= 'Admin'; $args{prefix} ||= 'inc'; $args{author} ||= ($^O eq 'VMS' ? '_author' : '.author'); $args{bundle} ||= 'inc/BUNDLES'; $args{base} ||= $base_path; $class =~ s/^\Q$args{prefix}\E:://; $args{name} ||= $class; $args{version} ||= $class->VERSION; unless ( $args{path} ) { $args{path} = $args{name}; $args{path} =~ s!::!/!g; } $args{file} ||= "$args{base}/$args{prefix}/$args{path}.pm"; $args{wrote} = 0; bless( \%args, $class ); } sub call { my ($self, $method) = @_; my $obj = $self->load($method) or return; splice(@_, 0, 2, $obj); goto &{$obj->can($method)}; } sub load { my ($self, $method) = @_; $self->load_extensions( "$self->{prefix}/$self->{path}", $self ) unless $self->{extensions}; foreach my $obj (@{$self->{extensions}}) { return $obj if $obj->can($method); } my $admin = $self->{admin} or die <<"END_DIE"; The '$method' method does not exist in the '$self->{prefix}' path! Please remove the '$self->{prefix}' directory and run $0 again to load it. END_DIE my $obj = $admin->load($method, 1); push @{$self->{extensions}}, $obj; $obj; } sub load_extensions { my ($self, $path, $top) = @_; unless ( grep { ! ref $_ and lc $_ eq lc $self->{prefix} } @INC ) { unshift @INC, $self->{prefix}; } foreach my $rv ( $self->find_extensions($path) ) { my ($file, $pkg) = @{$rv}; next if $self->{pathnames}{$pkg}; local $@; my $new = eval { require $file; $pkg->can('new') }; unless ( $new ) { warn $@ if $@; next; } $self->{pathnames}{$pkg} = delete $INC{$file}; push @{$self->{extensions}}, &{$new}($pkg, _top => $top ); } $self->{extensions} ||= []; } sub find_extensions { my ($self, $path) = @_; my @found; File::Find::find( sub { my $file = $File::Find::name; return unless $file =~ m!^\Q$path\E/(.+)\.pm\Z!is; my $subpath = $1; return if lc($subpath) eq lc($self->{dispatch}); $file = "$self->{path}/$subpath.pm"; my $pkg = "$self->{name}::$subpath"; $pkg =~ s!/!::!g; # If we have a mixed-case package name, assume case has been preserved # correctly. Otherwise, root through the file to locate the case-preserved # version of the package name. if ( $subpath eq lc($subpath) || $subpath eq uc($subpath) ) { my $content = Module::Install::_read($subpath . '.pm'); my $in_pod = 0; foreach ( split //, $content ) { $in_pod = 1 if /^=\w/; $in_pod = 0 if /^=cut/; next if ($in_pod || /^=cut/); # skip pod text next if /^\s*#/; # and comments if ( m/^\s*package\s+($pkg)\s*;/i ) { $pkg = $1; last; } } } push @found, [ $file, $pkg ]; }, $path ) if -d $path; @found; } ##################################################################### # Common Utility Functions sub _caller { my $depth = 0; my $call = caller($depth); while ( $call eq __PACKAGE__ ) { $depth++; $call = caller($depth); } return $call; } sub _read { local *FH; if ( $] >= 5.006 ) { open( FH, '<', $_[0] ) or die "open($_[0]): $!"; } else { open( FH, "< $_[0]" ) or die "open($_[0]): $!"; } my $string = do { local $/; }; close FH or die "close($_[0]): $!"; return $string; } sub _readperl { my $string = Module::Install::_read($_[0]); $string =~ s/(?:\015{1,2}\012|\015|\012)/\n/sg; $string =~ s/(\n)\n*__(?:DATA|END)__\b.*\z/$1/s; $string =~ s/\n\n=\w+.+?\n\n=cut\b.+?\n+/\n\n/sg; return $string; } sub _readpod { my $string = Module::Install::_read($_[0]); $string =~ s/(?:\015{1,2}\012|\015|\012)/\n/sg; return $string if $_[0] =~ /\.pod\z/; $string =~ s/(^|\n=cut\b.+?\n+)[^=\s].+?\n(\n=\w+|\z)/$1$2/sg; $string =~ s/\n*=pod\b[^\n]*\n+/\n\n/sg; $string =~ s/\n*=cut\b[^\n]*\n+/\n\n/sg; $string =~ s/^\n+//s; return $string; } sub _write { local *FH; if ( $] >= 5.006 ) { open( FH, '>', $_[0] ) or die "open($_[0]): $!"; } else { open( FH, "> $_[0]" ) or die "open($_[0]): $!"; } foreach ( 1 .. $#_ ) { print FH $_[$_] or die "print($_[0]): $!"; } close FH or die "close($_[0]): $!"; } # _version is for processing module versions (eg, 1.03_05) not # Perl versions (eg, 5.8.1). sub _version ($) { my $s = shift || 0; my $d =()= $s =~ /(\.)/g; if ( $d >= 2 ) { # Normalise multipart versions $s =~ s/(\.)(\d{1,3})/sprintf("$1%03d",$2)/eg; } $s =~ s/^(\d+)\.?//; my $l = $1 || 0; my @v = map { $_ . '0' x (3 - length $_) } $s =~ /(\d{1,3})\D?/g; $l = $l . '.' . join '', @v if @v; return $l + 0; } sub _cmp ($$) { _version($_[0]) <=> _version($_[1]); } # Cloned from Params::Util::_CLASS sub _CLASS ($) { ( defined $_[0] and ! ref $_[0] and $_[0] =~ m/^[^\W\d]\w*(?:::\w+)*\z/s ) ? $_[0] : undef; } 1; # Copyright 2008 - 2009 Adam Kennedy. Benchmark-Timer-0.7102/lib/0000755000076500000240000000000011246540445014507 5ustar coppitstaffBenchmark-Timer-0.7102/lib/Benchmark/0000755000076500000240000000000011246540445016401 5ustar coppitstaffBenchmark-Timer-0.7102/lib/Benchmark/Timer.pm0000644000076500000240000004235211237670005020021 0ustar coppitstaffpackage Benchmark::Timer; require 5.005; use strict; use Carp; use Time::HiRes qw( gettimeofday tv_interval ); use vars qw($VERSION); $VERSION = sprintf "%d.%02d%02d", q/0.71.2/ =~ /(\d+)/g; use constant BEFORE => 0; use constant ELAPSED => 1; use constant LASTTAG => 2; use constant TAGS => 3; use constant SKIP => 4; use constant MINIMUM => 5; use constant SKIPCOUNT => 6; use constant CONFIDENCE => 7; use constant ERROR => 8; use constant STAT => 9; # ------------------------------------------------------------------------ # Constructor sub new { my $class = shift; my $self = []; bless $self, $class; return $self->reset(@_); } # ------------------------------------------------------------------------ # Public methods sub reset { my $self = shift; my %args = @_; $self->[BEFORE] = {}; # [ gettimeofday ] storage $self->[ELAPSED] = {}; # elapsed fractional seconds $self->[LASTTAG] = undef; # what the last tag was $self->[TAGS] = []; # keep list of tags in order seen $self->[SKIP] = 0; # how many samples to skip $self->[MINIMUM] = 1; # the minimum number of trails to run $self->[SKIPCOUNT] = {}; # trial skip storage delete $self->[CONFIDENCE]; # confidence factor delete $self->[ERROR]; # allowable error delete $self->[STAT]; # stat objects for each tag if(exists $args{skip}) { croak 'argument skip must be a non-negative integer' unless defined $args{skip} and $args{skip} !~ /\D/ and int $args{skip} == $args{skip}; $self->[SKIP] = $args{skip}; delete $args{skip}; } if(exists $args{minimum}) { croak 'argument minimum must be a non-negative integer' unless defined $args{minimum} and $args{minimum} !~ /\D/ and int $args{minimum} == $args{minimum}; croak 'argument minimum must greater than or equal to skip' unless defined $args{minimum} and $args{minimum} >= $self->[SKIP]; $self->[MINIMUM] = $args{minimum}; delete $args{minimum}; } my $confidence_is_valid = (defined $args{confidence} and $args{confidence} =~ /^\d*\.?\d*$/ and $args{confidence} > 0 and $args{confidence} < 100); my $error_is_valid = (defined $args{error} and $args{error} =~ /^\d*\.?\d*$/ and $args{error} > 0 and $args{error} < 100); if ($confidence_is_valid && !$error_is_valid || !$confidence_is_valid && $error_is_valid) { carp 'you must specify both confidence and error' } elsif ($confidence_is_valid && $error_is_valid) { $self->[CONFIDENCE] = $args{confidence}; delete $args{confidence}; $self->[ERROR] = $args{error}; delete $args{error}; # Demand load the module we need. We could just # require people to install it... croak 'Could not load the Statistics::PointEstimation module' unless eval "require Statistics::PointEstimation"; } if(%args) { carp 'skipping unknown arguments'; } return $self; } # In this routine we try hard to make the [ gettimeofday ] take place # as late as possible to minimize Heisenberg problems. :) sub start { my $self = shift; my $tag = shift || $self->[LASTTAG] || '_default'; $self->[LASTTAG] = $tag; if(exists $self->[SKIPCOUNT]->{$tag}) { if($self->[SKIPCOUNT]->{$tag} > 1) { $self->[SKIPCOUNT]->{$tag}--; } else { $self->[SKIPCOUNT]->{$tag} = 0; push @{$self->[BEFORE]->{$tag}}, [ gettimeofday ]; } } else { push @{$self->[TAGS]}, $tag; $self->[SKIPCOUNT]->{$tag} = $self->[SKIP] + 1; if($self->[SKIPCOUNT]->{$tag} > 1) { $self->[SKIPCOUNT]->{$tag}--; } else { $self->[SKIPCOUNT]->{$tag} = 0; $self->[BEFORE]->{$tag} = [ [ gettimeofday ] ] } } } sub stop { my $after = [ gettimeofday ]; # minimize overhead my $self = shift; my $tag = shift || $self->[LASTTAG] || '_default'; croak 'must call $t->start($tag) before $t->stop($tag)' unless exists $self->[SKIPCOUNT]->{$tag}; return if $self->[SKIPCOUNT]->{$tag} > 0; my $i = exists $self->[ELAPSED]->{$tag} ? scalar @{$self->[ELAPSED]->{$tag}} : 0; my $before = $self->[BEFORE]->{$tag}->[$i]; croak 'timer out of sync' unless defined $before; # Create a stats object if we need to if (defined $self->[CONFIDENCE] && !defined $self->[STAT]->{$tag}) { $self->[STAT]->{$tag} = Statistics::PointEstimation->new; $self->[STAT]->{$tag}->set_significance($self->[CONFIDENCE]); } my $elapsed = tv_interval($before, $after); if($i > 0) { push @{$self->[ELAPSED]->{$tag}}, $elapsed; } else { $self->[ELAPSED]->{$tag} = [ $elapsed ]; } $self->[STAT]->{$tag}->add_data($elapsed) if defined $self->[STAT]->{$tag}; return $elapsed; } sub need_more_samples { my $self = shift; my $tag = shift || $self->[LASTTAG] || '_default'; carp 'You must set the confidence and error in order to use need_more_samples' unless defined $self->[CONFIDENCE]; # In case this function is called before any trials are run return 1 if !defined $self->[STAT]->{$tag} || $self->[STAT]->{$tag}->count < $self->[MINIMUM]; # For debugging # printf STDERR "Average: %.5f +/- %.5f, Samples: %d\n", # $self->[STAT]->{$tag}->mean(), $self->[STAT]->{$tag}->delta(), # $self->[STAT]->{$tag}->count; # printf STDERR "Percent Error: %.5f > %.5f\n", # $self->[STAT]->{$tag}->delta() / $self->[STAT]->{$tag}->mean() * 100, # $self->[ERROR]; return (($self->[STAT]->{$tag}->delta() / $self->[STAT]->{$tag}->mean() * 100) > $self->[ERROR]); } sub report { my $self = shift; my $tag = shift || $self->[LASTTAG] || '_default'; unless(exists $self->[ELAPSED]->{$tag}) { carp join ' ', 'tag', $tag, 'still running'; return; } return $self->_report($tag); } sub reports { my $self = shift; if (wantarray) { my @reports; foreach my $tag (@{$self->[TAGS]}) { push @reports, $tag; push @reports, $self->report($tag); } return @reports; } else { my $report = ''; foreach my $tag (@{$self->[TAGS]}) { $report .= $self->report($tag); } return $report; } } sub _report { my $self = shift; my $tag = shift; unless(exists $self->[ELAPSED]->{$tag}) { return "Tag $tag is still running or has not completed its skipped runs, skipping\n"; } my $report = ''; my @times = @{$self->[ELAPSED]->{$tag}}; my $n = scalar @times; my $total = 0; $total += $_ foreach @times; if ($n == 1) { $report .= sprintf "\%d trial of \%s (\%s total)\n", $n, $tag, timestr($total); } else { $report .= sprintf "\%d trials of \%s (\%s total), \%s/trial\n", $n, $tag, timestr($total), timestr($total / $n); } if (defined $self->[STAT]->{$tag}) { my $delta = 0; $delta = $self->[STAT]->{$tag}->delta() if defined $self->[STAT]->{$tag}->delta(); $report .= sprintf "Error: +/- \%.5f with \%s confidence\n", $delta, $self->[CONFIDENCE]; } return $report; } sub result { my $self = shift; my $tag = shift || $self->[LASTTAG] || '_default'; unless(exists $self->[ELAPSED]->{$tag}) { carp join ' ', 'tag', $tag, 'still running'; return; } my @times = @{$self->[ELAPSED]->{$tag}}; my $total = 0; $total += $_ foreach @times; return $total / @times; } sub results { my $self = shift; my @results; foreach my $tag (@{$self->[TAGS]}) { push @results, $tag; push @results, $self->result($tag); } return wantarray ? @results : \@results; } sub data { my $self = shift; my $tag = shift; my @results; if($tag) { if(exists $self->[ELAPSED]->{$tag}) { @results = @{$self->[ELAPSED]->{$tag}}; } else { @results = (); } } else { @results = map { ( $_ => $self->[ELAPSED]->{$_} || [] ) } @{$self->[TAGS]}; } return wantarray ? @results : \@results; } # ------------------------------------------------------------------------ # Internal utility subroutines # timestr($sec) takes a floating-point number of seconds and formats # it in a sensible way, commifying large numbers of seconds, and # converting to milliseconds if it makes sense. Since Time::HiRes has # at most microsecond resolution, no attempt is made to convert into # anything below that. A unit string is appended to the number. sub timestr { my $sec = shift; my $retstr; if($sec >= 1_000) { $retstr = commify(int $sec) . 's'; } elsif($sec >= 1) { $retstr = sprintf $sec == int $sec ? '%ds' : '%0.3fs', $sec; } elsif($sec >= 0.001) { my $ms = $sec * 1_000; $retstr = sprintf $ms == int $ms ? '%dms' : '%0.3fms', $ms; } elsif($sec >= 0.000001) { $retstr = sprintf '%dus', $sec * 1_000_000; } else { # I'll have whatever real-time OS she's having $retstr = $sec . 's'; } $retstr; } # commify($num) inserts a grouping comma according to en-US standards # for numbers larger than 1000. For example, the integer 123456 would # be written 123,456. Any fractional part is left untouched. sub commify { my $num = shift; return unless $num =~ /\d/; return $num if $num < 1_000; my $ip = int $num; my($fp) = ($num =~ /\.(\d+)/); $ip =~ s/(\d\d\d)$/,$1/; 1 while $ip =~ s/(\d)(\d\d\d),/$1,$2,/; return $fp ? join '.', $ip, $fp : $ip; } # ------------------------------------------------------------------------ # Return true for a valid Perl include 1; # --------------------------------------------------------------------------- =head1 NAME Benchmark::Timer - Benchmarking with statistical confidence =head1 SYNOPSIS # Non-statistical usage use Benchmark::Timer; $t = Benchmark::Timer->new(skip => 1); for(1 .. 1000) { $t->start('tag'); &long_running_operation(); $t->stop('tag'); } print $t->report; # -------------------------------------------------------------------- # Statistical usage use Benchmark::Timer; $t = Benchmark::Timer->new(skip => 1, confidence => 97.5, error => 2); while($t->need_more_samples('tag')) { $t->start('tag'); &long_running_operation(); $t->stop('tag'); } print $t->report; =head1 DESCRIPTION The Benchmark::Timer class allows you to time portions of code conveniently, as well as benchmark code by allowing timings of repeated trials. It is perfect for when you need more precise information about the running time of portions of your code than the Benchmark module will give you, but don't want to go all out and profile your code. The methodology is simple; create a Benchmark::Timer object, and wrap portions of code that you want to benchmark with C and C method calls. You can supply a tag to those methods if you plan to time multiple portions of code. If you provide error and confidence values, you can also use C to determine, statistically, whether you need to collect more data. After you have run your code, you can obtain information about the running time by calling the C method, or get a descriptive benchmark report by calling C. If you run your code over multiple trials, the average time is reported. This is wonderful for benchmarking time-critical portions of code in a rigorous way. You can also optionally choose to skip any number of initial trials to cut down on initial case irregularities. =head1 METHODS In all of the following methods, C<$tag> refers to the user-supplied name of the code being timed. Unless otherwise specified, $tag defaults to the tag of the last call to C, or "_default" if C was not previously called with a tag. =over 4 =item $t = Benchmark::Timer->new( [options] ); Constructor for the Benchmark::Timer object; returns a reference to a timer object. Takes the following named arguments: =over 4 =item skip The number of trials (if any) to skip before recording timing information. =item minimum The minimum number of trials to run. =item error A percentage between 0 and 100 which indicates how much error you are willing to tolerate in the average time measured by the benchmark. For example, a value of 1 means that you want the reported average time to be within 1% of the real average time. C will use this value to determine when it is okay to stop collecting data. If you specify an error you must also specify a confidence. =item confidence A percentage between 0 and 100 which indicates how confident you want to be in the error measured by the benchmark. For example, a value of 97.5 means that you want to be 97.5% confident that the real average time is within the error margin you have specified. C will use this value to compute the estimated error for the collected data, so that it can determine when it is okay to stop. If you specify a confidence you must also specify an error. =back =item $t->reset; Reset the timer object to the pristine state it started in. Erase all memory of tags and any previously accumulated timings. Returns a reference to the timer object. It takes the same arguments the constructor takes. =item $t->start($tag); Record the current time so that when C is called, we can calculate an elapsed time. =item $t->stop($tag); Record timing information. If $tag is supplied, it must correspond to one given to a previously called C call. It returns the elapsed time in milliseconds. C croaks if the timer gets out of sync (e.g. the number of Cs does not match the number of Cs.) =item $t->need_more_samples($tag); Compute the estimated error in the average of the data collected thus far, and return true if that error exceeds the user-specified error. If a $tag is supplied, it must correspond to one given to a previously called C call. This routine assumes that the data are normally distributed. =item $t->report($tag); Returns a string containing a simple report on the collected timings for $tag. This report contains the number of trials run, the total time taken, and, if more than one trial was run, the average time needed to run one trial and error information. C will complain (via a warning) if a tag is still active. =item $t->reports; In a scalar context, returns a string containing a simple report on the collected timings for all tags. The report is a concatenation of the individual tag reports, in the original tag order. In an list context, returns a hash keyed by tag and containing reports for each tag. The return value is actually an array, so that the original tag order is preserved if you assign to an array instead of a hash. C will complain (via a warning) if a tag is still active. =item $t->result($tag); Return the time it took for $tag to elapse, or the mean time it took for $tag to elapse once, if $tag was used to time code more than once. C will complain (via a warning) if a tag is still active. =item $t->results; Returns the timing data as a hash keyed on tags where each value is the time it took to run that code, or the average time it took, if that code ran more than once. In scalar context it returns a reference to that hash. The return value is actually an array, so that the original tag order is preserved if you assign to an array instead of a hash. =item $t->data($tag), $t->data; These methods are useful if you want to recover the full internal timing data to roll your own reports. If called with a $tag, returns the raw timing data for that $tag as an array (or a reference to an array if called in scalar context). This is useful for feeding to something like the Statistics::Descriptive package. If called with no arguments, returns the raw timing data as a hash keyed on tags, where the values of the hash are lists of timings for that code. In scalar context, it returns a reference to that hash. As with C, the data is internally represented as an array so you can recover the original tag order by assigning to an array instead of a hash. =back =head1 BUGS Benchmarking is an inherently futile activity, fraught with uncertainty not dissimilar to that experienced in quantum mechanics. But things are a little better if you apply statistics. =head1 LICENSE This code is distributed under the GNU General Public License (GPL). See the file LICENSE in the distribution, http://www.opensource.org/gpl-license.html, and http://www.opensource.org/. =head1 AUTHOR The original code (written before April 20, 2001) was written by Andrew Ho Eandrew@zeuscat.comE, and is copyright (c) 2000-2001 Andrew Ho. Versions up to 0.5 are distributed under the same terms as Perl. Maintenance of this module is now being done by David Coppit Edavid@coppit.orgE. =head1 SEE ALSO L, L, L, L =cut Benchmark-Timer-0.7102/LICENSE0000644000076500000240000004313111037106751014744 0ustar coppitstaff GNU GENERAL PUBLIC LICENSE Version 2, June 1991 Copyright (C) 1989, 1991 Free Software Foundation, Inc. 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. Preamble The licenses for most software are designed to take away your freedom to share and change it. By contrast, the GNU General Public License is intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users. This General Public License applies to most of the Free Software Foundation's software and to any other program whose authors commit to using it. (Some other Free Software Foundation software is covered by the GNU Library General Public License instead.) You can apply it to your programs, too. When we speak of free software, we are referring to freedom, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for this service if you wish), that you receive source code or can get it if you want it, that you can change the software or use pieces of it in new free programs; and that you know you can do these things. To protect your rights, we need to make restrictions that forbid anyone to deny you these rights or to ask you to surrender the rights. These restrictions translate to certain responsibilities for you if you distribute copies of the software, or if you modify it. For example, if you distribute copies of such a program, whether gratis or for a fee, you must give the recipients all the rights that you have. You must make sure that they, too, receive or can get the source code. And you must show them these terms so they know their rights. We protect your rights with two steps: (1) copyright the software, and (2) offer you this license which gives you legal permission to copy, distribute and/or modify the software. Also, for each author's protection and ours, we want to make certain that everyone understands that there is no warranty for this free software. If the software is modified by someone else and passed on, we want its recipients to know that what they have is not the original, so that any problems introduced by others will not reflect on the original authors' reputations. Finally, any free program is threatened constantly by software patents. We wish to avoid the danger that redistributors of a free program will individually obtain patent licenses, in effect making the program proprietary. To prevent this, we have made it clear that any patent must be licensed for everyone's free use or not licensed at all. The precise terms and conditions for copying, distribution and modification follow. GNU GENERAL PUBLIC LICENSE TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 0. This License applies to any program or other work which contains a notice placed by the copyright holder saying it may be distributed under the terms of this General Public License. The "Program", below, refers to any such program or work, and a "work based on the Program" means either the Program or any derivative work under copyright law: that is to say, a work containing the Program or a portion of it, either verbatim or with modifications and/or translated into another language. (Hereinafter, translation is included without limitation in the term "modification".) Each licensee is addressed as "you". Activities other than copying, distribution and modification are not covered by this License; they are outside its scope. The act of running the Program is not restricted, and the output from the Program is covered only if its contents constitute a work based on the Program (independent of having been made by running the Program). Whether that is true depends on what the Program does. 1. You may copy and distribute verbatim copies of the Program's source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice and disclaimer of warranty; keep intact all the notices that refer to this License and to the absence of any warranty; and give any other recipients of the Program a copy of this License along with the Program. You may charge a fee for the physical act of transferring a copy, and you may at your option offer warranty protection in exchange for a fee. 2. You may modify your copy or copies of the Program or any portion of it, thus forming a work based on the Program, and copy and distribute such modifications or work under the terms of Section 1 above, provided that you also meet all of these conditions: a) You must cause the modified files to carry prominent notices stating that you changed the files and the date of any change. b) You must cause any work that you distribute or publish, that in whole or in part contains or is derived from the Program or any part thereof, to be licensed as a whole at no charge to all third parties under the terms of this License. c) If the modified program normally reads commands interactively when run, you must cause it, when started running for such interactive use in the most ordinary way, to print or display an announcement including an appropriate copyright notice and a notice that there is no warranty (or else, saying that you provide a warranty) and that users may redistribute the program under these conditions, and telling the user how to view a copy of this License. (Exception: if the Program itself is interactive but does not normally print such an announcement, your work based on the Program is not required to print an announcement.) These requirements apply to the modified work as a whole. If identifiable sections of that work are not derived from the Program, and can be reasonably considered independent and separate works in themselves, then this License, and its terms, do not apply to those sections when you distribute them as separate works. But when you distribute the same sections as part of a whole which is a work based on the Program, the distribution of the whole must be on the terms of this License, whose permissions for other licensees extend to the entire whole, and thus to each and every part regardless of who wrote it. Thus, it is not the intent of this section to claim rights or contest your rights to work written entirely by you; rather, the intent is to exercise the right to control the distribution of derivative or collective works based on the Program. In addition, mere aggregation of another work not based on the Program with the Program (or with a work based on the Program) on a volume of a storage or distribution medium does not bring the other work under the scope of this License. 3. You may copy and distribute the Program (or a work based on it, under Section 2) in object code or executable form under the terms of Sections 1 and 2 above provided that you also do one of the following: a) Accompany it with the complete corresponding machine-readable source code, which must be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange; or, b) Accompany it with a written offer, valid for at least three years, to give any third party, for a charge no more than your cost of physically performing source distribution, a complete machine-readable copy of the corresponding source code, to be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange; or, c) Accompany it with the information you received as to the offer to distribute corresponding source code. (This alternative is allowed only for noncommercial distribution and only if you received the program in object code or executable form with such an offer, in accord with Subsection b above.) The source code for a work means the preferred form of the work for making modifications to it. For an executable work, complete source code means all the source code for all modules it contains, plus any associated interface definition files, plus the scripts used to control compilation and installation of the executable. However, as a special exception, the source code distributed need not include anything that is normally distributed (in either source or binary form) with the major components (compiler, kernel, and so on) of the operating system on which the executable runs, unless that component itself accompanies the executable. If distribution of executable or object code is made by offering access to copy from a designated place, then offering equivalent access to copy the source code from the same place counts as distribution of the source code, even though third parties are not compelled to copy the source along with the object code. 4. You may not copy, modify, sublicense, or distribute the Program except as expressly provided under this License. Any attempt otherwise to copy, modify, sublicense or distribute the Program is void, and will automatically terminate your rights under this License. However, parties who have received copies, or rights, from you under this License will not have their licenses terminated so long as such parties remain in full compliance. 5. You are not required to accept this License, since you have not signed it. However, nothing else grants you permission to modify or distribute the Program or its derivative works. These actions are prohibited by law if you do not accept this License. Therefore, by modifying or distributing the Program (or any work based on the Program), you indicate your acceptance of this License to do so, and all its terms and conditions for copying, distributing or modifying the Program or works based on it. 6. Each time you redistribute the Program (or any work based on the Program), the recipient automatically receives a license from the original licensor to copy, distribute or modify the Program subject to these terms and conditions. You may not impose any further restrictions on the recipients' exercise of the rights granted herein. You are not responsible for enforcing compliance by third parties to this License. 7. If, as a consequence of a court judgment or allegation of patent infringement or for any other reason (not limited to patent issues), conditions are imposed on you (whether by court order, agreement or otherwise) that contradict the conditions of this License, they do not excuse you from the conditions of this License. If you cannot distribute so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not distribute the Program at all. For example, if a patent license would not permit royalty-free redistribution of the Program by all those who receive copies directly or indirectly through you, then the only way you could satisfy both it and this License would be to refrain entirely from distribution of the Program. If any portion of this section is held invalid or unenforceable under any particular circumstance, the balance of the section is intended to apply and the section as a whole is intended to apply in other circumstances. It is not the purpose of this section to induce you to infringe any patents or other property right claims or to contest validity of any such claims; this section has the sole purpose of protecting the integrity of the free software distribution system, which is implemented by public license practices. Many people have made generous contributions to the wide range of software distributed through that system in reliance on consistent application of that system; it is up to the author/donor to decide if he or she is willing to distribute software through any other system and a licensee cannot impose that choice. This section is intended to make thoroughly clear what is believed to be a consequence of the rest of this License. 8. If the distribution and/or use of the Program is restricted in certain countries either by patents or by copyrighted interfaces, the original copyright holder who places the Program under this License may add an explicit geographical distribution limitation excluding those countries, so that distribution is permitted only in or among countries not thus excluded. In such case, this License incorporates the limitation as if written in the body of this License. 9. The Free Software Foundation may publish revised and/or new versions of the General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. Each version is given a distinguishing version number. If the Program specifies a version number of this License which applies to it and "any later version", you have the option of following the terms and conditions either of that version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of this License, you may choose any version ever published by the Free Software Foundation. 10. If you wish to incorporate parts of the Program into other free programs whose distribution conditions are different, write to the author to ask for permission. For software which is copyrighted by the Free Software Foundation, write to the Free Software Foundation; we sometimes make exceptions for this. Our decision will be guided by the two goals of preserving the free status of all derivatives of our free software and of promoting the sharing and reuse of software generally. NO WARRANTY 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. END OF TERMS AND CONDITIONS How to Apply These Terms to Your New Programs If you develop a new program, and you want it to be of the greatest possible use to the public, the best way to achieve this is to make it free software which everyone can redistribute and change under these terms. To do so, attach the following notices to the program. It is safest to attach them to the start of each source file to most effectively convey the exclusion of warranty; and each file should have at least the "copyright" line and a pointer to where the full notice is found. Copyright (C) This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA Also add information on how to contact you by electronic and paper mail. If the program is interactive, make it output a short notice like this when it starts in an interactive mode: Gnomovision version 69, Copyright (C) year name of author Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'. This is free software, and you are welcome to redistribute it under certain conditions; type `show c' for details. The hypothetical commands `show w' and `show c' should show the appropriate parts of the General Public License. Of course, the commands you use may be called something other than `show w' and `show c'; they could even be mouse-clicks or menu items--whatever suits your program. You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the program, if necessary. Here is a sample; alter the names: Yoyodyne, Inc., hereby disclaims all copyright interest in the program `Gnomovision' (which makes passes at compilers) written by James Hacker. , 1 April 1989 Ty Coon, President of Vice This General Public License does not permit incorporating your program into proprietary programs. If your program is a subroutine library, you may consider it more useful to permit linking proprietary applications with the library. If this is what you want to do, use the GNU Library General Public License instead of this License. Benchmark-Timer-0.7102/Makefile.PL0000644000076500000240000000065311040670120015701 0ustar coppitstaff#!/usr/bin/perl use strict; use inc::Module::Install; all_from ('lib/Benchmark/Timer.pm'); requires ( 'Time::HiRes' => 0, ); test_requires ( 'Test::More' => 0, ); check_optional ( 'Statistics::PointEstimation' => 0, "Install Statistics::PointEstimation for statistical sampling support\n"); no_index ('delta.pl'); WriteAll(); Benchmark-Timer-0.7102/MANIFEST0000644000076500000240000000073611037107051015066 0ustar coppitstaffCHANGES LICENSE MANIFEST Makefile.PL README delta.pl # The module files lib/Benchmark/Timer.pm # Tests t/01_basic.t t/02_skip.t t/03_statistical.t t/04_reports.t t/99_errors.t # Module::Install extensions inc/Module/Install.pm inc/Module/Install/Base.pm inc/Module/Install/Can.pm inc/Module/Install/CheckOptional.pm inc/Module/Install/Fetch.pm inc/Module/Install/Makefile.pm inc/Module/Install/Metadata.pm inc/Module/Install/Win32.pm inc/Module/Install/WriteAll.pm META.yml Benchmark-Timer-0.7102/META.yml0000644000076500000240000000113311246537675015223 0ustar coppitstaff--- abstract: 'Benchmarking with statistical confidence' author: - '-2001 Andrew Ho.' build_requires: ExtUtils::MakeMaker: 6.42 Test::More: 0 configure_requires: ExtUtils::MakeMaker: 6.42 distribution_type: module generated_by: 'Module::Install version 0.91' license: gpl meta-spec: url: http://module-build.sourceforge.net/META-spec-v1.4.html version: 1.4 module_name: Benchmark::Timer name: Benchmark-Timer no_index: delta.pl: [] directory: - inc - t requires: Time::HiRes: 0 perl: 5.005 resources: license: http://opensource.org/licenses/gpl-license.php version: 0.7102 Benchmark-Timer-0.7102/README0000644000076500000240000000405611240527135014621 0ustar coppitstaffBenchmark::Timer - Benchmarking with statistical confidence Perl extension to benchmark code, with or without statistical confidence. MODULE DEPENDENCIES To use this module, you will need to install: - Time::HiRes If you intend on using the statistical features, you will also need to install: - Statistics::PointEstimation. To test this module, you will need to install: - Test::More INSTALLATION To install this package, change to the directory where you unarchived this distribution and type the following: perl Makefile.PL make make test make install You can install this package into a non-default location by appending one of the following to the "perl Makefile.PL" command: - "PREFIX=/installation/path" (for installation into a custom location), - "INSTALLDIRS=site" (for installation into site-specific Perl directories) - "INSTALLDIRS=perl" (for installation into standard Perl directories). If you make the installation into your own directory, then remember that you must tell perl where to search for modules before trying to 'use' them. For example: use lib '/home/userid/lib'; use Benchmark::Timer; During the 'make test', the statistical test may take some time to run, depending on how accurate "sleep(1)" is on your system. The normal time is less than 5 seconds. DOCUMENTATION Just "perldoc Benchmark::Timer". After installation on Unix systems, you can also do "man Benchmark::Timer". HOMEPAGE The CPAN Page: http://search.cpan.org/dist/Benchmark-Timer/ The Google Code page: http://code.google.com/p/benchmark-timer/ REPORTING BUGS http://code.google.com/p/benchmark-timer/issues/entry COPYRIGHT Copyright (c) 2001-2002 Andrew Ho. Copyright (c) 2004 David Coppit. All rights reserved, save those granted by the license. LICENSE This code is distributed under the GNU General Public License (GPL). See the file LICENSE in the distribution, http://www.opensource.org/gpl-license.html, and http://www.opensource.org/. AUTHOR David Coppit (current maintainer) Andrew Ho (original author) Benchmark-Timer-0.7102/t/0000755000076500000240000000000011246540445014204 5ustar coppitstaffBenchmark-Timer-0.7102/t/01_basic.t0000755000076500000240000000306611037106750015755 0ustar coppitstaff# ======================================================================== # t/01_basic.t - ensure that Benchmark::Timer object can be created, used # Andrew Ho (andrew@zeuscat.com) # # Test basic usage of the Benchmark::Timer library. # # Because timings will differ from system to system, we can't actually # test the functionality of the module. So we just test that all the # method calls run without triggering exceptions. # # This script is intended to be run as a target of Test::Harness. # # Last modified April 20, 2001 # ======================================================================== use strict; use Test::More tests => 11; # 1 BEGIN { use_ok( 'Benchmark::Timer') } # ------------------------------------------------------------------------ # Basic tests of the Benchmark::Timer library. my $t = Benchmark::Timer->new; #2 ok(defined $t, 'Construct Benchmark::Timer'); $t->reset; #3 ok(1, 'reset'); $t->start('tag'); $t->stop; #4 ok(1, 'Start/stop a tag'); my $result = $t->result('tag'); #5 isnt($result, 0, 'Nonzero single result'); my @results = $t->results; #6 is(scalar @results, 2, 'Multiple results'); my $results = $t->results; #7 isa_ok($results, 'ARRAY', 'Array ref results'); my @data = $t->data('tag'); #8 is(scalar @data, 1, 'tag data array'); my $data = $t->data('tag'); #9 isa_ok($data, 'ARRAY', 'Array ref data'); @data = $t->data; #10 is(scalar @data, 2, 'all tags data array'); $data = $t->data; #11 isa_ok($data, 'ARRAY', 'all tags data ref'); # ======================================================================== __END__ Benchmark-Timer-0.7102/t/02_skip.t0000755000076500000240000000462711037106750015647 0ustar coppitstaff# ======================================================================== # t/02_skip.t - test skip functionality in Benchmark::Timer # Andrew Ho (andrew@zeuscat.com) # # Test the skip functionality in Benchmark::Timer, where you can provide # a parameter named skip to the constructor to skip that many trials # for all timings. This is useful for throwing away the first n of m # trials where m is large. # # This script is intended to be run as a target of Test::Harness. # # Last modified April 20, 2001 # ======================================================================== use strict; use Test::More tests => 5; use Benchmark::Timer; # ------------------------------------------------------------------------ # Test that a Benchmark::Timer created with a zero skip functions the # same as a Benchmark::Timer created without a skip at all. my $t1 = Benchmark::Timer->new; my $t2 = Benchmark::Timer->new(skip => 0); $t1->reset; $t2->reset; for(1 .. 10) { $t1->start('tag1'); $t2->start('tag2'); $t1->stop; $t2->stop; } my @r1 = $t1->data('tag1'); my @r2 = $t2->data('tag2'); # 1 is(scalar @r1, scalar @r2, 'Data size two tags'); # ------------------------------------------------------------------------ # Skip 1 trial, get n - 1 trials total. my $n = 10; my $t = Benchmark::Timer->new(skip => 1); for(1 .. $n) { $t->start('tag'); $t->stop; } my @r = $t->data('tag'); # 2 is(scalar @r, $n-1, 'Data size skip 1'); # ------------------------------------------------------------------------ # Skip n - 1 trials, get 1 trial total. $n = 10; undef $t; $t = Benchmark::Timer->new(skip => $n - 1); for(1 .. $n) { $t->start('tag'); $t->stop; } @r = $t->data('tag'); # 3 is(scalar @r, 1, 'Data size 1 trial only'); # ------------------------------------------------------------------------ # Skip n trials, get no trials at all. $n = 10; undef $t; $t = Benchmark::Timer->new(skip => $n); for(1 .. $n) { $t->start('tag'); $t->stop; } @r = $t->data('tag'); # 4 is(scalar @r, 0, 'Data size no trials'); # ------------------------------------------------------------------------ # Skip n + 1 trials, also get no trials at all. $n = 10; undef $t; $t = Benchmark::Timer->new(skip => $n + 1); for(1 .. $n) { $t->start('tag'); $t->stop; } @r = $t->data('tag'); # 5 is(scalar @r, 0, 'Data size no trials (n+1)'); # ======================================================================== __END__ Benchmark-Timer-0.7102/t/03_statistical.t0000755000076500000240000000322011037106750017212 0ustar coppitstaff# ======================================================================== # t/03_statistical.t - ensure that Benchmark::Timer object can be created, # used for statistical measurement # David Coppit # # Test statistical usage of the Benchmark::Timer library. # # Because timings will differ from system to system, we can't actually # test the functionality of the module. So we just test that all the # method calls run without triggering exceptions. # # This script is intended to be run as a target of Test::Harness. # # Last modified September 2, 2004 # ======================================================================== use strict; use Test::More; # ------------------------------------------------------------------------ unless (eval 'require Statistics::PointEstimation') { plan skip_all => 'statsistics::PointEstimation is not installed'; exit; } plan tests => 4; # ------------------------------------------------------------------------ # Statistical tests of the Benchmark::Timer library. use Benchmark::Timer; use Time::HiRes qw( usleep ); my $t = Benchmark::Timer->new(minimum => 3, confidence => 97.5, error => .5); # 1 ok(defined $t, 'Created Benchmark::Timer'); my $time = time; while( $t->need_more_samples('tag') ) { $t->start('tag'); sleep 1; $t->stop('tag'); print $t->report; } # 2 ok(1, 'Finished collecting data'); my $result = $t->result('tag'); # 3 ok(defined $result, 'Statistical results'); my @data = $t->data('tag'); use Data::Dumper; print "Data:\n", Dumper \@data; # 4 ok(@data >= 3, 'More than 2 trials'); # ======================================================================== __END__ Benchmark-Timer-0.7102/t/04_reports.t0000755000076500000240000000261011037106750016367 0ustar coppitstaffuse strict; use Test::More tests => 10; use Benchmark::Timer; # ------------------------------------------------------------------------ # Basic tests of the Benchmark::Timer library. my $t = Benchmark::Timer->new; my ($report, %reports); $t->start('tag1'); $t->stop; #1 ok(1, 'Start/stop a tag'); $report = $t->report; #2 like($report, qr/^1 trial of tag1 \(.* total\)\n$/, 'Single timing report'); $t->start('tag1'); $t->stop; $report = $t->report; #3 like($report, qr/^2 trials of tag1 \(.* total\), .*\/trial\n$/, 'Multiple timing report'); $report = $t->reports; #4 like($report, qr/^2 trials of tag1 \(.* total\), .*\/trial\n$/, 'Multiple timing report--scalar'); %reports = $t->reports; #4 is(scalar keys %reports, 1, 'Multiple timing report--hash'); $t->start('tag2'); $t->stop; $report = $t->report; #6 like($report, qr/^1 trial of tag2 \(.* total\)\n$/, 'Single timing report--last tag used'); $report = $t->reports; #7 like($report, qr/^2 trials of tag1 \(.* total\), .*\/trial\n1 trial of tag2 \(.* total\)\n$/, 'Multiple timing report--scalar'); %reports = $t->reports; #8 is(scalar keys %reports, 2, 'Multiple timing report--hash'); #9 like($reports{'tag1'}, qr/^2 trials of tag1 \(.* total\), .*\/trial\n$/, 'Multiple timing report--hash element 1'); #10 like($reports{'tag2'}, qr/^1 trial of tag2 \(.* total\)\n$/, 'Multiple timing report--hash element 2'); Benchmark-Timer-0.7102/t/99_errors.t0000755000076500000240000000366211037106750016233 0ustar coppitstaff# ======================================================================== # t/99_errors.t - test fatal and warn error cases # Andrew Ho (andrew@zeuscat.com) # # In this test we exercise fatal conditions and check that they really # do die with an error status. # # This script is intended to be run as a target of Test::Harness. # # Last modified April 20, 2001 # ======================================================================== use strict; use Test::More tests => 6; use Benchmark::Timer; # ------------------------------------------------------------------------ # Check fatal condition where you call stop() but start() has NEVER run eval { my $t = Benchmark::Timer->new; $t->stop; }; # 1 like($@, qr/must call/, 'Must call start first'); # ------------------------------------------------------------------------ # Check fatal out of sync condition eval { my $t = Benchmark::Timer->new; $t->start('tag'); $t->stop; $t->stop; }; # 2 like($@, qr/out of sync/, 'Out of sync'); # ------------------------------------------------------------------------ # Check fatal bad skip argument handling eval { my $t = Benchmark::Timer->new( skip => undef ) }; # 3 like($@, qr/argument skip/, 'Argument skip 1'); eval { my $t = Benchmark::Timer->new( skip => 'foo' ) }; # 4 like($@, qr/argument skip/, 'Argument skip 2'); eval { my $t = Benchmark::Timer->new( skip => -1 ) }; # 5 like($@, qr/argument skip/, 'Argument skip 3'); # ------------------------------------------------------------------------ # Check warning on unrecognized arguments use vars qw($last_warning); undef $last_warning; { local $SIG{__WARN__} = sub { $last_warning = shift }; my $weird_arg = '__this_is_not_a_valid_argument__'; my $t = Benchmark::Timer->new( $weird_arg => undef ); # 6 like($last_warning, qr/skipping unknown/, 'Invalid argument'); } # ======================================================================== __END__