Data-Visitor-0.30000755001750000144 012162136647 13065 5ustar00doyusers000000000000README100644001750000144 47012162136647 14007 0ustar00doyusers000000000000Data-Visitor-0.30 This archive contains the distribution Data-Visitor, version 0.30: Visitor style traversal of Perl data structures This software is copyright (c) 2013 by Yuval Kogman. This is free software; you can redistribute it and/or modify it under the same terms as the Perl 5 programming language system itself. Changes100644001750000144 762512162136647 14453 0ustar00doyusers000000000000Data-Visitor-0.300.30 2013-06-24 - doy/data-visitor should probably be the canonical repository at this point 0.29 2013-06-24 - The class callbacks to be run for an object are now chosen once, at the start of visiting that object. Previously, it always looked through the entire list of callbacks every time, in a loop in which the object in question could be changed by the callback. Since the class callbacks are only partially ordered, this lead to differences in whether a callback would be called or not based on hash order. reported by Robin Smidsrød. 0.28 2012-02-12 - convert to dzil - bump namespace::clean dep - better error message if Data::Alias isn't found - doc fixes 0.27 - Improve synopsis of Data::Visitor::Callback. - Remove the Test::MockObject dependency. 0.26 - remove Any::Moose, one too many failures to subclass. When/if Mouse can be subclassed by Moose we can consider putting it back 0.25 - Depend on Any::Moose 0.09, which pulls in Mouse 0.21, avoiding warnings related to compute_all_applicable_attributes (rafl) 0.24 - use get_all_attributes instead of the deprecated compute_all_applicable_attributes (rafl) 0.23 - Switch to Any::Moose 0.22 - add a no warnings 'recursion', deep recursion is legitimate in most cases 0.21 - Fix a bug in Data::Visitor::Callback WRT returning non reference values from callbacks (#38306). - Refactor the visit_tied split - Propagation of void context 0.20 - Split visit_tied into methods per each reftype, to make it possible to return something that is an object but still doesn't get tied. 0.19 - Support multiple arguments to visit() - use BUILDARGS for argument processing - remove Data::Alias dep for now, it breaks on windows & aix with 5.8.8 0.18 - Weak reference support 0.17 - More void context correctness fixes WRT tied values - Overzealous seen value mappings made by Callback were removed 0.16 - Fix passing of void context when visiting hashes/arrays (perf optimization to avoid unnecessary cloning) - Added 'visit_seen' and a 'seen' callback for circular structures - Class callbacks are now fired from least derived to most derived, not in hash key order 0.15 - Fixed a compilation warning under 5.6.2 - Disabled consistent replacement of values when assigning to $_ under 5.6.2 due to a limitation. 5.8 is required for that feature to work properly. Instead, a warning will be issued and the value will be revisited. 0.14 - Refactored to use Tie::ToObject instead of a custom class - Simple tracing added, enable by setting $DEBUG - added the object_no_class callback - no longer uses $string->can("isa") to figure out if that's a class 0.13 - Add support for preserving tied()ness, and for visiting 0.12 - _register_mapping was not called for each class callback result 0.11 - Fix a bug where objects were mapped to undef when a class callback doesn't match 0.10 - Fix buggy behavior for duplicate and circular values 0.09 - add visit_hash_entry and visit_array_entry 0.08 - add retain_magic and use it to keep blessedness of mapped objects that were forced into being visited by "regular" ref visitor methods 0.07 - Refactor visit_ref 0.06 - Removed build_requires, to try and eliminate some odd installation problems. This also fixes the Class::Accessor dep which was in the wrong slot anyway ;-) 0.05 - Added support for using class names as callbacks in Data::Visitor::Callback - Improved semantics of multiple instances of the same reference in a depe structure (will be mapped once, same mapped value used per each instance) 0.04 - Specified that the Test::MockObject dep need 1.04 0.03 - add Class::Accessor to requirements 0.02 - Added GLOB recursion support - Added support for circular references _ Added aliasing to $_ to Data::Visitor::Callback - Added ignore_return_values to Data::Visitor::Callback 0.01 - Initial release LICENSE100644001750000144 4365312162136647 14206 0ustar00doyusers000000000000Data-Visitor-0.30This software is copyright (c) 2013 by Yuval Kogman. 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) 2013 by Yuval Kogman. 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. 51 Franklin St, Suite 500, Boston, MA 02110-1335 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., 51 Franklin Street, Fifth Floor, Boston MA 02110-1301 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) 2013 by Yuval Kogman. 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 dist.ini100644001750000144 105612162136647 14614 0ustar00doyusers000000000000Data-Visitor-0.30name = Data-Visitor author = Yuval Kogman author = Marcel Grünauer license = Perl_5 copyright_holder = Yuval Kogman [@Filter] -bundle = @DOY -remove = NoTabsTests dist = Data-Visitor repository = github authority = cpan:NUFFIN Git::Tag_tag_format = %N-%v Git::NextVersion_version_regexp = ^Data-Visitor-(.+)$ [Prereqs] Class::Load = 0.06 Moose = 0.89 namespace::clean = 0.19 Tie::ToObject = 0.01 Task::Weaken = 0 ; Data::Alias = 0 ; deref ; FIXME broken on windows [Prereqs / TestRequires] Test::Requires = 0 t000755001750000144 012162136647 13251 5ustar00doyusers000000000000Data-Visitor-0.30weak.t100644001750000144 166712162136647 14537 0ustar00doyusers000000000000Data-Visitor-0.30/t#!/usr/bin/perl use strict; use warnings; use Test::More; use Test::Requires 'Data::Alias'; use Scalar::Util qw(isweak weaken); use Data::Visitor; { my $ref = { }; $ref->{foo} = $ref; weaken($ref->{foo}); ok( isweak($ref->{foo}), "foo is weak" ); my $v = Data::Visitor->new( weaken => 1 ); my $copy = $v->visit($ref); is_deeply( $copy, $ref, "copy is equal" ); ok( isweak($copy->{foo}), 'copy is weak' ); } { my $ref = { foo => { } }; $ref->{bar} = $ref->{foo}; weaken($ref->{foo}); ok( isweak($ref->{foo}), "foo is weak" ); ok( !isweak($ref->{bar}), "bar is not weak" ); my $v = Data::Visitor->new( weaken => 1 ); my $copy = $v->visit($ref); local $TODO = "can't tell apart different refs without making hash/array elems seen as scalar refs"; ok( isweak($copy->{foo}), 'copy is weak' ); is_deeply( $copy, $ref, "copy is equal" ); ok( ref $copy->{bar} && !isweak($copy->{bar}), 'but not in bar' ); } done_testing; bugs.t100644001750000144 120412162136647 14533 0ustar00doyusers000000000000Data-Visitor-0.30/t#!/usr/bin/perl use strict; use warnings; use Test::More; use Data::Visitor::Callback; sub newcb { Data::Visitor::Callback->new( @_ ) } ok( !newcb()->ignore_return_values, "ignore_return_values defaults to false" ); is( newcb( ignore_return_values => 1 )->ignore_return_values, 1, "but can be set as initial param" ); { my $data = { action => 'original' }; my $callbacks = { value => sub { my( $visitor, $data ) = @_; # program gets to here and $data eq 'original' return 'modified'; } }; my $v = Data::Visitor::Callback->new( %$callbacks ); is_deeply( $v->visit($data), { modified => "modified" } ); } done_testing; base.t100644001750000144 446312162136647 14517 0ustar00doyusers000000000000Data-Visitor-0.30/t#!/usr/bin/perl use strict; use warnings; use Test::More; use Data::Visitor; can_ok('Data::Visitor', "new"); isa_ok(my $o = Data::Visitor->new, 'Data::Visitor'); can_ok( $o, "visit" ); my @things = ( "foo", 1, undef, 0, {}, [], do { my $x = "blah"; \$x }, bless({}, "Some::Class") ); $o->visit($_) for @things; # no explosions in void context is_deeply( $o->visit( $_ ), $_, "visit returns value unlatered" ) for @things; can_ok( $o, "visit_value" ); can_ok( $o, "visit_object" ); can_ok( $o, "visit_hash" ); can_ok( $o, "visit_array" ); my $mock; my %called; { my $meta = Class::MOP::class_of($o); my $class; $class = $meta->create_anon_class( superclasses => [$meta->name], methods => { meta => sub { $class }, map { my $e = $_; ($e->[0] => sub { $called{ $e->[0] }++; $e->[1]->(@_) }) } ( [ visit_value => sub { 'magic' } ], [ visit_object => sub { 'magic' } ], [ visit_hash_key => sub { $_[1] } ], [ visit_hash => sub { shift->Data::Visitor::visit_hash(@_) } ], [ visit_array => sub { shift->Data::Visitor::visit_array(@_) } ], ) }, ); $mock = $class->rebless_instance($o); } # cause logging %called = (); $mock->visit( "foo" ); ok($called{visit_value}); %called = (); $mock->visit( 1 ); ok($called{visit_value}); %called = (); $mock->visit( undef ); ok($called{visit_value}); %called = (); $mock->visit( [ ] ); ok($called{visit_array}); ok(!$called{visit_value}, "visit_value not called"); %called = (); $mock->visit( [ "foo" ] ); ok($called{visit_array}); ok($called{visit_value}); %called = (); $mock->visit( "foo" ); ok($called{visit_value}); %called = (); $mock->visit( {} ); ok($called{visit_hash}); ok(!$called{visit_value}, "visit_value not called"); %called = (); $mock->visit( { foo => "bar" } ); ok($called{visit_hash}); ok($called{visit_value}); %called = (); $mock->visit( bless {}, "Foo" ); ok($called{visit_object}); is_deeply( $mock->visit( undef ), "magic", "fmap behavior on value" ); is_deeply( $mock->visit( { foo => "bar" } ), { foo => "magic" }, "fmap behavior on hash" ); is_deeply( $mock->visit( [qw/la di da/]), [qw/magic magic magic/], "fmap behavior on array" ); done_testing; META.yml100644001750000144 1265412162136647 14447 0ustar00doyusers000000000000Data-Visitor-0.30--- abstract: 'Visitor style traversal of Perl data structures' author: - 'Yuval Kogman ' - 'Marcel Grünauer ' build_requires: Test::More: 0.88 Test::Requires: 0 configure_requires: ExtUtils::MakeMaker: 6.30 dynamic_config: 0 generated_by: 'Dist::Zilla version 4.300034, CPAN::Meta::Converter version 2.120921' license: perl meta-spec: url: http://module-build.sourceforge.net/META-spec-v1.4.html version: 1.4 name: Data-Visitor requires: Class::Load: 0.06 Moose: 0.89 Task::Weaken: 0 Tie::ToObject: 0.01 namespace::clean: 0.19 resources: bugtracker: http://rt.cpan.org/Public/Dist/Display.html?Name=Data-Visitor homepage: http://metacpan.org/release/Data-Visitor repository: git://github.com/doy/data-visitor.git version: 0.30 x_Dist_Zilla: perl: version: 5.018000 plugins: - class: Dist::Zilla::Plugin::Prereqs config: Dist::Zilla::Plugin::Prereqs: phase: test type: requires name: '@Filter/TestMoreDoneTesting' version: 4.300034 - class: Dist::Zilla::Plugin::GatherDir name: '@Filter/GatherDir' version: 4.300034 - class: Dist::Zilla::Plugin::PruneCruft name: '@Filter/PruneCruft' version: 4.300034 - class: Dist::Zilla::Plugin::ManifestSkip name: '@Filter/ManifestSkip' version: 4.300034 - class: Dist::Zilla::Plugin::MetaYAML name: '@Filter/MetaYAML' version: 4.300034 - class: Dist::Zilla::Plugin::License name: '@Filter/License' version: 4.300034 - class: Dist::Zilla::Plugin::Readme name: '@Filter/Readme' version: 4.300034 - class: Dist::Zilla::Plugin::RunExtraTests name: '@Filter/RunExtraTests' version: 0.011 - class: Dist::Zilla::Plugin::ExecDir name: '@Filter/ExecDir' version: 4.300034 - class: Dist::Zilla::Plugin::ShareDir name: '@Filter/ShareDir' version: 4.300034 - class: Dist::Zilla::Plugin::MakeMaker name: '@Filter/MakeMaker' version: 4.300034 - class: Dist::Zilla::Plugin::Manifest name: '@Filter/Manifest' version: 4.300034 - class: Dist::Zilla::Plugin::TestRelease name: '@Filter/TestRelease' version: 4.300034 - class: Dist::Zilla::Plugin::ConfirmRelease name: '@Filter/ConfirmRelease' version: 4.300034 - class: Dist::Zilla::Plugin::MetaConfig name: '@Filter/MetaConfig' version: 4.300034 - class: Dist::Zilla::Plugin::MetaJSON name: '@Filter/MetaJSON' version: 4.300034 - class: Dist::Zilla::Plugin::NextRelease name: '@Filter/NextRelease' version: 4.300034 - class: Dist::Zilla::Plugin::CheckChangesHasContent name: '@Filter/CheckChangesHasContent' version: 0.006 - class: Dist::Zilla::Plugin::PkgVersion name: '@Filter/PkgVersion' version: 4.300034 - class: Dist::Zilla::Plugin::Authority name: '@Filter/Authority' version: 1.006 - class: Dist::Zilla::Plugin::PodCoverageTests name: '@Filter/PodCoverageTests' version: 4.300034 - class: Dist::Zilla::Plugin::PodSyntaxTests name: '@Filter/PodSyntaxTests' version: 4.300034 - class: Dist::Zilla::Plugin::EOLTests name: '@Filter/EOLTests' version: 0.02 - class: Dist::Zilla::Plugin::Test::Compile name: '@Filter/Test::Compile' version: 2.002 - class: Dist::Zilla::Plugin::Metadata name: '@Filter/Metadata' version: 3.03 - class: Dist::Zilla::Plugin::MetaResources name: '@Filter/MetaResources' version: 4.300034 - class: Dist::Zilla::Plugin::Git::Check name: '@Filter/Git::Check' version: 2.013 - class: Dist::Zilla::Plugin::Git::Commit name: '@Filter/Git::Commit' version: 2.013 - class: Dist::Zilla::Plugin::Git::Tag name: '@Filter/Git::Tag' version: 2.013 - class: Dist::Zilla::Plugin::Git::NextVersion name: '@Filter/Git::NextVersion' version: 2.013 - class: Dist::Zilla::Plugin::PodWeaver name: '@Filter/PodWeaver' version: 3.101641 - class: Dist::Zilla::Plugin::UploadToCPAN name: '@Filter/UploadToCPAN' version: 4.300034 - class: Dist::Zilla::Plugin::Prereqs config: Dist::Zilla::Plugin::Prereqs: phase: runtime type: requires name: Prereqs version: 4.300034 - class: Dist::Zilla::Plugin::Prereqs config: Dist::Zilla::Plugin::Prereqs: phase: test type: requires name: TestRequires version: 4.300034 - class: Dist::Zilla::Plugin::FinderCode name: ':InstallModules' version: 4.300034 - class: Dist::Zilla::Plugin::FinderCode name: ':IncModules' version: 4.300034 - class: Dist::Zilla::Plugin::FinderCode name: ':TestFiles' version: 4.300034 - class: Dist::Zilla::Plugin::FinderCode name: ':ExecFiles' version: 4.300034 - class: Dist::Zilla::Plugin::FinderCode name: ':ShareFiles' version: 4.300034 - class: Dist::Zilla::Plugin::FinderCode name: ':MainModule' version: 4.300034 zilla: class: Dist::Zilla::Dist::Builder config: is_trial: 0 version: 4.300034 x_authority: cpan:NUFFIN MANIFEST100644001750000144 53512162136647 14262 0ustar00doyusers000000000000Data-Visitor-0.30Changes LICENSE MANIFEST META.json META.yml Makefile.PL README dist.ini lib/Data/Visitor.pm lib/Data/Visitor/Callback.pm t/00-compile.t t/base.t t/bugs.t t/callback.t t/callback_aliasing.t t/callback_hash_entry.t t/callback_moose_tc.t t/circular_refs.t t/globs.t t/magic.t t/weak.t xt/release/eol.t xt/release/pod-coverage.t xt/release/pod-syntax.t globs.t100644001750000144 217112162136647 14705 0ustar00doyusers000000000000Data-Visitor-0.30/t#!/usr/bin/perl use strict; use warnings; use Test::More; use Data::Visitor; our ( $FOO, %FOO ); my $glob = \*FOO; $FOO = 3; %FOO = ( foo => "bar" ); is( ${ *$glob{SCALAR} }, 3, "scalar glob created correctly" ); is_deeply( *$glob{HASH}, { foo => "bar" }, "hash glob created correctly" ); my $structure = [ $glob ]; my $mock; my %called; { my $meta = Class::MOP::class_of('Data::Visitor'); my $class; $class = $meta->create_anon_class( superclasses => [$meta->name], methods => { meta => sub { $class }, map { my $e = $_; ($e => sub { $called{$e}++; shift->${\"Data::Visitor::$e"}(@_) }) } map { "visit_$_" } qw(hash glob value array) }, ); $mock = $class->name->new; } %called = (); my $mapped = $mock->visit( $structure ); # structure sanity is( ref $mapped, "ARRAY", "container" ); is( ref ( $mapped->[0] ), "GLOB", "glob ref" ); is( ${ *{$mapped->[0]}{SCALAR} }, 3, "value in glob's scalar slot"); ok($called{visit_array}); ok($called{visit_glob}); ok($called{visit_value}); ok($called{visit_hash}); done_testing; magic.t100644001750000144 406712162136647 14665 0ustar00doyusers000000000000Data-Visitor-0.30/t#!/usr/bin/perl use strict; use warnings; use Test::More; use Data::Visitor::Callback; use Tie::RefHash; my $h = { foo => {}, }; tie %{ $h->{foo} }, "Tie::RefHash"; $h->{bar}{gorch} = $h->{foo}; $h->{foo}{[1, 2, 3]} = "blart"; my $v = Data::Visitor::Callback->new( tied_as_objects => 1, object => "visit_ref" ); # deep clone the refhash tied my $copy = $v->visit($h); isnt( $copy, $h, "it's a copy" ); isnt( $copy->{foo}, $h->{foo}, "the tied hash is a copy, too" ); is( $copy->{foo}, $copy->{bar}{gorch}, "identity preserved" ); ok( tied %{ $copy->{foo} }, "the subhash is tied" ); isa_ok( tied(%{ $copy->{foo} }), 'Tie::RefHash', 'tied to correct class' ); isnt( tied(%{ $copy->{foo} }), tied(%{ $h->{foo} }), "tied is different" ); ok( ref( ( keys %{ $copy->{foo} } )[0] ), "the key is a ref" ); is_deeply([ keys %{ $copy->{foo} } ], [ keys %{ $h->{foo} } ], "keys eq deeply" ); my $v_no_tie = Data::Visitor::Callback->new( tied_as_objects => 0 ); my $no_tie_copy = $v_no_tie->visit($h); ok( !tied(%{ $no_tie_copy->{foo} }), "not tied" ); sub Foo::AUTOLOAD { fail("tie interface must not be called") } sub Foo::DESTROY {} # no fail { foreach my $v ( Data::Visitor::Callback->new( tied_as_objects => 1 ), Data::Visitor->new( tied_as_objects => 1 ) ) { my $x = bless {}, "Foo"; use Tie::ToObject; tie my @array, 'Tie::ToObject' => $x; tie my %hash, 'Tie::ToObject' => $x; tie *handle, 'Tie::ToObject' => $x; tie my $scalar,'Tie::ToObject' => $x; { $v->visit(\@array); my $copy = $v->visit(\@array); is( ref($copy), "ARRAY", "tied array" ); ok( tied(@$copy), "copy is tied" ); } { $v->visit(\%hash); my $copy = $v->visit(\%hash); is( ref($copy), "HASH", "tied array" ); ok( tied(%$copy), "copy is tied" ); } { $v->visit(\$scalar); my $copy = $v->visit(\$scalar); is( ref($copy), "SCALAR", "tied array" ); ok( tied($$copy), "copy is tied" ); } { $v->visit(\*handle); my $copy = $v->visit(\*handle); is( ref($copy), "GLOB", "tied array" ); ok( tied(*$copy), "copy is tied" ); } } } done_testing; META.json100644001750000144 2113012162136647 14604 0ustar00doyusers000000000000Data-Visitor-0.30{ "abstract" : "Visitor style traversal of Perl data structures", "author" : [ "Yuval Kogman ", "Marcel Gr\u00c3\u00bcnauer " ], "dynamic_config" : 0, "generated_by" : "Dist::Zilla version 4.300034, CPAN::Meta::Converter version 2.120921", "license" : [ "perl_5" ], "meta-spec" : { "url" : "http://search.cpan.org/perldoc?CPAN::Meta::Spec", "version" : "2" }, "name" : "Data-Visitor", "prereqs" : { "configure" : { "requires" : { "ExtUtils::MakeMaker" : "6.30" } }, "develop" : { "requires" : { "Pod::Coverage::TrustPod" : "0", "Test::Pod" : "1.41", "Test::Pod::Coverage" : "1.08" } }, "runtime" : { "requires" : { "Class::Load" : "0.06", "Moose" : "0.89", "Task::Weaken" : "0", "Tie::ToObject" : "0.01", "namespace::clean" : "0.19" } }, "test" : { "requires" : { "Test::More" : "0.88", "Test::Requires" : "0" } } }, "release_status" : "stable", "resources" : { "bugtracker" : { "mailto" : "bug-data-visitor@rt.cpan.org", "web" : "http://rt.cpan.org/Public/Dist/Display.html?Name=Data-Visitor" }, "homepage" : "http://metacpan.org/release/Data-Visitor", "repository" : { "type" : "git", "url" : "git://github.com/doy/data-visitor.git", "web" : "https://github.com/doy/data-visitor" } }, "version" : "0.30", "x_Dist_Zilla" : { "perl" : { "version" : "5.018000" }, "plugins" : [ { "class" : "Dist::Zilla::Plugin::Prereqs", "config" : { "Dist::Zilla::Plugin::Prereqs" : { "phase" : "test", "type" : "requires" } }, "name" : "@Filter/TestMoreDoneTesting", "version" : "4.300034" }, { "class" : "Dist::Zilla::Plugin::GatherDir", "name" : "@Filter/GatherDir", "version" : "4.300034" }, { "class" : "Dist::Zilla::Plugin::PruneCruft", "name" : "@Filter/PruneCruft", "version" : "4.300034" }, { "class" : "Dist::Zilla::Plugin::ManifestSkip", "name" : "@Filter/ManifestSkip", "version" : "4.300034" }, { "class" : "Dist::Zilla::Plugin::MetaYAML", "name" : "@Filter/MetaYAML", "version" : "4.300034" }, { "class" : "Dist::Zilla::Plugin::License", "name" : "@Filter/License", "version" : "4.300034" }, { "class" : "Dist::Zilla::Plugin::Readme", "name" : "@Filter/Readme", "version" : "4.300034" }, { "class" : "Dist::Zilla::Plugin::RunExtraTests", "name" : "@Filter/RunExtraTests", "version" : "0.011" }, { "class" : "Dist::Zilla::Plugin::ExecDir", "name" : "@Filter/ExecDir", "version" : "4.300034" }, { "class" : "Dist::Zilla::Plugin::ShareDir", "name" : "@Filter/ShareDir", "version" : "4.300034" }, { "class" : "Dist::Zilla::Plugin::MakeMaker", "name" : "@Filter/MakeMaker", "version" : "4.300034" }, { "class" : "Dist::Zilla::Plugin::Manifest", "name" : "@Filter/Manifest", "version" : "4.300034" }, { "class" : "Dist::Zilla::Plugin::TestRelease", "name" : "@Filter/TestRelease", "version" : "4.300034" }, { "class" : "Dist::Zilla::Plugin::ConfirmRelease", "name" : "@Filter/ConfirmRelease", "version" : "4.300034" }, { "class" : "Dist::Zilla::Plugin::MetaConfig", "name" : "@Filter/MetaConfig", "version" : "4.300034" }, { "class" : "Dist::Zilla::Plugin::MetaJSON", "name" : "@Filter/MetaJSON", "version" : "4.300034" }, { "class" : "Dist::Zilla::Plugin::NextRelease", "name" : "@Filter/NextRelease", "version" : "4.300034" }, { "class" : "Dist::Zilla::Plugin::CheckChangesHasContent", "name" : "@Filter/CheckChangesHasContent", "version" : "0.006" }, { "class" : "Dist::Zilla::Plugin::PkgVersion", "name" : "@Filter/PkgVersion", "version" : "4.300034" }, { "class" : "Dist::Zilla::Plugin::Authority", "name" : "@Filter/Authority", "version" : "1.006" }, { "class" : "Dist::Zilla::Plugin::PodCoverageTests", "name" : "@Filter/PodCoverageTests", "version" : "4.300034" }, { "class" : "Dist::Zilla::Plugin::PodSyntaxTests", "name" : "@Filter/PodSyntaxTests", "version" : "4.300034" }, { "class" : "Dist::Zilla::Plugin::EOLTests", "name" : "@Filter/EOLTests", "version" : "0.02" }, { "class" : "Dist::Zilla::Plugin::Test::Compile", "name" : "@Filter/Test::Compile", "version" : "2.002" }, { "class" : "Dist::Zilla::Plugin::Metadata", "name" : "@Filter/Metadata", "version" : "3.03" }, { "class" : "Dist::Zilla::Plugin::MetaResources", "name" : "@Filter/MetaResources", "version" : "4.300034" }, { "class" : "Dist::Zilla::Plugin::Git::Check", "name" : "@Filter/Git::Check", "version" : "2.013" }, { "class" : "Dist::Zilla::Plugin::Git::Commit", "name" : "@Filter/Git::Commit", "version" : "2.013" }, { "class" : "Dist::Zilla::Plugin::Git::Tag", "name" : "@Filter/Git::Tag", "version" : "2.013" }, { "class" : "Dist::Zilla::Plugin::Git::NextVersion", "name" : "@Filter/Git::NextVersion", "version" : "2.013" }, { "class" : "Dist::Zilla::Plugin::PodWeaver", "name" : "@Filter/PodWeaver", "version" : "3.101641" }, { "class" : "Dist::Zilla::Plugin::UploadToCPAN", "name" : "@Filter/UploadToCPAN", "version" : "4.300034" }, { "class" : "Dist::Zilla::Plugin::Prereqs", "config" : { "Dist::Zilla::Plugin::Prereqs" : { "phase" : "runtime", "type" : "requires" } }, "name" : "Prereqs", "version" : "4.300034" }, { "class" : "Dist::Zilla::Plugin::Prereqs", "config" : { "Dist::Zilla::Plugin::Prereqs" : { "phase" : "test", "type" : "requires" } }, "name" : "TestRequires", "version" : "4.300034" }, { "class" : "Dist::Zilla::Plugin::FinderCode", "name" : ":InstallModules", "version" : "4.300034" }, { "class" : "Dist::Zilla::Plugin::FinderCode", "name" : ":IncModules", "version" : "4.300034" }, { "class" : "Dist::Zilla::Plugin::FinderCode", "name" : ":TestFiles", "version" : "4.300034" }, { "class" : "Dist::Zilla::Plugin::FinderCode", "name" : ":ExecFiles", "version" : "4.300034" }, { "class" : "Dist::Zilla::Plugin::FinderCode", "name" : ":ShareFiles", "version" : "4.300034" }, { "class" : "Dist::Zilla::Plugin::FinderCode", "name" : ":MainModule", "version" : "4.300034" } ], "zilla" : { "class" : "Dist::Zilla::Dist::Builder", "config" : { "is_trial" : "0" }, "version" : "4.300034" } }, "x_authority" : "cpan:NUFFIN" } Makefile.PL100644001750000144 307712162136647 15127 0ustar00doyusers000000000000Data-Visitor-0.30 use strict; use warnings; use ExtUtils::MakeMaker 6.30; my %WriteMakefileArgs = ( "ABSTRACT" => "Visitor style traversal of Perl data structures", "AUTHOR" => "Yuval Kogman , Marcel Gr\303\274nauer ", "BUILD_REQUIRES" => {}, "CONFIGURE_REQUIRES" => { "ExtUtils::MakeMaker" => "6.30" }, "DISTNAME" => "Data-Visitor", "EXE_FILES" => [], "LICENSE" => "perl", "NAME" => "Data::Visitor", "PREREQ_PM" => { "Class::Load" => "0.06", "Moose" => "0.89", "Task::Weaken" => 0, "Tie::ToObject" => "0.01", "namespace::clean" => "0.19" }, "TEST_REQUIRES" => { "Test::More" => "0.88", "Test::Requires" => 0 }, "VERSION" => "0.30", "test" => { "TESTS" => "t/*.t" } ); unless ( eval { ExtUtils::MakeMaker->VERSION(6.63_03) } ) { my $tr = delete $WriteMakefileArgs{TEST_REQUIRES}; my $br = $WriteMakefileArgs{BUILD_REQUIRES}; for my $mod ( keys %$tr ) { if ( exists $br->{$mod} ) { $br->{$mod} = $tr->{$mod} if $tr->{$mod} > $br->{$mod}; } else { $br->{$mod} = $tr->{$mod}; } } } unless ( eval { ExtUtils::MakeMaker->VERSION(6.56) } ) { my $br = delete $WriteMakefileArgs{BUILD_REQUIRES}; my $pp = $WriteMakefileArgs{PREREQ_PM}; for my $mod ( keys %$br ) { if ( exists $pp->{$mod} ) { $pp->{$mod} = $br->{$mod} if $br->{$mod} > $pp->{$mod}; } else { $pp->{$mod} = $br->{$mod}; } } } delete $WriteMakefileArgs{CONFIGURE_REQUIRES} unless eval { ExtUtils::MakeMaker->VERSION(6.52) }; WriteMakefile(%WriteMakefileArgs); callback.t100644001750000144 344612162136647 15341 0ustar00doyusers000000000000Data-Visitor-0.30/t#!/usr/bin/perl use strict; use warnings; use Test::More; use Data::Visitor::Callback; can_ok('Data::Visitor::Callback', "new"); counters_are( "foo", "string", { visit => 1, value => 1, plain_value => 1, }); counters_are( undef, "undef", { visit => 1, value => 1, plain_value => 1, }); counters_are( [], "array", { visit => 1, ref => 1, array => 1, }); counters_are( {}, "hash", { visit => 1, ref => 1, hash => 1, }); counters_are( [ "foo" ], "deep array", { visit => 2, ref => 1, array => 1, value => 1, plain_value => 1, }); { package Mammal; package Moose; our @ISA = ("Mammal"); } { package Unrelated::Class; } counters_are( bless({}, "Moose"), "object", { visit => 1, object => 1, Moose => 1, Mammal => 1, }); counters_are( bless({}, "Mammal"), "object", { visit => 1, object => 1, Mammal => 1, }); counters_are( \10, "scalar_ref", { visit => 2, ref => 1, 'scalar' => 1, value => 1, plain_value => 1, }); our $FOO = 1; our %FOO = ( "foo" => undef ); counters_are( \*FOO, "glob", { ref => 3, visit => 6, 'scalar' => 1, hash => 1, value => 3, plain_value => 3, 'glob' => 1, }); counters_are( sub { }, "code", { visit => 1, value => 1, ref => 1, ref_value => 1, }); counters_are( qr/foo/, "regex", { visit => 1, object => 1, }); sub counters_are { my ( $data, $desc, $expected_counters ) = @_; my %counters; my %callbacks = ( map { my $name = $_; $name => sub { $counters{$name}++ } } qw( visit value ref ref_value plain_value object array hash glob scalar Moose Mammal Unrelated::Class ), ); my $v = Data::Visitor::Callback->new( ignore_return_values => 1, %callbacks, ); $v->visit( $data ); local $Test::Builder::Level = 2; is_deeply( \%counters, $expected_counters, $desc ); } done_testing 00-compile.t100644001750000144 312612162136647 15445 0ustar00doyusers000000000000Data-Visitor-0.30/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', ); sub _find_scripts { my $dir = shift @_; my @found_scripts = (); find( sub { return unless -f; my $found = $File::Find::name; # nothing to skip open my $FH, '<', $_ or do { note( "Unable to open $found in ( $! ), skipping" ); return; }; my $shebang = <$FH>; return unless $shebang =~ /^#!.*?\bperl\b\s*$/; push @found_scripts, $found; }, $dir, ); return @found_scripts; } my @scripts; do { push @scripts, _find_scripts($_) if -d $_ } for qw{ bin script scripts }; my $plan = scalar(@modules) + scalar(@scripts); $plan ? (plan tests => $plan) : (plan skip_all => "no tests to run"); { # fake home for cpan-testers # no fake requested ## local $ENV{HOME} = tempdir( CLEANUP => 1 ); like( qx{ $^X -Ilib -e "require $_; print '$_ ok'" }, qr/^\s*$_ ok/s, "$_ loaded ok" ) for sort @modules; SKIP: { eval "use Test::Script 1.05; 1;"; skip "Test::Script needed to test script compilation", scalar(@scripts) if $@; foreach my $file ( @scripts ) { my $script = $file; $script =~ s!.*/!!; script_compiles( $file, "$script script compiles" ); } } } release000755001750000144 012162136647 15061 5ustar00doyusers000000000000Data-Visitor-0.30/xteol.t100644001750000144 24012162136647 16141 0ustar00doyusers000000000000Data-Visitor-0.30/xt/releaseuse strict; use warnings; use Test::More; eval 'use Test::EOL'; plan skip_all => 'Test::EOL required' if $@; all_perl_files_ok({ trailing_whitespace => 1 }); circular_refs.t100644001750000144 551312162136647 16425 0ustar00doyusers000000000000Data-Visitor-0.30/t#!/usr/bin/perl use strict; use warnings; use Test::More; use Scalar::Util qw(refaddr); use Data::Visitor; use Data::Visitor::Callback; { my $structure = { foo => { bar => undef, }, }; $structure->{foo}{bar} = $structure; my $o = Data::Visitor->new; { alarm 1; $o->visit( $structure ); alarm 0; pass( "circular structures don't cause an endless loop" ); } is_deeply( $o->visit( $structure ), $structure, "Structure recreated" ); is( $structure, $structure->{foo}{bar}, "circular address" ); my $visited = $o->visit( $structure ); is( $visited, $visited->{foo}{bar}, "circular address" ); } { my $orig = { one => [ ], two => [ ], }; my $hash = $orig->{one}[0] = $orig->{two}[0] = bless {}, "yyy"; my $c = Data::Visitor::Callback->new( object => sub { bless {}, "zzzzz" }, ); my $copy = $c->visit( $orig ); is( $copy->{one}[0], $copy->{two}[0], "copy of object is a mapped copy" ); } { my $orig = [ [ ], [ ], ]; my $hash = $orig->[0][0] = $orig->[1][0] = { }; my $c = Data::Visitor::Callback->new( hash => sub { $_ = { foo => "bar" } }, ); $c->visit( $orig ); { local $TODO = "broken in older perls" unless Data::Visitor::Callback::FIVE_EIGHT(); is( $orig->[0][0], $orig->[1][0], "equality preserved" ); } isnt( $orig->[0][0], $hash, "original replaced" ); is_deeply( $orig->[0][0], { foo => "bar" }, "data is as expected" ); } { my $orig = { foo => { obj => bless {}, "blah" }, misc => bless {}, "oink", }; $orig->{foo}{self} = $orig; $orig->{foo}{foo} = $orig->{foo}; my $c = Data::Visitor::Callback->new(); my $copy = $c->visit( $orig ); is_deeply( $copy, $orig, "structure retained" ); } { my $orig = [ { obj => bless {}, "blah" }, ]; $orig->[0]{self} = $orig; $orig->[1] = $orig->[0]; my $c = Data::Visitor::Callback->new( seen => sub { "seen" } ); my $copy = $c->visit( $orig ); is_deeply( $copy, [ { obj => bless({}, "blah"), self => "seen" }, "seen", ], "seen callback", ); } { my $orig = { foo => { bar => 42 }, }; $orig->{bar} = \( $orig->{foo}{bar} ); is( refaddr($orig->{bar}), refaddr( \( $orig->{foo}{bar} ) ), "scalar ref to hash element" ); my $copy = Data::Visitor->new->visit($orig); is_deeply( $copy, $orig, "structures eq deeply" ); local $TODO = "hash/array elements are not yet references internally"; is( refaddr($copy->{bar}), refaddr( \($copy->{foo}{bar}) ), "scalar ref in copy" ); } { my $orig = { foo => 42, }; $orig->{bar} = \( $orig->{foo} ); is( refaddr($orig->{bar}), refaddr( \( $orig->{foo} ) ), "scalar ref to sibling hash element" ); my $copy = Data::Visitor->new->visit($orig); is_deeply( $copy, $orig, "structures eq deeply" ); local $TODO = "hash/array elements are not yet references internally"; is( refaddr($copy->{bar}), refaddr( \($copy->{foo}) ), "scalar ref in copy" ); } done_testing; Data000755001750000144 012162136647 14425 5ustar00doyusers000000000000Data-Visitor-0.30/libVisitor.pm100644001750000144 4054612162136647 16613 0ustar00doyusers000000000000Data-Visitor-0.30/lib/Datapackage Data::Visitor; BEGIN { $Data::Visitor::AUTHORITY = 'cpan:NUFFIN'; } { $Data::Visitor::VERSION = '0.30'; } use Moose; # ABSTRACT: Visitor style traversal of Perl data structures use Scalar::Util qw/blessed refaddr reftype weaken isweak/; use overload (); use Symbol (); use Class::Load 'load_optional_class'; use Tie::ToObject; no warnings 'recursion'; use namespace::clean -except => 'meta'; # the double not makes this no longer undef, so exempt from useless constant warnings in older perls use constant DEBUG => not not our $DEBUG || $ENV{DATA_VISITOR_DEBUG}; use constant HAS_DATA_ALIAS => load_optional_class('Data::Alias'); has tied_as_objects => ( isa => "Bool", is => "rw", ); # currently broken has weaken => ( isa => "Bool", is => "rw", default => 0, ); sub trace { my ( $self, $category, @msg ) = @_; our %DEBUG; if ( $DEBUG{$category} or !exists($DEBUG{$category}) ) { $self->_print_trace("$self: " . join("", ( " " x ( $self->{depth} - 1 ) ), ( join(" ", "$category:", map { overload::StrVal($_) } @msg) ), )); } } sub _print_trace { my ( $self, @msg ) = @_; warn "@msg\n"; } sub visit { my $self = shift; local $self->{depth} = (($self->{depth}||0) + 1) if DEBUG; my $seen_hash = local $self->{_seen} = ($self->{_seen} || {}); # delete it after we're done with the whole visit my @ret; foreach my $data ( @_ ) { $self->trace( flow => visit => $data ) if DEBUG; if ( my $refaddr = ref($data) && refaddr($data) ) { # only references need recursion checks $seen_hash->{weak} ||= isweak($data) if $self->weaken; if ( exists $seen_hash->{$refaddr} ) { $self->trace( mapping => found_mapping => from => $data, to => $seen_hash->{$refaddr} ) if DEBUG; push @ret, $self->visit_seen( $data, $seen_hash->{$refaddr} ); next; } else { $self->trace( mapping => no_mapping => $data ) if DEBUG; } } if ( defined wantarray ) { push @ret, scalar($self->visit_no_rec_check($data)); } else { $self->visit_no_rec_check($data); } } return ( @_ == 1 ? $ret[0] : @ret ); } sub visit_seen { my ( $self, $data, $result ) = @_; return $result; } sub _get_mapping { my ( $self, $data ) = @_; $self->{_seen}{ refaddr($data) }; } sub _register_mapping { my ( $self, $data, $new_data ) = @_; return $new_data unless ref $data; $self->trace( mapping => register_mapping => from => $data, to => $new_data, in => (caller(1))[3] ) if DEBUG; $self->{_seen}{ refaddr($data) } = $new_data; } sub visit_no_rec_check { my ( $self, $data ) = @_; if ( blessed($data) ) { return $self->visit_object($_[1]); } elsif ( ref $data ) { return $self->visit_ref($_[1]); } return $self->visit_value($_[1]); } sub visit_object { my ( $self, $object ) = @_; $self->trace( flow => visit_object => $object ) if DEBUG; if ( not defined wantarray ) { $self->_register_mapping( $object, $object ); $self->visit_value($_[1]); return; } else { return $self->_register_mapping( $object, $self->visit_value($_[1]) ); } } sub visit_ref { my ( $self, $data ) = @_; local $self->{depth} = (($self->{depth}||0) + 1) if DEBUG; $self->trace( flow => visit_ref => $data ) if DEBUG; my $reftype = reftype $data; $reftype = "SCALAR" if $reftype =~ /^(?:REF|LVALUE|VSTRING)$/; my $method = $self->can(lc "visit_$reftype") || "visit_value"; return $self->$method($_[1]); } sub visit_value { my ( $self, $value ) = @_; $self->trace( flow => visit_value => $value ) if DEBUG; return $value; } sub visit_hash { my ( $self, $hash ) = @_; local $self->{depth} = (($self->{depth}||0) + 1) if DEBUG; if ( defined(tied(%$hash)) and $self->tied_as_objects ) { return $self->visit_tied_hash(tied(%$hash), $_[1]); } else { return $self->visit_normal_hash($_[1]); } } sub visit_normal_hash { my ( $self, $hash ) = @_; if ( defined wantarray ) { my $new_hash = {}; $self->_register_mapping( $hash, $new_hash ); %$new_hash = $self->visit_hash_entries($_[1]); return $self->retain_magic( $_[1], $new_hash ); } else { $self->_register_mapping($hash, $hash); $self->visit_hash_entries($_[1]); return; } } sub visit_tied_hash { my ( $self, $tied, $hash ) = @_; if ( defined wantarray ) { my $new_hash = {}; $self->_register_mapping( $hash, $new_hash ); if ( blessed(my $new_tied = $self->visit_tied($_[1], $_[2])) ) { $self->trace( data => tying => var => $new_hash, to => $new_tied ) if DEBUG; tie %$new_hash, 'Tie::ToObject', $new_tied; return $self->retain_magic($_[2], $new_hash); } else { return $self->visit_normal_hash($_[2]); } } else { $self->_register_mapping($hash, $hash); $self->visit_tied($_[1], $_[2]); return; } } sub visit_hash_entries { my ( $self, $hash ) = @_; if ( not defined wantarray ) { $self->visit_hash_entry( $_, $hash->{$_}, $hash ) for keys %$hash; } else { return map { $self->visit_hash_entry( $_, $hash->{$_}, $hash ) } keys %$hash; } } sub visit_hash_entry { my ( $self, $key, $value, $hash ) = @_; $self->trace( flow => visit_hash_entry => key => $key, value => $value ) if DEBUG; if ( not defined wantarray ) { $self->visit_hash_key($key,$value,$hash); $self->visit_hash_value($_[2],$key,$hash); } else { return ( $self->visit_hash_key($key,$value,$hash), $self->visit_hash_value($_[2],$key,$hash), ); } } sub visit_hash_key { my ( $self, $key, $value, $hash ) = @_; $self->visit($key); } sub visit_hash_value { my ( $self, $value, $key, $hash ) = @_; $self->visit($_[1]); } sub visit_array { my ( $self, $array ) = @_; if ( defined(tied(@$array)) and $self->tied_as_objects ) { return $self->visit_tied_array(tied(@$array), $_[1]); } else { return $self->visit_normal_array($_[1]); } } sub visit_normal_array { my ( $self, $array ) = @_; if ( defined wantarray ) { my $new_array = []; $self->_register_mapping( $array, $new_array ); @$new_array = $self->visit_array_entries($_[1]); return $self->retain_magic( $_[1], $new_array ); } else { $self->_register_mapping( $array, $array ); $self->visit_array_entries($_[1]); return; } } sub visit_tied_array { my ( $self, $tied, $array ) = @_; if ( defined wantarray ) { my $new_array = []; $self->_register_mapping( $array, $new_array ); if ( blessed(my $new_tied = $self->visit_tied($_[1], $_[2])) ) { $self->trace( data => tying => var => $new_array, to => $new_tied ) if DEBUG; tie @$new_array, 'Tie::ToObject', $new_tied; return $self->retain_magic($_[2], $new_array); } else { return $self->visit_normal_array($_[2]); } } else { $self->_register_mapping( $array, $array ); $self->visit_tied($_[1], $_[2]); return; } } sub visit_array_entries { my ( $self, $array ) = @_; if ( not defined wantarray ) { $self->visit_array_entry( $array->[$_], $_, $array ) for 0 .. $#$array; } else { return map { $self->visit_array_entry( $array->[$_], $_, $array ) } 0 .. $#$array; } } sub visit_array_entry { my ( $self, $value, $index, $array ) = @_; $self->visit($_[1]); } sub visit_scalar { my ( $self, $scalar ) = @_; if ( defined(tied($$scalar)) and $self->tied_as_objects ) { return $self->visit_tied_scalar(tied($$scalar), $_[1]); } else { return $self->visit_normal_scalar($_[1]); } } sub visit_normal_scalar { my ( $self, $scalar ) = @_; if ( defined wantarray ) { my $new_scalar; $self->_register_mapping( $scalar, \$new_scalar ); $new_scalar = $self->visit( $$scalar ); return $self->retain_magic($_[1], \$new_scalar); } else { $self->_register_mapping( $scalar, $scalar ); $self->visit( $$scalar ); return; } } sub visit_tied_scalar { my ( $self, $tied, $scalar ) = @_; if ( defined wantarray ) { my $new_scalar; $self->_register_mapping( $scalar, \$new_scalar ); if ( blessed(my $new_tied = $self->visit_tied($_[1], $_[2])) ) { $self->trace( data => tying => var => $new_scalar, to => $new_tied ) if DEBUG; tie $new_scalar, 'Tie::ToObject', $new_tied; return $self->retain_magic($_[2], \$new_scalar); } else { return $self->visit_normal_scalar($_[2]); } } else { $self->_register_mapping( $scalar, $scalar ); $self->visit_tied($_[1], $_[2]); return; } } sub visit_code { my ( $self, $code ) = @_; $self->visit_value($_[1]); } sub visit_glob { my ( $self, $glob ) = @_; if ( defined(tied(*$glob)) and $self->tied_as_objects ) { return $self->visit_tied_glob(tied(*$glob), $_[1]); } else { return $self->visit_normal_glob($_[1]); } } sub visit_normal_glob { my ( $self, $glob ) = @_; if ( defined wantarray ) { my $new_glob = Symbol::gensym(); $self->_register_mapping( $glob, $new_glob ); no warnings 'misc'; # Undefined value assigned to typeglob *$new_glob = $self->visit( *$glob{$_} || next ) for qw/SCALAR ARRAY HASH/; return $self->retain_magic($_[1], $new_glob); } else { $self->_register_mapping( $glob, $glob ); $self->visit( *$glob{$_} || next ) for qw/SCALAR ARRAY HASH/; return; } } sub visit_tied_glob { my ( $self, $tied, $glob ) = @_; if ( defined wantarray ) { my $new_glob = Symbol::gensym(); $self->_register_mapping( $glob, \$new_glob ); if ( blessed(my $new_tied = $self->visit_tied($_[1], $_[2])) ) { $self->trace( data => tying => var => $new_glob, to => $new_tied ) if DEBUG; tie *$new_glob, 'Tie::ToObject', $new_tied; return $self->retain_magic($_[2], $new_glob); } else { return $self->visit_normal_glob($_[2]); } } else { $self->_register_mapping( $glob, $glob ); $self->visit_tied($_[1], $_[2]); return; } } sub retain_magic { my ( $self, $proto, $new ) = @_; if ( blessed($proto) and !blessed($new) ) { $self->trace( data => blessing => $new, ref $proto ) if DEBUG; bless $new, ref $proto; } my $seen_hash = $self->{_seen}; if ( $seen_hash->{weak} ) { if (HAS_DATA_ALIAS) { my @weak_refs; foreach my $value ( Data::Alias::deref($proto) ) { if ( ref $value and isweak($value) ) { push @weak_refs, refaddr $value; } } if ( @weak_refs ) { my %targets = map { refaddr($_) => 1 } @{ $self->{_seen} }{@weak_refs}; foreach my $value ( Data::Alias::deref($new) ) { if ( ref $value and $targets{refaddr($value)}) { push @{ $seen_hash->{weakened} ||= [] }, $value; # keep a ref around weaken($value); } } } } else { die "Found a weak reference, but Data::Alias is not installed. You must install Data::Alias in order for this to work."; } } # FIXME real magic, too return $new; } sub visit_tied { my ( $self, $tied, $var ) = @_; $self->trace( flow => visit_tied => $tied ) if DEBUG; $self->visit($_[1]); # as an object eventually } __PACKAGE__->meta->make_immutable if __PACKAGE__->meta->can("make_immutable"); __PACKAGE__; __END__ =pod =head1 NAME Data::Visitor - Visitor style traversal of Perl data structures =head1 VERSION version 0.30 =head1 SYNOPSIS # NOTE # You probably want to use Data::Visitor::Callback for trivial things package FooCounter; use Moose; extends qw(Data::Visitor); has number_of_foos => ( isa => "Int", is => "rw", default => 0, ); sub visit_value { my ( $self, $data ) = @_; if ( defined $data and $data eq "foo" ) { $self->number_of_foos( $self->number_of_foos + 1 ); } return $data; } my $counter = FooCounter->new; $counter->visit( { this => "that", some_foos => [ qw/foo foo bar foo/ ], the_other => "foo", }); $counter->number_of_foos; # this is now 4 =head1 DESCRIPTION This module is a simple visitor implementation for Perl values. It has a main dispatcher method, C, which takes a single perl value and then calls the methods appropriate for that value. It can recursively map (cloning as necessary) or just traverse most structures, with support for per object behavior, circular structures, visiting tied structures, and all ref types (hashes, arrays, scalars, code, globs). L is meant to be subclassed, but also ships with a callback driven subclass, L. =encoding utf8 =head1 METHODS =over 4 =item visit $data This method takes any Perl value as it's only argument, and dispatches to the various other visiting methods using C, based on the data's type. If the value is a reference and has already been seen then C is called. =item visit_seen $data, $first_result When an already seen value is encountered again it's typically replaced with the result of the first visitation of that value. The value and the result of the first visitation are passed as arguments. Returns C<$first_result>. =item visit_no_rec_check $data Called for any value that has not yet been seen. Does the actual type based dispatch for C. Should not be called directly unless forcing a circular structure to be unfolded. Use with caution as this may cause infinite recursion. =item visit_object $object If the value is a blessed object, C calls this method. The base implementation will just forward to C. =item visit_ref $value Generic recursive visitor. All non blessed values are given to this. C can delegate to this method in order to visit the object anyway. This will check if the visitor can handle C (lowercase), and if not delegate to C instead. =item visit_array $array_ref =item visit_hash $hash_ref =item visit_glob $glob_ref =item visit_code $code_ref =item visit_scalar $scalar_ref These methods are called for the corresponding container type. =item visit_value $value If the value is anything else, this method is called. The base implementation will return $value. =item visit_hash_entries $hash =item visit_hash_entry $key, $value, $hash Delegates to C and C. The value is passed as C<$_[2]> so that it is aliased. =item visit_hash_key $key, $value, $hash Calls C on the key and returns it. =item visit_hash_value $value, $key, $hash The value will be aliased (passed as C<$_[1]>). =item visit_array_entries $array =item visit_array_entry $value, $index, $array Delegates to C on value. The value is passed as C<$_[1]> to retain aliasing. =item visit_tied $object, $var When C is enabled and a tied variable (hash, array, glob or scalar) is encountered this method will be called on the tied object. If a valid mapped value is returned, the newly constructed result container will be tied to the return value and no iteration of the contents of the data will be made (since all storage is delegated to the tied object). If a non blessed value is returned from C then the structure will be iterated normally, and the result container will not be tied at all. This is because tying to the same class and performing the tie operations will not yield the same results in many cases. =item retain_magic $orig, $copy Copies over magic from C<$orig> to C<$copy>. Currently only handles C. In the future this might be expanded using L but it isn't clear what the correct semantics for magic copying should be. =item trace Called if the C constant is set with a trace message. =back =head1 RETURN VALUE This object can be used as an C of sorts - providing an ad-hoc functor interface for Perl data structures. In void context this functionality is ignored, but in any other context the default methods will all try to return a value of similar structure, with it's children also fmapped. =head1 SUBCLASSING Data::Visitor is a L class, so it should be subclassed using Moose. Then override the callback methods in any way you like. To retain visitor behavior, make sure to retain the functionality of C and C. =head1 TODO =over 4 =item * Add support for "natural" visiting of trees. =item * Expand C to support tying at the very least, or even more with L if possible. =back =head1 SEE ALSO L, L, L L, L, L =for Pod::Coverage HAS_DATA_ALIAS visit_normal_array visit_normal_glob visit_normal_hash visit_normal_scalar visit_tied_array visit_tied_glob visit_tied_hash visit_tied_scalar =head1 AUTHORS =over 4 =item * Yuval Kogman =item * Marcel Grünauer =back =head1 COPYRIGHT AND LICENSE This software is copyright (c) 2013 by Yuval Kogman. 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 callback_aliasing.t100644001750000144 131512162136647 17201 0ustar00doyusers000000000000Data-Visitor-0.30/t#!/usr/bin/perl use strict; use warnings; use Test::More; use Data::Visitor::Callback; foreach my $ignore ( 0, 1 ) { my $structure = { foo => "bar", gorch => [ "baz", 1 ], }; my $o = Data::Visitor::Callback->new( ignore_return_values => $ignore, plain_value => sub { no warnings 'uninitialized'; s/b/m/g; "laaa" }, array => sub { $_ = 42; undef }, ); $_ = "original"; $o->visit( $structure ); is( $_, "original", '$_ unchanged in outer scope'); is_deeply( $structure, { foo => "mar", gorch => 42, }, "values were modified" ); $o->callbacks->{hash} = sub { $_ = "value" }; $o->visit( $structure ); is( $structure, "value", "entire structure can also be changed"); } done_testing; callback_moose_tc.t100644001750000144 240312162136647 17221 0ustar00doyusers000000000000Data-Visitor-0.30/t#!perl # Bug report that initiated this debugging: # https://rt.cpan.org/Ticket/Display.html?id=81519 use strict; use warnings; use Test::More tests => 1; use Data::Visitor::Callback; BEGIN { package W3C::XHTML::Image; use Moose; package W3C::XHTML::Body; use Moose; has 'images' => ( is => 'ro', isa => 'ArrayRef[W3C::XHTML::Image]', ); } my $body = W3C::XHTML::Body->new( images => [ W3C::XHTML::Image->new ] ); my $tc = $body->meta->get_attribute('images')->type_constraint; note "TC contains only one instance of W3C::XHTML::Image - $tc"; # Figure out classes mentioned in type constraint (isa) my @classes; Data::Visitor::Callback->new({ object => 'visit_ref', 'Moose::Meta::TypeConstraint::Union' => sub { return $_[1]->type_constraints; }, 'Moose::Meta::TypeConstraint::Class' => sub { push @classes, $_[1]->class; return $_[1]; }, 'Moose::Meta::TypeConstraint::Parameterized' => sub { return $_[1]->type_parameter; }, })->visit($tc); note "Classes found: " . join(", ", @classes); # On 5.16.2 it gives me only one item if mentioned once in TC, # but on 5.17.6 it occasionally gives two items in @classes is( scalar @classes, 1, "Only one case of W3C::XHTML::Image should be present"); callback_hash_entry.t100644001750000144 134012162136647 17554 0ustar00doyusers000000000000Data-Visitor-0.30/t#!/usr/bin/perl use strict; use warnings; use Test::More; use Data::Visitor::Callback; my $data = { type_a => { point => 50, subtype_a_2 => { point => 27, subtype_a_2_bar => { circle => 14, }, }, }, point => 33, }; my $sum = 0; Data::Visitor::Callback->new( ignore_return_values => 1, hash_entry => sub { my ( $self, $k, $v ) = @_; $sum += $v unless ref $v; }, )->visit($data); is($sum, 124, 'get_recursive_hash_value_visitor, all values'); $sum = 0; Data::Visitor::Callback->new( ignore_return_values => 1, hash_entry => sub { my ( $self, $k, $v ) = @_; $sum += $v if $k eq 'point'; }, )->visit($data); is($sum, 110, 'get_recursive_hash_value_visitor, only "point" keys'); done_testing; pod-syntax.t100644001750000144 21212162136647 17467 0ustar00doyusers000000000000Data-Visitor-0.30/xt/release#!perl use Test::More; eval "use Test::Pod 1.41"; plan skip_all => "Test::Pod 1.41 required for testing POD" if $@; all_pod_files_ok(); pod-coverage.t100644001750000144 52712162136647 17745 0ustar00doyusers000000000000Data-Visitor-0.30/xt/release#!perl 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' }); Visitor000755001750000144 012162136647 16064 5ustar00doyusers000000000000Data-Visitor-0.30/lib/DataCallback.pm100644001750000144 2562412162136647 20307 0ustar00doyusers000000000000Data-Visitor-0.30/lib/Data/Visitorpackage Data::Visitor::Callback; BEGIN { $Data::Visitor::Callback::AUTHORITY = 'cpan:NUFFIN'; } { $Data::Visitor::Callback::VERSION = '0.30'; } use Moose; # ABSTRACT: A Data::Visitor with callbacks. use Data::Visitor (); use Carp qw(carp); use Scalar::Util qw/blessed refaddr reftype/; no warnings 'recursion'; use namespace::clean -except => 'meta'; use constant DEBUG => Data::Visitor::DEBUG(); use constant FIVE_EIGHT => ( $] >= 5.008 ); extends qw(Data::Visitor); has callbacks => ( isa => "HashRef", is => "rw", default => sub { {} }, ); has class_callbacks => ( isa => "ArrayRef", is => "rw", default => sub { [] }, ); has ignore_return_values => ( isa => "Bool", is => "rw", ); sub BUILDARGS { my ( $class, @args ) = @_; my $args = $class->SUPER::BUILDARGS(@args); my %init_args = map { $_->init_arg => undef } $class->meta->get_all_attributes; my %callbacks = map { $_ => $args->{$_} } grep { not exists $init_args{$_} } keys %$args; my @class_callbacks = do { no strict 'refs'; grep { # this check can be half assed because an ->isa check will be # performed later. Anything that cold plausibly be a class name # should be included in the list, even if the class doesn't # actually exist. m{ :: | ^[A-Z] }x # if it looks kinda lack a class name or scalar keys %{"${_}::"} # or it really is a class } keys %callbacks; }; # sort from least derived to most derived @class_callbacks = sort { !$a->isa($b) <=> !$b->isa($a) } @class_callbacks; return { %$args, callbacks => \%callbacks, class_callbacks => \@class_callbacks, }; } sub visit { my $self = shift; my $replaced_hash = local $self->{_replaced} = ($self->{_replaced} || {}); # delete it after we're done with the whole visit my @ret; for my $data (@_) { my $refaddr = ref($data) && refaddr($data); # we need this early, it may change by the time we write replaced hash local *_ = \$data; # alias $_ if ( $refaddr and exists $replaced_hash->{ $refaddr } ) { if ( FIVE_EIGHT ) { $self->trace( mapping => replace => $data, with => $replaced_hash->{$refaddr} ) if DEBUG; push @ret, $data = $replaced_hash->{$refaddr}; next; } else { carp(q{Assignment of replacement value for already seen reference } . overload::StrVal($data) . q{ to container doesn't work on Perls older than 5.8, structure shape may have lost integrity.}); } } my $ret; if ( defined wantarray ) { $ret = $self->SUPER::visit( $self->callback( visit => $data ) ); } else { $self->SUPER::visit( $self->callback( visit => $data ) ); } $replaced_hash->{$refaddr} = $_ if $refaddr and ( not ref $_ or $refaddr ne refaddr($_) ); push @ret, $ret if defined wantarray; } return ( @_ == 1 ? $ret[0] : @ret ); } sub visit_ref { my ( $self, $data ) = @_; my $mapped = $self->callback( ref => $data ); if ( ref $mapped ) { return $self->SUPER::visit_ref($mapped); } else { return $self->visit($mapped); } } sub visit_seen { my ( $self, $data, $result ) = @_; my $mapped = $self->callback( seen => $data, $result ); no warnings 'uninitialized'; if ( refaddr($mapped) == refaddr($data) ) { return $result; } else { return $mapped; } } sub visit_value { my ( $self, $data ) = @_; $data = $self->callback_and_reg( value => $data ); $self->callback_and_reg( ( ref($data) ? "ref_value" : "plain_value" ) => $data ); } sub visit_object { my ( $self, $data ) = @_; $self->trace( flow => visit_object => $data ) if DEBUG; $data = $self->callback_and_reg( object => $data ); my $class_cb = 0; foreach my $class ( grep { $data->isa($_) } @{ $self->class_callbacks } ) { last unless blessed($data); die "Unexpected object $data found" unless $data->isa($class); $self->trace( flow => class_callback => $class, on => $data ) if DEBUG; $class_cb++; $data = $self->callback_and_reg( $class => $data ); } $data = $self->callback_and_reg( object_no_class => $data ) unless $class_cb; $data = $self->callback_and_reg( object_final => $data ) if blessed($data); $data; } sub visit_scalar { my ( $self, $data ) = @_; my $new_data = $self->callback_and_reg( scalar => $data ); if ( (reftype($new_data)||"") =~ /^(?: SCALAR | REF | LVALUE | VSTRING ) $/x ) { my $visited = $self->SUPER::visit_scalar( $new_data ); no warnings "uninitialized"; if ( refaddr($visited) != refaddr($data) ) { return $self->_register_mapping( $data, $visited ); } else { return $visited; } } else { return $self->_register_mapping( $data, $self->visit( $new_data ) ); } } sub subname { $_[1] } BEGIN { eval { require Sub::Name; no warnings 'redefine'; *subname = \&Sub::Name::subname; }; foreach my $reftype ( qw/array hash glob code/ ) { my $name = "visit_$reftype"; no strict 'refs'; *$name = subname(__PACKAGE__ . "::$name", eval ' sub { my ( $self, $data ) = @_; my $new_data = $self->callback_and_reg( '.$reftype.' => $data ); if ( "'.uc($reftype).'" eq (reftype($new_data)||"") ) { my $visited = $self->SUPER::visit_'.$reftype.'( $new_data ); no warnings "uninitialized"; if ( refaddr($visited) != refaddr($data) ) { return $self->_register_mapping( $data, $visited ); } else { return $visited; } } else { return $self->_register_mapping( $data, $self->visit( $new_data ) ); } } ' || die $@); } } sub visit_hash_entry { my ( $self, $key, $value, $hash ) = @_; my ( $new_key, $new_value ) = $self->callback( hash_entry => $_[1], $_[2], $_[3] ); unless ( $self->ignore_return_values ) { no warnings 'uninitialized'; if ( ref($value) and refaddr($value) != refaddr($new_value) ) { $self->_register_mapping( $value, $new_value ); if ( $key ne $new_key ) { return $self->SUPER::visit_hash_entry($new_key, $new_value, $_[3]); } else { return $self->SUPER::visit_hash_entry($_[1], $new_value, $_[3]); } } else { if ( $key ne $new_key ) { return $self->SUPER::visit_hash_entry($new_key, $_[2], $_[3]); } else { return $self->SUPER::visit_hash_entry($_[1], $_[2], $_[3]); } } } else { return $self->SUPER::visit_hash_entry($_[1], $_[2], $_[3]); } } sub callback { my ( $self, $name, $data, @args ) = @_; if ( my $code = $self->callbacks->{$name} ) { $self->trace( flow => callback => $name, on => $data ) if DEBUG; if ( wantarray ) { my @ret = $self->$code( $data, @args ); return $self->ignore_return_values ? ( $data, @args ) : @ret; } else { my $ret = $self->$code( $data, @args ); return $self->ignore_return_values ? $data : $ret ; } } else { return wantarray ? ( $data, @args ) : $data; } } sub callback_and_reg { my ( $self, $name, $data, @args ) = @_; my $new_data = $self->callback( $name, $data, @args ); unless ( $self->ignore_return_values ) { no warnings 'uninitialized'; if ( ref $data ) { if ( refaddr($data) != refaddr($new_data) ) { return $self->_register_mapping( $data, $new_data ); } } return $new_data; } return $data; } sub visit_tied { my ( $self, $tied, @args ) = @_; $self->SUPER::visit_tied( $self->callback_and_reg( tied => $tied, @args ), @args ); } __PACKAGE__->meta->make_immutable if __PACKAGE__->meta->can("make_immutable"); __PACKAGE__; __END__ =pod =head1 NAME Data::Visitor::Callback - A Data::Visitor with callbacks. =head1 VERSION version 0.30 =head1 SYNOPSIS use Data::Visitor::Callback; my $v = Data::Visitor::Callback->new( # you can provide callbacks # $_ will contain the visited value value => sub { ... }, array => sub { ... }, # you can also delegate to method names # this specific example will force traversal on objects, by using the # 'visit_ref' callback which normally traverse unblessed references object => "visit_ref", # you can also use class names as callbacks # the callback will be invoked on all objects which inherit that class 'Some::Class' => sub { my ( $v, $obj ) = @_; # $v is the visitor ... }, ); $v->visit( $some_perl_value ); =head1 DESCRIPTION This is a L subclass that lets you invoke callbacks instead of needing to subclass yourself. =encoding utf8 =head1 METHODS =over 4 =item new %opts, %callbacks Construct a new visitor. The options supported are: =over 4 =item ignore_return_values When this is true (off by default) the return values from the callbacks are ignored, thus disabling the fmapping behavior as documented in L. This is useful when you want to modify $_ directly =item tied_as_objects Whether ot not to visit the L of a tied structure instead of pretending the structure is just a normal one. See L. =back =back =head1 CALLBACKS Use these keys for the corresponding callbacks. The callback is in the form: sub { my ( $visitor, $data ) = @_; # or you can use $_, it's aliased return $data; # or modified data } Within the callback $_ is aliased to the data, and this is also passed in the parameter list. Any method can also be used as a callback: object => "visit_ref", # visit objects anyway =over 4 =item visit Called for all values =item value Called for non objects, non container (hash, array, glob or scalar ref) values. =item ref_value Called after C, for references to regexes, globs and code. =item plain_value Called after C for non references. =item object Called for blessed objects. Since L will not recurse downwards unless you delegate to C, you can specify C as the callback for C in order to enter objects. It is reccomended that you specify the classes (or base classes) you want though, instead of just visiting any object forcefully. =item Some::Class You can use any class name as a callback. This is colled only after the C callback. If the object C the class then the callback will fire. These callbacks are called from least derived to most derived by comparing the classes' C at construction time. =item object_no_class Called for every object that did not have a class callback. =item object_final The last callback called for objects, useful if you want to post process the output of any class callbacks. =item array Called for array references. =item hash Called for hash references. =item glob Called for glob references. =item scalar Called for scalar references. =item tied Called on the return value of C for all tied containers. Also passes in the variable as the second argument. =item seen Called for a reference value encountered a second time. Passes in the result mapping as the second argument. =back =for Pod::Coverage DEBUG FIVE_EIGHT callback callback_and_reg subname =head1 AUTHORS =over 4 =item * Yuval Kogman =item * Marcel Grünauer =back =head1 COPYRIGHT AND LICENSE This software is copyright (c) 2013 by Yuval Kogman. 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