Data-Walk-1.00/0000755000177200001440000000000010430643152012227 5ustar guidousersData-Walk-1.00/t/0000755000177200001440000000000010430643140012467 5ustar guidousersData-Walk-1.00/t/TC_PreProcess.pm0000755000177200001440000000661310430641214015511 0ustar guidousers#! /bin/false # $Id: TC_PreProcess.pm,v 1.4 2006/05/11 13:56:28 guido Exp $ # Data::Walk - Traverse Perl data structures. # Copyright (C) 2005-2006 Guido Flohr , # all rights reserved. # This program is free software; you can redistribute it and/or modify it # under the terms of the GNU Library General Public License as published # by the Free Software Foundation; either version 2, 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 # Library General Public License for more details. # You should have received a copy of the GNU Library 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. package TC_PreProcess; use strict; use base qw (Test::Unit::TestCase); use Data::Walk; sub testHash { my ($self) = @_; my %data = ('A' .. 'Z', 'a' .. 'z'); my $preprocessor_calls = 0; my $preprocess = sub { my %container = @_; my @sorted; foreach my $key (sort keys %container) { push @sorted, $key, $container{$key}; } ++$preprocessor_calls; return @sorted; }; my $last = ''; my $wanted = sub { unless (ref $_) { $self->assert ($_ gt $last, "Hash is not traversed in preprocess order."); $last = $_; } }; walk { wanted => $wanted, preprocess => $preprocess}, \%data; $self->assert ($preprocessor_calls, "Preprocessing function never called."); } sub testArray { my ($self) = @_; my @data = ('A' .. 'Z', 'a' .. 'z'); my $preprocessor_calls = 0; my $preprocess = sub { ++$preprocessor_calls; return reverse sort @_; }; my $last = chr (1 + ord $data[-1]); my $wanted = sub { unless (ref $_) { $self->assert ($_ lt $last, "Array is not traversed in preprocess order."); $last = $_; } }; walk { wanted => $wanted, preprocess => $preprocess}, \@data; $self->assert ($preprocessor_calls, "Preprocessing function never called."); } sub testPreprocessHash { my ($self) = @_; my %data = ('A' .. 'Z', 'a' .. 'z'); my $preprocessor_calls = 0; my $preprocess = sub { my %container = @_; my @sorted; foreach my $key (sort keys %container) { push @sorted, $key, $container{$key}; } ++$preprocessor_calls; return @sorted; }; my $last = ''; my $wanted = sub { unless (ref $_) { $self->assert ($_ gt $last, "Hash is not traversed in preprocess order."); $last = $_; } }; walk { wanted => $wanted, preprocess_hash => $preprocess}, \%data; $self->assert ($preprocessor_calls, "Preprocessing function never called."); my @data = ('A' .. 'Z', 'a' .. 'z'); $preprocessor_calls = 0; $preprocess = sub { ++$preprocessor_calls; }; $wanted = sub {}; walk { wanted => $wanted, preprocess_hash => $preprocess}, \@data; $self->assert (!$preprocessor_calls, "Preprocessing function has been called for array."); } 1; #Local Variables: #mode: perl #perl-indent-level: 4 #perl-continued-statement-offset: 4 #perl-continued-brace-offset: 0 #perl-brace-offset: -4 #perl-brace-imaginary-offset: 0 #perl-label-offset: -4 #cperl-indent-level: 4 #cperl-continued-statement-offset: 2 #tab-width: 8 #End: Data-Walk-1.00/t/testrunner.t0000755000177200001440000000304310430641214015070 0ustar guidousers#! /usr/local/bin/perl # $Id: testrunner.t,v 1.3 2006/05/11 13:56:28 guido Exp $ # Unit test runner. # Copyright (C) 2005-2006 Guido Flohr , # all rights reserved. # This program is free software; you can redistribute it and/or modify it # under the terms of the GNU Library General Public License as published # by the Free Software Foundation; either version 2, 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 # Library General Public License for more details. # You should have received a copy of the GNU Library 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. use strict; eval { require Test::Unit::HarnessUnit; }; if($@) { my $message = "1..1\nok 1 \# skip "; $message .= "You must install Test::Unit in order to run the test "; $message .= "suite for this Perl extension. Test::Unit is available "; $message .= "from CPAN."; print $message; exit 0; } use lib 't'; Test::Unit::HarnessUnit->new->start (qw (TS_All)); #Local Variables: #mode: perl #perl-indent-level: 4 #perl-continued-statement-offset: 4 #perl-continued-brace-offset: 0 #perl-brace-offset: -4 #perl-brace-imaginary-offset: 0 #perl-label-offset: -4 #cperl-indent-level: 4 #cperl-continued-statement-offset: 2 #tab-width: 8 #End: __DATA__ Data-Walk-1.00/t/TS_All.pm0000755000177200001440000000256410430641214014155 0ustar guidousers#! /bin/false # $Id: TS_All.pm,v 1.11 2006/05/11 13:56:28 guido Exp $ # Data::Walk - Traverse Perl data structures. # Copyright (C) 2005-2006 Guido Flohr , # all rights reserved. # This program is free software; you can redistribute it and/or modify it # under the terms of the GNU Library General Public License as published # by the Free Software Foundation; either version 2, 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 # Library General Public License for more details. # You should have received a copy of the GNU Library 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. package TS_All; use strict; use base qw (Test::Unit::TestSuite); sub name { "Top level testsuite for Data::Walk" } sub include_tests { qw ( TS_Basic TS_Options TC_Examples TC_Bugs ); } 1; #Local Variables: #mode: perl #perl-indent-level: 4 #perl-continued-statement-offset: 4 #perl-continued-brace-offset: 0 #perl-brace-offset: -4 #perl-brace-imaginary-offset: 0 #perl-label-offset: -4 #cperl-indent-level: 4 #cperl-continued-statement-offset: 2 #tab-width: 8 #End: Data-Walk-1.00/t/TC_Bugs.pm0000755000177200001440000000414310430641214014320 0ustar guidousers#! /bin/false # $Id: TC_Bugs.pm,v 1.4 2006/05/11 13:56:28 guido Exp $ # Data::Walk - Traverse Perl data structures. # Copyright (C) 2005-2006 Guido Flohr , # all rights reserved. # This program is free software; you can redistribute it and/or modify it # under the terms of the GNU Library General Public License as published # by the Free Software Foundation; either version 2, 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 # Library General Public License for more details. # You should have received a copy of the GNU Library 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. package TC_Bugs; use strict; use base qw (Test::Unit::TestCase); use Data::Walk; sub testKeepBlessing { my ($self) = @_; my $data; $data = { foo => 'bar', baz => 'bazoo', }; bless $data; walk { wanted => sub {} }, $data; $self->assert_str_equals (__PACKAGE__, ref $data); $data = [ 0, 1, 2, 3 ]; bless $data; walk { wanted => sub {} }, $data; $self->assert_str_equals (__PACKAGE__, ref $data); $data = { foo => 'bar', baz => 'bazoo', }; walk { wanted => sub {} }, $data; $self->assert_str_equals ('HASH', ref $data); my $success = $data =~ /^HASH\(0x[0-9a-f]+\)$/; $self->assert ($success, "Simple hash has been blessed: $data."); $data = [ 0, 1, 2, 3]; walk { wanted => sub {} }, $data; $self->assert_str_equals ('ARRAY', ref $data); $success = $data =~ /^ARRAY\(0x[0-9a-f]+\)$/; $self->assert ($success, "Simple array has been blessed: $data."); } 1; #Local Variables: #mode: perl #perl-indent-level: 4 #perl-continued-statement-offset: 4 #perl-continued-brace-offset: 0 #perl-brace-offset: -4 #perl-brace-imaginary-offset: 0 #perl-label-offset: -4 #cperl-indent-level: 4 #cperl-continued-statement-offset: 2 #tab-width: 8 #End: Data-Walk-1.00/t/TC_Basic.pm0000755000177200001440000001066510430641214014447 0ustar guidousers#! /bin/false # $Id: TC_Basic.pm,v 1.6 2006/05/11 13:56:28 guido Exp $ # Data::Walk - Traverse Perl data structures. # Copyright (C) 2005-2006 Guido Flohr , # all rights reserved. # This program is free software; you can redistribute it and/or modify it # under the terms of the GNU Library General Public License as published # by the Free Software Foundation; either version 2, 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 # Library General Public License for more details. # You should have received a copy of the GNU Library 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. package TC_Basic; use strict; use base qw (Test::Unit::TestCase); use Data::Walk; sub testScalar { my $self = shift, my $data = "foobar"; my $item; my $count = 0; my $wanted = sub { ++$count; $item = $_; }; walk $wanted, $data; $self->assert_equals (1, $count); $self->assert_str_equals ($data, $item); } sub testArray { my $self = shift; my $data = [ (0 .. 4) ]; my $count; my $wanted = sub { $self->assert_str_equals ('ARRAY', $Data::Walk::type) unless ref $_; ++$count; }; walk $wanted, $data; $self->assert_equals (1 + @{$data}, $count); } sub testHash { my $self = shift; my @hashdata = qw (a b c d e); my $data = { map { $_ => $_ } @hashdata }; my $count; my $wanted = sub { $self->assert_str_equals ('HASH', $Data::Walk::type) unless ref $_; ++$count; }; walk $wanted, $data; $self->assert_equals (1 + 2 * @hashdata, $count); } sub testMixed { my $self = shift; my @hashdata = qw (a b c d e); my $data = { map { $_ => $_ } @hashdata }; my @list = (0 .. 4); $data->{list} = [ @list ]; my $count; my $wanted = sub { ++$count; }; walk $wanted, $data; $self->assert_equals (1 + 2 * @hashdata + 2 + @list, $count); } sub testBlessedArray { my $self = shift; my $data = [ (0 .. 4) ]; bless $data; my $count; my $wanted = sub { $self->assert_str_equals ('ARRAY', $Data::Walk::type) unless ref $_; ++$count; }; walk $wanted, $data; $self->assert_equals (1 + @{$data}, $count); } sub testBlessedHash { my $self = shift; my @hashdata = qw (a b c d e); my $data = { map { $_ => $_ } @hashdata }; bless $data; my $count; my $wanted = sub { $self->assert_str_equals ('HASH', $Data::Walk::type) unless ref $_; ++$count; }; walk $wanted, $data; $self->assert_equals (1 + 2 * @hashdata, $count); } sub testBlessedMixed { my $self = shift; my @hashdata = qw (a b c d e); my $data = { map { $_ => $_ } @hashdata }; my @list = (0 .. 4); $data->{list} = [ @list ]; bless $data; bless $data->{list}; my $count; my $wanted = sub { ++$count; }; walk $wanted, $data; $self->assert_equals (1 + 2 * @hashdata + 2 + @list, $count); } sub testTraverse { my $self = shift; my $data = [[[[[ 1 ], 11], 111], 1111], 11111]; my $wasref = 1; my $last = ''; my $wanted = sub { my $isref = ref $_; $self->assert ($wasref || (!$wasref && !$isref), "References and non-references should " . "alternate only once. " . "Last: $last ($wasref), current: $_ ($isref)."); $last = $_; $wasref = $isref; }; walk $wanted, $data; $self->assert (!$wasref, "The last visited node should not be " . "a reference."); } sub testDepth { my $self = shift; # The test data is constructed so that each node that is an # array reference has a number of elements equal to its depth. # Scalars are also equal to their depth. my $data = [ [ 3, [ 4, 4, 4, ], ], ]; my $wanted = sub { if (ref $_) { my $num = @$_; $self->assert_num_equals ($num, $Data::Walk::depth); } else { $self->assert_num_equals ($_, $Data::Walk::depth); } }; walk $wanted, $data; } 1; #Local Variables: #mode: perl #perl-indent-level: 4 #perl-continued-statement-offset: 4 #perl-continued-brace-offset: 0 #perl-brace-offset: -4 #perl-brace-imaginary-offset: 0 #perl-label-offset: -4 #cperl-indent-level: 4 #cperl-continued-statement-offset: 2 #tab-width: 8 #End: Data-Walk-1.00/t/TC_Copy.pm0000755000177200001440000000414610430641214014335 0ustar guidousers#! /bin/false # $Id: TC_Copy.pm,v 1.3 2006/05/11 13:56:28 guido Exp $ # Data::Walk - Traverse Perl data structures. # Copyright (C) 2005-2006 Guido Flohr , # all rights reserved. # This program is free software; you can redistribute it and/or modify it # under the terms of the GNU Library General Public License as published # by the Free Software Foundation; either version 2, 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 # Library General Public License for more details. # You should have received a copy of the GNU Library 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. package TC_Copy; use strict; use base qw (Test::Unit::TestCase); use Data::Walk; sub testHashCopy { my ($self) = @_; my $data = { foo => 'bar', baz => 'bazoo', }; my $count = 0; my $preprocess = sub { my %args= @_; delete $args{baz}; return %args; }; walk { wanted => sub { ++$count }, preprocess => $preprocess }, $data; $self->assert_str_equals ($data->{foo}, 'bar'); $self->assert_str_equals ($data->{baz}, 'bazoo'); $self->assert_num_equals (3, $count); } sub testHashNoCopy { my ($self) = @_; my $data = { foo => 'bar', baz => 'bazoo', }; my $count = 0; my $preprocess = sub { my $args = shift; delete $args->{baz}; return $args; }; walk { wanted => sub { ++$count }, preprocess => $preprocess, copy => 0 }, $data; $self->assert_str_equals ($data->{foo}, 'bar'); $self->assert (!exists $data->{baz}); $self->assert_num_equals (3, $count); } 1; #Local Variables: #mode: perl #perl-indent-level: 4 #perl-continued-statement-offset: 4 #perl-continued-brace-offset: 0 #perl-brace-offset: -4 #perl-brace-imaginary-offset: 0 #perl-label-offset: -4 #cperl-indent-level: 4 #cperl-continued-statement-offset: 2 #tab-width: 8 #End: Data-Walk-1.00/t/TS_Basic.pm0000755000177200001440000000255310430641214014464 0ustar guidousers#! /bin/false # $Id: TS_Basic.pm,v 1.3 2006/05/11 13:56:28 guido Exp $ # Data::Walk - Traverse Perl data structures. # Copyright (C) 2005-2006 Guido Flohr , # all rights reserved. # This program is free software; you can redistribute it and/or modify it # under the terms of the GNU Library General Public License as published # by the Free Software Foundation; either version 2, 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 # Library General Public License for more details. # You should have received a copy of the GNU Library 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. package TS_Basic; use strict; use base qw (Test::Unit::TestSuite); sub name { "Testsuite for basic functionality Data::Walk" } sub include_tests { qw ( TC_Basic TC_ByDepth ); } 1; #Local Variables: #mode: perl #perl-indent-level: 4 #perl-continued-statement-offset: 4 #perl-continued-brace-offset: 0 #perl-brace-offset: -4 #perl-brace-imaginary-offset: 0 #perl-label-offset: -4 #cperl-indent-level: 4 #cperl-continued-statement-offset: 2 #tab-width: 8 #End: Data-Walk-1.00/t/TC_PostProcess.pm0000755000177200001440000000334410430641214015706 0ustar guidousers#! /bin/false # $Id: TC_PostProcess.pm,v 1.3 2006/05/11 13:56:28 guido Exp $ # Data::Walk - Traverse Perl data structures. # Copyright (C) 2005-2006 Guido Flohr , # all rights reserved. # This program is free software; you can redistribute it and/or modify it # under the terms of the GNU Library General Public License as published # by the Free Software Foundation; either version 2, 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 # Library General Public License for more details. # You should have received a copy of the GNU Library 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. package TC_PostProcess; use strict; use base qw (Test::Unit::TestCase); use Data::Walk; sub testCalling { my ($self) = @_; my %data = ('A' .. 'Z', 'a' .. 'z'); my $postprocessor_calls = 0; my $container; my $postprocess = sub { ++$postprocessor_calls; $container = $Data::Walk::container; }; my $wanted = sub {}; walk { wanted => $wanted, postprocess => $postprocess}, \%data; $self->assert ($postprocessor_calls, "Postprocessing function never called."); $self->assert_equals (\%data, $container); } 1; #Local Variables: #mode: perl #perl-indent-level: 4 #perl-continued-statement-offset: 4 #perl-continued-brace-offset: 0 #perl-brace-offset: -4 #perl-brace-imaginary-offset: 0 #perl-label-offset: -4 #cperl-indent-level: 4 #cperl-continued-statement-offset: 2 #tab-width: 8 #End: Data-Walk-1.00/t/TS_Options.pm0000755000177200001440000000260210430641214015071 0ustar guidousers#! /bin/false # $Id: TS_Options.pm,v 1.3 2006/05/11 13:56:28 guido Exp $ # Data::Walk - Traverse Perl data structures. # Copyright (C) 2005-2006 Guido Flohr , # all rights reserved. # This program is free software; you can redistribute it and/or modify it # under the terms of the GNU Library General Public License as published # by the Free Software Foundation; either version 2, 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 # Library General Public License for more details. # You should have received a copy of the GNU Library 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. package TS_Options; use strict; use base qw (Test::Unit::TestSuite); sub name { "Test various options of Data::Walk" } sub include_tests { qw ( TC_PreProcess TC_PostProcess TC_Follow TC_Copy ); } 1; #Local Variables: #mode: perl #perl-indent-level: 4 #perl-continued-statement-offset: 4 #perl-continued-brace-offset: 0 #perl-brace-offset: -4 #perl-brace-imaginary-offset: 0 #perl-label-offset: -4 #cperl-indent-level: 4 #cperl-continued-statement-offset: 2 #tab-width: 8 #End: Data-Walk-1.00/t/TC_Examples.pm0000755000177200001440000000462310430640325015203 0ustar guidousers#! /bin/false # $Id: TC_Examples.pm,v 1.1 2006/05/11 13:49:09 guido Exp $ # Data::Walk - Traverse Perl data structures. # Copyright (C) 2006 Guido Flohr , # all rights reserved. # This program is free software; you can redistribute it and/or modify it # under the terms of the GNU Library General Public License as published # by the Free Software Foundation; either version 2, 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 # Library General Public License for more details. # You should have received a copy of the GNU Library 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. package TC_Examples; use strict; use base qw (Test::Unit::TestCase); use Data::Walk; sub testRecursiveUntainting { my ($self) = @_; # We don't really untaint here, because we don't want to rely # on external modules or on running with -T. my $data = { foo => [ 'bar', [ 'baz', "bazoo\nbazaar" ], ], }; my $concat = ''; my $expect = "foobarbazbazoo\nbazaar"; my $wanted = sub { s/(.*)/$1/s unless ref $_; $concat .= $1 unless ref $_; }; walk $wanted, $data; $self->assert_str_equals ($expect, $concat); } sub testMaxDepth { my ($self) = @_; my $data =[ f => [ fo => [ foo => [ 'Ouch!', ], ], ], b => [ ba => [ bar => [ 'Ouch!', ], ], ], b => [ ba => [ baz => [ 'Ouch!', ], ], ], ]; my $pre_process = sub { if ($Data::Walk::depth > 3) { return (); } else { return @_; } }; my $concat = ''; my $wanted = sub { $self->assert_str_not_equals ('Ouch!', $_) unless ref $_; $concat .= $_ unless ref $_; }; walk { wanted => $wanted, preprocess => $pre_process }, $data; my $expect = "ffofoobbabarbbabaz"; $self->assert_str_equals ($expect, $concat); } 1; #Local Variables: #mode: perl #perl-indent-level: 4 #perl-continued-statement-offset: 4 #perl-continued-brace-offset: 0 #perl-brace-offset: -4 #perl-brace-imaginary-offset: 0 #perl-label-offset: -4 #cperl-indent-level: 4 #cperl-continued-statement-offset: 2 #tab-width: 8 #End: Data-Walk-1.00/t/TC_ByDepth.pm0000755000177200001440000000431510430641214014760 0ustar guidousers#! /bin/false # $Id: TC_ByDepth.pm,v 1.5 2006/05/11 13:56:28 guido Exp $ # Data::Walk - Traverse Perl data structures. # Copyright (C) 2005-2006 Guido Flohr , # all rights reserved. # This program is free software; you can redistribute it and/or modify it # under the terms of the GNU Library General Public License as published # by the Free Software Foundation; either version 2, 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 # Library General Public License for more details. # You should have received a copy of the GNU Library 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. package TC_ByDepth; use strict; use base qw (Test::Unit::TestCase); use Data::Walk; sub testTraverseDepth { my $self = shift; my $data = [[[[[ 1 ], 11], 111], 1111], 11111]; my $wasref = 1; my $last = 'undef'; my $wanted = sub { my $isref = ref $_; $self->assert (($wasref xor $isref), "References and non-references should " . "alternate. Last: $last, current: $_."); $last = $_; $wasref = $isref; }; walkdepth $wanted, $data; } sub testDepth { my $self = shift; # The test data is constructed so that each node that is an # array reference has a number of elements equal to its depth. # Scalars are also equal to their depth. my $data = [ [ 3, [ 4, 4, 4, ], ], ]; my $wanted = sub { if (ref $_) { my $num = @$_; $self->assert_num_equals ($num, $Data::Walk::depth); } else { $self->assert_num_equals ($_, $Data::Walk::depth); } }; walkdepth $wanted, $data; } 1; #Local Variables: #mode: perl #perl-indent-level: 4 #perl-continued-statement-offset: 4 #perl-continued-brace-offset: 0 #perl-brace-offset: -4 #perl-brace-imaginary-offset: 0 #perl-label-offset: -4 #cperl-indent-level: 4 #cperl-continued-statement-offset: 2 #tab-width: 8 #End: Data-Walk-1.00/t/TC_Follow.pm0000755000177200001440000000507210430641214014664 0ustar guidousers#! /bin/false # $Id: TC_Follow.pm,v 1.3 2006/05/11 13:56:28 guido Exp $ # Data::Walk - Traverse Perl data structures. # Copyright (C) 2005-2006 Guido Flohr , # all rights reserved. # This program is free software; you can redistribute it and/or modify it # under the terms of the GNU Library General Public License as published # by the Free Software Foundation; either version 2, 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 # Library General Public License for more details. # You should have received a copy of the GNU Library 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. package TC_Follow; use strict; use base qw (Test::Unit::TestCase); use Data::Walk; my $data = { foo => 'bar' }; $data->{baz} = $data; sub testDoNotFollow { my ($self) = @_; my $count = 0; my $wanted = sub { ++$count; $self->assert ($count <= 5, "Cyclic references were followed although the" . " option 'follow' was not given."); }; walk { wanted => $wanted }, $data; $self->assert_equals (5, $count); } sub testDoFollow { my ($self) = @_; my $count = 0; my $preprocess = sub { my @args = @_; return () if $count > 10; return @args; }; my $wanted = sub { ++$count; }; walk { wanted => $wanted, follow => 1, preprocess => $preprocess, }, $data; $self->assert ($count > 5, "Cyclic references were not followed."); } sub testAddress { my ($self) = @_; my $data = {}; bless $data, 'Data::Walk::Fake'; my $wanted = sub { my $address = int $_; $self->assert_equals ($address, $Data::Walk::address); }; walk { wanted => $wanted }, $data; } sub testSeen { my ($self) = @_; my $scalar = 'foobar'; my $data = [ \$scalar, \$scalar, \$scalar ]; my $count = 0; my $wanted = sub { unless ('ARRAY' eq ref $_) { $self->assert_equals ($count++, $Data::Walk::seen); } }; walk { wanted => $wanted }, $data; $self->assert_equals (@{$data}, $count); } 1; #Local Variables: #mode: perl #perl-indent-level: 4 #perl-continued-statement-offset: 4 #perl-continued-brace-offset: 0 #perl-brace-offset: -4 #perl-brace-imaginary-offset: 0 #perl-label-offset: -4 #cperl-indent-level: 4 #cperl-continued-statement-offset: 2 #tab-width: 8 #End: Data-Walk-1.00/lib/0000755000177200001440000000000010430643140012772 5ustar guidousersData-Walk-1.00/lib/Data/0000755000177200001440000000000010430643140013643 5ustar guidousersData-Walk-1.00/lib/Data/Walk.pm0000755000177200001440000003304710430642756015125 0ustar guidousers#! /bin/false # $Id: Walk.pm,v 1.15 2006/05/11 14:10:54 guido Exp $ # Traverse Perl data structures. # Copyright (C) 2005-2006 Guido Flohr , # all rights reserved. # This program is free software; you can redistribute it and/or modify it # under the terms of the GNU Library General Public License as published # by the Free Software Foundation; either version 2, 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 # Library General Public License for more details. # You should have received a copy of the GNU Library 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. package Data::Walk; use strict; use 5.004; require Exporter; use vars qw ($VERSION @ISA @EXPORT); $VERSION = '1.00'; @ISA = qw (Exporter); @EXPORT = qw (walk walkdepth); use vars qw ($container $type $seen $address $depth); # Forward declarations. sub walk; sub walkdepth; sub __walk; sub __recurse; sub walk { my ($options, @args) = @_; unless ('HASH' eq ref $options) { $options = { wanted => $options }; } __walk ($options, @args); } sub walkdepth { my ($options, @args) = @_; unless ('HASH' eq ref $options) { $options = { wanted => $options }; } $options->{bydepth} = 1; __walk ($options, @args); } sub __walk { my ($options, @args) = @_; $options->{seen} = {}; $options->{copy} = 1 unless exists $options->{copy}; foreach my $item (@args) { local $depth; $depth = 0; __recurse $options, $item; } return 1; } sub __recurse { my ($options, $item) = @_; ++$depth; my @children; my $data_type; local ($address, $seen); undef $address; $seen = 0; my $ref = ref $item; if ($ref) { my $blessed = -1 != index $ref, '='; # Avoid fancy overloading stuff. bless $item if $blessed; $address = int $item; $seen = $options->{seen}->{$address}++; if (UNIVERSAL::isa ($item, 'HASH')) { $data_type = 'HASH'; } elsif (UNIVERSAL::isa ($item, 'ARRAY')) { $data_type = 'ARRAY'; } else { $data_type = ''; } if ($data_type eq 'HASH' || $data_type eq 'ARRAY') { if (('ARRAY' eq $data_type || 'HASH' eq $data_type)) { if ('ARRAY' eq $data_type) { @children = @{$item}; } else { @children = %{$item}; } if ($options->{copy}) { if ('ARRAY' eq $data_type) { @children = $options->{preprocess} (@{$item}) if $options->{preprocess}; } else { @children = %{$item}; @children = $options->{preprocess} (@children) if $options->{preprocess}; @children = $options->{preprocess_hash} (@children) if $options->{preprocess_hash}; } } else { $item = $options->{preprocess} ($item) if $options->{preprocess}; $item = $options->{preprocess_hash} ($item) if 'HASH' eq $data_type && $options->{preprocess_hash}; @children = 'HASH' eq $data_type ? %{$item} : @{$item}; } } } } unless ($options->{bydepth}) { $_ = $item; $options->{wanted}->($item); } local ($container, $type); $type = $data_type; $container = $item; if ($options->{follow} || !$seen) { foreach my $child (@children) { __recurse $options, $child; } } if ($options->{bydepth}) { $_ = $item; $options->{wanted}->($item); } $options->{postprocess}->() if $options->{postprocess}; --$depth; # void } 1; =head1 NAME Data::Walk - Traverse Perl data structures =head1 SYNOPSIS use Data::Walk; walk \&wanted, @items_to_walk; use Data::Walk; walkdepth \&wanted, @items_to_walk; use Data::Walk; walk { wanted => \&process, follow => 1 }, $self; =head1 DESCRIPTION The above synopsis bears an amazing similarity to File::Find(3pm) and this is not coincidental. Data::Walk(3pm) is for data what File::Find(3pm) is for files. You can use it for rolling your own serialization class, for displaying Perl data structures, for deep copying or comparing, for recursive deletion of data, or ... If you are impatient and already familiar with File::Find(3pm), you can skip the following documentation and proceed with L. =head1 FUNCTIONS The module exports two functions by default: =over 4 =item B walk \&wanted, @items; walk \%options, @items; As the name suggests, the function traverses the items in the order they are given. For every object visited, it calls the &wanted subroutine. See L for details. =item B walkdepth \&wanted, @items; walkdepth \%options, @items; Works exactly like C but it first descends deeper into the structure, before visiting the nodes on the current level. If you want to delete visited nodes, then C is probably your friend. =back =head1 OPTIONS The first argument to C and C is either a code reference to your &wanted function, or a hash reference describing the operations to be performed for each visited node. Here are the possible keys for the hash. =over 4 =item B The value should be a code reference. This code reference is described in L below. =item B Visits nodes on the current level of recursion only B descending into subnotes. The entry point C is a shortcut for specifying C<{ bydepth =E 1 }>. =item B The value should be a code reference. This code reference is used to preprocess the current node $Data::Walk::container. Your preprocessing function is called before the loop that calls the C function. It is called with a list of member nodes and is expected to return such a list. The list will contain all sub-nodes, regardless of the value of the option I! The list is normally a shallow copy of the data contained in the original structure. You can therefore safely delete items in it, without affecting the original data. You can use the option I, if you want to change that behavior. The behavior is identical for regular arrays and hashes, so you probably want to coerce the list passed as an argument into a hash then. The variable $Data::Walk::type will contain the string "HASH" if the currently inspected node is a hash. You can use the preprocessing function to sort the items contained or to filter out unwanted items. The order is also preserved for hashes! =item B The value should be a code reference. The code is executed right after an eventual I handler, but only if the current container is a hash. It is skipped for regular arrays. You will usually prefer a I handler over a I handler if you only want to sort hash keys. =item B The value should be a code reference. It is invoked just before leaving the currently visited node. It is called in void context with no arguments. The variable $Data::Walk::container points to the currently visited node. =item B Causes cyclic references to be followed. Normally, the traversal will not descend into nodes that have already been visited. If you set the option I to a truth value, you can change this behavior. Unless you take additional measures, this will always imply an infinite loop! Please note that the &wanted function is also called for nodes that have already been visited! The effect of I is to suppress descending into subnodes. =item B Normally, the &preprocess function is called with a shallow copy of the data. If you set the option I to a false value, the &preprocess function is called with one single argument, a reference to the original data structure. In that case, you also have to return a suitable reference. Using this option will result in a slight performance win, and can make it sometimes easier to manipulate the original data. What is a shallow copy? Think of a list containing references to hashes: my @list = ({ foo => 'bar' }, { foo => 'baz' }); my @shallow = @list; After this, @shallow will contain a new list, but the items stored in it are exactly identical to the ones stored in the original. In other words, @shallow occupies new memory, whereas both lists contain references to the same memory for the list members. =back All other options are silently ignored. =head1 THE WANTED FUNCTION The &wanted function does whatever verifications you want on each item in the data structure. Note that despite its name, the &wanted function is a generic callback and does B tell Data::Walk(3pm) if an item is "wanted" or not. In fact, its return value is ignored. The wanted function takes no arguments but rather does its work through a collection of variables: =over 4 =item B<$_> The currently visited node. Think "file" in terms of File::Find(3pm)! =item B<$Data::Walk::container> The node containing the currently visited node, either a reference to a hash or an array. Think "directory" in terms of File::Find(3pm)! =item B<$Data::Walk::type> The base type of the object that $Data::Walk::container references. This is either "ARRAY" or "HASH". =item B<$Data::Walk::seen> For references, this will hold the number of times the currently visited node has been visited I. The value is consequently set to 0 not 1 on the first visit. For non-references, the value is undefined. =item B<$Data::Walk::address> For references, this will hold the memory address it points to. It can be used as a unique identifier for the current node. For non- references, the value is undefined. =item B<$Data::Walk::depth> The depth of the current recursion. =back These variables should not be modified. =head1 DIFFERENCES TO FILE::FIND The API of Data::Walk(3pm) tries to mimic the API of File::Find(3pm) to a certain extent. If you are already familiar with File::Find(3pm) you will find it very easy to use Data::Walk(3pm). Even the documentation for Data::Walk(3pm) is in parts similar or identcal to that of File::Find(3pm). =head2 Analogies The equivalent of directories in File::Find(3pm) are the container data types in Data::Walk(3pm). Container data types are arrays (aka lists) and associative arrays (aka hashes). Files are equivalent to scalars. Wherever File::Find(3pm) passes lists of strings to functions, Data::Walk(3pm) passes lists of variables. =head2 Function Names Instead of C and C, Data::Walk(3pm) uses C and C, like the smart reader has already guessed after reading the L. =head2 Variables The variable $Data::Walk::container is vaguely equivalent to $File::Find::dir. All other variables are specific to the corresponding module. =head2 Wanted Function Like its archetype from File::Find(3pm), the wanted function of Data::Walk(3pm) is called with $_ set to the currently inspected item. =head2 Options The option I has the effect that Data::Walk(3pm) also descends into nodes it has already visited. Unless you take extra measures, this will lead to an infinite loop! A number of options are not applicable to data traversion and are ignored by Data::Walk(3pm). Examples are I, I, I, I, I, and I. To give truth the honor, all unrecognized options are skipped. You may argue, that the options I and friends would be useful, too, allowing you to recursively untaint data structures. But, hey, that is what Data::Walk(3pm) is all about. It makes it very easy for you to write that yourself. =head1 EXAMPLES Following are some recipies for common tasks. =head2 Recursive Untainting sub untaint { s/(.*)/$1/s unless ref $_; }; walk \&untaint, $data; See perlsec(1), if you don't understand why the untaint() function untaints your data here. =head2 Recurse To Maximum Depth If you want to stop the recursion at a certain level, do it as follows: my $max_depth = 20; sub not_too_deep { if ($Data::Walk::depth > $max_depth) { return (); } else { return @_; } } sub do_something1 { # Your code goes here. } walk { wanted => \&do_something, preprocess => \¬_too_deep }; =head1 BUGS If you think you have spotted a bug, you can share it with others in the bug tracking system at http://rt.cpan.org/NoAuth/Bugs.html?Dist=Data-Walk. =head1 COPYING Copyright (C) 2005-2006, Guido Flohr Eguido@imperia.netE, all rights reserved. This program is free software; you can redistribute it and/or modify it under the terms of the GNU Library General Public License as published by the Free Software Foundation; either version 2, 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 Library General Public License for more details. You should have received a copy of the GNU Library 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. =head1 SEE ALSO Data::Dumper(3pm), Storable(3pm), File::Find(3pm), perl(1) =cut #Local Variables: #mode: perl #perl-indent-level: 4 #perl-continued-statement-offset: 4 #perl-continued-brace-offset: 0 #perl-brace-offset: -4 #perl-brace-imaginary-offset: 0 #perl-label-offset: -4 #cperl-indent-level: 4 #cperl-continued-statement-offset: 2 #tab-width: 8 #End: Data-Walk-1.00/NEWS0000644000177200001440000000044410430642417012733 0ustar guidousersVersion 1.00 - 11 May 2006 * The API is now considered stable. * New global variable $Data::Walk::depth. * Section "EXAMPLES" with some recipies in the pod Data::Walk(3). Version 0.02 - 06 Dec 2005 * Renamed from Data::Traverse to Data::Walk. Version 0.01 - 15 Nov 2005 * First version. Data-Walk-1.00/SIGNATURE0000644000177200001440000000375310430643152013523 0ustar guidousersThis file contains message digests of all files listed in MANIFEST, signed via the Module::Signature module, version 0.44. To verify the content in this distribution, first make sure you have Module::Signature installed, then type: % cpansign -v It will check each file's integrity, as well as the signature's validity. If "==> Signature verified OK! <==" is not displayed, the distribution may already have been compromised, and you should not run its Makefile.PL or Build.PL. -----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 SHA1 cd14cda34781e143c73c252fb59dacd1834c2a86 Build.PL SHA1 cf756914ec51f52f9c121be247bfda232dc6afd2 COPYING.LESSER SHA1 4487ba2812cd0c318e7ae6bc9aceed51ecf48093 ChangeLog SHA1 b1d0e346e7199f81419de341b62fd92b3248c5e9 MANIFEST SHA1 2ccbd2894280e6848945c325efd7f0f6b2d2c92a META.yml SHA1 07e9f731045077df62537ce557709f6cf491ee9e Makefile.PL SHA1 d2ae44cbc79ed8c7d3c9e5366293a156c0a89155 NEWS SHA1 d4719df45c2d61df0e2b8aeeced29123ce49a7b8 README SHA1 d2ae44cbc79ed8c7d3c9e5366293a156c0a89155 ReleaseNotes SHA1 7db05162d55861348dbcd76f0acb84e3e65f2d09 lib/Data/Walk.pm SHA1 c99a7be6b4c122a8d2f098257608034b04ad59d9 t/TC_Basic.pm SHA1 94a02e7ad32d45452465af97d4191cddd85da7cc t/TC_Bugs.pm SHA1 4a3f5fa155f7f7257ed1883dc7819767532b6acc t/TC_ByDepth.pm SHA1 b52e1825ee46da5c0428c220c92ef7667367816e t/TC_Copy.pm SHA1 3c3dfba4dd59c3892969dd6709f31dbda46ca6de t/TC_Examples.pm SHA1 c8b798dece21a9c66ea12ac3c65849e6ddcba7bf t/TC_Follow.pm SHA1 7c4360baacf829f2e9512f4b6f8df047a37a5e7c t/TC_PostProcess.pm SHA1 d4eaa13a99ec59029e5f9edf316efd07a0171d59 t/TC_PreProcess.pm SHA1 01be03c11cfb262bef8372062ef73ddbf4ec9494 t/TS_All.pm SHA1 a92bc61ceade3316a432cabc3a4c08f73b952911 t/TS_Basic.pm SHA1 0566fd2a65501085f0c20ab17c3015477ec9e6b6 t/TS_Options.pm SHA1 1b2d4ace36c65a7469ca04b1c4908871c426e6e5 t/testrunner.t -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.2.2 (GNU/Linux) iD8DBQFEY0ZqOo0HNPWNDz0RAiYUAKCCDzGqrytzQpWSa7yd/2xqIYkbMgCg8oT0 ko/I4f00Ft9E+2odtzcyBNA= =8xB+ -----END PGP SIGNATURE----- Data-Walk-1.00/COPYING.LESSER0000755000177200001440000006364410336341757014311 0ustar guidousers GNU LESSER GENERAL PUBLIC LICENSE Version 2.1, February 1999 Copyright (C) 1991, 1999 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. [This is the first released version of the Lesser GPL. It also counts as the successor of the GNU Library Public License, version 2, hence the version number 2.1.] Preamble The licenses for most software are designed to take away your freedom to share and change it. By contrast, the GNU General Public Licenses are intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users. This license, the Lesser General Public License, applies to some specially designated software packages--typically libraries--of the Free Software Foundation and other authors who decide to use it. You can use it too, but we suggest you first think carefully about whether this license or the ordinary General Public License is the better strategy to use in any particular case, based on the explanations below. When we speak of free software, we are referring to freedom of use, 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 and use pieces of it in new free programs; and that you are informed that you can do these things. To protect your rights, we need to make restrictions that forbid distributors to deny you these rights or to ask you to surrender these rights. These restrictions translate to certain responsibilities for you if you distribute copies of the library or if you modify it. For example, if you distribute copies of the library, whether gratis or for a fee, you must give the recipients all the rights that we gave you. You must make sure that they, too, receive or can get the source code. If you link other code with the library, you must provide complete object files to the recipients, so that they can relink them with the library after making changes to the library and recompiling it. And you must show them these terms so they know their rights. We protect your rights with a two-step method: (1) we copyright the library, and (2) we offer you this license, which gives you legal permission to copy, distribute and/or modify the library. To protect each distributor, we want to make it very clear that there is no warranty for the free library. Also, if the library is modified by someone else and passed on, the recipients should know that what they have is not the original version, so that the original author's reputation will not be affected by problems that might be introduced by others. ^L Finally, software patents pose a constant threat to the existence of any free program. We wish to make sure that a company cannot effectively restrict the users of a free program by obtaining a restrictive license from a patent holder. Therefore, we insist that any patent license obtained for a version of the library must be consistent with the full freedom of use specified in this license. Most GNU software, including some libraries, is covered by the ordinary GNU General Public License. This license, the GNU Lesser General Public License, applies to certain designated libraries, and is quite different from the ordinary General Public License. We use this license for certain libraries in order to permit linking those libraries into non-free programs. When a program is linked with a library, whether statically or using a shared library, the combination of the two is legally speaking a combined work, a derivative of the original library. The ordinary General Public License therefore permits such linking only if the entire combination fits its criteria of freedom. The Lesser General Public License permits more lax criteria for linking other code with the library. We call this license the "Lesser" General Public License because it does Less to protect the user's freedom than the ordinary General Public License. It also provides other free software developers Less of an advantage over competing non-free programs. These disadvantages are the reason we use the ordinary General Public License for many libraries. However, the Lesser license provides advantages in certain special circumstances. For example, on rare occasions, there may be a special need to encourage the widest possible use of a certain library, so that it becomes a de-facto standard. To achieve this, non-free programs must be allowed to use the library. A more frequent case is that a free library does the same job as widely used non-free libraries. In this case, there is little to gain by limiting the free library to free software only, so we use the Lesser General Public License. In other cases, permission to use a particular library in non-free programs enables a greater number of people to use a large body of free software. For example, permission to use the GNU C Library in non-free programs enables many more people to use the whole GNU operating system, as well as its variant, the GNU/Linux operating system. Although the Lesser General Public License is Less protective of the users' freedom, it does ensure that the user of a program that is linked with the Library has the freedom and the wherewithal to run that program using a modified version of the Library. The precise terms and conditions for copying, distribution and modification follow. Pay close attention to the difference between a "work based on the library" and a "work that uses the library". The former contains code derived from the library, whereas the latter must be combined with the library in order to run. ^L GNU LESSER GENERAL PUBLIC LICENSE TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 0. This License Agreement applies to any software library or other program which contains a notice placed by the copyright holder or other authorized party saying it may be distributed under the terms of this Lesser General Public License (also called "this License"). Each licensee is addressed as "you". A "library" means a collection of software functions and/or data prepared so as to be conveniently linked with application programs (which use some of those functions and data) to form executables. The "Library", below, refers to any such software library or work which has been distributed under these terms. A "work based on the Library" means either the Library or any derivative work under copyright law: that is to say, a work containing the Library or a portion of it, either verbatim or with modifications and/or translated straightforwardly into another language. (Hereinafter, translation is included without limitation in the term "modification".) "Source code" for a work means the preferred form of the work for making modifications to it. For a library, 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 library. Activities other than copying, distribution and modification are not covered by this License; they are outside its scope. The act of running a program using the Library is not restricted, and output from such a program is covered only if its contents constitute a work based on the Library (independent of the use of the Library in a tool for writing it). Whether that is true depends on what the Library does and what the program that uses the Library does. 1. You may copy and distribute verbatim copies of the Library's complete 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 distribute a copy of this License along with the Library. 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 Library or any portion of it, thus forming a work based on the Library, 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) The modified work must itself be a software library. b) You must cause the files modified to carry prominent notices stating that you changed the files and the date of any change. c) You must cause the whole of the work to be licensed at no charge to all third parties under the terms of this License. d) If a facility in the modified Library refers to a function or a table of data to be supplied by an application program that uses the facility, other than as an argument passed when the facility is invoked, then you must make a good faith effort to ensure that, in the event an application does not supply such function or table, the facility still operates, and performs whatever part of its purpose remains meaningful. (For example, a function in a library to compute square roots has a purpose that is entirely well-defined independent of the application. Therefore, Subsection 2d requires that any application-supplied function or table used by this function must be optional: if the application does not supply it, the square root function must still compute square roots.) These requirements apply to the modified work as a whole. If identifiable sections of that work are not derived from the Library, 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 Library, 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 Library. In addition, mere aggregation of another work not based on the Library with the Library (or with a work based on the Library) on a volume of a storage or distribution medium does not bring the other work under the scope of this License. 3. You may opt to apply the terms of the ordinary GNU General Public License instead of this License to a given copy of the Library. To do this, you must alter all the notices that refer to this License, so that they refer to the ordinary GNU General Public License, version 2, instead of to this License. (If a newer version than version 2 of the ordinary GNU General Public License has appeared, then you can specify that version instead if you wish.) Do not make any other change in these notices. ^L Once this change is made in a given copy, it is irreversible for that copy, so the ordinary GNU General Public License applies to all subsequent copies and derivative works made from that copy. This option is useful when you wish to copy part of the code of the Library into a program that is not a library. 4. You may copy and distribute the Library (or a portion or derivative of it, under Section 2) in object code or executable form under the terms of Sections 1 and 2 above provided that you 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. If distribution of 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 satisfies the requirement to distribute the source code, even though third parties are not compelled to copy the source along with the object code. 5. A program that contains no derivative of any portion of the Library, but is designed to work with the Library by being compiled or linked with it, is called a "work that uses the Library". Such a work, in isolation, is not a derivative work of the Library, and therefore falls outside the scope of this License. However, linking a "work that uses the Library" with the Library creates an executable that is a derivative of the Library (because it contains portions of the Library), rather than a "work that uses the library". The executable is therefore covered by this License. Section 6 states terms for distribution of such executables. When a "work that uses the Library" uses material from a header file that is part of the Library, the object code for the work may be a derivative work of the Library even though the source code is not. Whether this is true is especially significant if the work can be linked without the Library, or if the work is itself a library. The threshold for this to be true is not precisely defined by law. If such an object file uses only numerical parameters, data structure layouts and accessors, and small macros and small inline functions (ten lines or less in length), then the use of the object file is unrestricted, regardless of whether it is legally a derivative work. (Executables containing this object code plus portions of the Library will still fall under Section 6.) Otherwise, if the work is a derivative of the Library, you may distribute the object code for the work under the terms of Section 6. Any executables containing that work also fall under Section 6, whether or not they are linked directly with the Library itself. ^L 6. As an exception to the Sections above, you may also combine or link a "work that uses the Library" with the Library to produce a work containing portions of the Library, and distribute that work under terms of your choice, provided that the terms permit modification of the work for the customer's own use and reverse engineering for debugging such modifications. You must give prominent notice with each copy of the work that the Library is used in it and that the Library and its use are covered by this License. You must supply a copy of this License. If the work during execution displays copyright notices, you must include the copyright notice for the Library among them, as well as a reference directing the user to the copy of this License. Also, you must do one of these things: a) Accompany the work with the complete corresponding machine-readable source code for the Library including whatever changes were used in the work (which must be distributed under Sections 1 and 2 above); and, if the work is an executable linked with the Library, with the complete machine-readable "work that uses the Library", as object code and/or source code, so that the user can modify the Library and then relink to produce a modified executable containing the modified Library. (It is understood that the user who changes the contents of definitions files in the Library will not necessarily be able to recompile the application to use the modified definitions.) b) Use a suitable shared library mechanism for linking with the Library. A suitable mechanism is one that (1) uses at run time a copy of the library already present on the user's computer system, rather than copying library functions into the executable, and (2) will operate properly with a modified version of the library, if the user installs one, as long as the modified version is interface-compatible with the version that the work was made with. c) Accompany the work with a written offer, valid for at least three years, to give the same user the materials specified in Subsection 6a, above, for a charge no more than the cost of performing this distribution. d) If distribution of the work is made by offering access to copy from a designated place, offer equivalent access to copy the above specified materials from the same place. e) Verify that the user has already received a copy of these materials or that you have already sent this user a copy. For an executable, the required form of the "work that uses the Library" must include any data and utility programs needed for reproducing the executable from it. However, as a special exception, the materials to be 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. It may happen that this requirement contradicts the license restrictions of other proprietary libraries that do not normally accompany the operating system. Such a contradiction means you cannot use both them and the Library together in an executable that you distribute. ^L 7. You may place library facilities that are a work based on the Library side-by-side in a single library together with other library facilities not covered by this License, and distribute such a combined library, provided that the separate distribution of the work based on the Library and of the other library facilities is otherwise permitted, and provided that you do these two things: a) Accompany the combined library with a copy of the same work based on the Library, uncombined with any other library facilities. This must be distributed under the terms of the Sections above. b) Give prominent notice with the combined library of the fact that part of it is a work based on the Library, and explaining where to find the accompanying uncombined form of the same work. 8. You may not copy, modify, sublicense, link with, or distribute the Library except as expressly provided under this License. Any attempt otherwise to copy, modify, sublicense, link with, or distribute the Library 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. 9. 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 Library or its derivative works. These actions are prohibited by law if you do not accept this License. Therefore, by modifying or distributing the Library (or any work based on the Library), you indicate your acceptance of this License to do so, and all its terms and conditions for copying, distributing or modifying the Library or works based on it. 10. Each time you redistribute the Library (or any work based on the Library), the recipient automatically receives a license from the original licensor to copy, distribute, link with or modify the Library 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 with this License. ^L 11. 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 Library at all. For example, if a patent license would not permit royalty-free redistribution of the Library 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 Library. 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. 12. If the distribution and/or use of the Library is restricted in certain countries either by patents or by copyrighted interfaces, the original copyright holder who places the Library 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. 13. The Free Software Foundation may publish revised and/or new versions of the Lesser 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 Library 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 Library does not specify a license version number, you may choose any version ever published by the Free Software Foundation. ^L 14. If you wish to incorporate parts of the Library into other free programs whose distribution conditions are incompatible with these, 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 15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE LIBRARY "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 LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 16. 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 LIBRARY 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 LIBRARY (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 LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. END OF TERMS AND CONDITIONS ^L How to Apply These Terms to Your New Libraries If you develop a new library, and you want it to be of the greatest possible use to the public, we recommend making it free software that everyone can redistribute and change. You can do so by permitting redistribution under these terms (or, alternatively, under the terms of the ordinary General Public License). To apply these terms, attach the following notices to the library. 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 library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with this library; 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. You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the library, if necessary. Here is a sample; alter the names: Yoyodyne, Inc., hereby disclaims all copyright interest in the library `Frob' (a library for tweaking knobs) written by James Random Hacker. , 1 April 1990 Ty Coon, President of Vice That's all there is to it! Data-Walk-1.00/README0000644000177200001440000000113410345337470013116 0ustar guidousers$Id: README,v 1.7 2005/12/06 16:41:28 guido Exp $ Data::Walk is for data, what File::Find is for file systems. You can use it for traversing arbitrarily complex Perl data structures. Its closest relatives on CPAN are currently Data::Traverse and Data::Walker. Data::Traverse is very similar but can only handle unblessed references and has less options. Data::Walker offers an interactive approach for traversing data structures. Data::Dumper also offers some callbacks when traversing the structures, but not the ones that I needed. That was motivation enough for writing Data::Walk. Guido FlohrData-Walk-1.00/ReleaseNotes0000644000177200001440000000044410430642445014551 0ustar guidousersVersion 1.00 - 11 May 2006 * The API is now considered stable. * New global variable $Data::Walk::depth. * Section "EXAMPLES" with some recipies in the pod Data::Walk(3). Version 0.02 - 06 Dec 2005 * Renamed from Data::Traverse to Data::Walk. Version 0.01 - 15 Nov 2005 * First version. Data-Walk-1.00/Build.PL0000644000177200001440000000256310430641214013526 0ustar guidousers#! /usr/local/bin/perl -w # $Id: Build.PL,v 1.3 2006/05/11 13:56:28 guido Exp $ # Experimental build builder script for Data-Walk. # Copyright (C) 2005-2006 Guido Flohr , # all rights reserved. # This program is free software; you can redistribute it and/or modify it # under the terms of the GNU Library General Public License as published # by the Free Software Foundation; either version 2, 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 # Library General Public License for more details. # You should have received a copy of the GNU Library 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. use strict; use Module::Build; my $build = Module::Build->new ( module_name => 'Data::Walk', license => 'lgpl', requires => { }, ); $build->create_build_script; #Local Variables: #mode: perl #perl-indent-level: 4 #perl-continued-statement-offset: 4 #perl-continued-brace-offset: 0 #perl-brace-offset: -4 #perl-brace-imaginary-offset: 0 #perl-label-offset: -4 #cperl-indent-level: 4 #cperl-continued-statement-offset: 2 #tab-width: 8 #End: Data-Walk-1.00/Makefile.PL0000644000177200001440000000341410430642463014207 0ustar guidousers#! /usr/local/bin/perl -w # -*- perl -*- # $Id: Makefile.PL,v 1.6 2006/05/11 13:56:28 guido Exp $ # Makefile generator for Data-Find. # Copyright (C) 2005-2006 Guido Flohr , # all rights reserved. # This program is free software; you can redistribute it and/or modify it # under the terms of the GNU Library General Public License as published # by the Free Software Foundation; either version 2, 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 # Library General Public License for more details. # You should have received a copy of the GNU Library 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.use ExtUtils::MakeMaker; use 5.004; use ExtUtils::MakeMaker; WriteMakefile ( NAME => 'Data::Walk', VERSION_FROM => 'lib/Data/Walk.pm', ($] >= 5.005 ? (ABSTRACT => 'Traverse Perl data structures.', AUTHOR => 'Guido Flohr ', ) : (), ), PREREQ_PM => {}, PL_FILES => {}, (MM->can ('signature_target') ? (SIGN => 1) : ()), LICENSE => 'lgpl', ); sub MY::postamble { q ( all :: ReleaseNotes # Make search.cpan.org happy but still follow GNU standards: # (Thanks to Graham Barr for the hint) ReleaseNotes: NEWS cat NEWS >$@ ); } __END__ Local Variables: mode: perl perl-indent-level: 4 perl-continued-statement-offset: 4 perl-continued-brace-offset: 0 perl-brace-offset: -4 perl-brace-imaginary-offset: 0 perl-label-offset: -4 cperl-indent-level: 4 cperl-continued-statement-offset: 2 tab-width: 8 End: Data-Walk-1.00/META.yml0000644000177200001440000000061510430643140013477 0ustar guidousers--- #YAML:1.0 name: Data-Walk version: 1.00 abstract: Traverse Perl data structures. license: lgpl generated_by: ExtUtils::MakeMaker version 6.30_01 author: Guido Flohr distribution_type: module requires: meta-spec: url: ; version: 1.1 Data-Walk-1.00/ChangeLog0000644000177200001440000001124510430643064014006 0ustar guidousers2006-05-11 17:11 Guido Flohr * x-changelog.sh: search cvs2cl in $PATH 2006-05-11 17:10 Guido Flohr * lib/Data/Walk.pm: bumped version number to 1.00 2006-05-11 17:10 Guido Flohr * NEWS, ReleaseNotes, ChangeLog: updated 2006-05-11 17:10 Guido Flohr * MANIFEST: fixed typo 2006-05-11 16:56 Guido Flohr * Build.PL, Makefile.PL, lib/Data/Walk.pm, t/TC_Basic.pm, t/TC_Bugs.pm, t/TC_ByDepth.pm, t/TC_Copy.pm, t/TC_Follow.pm, t/TC_PostProcess.pm, t/TC_PreProcess.pm, t/TS_All.pm, t/TS_Basic.pm, t/TS_Options.pm, t/testrunner.t: changed copyright year 2006-05-11 16:50 Guido Flohr * t/: TC_Basic.pm, TC_ByDepth.pm: test for new variable $Data::Walk::depth 2006-05-11 16:50 Guido Flohr * lib/Data/Walk.pm: added example code to pod 2006-05-11 16:49 Guido Flohr * MANIFEST, t/TC_Examples.pm, t/TS_All.pm: tests for example code added 2006-05-11 12:42 Guido Flohr * lib/Data/Walk.pm: Use UNIVERSAL::isa for determining the base data type of references. 2005-12-06 18:42 Guido Flohr * ChangeLog: re-generated 2005-12-06 18:42 Guido Flohr * NEWS, ReleaseNotes, lib/Data/Walk.pm: bumped version number to 0.02 2005-12-06 18:41 Guido Flohr * README: concise README 2005-12-06 18:41 Guido Flohr * Makefile.PL: README is no longer generated 2005-11-15 13:19 Guido Flohr * Build.PL, MANIFEST, MANIFEST.SKIP, META.yml, Makefile.PL, README, lib/Data/Walk.pm, t/TC_Basic.pm, t/TC_Bugs.pm, t/TC_ByDepth.pm, t/TC_Copy.pm, t/TC_Follow.pm, t/TC_PostProcess.pm, t/TC_PreProcess.pm, t/TS_All.pm, t/TS_Basic.pm, t/TS_Options.pm: renamed from Data::Traverse to Data::Walk 2005-11-15 01:58 Guido Flohr * ChangeLog: re-generated 2005-11-15 01:58 Guido Flohr * META.yml: author 2005-11-15 01:56 Guido Flohr * MANIFEST, META.yml: added META.yml 2005-11-15 01:53 Guido Flohr * ChangeLog: re-generated 2005-11-15 01:52 Guido Flohr * NEWS, ReleaseNotes: first release 2005-11-15 01:39 Guido Flohr * README: re-generated 2005-11-15 01:38 Guido Flohr * lib/Data/Walk.pm: - handle blessed structures - code cleaned up - pod corrected 2005-11-15 01:33 Guido Flohr * MANIFEST.SKIP: renamed Data-Find to Data-Traverse 2005-11-15 01:32 Guido Flohr * t/TC_Basic.pm: test blessed structures 2005-11-15 01:31 Guido Flohr * MANIFEST: restructured test suites 2005-11-15 01:29 Guido Flohr * Makefile.PL: added license information 2005-11-15 00:31 Guido Flohr * t/: TC_Bugs.pm, TS_All.pm, TS_Basic.pm, TS_Options.pm: restructured test suite 2005-11-15 00:18 Guido Flohr * lib/Data/Walk.pm, t/TC_Bugs.pm, t/TS_All.pm: do not bless unblessed references 2005-11-14 19:23 Guido Flohr * README, lib/Data/Walk.pm, t/TC_Copy.pm, t/TS_All.pm: implemented call-by-reference for preprocessing callbacks 2005-11-14 18:35 Guido Flohr * README, lib/Data/Walk.pm, t/TC_Follow.pm, t/TS_All.pm: handle cyclic references correctly 2005-11-11 13:07 Guido Flohr * lib/Data/Walk.pm: comment about untainting 2005-11-11 12:50 Guido Flohr * t/TC_PostProcess.pm, lib/Data/Walk.pm, t/TS_All.pm: implemented postprocessing 2005-11-11 12:50 Guido Flohr * README: fixed typo 2005-11-10 23:29 Guido Flohr * t/TC_PreProcess.pm: avoid warning 2005-11-10 23:10 Guido Flohr * lib/Data/Walk.pm, t/TC_PreProcess.pm, t/TS_All.pm: implemented preprocessing 2005-11-10 23:06 Guido Flohr * t/TC_ByDepth.pm: removed debugging noise 2005-11-10 22:06 Guido Flohr * Build.PL, ChangeLog, MANIFEST, Makefile.PL, NEWS, README, ReleaseNotes, USERS, x-changelog.sh: cpanification 2005-11-10 21:26 Guido Flohr * lib/Data/Walk.pm, t/TC_Basic.pm, t/TC_ByDepth.pm, t/TS_All.pm: traverse and traversedepth basically work 2005-11-10 21:24 Guido Flohr * t/testrunner.t: fixed intentional syntax error 2005-11-10 13:01 Guido Flohr * COPYING.LESSER, MANIFEST, MANIFEST.SKIP, Makefile.PL, lib/Data/Walk.pm, t/TC_Basic.pm, t/TS_All.pm, t/testrunner.t: Initial revision Data-Walk-1.00/MANIFEST0000644000177200001440000000157610430643140013366 0ustar guidousersBuild.PL Experimental build script ChangeLog CVS log COPYING.LESSER GNU Library General Public License lib/Data/Walk.pm Walk Perl data structures Makefile.PL Makefile generator MANIFEST This file META.yml META.yml NEWS Release notes README ASCII manpage ReleaseNotes Release notes t/TC_Basic.pm Basic test case t/TC_Bugs.pm Test for previous bugs t/TC_ByDepth.pm Option 'bydepth' t/TC_Copy.pm Option 'copy' t/TC_Examples.pm Test cases for example code t/TC_Follow.pm Option 'follow' t/TC_PostProcess.pm Options 'postprocess' and 'postprocess_hash' t/TC_PreProcess.pm Option 'preprocess' t/testrunner.t Test::Harness style unit tester t/TS_All.pm Test suite t/TS_Basic.pm Test basic functionality t/TS_Options.pm Test various options SIGNATURE Public-key signature (added by MakeMaker)