CONTRIBUTING000664001750001750 614612355063462 14553 0ustar00taitai000000000000match-simple-0.009NAME CONTRIBUTING DESCRIPTION If you're reading this document, that means you might be thinking about helping me out with this project. Thanks! Here's some ways you could help out: * Bug reports Found a bug? Great! (Well, not so great I suppose.) The place to report them is . Don't e-mail me about it, as your e-mail is more than likely to get lost amongst the spam. An example script clearly demonstrating the bug (preferably written using Test::More) would be greatly appreciated. * Patches If you've found a bug and written a fix for it, even better! Generally speaking you should check out the latest copy of the code from the source repository rather than using the CPAN distribution. The file META.yml should contain a link to the source repository. If not, then try or submit a bug report. (As far as I'm concerned the lack of a link is a bug.) Many of my distributions are also mirrored at . To submit the patch, do a pull request on GitHub or Bitbucket, or attach a diff file to a bug report. Unless otherwise stated, I'll assume that your contributions are licensed under the same terms as the rest of the project. (If using git, feel free to work in a branch. For Mercurial, I'd prefer bookmarks within the default branch.) * Documentation If there's anything unclear in the documentation, please submit this as a bug report or patch as above. Non-toy example scripts that I can bundle would also be appreciated. * Translation Translations of documentation would be welcome. For translations of error messages and other strings embedded in the code, check with me first. Sometimes the English strings may not in a stable state, so it would be a waste of time translating them. Coding Style I tend to write using something approximating the Allman style, using tabs for indentation and Unix-style line breaks. * * I nominally encode all source files as UTF-8, though in practice most of them use a 7-bit-safe ASCII-compatible subset of UTF-8. AUTHOR Toby Inkster . COPYRIGHT AND LICENCE Copyright (c) 2012-2014 by Toby Inkster. CONTRIBUTING is available under three different licences permitting its redistribution: the CC-BY-SA_UK-2.0 licence, plus the same licences as Perl itself, which is distributed under the GNU General Public Licence version 1, and the Artistic Licence. This file is licensed under the Creative Commons Attribution-ShareAlike 2.0 UK: England & Wales License. To view a copy of this license, visit . This file is free software; you can redistribute it and/or modify it under the same terms as the Perl 5 programming language system itself. COPYRIGHT000664001750001750 215712355063462 14212 0ustar00taitai000000000000match-simple-0.009Format: http://www.debian.org/doc/packaging-manuals/copyright-format/1.0/ Upstream-Name: match-simple Upstream-Contact: Toby Inkster (TOBYINK) Source: https://metacpan.org/release/match-simple Files: README lib/match/simple.pm lib/match/smart.pm t/01basic.t t/02simple.t Copyright: This software is copyright (c) 2013-2014 by Toby Inkster. License: GPL-1.0+ or Artistic-1.0 Files: Changes META.json META.yml doap.ttl Copyright: Copyright 2014 Toby Inkster. License: GPL-1.0+ or Artistic-1.0 Files: CONTRIBUTING INSTALL LICENSE Copyright: Unknown License: Unknown Files: COPYRIGHT CREDITS SIGNATURE Copyright: None License: public-domain Files: Makefile.PL dist.ini t/03smart.t Copyright: Copyright 2013 Toby Inkster. License: GPL-1.0+ or Artistic-1.0 License: Artistic-1.0 This software is Copyright (c) 2014 by the copyright holder(s). This is free software, licensed under: The Artistic License 1.0 License: GPL-1.0 This software is Copyright (c) 2014 by the copyright holder(s). This is free software, licensed under: The GNU General Public License, Version 1, February 1989 CREDITS000664001750001750 7112355063457 13674 0ustar00taitai000000000000match-simple-0.009Maintainer: - Toby Inkster (TOBYINK) Changes000664001750001750 240712355063457 14214 0ustar00taitai000000000000match-simple-0.009match-simple ============ Created: 2013-05-19 Home page: Bug tracker: Maintainer: Toby Inkster (TOBYINK) 0.009 2014-07-02 - Backport to Perl 5.6. - Don't load Sub::Infix unless needed. 0.008 2014-03-03 [ Packaging ] - Bump recommended version of match::simple::XS to 0.001. [ Other ] - Don't use match::simple::XS if it's too old, or is unstable. 0.007_03 2014-03-02 [ Test Suite ] - Don't do `no overloading` on Perl < 5.10.1 in test cases. 0.007_02 2014-03-02 [ Test Suite ] - Improved match::simple test cases. 0.007_01 2014-02-21 - Use match::simple::XS if it's installed. 0.006 2013-09-29 [ Packaging ] - Fix dependencies. 0.005 2013-09-28 [ Packaging ] - use Dist::Inkt [ Other ] - Updated: use Exporter::Tiny 0.004 2013-05-20 [ Bug Fixes ] - Further fix smartmatch test cases on archaic Perl. 0.003 2013-05-20 [ Bug Fixes ] - Fix smartmatch test cases on archaic Perl. 0.002 2013-05-20 [ Bug Fixes ] - Better parity with Perl's smartmatch operator. - Proper checks for overloaded ~~. [ Packaging ] - Bundle tests based on Perl's tests for the smartmatch operator. 0.001 2013-05-19 Initial release INSTALL000664001750001750 167212355063456 13754 0ustar00taitai000000000000match-simple-0.009 Installing match-simple should be straightforward. INSTALLATION WITH CPANMINUS If you have cpanm, you only need one line: % cpanm match::simple 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 match::simple INSTALLATION WITH THE CPAN SHELL Alternatively, if your CPAN shell is set up, you should just be able to do: % cpan match::simple MANUAL INSTALLATION As a last resort, you can manually install it. Download the tarball and unpack it. Consult the file META.json for a list of pre-requisites. Install these first. To build match-simple: % 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 LICENSE000664001750001750 4365512355063456 13757 0ustar00taitai000000000000match-simple-0.009This software is copyright (c) 2014 by Toby Inkster. 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) 2014 by Toby Inkster. 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) 2014 by Toby Inkster. 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 MANIFEST000664001750001750 31612355063462 14023 0ustar00taitai000000000000match-simple-0.009CONTRIBUTING COPYRIGHT CREDITS Changes INSTALL LICENSE MANIFEST META.json META.yml Makefile.PL README SIGNATURE dist.ini doap.ttl lib/match/simple.pm lib/match/smart.pm t/01basic.t t/02simple.t t/03smart.t META.json000664001750001750 374712355063462 14346 0ustar00taitai000000000000match-simple-0.009{ "abstract" : "simplified clone of smartmatch operator", "author" : [ "Toby Inkster (TOBYINK) " ], "dynamic_config" : 0, "generated_by" : "Dist::Inkt::Profile::TOBYINK version 0.016, CPAN::Meta::Converter version 2.140640", "keywords" : [], "license" : [ "perl_5" ], "meta-spec" : { "url" : "http://search.cpan.org/perldoc?CPAN::Meta::Spec", "version" : "2" }, "name" : "match-simple", "no_index" : { "directory" : [ "eg", "examples", "inc", "t", "xt" ] }, "optional_features" : {}, "prereqs" : { "configure" : { "requires" : { "ExtUtils::MakeMaker" : "6.17" } }, "runtime" : { "recommends" : { "match::simple::XS" : "0.001" }, "requires" : { "Exporter::Tiny" : "0.026", "List::Util" : "1.33", "Scalar::Util" : "0", "Sub::Infix" : "0.004", "perl" : "5.006001" } }, "test" : { "requires" : { "Test::Fatal" : "0", "Test::More" : "0.96" } } }, "provides" : { "match::simple" : { "file" : "lib/match/simple.pm", "version" : "0.009" }, "match::smart" : { "file" : "lib/match/smart.pm", "version" : "0.009" } }, "release_status" : "stable", "resources" : { "X_identifier" : "http://purl.org/NET/cpan-uri/dist/match-simple/project", "bugtracker" : { "web" : "http://rt.cpan.org/Dist/Display.html?Queue=match-simple" }, "homepage" : "https://metacpan.org/release/match-simple", "license" : [ "http://dev.perl.org/licenses/" ], "repository" : { "type" : "git", "url" : "git://github.com/tobyink/p5-match-simple.git", "web" : "https://github.com/tobyink/p5-match-simple" } }, "version" : "0.009" } META.yml000664001750001750 225212355063462 14164 0ustar00taitai000000000000match-simple-0.009--- abstract: 'simplified clone of smartmatch operator' author: - 'Toby Inkster (TOBYINK) ' build_requires: Test::Fatal: '0' Test::More: '0.96' configure_requires: ExtUtils::MakeMaker: '6.17' dynamic_config: 0 generated_by: 'Dist::Inkt::Profile::TOBYINK version 0.016, CPAN::Meta::Converter version 2.140640' keywords: [] license: perl meta-spec: url: http://module-build.sourceforge.net/META-spec-v1.4.html version: '1.4' name: match-simple no_index: directory: - eg - examples - inc - t - xt optional_features: {} provides: match::simple: file: lib/match/simple.pm version: '0.009' match::smart: file: lib/match/smart.pm version: '0.009' recommends: match::simple::XS: '0.001' requires: Exporter::Tiny: '0.026' List::Util: '1.33' Scalar::Util: '0' Sub::Infix: '0.004' perl: '5.006001' resources: X_identifier: http://purl.org/NET/cpan-uri/dist/match-simple/project bugtracker: http://rt.cpan.org/Dist/Display.html?Queue=match-simple homepage: https://metacpan.org/release/match-simple license: http://dev.perl.org/licenses/ repository: git://github.com/tobyink/p5-match-simple.git version: '0.009' Makefile.PL000664001750001750 1236212355063462 14710 0ustar00taitai000000000000match-simple-0.009use strict; use ExtUtils::MakeMaker 6.17; my $EUMM = eval( $ExtUtils::MakeMaker::VERSION ); my $meta = { "abstract" => "simplified clone of smartmatch operator", "author" => ["Toby Inkster (TOBYINK) "], "dynamic_config" => 0, "generated_by" => "Dist::Inkt::Profile::TOBYINK version 0.016, CPAN::Meta::Converter version 2.140640", "keywords" => [], "license" => ["perl_5"], "meta-spec" => { url => "http://search.cpan.org/perldoc?CPAN::Meta::Spec", version => 2, }, "name" => "match-simple", "no_index" => { directory => ["eg", "examples", "inc", "t", "xt"] }, "prereqs" => { configure => { requires => { "ExtUtils::MakeMaker" => 6.17 } }, runtime => { recommends => { "match::simple::XS" => 0.001 }, requires => { "Exporter::Tiny" => 0.026, "List::Util" => 1.33, "perl" => 5.006001, "Scalar::Util" => 0, "Sub::Infix" => 0.004, }, }, test => { requires => { "Test::Fatal" => 0, "Test::More" => 0.96 } }, }, "provides" => { "match::simple" => { file => "lib/match/simple.pm", version => 0.009 }, "match::smart" => { file => "lib/match/smart.pm", version => 0.009 }, }, "release_status" => "stable", "resources" => { bugtracker => { web => "http://rt.cpan.org/Dist/Display.html?Queue=match-simple", }, homepage => "https://metacpan.org/release/match-simple", license => ["http://dev.perl.org/licenses/"], repository => { type => "git", url => "git://github.com/tobyink/p5-match-simple.git", web => "https://github.com/tobyink/p5-match-simple", }, X_identifier => "http://purl.org/NET/cpan-uri/dist/match-simple/project", }, "version" => 0.009, }; my %dynamic_config; my %WriteMakefileArgs = ( ABSTRACT => $meta->{abstract}, AUTHOR => ($EUMM >= 6.5702 ? $meta->{author} : $meta->{author}[0]), DISTNAME => $meta->{name}, VERSION => $meta->{version}, EXE_FILES => [ map $_->{file}, values %{ $meta->{x_provides_scripts} || {} } ], NAME => do { my $n = $meta->{name}; $n =~ s/-/::/g; $n }, test => { TESTS => "t/*.t" }, %dynamic_config, ); $WriteMakefileArgs{LICENSE} = $meta->{license}[0] if $EUMM >= 6.3001; sub deps { my %r; for my $stage (@_) { for my $dep (keys %{$meta->{prereqs}{$stage}{requires}}) { next if $dep eq 'perl'; my $ver = $meta->{prereqs}{$stage}{requires}{$dep}; $r{$dep} = $ver if !exists($r{$dep}) || $ver >= $r{$dep}; } } \%r; } my ($build_requires, $configure_requires, $runtime_requires, $test_requires); if ($EUMM >= 6.6303) { $WriteMakefileArgs{BUILD_REQUIRES} ||= deps('build'); $WriteMakefileArgs{CONFIGURE_REQUIRES} ||= deps('configure'); $WriteMakefileArgs{TEST_REQUIRES} ||= deps('test'); $WriteMakefileArgs{PREREQ_PM} ||= deps('runtime'); } elsif ($EUMM >= 6.5503) { $WriteMakefileArgs{BUILD_REQUIRES} ||= deps('build', 'test'); $WriteMakefileArgs{CONFIGURE_REQUIRES} ||= deps('configure'); $WriteMakefileArgs{PREREQ_PM} ||= deps('runtime'); } elsif ($EUMM >= 6.52) { $WriteMakefileArgs{CONFIGURE_REQUIRES} ||= deps('configure'); $WriteMakefileArgs{PREREQ_PM} ||= deps('runtime', 'build', 'test'); } else { $WriteMakefileArgs{PREREQ_PM} ||= deps('configure', 'build', 'test', 'runtime'); } { my ($minperl) = reverse sort( grep defined && /^[0-9]+(\.[0-9]+)?$/, map $meta->{prereqs}{$_}{requires}{perl}, qw( configure build runtime ) ); if (defined($minperl)) { die "Installing $meta->{name} requires Perl >= $minperl" unless $] >= $minperl; $WriteMakefileArgs{MIN_PERL_VERSION} ||= $minperl if $EUMM >= 6.48; } } sub FixMakefile { return unless -d 'inc'; my $file = shift; local *MAKEFILE; open MAKEFILE, "< $file" or die "FixMakefile: Couldn't open $file: $!; bailing out"; my $makefile = do { local $/; }; close MAKEFILE or die $!; $makefile =~ s/\b(test_harness\(\$\(TEST_VERBOSE\), )/$1'inc', /; $makefile =~ s/( -I\$\(INST_ARCHLIB\))/ -Iinc$1/g; $makefile =~ s/( "-I\$\(INST_LIB\)")/ "-Iinc"$1/g; $makefile =~ s/^(FULLPERL = .*)/$1 "-Iinc"/m; $makefile =~ s/^(PERL = .*)/$1 "-Iinc"/m; open MAKEFILE, "> $file" or die "FixMakefile: Couldn't open $file: $!; bailing out"; print MAKEFILE $makefile or die $!; close MAKEFILE or die $!; } my $mm = WriteMakefile(%WriteMakefileArgs); FixMakefile($mm->{FIRST_MAKEFILE} || 'Makefile'); exit(0); README000664001750001750 670112355063456 13601 0ustar00taitai000000000000match-simple-0.009NAME match::simple - simplified clone of smartmatch operator SYNOPSIS use v5.10; use match::simple; if ($this |M| $that) { say "$this matches $that"; } DESCRIPTION match::simple provides a simple match operator `|M|` that acts like a sane subset of the (as of Perl 5.18) deprecated smart match operator. Unlike smart match, the behaviour of the match is determined entirely by the operand on the right hand side. * If the right hand side is `undef`, then there is only a match if the left hand side is also `undef`. * If the right hand side is a non-reference, then the match is a simple string match. * If the right hand side is a reference to a regexp, then the left hand is evaluated . * If the right hand side is a code reference, then it is called in a boolean context with the left hand side being passed as an argument. * If the right hand side is an object which provides a `MATCH` method, then it this is called as a method, with the left hand side being passed as an argument. * If the right hand side is an object which overloads `~~`, then a true smart match is performed. * If the right hand side is an arrayref, then the operator recurses into the array, with the match succeeding if the left hand side matches any array element. * If any other value appears on the right hand side, the operator will croak. If you don't like the crazy Sub::Infix operator, you can alternatively export a more normal function: use v5.10; use match::simple qw(match); if (match($this, $that)) { say "$this matches $that"; } If you're making heavy use of this module, then this is probably your best option, as it runs significantly faster. XS Backend If you install match::simple::XS, a faster XS-based implementation will be used instead of the pure Perl functions. Depending on what sort of match you are doing, this is likely to be several times faster. In extreme cases, such as matching a string in an arrayref, it can be twenty-five times faster, or more. However, where $that is a single regexp, it's around 30% slower. Overall though, I think the performance improvement is worthwhile. If you want to take advantage of this speed up, use the `match` function rather than the `|M|` operator. Otherwise all your gains will be lost to the slow implementation of operator overloading. The constant `match::simple::IMPLEMENTATION` tells you which backend is currently in use. Environment Setting the `MATCH_SIMPLE_IMPLEMENTATION` environment variable to "PP" encourages match::simple to use the pure Perl backend. BUGS Please report any bugs to . SEE ALSO match::smart. This module uses Exporter::Tiny. AUTHOR Toby Inkster . COPYRIGHT AND LICENCE This software is copyright (c) 2013-2014 by Toby Inkster. This is free software; you can redistribute it and/or modify it under the same terms as the Perl 5 programming language system itself. DISCLAIMER OF WARRANTIES 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. SIGNATURE000664001750001750 331312355063463 14177 0ustar00taitai000000000000match-simple-0.009This file contains message digests of all files listed in MANIFEST, signed via the Module::Signature module, version 0.73. To verify the content in this distribution, first make sure you have Module::Signature installed, then type: % cpansign -v It will check each file's integrity, as well as the signature's validity. If "==> Signature verified OK! <==" is not displayed, the distribution may already have been compromised, and you should not run its Makefile.PL or Build.PL. -----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 SHA1 33317486c4fa2cf7fec85bf92ed38ac0f64233a0 CONTRIBUTING SHA1 2e58329535fd0e345b7cd188407765dc003f40a9 COPYRIGHT SHA1 6bd7b17d81be63d08d4efa6cb80106e72887842c CREDITS SHA1 30ccf99c8074c484bbb917e67896598df66dee29 Changes SHA1 cf56621f25c90554eb5dd2d6c68ecbf439ddaa86 INSTALL SHA1 34f5e12514b91055de4b164a1f2327ef5c30ba53 LICENSE SHA1 d594f777d4b3972664d9bad8e6c11c0fe599bacf MANIFEST SHA1 cfdeed8a7418d11d7cda1f7d3a9b7b672a634492 META.json SHA1 e14cddedb309e7e178ccaac4160af6434fb1b1ca META.yml SHA1 069e0eb8198bd8c73176cfcf3f0d10defcf83b78 Makefile.PL SHA1 e06cc78ffca32fbab1dfe0b780fee745391393f5 README SHA1 c8f010a51d0e82e81c245238720050448b25532c dist.ini SHA1 84b5f744f842c629f3187ebea5e68b5155e97e01 doap.ttl SHA1 36eaae00a3ae46eef034a0b96c42548f5676c56e lib/match/simple.pm SHA1 cf8f553747f99729d6b713affb3aa783aa544f04 lib/match/smart.pm SHA1 b7323f591df2e43413a77c8c3e7c1bd6aec5d721 t/01basic.t SHA1 ba4c6fd94f9f1ce63eb57923f4a4423c640e83e3 t/02simple.t SHA1 85f739bca334a4f4892f02a94afd59ae3edea428 t/03smart.t -----BEGIN PGP SIGNATURE----- Version: GnuPG v1 iEYEARECAAYFAlO0ZzMACgkQzr+BKGoqfTnBngCfeCq7apbS031VDia0KJWaGkBI rWUAn1M5sPJnQc93QW4AA6rxdauT0ZMz =Ek8v -----END PGP SIGNATURE----- dist.ini000664001750001750 10312355063456 14333 0ustar00taitai000000000000match-simple-0.009;; class = 'Dist::Inkt::Profile::TOBYINK' ;; name = 'match-simple' doap.ttl000664001750001750 2245312355063462 14410 0ustar00taitai000000000000match-simple-0.009@prefix cpan-uri: . @prefix dc: . @prefix doap: . @prefix doap-changeset: . @prefix doap-deps: . @prefix foaf: . @prefix rdfs: . @prefix xsd: . dc:title "the same terms as the perl 5 programming language system itself". a doap:Project; dc:contributor ; doap-deps:runtime-recommendation [ doap-deps:on "match::simple::XS 0.001"^^doap-deps:CpanId; ]; doap-deps:runtime-requirement [ doap-deps:on "Exporter::Tiny 0.026"^^doap-deps:CpanId; ], [ doap-deps:on "List::Util 1.33"^^doap-deps:CpanId ], [ doap-deps:on "Scalar::Util"^^doap-deps:CpanId ], [ doap-deps:on "perl 5.006001"^^doap-deps:CpanId ], [ doap-deps:on "Sub::Infix 0.004"^^doap-deps:CpanId ]; doap-deps:test-requirement [ doap-deps:on "Test::More 0.96"^^doap-deps:CpanId ], [ doap-deps:on "Test::Fatal"^^doap-deps:CpanId ]; doap:bug-database ; doap:created "2013-05-19"^^xsd:date; doap:developer ; doap:download-page ; doap:homepage ; doap:license ; doap:maintainer ; doap:name "match-simple"; doap:programming-language "Perl"; doap:release , , , , , , , , , , ; doap:repository [ a doap:GitRepository; doap:browse ; ]; doap:shortdesc "simplified clone of smartmatch operator". a doap:Version; rdfs:label "Initial release"; dc:identifier "match-simple-0.001"^^xsd:string; dc:issued "2013-05-19"^^xsd:date; doap-changeset:released-by ; doap:file-release ; doap:revision "0.001"^^xsd:string. a doap:Version; dc:identifier "match-simple-0.002"^^xsd:string; dc:issued "2013-05-20"^^xsd:date; doap-changeset:changeset [ doap-changeset:item [ a doap-changeset:Packaging; rdfs:label "Bundle tests based on Perl's tests for the smartmatch operator."; ], [ a doap-changeset:Bugfix; rdfs:label "Proper checks for overloaded ~~."; ], [ a doap-changeset:Bugfix; rdfs:label "Better parity with Perl's smartmatch operator."; ]; ]; doap-changeset:released-by ; doap:file-release ; doap:revision "0.002"^^xsd:string. a doap:Version; dc:identifier "match-simple-0.003"^^xsd:string; dc:issued "2013-05-20"^^xsd:date; doap-changeset:changeset [ doap-changeset:item [ a doap-changeset:Bugfix; rdfs:label "Fix smartmatch test cases on archaic Perl."; ]; ]; doap-changeset:released-by ; doap:file-release ; doap:revision "0.003"^^xsd:string. a doap:Version; dc:identifier "match-simple-0.004"^^xsd:string; dc:issued "2013-05-20"^^xsd:date; doap-changeset:changeset [ doap-changeset:item [ a doap-changeset:Bugfix; rdfs:label "Further fix smartmatch test cases on archaic Perl."; ]; ]; doap-changeset:released-by ; doap:file-release ; doap:revision "0.004"^^xsd:string. a doap:Version; dc:identifier "match-simple-0.005"^^xsd:string; dc:issued "2013-09-28"^^xsd:date; doap-changeset:changeset [ doap-changeset:item [ a doap-changeset:Packaging; rdfs:label "use Dist::Inkt"; ], [ a doap-changeset:Update; rdfs:label "use Exporter::Tiny"; ]; ]; doap-changeset:released-by ; doap:file-release ; doap:revision "0.005"^^xsd:string. a doap:Version; dc:identifier "match-simple-0.006"^^xsd:string; dc:issued "2013-09-29"^^xsd:date; doap-changeset:changeset [ doap-changeset:item [ a doap-changeset:Packaging; rdfs:label "Fix dependencies."; ]; ]; doap-changeset:released-by ; doap:file-release ; doap:revision "0.006"^^xsd:string. a cpan-uri:DeveloperRelease, doap:Version; dc:identifier "match-simple-0.007_01"^^xsd:string; dc:issued "2014-02-21"^^xsd:date; doap-changeset:changeset [ doap-changeset:item [ a doap-changeset:Change; rdfs:label "Use match::simple::XS if it's installed."; ]; ]; doap-changeset:released-by ; doap:file-release ; doap:revision "0.007_01"^^xsd:string. a cpan-uri:DeveloperRelease, doap:Version; dc:identifier "match-simple-0.007_02"^^xsd:string; dc:issued "2014-03-02"^^xsd:date; doap-changeset:changeset [ doap-changeset:item [ a doap-changeset:Tests; rdfs:label "Improved match::simple test cases."; ]; ]; doap-changeset:released-by ; doap:file-release ; doap:revision "0.007_02"^^xsd:string. a cpan-uri:DeveloperRelease, doap:Version; dc:identifier "match-simple-0.007_03"^^xsd:string; dc:issued "2014-03-02"^^xsd:date; doap-changeset:changeset [ doap-changeset:item [ a doap-changeset:Tests; rdfs:label "Don't do `no overloading` on Perl < 5.10.1 in test cases."; ]; ]; doap-changeset:released-by ; doap:file-release ; doap:revision "0.007_03"^^xsd:string. a doap:Version; dc:identifier "match-simple-0.008"^^xsd:string; dc:issued "2014-03-03"^^xsd:date; doap-changeset:changeset [ doap-changeset:item [ a doap-changeset:Packaging; rdfs:label "Bump recommended version of match::simple::XS to 0.001."; ], [ a doap-changeset:Change; rdfs:label "Don't use match::simple::XS if it's too old, or is unstable."; ]; ]; doap-changeset:released-by ; doap:file-release ; doap:revision "0.008"^^xsd:string. a doap:Version; dc:identifier "match-simple-0.009"^^xsd:string; dc:issued "2014-07-02"^^xsd:date; doap-changeset:changeset [ doap-changeset:item [ a doap-changeset:Change; rdfs:label "Don't load Sub::Infix unless needed."; ], [ a doap-changeset:Change; rdfs:label "Backport to Perl 5.6."; ]; ]; doap-changeset:released-by ; doap:file-release ; doap:revision "0.009"^^xsd:string. a foaf:Person; foaf:mbox ; foaf:name "Toby Inkster"; foaf:nick "TOBYINK"; foaf:page . 01basic.t000664001750001750 74712355063456 14557 0ustar00taitai000000000000match-simple-0.009/t=pod =encoding utf-8 =head1 PURPOSE Test that match::simple and match::smart compile. =head1 AUTHOR Toby Inkster Etobyink@cpan.orgE. =head1 COPYRIGHT AND LICENCE This software is copyright (c) 2013-2014 by Toby Inkster. 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 use strict; use warnings; use Test::More; use_ok('match::simple'); use_ok('match::smart'); done_testing; 02simple.t000664001750001750 623412355063456 15005 0ustar00taitai000000000000match-simple-0.009/t=pod =encoding utf-8 =head1 PURPOSE Test that match::simple works. =head1 AUTHOR Toby Inkster Etobyink@cpan.orgE. =head1 COPYRIGHT AND LICENCE This software is copyright (c) 2013-2014 by Toby Inkster. 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 use strict; use warnings; use Test::More; use Test::Fatal; use match::simple; diag(sprintf('implementation: %s', match::simple::IMPLEMENTATION)); my $obj = do { package Local::SomeClass; use overload q[""] => sub { q(XXX) }, fallback => 1; bless []; }; sub does_match { my ($a, $b, $name) = @_; my ($as, $bs) = map do { no if ($] >= 5.010001), 'overloading'; ref($_) ? qq[$_] : defined($_) ? qq["$_"] : q[undef]; }, @_; $name ||= "$as matches $bs"; ok( $a |M| $b, $name, ); } sub doesnt_match { my ($a, $b, $name) = @_; my ($as, $bs) = map do { no if ($] >= 5.010001), 'overloading'; ref($_) ? qq[$_] : defined($_) ? qq["$_"] : q[undef]; }, @_; $name ||= "$as NOT matches $bs"; ok( !($a |M| $b), $name, ); } # If the right hand side is "undef", then there is only a match if # the left hand side is also "undef". does_match(undef, undef); doesnt_match($_, undef) for 0, 1, q(), q(XXX), [], {}, sub {}, $obj; # If the right hand side is a non-reference, then the match is a # simple string match. does_match(q(xxx), q(xxx)); doesnt_match($_, q(xxx)) for 0, 1, q(), q(XXX), [], {}, sub {}, $obj; # If the right hand side is a reference to a regexp, then the left # hand is evaluated. does_match(q(xxx), qr(xxx), 'q(xxx) |M| qr(xxx)'); does_match(q(wwwxxxyyyzzz), qr(xxx), 'q(wwwxxxyyyzzz) |M| qr(xxx)'); doesnt_match($_, qr(xxx)) for 0, 1, q(), q(XXX), [], {}, sub {}, $obj; doesnt_match(qr(xxx), q(xxx)); # If the right hand side is a code reference, then it is called in a # boolean context with the left hand side being passed as an # argument. does_match(1, sub {$_}); doesnt_match(0, sub {$_}); does_match(1, sub {$_[0]}); doesnt_match(0, sub {$_[0]}); does_match(1, sub {1}); does_match(0, sub {1}); # If the right hand side is an object which provides a "MATCH" # method, then it this is called as a method, with the left hand side # being passed as an argument. my $obj2 = do { package Local::SomeOtherClass; sub MATCH { $_[1] } bless []; }; does_match(1, $obj2); doesnt_match(0, $obj2); # If the right hand side is an object which overloads "~~", then a # true smart match is performed. if ($] >= 5.010001 and $] < 5.020000) { my $obj3 = eval q{ no warnings; package Local::YetAnotherClass; use overload q[~~] => sub { $_[1] }; bless []; }; does_match(1, $obj3); doesnt_match(0, $obj3); } # If the right hand side is an arrayref, then the operator recurses # into the array, with the match succeeding if the left hand side # matches any array element. does_match(q(x), [qw(x y z)], 'q(x) |M| [qw(x y z)]'); # If any other value appears on the right hand side, the operator # will croak. ok( exception { "Foo" |M| { foo => 1 } }, q(Matching against a regexp throws an exception.), ); ok( exception { "Foo" |M| \*STDOUT }, q(Matching against a filehandle throws an exception.), ); done_testing; 03smart.t000664001750001750 2474312355063456 14670 0ustar00taitai000000000000match-simple-0.009/t=pod =encoding utf-8 =head1 PURPOSE Test that match::smart works. =cut use strict; use warnings; no warnings 'uninitialized'; use Test::More; use match::smart qw(match); use Tie::Array; use Tie::Hash; # Predeclare vars used in the tests: my @empty; my %empty; my @sparse; $sparse[2] = 2; my $deep1 = []; push @$deep1, $deep1; my $deep2 = []; push @$deep2, $deep2; my @nums = (1..10); tie my @tied_nums, 'Tie::StdArray'; @tied_nums = (1..10); my %hash = (foo => 17, bar => 23); tie my %tied_hash, 'Tie::StdHash'; %tied_hash = %hash; { package Test::Object::NoOverload; sub new { bless { key => 1 } } } { package Test::Object::StringOverload; use overload '""' => sub { "object" }, fallback => 1; sub new { bless { key => 1 } } } { package Test::Object::WithOverload; sub new { bless { key => (defined $_[1] ? $_[1] : 'magic') } } sub MATCH { my %hash = %{ $_[0] }; if ($_[2]) { # arguments reversed ? return $_[1] eq reverse $hash{key}; } else { return $_[1] eq $hash{key}; } }; use overload '""' => sub { "stringified" }; use overload 'eq' => sub {"$_[0]" eq "$_[1]"}; } our $ov_obj = Test::Object::WithOverload->new; our $ov_obj_2 = Test::Object::WithOverload->new("object"); our $obj = Test::Object::NoOverload->new; our $str_obj = Test::Object::StringOverload->new; require Tie::RefHash; tie my %refh, 'Tie::RefHash'; $refh{$ov_obj} = 1; my @keyandmore = qw(key and more); my @fooormore = qw(foo or more); my %keyandmore = map { $_ => 0 } @keyandmore; my %fooormore = map { $_ => 0 } @fooormore; # Load and run the tests plan tests => 349; while () { SKIP: { next if /^#/ || !/\S/; chomp; my ($yn, $left, $right, $note) = split /\t+/; local $::TODO = $note =~ /TODO/; die "Bad test spec: ($yn, $left, $right)" if $yn =~ /[^!@=]/; my $tstr = "match($left, $right)"; test_again: my $res; if ($note =~ /NOWARNINGS/) { $res = eval "no warnings; $tstr"; } else { # skip_if_miniperl("Doesn't work with miniperl", $yn =~ /=/ ? 2 : 1) # if $note =~ /MINISKIP/; $res = eval $tstr; } chomp $@; if ( $yn =~ /@/ ) { ok( $@ ne '', "$tstr dies" ) and print "# \$\@ was: $@\n"; } else { my $test_name = $tstr . ($yn =~ /!/ ? " does not match" : " matches"); if ( $@ ne '' ) { fail($test_name); print "# \$\@ was: $@\n"; } else { ok( ($yn =~ /!/ xor $res), $test_name ) or diag sprintf '%s ~~ %s', explain(eval($left), eval($right)); } } if ( $yn =~ s/=// ) { $tstr = "match($right, $left)"; goto test_again; } } } sub foo {} sub bar {42} sub gorch {42} sub fatal {die "fatal sub\n"} # to test constant folding sub FALSE() { 0 } sub TRUE() { 1 } sub NOT_DEF() { undef } # Prefix character : # - expected to match # ! - expected to not match # @ - expected to be a compilation failure # = - expected to match symmetrically (runs test twice) # Data types to test : # undef # Object-overloaded # Object # Coderef # Hash # Hashref # Array # Arrayref # Tied arrays and hashes # Arrays that reference themselves # Regex (// and qr//) # Range # Num # Str # Other syntactic items of interest: # Constants # Values returned by a sub call __DATA__ # Any ~~ undef ! $ov_obj undef ! $obj undef ! sub {} undef ! \%hash undef ! \%hash undef ! {} undef ! \@nums undef ! \@nums undef ! [] undef ! \%tied_hash undef ! \@tied_nums undef ! $deep1 undef ! qr/foo/ undef ! qr/foo/ undef ! [21..30] undef ! 189 undef ! "foo" undef ! "" undef ! !1 undef undef undef (my $u) undef NOT_DEF undef &NOT_DEF undef # Any ~~ object overloaded ! \&fatal $ov_obj 'cigam' $ov_obj ! 'cigam on' $ov_obj ! ['cigam'] $ov_obj ! ['stringified'] $ov_obj ! { cigam => 1 } $ov_obj ! { stringified => 1 } $ov_obj ! $obj $ov_obj ! undef $ov_obj # regular object @ $obj $obj @ $ov_obj $obj =@ \&fatal $obj @ \&FALSE $obj @ \&foo $obj @ sub { 1 } $obj @ sub { 0 } $obj @ \%keyandmore $obj @ {"key" => 1} $obj @ \@fooormore $obj @ ["key" => 1] $obj @ qr/key/ $obj @ qr/key/ $obj @ "key" $obj @ FALSE $obj # regular object with "" overload @ $obj $str_obj =@ \&fatal $str_obj @ \&FALSE $str_obj @ \&foo $str_obj @ sub { 1 } $str_obj @ sub { 0 } $str_obj @ \%keyandmore $str_obj @ {"object" => 1} $str_obj @ \@fooormore $str_obj @ ["object" => 1] $str_obj @ qr/object/ $str_obj @ qr/object/ $str_obj @ "object" $str_obj @ FALSE $str_obj # Those will treat the $str_obj as a string because of fallback: # object (overloaded or not) ~~ Any $obj qr/NoOverload/ $ov_obj qr/^stringified$/ = "$ov_obj" "stringified" = "$str_obj" "object" != $ov_obj "stringified" $str_obj "object" $ov_obj 'magic' ! $ov_obj 'not magic' # ~~ Coderef sub{0} sub { ref $_[0] eq "CODE" } \%fooormore sub { $_[0] =~ /^(foo|or|more)$/ } ! \%fooormore sub { $_[0] =~ /^(foo|or|less)$/ } \%fooormore sub { $_[0] =~ /^(foo|or|more)$/ } ! \%fooormore sub { $_[0] =~ /^(foo|or|less)$/ } +{%fooormore} sub { $_[0] =~ /^(foo|or|more)$/ } ! +{%fooormore} sub { $_[0] =~ /^(foo|or|less)$/ } \@fooormore sub { $_[0] =~ /^(foo|or|more)$/ } ! \@fooormore sub { $_[0] =~ /^(foo|or|less)$/ } \@fooormore sub { $_[0] =~ /^(foo|or|more)$/ } ! \@fooormore sub { $_[0] =~ /^(foo|or|less)$/ } [@fooormore] sub { $_[0] =~ /^(foo|or|more)$/ } ! [@fooormore] sub { $_[0] =~ /^(foo|or|less)$/ } \%fooormore sub{@_==1} \@fooormore sub{@_==1} "foo" sub { $_[0] =~ /^(foo|or|more)$/ } ! "more" sub { $_[0] =~ /^(foo|or|less)$/ } qr/fooormore/ sub{ref $_[0] eq 'Regexp'} qr/fooormore/ sub{ref $_[0] eq 'Regexp'} 1 sub{shift} ! 0 sub{shift} ! undef sub{shift} undef sub{not shift} NOT_DEF sub{not shift} &NOT_DEF sub{not shift} FALSE sub{not shift} [1] \&bar {a=>1} \&bar qr// \&bar ! [1] \&foo ! {a=>1} \&foo $obj sub { ref($_[0]) =~ /NoOverload/ } $ov_obj sub { ref($_[0]) =~ /WithOverload/ } # empty stuff matches, because the sub is never called: [] \&foo {} \&foo \@empty \&foo \%empty \&foo ! qr// \&foo ! undef \&foo undef \&bar @ undef \&fatal @ 1 \&fatal @ [1] \&fatal @ {a=>1} \&fatal @ "foo" \&fatal @ qr// \&fatal # sub is not called on empty hashes / arrays [] \&fatal +{} \&fatal \@empty \&fatal \%empty \&fatal # sub is not special on the left sub {0} qr/^CODE/ sub {0} sub { ref shift eq "CODE" } # HASH ref against: # - another hash ref {} {} =! {} {1 => 2} {1 => 2} {1 => 2} {1 => 2} {1 => 3} =! {1 => 2} {2 => 3} = \%main:: {map {$_ => 'x'} keys %main::} # - tied hash ref = \%hash \%tied_hash \%tied_hash \%tied_hash != {"a"=>"b"} \%tied_hash = \%hash \%tied_hash \%tied_hash \%tied_hash != {"a"=>"b"} \%tied_hash $ov_obj \%refh MINISKIP ! "$ov_obj" \%refh MINISKIP [$ov_obj] \%refh MINISKIP ! ["$ov_obj"] \%refh MINISKIP \%refh \%refh MINISKIP # - an array ref # (since this is symmetrical, tests as well hash~~array) = [keys %main::] \%:: = [qw[STDIN STDOUT]] \%:: =! [] \%:: =! [""] {} =! [] {} =! @empty {} = [undef] {"" => 1} = [""] {"" => 1} = ["foo"] { foo => 1 } = ["foo", "bar"] { foo => 1 } = ["foo", "bar"] \%hash = ["foo"] \%hash =! ["quux"] \%hash = [qw(foo quux)] \%hash = \@fooormore { foo => 1, or => 2, more => 3 } = \@fooormore \%fooormore = \@fooormore \%fooormore = \@fooormore \%fooormore # - a regex = qr/^(fo[ox])$/ {foo => 1} = qr/^(fo[ox])$/ \%fooormore =! qr/[13579]$/ +{0..99} =! qr/a*/ {} = qr/a*/ {b=>2} = qr/B/i {b=>2} = qr/B/i {b=>2} =! qr/a+/ {b=>2} = qr/^à/ {"à"=>2} # - a scalar "foo" +{foo => 1, bar => 2} "foo" \%fooormore ! "baz" +{foo => 1, bar => 2} ! "boz" \%fooormore ! 1 +{foo => 1, bar => 2} ! 1 \%fooormore 1 { 1 => 3 } 1.0 { 1 => 3 } ! "1.0" { 1 => 3 } ! "1.0" { 1.0 => 3 } "1.0" { "1.0" => 3 } "à" { "à" => "À" } # - undef ! undef { hop => 'zouu' } ! undef \%hash ! undef +{"" => "empty key"} ! undef {} # ARRAY ref against: # - another array ref [] [] =! [] [1] [["foo"], ["bar"]] [qr/o/, qr/a/] ! [["foo"], ["bar"]] [qr/ARRAY/, qr/ARRAY/] ["foo", "bar"] [qr/o/, qr/a/] ! [qr/o/, qr/a/] ["foo", "bar"] ["foo", "bar"] [["foo"], ["bar"]] ! ["foo", "bar"] [qr/o/, "foo"] ["foo", undef, "bar"] [qr/o/, undef, "bar"] ! ["foo", undef, "bar"] [qr/o/, "", "bar"] ! ["foo", "", "bar"] [qr/o/, undef, "bar"] $deep1 $deep1 $deep1 $deep1 ! $deep1 $deep2 = \@nums \@tied_nums = \@nums \@tied_nums = \@nums \@tied_nums = \@nums \@tied_nums # - an object ! $obj \@fooormore $obj [sub{ref shift}] # - a regex = qr/x/ [qw(foo bar baz quux)] =! qr/y/ [qw(foo bar baz quux)] = qr/x/ [qw(foo bar baz quux)] =! qr/y/ [qw(foo bar baz quux)] = qr/FOO/i \@fooormore =! qr/bar/ \@fooormore # - a number 2 [qw(1.00 2.00)] 2 [qw(foo 2)] 2.0_0e+0 [qw(foo 2)] ! 2 [qw(1foo bar2)] # - a string ! "2" [qw(1foo 2bar)] "2bar" [qw(1foo 2bar)] # - undef undef [1, 2, undef, 4] ! undef [1, 2, [undef], 4] ! undef \@fooormore undef \@sparse undef [undef] ! 0 [undef] ! "" [undef] ! undef [0] ! undef [""] # - nested arrays and ~~ distributivity 11 [[11]] ! 11 [[12]] "foo" [{foo => "bar"}] ! "bar" [{foo => "bar"}] # Number against number 2 2 20 2_0 ! 2 3 0 FALSE 3-2 TRUE ! undef 0 ! (my $u) 0 # Number against string = 2 "2" = 2 "2.0" ! 2 "2bananas" != 2_3 "2_3" NOWARNINGS FALSE "0" ! undef "0" ! undef "" # Regex against string "x" qr/x/ ! "x" qr/y/ # Regex against number 12345 qr/3/ ! 12345 qr/7/ # array/hash against string \@fooormore "".\@fooormore ! \@keyandmore "".\@fooormore \%fooormore "".\%fooormore ! \%keyandmore "".\%fooormore # Test the implicit referencing 7 \@nums \@nums \@nums ! \@nums \\@nums \@nums [1..10] ! \@nums [0..9] "foo" \%hash qr/bar/ \%hash [qw(bar)] \%hash ! [qw(a b c)] \%hash \%hash \%hash \%hash +{%hash} \%hash \%hash \%hash \%tied_hash \%tied_hash \%tied_hash \%hash { foo => 5, bar => 10 } ! \%hash { foo => 5, bar => 10, quux => 15 } \@nums { 1, '', 2, '' } \@nums { 1, '', 12, '' } ! \@nums { 11, '', 12, '' } # array slices [@nums[0..-1]] [] [@nums[0..0]] [1] ! [@nums[0..1]] [0..2] [@nums[0..4]] [1..5] ! undef [@nums[0..-1]] 1 [@nums[0..0]] 2 [@nums[0..1]] ! [@nums[0..1]] 2 [@nums[0..1]] [@nums[0..1]] # hash slices [@keyandmore{qw(not)}] [undef] [@keyandmore{qw(key)}] [0] undef [@keyandmore{qw(not)}] 0 [@keyandmore{qw(key and more)}] ! 2 [@keyandmore{qw(key and)}] [@fooormore{qw(foo)}] [@keyandmore{qw(key)}] [@fooormore{qw(foo or more)}] [@keyandmore{qw(key and more)}] # UNDEF ! 3 undef ! 1 undef ! [] undef ! {} undef ! \%::main undef ! [1,2] undef ! \%hash undef ! \@nums undef ! "foo" undef ! "" undef ! !1 undef ! \&foo undef ! sub { } undef simple.pm000664001750001750 1215212355063456 16427 0ustar00taitai000000000000match-simple-0.009/lib/matchpackage match::simple; use 5.006001; use strict; use warnings; use Exporter::Tiny; use List::Util 1.33 qw(any); use Scalar::Util qw(blessed); BEGIN { $match::simple::AUTHORITY = 'cpan:TOBYINK'; $match::simple::VERSION = '0.009'; } our @ISA = qw( Exporter::Tiny ); our @EXPORT = qw( M ); our @EXPORT_OK = qw( match ); my $xs; unless (($ENV{MATCH_SIMPLE_IMPLEMENTATION}||'') =~ /pp/i) { eval { require match::simple::XS; match::simple::XS->VERSION(0.001); # minimum # Unless we're a development version... # Avoid using an unstable version of ::XS unless (match::simple->VERSION =~ /_/) { die if match::simple::XS->VERSION =~ /_/; } $xs = match::simple::XS->can('match'); }; } eval($xs ? <<'XS' : <<'PP'); sub IMPLEMENTATION () { "XS" } *match = *match::simple::XS::match; XS sub IMPLEMENTATION () { "PP" } sub match { no warnings qw(uninitialized numeric); my ($a, $b) = @_; return(!defined $a) if !defined($b); return($a eq $b) if !ref($b); return($a =~ $b) if ref($b) eq q(Regexp); return do{ local $_ = $a; !!$b->($a) } if ref($b) eq q(CODE); return any { match($a, $_) } @$b if ref($b) eq q(ARRAY); return !!$b->check($a) if blessed($b) && $b->isa("Type::Tiny"); return !!$b->MATCH($a, 1) if blessed($b) && $b->can("MATCH"); return eval 'no warnings; !!($a~~$b)' if blessed($b) && $] >= 5.010 && do { require overload; overload::Method($b, "~~") }; require Carp; Carp::croak("match::simple cannot match anything against: $b"); } PP sub _generate_M { require Sub::Infix; &Sub::Infix::infix(\&match); } 1; __END__ =pod =encoding utf-8 =for stopwords smartmatch recurses =head1 NAME match::simple - simplified clone of smartmatch operator =head1 SYNOPSIS use v5.10; use match::simple; if ($this |M| $that) { say "$this matches $that"; } =head1 DESCRIPTION match::simple provides a simple match operator C<< |M| >> that acts like a sane subset of the (as of Perl 5.18) deprecated smart match operator. Unlike smart match, the behaviour of the match is determined entirely by the operand on the right hand side. =over =item * If the right hand side is C, then there is only a match if the left hand side is also C. =item * If the right hand side is a non-reference, then the match is a simple string match. =item * If the right hand side is a reference to a regexp, then the left hand is evaluated . =item * If the right hand side is a code reference, then it is called in a boolean context with the left hand side being passed as an argument. =item * If the right hand side is an object which provides a C method, then it this is called as a method, with the left hand side being passed as an argument. =item * If the right hand side is an object which overloads C<~~>, then a true smart match is performed. =item * If the right hand side is an arrayref, then the operator recurses into the array, with the match succeeding if the left hand side matches any array element. =item * If any other value appears on the right hand side, the operator will croak. =back If you don't like the crazy L operator, you can alternatively export a more normal function: use v5.10; use match::simple qw(match); if (match($this, $that)) { say "$this matches $that"; } If you're making heavy use of this module, then this is probably your best option, as it runs significantly faster. =head2 XS Backend If you install match::simple::XS, a faster XS-based implementation will be used instead of the pure Perl functions. Depending on what sort of match you are doing, this is likely to be several times faster. In extreme cases, such as matching a string in an arrayref, it can be twenty-five times faster, or more. However, where C<< $that >> is a single regexp, it's around 30% slower. Overall though, I think the performance improvement is worthwhile. If you want to take advantage of this speed up, use the C function rather than the C<< |M| >> operator. Otherwise all your gains will be lost to the slow implementation of operator overloading. The constant C<< match::simple::IMPLEMENTATION >> tells you which backend is currently in use. =head2 Environment Setting the C environment variable to "PP" encourages match::simple to use the pure Perl backend. =begin trustme =item M =item match =item IMPLEMENTATION =end trustme =head1 BUGS Please report any bugs to L. =head1 SEE ALSO L. This module uses L. =head1 AUTHOR Toby Inkster Etobyink@cpan.orgE. =head1 COPYRIGHT AND LICENCE This software is copyright (c) 2013-2014 by Toby Inkster. This is free software; you can redistribute it and/or modify it under the same terms as the Perl 5 programming language system itself. =head1 DISCLAIMER OF WARRANTIES 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. smart.pm000664001750001750 1222712355063456 16267 0ustar00taitai000000000000match-simple-0.009/lib/matchpackage match::smart; use 5.006001; use strict; use warnings; use B qw(); use Exporter::Tiny; use List::Util 1.33 qw(any all); use Scalar::Util qw(blessed looks_like_number refaddr); BEGIN { $match::smart::AUTHORITY = 'cpan:TOBYINK'; $match::smart::VERSION = '0.009'; } our @ISA = qw( Exporter::Tiny ); our @EXPORT = qw( M ); our @EXPORT_OK = qw( match ); sub match { no warnings qw(uninitialized numeric); my ($a, $b, $seen) = @_; return(!defined $a) if !defined($b); return !!$b->check($a) if blessed($b) && $b->isa("Type::Tiny"); return !!$b->MATCH($a, 1) if blessed($b) && $b->can("MATCH"); return eval 'no warnings; !!($a~~$b)' if blessed($b) && $] >= 5.010 && do { require overload; overload::Method($b, "~~") }; if (blessed($b) and not $b->isa("Regexp")) { require Carp; Carp::croak("Smart matching a non-overloaded object breaks encapsulation"); } $seen ||= {}; return refaddr($a)==refaddr($b) if $seen->{refaddr($b)}++; if (ref($b) eq q(ARRAY)) { if (ref($a) eq q(ARRAY)) { return !!0 unless @$a == @$b; for my $i (0 .. $#$a) { return !!0 unless match($a->[$i], $b->[$i], $seen); } return !!1; } return any { exists $a->{$_} } @$b if ref($a) eq q(HASH); return any { $_ =~ $a } @$b if ref($a) eq q(Regexp); return any { !defined($_) } @$b if !defined($a); return any { match($a, $_) } @$b; } if (ref($b) eq q(HASH)) { return match([sort map "$_", keys %$a], [sort map "$_", keys %$b]) if ref($a) eq q(HASH); return any { exists $b->{$_} } @$a if ref($a) eq q(ARRAY); return any { $_ =~ $a } keys %$b if ref($a) eq q(Regexp); return !!0 if !defined($a); return exists $b->{$a}; } if (ref($b) eq q(CODE)) { return all { !!$b->($_) } @$a if ref($a) eq q(ARRAY); return all { !!$b->($_) } keys %$a if ref($a) eq q(HASH); return $b->($a); } if (ref($b) eq q(Regexp)) { return any { $_ =~ $b } @$a if ref($a) eq q(ARRAY); return any { $_ =~ $b } keys %$a if ref($a) eq q(HASH); return $a =~ $b; } return !!$a->check($b) if blessed($a) && $a->isa("Type::Tiny"); return !!$a->MATCH($b) if blessed($a) && $a->can("MATCH"); return eval 'no warnings; !!($a~~$b)' if blessed($a) && $] >= 5.010 && do { require overload; overload::Method($a, "~~") }; return !defined($b) if !defined($a); return $a == $b if _is_number($b); return $a == $b if _is_number($a) && looks_like_number($b); return $a eq $b; } sub _is_number { my $value = shift; return if ref $value; my $flags = B::svref_2object(\$value)->FLAGS; $flags & ( B::SVp_IOK | B::SVp_NOK ) and !( $flags & B::SVp_POK ); } sub _generate_M { require Sub::Infix; &Sub::Infix::infix(\&match); } 1; __END__ =pod =encoding utf-8 =for stopwords smartmatch recurses =head1 NAME match::smart - clone of smartmatch operator =head1 SYNOPSIS use v5.10; use match::smart; if ($this |M| $that) { say "$this matches $that"; } =head1 DESCRIPTION match::smart provides a match operator C<< |M| >> that acts like more or less identically to the (as of Perl 5.18) deprecated smart match operator. If you don't like the crazy L operator, you can alternatively export a more normal function: use v5.10; use match::smart qw(match); if (match($this, $that)) { say "$this matches $that"; } =head2 Differences with ~~ There were major changes to smart match between 5.10.0 and 5.10.1. This module attempts to emulate the behaviour of the operator in more recent versions of Perl. In particular, 5.18.0 (minus the warnings). Divergences not noted below should be considered bugs. While the real smart match operator implicitly takes references to operands that are hashes or arrays, match::smart's operator does not. @foo ~~ %bar # means: \@foo ~~ \%bar @foo |M| %bar # means: scalar(@foo) |M| scalar(%bar) If you want the C<< \@foo ~~ \%bar >> behaviour, you need to add the backslashes yourself: \@foo |M| \%bar Similarly: "foo" ~~ /foo/ # works "foo" |M| /foo/ # no worky! "foo" |M| qr/foo/ # do this instead match::smart treats the C method on blessed objects (if it exists) like an overloaded C<< ~~ >>. This is for compatibility with L, and for compatibility with pre-5.10 Perls that don't allow overloading C<< ~~ >>. =begin trustme =item M =item match =end trustme =head1 BUGS Please report any bugs to L. =head1 SEE ALSO L. This module uses L. =head1 AUTHOR Toby Inkster Etobyink@cpan.orgE. =head1 COPYRIGHT AND LICENCE This software is copyright (c) 2013-2014 by Toby Inkster. This is free software; you can redistribute it and/or modify it under the same terms as the Perl 5 programming language system itself. =head1 DISCLAIMER OF WARRANTIES 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.