Algorithm-C3-0.11/000755 000000 000000 00000000000 13752545111 013727 5ustar00rootwheel000000 000000 Algorithm-C3-0.11/README000644 000000 000000 00000013402 13752545110 014606 0ustar00rootwheel000000 000000 NAME Algorithm::C3 - A module for merging hierarchies using the C3 algorithm SYNOPSIS use Algorithm::C3; # merging a classic diamond # inheritance graph like this: # # # / \ # # \ / # my @merged = Algorithm::C3::merge( 'D', sub { # extract the ISA array # from the package no strict 'refs'; @{$_[0] . '::ISA'}; } ); print join ", " => @merged; # prints D, B, C, A DESCRIPTION This module implements the C3 algorithm. I have broken this out into it's own module because I found myself copying and pasting it way too often for various needs. Most of the uses I have for C3 revolve around class building and metamodels, but it could also be used for things like dependency resolution as well since it tends to do such a nice job of preserving local precedence orderings. Below is a brief explanation of C3 taken from the Class::C3 module. For more detailed information, see the "SEE ALSO" section and the links there. What is C3? C3 is the name of an algorithm which aims to provide a sane method resolution order under multiple inheritance. It was first introduced in the language Dylan (see links in the "SEE ALSO" section), and then later adopted as the preferred MRO (Method Resolution Order) for the new-style classes in Python 2.3. Most recently it has been adopted as the 'canonical' MRO for Perl 6 classes, and the default MRO for Parrot objects as well. How does C3 work. C3 works by always preserving local precedence ordering. This essentially means that no class will appear before any of it's subclasses. Take the classic diamond inheritance pattern for instance: / \ \ / The standard Perl 5 MRO would be (D, B, A, C). The result being that A appears before C, even though C is the subclass of A. The C3 MRO algorithm however, produces the following MRO (D, B, C, A), which does not have this same issue. This example is fairly trivial, for more complex examples and a deeper explanation, see the links in the "SEE ALSO" section. FUNCTION merge ($root, $func_to_fetch_parent, $cache) This takes a $root node, which can be anything really it is up to you. Then it takes a $func_to_fetch_parent which can be either a CODE reference (see SYNOPSIS above for an example), or a string containing a method name to be called on all the items being linearized. An example of how this might look is below: { package A; sub supers { no strict 'refs'; @{$_[0] . '::ISA'}; } package C; our @ISA = ('A'); package B; our @ISA = ('A'); package D; our @ISA = ('B', 'C'); } print join ", " => Algorithm::C3::merge('D', 'supers'); The purpose of $func_to_fetch_parent is to provide a way for "merge" to extract the parents of $root. This is needed for C3 to be able to do it's work. The $cache parameter is an entirely optional performance measure, and should not change behavior. If supplied, it should be a hashref that merge can use as a private cache between runs to speed things up. Generally speaking, if you will be calling merge many times on related things, and the parent fetching function will return constant results given the same arguments during all of these calls, you can and should reuse the same shared cache hash for all of the calls. Example: sub do_some_merging { my %merge_cache; my @foo_mro = Algorithm::C3::Merge('Foo', \&get_supers, \%merge_cache); my @bar_mro = Algorithm::C3::Merge('Bar', \&get_supers, \%merge_cache); my @baz_mro = Algorithm::C3::Merge('Baz', \&get_supers, \%merge_cache); my @quux_mro = Algorithm::C3::Merge('Quux', \&get_supers, \%merge_cache); # ... } CODE COVERAGE I use Devel::Cover to test the code coverage of my tests, below is the Devel::Cover report on this module's test suite. ------------------------ ------ ------ ------ ------ ------ ------ ------ File stmt bran cond sub pod time total ------------------------ ------ ------ ------ ------ ------ ------ ------ Algorithm/C3.pm 100.0 100.0 100.0 100.0 100.0 100.0 100.0 ------------------------ ------ ------ ------ ------ ------ ------ ------ Total 100.0 100.0 100.0 100.0 100.0 100.0 100.0 ------------------------ ------ ------ ------ ------ ------ ------ ------ SEE ALSO The original Dylan paper The prototype Perl 6 Object Model uses C3 Parrot now uses C3 Python 2.3 MRO related links C3 for TinyCLOS AUTHORS Stevan Little, Brandon L. Black, COPYRIGHT AND LICENSE Copyright 2006 by Infinity Interactive, Inc. This library is free software; you can redistribute it and/or modify it under the same terms as Perl itself. Algorithm-C3-0.11/Changes000644 000000 000000 00000002516 13752545035 015233 0ustar00rootwheel000000 000000 Revision history for Perl extension Algorithm-C3. 0.11 - 2020-11-10 - set metadata for static dependency list and install - move repository to github - minor test cleanups - fix Makefile.PL to work for authors in perl 5.26+ 0.10 - 2014-08-15 - declare minimum version of perl as 5.6 in metadata 0.09 - 2014-03-01 - convert to use ExtUtils::MakeMaker using distar - include repo and bugtracker metadata 0.08 Thu. May 28, 2009 - Fix a couple of doc typos. - Don't create a fake Makefile.PL. 0.07 Mon. May 14, 2007 - Some very small optimizations had been gathering in the repo for a while, this gets them out to CPAN. Probably won't notice much difference except in extreme cases. 0.06 Fri. Nov. 17, 2006 - Added tests from konobi - Added some other new tests too - Fixed infinite loop on recursive heirarchies 0.05 Fri. Aug. 25, 2006 - Add the ability for the caller to supply a persistent merge cache hashref 0.04 Wed. Aug. 09, 2006 - Remove accidental "use Class::C3" from t/006_complex_merge.t (no functional changes from 0.03) 0.03 Tue. Aug. 08, 2006 - New test + bugfix for RT#20879 0.02 Sun. Jul. 30, 2006 - code refactored for speed by Brandon L. Black 0.01 Wed. Feb. 15, 2006 - initial release, code and tests taken from Class::C3 Algorithm-C3-0.11/MANIFEST000644 000000 000000 00000001230 13752545111 015054 0ustar00rootwheel000000 000000 Changes lib/Algorithm/C3.pm maint/Makefile.PL.include Makefile.PL MANIFEST This list of files t/001_merge.t t/002_merge.t t/003_merge.t t/004_merge.t t/005_order_disagreement.t t/006_complex_merge.t t/007_cached_merge.t t/008_cached_merge_unordered.t t/009_dbic_merge.t t/010_complex_merge_classless.t t/011_infinite_loop.t xt/pod.t xt/pod_coverage.t META.yml Module YAML meta-data (added by MakeMaker) META.json Module JSON meta-data (added by MakeMaker) README README file (added by Distar) LICENSE LICENSE file (added by Distar) Algorithm-C3-0.11/LICENSE000644 000000 000000 00000043561 13752545111 014745 0ustar00rootwheel000000 000000 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) 2020 by Stevan Little , Brandon L. Black . 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, Fifth Floor, Boston, MA 02110-1301 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) 2020 by Stevan Little , Brandon L. Black . 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 Algorithm-C3-0.11/t/000755 000000 000000 00000000000 13752545107 014177 5ustar00rootwheel000000 000000 Algorithm-C3-0.11/xt/000755 000000 000000 00000000000 13752545107 014367 5ustar00rootwheel000000 000000 Algorithm-C3-0.11/META.yml000644 000000 000000 00000001514 13752545107 015206 0ustar00rootwheel000000 000000 --- abstract: 'A module for merging hierarchies using the C3 algorithm' author: - 'Stevan Little ' - 'Brandon L. Black ' build_requires: Test::More: '0.47' configure_requires: ExtUtils::MakeMaker: '0' dynamic_config: 0 generated_by: 'ExtUtils::MakeMaker version 7.50, CPAN::Meta::Converter version 2.150010' license: perl meta-spec: url: http://module-build.sourceforge.net/META-spec-v1.4.html version: '1.4' name: Algorithm-C3 no_index: directory: - t - xt requires: Carp: '0.01' perl: '5.006' resources: bugtracker: https://rt.cpan.org/Public/Dist/Display.html?Name=Algorithm-C3 license: http://dev.perl.org/licenses/ repository: https://github.com/moose/Algorithm-C3.git version: '0.11' x_serialization_backend: 'CPAN::Meta::YAML version 0.018' x_static_install: 1 Algorithm-C3-0.11/META.json000644 000000 000000 00000003225 13752545110 015351 0ustar00rootwheel000000 000000 { "abstract" : "A module for merging hierarchies using the C3 algorithm", "author" : [ "Stevan Little ", "Brandon L. Black " ], "dynamic_config" : 0, "generated_by" : "ExtUtils::MakeMaker version 7.50, CPAN::Meta::Converter version 2.150010", "license" : [ "perl_5" ], "meta-spec" : { "url" : "http://search.cpan.org/perldoc?CPAN::Meta::Spec", "version" : 2 }, "name" : "Algorithm-C3", "no_index" : { "directory" : [ "t", "xt" ] }, "prereqs" : { "build" : { "requires" : {} }, "configure" : { "requires" : { "ExtUtils::MakeMaker" : "0" } }, "develop" : { "requires" : { "Test::Pod" : "1.14", "Test::Pod::Coverage" : "1.04" } }, "runtime" : { "requires" : { "Carp" : "0.01", "perl" : "5.006" } }, "test" : { "requires" : { "Test::More" : "0.47" } } }, "release_status" : "stable", "resources" : { "bugtracker" : { "mailto" : "bug-Algorithm-C3@rt.cpan.org", "web" : "https://rt.cpan.org/Public/Dist/Display.html?Name=Algorithm-C3" }, "license" : [ "http://dev.perl.org/licenses/" ], "repository" : { "type" : "git", "url" : "https://github.com/moose/Algorithm-C3.git", "web" : "https://github.com/moose/Algorithm-C3" } }, "version" : "0.11", "x_serialization_backend" : "JSON::PP version 4.05", "x_static_install" : 1 } Algorithm-C3-0.11/lib/000755 000000 000000 00000000000 13752545107 014502 5ustar00rootwheel000000 000000 Algorithm-C3-0.11/maint/000755 000000 000000 00000000000 13752545107 015044 5ustar00rootwheel000000 000000 Algorithm-C3-0.11/Makefile.PL000644 000000 000000 00000005406 13752532347 015715 0ustar00rootwheel000000 000000 use strict; use warnings FATAL => 'all'; use 5.006; my %META = ( name => 'Algorithm-C3', license => 'perl_5', prereqs => { configure => { requires => { 'ExtUtils::MakeMaker' => 0, } }, build => { requires => { } }, test => { requires => { 'Test::More' => '0.47', }, }, runtime => { requires => { 'perl' => '5.006', 'Carp' => '0.01', }, }, develop => { requires => { 'Test::Pod' => '1.14', 'Test::Pod::Coverage' => '1.04', }, }, }, resources => { repository => { url => 'https://github.com/moose/Algorithm-C3.git', web => 'https://github.com/moose/Algorithm-C3', type => 'git', }, bugtracker => { web => 'https://rt.cpan.org/Public/Dist/Display.html?Name=Algorithm-C3', mailto => 'bug-Algorithm-C3@rt.cpan.org', }, license => [ 'http://dev.perl.org/licenses/' ], }, no_index => { directory => [ 't', 'xt' ], }, dynamic_config => 0, x_static_install => 1, ); my %MM_ARGS = (); ## BOILERPLATE ############################################################### require ExtUtils::MakeMaker; (do './maint/Makefile.PL.include' or die $@) unless -f 'META.yml'; # have to do this since old EUMM dev releases miss the eval $VERSION line my $eumm_version = eval $ExtUtils::MakeMaker::VERSION; my $mymeta = $eumm_version >= 6.57_02; my $mymeta_broken = $mymeta && $eumm_version < 6.57_07; ($MM_ARGS{NAME} = $META{name}) =~ s/-/::/g; ($MM_ARGS{VERSION_FROM} = "lib/$MM_ARGS{NAME}.pm") =~ s{::}{/}g; $META{license} = [ $META{license} ] if $META{license} && !ref $META{license}; $MM_ARGS{LICENSE} = $META{license}[0] if $META{license} && $eumm_version >= 6.30; $MM_ARGS{NO_MYMETA} = 1 if $mymeta_broken; $MM_ARGS{META_ADD} = { 'meta-spec' => { version => 2 }, %META } unless -f 'META.yml'; $MM_ARGS{PL_FILES} ||= {}; $MM_ARGS{NORECURS} = 1 if not exists $MM_ARGS{NORECURS}; for (qw(configure build test runtime)) { my $key = $_ eq 'runtime' ? 'PREREQ_PM' : uc $_.'_REQUIRES'; my $r = $MM_ARGS{$key} = { %{$META{prereqs}{$_}{requires} || {}}, %{delete $MM_ARGS{$key} || {}}, }; defined $r->{$_} or delete $r->{$_} for keys %$r; } $MM_ARGS{MIN_PERL_VERSION} = delete $MM_ARGS{PREREQ_PM}{perl} || 0; delete $MM_ARGS{MIN_PERL_VERSION} if $eumm_version < 6.47_01; $MM_ARGS{BUILD_REQUIRES} = {%{$MM_ARGS{BUILD_REQUIRES}}, %{delete $MM_ARGS{TEST_REQUIRES}}} if $eumm_version < 6.63_03; $MM_ARGS{PREREQ_PM} = {%{$MM_ARGS{PREREQ_PM}}, %{delete $MM_ARGS{BUILD_REQUIRES}}} if $eumm_version < 6.55_01; delete $MM_ARGS{CONFIGURE_REQUIRES} if $eumm_version < 6.51_03; ExtUtils::MakeMaker::WriteMakefile(%MM_ARGS); ## END BOILERPLATE ########################################################### Algorithm-C3-0.11/maint/Makefile.PL.include000644 000000 000000 00000000405 13747165004 020435 0ustar00rootwheel000000 000000 BEGIN { -e 'Distar' or system("git clone git://git.shadowcat.co.uk/p5sagit/Distar.git") } use lib 'Distar/lib'; use Distar; use ExtUtils::MakeMaker 6.68 (); author [ 'Stevan Little ', 'Brandon L. Black ', ]; 1; Algorithm-C3-0.11/lib/Algorithm/000755 000000 000000 00000000000 13752545107 016430 5ustar00rootwheel000000 000000 Algorithm-C3-0.11/lib/Algorithm/C3.pm000644 000000 000000 00000023557 13752545031 017243 0ustar00rootwheel000000 000000 package Algorithm::C3; use strict; use warnings; use Carp 'confess'; our $VERSION = '0.11'; sub merge { my ($root, $parent_fetcher, $cache) = @_; $cache ||= {}; my @STACK; # stack for simulating recursion my $pfetcher_is_coderef = ref($parent_fetcher) eq 'CODE'; unless ($pfetcher_is_coderef or $root->can($parent_fetcher)) { confess "Could not find method $parent_fetcher in $root"; } my $current_root = $root; my $current_parents = [ $root->$parent_fetcher ]; my $recurse_mergeout = []; my $i = 0; my %seen = ( $root => 1 ); my ($new_root, $mergeout, %tails); while(1) { if($i < @$current_parents) { $new_root = $current_parents->[$i++]; if($seen{$new_root}) { my @isastack; my $reached; for(my $i = 0; $i < $#STACK; $i += 4) { if($reached || ($reached = ($STACK[$i] eq $new_root))) { push(@isastack, $STACK[$i]); } } my $isastack = join(q{ -> }, @isastack, $current_root, $new_root); die "Infinite loop detected in parents of '$root': $isastack"; } $seen{$new_root} = 1; unless ($pfetcher_is_coderef or $new_root->can($parent_fetcher)) { confess "Could not find method $parent_fetcher in $new_root"; } push(@STACK, $current_root, $current_parents, $recurse_mergeout, $i); $current_root = $new_root; $current_parents = $cache->{pfetch}->{$current_root} ||= [ $current_root->$parent_fetcher ]; $recurse_mergeout = []; $i = 0; next; } $seen{$current_root} = 0; $mergeout = $cache->{merge}->{$current_root} ||= do { # This do-block is the code formerly known as the function # that was a perl-port of the python code at # http://www.python.org/2.3/mro.html :) # Initial set (make sure everything is copied - it will be modded) my @seqs = map { [@$_] } @$recurse_mergeout; push(@seqs, [@$current_parents]) if @$current_parents; # Construct the tail-checking hash (actually, it's cheaper and still # correct to re-use it throughout this function) foreach my $seq (@seqs) { $tails{$seq->[$_]}++ for (1..$#$seq); } my @res = ( $current_root ); while (1) { my $cand; my $winner; foreach (@seqs) { next if !@$_; if(!$winner) { # looking for a winner $cand = $_->[0]; # seq head is candidate next if $tails{$cand}; # he loses if in %tails # Handy warn to give a output like the ones on # http://www.python.org/download/releases/2.3/mro/ #warn " = " . join(' + ', @res) . " + merge([" . join('] [', map { join(', ', @$_) } grep { @$_ } @seqs) . "])\n"; push @res => $winner = $cand; shift @$_; # strip off our winner $tails{$_->[0]}-- if @$_; # keep %tails sane } elsif($_->[0] eq $winner) { shift @$_; # strip off our winner $tails{$_->[0]}-- if @$_; # keep %tails sane } } # Handy warn to give a output like the ones on # http://www.python.org/download/releases/2.3/mro/ #warn " = " . join(' + ', @res) . "\n" if !$cand; last if !$cand; die q{Inconsistent hierarchy found while merging '} . $current_root . qq{':\n\t} . qq{current merge results [\n\t\t} . (join ",\n\t\t" => @res) . qq{\n\t]\n\t} . qq{merging failed on '$cand'\n} if !$winner; } \@res; }; return @$mergeout if !@STACK; $i = pop(@STACK); $recurse_mergeout = pop(@STACK); $current_parents = pop(@STACK); $current_root = pop(@STACK); push(@$recurse_mergeout, $mergeout); } } 1; __END__ =pod =head1 NAME Algorithm::C3 - A module for merging hierarchies using the C3 algorithm =head1 SYNOPSIS use Algorithm::C3; # merging a classic diamond # inheritance graph like this: # # # / \ # # \ / # my @merged = Algorithm::C3::merge( 'D', sub { # extract the ISA array # from the package no strict 'refs'; @{$_[0] . '::ISA'}; } ); print join ", " => @merged; # prints D, B, C, A =head1 DESCRIPTION This module implements the C3 algorithm. I have broken this out into it's own module because I found myself copying and pasting it way too often for various needs. Most of the uses I have for C3 revolve around class building and metamodels, but it could also be used for things like dependency resolution as well since it tends to do such a nice job of preserving local precedence orderings. Below is a brief explanation of C3 taken from the L module. For more detailed information, see the L section and the links there. =head2 What is C3? C3 is the name of an algorithm which aims to provide a sane method resolution order under multiple inheritance. It was first introduced in the language Dylan (see links in the L section), and then later adopted as the preferred MRO (Method Resolution Order) for the new-style classes in Python 2.3. Most recently it has been adopted as the 'canonical' MRO for Perl 6 classes, and the default MRO for Parrot objects as well. =head2 How does C3 work. C3 works by always preserving local precedence ordering. This essentially means that no class will appear before any of it's subclasses. Take the classic diamond inheritance pattern for instance: / \ \ / The standard Perl 5 MRO would be (D, B, A, C). The result being that B appears before B, even though B is the subclass of B. The C3 MRO algorithm however, produces the following MRO (D, B, C, A), which does not have this same issue. This example is fairly trivial, for more complex examples and a deeper explanation, see the links in the L section. =head1 FUNCTION =over 4 =item B This takes a C<$root> node, which can be anything really it is up to you. Then it takes a C<$func_to_fetch_parent> which can be either a CODE reference (see L above for an example), or a string containing a method name to be called on all the items being linearized. An example of how this might look is below: { package A; sub supers { no strict 'refs'; @{$_[0] . '::ISA'}; } package C; our @ISA = ('A'); package B; our @ISA = ('A'); package D; our @ISA = ('B', 'C'); } print join ", " => Algorithm::C3::merge('D', 'supers'); The purpose of C<$func_to_fetch_parent> is to provide a way for C to extract the parents of C<$root>. This is needed for C3 to be able to do it's work. The C<$cache> parameter is an entirely optional performance measure, and should not change behavior. If supplied, it should be a hashref that merge can use as a private cache between runs to speed things up. Generally speaking, if you will be calling merge many times on related things, and the parent fetching function will return constant results given the same arguments during all of these calls, you can and should reuse the same shared cache hash for all of the calls. Example: sub do_some_merging { my %merge_cache; my @foo_mro = Algorithm::C3::Merge('Foo', \&get_supers, \%merge_cache); my @bar_mro = Algorithm::C3::Merge('Bar', \&get_supers, \%merge_cache); my @baz_mro = Algorithm::C3::Merge('Baz', \&get_supers, \%merge_cache); my @quux_mro = Algorithm::C3::Merge('Quux', \&get_supers, \%merge_cache); # ... } =back =head1 CODE COVERAGE I use B to test the code coverage of my tests, below is the B report on this module's test suite. ------------------------ ------ ------ ------ ------ ------ ------ ------ File stmt bran cond sub pod time total ------------------------ ------ ------ ------ ------ ------ ------ ------ Algorithm/C3.pm 100.0 100.0 100.0 100.0 100.0 100.0 100.0 ------------------------ ------ ------ ------ ------ ------ ------ ------ Total 100.0 100.0 100.0 100.0 100.0 100.0 100.0 ------------------------ ------ ------ ------ ------ ------ ------ ------ =head1 SEE ALSO =head2 The original Dylan paper =over 4 =item L =back =head2 The prototype Perl 6 Object Model uses C3 =over 4 =item L =back =head2 Parrot now uses C3 =over 4 =item L =item L =back =head2 Python 2.3 MRO related links =over 4 =item L =item L =back =head2 C3 for TinyCLOS =over 4 =item L =back =head1 AUTHORS Stevan Little, Estevan@iinteractive.comE Brandon L. Black, Eblblack@gmail.comE =head1 COPYRIGHT AND LICENSE Copyright 2006 by Infinity Interactive, Inc. L This library is free software; you can redistribute it and/or modify it under the same terms as Perl itself. =cut Algorithm-C3-0.11/xt/pod.t000644 000000 000000 00000000125 13747200367 015334 0ustar00rootwheel000000 000000 use strict; use warnings; use Test::More; use Test::Pod 1.14; all_pod_files_ok(); Algorithm-C3-0.11/xt/pod_coverage.t000644 000000 000000 00000000142 13747200367 017206 0ustar00rootwheel000000 000000 use strict; use warnings; use Test::More; use Test::Pod::Coverage 1.04; all_pod_coverage_ok(); Algorithm-C3-0.11/t/004_merge.t000644 000000 000000 00000002402 13747200367 016044 0ustar00rootwheel000000 000000 use strict; use warnings; use Test::More tests => 1; use Algorithm::C3; =pod example taken from: L Object ^ | LifeForm ^ ^ / \ Sentient BiPedal ^ ^ | | Intelligent Humanoid ^ ^ \ / Vulcan define class () end class; define class () end class; define class () end class; define class () end class; define class (, ) end class; =cut { package Object; sub my_ISA { no strict 'refs'; @{$_[0] . '::ISA'}; } package LifeForm; our @ISA = qw(Object); package Sentient; our @ISA = qw(LifeForm); package BiPedal; our @ISA = qw(LifeForm); package Intelligent; our @ISA = qw(Sentient); package Humanoid; our @ISA = qw(BiPedal); package Vulcan; our @ISA = qw(Intelligent Humanoid); } is_deeply( [ Algorithm::C3::merge('Vulcan', 'my_ISA') ], [ qw(Vulcan Intelligent Sentient Humanoid BiPedal LifeForm Object) ], '... got the right C3 merge order for the Vulcan Dylan Example'); Algorithm-C3-0.11/t/008_cached_merge_unordered.t000644 000000 000000 00000010527 13747200367 021415 0ustar00rootwheel000000 000000 use strict; use warnings; use Test::More tests => 11; use Algorithm::C3; =pod Just like 007_cached_merge, but test the MROs in some wierd order, rather than alphabetical order. This example is taken from: http://rt.cpan.org/Public/Bug/Display.html?id=20879 --- --- --- Level 5 8 | A | 9 | B | A | C | (More General) --- --- --- V \ | / | \ | / | \ | / | \ | / | --- | Level 4 7 | D | | --- | / \ | / \ | --- --- | Level 3 4 | G | 6 | E | | --- --- | | | | | | | --- --- | Level 2 3 | H | 5 | F | | --- --- | \ / | | \ / | | \ | | / \ | | / \ | | --- --- | Level 1 1 | J | 2 | I | | --- --- | \ / | \ / | --- v Level 0 0 | K | (More Specialized) --- 0123456789A KJIHGFEDABC =cut { package Test::A; sub x { 1 } package Test::B; sub x { 1 } package Test::C; sub x { 1 } package Test::D; our @ISA = qw(Test::A Test::B Test::C); package Test::E; our @ISA = qw(Test::D); package Test::F; our @ISA = qw(Test::E); package Test::G; our @ISA = qw(Test::D); package Test::H; our @ISA = qw(Test::G); package Test::I; our @ISA = qw(Test::H Test::F); package Test::J; our @ISA = qw(Test::F); package Test::K; our @ISA = qw(Test::J Test::I); } sub supers { no strict 'refs'; @{$_[0] . '::ISA'}; } my %cache; is_deeply( [ Algorithm::C3::merge('Test::J', \&supers, \%cache) ], [ qw(Test::J Test::F Test::E Test::D Test::A Test::B Test::C) ], '... got the right C3 merge order for Test::J'); is_deeply( [ Algorithm::C3::merge('Test::G', \&supers, \%cache) ], [ qw(Test::G Test::D Test::A Test::B Test::C) ], '... got the right C3 merge order for Test::G'); is_deeply( [ Algorithm::C3::merge('Test::B', \&supers, \%cache) ], [ qw(Test::B) ], '... got the right C3 merge order for Test::B'); is_deeply( [ Algorithm::C3::merge('Test::D', \&supers, \%cache) ], [ qw(Test::D Test::A Test::B Test::C) ], '... got the right C3 merge order for Test::D'); is_deeply( [ Algorithm::C3::merge('Test::C', \&supers, \%cache) ], [ qw(Test::C) ], '... got the right C3 merge order for Test::C'); is_deeply( [ Algorithm::C3::merge('Test::I', \&supers, \%cache) ], [ qw(Test::I Test::H Test::G Test::F Test::E Test::D Test::A Test::B Test::C) ], '... got the right C3 merge order for Test::I'); is_deeply( [ Algorithm::C3::merge('Test::K', \&supers, \%cache) ], [ qw(Test::K Test::J Test::I Test::H Test::G Test::F Test::E Test::D Test::A Test::B Test::C) ], '... got the right C3 merge order for Test::K'); is_deeply( [ Algorithm::C3::merge('Test::E', \&supers, \%cache) ], [ qw(Test::E Test::D Test::A Test::B Test::C) ], '... got the right C3 merge order for Test::E'); is_deeply( [ Algorithm::C3::merge('Test::F', \&supers, \%cache) ], [ qw(Test::F Test::E Test::D Test::A Test::B Test::C) ], '... got the right C3 merge order for Test::F'); is_deeply( [ Algorithm::C3::merge('Test::A', \&supers, \%cache) ], [ qw(Test::A) ], '... got the right C3 merge order for Test::A'); is_deeply( [ Algorithm::C3::merge('Test::H', \&supers, \%cache) ], [ qw(Test::H Test::G Test::D Test::A Test::B Test::C) ], '... got the right C3 merge order for Test::H'); Algorithm-C3-0.11/t/011_infinite_loop.t000644 000000 000000 00000005660 13747200367 017612 0ustar00rootwheel000000 000000 use strict; use warnings; use Test::More; use Algorithm::C3; plan skip_all => "Your system has no SIGALRM" if !exists $SIG{ALRM}; plan tests => 8; =pod These are like the 010_complex_merge_classless test, but an infinite loop has been made in the heirarchy, to test that we can fail cleanly instead of going into an infinite loop =cut my @loopies = ( { #1 k => [qw(j i)], j => [qw(f)], i => [qw(h f)], h => [qw(g)], g => [qw(d)], f => [qw(e)], e => [qw(f)], d => [qw(a b c)], c => [], b => [], a => [], }, { #2 k => [qw(j i)], j => [qw(f)], i => [qw(h f)], h => [qw(g)], g => [qw(d)], f => [qw(e)], e => [qw(d)], d => [qw(a b c)], c => [qw(f)], b => [], a => [], }, { #3 k => [qw(j i)], j => [qw(f)], i => [qw(h f)], h => [qw(g)], g => [qw(d)], f => [qw(e)], e => [qw(d)], d => [qw(a b c)], c => [], b => [], a => [qw(k)], }, { #4 k => [qw(j i)], j => [qw(f k)], i => [qw(h f)], h => [qw(g)], g => [qw(d)], f => [qw(e)], e => [qw(d)], d => [qw(a b c)], c => [], b => [], a => [], }, { #5 k => [qw(j i)], j => [qw(f)], i => [qw(h f)], h => [qw(k g)], g => [qw(d)], f => [qw(e)], e => [qw(d)], d => [qw(a b c)], c => [], b => [], a => [], }, { #6 k => [qw(j i)], j => [qw(f)], i => [qw(h f)], h => [qw(g)], g => [qw(d)], f => [qw(e)], e => [qw(d)], d => [qw(a b c)], c => [], b => [qw(b)], a => [], }, { #7 k => [qw(k j i)], j => [qw(f)], i => [qw(h f)], h => [qw(g)], g => [qw(d)], f => [qw(e)], e => [qw(d)], d => [qw(a b c)], c => [], b => [], a => [], }, { #7 k => [qw(j i)], j => [qw(f)], i => [qw(h f)], h => [qw(g)], g => [qw(d)], f => [qw(e)], e => [qw(d)], d => [qw(a h b c)], c => [], b => [], a => [], }, ); foreach my $loopy (@loopies) { eval { local $SIG{ALRM} = sub { die "ALRMTimeout" }; alarm(3); Algorithm::C3::merge('k', sub { return @{ $loopy->{ $_[0] } }; }); }; if(my $err = $@) { if($err =~ /ALRMTimeout/) { ok(0, "Loop terminated by SIGALRM"); } elsif($err =~ /Infinite loop detected/) { ok(1, "Graceful exception thrown"); } else { ok(0, "Unrecognized exception: $err"); } } else { ok(0, "Infinite loop apparently succeeded???"); } } Algorithm-C3-0.11/t/002_merge.t000644 000000 000000 00000005371 13747200367 016052 0ustar00rootwheel000000 000000 use strict; use warnings; use Test::More tests => 6; use Algorithm::C3; =pod This example is take from: http://www.python.org/2.3/mro.html "My first example" class O: pass class F(O): pass class E(O): pass class D(O): pass class C(D,F): pass class B(D,E): pass class A(B,C): pass 6 --- Level 3 | O | (more general) / --- \ / | \ | / | \ | / | \ | --- --- --- | Level 2 3 | D | 4| E | | F | 5 | --- --- --- | \ \ _ / | | \ / \ _ | | \ / \ | | --- --- | Level 1 1 | B | | C | 2 | --- --- | \ / | \ / \ / --- Level 0 0 | A | (more specialized) --- =cut { package Test::O; sub supers { no strict 'refs'; @{$_[0] . '::ISA'}; } package Test::F; our @ISA = qw(Test::O); package Test::E; our @ISA = qw(Test::O); package Test::D; our @ISA = qw(Test::O); package Test::C; our @ISA = qw(Test::D Test::F); package Test::B; our @ISA = qw(Test::D Test::E); package Test::A; our @ISA = qw(Test::B Test::C); } is_deeply( [ Algorithm::C3::merge('Test::F', 'supers') ], [ qw(Test::F Test::O) ], '... got the right C3 merge order for Test::F'); is_deeply( [ Algorithm::C3::merge('Test::E', 'supers') ], [ qw(Test::E Test::O) ], '... got the right C3 merge order for Test::E'); is_deeply( [ Algorithm::C3::merge('Test::D', 'supers') ], [ qw(Test::D Test::O) ], '... got the right C3 merge order for Test::D'); is_deeply( [ Algorithm::C3::merge('Test::C', 'supers') ], [ qw(Test::C Test::D Test::F Test::O) ], '... got the right C3 merge order for Test::C'); is_deeply( [ Algorithm::C3::merge('Test::B', 'supers') ], [ qw(Test::B Test::D Test::E Test::O) ], '... got the right C3 merge order for Test::B'); is_deeply( [ Algorithm::C3::merge('Test::A', 'supers') ], [ qw(Test::A Test::B Test::C Test::D Test::E Test::F Test::O) ], '... got the right C3 merge order for Test::A'); Algorithm-C3-0.11/t/006_complex_merge.t000644 000000 000000 00000010203 13747200367 017573 0ustar00rootwheel000000 000000 use strict; use warnings; use Test::More tests => 11; use Algorithm::C3; =pod This example is taken from: http://rt.cpan.org/Public/Bug/Display.html?id=20879 --- --- --- Level 5 8 | A | 9 | B | A | C | (More General) --- --- --- V \ | / | \ | / | \ | / | \ | / | --- | Level 4 7 | D | | --- | / \ | / \ | --- --- | Level 3 4 | G | 6 | E | | --- --- | | | | | | | --- --- | Level 2 3 | H | 5 | F | | --- --- | \ / | | \ / | | \ | | / \ | | / \ | | --- --- | Level 1 1 | J | 2 | I | | --- --- | \ / | \ / | --- v Level 0 0 | K | (More Specialized) --- 0123456789A KJIHGFEDABC =cut { package Test::A; sub x { 1 } package Test::B; sub x { 1 } package Test::C; sub x { 1 } package Test::D; our @ISA = qw(Test::A Test::B Test::C); package Test::E; our @ISA = qw(Test::D); package Test::F; our @ISA = qw(Test::E); package Test::G; our @ISA = qw(Test::D); package Test::H; our @ISA = qw(Test::G); package Test::I; our @ISA = qw(Test::H Test::F); package Test::J; our @ISA = qw(Test::F); package Test::K; our @ISA = qw(Test::J Test::I); } sub supers { no strict 'refs'; @{$_[0] . '::ISA'}; } is_deeply( [ Algorithm::C3::merge('Test::A', \&supers) ], [ qw(Test::A) ], '... got the right C3 merge order for Test::A'); is_deeply( [ Algorithm::C3::merge('Test::B', \&supers) ], [ qw(Test::B) ], '... got the right C3 merge order for Test::B'); is_deeply( [ Algorithm::C3::merge('Test::C', \&supers) ], [ qw(Test::C) ], '... got the right C3 merge order for Test::C'); is_deeply( [ Algorithm::C3::merge('Test::D', \&supers) ], [ qw(Test::D Test::A Test::B Test::C) ], '... got the right C3 merge order for Test::D'); is_deeply( [ Algorithm::C3::merge('Test::E', \&supers) ], [ qw(Test::E Test::D Test::A Test::B Test::C) ], '... got the right C3 merge order for Test::E'); is_deeply( [ Algorithm::C3::merge('Test::F', \&supers) ], [ qw(Test::F Test::E Test::D Test::A Test::B Test::C) ], '... got the right C3 merge order for Test::F'); is_deeply( [ Algorithm::C3::merge('Test::G', \&supers) ], [ qw(Test::G Test::D Test::A Test::B Test::C) ], '... got the right C3 merge order for Test::G'); is_deeply( [ Algorithm::C3::merge('Test::H', \&supers) ], [ qw(Test::H Test::G Test::D Test::A Test::B Test::C) ], '... got the right C3 merge order for Test::H'); is_deeply( [ Algorithm::C3::merge('Test::I', \&supers) ], [ qw(Test::I Test::H Test::G Test::F Test::E Test::D Test::A Test::B Test::C) ], '... got the right C3 merge order for Test::I'); is_deeply( [ Algorithm::C3::merge('Test::J', \&supers) ], [ qw(Test::J Test::F Test::E Test::D Test::A Test::B Test::C) ], '... got the right C3 merge order for Test::J'); is_deeply( [ Algorithm::C3::merge('Test::K', \&supers) ], [ qw(Test::K Test::J Test::I Test::H Test::G Test::F Test::E Test::D Test::A Test::B Test::C) ], '... got the right C3 merge order for Test::K'); Algorithm-C3-0.11/t/003_merge.t000644 000000 000000 00000003506 13747200367 016051 0ustar00rootwheel000000 000000 use strict; use warnings; use Test::More tests => 1; use Algorithm::C3; =pod This example is take from: http://www.python.org/2.3/mro.html "My second example" class O: pass class F(O): pass class E(O): pass class D(O): pass class C(D,F): pass class B(E,D): pass class A(B,C): pass 6 --- Level 3 | O | / --- \ / | \ / | \ / | \ --- --- --- Level 2 2 | E | 4 | D | | F | 5 --- --- --- \ / \ / \ / \ / \ / \ / --- --- Level 1 1 | B | | C | 3 --- --- \ / \ / --- Level 0 0 | A | --- >>> A.mro() (, , , , , , ) =cut { package Test::O; sub supers { no strict 'refs'; @{$_[0] . '::ISA'}; } package Test::F; our @ISA = qw(Test::O); package Test::E; our @ISA = qw(Test::O); package Test::D; our @ISA = qw(Test::O); package Test::C; our @ISA = qw(Test::D Test::F); package Test::B; our @ISA = qw(Test::E Test::D); package Test::A; our @ISA = qw(Test::B Test::C); } is_deeply( [ Algorithm::C3::merge('Test::A', 'supers') ], [ qw(Test::A Test::B Test::E Test::C Test::D Test::F Test::O) ], '... got the right C3 merge order for Test::A'); Algorithm-C3-0.11/t/005_order_disagreement.t000644 000000 000000 00000001414 13747200367 020612 0ustar00rootwheel000000 000000 use strict; use warnings; use Test::More tests => 1; use Algorithm::C3; =pod This example is take from: http://www.python.org/2.3/mro.html "Serious order disagreement" # From Guido class O: pass class X(O): pass class Y(O): pass class A(X,Y): pass class B(Y,X): pass try: class Z(A,B): pass #creates Z(A,B) in Python 2.2 except TypeError: pass # Z(A,B) cannot be created in Python 2.3 =cut { package X; package Y; package XY; our @ISA = ('X', 'Y'); package YX; our @ISA = ('Y', 'X'); package Z; our @ISA = ('XY', 'YX'); } eval { Algorithm::C3::merge('Z' => sub { no strict 'refs'; @{$_[0] . '::ISA'}; }) }; like($@, qr/^Inconsistent hierarchy/, '... got the right error with an inconsistent hierarchy'); Algorithm-C3-0.11/t/009_dbic_merge.t000644 000000 000000 00000007510 13747200367 017037 0ustar00rootwheel000000 000000 use strict; use warnings; use Test::More tests => 1; use Algorithm::C3; =pod This example is taken from the inheritance graph of DBIx::Class::Core in DBIx::Class v0.07002: (No ASCII art this time, this graph is insane) The xx:: prefixes are just to be sure these bogus declarations never stomp on real ones =cut { package xx::DBIx::Class::Core; our @ISA = qw/ xx::DBIx::Class::Serialize::Storable xx::DBIx::Class::InflateColumn xx::DBIx::Class::Relationship xx::DBIx::Class::PK::Auto xx::DBIx::Class::PK xx::DBIx::Class::Row xx::DBIx::Class::ResultSourceProxy::Table xx::DBIx::Class::AccessorGroup /; package xx::DBIx::Class::InflateColumn; our @ISA = qw/ xx::DBIx::Class::Row /; package xx::DBIx::Class::Row; our @ISA = qw/ xx::DBIx::Class /; package xx::DBIx::Class; our @ISA = qw/ xx::DBIx::Class::Componentised xx::Class::Data::Accessor /; package xx::DBIx::Class::Relationship; our @ISA = qw/ xx::DBIx::Class::Relationship::Helpers xx::DBIx::Class::Relationship::Accessor xx::DBIx::Class::Relationship::CascadeActions xx::DBIx::Class::Relationship::ProxyMethods xx::DBIx::Class::Relationship::Base xx::DBIx::Class /; package xx::DBIx::Class::Relationship::Helpers; our @ISA = qw/ xx::DBIx::Class::Relationship::HasMany xx::DBIx::Class::Relationship::HasOne xx::DBIx::Class::Relationship::BelongsTo xx::DBIx::Class::Relationship::ManyToMany /; package xx::DBIx::Class::Relationship::ProxyMethods; our @ISA = qw/ xx::DBIx::Class /; package xx::DBIx::Class::Relationship::Base; our @ISA = qw/ xx::DBIx::Class /; package xx::DBIx::Class::PK::Auto; our @ISA = qw/ xx::DBIx::Class /; package xx::DBIx::Class::PK; our @ISA = qw/ xx::DBIx::Class::Row /; package xx::DBIx::Class::ResultSourceProxy::Table; our @ISA = qw/ xx::DBIx::Class::AccessorGroup xx::DBIx::Class::ResultSourceProxy /; package xx::DBIx::Class::ResultSourceProxy; our @ISA = qw/ xx::DBIx::Class /; package xx::Class::Data::Accessor; our @ISA = (); package xx::DBIx::Class::Relationship::HasMany; our @ISA = (); package xx::DBIx::Class::Relationship::HasOne; our @ISA = (); package xx::DBIx::Class::Relationship::BelongsTo; our @ISA = (); package xx::DBIx::Class::Relationship::ManyToMany; our @ISA = (); package xx::DBIx::Class::Componentised; our @ISA = (); package xx::DBIx::Class::AccessorGroup; our @ISA = (); package xx::DBIx::Class::Serialize::Storable; our @ISA = (); package xx::DBIx::Class::Relationship::Accessor; our @ISA = (); package xx::DBIx::Class::Relationship::CascadeActions; our @ISA = (); } sub supers { no strict 'refs'; @{$_[0] . '::ISA'}; } is_deeply( [ Algorithm::C3::merge('xx::DBIx::Class::Core', \&supers) ], [qw/ xx::DBIx::Class::Core xx::DBIx::Class::Serialize::Storable xx::DBIx::Class::InflateColumn xx::DBIx::Class::Relationship xx::DBIx::Class::Relationship::Helpers xx::DBIx::Class::Relationship::HasMany xx::DBIx::Class::Relationship::HasOne xx::DBIx::Class::Relationship::BelongsTo xx::DBIx::Class::Relationship::ManyToMany xx::DBIx::Class::Relationship::Accessor xx::DBIx::Class::Relationship::CascadeActions xx::DBIx::Class::Relationship::ProxyMethods xx::DBIx::Class::Relationship::Base xx::DBIx::Class::PK::Auto xx::DBIx::Class::PK xx::DBIx::Class::Row xx::DBIx::Class::ResultSourceProxy::Table xx::DBIx::Class::AccessorGroup xx::DBIx::Class::ResultSourceProxy xx::DBIx::Class xx::DBIx::Class::Componentised xx::Class::Data::Accessor /], '... got the right C3 merge order for DBIx::Class::Core'); Algorithm-C3-0.11/t/001_merge.t000644 000000 000000 00000002350 13747200367 016043 0ustar00rootwheel000000 000000 use strict; use warnings; use Test::More tests => 4; use Algorithm::C3; { package My::A; package My::C; our @ISA = ('My::A'); package My::B; our @ISA = ('My::A'); package My::D; our @ISA = ('My::B', 'My::C'); } { my @merged = Algorithm::C3::merge( 'My::D', sub { no strict 'refs'; @{$_[0] . '::ISA'}; } ); is_deeply( \@merged, [ qw/My::D My::B My::C My::A/ ], '... merged the lists correctly'); } { package My::E; sub supers { no strict 'refs'; @{$_[0] . '::ISA'}; } package My::F; our @ISA = ('My::E'); package My::G; our @ISA = ('My::E'); package My::H; our @ISA = ('My::G', 'My::F'); sub method_exists_only_in_H { @ISA } } { my @merged = Algorithm::C3::merge('My::H', 'supers'); is_deeply( \@merged, [ qw/My::H My::G My::F My::E/ ], '... merged the lists correctly'); } eval { Algorithm::C3::merge( 'My::H', 'this_method_does_not_exist' ); }; ok($@, '... this died as we expected'); eval { Algorithm::C3::merge( 'My::H', 'method_exists_only_in_H' ); }; ok($@, '... this died as we expected'); Algorithm-C3-0.11/t/007_cached_merge.t000644 000000 000000 00000010460 13747200367 017341 0ustar00rootwheel000000 000000 use strict; use warnings; use Test::More tests => 11; use Algorithm::C3; =pod Just like 006_complex_merge, but with the caching turned on. This example is taken from: http://rt.cpan.org/Public/Bug/Display.html?id=20879 --- --- --- Level 5 8 | A | 9 | B | A | C | (More General) --- --- --- V \ | / | \ | / | \ | / | \ | / | --- | Level 4 7 | D | | --- | / \ | / \ | --- --- | Level 3 4 | G | 6 | E | | --- --- | | | | | | | --- --- | Level 2 3 | H | 5 | F | | --- --- | \ / | | \ / | | \ | | / \ | | / \ | | --- --- | Level 1 1 | J | 2 | I | | --- --- | \ / | \ / | --- v Level 0 0 | K | (More Specialized) --- 0123456789A KJIHGFEDABC =cut { package Test::A; sub x { 1 } package Test::B; sub x { 1 } package Test::C; sub x { 1 } package Test::D; our @ISA = qw(Test::A Test::B Test::C); package Test::E; our @ISA = qw(Test::D); package Test::F; our @ISA = qw(Test::E); package Test::G; our @ISA = qw(Test::D); package Test::H; our @ISA = qw(Test::G); package Test::I; our @ISA = qw(Test::H Test::F); package Test::J; our @ISA = qw(Test::F); package Test::K; our @ISA = qw(Test::J Test::I); } sub supers { no strict 'refs'; @{$_[0] . '::ISA'}; } my %cache; is_deeply( [ Algorithm::C3::merge('Test::A', \&supers, \%cache) ], [ qw(Test::A) ], '... got the right C3 merge order for Test::A'); is_deeply( [ Algorithm::C3::merge('Test::B', \&supers, \%cache) ], [ qw(Test::B) ], '... got the right C3 merge order for Test::B'); is_deeply( [ Algorithm::C3::merge('Test::C', \&supers, \%cache) ], [ qw(Test::C) ], '... got the right C3 merge order for Test::C'); is_deeply( [ Algorithm::C3::merge('Test::D', \&supers, \%cache) ], [ qw(Test::D Test::A Test::B Test::C) ], '... got the right C3 merge order for Test::D'); is_deeply( [ Algorithm::C3::merge('Test::E', \&supers, \%cache) ], [ qw(Test::E Test::D Test::A Test::B Test::C) ], '... got the right C3 merge order for Test::E'); is_deeply( [ Algorithm::C3::merge('Test::F', \&supers, \%cache) ], [ qw(Test::F Test::E Test::D Test::A Test::B Test::C) ], '... got the right C3 merge order for Test::F'); is_deeply( [ Algorithm::C3::merge('Test::G', \&supers, \%cache) ], [ qw(Test::G Test::D Test::A Test::B Test::C) ], '... got the right C3 merge order for Test::G'); is_deeply( [ Algorithm::C3::merge('Test::H', \&supers, \%cache) ], [ qw(Test::H Test::G Test::D Test::A Test::B Test::C) ], '... got the right C3 merge order for Test::H'); is_deeply( [ Algorithm::C3::merge('Test::I', \&supers, \%cache) ], [ qw(Test::I Test::H Test::G Test::F Test::E Test::D Test::A Test::B Test::C) ], '... got the right C3 merge order for Test::I'); is_deeply( [ Algorithm::C3::merge('Test::J', \&supers, \%cache) ], [ qw(Test::J Test::F Test::E Test::D Test::A Test::B Test::C) ], '... got the right C3 merge order for Test::J'); is_deeply( [ Algorithm::C3::merge('Test::K', \&supers, \%cache) ], [ qw(Test::K Test::J Test::I Test::H Test::G Test::F Test::E Test::D Test::A Test::B Test::C) ], '... got the right C3 merge order for Test::K'); Algorithm-C3-0.11/t/010_complex_merge_classless.t000644 000000 000000 00000006257 13747200367 021660 0ustar00rootwheel000000 000000 use strict; use warnings; use Test::More tests => 11; use Algorithm::C3; =pod This example is taken from: http://rt.cpan.org/Public/Bug/Display.html?id=20879 --- --- --- Level 5 8 | A | 9 | B | A | C | (More General) --- --- --- V \ | / | \ | / | \ | / | \ | / | --- | Level 4 7 | D | | --- | / \ | / \ | --- --- | Level 3 4 | G | 6 | E | | --- --- | | | | | | | --- --- | Level 2 3 | H | 5 | F | | --- --- | \ / | | \ / | | \ | | / \ | | / \ | | --- --- | Level 1 1 | J | 2 | I | | --- --- | \ / | \ / | --- v Level 0 0 | K | (More Specialized) --- 0123456789A KJIHGFEDABC =cut my $foo = { k => [qw(j i)], j => [qw(f)], i => [qw(h f)], h => [qw(g)], g => [qw(d)], f => [qw(e)], e => [qw(d)], d => [qw(a b c)], c => [], b => [], a => [], }; sub supers { return @{ $foo->{ $_[0] } }; } is_deeply( [ Algorithm::C3::merge('a', \&supers) ], [ qw(a) ], '... got the right C3 merge order for a'); is_deeply( [ Algorithm::C3::merge('b', \&supers) ], [ qw(b) ], '... got the right C3 merge order for b'); is_deeply( [ Algorithm::C3::merge('c', \&supers) ], [ qw(c) ], '... got the right C3 merge order for c'); is_deeply( [ Algorithm::C3::merge('d', \&supers) ], [ qw(d a b c) ], '... got the right C3 merge order for d'); is_deeply( [ Algorithm::C3::merge('e', \&supers) ], [ qw(e d a b c) ], '... got the right C3 merge order for e'); is_deeply( [ Algorithm::C3::merge('f', \&supers) ], [ qw(f e d a b c) ], '... got the right C3 merge order for f'); is_deeply( [ Algorithm::C3::merge('g', \&supers) ], [ qw(g d a b c) ], '... got the right C3 merge order for g'); is_deeply( [ Algorithm::C3::merge('h', \&supers) ], [ qw(h g d a b c) ], '... got the right C3 merge order for h'); is_deeply( [ Algorithm::C3::merge('i', \&supers) ], [ qw(i h g f e d a b c) ], '... got the right C3 merge order for i'); is_deeply( [ Algorithm::C3::merge('j', \&supers) ], [ qw(j f e d a b c) ], '... got the right C3 merge order for j'); is_deeply( [ Algorithm::C3::merge('k', \&supers) ], [ qw(k j i h g f e d a b c) ], '... got the right C3 merge order for k');