Test-Deep-UnorderedPairs-0.003/000755 000767 000024 00000000000 12146607360 016513 5ustar00etherstaff000000 000000 Test-Deep-UnorderedPairs-0.003/Changes000644 000767 000024 00000000714 12146607360 020010 0ustar00etherstaff000000 000000 Revision history for Test-Deep-UnorderedPairs 0.003 2013-05-20 23:06:32 PDT-0700 (Karen Etheridge) - properly handle testing of lists where tuple keys are repeated (RT#85470) 0.002 2013-05-20 08:54:13 PDT-0700 (Karen Etheridge) - fix tests that would not run on perls pre-5.9.5 because re::is_regexp was not available 0.001 2013-05-18 20:37:48 PDT-0700 (Karen Etheridge) - Initial release. Test-Deep-UnorderedPairs-0.003/dist.ini000644 000767 000024 00000000401 12146607360 020152 0ustar00etherstaff000000 000000 name = Test-Deep-UnorderedPairs author = Karen Etheridge copyright_holder = Karen Etheridge copyright_year = 2013 license = Perl_5 [@Author::ETHER] :version = 0.006 [Test::Kwalitee::Extra] Test-Deep-UnorderedPairs-0.003/examples/000755 000767 000024 00000000000 12146607360 020331 5ustar00etherstaff000000 000000 Test-Deep-UnorderedPairs-0.003/INSTALL000644 000767 000024 00000002022 12146607360 017540 0ustar00etherstaff000000 000000 This is the Perl distribution Test-Deep-UnorderedPairs. Installing Test-Deep-UnorderedPairs is straightforward. ## Installation with cpanm If you have cpanm, you only need one line: % cpanm Test::Deep::UnorderedPairs If you are installing into a system-wide directory, you may need to pass the "-S" flag to cpanm, which uses sudo to install the module: % cpanm -S Test::Deep::UnorderedPairs ## Installing with the CPAN shell Alternatively, if your CPAN shell is set up, you should just be able to do: % cpan Test::Deep::UnorderedPairs ## Manual installation As a last resort, you can manually install it. Download the tarball, untar it, then build it: % perl Makefile.PL % make && make test Then install it: % make install If you are installing into a system-wide directory, you may need to run: % sudo make install ## Documentation Test-Deep-UnorderedPairs documentation is available as POD. You can run perldoc from a shell to read the documentation: % perldoc Test::Deep::UnorderedPairs Test-Deep-UnorderedPairs-0.003/lib/000755 000767 000024 00000000000 12146607360 017261 5ustar00etherstaff000000 000000 Test-Deep-UnorderedPairs-0.003/LICENSE000644 000767 000024 00000043664 12146607360 017535 0ustar00etherstaff000000 000000 This software is copyright (c) 2013 by Karen Etheridge. 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 Karen Etheridge. 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 Karen Etheridge. 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 Test-Deep-UnorderedPairs-0.003/Makefile.PL000644 000767 000024 00000003413 12146607360 020466 0ustar00etherstaff000000 000000 use strict; use warnings; use 5.006; use ExtUtils::MakeMaker 6.30; my %WriteMakefileArgs = ( "ABSTRACT" => "A Test::Deep plugin for comparing lists as if they were hashes", "AUTHOR" => "Karen Etheridge ", "BUILD_REQUIRES" => {}, "CONFIGURE_REQUIRES" => { "ExtUtils::MakeMaker" => "6.30" }, "DISTNAME" => "Test-Deep-UnorderedPairs", "EXE_FILES" => [], "LICENSE" => "perl", "NAME" => "Test::Deep::UnorderedPairs", "PREREQ_PM" => { "Carp" => 0, "Exporter" => 0, "Test::Deep::ArrayLength" => 0, "Test::Deep::Cmp" => 0, "Test::Deep::Hash" => 0, "Test::Deep::Set" => 0, "parent" => 0, "strict" => 0, "warnings" => 0 }, "TEST_REQUIRES" => { "File::Find" => 0, "File::Temp" => 0, "Test::CheckDeps" => "0.002", "Test::Deep" => 0, "Test::Fatal" => 0, "Test::More" => "0.94", "Test::Warnings" => 0 }, "VERSION" => "0.003", "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); Test-Deep-UnorderedPairs-0.003/MANIFEST000644 000767 000024 00000001004 12146607360 017637 0ustar00etherstaff000000 000000 Changes INSTALL LICENSE MANIFEST META.json META.yml Makefile.PL README dist.ini examples/synopsis.t lib/Test/Deep/UnorderedPairs.pm t/00-check-deps.t t/00-compile.t t/01-basic.t t/02-repeated-keys.t t/lib/Util.pm weaver.ini xt/author/pod-spell.t xt/release/changes_has_content.t xt/release/cpan-changes.t xt/release/distmeta.t xt/release/eol.t xt/release/kwalitee.t xt/release/minimum-version.t xt/release/no-tabs.t xt/release/pod-coverage.t xt/release/pod-no404s.t xt/release/pod-syntax.t xt/release/test-version.t Test-Deep-UnorderedPairs-0.003/META.json000644 000767 000024 00000032525 12146607360 020143 0ustar00etherstaff000000 000000 { "abstract" : "A Test::Deep plugin for comparing lists as if they were hashes", "author" : [ "Karen Etheridge " ], "dynamic_config" : 0, "generated_by" : "Dist::Zilla version 4.300034, CPAN::Meta::Converter version 2.130880", "license" : [ "perl_5" ], "meta-spec" : { "url" : "http://search.cpan.org/perldoc?CPAN::Meta::Spec", "version" : "2" }, "name" : "Test-Deep-UnorderedPairs", "no_index" : { "directory" : [ "t", "xt", "examples" ] }, "prereqs" : { "configure" : { "requires" : { "ExtUtils::MakeMaker" : "6.30" } }, "develop" : { "requires" : { "Dist::Zilla" : "4.300034", "Dist::Zilla::PluginBundle::Author::ETHER" : "0.006", "Pod::Coverage::TrustPod" : "0", "Test::CPAN::Changes" : "0.19", "Test::CPAN::Meta" : "0", "Test::Pod" : "1.41", "Test::Pod::Coverage" : "1.08" } }, "runtime" : { "requires" : { "Carp" : "0", "Exporter" : "0", "Test::Deep::ArrayLength" : "0", "Test::Deep::Cmp" : "0", "Test::Deep::Hash" : "0", "Test::Deep::Set" : "0", "parent" : "0", "perl" : "5.006", "strict" : "0", "warnings" : "0" } }, "test" : { "requires" : { "File::Find" : "0", "File::Temp" : "0", "Test::CheckDeps" : "0.002", "Test::Deep" : "0", "Test::Fatal" : "0", "Test::More" : "0.94", "Test::Warnings" : "0" } } }, "provides" : { "Test::Deep::UnorderedPairElements" : { "file" : "lib/Test/Deep/UnorderedPairs.pm", "version" : "0.003" }, "Test::Deep::UnorderedPairKeys" : { "file" : "lib/Test/Deep/UnorderedPairs.pm", "version" : "0.003" }, "Test::Deep::UnorderedPairs" : { "file" : "lib/Test/Deep/UnorderedPairs.pm", "version" : "0.003" } }, "release_status" : "stable", "resources" : { "bugtracker" : { "mailto" : "bug-Test-Deep-UnorderedPairs@rt.cpan.org", "web" : "https://rt.cpan.org/Public/Dist/Display.html?Name=Test-Deep-UnorderedPairs" }, "homepage" : "https://github.com/karenetheridge/Test-Deep-UnorderedPairs", "repository" : { "type" : "git", "url" : "https://github.com/karenetheridge/Test-Deep-UnorderedPairs.git", "web" : "https://github.com/karenetheridge/Test-Deep-UnorderedPairs" } }, "version" : "0.003", "x_Dist_Zilla" : { "perl" : { "version" : "5.017011" }, "plugins" : [ { "class" : "Dist::Zilla::Plugin::Git::NextVersion", "name" : "@Author::ETHER/Git::NextVersion", "version" : "2.013" }, { "class" : "Dist::Zilla::Plugin::GithubMeta", "name" : "@Author::ETHER/GithubMeta", "version" : "0.28" }, { "class" : "Dist::Zilla::Plugin::AutoMetaResources", "name" : "@Author::ETHER/AutoMetaResources", "version" : "1.20" }, { "class" : "Dist::Zilla::Plugin::Authority", "name" : "@Author::ETHER/Authority", "version" : "1.006" }, { "class" : "Dist::Zilla::Plugin::MetaNoIndex", "name" : "@Author::ETHER/MetaNoIndex", "version" : "4.300034" }, { "class" : "Dist::Zilla::Plugin::MetaProvides::Package", "name" : "@Author::ETHER/MetaProvides::Package", "version" : "1.14000002" }, { "class" : "Dist::Zilla::Plugin::MetaConfig", "name" : "@Author::ETHER/MetaConfig", "version" : "4.300034" }, { "class" : "Dist::Zilla::Plugin::ExecDir", "name" : "@Author::ETHER/ExecDir", "version" : "4.300034" }, { "class" : "Dist::Zilla::Plugin::ShareDir", "name" : "@Author::ETHER/ShareDir", "version" : "4.300034" }, { "class" : "Dist::Zilla::Plugin::Git::GatherDir", "name" : "@Author::ETHER/Git::GatherDir", "version" : "2.013" }, { "class" : "Dist::Zilla::Plugin::MetaYAML", "name" : "@Author::ETHER/MetaYAML", "version" : "4.300034" }, { "class" : "Dist::Zilla::Plugin::MetaJSON", "name" : "@Author::ETHER/MetaJSON", "version" : "4.300034" }, { "class" : "Dist::Zilla::Plugin::License", "name" : "@Author::ETHER/License", "version" : "4.300034" }, { "class" : "Dist::Zilla::Plugin::Readme", "name" : "@Author::ETHER/Readme", "version" : "4.300034" }, { "class" : "Dist::Zilla::Plugin::Manifest", "name" : "@Author::ETHER/Manifest", "version" : "4.300034" }, { "class" : "Dist::Zilla::Plugin::Test::Compile", "name" : "@Author::ETHER/Test::Compile", "version" : "2.002" }, { "class" : "Dist::Zilla::Plugin::Test::CheckDeps", "name" : "@Author::ETHER/Test::CheckDeps", "version" : "0.006" }, { "class" : "Dist::Zilla::Plugin::NoTabsTests", "name" : "@Author::ETHER/NoTabsTests", "version" : "0.01" }, { "class" : "Dist::Zilla::Plugin::EOLTests", "name" : "@Author::ETHER/EOLTests", "version" : "0.02" }, { "class" : "Dist::Zilla::Plugin::MetaTests", "name" : "@Author::ETHER/MetaTests", "version" : "4.300034" }, { "class" : "Dist::Zilla::Plugin::Test::Version", "name" : "@Author::ETHER/Test::Version", "version" : "0.002004" }, { "class" : "Dist::Zilla::Plugin::Test::CPAN::Changes", "name" : "@Author::ETHER/Test::CPAN::Changes", "version" : "0.008" }, { "class" : "Dist::Zilla::Plugin::Test::ChangesHasContent", "name" : "@Author::ETHER/Test::ChangesHasContent", "version" : "0.006" }, { "class" : "Dist::Zilla::Plugin::Test::MinimumVersion", "name" : "@Author::ETHER/Test::MinimumVersion", "version" : "2.000004" }, { "class" : "Dist::Zilla::Plugin::PodSyntaxTests", "name" : "@Author::ETHER/PodSyntaxTests", "version" : "4.300034" }, { "class" : "Dist::Zilla::Plugin::PodCoverageTests", "name" : "@Author::ETHER/PodCoverageTests", "version" : "4.300034" }, { "class" : "Dist::Zilla::Plugin::Test::PodSpelling", "name" : "@Author::ETHER/Test::PodSpelling", "version" : "2.004003" }, { "class" : "Dist::Zilla::Plugin::Test::Pod::No404s", "name" : "@Author::ETHER/Test::Pod::No404s", "version" : "1.001" }, { "class" : "Dist::Zilla::Plugin::PruneCruft", "name" : "@Author::ETHER/PruneCruft", "version" : "4.300034" }, { "class" : "Dist::Zilla::Plugin::ManifestSkip", "name" : "@Author::ETHER/ManifestSkip", "version" : "4.300034" }, { "class" : "Dist::Zilla::Plugin::Git::Describe", "name" : "@Author::ETHER/Git::Describe", "version" : "0.002" }, { "class" : "Dist::Zilla::Plugin::PkgVersion", "name" : "@Author::ETHER/PkgVersion", "version" : "4.300034" }, { "class" : "Dist::Zilla::Plugin::PodWeaver", "name" : "@Author::ETHER/PodWeaver", "version" : "3.101641" }, { "class" : "Dist::Zilla::Plugin::NextRelease", "name" : "@Author::ETHER/NextRelease", "version" : "4.300034" }, { "class" : "Dist::Zilla::Plugin::AutoPrereqs", "name" : "@Author::ETHER/AutoPrereqs", "version" : "4.300034" }, { "class" : "Dist::Zilla::Plugin::MinimumPerl", "name" : "@Author::ETHER/MinimumPerl", "version" : "1.003" }, { "class" : "Dist::Zilla::Plugin::Prereqs", "config" : { "Dist::Zilla::Plugin::Prereqs" : { "phase" : "develop", "type" : "requires" } }, "name" : "@Author::ETHER/Prereqs", "version" : "4.300034" }, { "class" : "Dist::Zilla::Plugin::ReadmeAnyFromPod", "name" : "@Author::ETHER/ReadmeAnyFromPod", "version" : "0.120120" }, { "class" : "Dist::Zilla::Plugin::MakeMaker", "name" : "@Author::ETHER/MakeMaker", "version" : "4.300034" }, { "class" : "Dist::Zilla::Plugin::InstallGuide", "name" : "@Author::ETHER/InstallGuide", "version" : "1.200000" }, { "class" : "Dist::Zilla::Plugin::CopyFilesFromBuild", "name" : "@Author::ETHER/CopyFilesFromBuild", "version" : "0.103510" }, { "class" : "Dist::Zilla::Plugin::RunExtraTests", "name" : "@Author::ETHER/RunExtraTests", "version" : "0.011" }, { "class" : "Dist::Zilla::Plugin::Git::Check", "name" : "@Author::ETHER/Git::Check", "version" : "2.013" }, { "class" : "Dist::Zilla::Plugin::Git::CheckFor::MergeConflicts", "name" : "@Author::ETHER/Git::CheckFor::MergeConflicts", "version" : "0.006" }, { "class" : "Dist::Zilla::Plugin::Git::CheckFor::CorrectBranch", "name" : "@Author::ETHER/Git::CheckFor::CorrectBranch", "version" : "0.006" }, { "class" : "Dist::Zilla::Plugin::Git::Remote::Check", "name" : "@Author::ETHER/Git::Remote::Check", "version" : "0.1.2" }, { "class" : "Dist::Zilla::Plugin::CheckPrereqsIndexed", "name" : "@Author::ETHER/CheckPrereqsIndexed", "version" : "0.008" }, { "class" : "Dist::Zilla::Plugin::TestRelease", "name" : "@Author::ETHER/TestRelease", "version" : "4.300034" }, { "class" : "Dist::Zilla::Plugin::UploadToCPAN", "name" : "@Author::ETHER/UploadToCPAN", "version" : "4.300034" }, { "class" : "Dist::Zilla::Plugin::Git::Commit", "name" : "@Author::ETHER/Git::Commit", "version" : "2.013" }, { "class" : "Dist::Zilla::Plugin::Git::Tag", "name" : "@Author::ETHER/Git::Tag", "version" : "2.013" }, { "class" : "Dist::Zilla::Plugin::Git::Push", "name" : "@Author::ETHER/Git::Push", "version" : "2.013" }, { "class" : "Dist::Zilla::Plugin::GitHub::Update", "name" : "@Author::ETHER/GitHub::Update", "version" : "0.34" }, { "class" : "Dist::Zilla::Plugin::InstallRelease", "name" : "@Author::ETHER/InstallRelease", "version" : "0.008" }, { "class" : "Dist::Zilla::Plugin::ConfirmRelease", "name" : "@Author::ETHER/ConfirmRelease", "version" : "4.300034" }, { "class" : "Dist::Zilla::Plugin::Test::Kwalitee::Extra", "name" : "Test::Kwalitee::Extra", "version" : "v0.0.1" }, { "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:ETHER" } Test-Deep-UnorderedPairs-0.003/META.yml000644 000767 000024 00000021337 12146607360 017772 0ustar00etherstaff000000 000000 --- abstract: 'A Test::Deep plugin for comparing lists as if they were hashes' author: - 'Karen Etheridge ' build_requires: File::Find: 0 File::Temp: 0 Test::CheckDeps: 0.002 Test::Deep: 0 Test::Fatal: 0 Test::More: 0.94 Test::Warnings: 0 configure_requires: ExtUtils::MakeMaker: 6.30 dynamic_config: 0 generated_by: 'Dist::Zilla version 4.300034, CPAN::Meta::Converter version 2.130880' license: perl meta-spec: url: http://module-build.sourceforge.net/META-spec-v1.4.html version: 1.4 name: Test-Deep-UnorderedPairs no_index: directory: - t - xt - examples provides: Test::Deep::UnorderedPairElements: file: lib/Test/Deep/UnorderedPairs.pm version: 0.003 Test::Deep::UnorderedPairKeys: file: lib/Test/Deep/UnorderedPairs.pm version: 0.003 Test::Deep::UnorderedPairs: file: lib/Test/Deep/UnorderedPairs.pm version: 0.003 requires: Carp: 0 Exporter: 0 Test::Deep::ArrayLength: 0 Test::Deep::Cmp: 0 Test::Deep::Hash: 0 Test::Deep::Set: 0 parent: 0 perl: 5.006 strict: 0 warnings: 0 resources: bugtracker: https://rt.cpan.org/Public/Dist/Display.html?Name=Test-Deep-UnorderedPairs homepage: https://github.com/karenetheridge/Test-Deep-UnorderedPairs repository: https://github.com/karenetheridge/Test-Deep-UnorderedPairs.git version: 0.003 x_Dist_Zilla: perl: version: 5.017011 plugins: - class: Dist::Zilla::Plugin::Git::NextVersion name: '@Author::ETHER/Git::NextVersion' version: 2.013 - class: Dist::Zilla::Plugin::GithubMeta name: '@Author::ETHER/GithubMeta' version: 0.28 - class: Dist::Zilla::Plugin::AutoMetaResources name: '@Author::ETHER/AutoMetaResources' version: 1.20 - class: Dist::Zilla::Plugin::Authority name: '@Author::ETHER/Authority' version: 1.006 - class: Dist::Zilla::Plugin::MetaNoIndex name: '@Author::ETHER/MetaNoIndex' version: 4.300034 - class: Dist::Zilla::Plugin::MetaProvides::Package name: '@Author::ETHER/MetaProvides::Package' version: 1.14000002 - class: Dist::Zilla::Plugin::MetaConfig name: '@Author::ETHER/MetaConfig' version: 4.300034 - class: Dist::Zilla::Plugin::ExecDir name: '@Author::ETHER/ExecDir' version: 4.300034 - class: Dist::Zilla::Plugin::ShareDir name: '@Author::ETHER/ShareDir' version: 4.300034 - class: Dist::Zilla::Plugin::Git::GatherDir name: '@Author::ETHER/Git::GatherDir' version: 2.013 - class: Dist::Zilla::Plugin::MetaYAML name: '@Author::ETHER/MetaYAML' version: 4.300034 - class: Dist::Zilla::Plugin::MetaJSON name: '@Author::ETHER/MetaJSON' version: 4.300034 - class: Dist::Zilla::Plugin::License name: '@Author::ETHER/License' version: 4.300034 - class: Dist::Zilla::Plugin::Readme name: '@Author::ETHER/Readme' version: 4.300034 - class: Dist::Zilla::Plugin::Manifest name: '@Author::ETHER/Manifest' version: 4.300034 - class: Dist::Zilla::Plugin::Test::Compile name: '@Author::ETHER/Test::Compile' version: 2.002 - class: Dist::Zilla::Plugin::Test::CheckDeps name: '@Author::ETHER/Test::CheckDeps' version: 0.006 - class: Dist::Zilla::Plugin::NoTabsTests name: '@Author::ETHER/NoTabsTests' version: 0.01 - class: Dist::Zilla::Plugin::EOLTests name: '@Author::ETHER/EOLTests' version: 0.02 - class: Dist::Zilla::Plugin::MetaTests name: '@Author::ETHER/MetaTests' version: 4.300034 - class: Dist::Zilla::Plugin::Test::Version name: '@Author::ETHER/Test::Version' version: 0.002004 - class: Dist::Zilla::Plugin::Test::CPAN::Changes name: '@Author::ETHER/Test::CPAN::Changes' version: 0.008 - class: Dist::Zilla::Plugin::Test::ChangesHasContent name: '@Author::ETHER/Test::ChangesHasContent' version: 0.006 - class: Dist::Zilla::Plugin::Test::MinimumVersion name: '@Author::ETHER/Test::MinimumVersion' version: 2.000004 - class: Dist::Zilla::Plugin::PodSyntaxTests name: '@Author::ETHER/PodSyntaxTests' version: 4.300034 - class: Dist::Zilla::Plugin::PodCoverageTests name: '@Author::ETHER/PodCoverageTests' version: 4.300034 - class: Dist::Zilla::Plugin::Test::PodSpelling name: '@Author::ETHER/Test::PodSpelling' version: 2.004003 - class: Dist::Zilla::Plugin::Test::Pod::No404s name: '@Author::ETHER/Test::Pod::No404s' version: 1.001 - class: Dist::Zilla::Plugin::PruneCruft name: '@Author::ETHER/PruneCruft' version: 4.300034 - class: Dist::Zilla::Plugin::ManifestSkip name: '@Author::ETHER/ManifestSkip' version: 4.300034 - class: Dist::Zilla::Plugin::Git::Describe name: '@Author::ETHER/Git::Describe' version: 0.002 - class: Dist::Zilla::Plugin::PkgVersion name: '@Author::ETHER/PkgVersion' version: 4.300034 - class: Dist::Zilla::Plugin::PodWeaver name: '@Author::ETHER/PodWeaver' version: 3.101641 - class: Dist::Zilla::Plugin::NextRelease name: '@Author::ETHER/NextRelease' version: 4.300034 - class: Dist::Zilla::Plugin::AutoPrereqs name: '@Author::ETHER/AutoPrereqs' version: 4.300034 - class: Dist::Zilla::Plugin::MinimumPerl name: '@Author::ETHER/MinimumPerl' version: 1.003 - class: Dist::Zilla::Plugin::Prereqs config: Dist::Zilla::Plugin::Prereqs: phase: develop type: requires name: '@Author::ETHER/Prereqs' version: 4.300034 - class: Dist::Zilla::Plugin::ReadmeAnyFromPod name: '@Author::ETHER/ReadmeAnyFromPod' version: 0.120120 - class: Dist::Zilla::Plugin::MakeMaker name: '@Author::ETHER/MakeMaker' version: 4.300034 - class: Dist::Zilla::Plugin::InstallGuide name: '@Author::ETHER/InstallGuide' version: 1.200000 - class: Dist::Zilla::Plugin::CopyFilesFromBuild name: '@Author::ETHER/CopyFilesFromBuild' version: 0.103510 - class: Dist::Zilla::Plugin::RunExtraTests name: '@Author::ETHER/RunExtraTests' version: 0.011 - class: Dist::Zilla::Plugin::Git::Check name: '@Author::ETHER/Git::Check' version: 2.013 - class: Dist::Zilla::Plugin::Git::CheckFor::MergeConflicts name: '@Author::ETHER/Git::CheckFor::MergeConflicts' version: 0.006 - class: Dist::Zilla::Plugin::Git::CheckFor::CorrectBranch name: '@Author::ETHER/Git::CheckFor::CorrectBranch' version: 0.006 - class: Dist::Zilla::Plugin::Git::Remote::Check name: '@Author::ETHER/Git::Remote::Check' version: 0.1.2 - class: Dist::Zilla::Plugin::CheckPrereqsIndexed name: '@Author::ETHER/CheckPrereqsIndexed' version: 0.008 - class: Dist::Zilla::Plugin::TestRelease name: '@Author::ETHER/TestRelease' version: 4.300034 - class: Dist::Zilla::Plugin::UploadToCPAN name: '@Author::ETHER/UploadToCPAN' version: 4.300034 - class: Dist::Zilla::Plugin::Git::Commit name: '@Author::ETHER/Git::Commit' version: 2.013 - class: Dist::Zilla::Plugin::Git::Tag name: '@Author::ETHER/Git::Tag' version: 2.013 - class: Dist::Zilla::Plugin::Git::Push name: '@Author::ETHER/Git::Push' version: 2.013 - class: Dist::Zilla::Plugin::GitHub::Update name: '@Author::ETHER/GitHub::Update' version: 0.34 - class: Dist::Zilla::Plugin::InstallRelease name: '@Author::ETHER/InstallRelease' version: 0.008 - class: Dist::Zilla::Plugin::ConfirmRelease name: '@Author::ETHER/ConfirmRelease' version: 4.300034 - class: Dist::Zilla::Plugin::Test::Kwalitee::Extra name: Test::Kwalitee::Extra version: v0.0.1 - 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:ETHER Test-Deep-UnorderedPairs-0.003/README000644 000767 000024 00000000527 12146607360 017377 0ustar00etherstaff000000 000000 This archive contains the distribution Test-Deep-UnorderedPairs, version 0.003: A Test::Deep plugin for comparing lists as if they were hashes This software is copyright (c) 2013 by Karen Etheridge. This is free software; you can redistribute it and/or modify it under the same terms as the Perl 5 programming language system itself. Test-Deep-UnorderedPairs-0.003/t/000755 000767 000024 00000000000 12146607360 016756 5ustar00etherstaff000000 000000 Test-Deep-UnorderedPairs-0.003/weaver.ini000644 000767 000024 00000000111 12146607360 020476 0ustar00etherstaff000000 000000 [@Default] [-Transformer] transformer = List [-StopWords] [-Encoding] Test-Deep-UnorderedPairs-0.003/xt/000755 000767 000024 00000000000 12146607360 017146 5ustar00etherstaff000000 000000 Test-Deep-UnorderedPairs-0.003/xt/author/000755 000767 000024 00000000000 12146607360 020450 5ustar00etherstaff000000 000000 Test-Deep-UnorderedPairs-0.003/xt/release/000755 000767 000024 00000000000 12146607360 020566 5ustar00etherstaff000000 000000 Test-Deep-UnorderedPairs-0.003/xt/release/changes_has_content.t000644 000767 000024 00000002011 12146607360 024742 0ustar00etherstaff000000 000000 #!perl use Test::More tests => 2; note 'Checking Changes'; my $changes_file = 'Changes'; my $newver = '0.003'; my $trial_token = '-TRIAL'; SKIP: { ok(-e $changes_file, "$changes_file file exists") or skip 'Changes is missing', 1; ok(_get_changes($newver), "$changes_file has content for $newver"); } done_testing; # _get_changes copied and adapted from Dist::Zilla::Plugin::Git::Commit # by Jerome Quelin sub _get_changes { my $newver = shift; # parse changelog to find commit message open(my $fh, '<', $changes_file) or die "cannot open $changes_file: $!"; my $changelog = join('', <$fh>); close $fh; my @content = grep { /^$newver(?:$trial_token)?(?:\s+|$)/ ... /^\S/ } # from newver to un-indented split /\n/, $changelog; shift @content; # drop the version line # drop unindented last line and trailing blank lines pop @content while ( @content && $content[-1] =~ /^(?:\S|\s*$)/ ); # return number of non-blank lines return scalar @content; } Test-Deep-UnorderedPairs-0.003/xt/release/cpan-changes.t000644 000767 000024 00000000263 12146607360 023303 0ustar00etherstaff000000 000000 #!perl use strict; use warnings; use Test::More 0.96 tests => 2; use_ok('Test::CPAN::Changes'); subtest 'changes_ok' => sub { changes_file_ok('Changes'); }; done_testing(); Test-Deep-UnorderedPairs-0.003/xt/release/distmeta.t000644 000767 000024 00000000217 12146607360 022565 0ustar00etherstaff000000 000000 #!perl use Test::More; eval "use Test::CPAN::Meta"; plan skip_all => "Test::CPAN::Meta required for testing META.yml" if $@; meta_yaml_ok(); Test-Deep-UnorderedPairs-0.003/xt/release/eol.t000644 000767 000024 00000000240 12146607360 021526 0ustar00etherstaff000000 000000 use strict; use warnings; use Test::More; eval 'use Test::EOL'; plan skip_all => 'Test::EOL required' if $@; all_perl_files_ok({ trailing_whitespace => 1 }); Test-Deep-UnorderedPairs-0.003/xt/release/kwalitee.t000644 000767 000024 00000000412 12146607360 022555 0ustar00etherstaff000000 000000 #!perl # This test is generated by Dist::Zilla::Plugin::Test::Kwalitee::Extra use strict; use warnings; use Test::More; # needed to provide plan. eval "use Test::Kwalitee::Extra"; plan skip_all => "Test::Kwalitee::Extra required for testing kwalitee: $@" if $@; Test-Deep-UnorderedPairs-0.003/xt/release/minimum-version.t000644 000767 000024 00000000271 12146607360 024111 0ustar00etherstaff000000 000000 #!perl use Test::More; eval "use Test::MinimumVersion"; plan skip_all => "Test::MinimumVersion required for testing minimum versions" if $@; all_minimum_version_ok( qq{5.008008} ); Test-Deep-UnorderedPairs-0.003/xt/release/no-tabs.t000644 000767 000024 00000000212 12146607360 022311 0ustar00etherstaff000000 000000 use strict; use warnings; use Test::More; eval 'use Test::NoTabs'; plan skip_all => 'Test::NoTabs required' if $@; all_perl_files_ok(); Test-Deep-UnorderedPairs-0.003/xt/release/pod-coverage.t000644 000767 000024 00000000527 12146607360 023332 0ustar00etherstaff000000 000000 #!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' }); Test-Deep-UnorderedPairs-0.003/xt/release/pod-no404s.t000644 000767 000024 00000000527 12146607360 022566 0ustar00etherstaff000000 000000 #!perl use strict; use warnings; use Test::More; foreach my $env_skip ( qw( SKIP_POD_NO404S AUTOMATED_TESTING ) ){ plan skip_all => "\$ENV{$env_skip} is set, skipping" if $ENV{$env_skip}; } eval "use Test::Pod::No404s"; if ( $@ ) { plan skip_all => 'Test::Pod::No404s required for testing POD'; } else { all_pod_files_ok(); } Test-Deep-UnorderedPairs-0.003/xt/release/pod-syntax.t000644 000767 000024 00000000212 12146607360 023054 0ustar00etherstaff000000 000000 #!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(); Test-Deep-UnorderedPairs-0.003/xt/release/test-version.t000644 000767 000024 00000000643 12146607360 023420 0ustar00etherstaff000000 000000 use strict; use warnings; use Test::More; # generated by Dist::Zilla::Plugin::Test::Version 0.002004 BEGIN { eval "use Test::Version; 1;" or die $@; } my @imports = ( 'version_all_ok' ); my $params = { is_strict => 0, has_version => 1, }; push @imports, $params if version->parse( $Test::Version::VERSION ) >= version->parse('1.002'); Test::Version->import(@imports); version_all_ok; done_testing; Test-Deep-UnorderedPairs-0.003/xt/author/pod-spell.t000644 000767 000024 00000000466 12146607360 022542 0ustar00etherstaff000000 000000 use strict; use warnings; use Test::More; # generated by Dist::Zilla::Plugin::Test::PodSpelling 2.004003 eval "use Test::Spelling 0.12; use Pod::Wordlist::hanekomu; 1" or die $@; add_stopwords(); all_pod_files_spelling_ok( qw( bin lib ) ); __DATA__ Karen Etheridge ether lib Test Deep UnorderedPairs Test-Deep-UnorderedPairs-0.003/t/00-check-deps.t000644 000767 000024 00000000247 12146607360 021371 0ustar00etherstaff000000 000000 use Test::More 0.94; use Test::CheckDeps; check_dependencies(); if (1) { BAIL_OUT("Missing dependencies") if !Test::More->builder->is_passing; } done_testing; Test-Deep-UnorderedPairs-0.003/t/00-compile.t000644 000767 000024 00000003244 12146607360 021013 0ustar00etherstaff000000 000000 #!perl use strict; use warnings; use Test::More 0.94; 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" ); } } BAIL_OUT("Compilation failures") if !Test::More->builder->is_passing; } Test-Deep-UnorderedPairs-0.003/t/01-basic.t000644 000767 000024 00000004167 12146607360 020452 0ustar00etherstaff000000 000000 use strict; use warnings FATAL => 'all'; use Test::More; use Test::Warnings; use Test::Fatal; use Test::Deep 'cmp_deeply'; use Test::Deep::UnorderedPairs; use lib 't/lib'; use Util; cmp_deeply( [ Test::Deep::UnorderedPairs::_keys_of_list([ qw(a b c d e f g h) ]) ], [ qw(a c e g) ], '_keys_of_list', ); like( exception { tuples(1) }, qr/^tuples must have an even number of elements/, 'wrong number of tuple elements', ); my @tests = ( 'wrong type - should be array' => { got => { foo => 2 }, exp => tuples(foo => 1), ok => 0, diag => qr/^Compared reftype\(\$data\)\n\s+got : 'HASH'\nexpect : 'ARRAY'\n$/, }, 'array has an odd length' => { got => [ 'foo' ], exp => tuples(foo => 1), ok => 0, diag => qr/^Compared array length of \$data\n\s+got : array with 1 element\(s\)\nexpect : array with 2 element\(s\)\n$/, }, 'key does not match' => { got => [ foo => 2 ], exp => tuples(bar => 2), ok => 0, diag => "Comparing keys of \$data\nMissing: 'bar'\nExtra: 'foo'\n", }, 'value does not match' => { got => [ foo => 2 ], exp => tuples(foo => 1), ok => 0, diag => qr/^Compared \$data->\[1\]\n\s+got : '2'\nexpect : '1'\n$/, }, 'one of the values does not match' => { got => [ bar => 2, foo => 2 ], exp => tuples(foo => 1, bar => 2), ok => 0, diag => qr/^Compared \$data->\[3\]\n\s+got : '2'\nexpect : '1'\n$/, }, 'single tuple match' => { got => [ foo => 1 ], exp => tuples(foo => 1), ok => 1, }, 'two tuples match' => { got => [ foo => 1, bar => 2 ], exp => tuples(foo => 1, bar => 2), ok => 1, }, 'unordered match', { got => [ bar => 2, foo => 1 ], exp => tuples(foo => 1, bar => 2), ok => 1, }, ); while (my ($test_name, $test) = (shift(@tests), shift(@tests))) { last if not $test_name; subtest $test_name => test_plugin(@{$test}{qw(got exp ok diag)}); BAIL_OUT('oops') if not Test::Builder->new->is_passing; } done_testing; Test-Deep-UnorderedPairs-0.003/t/02-repeated-keys.t000644 000767 000024 00000002327 12146607360 022130 0ustar00etherstaff000000 000000 use strict; use warnings FATAL => 'all'; use Test::More; use Test::Warnings; use Test::Deep::UnorderedPairs; use lib 't/lib'; use Util; my @tests = ( 'repeated key, missing a key' => { got => [ foo => 1, foo => 2 ], exp => tuples(foo => 2, bar => 1), ok => 0, diag => "Comparing keys of \$data\nMissing: 'bar'\nExtra: 'foo'\n", }, 'repeated key, extra key' => { got => [ foo => 1, bar => 2 ], exp => tuples(bar => 2, bar => 1), ok => 0, diag => "Comparing keys of \$data\nMissing: 'bar'\nExtra: 'foo'\n", }, 'repeated key, keys ok, value wrong' => { got => [ foo => 1, foo => 3, bar => 3 ], exp => tuples(bar => 3, foo => 1, foo => 2), ok => 0, diag => qr/^Compared \$data->\[3\]\n\s+got : '3'\nexpect : '2'\n$/, }, 'repeated key ok' => { got => [ foo => 1, foo => 2, bar => 3 ], exp => tuples(bar => 3, foo => 1, foo => 2), ok => 1, }, ); while (my ($test_name, $test) = (shift(@tests), shift(@tests))) { last if not $test_name; subtest $test_name => test_plugin(@{$test}{qw(got exp ok diag)}); BAIL_OUT('oops') if not Test::Builder->new->is_passing; } done_testing; Test-Deep-UnorderedPairs-0.003/t/lib/000755 000767 000024 00000000000 12146607360 017524 5ustar00etherstaff000000 000000 Test-Deep-UnorderedPairs-0.003/t/lib/Util.pm000644 000767 000024 00000001566 12146607360 021007 0ustar00etherstaff000000 000000 use strict; use warnings FATAL => 'all'; use Test::Deep qw(cmp_details deep_diag); sub test_plugin { # got and exp to use in test; # expecting an ok? # expected diag, if not ok my ($data_got, $data_exp, $exp_ok, $exp_diag) = @_; return sub { my ($ok, $stack) = cmp_details($data_got, $data_exp); ok( !($ok xor $exp_ok), 'test ' . ($exp_ok ? 'passed' : 'failed')); return if not Test::Builder->new->is_passing; if (not $ok) { my $diag = deep_diag($stack); if (__is_regexp($exp_diag)) { like($diag, $exp_diag, 'failure diagnostics'); } else { is($diag, $exp_diag, 'failure diagnostics'); } } }; } sub __is_regexp { re->can('is_regexp') ? re::is_regexp(shift) : ref(shift) eq 'Regexp'; } 1; Test-Deep-UnorderedPairs-0.003/lib/Test/000755 000767 000024 00000000000 12146607360 020200 5ustar00etherstaff000000 000000 Test-Deep-UnorderedPairs-0.003/lib/Test/Deep/000755 000767 000024 00000000000 12146607360 021055 5ustar00etherstaff000000 000000 Test-Deep-UnorderedPairs-0.003/lib/Test/Deep/UnorderedPairs.pm000644 000767 000024 00000015010 12146607360 024336 0ustar00etherstaff000000 000000 use strict; use warnings; package Test::Deep::UnorderedPairs; { $Test::Deep::UnorderedPairs::VERSION = '0.003'; } # git description: v0.002-3-g11fa25b BEGIN { $Test::Deep::UnorderedPairs::AUTHORITY = 'cpan:ETHER'; } # ABSTRACT: A Test::Deep plugin for comparing lists as if they were hashes use parent 'Test::Deep::Cmp'; use Exporter 'import'; use Carp 'confess'; use Test::Deep::Hash; use Test::Deep::ArrayLength; # I'm not sure what name is best; decide later our @EXPORT = qw(tuples unordered_pairs samehash); sub tuples { return __PACKAGE__->new(@_); } sub unordered_pairs { goto &tuples } sub samehash { goto &tuples } sub init { my ($self, @vals) = @_; confess 'tuples must have an even number of elements' if @vals % 2; $self->{val} = \@vals; } sub descend { my ($self, $got) = @_; my $exp = $self->{val}; return 0 unless Test::Deep::ArrayLength->new(@$exp + 0)->descend($got); # check that all the keys are present -- can test as a bag my @exp_keys = _keys_of_list($exp); my @got_keys = _keys_of_list($got); return 0 unless Test::Deep::descend(\@got_keys, Test::Deep::UnorderedPairKeys->new(@exp_keys)); Test::Deep::descend($got, Test::Deep::UnorderedPairElements->new($exp)); } sub _keys_of_list { my $list = shift; my $i = 0; map { $i++ % 2 ? () : $_ } @$list; } package Test::Deep::UnorderedPairKeys; { $Test::Deep::UnorderedPairKeys::VERSION = '0.003'; } # git description: v0.002-3-g11fa25b BEGIN { $Test::Deep::UnorderedPairKeys::AUTHORITY = 'cpan:ETHER'; } use parent 'Test::Deep::Set'; sub init { # quack like a bag shift->SUPER::init(0, '', @_); } sub diagnostics { my ($self, $where, $last) = @_; my $error = $last->{diag}; my $diag = <{val} = $val; } # we assume the keys are already verified as identical. sub descend { my ($self, $got) = @_; # make copy, as we are going to modify this one! my @exp = @{$self->{val}}; my $data = $self->data; GOT_KEY: for (my $got_index = 0; $got_index < @$got; $got_index += 1) { # find the first occurrence of $key in @exp EXP_KEY: for (my $exp_index = 0; $exp_index < @exp; $exp_index += 1) { if (not Test::Deep::eq_deeply_cache($got->[$got_index], $exp[$exp_index])) { # advance to the next key position ++$exp_index; next; } # found a matching key in got and exp $data->{got_index} = ++$got_index; $data->{exp_value} = $exp[++$exp_index]; if (Test::Deep::eq_deeply_cache($got->[$got_index], $data->{exp_value})) { # splice this out of the exp list and continue with the next key splice(@exp, $exp_index - 1, 2); next GOT_KEY; } # values do not match - keep looking for another match unless there are no more! } # got to the end of exp_keys, but still no matches found return 0; } # exhausted all got_keys. if everything matched, @exp would be empty return @exp ? 0 : 1; } sub render_stack { my ($self, $var, $data) = @_; $var .= "->" unless $Test::Deep::Stack->incArrow; $var .= '[' . $data->{got_index} . ']'; return $var; } sub reset_arrow { return 0; } sub renderGot { my ($self, $got) = @_; return $self->SUPER::renderGot($got->[$self->data->{got_index}]); } sub renderExp { my $self = shift; return $self->SUPER::renderGot($self->data->{exp_value}); } 1; __END__ =pod =encoding utf-8 =for :stopwords Karen Etheridge tuples irc =head1 NAME Test::Deep::UnorderedPairs - A Test::Deep plugin for comparing lists as if they were hashes =head1 VERSION version 0.003 =head1 SYNOPSIS use Test::More; use Test::Deep; use Test::Deep::UnorderedPairs; cmp_deeply( { inventory => [ pear => 6, peach => 5, apple => 1, ], }, { inventory => unordered_pairs( apple => 1, peach => ignore, pear => 6, ), }, 'got the right inventory', ); =head1 DESCRIPTION This module provides the sub C (and C, C, as synonyms) to indicate the data being tested is a list of pairs that should be tested where the order of the pairs is insignificant. This is useful when testing a function that returns a list of hash elements as an arrayref, not a hashref. One such application might be testing L headers, which are passed around as an arrayref: my $response = [ '200', [ 'Content-Length' => '12', 'Content-Type' => 'text/plain', ], [ 'hello world!' ], ]; # this test passes cmp_deeply( $response, [ '200', unordered_pairs( 'Content-Type' => 'text/plain', 'Content-Length' => '12', ], [ 'hello world!' ], ], 'check headers as an arrayref of unordered pairs', ); =head1 FUNCTIONS/METHODS =for Pod::Coverage init descend =over =item * C Pass an (even-numbered) list of items to test =item * C, C C and C are aliases for C. I'm open to more names as well; I'm not quite yet sure what the best nomenclature should be. =back =head1 SUPPORT Bugs may be submitted through L (or L). I am also usually active on irc, as 'ether' at C. =head1 ACKNOWLEDGEMENTS Ricardo Signes, for maintaining L and for being the first consumer of this module, in L. =head1 SEE ALSO L =head1 AUTHOR Karen Etheridge =head1 COPYRIGHT AND LICENSE This software is copyright (c) 2013 by Karen Etheridge. 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 Test-Deep-UnorderedPairs-0.003/examples/synopsis.t000644 000767 000024 00000000674 12146607360 022414 0ustar00etherstaff000000 000000 use strict; use warnings FATAL => 'all'; use Test::More; use Test::Warnings; use Test::Deep; use Test::Deep::UnorderedPairs; cmp_deeply( { inventory => [ pear => 6, peach => 5, apple => 1, ], }, { inventory => unordered_pairs( apple => 1, peach => ignore, pear => 6, ), }, 'got the right inventory', ); done_testing;