Data-Miscellany-1.100850000755000765000024 011353077032 14447 5ustar00marcelstaff000000000000Changes000644000765000024 213311353077032 16021 0ustar00marcelstaff000000000000Data-Miscellany-1.100850Revision history for Perl extension Data-Miscellany 1.100850 2010-03-26 10:27:51 Europe/Vienna - converted the distribution to Dist::Zilla-style 0.04 Sun 2009.12.06 23:44:41 CET (Marcel Gruenauer ) - Changed dist style and Changes back to standard. People didn't like it - the nail that sticks out gets hammered down. - Added standard test files; this will also help with CPANTS. - reduced dependencies using author tests - better dist engineering (INSTALL, README, README.mkdn etc.) 0.03 Thu, 29 May 2008 12:03:21 -0000 (Marcel Gruenauer ) - Converted Changes file to YAML style - .shipit: added Twitter step - Makefile.PL: added auto_install() and process_templates() - lib/*: converted to template - updated MANIFEST - updated t/perlcriticrc - .shipit: fixed svk.tagpattern - tags: NEWFEATURE 0.02 Thu, 18 Oct 2007 10:09:39 +0200 (Marcel Gruenauer ) - fixed version requirement of Test::More 0.01 Thu, 04 Oct 2007 19:16:00 +0200 (Marcel Gruenauer ) - original version dist.ini000644000765000024 23511353077032 16153 0ustar00marcelstaff000000000000Data-Miscellany-1.100850name = Data-Miscellany author = Marcel Gruenauer license = Perl_5 copyright_holder = Marcel Gruenauer copyright_year = 2004 [@MARCEL] Data000755000765000024 011353077032 16007 5ustar00marcelstaff000000000000Data-Miscellany-1.100850/libMiscellany.pm000644000765000024 2640011353077032 20626 0ustar00marcelstaff000000000000Data-Miscellany-1.100850/lib/Datause 5.008; use strict; use warnings; package Data::Miscellany; our $VERSION = '1.100850'; # ABSTRACT: Collection of miscellaneous subroutines use Exporter qw(import); our %EXPORT_TAGS = ( util => [ qw/ set_push flex_grep flatten is_deeply eq_array eq_hash is_defined value_of str_value_of class_map trim / ], ); our @EXPORT_OK = @{ $EXPORT_TAGS{all} = [ map { @$_ } values %EXPORT_TAGS ] }; # Like push, but only pushes the item(s) onto the list indicated by the list # ref (first param) if the list doesn't already contain it. # Originally, I used Storable::freeze to see whether two structures where the # same, but this didn't work for all cases, so I switched to is_deeply(). sub set_push (\@@) { my ($list, @items) = @_; ITEM: for my $item (@items) { for my $el (@$list) { next ITEM if is_deeply($item, $el); } push @$list, $item; } } sub flatten { ref $_[0] eq 'ARRAY' ? @{ $_[0] } : defined $_[0] ? @_ : (); } # Start of code adapted from Test::More # # In set_push and other places within the framework, we need to compare # structures deeply, so here are the relevant methods copied from Test::More # with the test-specific code removed. sub is_deeply { my ($this, $that) = @_; return _deep_check($this, $that) if ref $this && ref $that; return $this eq $that if defined $this && defined $that; # undef only matches undef and nothing else return !defined $this && !defined $that; } sub _deep_check { my ($e1, $e2) = @_; # Quiet uninitialized value warnings when comparing undefs. local $^W = 0; return 1 if $e1 eq $e2; return eq_array($e1, $e2) if UNIVERSAL::isa($e1, 'ARRAY') && UNIVERSAL::isa($e2, 'ARRAY'); return eq_hash($e1, $e2) if UNIVERSAL::isa($e1, 'HASH') && UNIVERSAL::isa($e2, 'HASH'); return _deep_check($$e1, $$e2) if UNIVERSAL::isa($e1, 'REF') && UNIVERSAL::isa($e2, 'REF'); return _deep_check($$e1, $$e2) if UNIVERSAL::isa($e1, 'SCALAR') && UNIVERSAL::isa($e2, 'SCALAR'); return 0; } sub eq_array { my ($a1, $a2) = @_; return 1 if $a1 eq $a2; return 0 unless $#$a1 == $#$a2; for (0 .. $#$a1) { return 0 unless is_deeply($a1->[$_], $a2->[$_]); } return 1; } sub eq_hash { my ($a1, $a2) = @_; return 1 if $a1 eq $a2; return 0 unless keys %$a1 == keys %$a2; foreach my $k (keys %$a1) { return 0 unless exists $a2->{$k}; return 0 unless is_deeply($a1->{$k}, $a2->{$k}); } return 1; } # End of code adapted from Test::More # Handle value objects as well as normal scalars sub is_defined ($) { my $value = shift; # restrict the method call to objects of type Class::Value, because we # want to avoid deep recursion that could happen if is_defined() is # imported into a package and then someone else calls is_defined() on an # object of that package. ref($value) && UNIVERSAL::isa($value, 'Class::Value') && UNIVERSAL::can($value, 'is_defined') ? $value->is_defined : defined($value); } sub value_of ($) { my $value = shift; # Explicitly return undef unless the value is_defined, because it could # still be a value object, in which case the value we want isn't the value # object itself, but 'undef' is_defined $value ? "$value" : undef; } sub str_value_of ($) { my $value = shift; is_defined $value ? "$value" : ''; } sub flex_grep { my $wanted = shift; return grep { $_ eq $wanted } map { flatten($_) } @_; } sub class_map { my ($class, $map, $seen) = @_; # circularities $seen ||= {}; # so we can pass an object as well as a class name: $class = ref $class if ref $class; return if $seen->{$class}++; my $val = $map->{$class}; return $val if defined $val; # If there's no direct mapping for an exception class, check its # superclasses. Assumes that the classes are loaded, of course. no strict 'refs'; for my $super (@{"$class\::ISA"}) { my $found = class_map($super, $map, $seen); # we will return UNIVERSAL if everything fails - so skip it. return $found if defined $found && $found ne $map->{UNIVERSAL}; } return $map->{UNIVERSAL}; } sub trim { my $s = shift; $s =~ s/^\s+//; $s =~ s/\s+$//; $s; } 1; __END__ =pod =head1 NAME Data::Miscellany - Collection of miscellaneous subroutines =head1 VERSION version 1.100850 =head1 SYNOPSIS use Data::Miscellany qw/set_push flex_grep/; my @foo = (1, 2, 3, 4); set_push @foo, 3, 1, 5, 1, 6; # @foo is now (1, 2, 3, 4, 5, 6); flex_grep('foo', [ qw/foo bar baz/ ]); # true flex_grep('foo', [ qw/bar baz flurble/ ]); # false flex_grep('foo', 1..4, 'flurble', [ qw/foo bar baz/ ]); # true flex_grep('foo', 1..4, [ [ 'foo' ] ], [ qw/bar baz/ ]); # false =head1 DESCRIPTION This is a collection of miscellaneous subroutines useful in wide but varying scenarios; a catch-all module for things that don't obviously belong anywhere else. Obviously what's useful differs from person to person, but this particular collection should be useful in object-oriented frameworks, such as L and L. =head1 FUNCTIONS =head2 set_push(ARRAY, LIST) Like C, but only pushes the item(s) onto the list indicated by the list or list ref (the first argument) if the list doesn't already contain it. Example: @foo = (1, 2, 3, 4); set_push @foo, 3, 1, 5, 1, 6; # @foo is now (1, 2, 3, 4, 5, 6) =head2 flatten() If the first argument is an array reference, it returns the dereferenced array. If the first argument is undefined (or there are no arguments), it returns the empty list. Otherwise the argument list is returned as is. =head2 flex_grep(SCALAR, LIST) Like C, but compares the first argument to each flattened (see C) version of each element of the list. Examples: flex_grep('foo', [ qw/foo bar baz/ ]) # true flex_grep('foo', [ qw/bar baz flurble/ ]) # false flex_grep('foo', 1..4, 'flurble', [ qw/foo bar baz/ ]) # true flex_grep('foo', 1..4, [ [ 'foo' ] ], [ qw/bar baz/ ]) # false =head2 is_deeply() Like L's C except that this version respects stringification overloads. If a package overloads stringification, it means that it specifies how it wants to be compared. Recent versions of L break this behaviour, so here is a working version of C. This subroutine only does the comparison; there are no test diagnostics or results recorded or printed anywhere. =head2 eq_array() Like L's C except that this version respects stringification overloads. If a package overloads stringification, it means that it specifies how it wants to be compared. Recent versions of L break this behaviour, so here is a working version of C. This subroutine only does the comparison; there are no test diagnostics or results recorded or printed anywhere. =head2 eq_hash() Like L's C except that this version respects stringification overloads. If a package overloads stringification, it means that it specifies how it wants to be compared. Recent versions of L break this behaviour, so here is a working version of C. This subroutine only does the comparison; there are no test diagnostics or results recorded or printed anywhere. =head2 is_defined(SCALAR) A kind of C that is aware of L, which has its own views of what is a defined value and what isn't. The issue arose since L objects are supposed to be used transparently, mixed with normal scalar values. However, it is not possible to overload "definedness", and C used on a value object always returns true since the object reference certainly exists. However, what we want to know is whether the value encapsulated by the value object is defined. Additionally, each value class can have its own ideas of when its encapsulated value is defined. Therefore, L has an C method. This subroutine checks whether its argument is a value object and if so, calls the value object's C method. Otherwise, the normal C is used. =head2 value_of(SCALAR) Stringifies its argument, but returns undefined values (per C) as C. =head2 str_value_of(SCALAR) Stringifies its argument, but returns undefined values (per C) as the empty string. =head2 class_map(SCALAR, HASH) Takes an object or class name as the first argument (if it's an object, the class name used will be the package name the object is blessed into). Takes a hash whose keys are class names as the second argument. The hash values are completely arbitrary. Looks up the given class name in the hash and returns the corresponding value. If no such hash key is found, the class hierarchy for the given class name is traversed depth-first and checked against the hash keys in turn. The first value found is returned. If no key is found, a special key, C is used. As an example of how this might be used, consider a hierarchy of exception classes. When evaluating each exception, we want to know how severe this exception is, so we define constants for C (meaning it's informational only), C (meaning some sort of action should be taken) and C (meaning something has gone badly wrong and we might halt processing). In the following table assume that if you have names like C and C, then the latter subclasses the former. %map = ( 'UNIVERSAL' => RC_INTERNAL_ERROR, 'My::Exception::Business' => RC_ERROR, 'My::Exception::Internal' => RC_INTERNAL_ERROR, 'My::Exception::Business::ValueNormalized' => RC_OK, ); Assuming that C exists and that it subclasses C, here are some outcomes: class_map('My::Exception::Business::IllegalValue', \%map) # RC_ERROR class_map('My::Exception::Business::ValueNormalzed', \%map) # RC_OK =head2 trim(STRING) Trims off whitespace at the beginning and end of the string and returns the trimmed string. =head1 INSTALLATION See perlmodinstall for information and options on installing Perl modules. =head1 BUGS AND LIMITATIONS No bugs have been reported. Please report any bugs or feature requests through the web interface at L. =head1 AVAILABILITY The latest version of this module is available from the Comprehensive Perl Archive Network (CPAN). Visit L to find a CPAN site near you, or see L. The development version lives at L. Instead of sending patches, please fork this project using the standard git and github infrastructure. =head1 AUTHOR Marcel Gruenauer =head1 COPYRIGHT AND LICENSE This software is copyright (c) 2004 by Marcel Gruenauer. This is free software; you can redistribute it and/or modify it under the same terms as the Perl 5 programming language system itself. =cut t000755000765000024 011353077032 14633 5ustar00marcelstaff000000000000Data-Miscellany-1.10085001_all.t000644000765000024 713111353077032 16231 0ustar00marcelstaff000000000000Data-Miscellany-1.100850/tuse strict; use warnings; use Test::More tests => 34; use Data::Miscellany qw/ set_push flatten flex_grep /; # ====================================================================== # test set_push() my @f = ({ a => 1, b => 2 }, { a => 1, b => 3, c => 1 },); set_push @f, { a => 1, b => 4 }; set_push @f, { a => 1, b => 4 }, { a => 1, b => 4 }; set_push @f, { d => 1, b => 4 }, { d => 2, b => 3 }; is_deeply( \@f, [ { a => 1, b => 2 }, { a => 1, b => 3, c => 1 }, { a => 1, b => 4 }, { d => 1, b => 4 }, { d => 2, b => 3 }, ], 'set_push' ); @f = (1, 2, 3, 4); set_push @f, 3, 1, 5, 1, 6; is_deeply(\@f, [ 1 .. 6 ], 'set_push 2'); # ====================================================================== # test flatten() is_deeply([ flatten(undef) ], [], 'flatten undef'); is_deeply([ flatten(42) ], [42], 'flatten scalar'); is_deeply([ flatten(42) ], [42], 'flatten scalar'); is_deeply([ flatten(42, 23) ], [ (42, 23) ], 'flatten array'); is_deeply([ flatten(42, [23]) ], [ (42, [23]) ], 'flatten complex array'); is_deeply([ flatten([ 23, 42, 123 ]) ], [ 23, 42, 123 ], 'flatten array ref'); is_deeply( [ flatten([ 23, [42], 123 ]) ], [ 23, [42], 123 ], 'flatten complex array ref' ); # ====================================================================== # test flex_grep() ok(flex_grep('foo', [qw/foo bar baz/]), 'flex grep 1'); ok(!flex_grep('foo', [qw/bar baz flurble/]), 'flex grep 2'); ok(flex_grep('foo', 1 .. 4, 'flurble', [qw/foo bar baz/]), 'flex grep 3'); ok(!flex_grep('foo', 1 .. 4, [ ['foo'] ], [qw/bar baz/]), 'flex grep 4'); # ====================================================================== # test is_deeply() my ($a1, $a2, $a3); $a1 = \$a2; $a2 = \$a3; $a3 = 42; my ($b1, $b2, $b3); $b1 = \$b2; $b2 = \$b3; $b3 = 23; my $foo = { this => [ 1 .. 10 ], that => { up => "down", left => "right" }, }; my $bar = { this => [ 1 .. 10 ], that => { up => "down", left => "right", foo => 42 }, }; # so as to not confuse it with Test::More->is_deeply() *_is_deeply = *Data::Miscellany::is_deeply; ok(!_is_deeply('foo', 'bar'), 'is_deeply(): different plain strings'); ok(!_is_deeply({}, []), 'is_deeply(): different types'); ok( !_is_deeply({ this => 42 }, { this => 43 }), 'is_deeply(): hashes with different values' ); ok( !_is_deeply({ that => 42 }, { this => 42 }), 'is_deeply(): hashes with different keys' ); ok( !_is_deeply([ 1 .. 9 ], [ 1 .. 10 ]), 'is_deeply(): arrays of different length' ); ok(!_is_deeply([ undef, undef ], [undef]), 'is_deeply(): arrays of undefs'); ok(!_is_deeply({ foo => undef }, {}), 'is_deeply(): hashes of undefs'); ok(!_is_deeply(\42, \23), 'is_deeply(): scalar refs'); ok(!_is_deeply([], \23), 'is_deeply(): mixed scalar and array refs'); ok(!_is_deeply($a1, $b1), 'is_deeply(): deep scalar refs'); ok(!_is_deeply($foo, $bar), 'is_deeply(): deep structures'); $b3 = 42; $foo->{that}{foo} = 42; ok(_is_deeply('foo', 'foo'), 'is_deeply(): different plain strings'); ok(_is_deeply({}, {}), 'is_deeply(): two empty hashes'); ok(_is_deeply([], []), 'is_deeply(): two empty arrays'); ok(_is_deeply({ this => 42 }, { this => 42 }), 'is_deeply(): same hashes'); ok( _is_deeply([ 1 .. 9 ], [ 1 .. 9 ]), 'is_deeply(): arrays of different length' ); ok(_is_deeply([ undef, undef ], [ undef, undef ]), 'is_deeply(): arrays of undefs'); ok(_is_deeply({ foo => undef }, { foo => undef }), 'is_deeply(): hashes of undefs'); ok(_is_deeply(\42, \42), 'is_deeply(): scalar refs'); ok(_is_deeply($a1, $b1), 'is_deeply(): deep scalar refs'); ok(_is_deeply($foo, $bar), 'is_deeply(): deep structures'); 00-compile.t000644000765000024 171411353077032 17027 0ustar00marcelstaff000000000000Data-Miscellany-1.100850/t#!perl use strict; use warnings; use Test::More; use File::Find; use File::Temp qw{ tempdir }; my @modules; find( sub { return if $File::Find::name !~ /\.pm\z/; my $found = $File::Find::name; $found =~ s{^lib/}{}; $found =~ s{[/\\]}{::}g; $found =~ s/\.pm$//; # nothing to skip push @modules, $found; }, 'lib', ); my @scripts = glob "bin/*"; plan tests => scalar(@modules) + scalar(@scripts); { # fake home for cpan-testers # no fake requested ## local $ENV{HOME} = tempdir( CLEANUP => 1 ); is( qx{ $^X -Ilib -e "use $_; print '$_ ok'" }, "$_ ok", "$_ loaded ok" ) for sort @modules; SKIP: { eval "use Test::Script; 1;"; skip "Test::Script needed to test script compilation", scalar(@scripts) if $@; foreach my $file ( @scripts ) { my $script = $file; $script =~ s!.*/!!; script_compiles_ok( $file, "$script script compiles" ); } } } author-critic.t000644000765000024 54411353077032 17717 0ustar00marcelstaff000000000000Data-Miscellany-1.100850/t#!perl BEGIN { unless ($ENV{AUTHOR_TESTING}) { require Test::More; Test::More::plan(skip_all => 'these tests are for testing by the author'); } } use strict; use warnings; use Test::More; use English qw(-no_match_vars); eval "use Test::Perl::Critic"; plan skip_all => 'Test::Perl::Critic required to criticise code' if $@; all_critic_ok();release-meta-yaml.t000644000765000024 45411353077032 20446 0ustar00marcelstaff000000000000Data-Miscellany-1.100850/t#!perl BEGIN { unless ($ENV{RELEASE_TESTING}) { require Test::More; Test::More::plan(skip_all => 'these tests are for release candidate testing'); } } use Test::More; eval "use Test::CPAN::Meta"; plan skip_all => "Test::CPAN::Meta required for testing META.yml" if $@; meta_yaml_ok();release-pod-coverage.t000644000765000024 76411353077032 21137 0ustar00marcelstaff000000000000Data-Miscellany-1.100850/t#!perl BEGIN { unless ($ENV{RELEASE_TESTING}) { require Test::More; Test::More::plan(skip_all => 'these tests are for release candidate testing'); } } use Test::More; eval "use Test::Pod::Coverage 1.08"; plan skip_all => "Test::Pod::Coverage 1.08 required for testing POD coverage" if $@; eval "use Pod::Coverage::TrustPod"; plan skip_all => "Pod::Coverage::TrustPod required for testing POD coverage" if $@; all_pod_coverage_ok({ coverage_class => 'Pod::Coverage::TrustPod' });release-pod-syntax.t000644000765000024 44711353077032 20670 0ustar00marcelstaff000000000000Data-Miscellany-1.100850/t#!perl BEGIN { unless ($ENV{RELEASE_TESTING}) { require Test::More; Test::More::plan(skip_all => 'these tests are for release candidate testing'); } } use Test::More; eval "use Test::Pod 1.00"; plan skip_all => "Test::Pod 1.00 required for testing POD" if $@; all_pod_files_ok();release-pod-spell.t000644000765000024 67311353077032 20462 0ustar00marcelstaff000000000000Data-Miscellany-1.100850/t#!perl BEGIN { unless ($ENV{RELEASE_TESTING}) { require Test::More; Test::More::plan(skip_all => 'these tests are for release candidate testing'); } } use Test::More; eval "use Pod::Wordlist::hanekomu"; plan skip_all => "Pod::Wordlist:hanekomu required for testing POD spelling" if $@; eval "use Test::Spelling"; plan skip_all => "Test::Spelling required for testing POD spelling" if $@; all_pod_files_spelling_ok('lib');release-kwalitee.t000644000765000024 43211353077032 20361 0ustar00marcelstaff000000000000Data-Miscellany-1.100850/t#!perl BEGIN { unless ($ENV{RELEASE_TESTING}) { require Test::More; Test::More::plan(skip_all => 'these tests are for release candidate testing'); } } use Test::More; eval "use Test::Kwalitee"; plan skip_all => "Test::Kwalitee required for testing kwalitee" if $@;release-portability.t000644000765000024 47611353077032 21126 0ustar00marcelstaff000000000000Data-Miscellany-1.100850/t#!perl BEGIN { unless ($ENV{RELEASE_TESTING}) { require Test::More; Test::More::plan(skip_all => 'these tests are for release candidate testing'); } } use Test::More; eval "use Test::Portability::Files"; plan skip_all => "Test::Portability::Files required for testing portability" if $@; run_tests();release-synopsis.t000644000765000024 46211353077032 20446 0ustar00marcelstaff000000000000Data-Miscellany-1.100850/t#!perl BEGIN { unless ($ENV{RELEASE_TESTING}) { require Test::More; Test::More::plan(skip_all => 'these tests are for release candidate testing'); } } use Test::More; eval "use Test::Synopsis"; plan skip_all => "Test::Synopsis required for testing synopses" if $@; all_synopsis_ok('lib');release-minimum-version.t000644000765000024 52511353077032 21715 0ustar00marcelstaff000000000000Data-Miscellany-1.100850/t#!perl BEGIN { unless ($ENV{RELEASE_TESTING}) { require Test::More; Test::More::plan(skip_all => 'these tests are for release candidate testing'); } } use Test::More; eval "use Test::MinimumVersion"; plan skip_all => "Test::MinimumVersion required for testing minimum versions" if $@; all_minimum_version_from_metayml_ok();release-has-version.t000644000765000024 47211353077032 21016 0ustar00marcelstaff000000000000Data-Miscellany-1.100850/t#!perl BEGIN { unless ($ENV{RELEASE_TESTING}) { require Test::More; Test::More::plan(skip_all => 'these tests are for release candidate testing'); } } use Test::More; eval "use Test::HasVersion"; plan skip_all => "Test::HasVersion required for testing version numbers" if $@; all_pm_version_ok();release-check-changes.t000644000765000024 45711353077032 21246 0ustar00marcelstaff000000000000Data-Miscellany-1.100850/t#!perl BEGIN { unless ($ENV{RELEASE_TESTING}) { require Test::More; Test::More::plan(skip_all => 'these tests are for release candidate testing'); } } use Test::More; eval "use Test::CheckChanges"; plan skip_all => "Test::CheckChanges required for testing changes" if $@; ok_changes();release-dist-manifest.t000644000765000024 46511353077032 21331 0ustar00marcelstaff000000000000Data-Miscellany-1.100850/t#!perl BEGIN { unless ($ENV{RELEASE_TESTING}) { require Test::More; Test::More::plan(skip_all => 'these tests are for release candidate testing'); } } use Test::More; eval "use Test::DistManifest"; plan skip_all => "Test::DistManifest required for testing the manifest" if $@; manifest_ok();MANIFEST.SKIP000644000765000024 73411353077032 16411 0ustar00marcelstaff000000000000Data-Miscellany-1.100850# Version control files and dirs. bRCS\b bCVS\b .svn .git ,v$ # Makemaker/Build.PL generated files and dirs. MANIFEST.old ^Makefile$ ^Build$ ^blib ^pm_to_blib$ ^_build ^MakeMaker-\d embedded cover_db smoke.html smoke.yaml smoketee.txt sqlnet.log BUILD.SKIP COVER.SKIP CPAN.SKIP t/000_standard__* Debian_CPANTS.txt nytprof.out # Temp, old, emacs, vim, backup files. ~$ .old$ .swp$ .tar$ .tar\.gz$ ^#.*#$ ^\.# .shipit # Local files, not to be included ^scratch$ ^core$ ^var$ perlcriticrc000644000765000024 56411353077032 17367 0ustar00marcelstaff000000000000Data-Miscellany-1.100850/t# no strict 'refs' [TestingAndDebugging::ProhibitNoStrict] allow = refs [-BuiltinFunctions::ProhibitStringyEval] [-ControlStructures::ProhibitMutatingListFunctions] [-Subroutines::ProhibitExplicitReturnUndef] [-Subroutines::ProhibitSubroutinePrototypes] [-Variables::ProhibitConditionalDeclarations] # for mkdir $dir, 0777 [-ValuesAndExpressions::ProhibitLeadingZeros] 000-report-versions.t000644000765000024 2465111353077032 20665 0ustar00marcelstaff000000000000Data-Miscellany-1.100850/t#!perl use warnings; use strict; use Test::More 0.88; # Include a cut-down version of YAML::Tiny so we don't introduce unnecessary # dependencies ourselves. package Local::YAML::Tiny; use strict; use Carp 'croak'; # UTF Support? sub HAVE_UTF8 () { $] >= 5.007003 } BEGIN { if ( HAVE_UTF8 ) { # The string eval helps hide this from Test::MinimumVersion eval "require utf8;"; die "Failed to load UTF-8 support" if $@; } # Class structure require 5.004; $YAML::Tiny::VERSION = '1.40'; # Error storage $YAML::Tiny::errstr = ''; } # Printable characters for escapes my %UNESCAPES = ( z => "\x00", a => "\x07", t => "\x09", n => "\x0a", v => "\x0b", f => "\x0c", r => "\x0d", e => "\x1b", '\\' => '\\', ); ##################################################################### # Implementation # Create an empty YAML::Tiny object sub new { my $class = shift; bless [ @_ ], $class; } # Create an object from a file sub read { my $class = ref $_[0] ? ref shift : shift; # Check the file my $file = shift or return $class->_error( 'You did not specify a file name' ); return $class->_error( "File '$file' does not exist" ) unless -e $file; return $class->_error( "'$file' is a directory, not a file" ) unless -f _; return $class->_error( "Insufficient permissions to read '$file'" ) unless -r _; # Slurp in the file local $/ = undef; local *CFG; unless ( open(CFG, $file) ) { return $class->_error("Failed to open file '$file': $!"); } my $contents = ; unless ( close(CFG) ) { return $class->_error("Failed to close file '$file': $!"); } $class->read_string( $contents ); } # Create an object from a string sub read_string { my $class = ref $_[0] ? ref shift : shift; my $self = bless [], $class; my $string = $_[0]; unless ( defined $string ) { return $self->_error("Did not provide a string to load"); } # Byte order marks # NOTE: Keeping this here to educate maintainers # my %BOM = ( # "\357\273\277" => 'UTF-8', # "\376\377" => 'UTF-16BE', # "\377\376" => 'UTF-16LE', # "\377\376\0\0" => 'UTF-32LE' # "\0\0\376\377" => 'UTF-32BE', # ); if ( $string =~ /^(?:\376\377|\377\376|\377\376\0\0|\0\0\376\377)/ ) { return $self->_error("Stream has a non UTF-8 BOM"); } else { # Strip UTF-8 bom if found, we'll just ignore it $string =~ s/^\357\273\277//; } # Try to decode as utf8 utf8::decode($string) if HAVE_UTF8; # Check for some special cases return $self unless length $string; unless ( $string =~ /[\012\015]+\z/ ) { return $self->_error("Stream does not end with newline character"); } # Split the file into lines my @lines = grep { ! /^\s*(?:\#.*)?\z/ } split /(?:\015{1,2}\012|\015|\012)/, $string; # Strip the initial YAML header @lines and $lines[0] =~ /^\%YAML[: ][\d\.]+.*\z/ and shift @lines; # A nibbling parser while ( @lines ) { # Do we have a document header? if ( $lines[0] =~ /^---\s*(?:(.+)\s*)?\z/ ) { # Handle scalar documents shift @lines; if ( defined $1 and $1 !~ /^(?:\#.+|\%YAML[: ][\d\.]+)\z/ ) { push @$self, $self->_read_scalar( "$1", [ undef ], \@lines ); next; } } if ( ! @lines or $lines[0] =~ /^(?:---|\.\.\.)/ ) { # A naked document push @$self, undef; while ( @lines and $lines[0] !~ /^---/ ) { shift @lines; } } elsif ( $lines[0] =~ /^\s*\-/ ) { # An array at the root my $document = [ ]; push @$self, $document; $self->_read_array( $document, [ 0 ], \@lines ); } elsif ( $lines[0] =~ /^(\s*)\S/ ) { # A hash at the root my $document = { }; push @$self, $document; $self->_read_hash( $document, [ length($1) ], \@lines ); } else { croak("YAML::Tiny failed to classify the line '$lines[0]'"); } } $self; } # Deparse a scalar string to the actual scalar sub _read_scalar { my ($self, $string, $indent, $lines) = @_; # Trim trailing whitespace $string =~ s/\s*\z//; # Explitic null/undef return undef if $string eq '~'; # Quotes if ( $string =~ /^\'(.*?)\'\z/ ) { return '' unless defined $1; $string = $1; $string =~ s/\'\'/\'/g; return $string; } if ( $string =~ /^\"((?:\\.|[^\"])*)\"\z/ ) { # Reusing the variable is a little ugly, # but avoids a new variable and a string copy. $string = $1; $string =~ s/\\"/"/g; $string =~ s/\\([never\\fartz]|x([0-9a-fA-F]{2}))/(length($1)>1)?pack("H2",$2):$UNESCAPES{$1}/gex; return $string; } # Special cases if ( $string =~ /^[\'\"!&]/ ) { croak("YAML::Tiny does not support a feature in line '$lines->[0]'"); } return {} if $string eq '{}'; return [] if $string eq '[]'; # Regular unquoted string return $string unless $string =~ /^[>|]/; # Error croak("YAML::Tiny failed to find multi-line scalar content") unless @$lines; # Check the indent depth $lines->[0] =~ /^(\s*)/; $indent->[-1] = length("$1"); if ( defined $indent->[-2] and $indent->[-1] <= $indent->[-2] ) { croak("YAML::Tiny found bad indenting in line '$lines->[0]'"); } # Pull the lines my @multiline = (); while ( @$lines ) { $lines->[0] =~ /^(\s*)/; last unless length($1) >= $indent->[-1]; push @multiline, substr(shift(@$lines), length($1)); } my $j = (substr($string, 0, 1) eq '>') ? ' ' : "\n"; my $t = (substr($string, 1, 1) eq '-') ? '' : "\n"; return join( $j, @multiline ) . $t; } # Parse an array sub _read_array { my ($self, $array, $indent, $lines) = @_; while ( @$lines ) { # Check for a new document if ( $lines->[0] =~ /^(?:---|\.\.\.)/ ) { while ( @$lines and $lines->[0] !~ /^---/ ) { shift @$lines; } return 1; } # Check the indent level $lines->[0] =~ /^(\s*)/; if ( length($1) < $indent->[-1] ) { return 1; } elsif ( length($1) > $indent->[-1] ) { croak("YAML::Tiny found bad indenting in line '$lines->[0]'"); } if ( $lines->[0] =~ /^(\s*\-\s+)[^\'\"]\S*\s*:(?:\s+|$)/ ) { # Inline nested hash my $indent2 = length("$1"); $lines->[0] =~ s/-/ /; push @$array, { }; $self->_read_hash( $array->[-1], [ @$indent, $indent2 ], $lines ); } elsif ( $lines->[0] =~ /^\s*\-(\s*)(.+?)\s*\z/ ) { # Array entry with a value shift @$lines; push @$array, $self->_read_scalar( "$2", [ @$indent, undef ], $lines ); } elsif ( $lines->[0] =~ /^\s*\-\s*\z/ ) { shift @$lines; unless ( @$lines ) { push @$array, undef; return 1; } if ( $lines->[0] =~ /^(\s*)\-/ ) { my $indent2 = length("$1"); if ( $indent->[-1] == $indent2 ) { # Null array entry push @$array, undef; } else { # Naked indenter push @$array, [ ]; $self->_read_array( $array->[-1], [ @$indent, $indent2 ], $lines ); } } elsif ( $lines->[0] =~ /^(\s*)\S/ ) { push @$array, { }; $self->_read_hash( $array->[-1], [ @$indent, length("$1") ], $lines ); } else { croak("YAML::Tiny failed to classify line '$lines->[0]'"); } } elsif ( defined $indent->[-2] and $indent->[-1] == $indent->[-2] ) { # This is probably a structure like the following... # --- # foo: # - list # bar: value # # ... so lets return and let the hash parser handle it return 1; } else { croak("YAML::Tiny failed to classify line '$lines->[0]'"); } } return 1; } # Parse an array sub _read_hash { my ($self, $hash, $indent, $lines) = @_; while ( @$lines ) { # Check for a new document if ( $lines->[0] =~ /^(?:---|\.\.\.)/ ) { while ( @$lines and $lines->[0] !~ /^---/ ) { shift @$lines; } return 1; } # Check the indent level $lines->[0] =~ /^(\s*)/; if ( length($1) < $indent->[-1] ) { return 1; } elsif ( length($1) > $indent->[-1] ) { croak("YAML::Tiny found bad indenting in line '$lines->[0]'"); } # Get the key unless ( $lines->[0] =~ s/^\s*([^\'\" ][^\n]*?)\s*:(\s+|$)// ) { if ( $lines->[0] =~ /^\s*[?\'\"]/ ) { croak("YAML::Tiny does not support a feature in line '$lines->[0]'"); } croak("YAML::Tiny failed to classify line '$lines->[0]'"); } my $key = $1; # Do we have a value? if ( length $lines->[0] ) { # Yes $hash->{$key} = $self->_read_scalar( shift(@$lines), [ @$indent, undef ], $lines ); } else { # An indent shift @$lines; unless ( @$lines ) { $hash->{$key} = undef; return 1; } if ( $lines->[0] =~ /^(\s*)-/ ) { $hash->{$key} = []; $self->_read_array( $hash->{$key}, [ @$indent, length($1) ], $lines ); } elsif ( $lines->[0] =~ /^(\s*)./ ) { my $indent2 = length("$1"); if ( $indent->[-1] >= $indent2 ) { # Null hash entry $hash->{$key} = undef; } else { $hash->{$key} = {}; $self->_read_hash( $hash->{$key}, [ @$indent, length($1) ], $lines ); } } } } return 1; } # Set error sub _error { $YAML::Tiny::errstr = $_[1]; undef; } # Retrieve error sub errstr { $YAML::Tiny::errstr; } ##################################################################### # Use Scalar::Util if possible, otherwise emulate it BEGIN { eval { require Scalar::Util; }; if ( $@ ) { # Failed to load Scalar::Util eval <<'END_PERL'; sub refaddr { my $pkg = ref($_[0]) or return undef; if (!!UNIVERSAL::can($_[0], 'can')) { bless $_[0], 'Scalar::Util::Fake'; } else { $pkg = undef; } "$_[0]" =~ /0x(\w+)/; my $i = do { local $^W; hex $1 }; bless $_[0], $pkg if defined $pkg; $i; } END_PERL } else { Scalar::Util->import('refaddr'); } } ##################################################################### # main test ##################################################################### package main; BEGIN { # Skip modules that either don't want to be loaded directly, such as # Module::Install, or that mess with the test count, such as the Test::* # modules listed here. my %skip = map { $_ => 1 } qw( App::FatPacker Module::Install Test::YAML::Meta Test::Pod::Coverage Test::Portability::Files ); my $Test = Test::Builder->new; $Test->plan(skip_all => "META.yml could not be found") unless -f 'META.yml' and -r _; my $meta = (Local::YAML::Tiny->read('META.yml'))->[0]; my %requires; for my $require_key (grep { /requires/ } keys %$meta) { my %h = %{ $meta->{$require_key} }; $requires{$_}++ for keys %h; } delete $requires{perl}; diag("Testing with Perl $], $^X"); for my $module (sort keys %requires) { next if $skip{$module}; use_ok $module or BAIL_OUT("can't load $module"); my $version = $module->VERSION; $version = 'undefined' unless defined $version; diag(" $module version is $version"); } done_testing; } LICENSE000644000765000024 4353011353077032 15561 0ustar00marcelstaff000000000000Data-Miscellany-1.100850This software is copyright (c) 2004 by Marcel Gruenauer. This is free software; you can redistribute it and/or modify it under the same terms as the Perl 5 programming language system itself. Terms of the Perl programming language system itself a) the GNU General Public License as published by the Free Software Foundation; either version 1, or (at your option) any later version, or b) the "Artistic License" --- The GNU General Public License, Version 1, February 1989 --- This software is Copyright (c) 2004 by Marcel Gruenauer. This is free software, licensed under: The GNU General Public License, Version 1, February 1989 GNU GENERAL PUBLIC LICENSE Version 1, February 1989 Copyright (C) 1989 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 license agreements of most software companies try to keep users at the mercy of those companies. By contrast, our 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. The General Public License applies to the Free Software Foundation's software and to any other program whose authors commit to using it. You can use it for your programs, too. When we speak of free software, we are referring to freedom, not price. Specifically, the General Public License is designed to make sure that you have the freedom to give away or sell copies of free software, 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 a 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 tell them 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. 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 Agreement 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 work containing the Program or a portion of it, either verbatim or with modifications. Each licensee is addressed as "you". 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 General Public License and to the absence of any warranty; and give any other recipients of the Program a copy of this General Public License along with the Program. You may charge a fee for the physical act of transferring a copy. 2. You may modify your copy or copies of the Program or any portion of it, and copy and distribute such modifications under the terms of Paragraph 1 above, provided that you also do the following: a) cause the modified files to carry prominent notices stating that you changed the files and the date of any change; and b) cause the whole of any work that you distribute or publish, that in whole or in part contains the Program or any part thereof, either with or without modifications, to be licensed at no charge to all third parties under the terms of this General Public License (except that you may choose to grant warranty protection to some or all third parties, at your option). c) If the modified program normally reads commands interactively when run, you must cause it, when started running for such interactive use in the simplest and most usual 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 General Public License. d) 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. Mere aggregation of another independent work with the Program (or its derivative) on a volume of a storage or distribution medium does not bring the other work under the scope of these terms. 3. You may copy and distribute the Program (or a portion or derivative of it, under Paragraph 2) in object code or executable form under the terms of Paragraphs 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 Paragraphs 1 and 2 above; or, b) accompany it with a written offer, valid for at least three years, to give any third party free (except for a nominal charge for the cost of distribution) a complete machine-readable copy of the corresponding source code, to be distributed under the terms of Paragraphs 1 and 2 above; or, c) accompany it with the information you received as to where the corresponding source code may be obtained. (This alternative is allowed only for noncommercial distribution and only if you received the program in object code or executable form alone.) Source code for a work means the preferred form of the work for making modifications to it. For an executable file, complete source code means all the source code for all modules it contains; but, as a special exception, it need not include source code for modules which are standard libraries that accompany the operating system on which the executable file runs, or for standard header files or definitions files that accompany that operating system. 4. You may not copy, modify, sublicense, distribute or transfer the Program except as expressly provided under this General Public License. Any attempt otherwise to copy, modify, sublicense, distribute or transfer the Program is void, and will automatically terminate your rights to use the Program under this License. However, parties who have received copies, or rights to use copies, from you under this General Public License will not have their licenses terminated so long as such parties remain in full compliance. 5. By copying, distributing or modifying 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. 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. 7. 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 the 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 the license, you may choose any version ever published by the Free Software Foundation. 8. 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 9. 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. 10. 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 Appendix: 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 humanity, 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) 19yy 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 1, 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) 19xx 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 a sample; alter the names: Yoyodyne, Inc., hereby disclaims all copyright interest in the program `Gnomovision' (a program to direct compilers to make passes at assemblers) written by James Hacker. , 1 April 1989 Ty Coon, President of Vice That's all there is to it! --- The Artistic License 1.0 --- This software is Copyright (c) 2004 by Marcel Gruenauer. This is free software, licensed under: The Artistic License 1.0 The Artistic License Preamble The intent of this document is to state the conditions under which a Package may be copied, such that the Copyright Holder maintains some semblance of artistic control over the development of the package, while giving the users of the package the right to use and distribute the Package in a more-or-less customary fashion, plus the right to make reasonable modifications. Definitions: - "Package" refers to the collection of files distributed by the Copyright Holder, and derivatives of that collection of files created through textual modification. - "Standard Version" refers to such a Package if it has not been modified, or has been modified in accordance with the wishes of the Copyright Holder. - "Copyright Holder" is whoever is named in the copyright or copyrights for the package. - "You" is you, if you're thinking about copying or distributing this Package. - "Reasonable copying fee" is whatever you can justify on the basis of media cost, duplication charges, time of people involved, and so on. (You will not be required to justify it to the Copyright Holder, but only to the computing community at large as a market that must bear the fee.) - "Freely Available" means that no fee is charged for the item itself, though there may be fees involved in handling the item. It also means that recipients of the item may redistribute it under the same conditions they received it. 1. You may make and give away verbatim copies of the source form of the Standard Version of this Package without restriction, provided that you duplicate all of the original copyright notices and associated disclaimers. 2. You may apply bug fixes, portability fixes and other modifications derived from the Public Domain or from the Copyright Holder. A Package modified in such a way shall still be considered the Standard Version. 3. You may otherwise modify your copy of this Package in any way, provided that you insert a prominent notice in each changed file stating how and when you changed that file, and provided that you do at least ONE of the following: a) place your modifications in the Public Domain or otherwise make them Freely Available, such as by posting said modifications to Usenet or an equivalent medium, or placing the modifications on a major archive site such as ftp.uu.net, or by allowing the Copyright Holder to include your modifications in the Standard Version of the Package. b) use the modified Package only within your corporation or organization. c) rename any non-standard executables so the names do not conflict with standard executables, which must also be provided, and provide a separate manual page for each non-standard executable that clearly documents how it differs from the Standard Version. d) make other distribution arrangements with the Copyright Holder. 4. You may distribute the programs of this Package in object code or executable form, provided that you do at least ONE of the following: a) distribute a Standard Version of the executables and library files, together with instructions (in the manual page or equivalent) on where to get the Standard Version. b) accompany the distribution with the machine-readable source of the Package with your modifications. c) accompany any non-standard executables with their corresponding Standard Version executables, giving the non-standard executables non-standard names, and clearly documenting the differences in manual pages (or equivalent), together with instructions on where to get the Standard Version. d) make other distribution arrangements with the Copyright Holder. 5. You may charge a reasonable copying fee for any distribution of this Package. You may charge any fee you choose for support of this Package. You may not charge a fee for this Package itself. However, you may distribute this Package in aggregate with other (possibly commercial) programs as part of a larger (possibly commercial) software distribution provided that you do not advertise this Package as a product of your own. 6. The scripts and library files supplied as input to or produced as output from the programs of this Package do not automatically fall under the copyright of this Package, but belong to whomever generated them, and may be sold commercially, and may be aggregated with this Package. 7. C or perl subroutines supplied by you and linked into this Package shall not be considered part of this Package. 8. The name of the Copyright Holder may not be used to endorse or promote products derived from this software without specific prior written permission. 9. THIS PACKAGE IS PROVIDED "AS IS" AND WITHOUT ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE. The End META.yml000644000765000024 141311353077032 15777 0ustar00marcelstaff000000000000Data-Miscellany-1.100850--- abstract: 'Collection of miscellaneous subroutines' author: - 'Marcel Gruenauer ' build_requires: {} configure_requires: ExtUtils::MakeMaker: 6.11 generated_by: 'Dist::Zilla version 1.100711' license: perl meta-spec: url: http://module-build.sourceforge.net/META-spec-v1.4.html version: 1.4 name: Data-Miscellany provides: Data::Miscellany: file: lib/Data/Miscellany.pm version: 1.100850 requires: Carp: 0 English: 0 Exporter: 0 File::Find: 0 File::Temp: 0 Scalar::Util: 0 Test::More: 0.88 perl: 5.008 resources: bugtracker: http://rt.cpan.org/Public/Dist/Display.html?Name=Data-Miscellany homepage: http://search.cpan.org/dist/Data-Miscellany/ repository: http://github.com/hanekomu/Data-Miscellany version: 1.100850 META.json000644000765000024 207511353077032 16154 0ustar00marcelstaff000000000000Data-Miscellany-1.100850{ "resources" : { "homepage" : "http://search.cpan.org/dist/Data-Miscellany/", "repository" : "http://github.com/hanekomu/Data-Miscellany", "bugtracker" : "http://rt.cpan.org/Public/Dist/Display.html?Name=Data-Miscellany" }, "generated_by" : "Dist::Zilla version 1.100711", "meta-spec" : { "version" : 1.4, "url" : "http://module-build.sourceforge.net/META-spec-v1.4.html" }, "version" : "1.100850", "name" : "Data-Miscellany", "author" : [ "Marcel Gruenauer " ], "license" : "perl", "build_requires" : {}, "provides" : { "Data::Miscellany" : { "version" : "1.100850", "file" : "lib/Data/Miscellany.pm" } }, "requires" : { "Test::More" : "0.88", "perl" : "5.008", "Scalar::Util" : "0", "English" : "0", "File::Find" : "0", "File::Temp" : "0", "Exporter" : "0", "Carp" : "0" }, "abstract" : "Collection of miscellaneous subroutines", "configure_requires" : { "ExtUtils::MakeMaker" : "6.11" } } INSTALL000644000765000024 101011353077032 15550 0ustar00marcelstaff000000000000Data-Miscellany-1.100850 This is the Perl distribution Data-Miscellany. ## Installation Data-Miscellany installation is straightforward. If your CPAN shell is set up, you should just be able to do % cpan Data::Miscellany Download it, unpack it, then build it as per the usual: % perl Makefile.PL % make && make test Then install it: % make install ## Documentation Data-Miscellany documentation is available as in POD. So you can do: % perldoc Data::Miscellany to read the documentation with your favorite pager. Makefile.PL000644000765000024 275511353077032 16512 0ustar00marcelstaff000000000000Data-Miscellany-1.100850 use strict; use warnings; BEGIN { require 5.008; } use ExtUtils::MakeMaker 6.11; my %WriteMakefileArgs = ( 'test' => { 'TESTS' => 't/*.t' }, 'NAME' => 'Data::Miscellany', 'DISTNAME' => 'Data-Miscellany', 'CONFIGURE_REQUIRES' => { 'ExtUtils::MakeMaker' => '6.11' }, 'AUTHOR' => 'Marcel Gruenauer ', 'BUILD_REQUIRES' => {}, 'ABSTRACT' => 'Collection of miscellaneous subroutines', 'EXE_FILES' => [], 'VERSION' => '1.100850', 'PREREQ_PM' => { 'Test::More' => '0.88', 'Scalar::Util' => '0', 'English' => '0', 'File::Find' => '0', 'File::Temp' => '0', 'Exporter' => '0', 'Carp' => '0' }, 'LICENSE' => 'perl' ); delete $WriteMakefileArgs{LICENSE} unless eval { ExtUtils::MakeMaker->VERSION(6.31) }; WriteMakefile(%WriteMakefileArgs); README000644000765000024 1624111353077032 15433 0ustar00marcelstaff000000000000Data-Miscellany-1.100850NAME Data::Miscellany - Collection of miscellaneous subroutines VERSION version 1.100850 SYNOPSIS use Data::Miscellany qw/set_push flex_grep/; my @foo = (1, 2, 3, 4); set_push @foo, 3, 1, 5, 1, 6; # @foo is now (1, 2, 3, 4, 5, 6); flex_grep('foo', [ qw/foo bar baz/ ]); # true flex_grep('foo', [ qw/bar baz flurble/ ]); # false flex_grep('foo', 1..4, 'flurble', [ qw/foo bar baz/ ]); # true flex_grep('foo', 1..4, [ [ 'foo' ] ], [ qw/bar baz/ ]); # false DESCRIPTION This is a collection of miscellaneous subroutines useful in wide but varying scenarios; a catch-all module for things that don't obviously belong anywhere else. Obviously what's useful differs from person to person, but this particular collection should be useful in object-oriented frameworks, such as Class::Scaffold and Data::Conveyor. FUNCTIONS set_push(ARRAY, LIST) Like "push()", but only pushes the item(s) onto the list indicated by the list or list ref (the first argument) if the list doesn't already contain it. Example: @foo = (1, 2, 3, 4); set_push @foo, 3, 1, 5, 1, 6; # @foo is now (1, 2, 3, 4, 5, 6) flatten() If the first argument is an array reference, it returns the dereferenced array. If the first argument is undefined (or there are no arguments), it returns the empty list. Otherwise the argument list is returned as is. flex_grep(SCALAR, LIST) Like "grep()", but compares the first argument to each flattened (see "flatten()") version of each element of the list. Examples: flex_grep('foo', [ qw/foo bar baz/ ]) # true flex_grep('foo', [ qw/bar baz flurble/ ]) # false flex_grep('foo', 1..4, 'flurble', [ qw/foo bar baz/ ]) # true flex_grep('foo', 1..4, [ [ 'foo' ] ], [ qw/bar baz/ ]) # false is_deeply() Like Test::More's "is_deeply()" except that this version respects stringification overloads. If a package overloads stringification, it means that it specifies how it wants to be compared. Recent versions of Test::More break this behaviour, so here is a working version of "is_deeply()". This subroutine only does the comparison; there are no test diagnostics or results recorded or printed anywhere. eq_array() Like Test::More's "eq_array()" except that this version respects stringification overloads. If a package overloads stringification, it means that it specifies how it wants to be compared. Recent versions of Test::More break this behaviour, so here is a working version of "eq_array()". This subroutine only does the comparison; there are no test diagnostics or results recorded or printed anywhere. eq_hash() Like Test::More's "eq_hash()" except that this version respects stringification overloads. If a package overloads stringification, it means that it specifies how it wants to be compared. Recent versions of Test::More break this behaviour, so here is a working version of "eq_hash()". This subroutine only does the comparison; there are no test diagnostics or results recorded or printed anywhere. is_defined(SCALAR) A kind of "defined()" that is aware of Class::Value, which has its own views of what is a defined value and what isn't. The issue arose since Class::Value objects are supposed to be used transparently, mixed with normal scalar values. However, it is not possible to overload "definedness", and "defined()" used on a value object always returns true since the object reference certainly exists. However, what we want to know is whether the value encapsulated by the value object is defined. Additionally, each value class can have its own ideas of when its encapsulated value is defined. Therefore, Class::Value has an "is_defined()" method. This subroutine checks whether its argument is a value object and if so, calls the value object's "is_defined()" method. Otherwise, the normal "defined()" is used. value_of(SCALAR) Stringifies its argument, but returns undefined values (per "is_defined()") as "undef". str_value_of(SCALAR) Stringifies its argument, but returns undefined values (per "is_defined()") as the empty string. class_map(SCALAR, HASH) Takes an object or class name as the first argument (if it's an object, the class name used will be the package name the object is blessed into). Takes a hash whose keys are class names as the second argument. The hash values are completely arbitrary. Looks up the given class name in the hash and returns the corresponding value. If no such hash key is found, the class hierarchy for the given class name is traversed depth-first and checked against the hash keys in turn. The first value found is returned. If no key is found, a special key, "UNIVERSAL" is used. As an example of how this might be used, consider a hierarchy of exception classes. When evaluating each exception, we want to know how severe this exception is, so we define constants for "RC_OK" (meaning it's informational only), "RC_ERROR" (meaning some sort of action should be taken) and "RC_INTERNAL_ERROR" (meaning something has gone badly wrong and we might halt processing). In the following table assume that if you have names like "Foo::Bar" and "Foo::Bar::Baz", then the latter subclasses the former. %map = ( 'UNIVERSAL' => RC_INTERNAL_ERROR, 'My::Exception::Business' => RC_ERROR, 'My::Exception::Internal' => RC_INTERNAL_ERROR, 'My::Exception::Business::ValueNormalized' => RC_OK, ); Assuming that "My::Exception::Business::IllegalValue" exists and that it subclasses "My::Exception::Business", here are some outcomes: class_map('My::Exception::Business::IllegalValue', \%map) # RC_ERROR class_map('My::Exception::Business::ValueNormalzed', \%map) # RC_OK trim(STRING) Trims off whitespace at the beginning and end of the string and returns the trimmed string. INSTALLATION See perlmodinstall for information and options on installing Perl modules. BUGS AND LIMITATIONS No bugs have been reported. Please report any bugs or feature requests through the web interface at . AVAILABILITY The latest version of this module is available from the Comprehensive Perl Archive Network (CPAN). Visit to find a CPAN site near you, or see . The development version lives at . Instead of sending patches, please fork this project using the standard git and github infrastructure. AUTHOR Marcel Gruenauer COPYRIGHT AND LICENSE This software is copyright (c) 2004 by Marcel Gruenauer. This is free software; you can redistribute it and/or modify it under the same terms as the Perl 5 programming language system itself. MANIFEST000644000765000024 71511353077032 15643 0ustar00marcelstaff000000000000Data-Miscellany-1.100850Changes INSTALL LICENSE MANIFEST MANIFEST.SKIP META.json META.yml Makefile.PL README dist.ini lib/Data/Miscellany.pm t/00-compile.t t/000-report-versions.t t/01_all.t t/author-critic.t t/perlcriticrc t/release-check-changes.t t/release-dist-manifest.t t/release-has-version.t t/release-kwalitee.t t/release-meta-yaml.t t/release-minimum-version.t t/release-pod-coverage.t t/release-pod-spell.t t/release-pod-syntax.t t/release-portability.t t/release-synopsis.t