Syntax-Operator-In-0.06000755001750001750 014456460514 13614 5ustar00leoleo000000000000Syntax-Operator-In-0.06/.editorconfig000444001750001750 5314456460514 16364 0ustar00leoleo000000000000root = true [*.{pm,pl,t}] indent_size = 3 Syntax-Operator-In-0.06/Build.PL000444001750001750 142214456460514 15244 0ustar00leoleo000000000000use v5; use strict; use warnings; use Module::Build; use XS::Parse::Infix::Builder; my $build = Module::Build->new( module_name => "Syntax::Operator::In", test_requires => { 'Test::More' => '0.88', # done_testing }, configure_requires => { 'Module::Build' => '0.4004', # test_requires 'XS::Parse::Infix::Builder' => '0.28', }, requires => { 'perl' => '5.014', # pluggable keywords, XOP 'XS::Parse::Infix' => '0.28', }, license => 'perl', create_license => 1, create_readme => 1, meta_merge => { resources => { x_IRC => "irc://irc.perl.org/#io-async", }, }, extra_compiler_flags => [qw( -I. -Ihax )], ); XS::Parse::Infix::Builder->extend_module_build( $build ); $build->create_build_script; Syntax-Operator-In-0.06/Changes000444001750001750 230514456460514 15244 0ustar00leoleo000000000000Revision history for Syntax-Operator-In 0.06 2023-07-21 [CHANGES] * Swap all unit tests from `Test::More` to `Test2::V0` * Adjusted documentation for release of Perl v5.38 * Remember to implement `no Syntax::Operator::*` to disable the syntax 0.05 2022-12-25 [CHANGES] * Neater compiletime error reporting of recognised but invalid operator names * Document that PL_infix_plugin now works on development perl version v5.37.7 0.04 2022-11-25 [CHANGES] * Accept in:OP notation as well, as it may overall be neater and better. Still the subject of ongoing experimentation [BUGFIXES] * Add a brace for C99-challenged compilers (RT144990) 0.03 2022-10-31 [CHANGES] * Use XS::Parse::Infix v0.27 to handle recursion into the infix operator parser, permitting use of other infix equality operators 0.02 2022-10-24 [CHANGES] * Updates for XS::Parse::Infix v0.26 * Added an actual initial implementation of the in meta-operator syntax 0.01 2022-06-24 First version, released on an unsuspecting world. Syntax-Operator-In-0.06/LICENSE000444001750001750 4375514456460514 15014 0ustar00leoleo000000000000This software is copyright (c) 2023 by Paul Evans . 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) 2023 by Paul Evans . 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) 2023 by Paul Evans . 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 MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. The End Syntax-Operator-In-0.06/MANIFEST000444001750001750 55014456460514 15062 0ustar00leoleo000000000000.editorconfig Build.PL Changes hax/BINOP_ANY.c.inc hax/newOP_CUSTOM.c.inc hax/perl-backcompat.c.inc lib/Syntax/Operator/Elem.pm lib/Syntax/Operator/In.pm lib/Syntax/Operator/In.xs LICENSE MANIFEST This list of files META.json META.yml README t/00use.t t/01in-numbery.t t/01in-stringy.t t/02elem-numbery.t t/02elem-stringy.t t/11func.t t/80in+equ.t t/99pod.t Syntax-Operator-In-0.06/META.json000444001750001750 257414456460514 15402 0ustar00leoleo000000000000{ "abstract" : "infix element-of-list meta-operator", "author" : [ "Paul Evans " ], "dynamic_config" : 1, "generated_by" : "Module::Build version 0.4231", "license" : [ "perl_5" ], "meta-spec" : { "url" : "http://search.cpan.org/perldoc?CPAN::Meta::Spec", "version" : 2 }, "name" : "Syntax-Operator-In", "prereqs" : { "build" : { "requires" : { "ExtUtils::CBuilder" : "0" } }, "configure" : { "requires" : { "Module::Build" : "0.4004", "XS::Parse::Infix::Builder" : "0.28" } }, "runtime" : { "requires" : { "XS::Parse::Infix" : "0.28", "perl" : "5.014" } }, "test" : { "requires" : { "Test::More" : "0.88" } } }, "provides" : { "Syntax::Operator::Elem" : { "file" : "lib/Syntax/Operator/Elem.pm", "version" : "0.06" }, "Syntax::Operator::In" : { "file" : "lib/Syntax/Operator/In.pm", "version" : "0.06" } }, "release_status" : "stable", "resources" : { "license" : [ "http://dev.perl.org/licenses/" ], "x_IRC" : "irc://irc.perl.org/#io-async" }, "version" : "0.06", "x_serialization_backend" : "JSON::PP version 4.07" } Syntax-Operator-In-0.06/META.yml000444001750001750 154514456460514 15227 0ustar00leoleo000000000000--- abstract: 'infix element-of-list meta-operator' author: - 'Paul Evans ' build_requires: ExtUtils::CBuilder: '0' Test::More: '0.88' configure_requires: Module::Build: '0.4004' XS::Parse::Infix::Builder: '0.28' dynamic_config: 1 generated_by: 'Module::Build version 0.4231, CPAN::Meta::Converter version 2.150010' license: perl meta-spec: url: http://module-build.sourceforge.net/META-spec-v1.4.html version: '1.4' name: Syntax-Operator-In provides: Syntax::Operator::Elem: file: lib/Syntax/Operator/Elem.pm version: '0.06' Syntax::Operator::In: file: lib/Syntax/Operator/In.pm version: '0.06' requires: XS::Parse::Infix: '0.28' perl: '5.014' resources: IRC: irc://irc.perl.org/#io-async license: http://dev.perl.org/licenses/ version: '0.06' x_serialization_backend: 'CPAN::Meta::YAML version 0.018' Syntax-Operator-In-0.06/README000444001750001750 474714456460514 14645 0ustar00leoleo000000000000NAME Syntax::Operator::In - infix element-of-list meta-operator SYNOPSIS On Perl v5.38 or later: use Syntax::Operator::In; if($x in:eq @some_strings) { say "x is one of the given strings"; } DESCRIPTION This module provides an infix meta-operator that implements a element-of-list test on either strings or numbers. Support for custom infix operators was added in the Perl 5.37.x development cycle and is available from development release v5.37.7 onwards, and therefore in Perl v5.38 onwards. The documentation of XS::Parse::Infix describes the situation in more detail. While Perl versions before this do not support custom infix operators, they can still be used via XS::Parse::Infix and hence XS::Parse::Keyword. Custom keywords which attempt to parse operator syntax may be able to use these. For operators that already specialize on string or numerical equality, see instead Syntax::Operator::Elem. OPERATORS in my $present = $lhs in:OP @rhs; my $present = $lhs in @rhs; Yields true if the value on the lefhand side is equal to any of the values in the list on the right, according to some equality test operator OP. This test operator must be either eq for string match, or == for number match, or any other custom infix operator that is registered in the XPI_CLS_EQUALITY classification. There are currently two accepted forms of the syntax for this operator, using either a prefix colon or a circumfix pair of angle-brackets. They are entirely identical in semantics, differing only in the surface-level syntax to notate them. This is because I'm still entirely undecided on which notation is better in terms of readable neatness, flexibility, parsing ambiguity and so on. This is somewhat of an experiment to see which will eventually win. TODO * Improve runtime performance of compiletime-constant sets of strings, by detecting when the RHS contains string constants and convert it into a hash lookup. * Consider cross-module integration with Syntax::Keyword::Match, permitting match($val : elem) { case(@arr_of_strings) { ... } } Or perhaps this would be too weird, and maybe match/case should have an "any-of" list/array matching ability itself. See also https://rt.cpan.org/Ticket/Display.html?id=143482. AUTHOR Paul Evans Syntax-Operator-In-0.06/hax000755001750001750 014456460514 14374 5ustar00leoleo000000000000Syntax-Operator-In-0.06/hax/BINOP_ANY.c.inc000444001750001750 326314456460514 17027 0ustar00leoleo000000000000/* vi: set ft=c : */ struct binop_any { BASEOP OP *op_first; OP *op_last; ANY *op_any; }; typedef struct binop_any BINOP_ANY; #define cBINOP_ANYx(o) ((BINOP_ANY *)o) #define cBINOP_ANY cBINOP_ANYx(PL_op) #define cBINOP_ANYo cBINOP_ANYx(o) #ifndef OpTYPE_set # define OpTYPE_set(op, type) \ STMT_START { \ op->op_type = (OPCODE)type; \ op->op_ppaddr = PL_ppaddr[type]; \ } STMT_END #endif #define newBINOP_ANY(type, flags, first, last, anycount) S_newBINOP_ANY(aTHX_ type, flags, first, last, anycount) static OP *S_newBINOP_ANY(pTHX_ I32 type, I32 flags, OP *first, OP *last, Size_t anycount) { dVAR; BINOP_ANY *binop; OP *kid = first; NewOp(1101, binop, 1, BINOP_ANY); if(!first) first = newOP(OP_NULL, 0); OpTYPE_set(binop, type); binop->op_first = first; binop->op_flags = (U8)(flags | OPf_KIDS); if(!last) { last = first; binop->op_private = (U8)(1 | (flags >> 8)); } else { binop->op_private = (U8)(2 | (flags >> 8)); OpMORESIB_set(first, last); } if(!OpHAS_SIBLING(last)) OpLASTSIB_set(last, (OP *)binop); binop->op_last = OpSIBLING(binop->op_first); if(binop->op_last) OpLASTSIB_set(binop->op_last, (OP *)binop); Newx(binop->op_any, anycount, ANY); return (OP *)binop; } #define newBINOP_ANY_CUSTOM(func, flags, first, last, anycount) S_newBINOP_ANY_CUSTOM(aTHX_ func, flags, first, last, anycount) static OP *S_newBINOP_ANY_CUSTOM(pTHX_ OP *(*func)(pTHX), U32 flags, OP *first, OP *last, Size_t anycount) { BINOP_ANY *binop; binop = (BINOP_ANY *)newBINOP_ANY(OP_CUSTOM, flags, first, last, anycount); binop->op_ppaddr = func; return (OP *)binop; } Syntax-Operator-In-0.06/hax/newOP_CUSTOM.c.inc000444001750001750 612414456460514 17572 0ustar00leoleo000000000000/* vi: set ft=c : */ /* Before perl 5.22 under -DDEBUGGING, various new*OP() functions throw assert * failures on OP_CUSTOM. * https://rt.cpan.org/Ticket/Display.html?id=128562 */ #define newOP_CUSTOM(func, flags) S_newOP_CUSTOM(aTHX_ func, flags) #define newUNOP_CUSTOM(func, flags, first) S_newUNOP_CUSTOM(aTHX_ func, flags, first) #define newSVOP_CUSTOM(func, flags, sv) S_newSVOP_CUSTOM(aTHX_ func, flags, sv) #define newBINOP_CUSTOM(func, flags, first, last) S_newBINOP_CUSTOM(aTHX_ func, flags, first, last) #define newLOGOP_CUSTOM(func, flags, first, other) S_newLOGOP_CUSTOM(aTHX_ func, flags, first, other) static OP *S_newOP_CUSTOM(pTHX_ OP *(*func)(pTHX), U32 flags) { OP *op = newOP(OP_CUSTOM, flags); op->op_ppaddr = func; return op; } static OP *S_newUNOP_CUSTOM(pTHX_ OP *(*func)(pTHX), U32 flags, OP *first) { UNOP *unop; #if HAVE_PERL_VERSION(5,22,0) unop = (UNOP *)newUNOP(OP_CUSTOM, flags, first); #else NewOp(1101, unop, 1, UNOP); unop->op_type = (OPCODE)OP_CUSTOM; unop->op_first = first; unop->op_flags = (U8)(flags | OPf_KIDS); unop->op_private = (U8)(1 | (flags >> 8)); #endif unop->op_ppaddr = func; return (OP *)unop; } static OP *S_newSVOP_CUSTOM(pTHX_ OP *(*func)(pTHX), U32 flags, SV *sv) { SVOP *svop; #if HAVE_PERL_VERSION(5,22,0) svop = (SVOP *)newSVOP(OP_CUSTOM, flags, sv); #else NewOp(1101, svop, 1, SVOP); svop->op_type = (OPCODE)OP_CUSTOM; svop->op_sv = sv; svop->op_next = (OP *)svop; svop->op_flags = 0; svop->op_private = 0; #endif svop->op_ppaddr = func; return (OP *)svop; } static OP *S_newBINOP_CUSTOM(pTHX_ OP *(*func)(pTHX), U32 flags, OP *first, OP *last) { BINOP *binop; #if HAVE_PERL_VERSION(5,22,0) binop = (BINOP *)newBINOP(OP_CUSTOM, flags, first, last); #else NewOp(1101, binop, 1, BINOP); binop->op_type = (OPCODE)OP_CUSTOM; binop->op_first = first; first->op_sibling = last; binop->op_last = last; binop->op_flags = (U8)(flags | OPf_KIDS); binop->op_private = (U8)(2 | (flags >> 8)); #endif binop->op_ppaddr = func; return (OP *)binop; } static OP *S_newLOGOP_CUSTOM(pTHX_ OP *(*func)(pTHX), U32 flags, OP *first, OP *other) { OP *o; #if HAVE_PERL_VERSION(5,22,0) o = newLOGOP(OP_CUSTOM, flags, first, other); #else /* Parts of this code copypasted from perl 5.20.0's op.c S_new_logop() */ LOGOP *logop; first = op_contextualize(first, G_SCALAR); NewOp(1101, logop, 1, LOGOP); logop->op_type = (OPCODE)OP_CUSTOM; logop->op_ppaddr = NULL; /* Because caller only overrides it anyway */ logop->op_first = first; logop->op_flags = (U8)(flags | OPf_KIDS); logop->op_other = LINKLIST(other); /* logop->op_private has nothing interesting for OP_CUSTOM */ /* Link in postfix order */ logop->op_next = LINKLIST(first); first->op_next = (OP *)logop; first->op_sibling = other; /* No CHECKOP for OP_CUSTOM */ o = newUNOP(OP_NULL, 0, (OP *)logop); other->op_next = o; #endif /* the returned op is actually an UNOP that's either NULL or NOT; the real * logop is the op_next of it */ cUNOPx(o)->op_first->op_ppaddr = func; return o; } Syntax-Operator-In-0.06/hax/perl-backcompat.c.inc000444001750001750 1361614456460514 20540 0ustar00leoleo000000000000/* vi: set ft=c : */ #define HAVE_PERL_VERSION(R, V, S) \ (PERL_REVISION > (R) || (PERL_REVISION == (R) && (PERL_VERSION > (V) || (PERL_VERSION == (V) && (PERL_SUBVERSION >= (S)))))) #ifndef NOT_REACHED # define NOT_REACHED assert(0) #endif #ifndef SvTRUE_NN # define SvTRUE_NN(sv) SvTRUE(sv) #endif #ifndef G_LIST # define G_LIST G_ARRAY #endif #if !HAVE_PERL_VERSION(5, 18, 0) typedef AV PADNAMELIST; # define PadlistARRAY(pl) ((PAD **)AvARRAY(pl)) # define PadlistNAMES(pl) (*PadlistARRAY(pl)) typedef SV PADNAME; # define PadnamePV(pn) (SvPOKp(pn) ? SvPVX(pn) : NULL) # define PadnameLEN(pn) SvCUR(pn) # define PadnameIsSTATE(pn) (!!SvPAD_STATE(pn)) # define PadnameOUTER(pn) (SvFAKE(pn) && !SvPAD_STATE(pn)) # define PadnamelistARRAY(pnl) AvARRAY(pnl) # define PadnamelistMAX(pnl) AvFILLp(pnl) # define PadARRAY(p) AvARRAY(p) # define PadMAX(pad) AvFILLp(pad) #endif #if !HAVE_PERL_VERSION(5, 22, 0) # define CvPADLIST_set(cv, padlist) (CvPADLIST(cv) = padlist) # define newPADNAMEpvn(p,n) S_newPADNAMEpvn(aTHX_ p,n) static PADNAME *S_newPADNAMEpvn(pTHX_ const char *pv, STRLEN n) { PADNAME *pn = newSVpvn(pv, n); /* PADNAMEs need to be at least SVt_PVNV in order to store the COP_SEQ_* * fields */ sv_upgrade(pn, SVt_PVNV); return pn; } # define PadnameREFCNT_dec(pn) SvREFCNT_dec(pn) #endif #ifndef av_count # define av_count(av) (AvFILL(av) + 1) #endif #ifndef av_top_index # define av_top_index(av) AvFILL(av) #endif #ifndef block_end # define block_end(a,b) Perl_block_end(aTHX_ a,b) #endif #ifndef block_start # define block_start(a) Perl_block_start(aTHX_ a) #endif #ifndef cophh_exists_pvs # define cophh_exists_pvs(a,b,c) cBOOL(cophh_fetch_pvs(a,b,c)) #endif #ifndef cv_clone # define cv_clone(a) Perl_cv_clone(aTHX_ a) #endif #ifndef intro_my # define intro_my() Perl_intro_my(aTHX) #endif #ifndef pad_alloc # define pad_alloc(a,b) Perl_pad_alloc(aTHX_ a,b) #endif #ifndef CX_CUR # define CX_CUR() (&cxstack[cxstack_ix]) #endif #if HAVE_PERL_VERSION(5, 24, 0) # define OLDSAVEIX(cx) (cx->blk_oldsaveix) #else # define OLDSAVEIX(cx) (PL_scopestack[cx->blk_oldscopesp-1]) #endif #ifndef OpSIBLING # define OpSIBLING(op) ((op)->op_sibling) #endif #ifndef OpHAS_SIBLING # define OpHAS_SIBLING(op) (cBOOL(OpSIBLING(op))) #endif #ifndef OpMORESIB_set # define OpMORESIB_set(op,sib) ((op)->op_sibling = (sib)) #endif #ifndef OpLASTSIB_set /* older perls don't need to store this at all */ # define OpLASTSIB_set(op,parent) #endif #ifndef op_convert_list # define op_convert_list(type, flags, o) S_op_convert_list(aTHX_ type, flags, o) static OP *S_op_convert_list(pTHX_ I32 type, I32 flags, OP *o) { /* A minimal recreation just for our purposes */ assert( /* A hardcoded list of the optypes we know this will work for */ type == OP_ENTERSUB || type == OP_JOIN || type == OP_PUSH || 0); o->op_type = type; o->op_flags |= flags; o->op_ppaddr = PL_ppaddr[type]; o = PL_check[type](aTHX_ o); /* op_std_init() */ if(PL_opargs[type] & OA_RETSCALAR) o = op_contextualize(o, G_SCALAR); if(PL_opargs[type] & OA_TARGET && !o->op_targ) o->op_targ = pad_alloc(type, SVs_PADTMP); return o; } #endif #ifndef newMETHOP_named # define newMETHOP_named(type, flags, name) newSVOP(type, flags, name) #endif #ifndef PARENT_PAD_INDEX_set # if HAVE_PERL_VERSION(5, 22, 0) # define PARENT_PAD_INDEX_set(pn,val) (PARENT_PAD_INDEX(pn) = val) # else /* stolen from perl-5.20.0's pad.c */ # define PARENT_PAD_INDEX_set(sv,val) \ STMT_START { ((XPVNV*)SvANY(sv))->xnv_u.xpad_cop_seq.xlow = (val); } STMT_END # endif #endif /* On Perl 5.14 this had a different name */ #ifndef pad_add_name_pvn #define pad_add_name_pvn(name, len, flags, typestash, ourstash) MY_pad_add_name(aTHX_ name, len, flags, typestash, ourstash) static PADOFFSET MY_pad_add_name(pTHX_ const char *name, STRLEN len, U32 flags, HV *typestash, HV *ourstash) { /* perl 5.14's Perl_pad_add_name requires a NUL-terminated name */ SV *namesv = sv_2mortal(newSVpvn(name, len)); return Perl_pad_add_name(aTHX_ SvPV_nolen(namesv), SvCUR(namesv), flags, typestash, ourstash); } #endif #if !HAVE_PERL_VERSION(5, 26, 0) # define isIDFIRST_utf8_safe(s, e) (PERL_UNUSED_ARG(e), isIDFIRST_utf8(s)) # define isIDCONT_utf8_safe(s, e) (PERL_UNUSED_ARG(e), isIDCONT_utf8(s)) #endif #ifndef CXp_EVALBLOCK /* before perl 5.34 this was called CXp_TRYBLOCK */ # define CXp_EVALBLOCK CXp_TRYBLOCK #endif #if !HAVE_PERL_VERSION(5, 26, 0) # define sv_set_undef(sv) sv_setsv(sv, &PL_sv_undef) #endif #ifndef newAVav # define newAVav(av) S_newAVav(aTHX_ av) static AV *S_newAVav(pTHX_ AV *av) { AV *ret = newAV(); U32 count = av_count(av); U32 i; for(i = 0; i < count; i++) av_push(ret, newSVsv(AvARRAY(av)[i])); return ret; } #endif #if !defined(sv_derived_from_hv) && HAVE_PERL_VERSION(5, 16, 0) # define sv_derived_from_hv(sv, hv) MY_sv_derived_from_hv(aTHX_ sv, hv) static bool MY_sv_derived_from_hv(pTHX_ SV *sv, HV *hv) { char *hvname = HvNAME(hv); if(!hvname) return FALSE; return sv_derived_from_pvn(sv, hvname, HvNAMELEN(hv), HvNAMEUTF8(hv) ? SVf_UTF8 : 0); } #endif #ifndef xV_FROM_REF # ifdef PERL_USE_GCC_BRACE_GROUPS # define xV_FROM_REF(XV, ref) \ ({ SV *_ref = ref; assert(SvROK(_ref)); assert(SvTYPE(SvRV(_ref)) == SVt_PV ## XV); (XV *)(SvRV(_ref)); }) # else # define xV_FROM_REF(XV, ref) ((XV *)SvRV(ref)) # endif # define AV_FROM_REF(ref) xV_FROM_REF(AV, ref) # define CV_FROM_REF(ref) xV_FROM_REF(CV, ref) # define HV_FROM_REF(ref) xV_FROM_REF(HV, ref) #endif #ifndef newPADxVOP # define newPADxVOP(type, flags, padix) S_newPADxVOP(aTHX_ type, flags, padix) static OP *S_newPADxVOP(pTHX_ I32 type, I32 flags, PADOFFSET padix) { OP *op = newOP(type, flags); op->op_targ = padix; return op; } #endif Syntax-Operator-In-0.06/lib000755001750001750 014456460514 14362 5ustar00leoleo000000000000Syntax-Operator-In-0.06/lib/Syntax000755001750001750 014456460514 15650 5ustar00leoleo000000000000Syntax-Operator-In-0.06/lib/Syntax/Operator000755001750001750 014456460514 17443 5ustar00leoleo000000000000Syntax-Operator-In-0.06/lib/Syntax/Operator/Elem.pm000444001750001750 763614456460514 21034 0ustar00leoleo000000000000# You may distribute under the terms of either the GNU General Public License # or the Artistic License (the same terms as Perl itself) # # (C) Paul Evans, 2022 -- leonerd@leonerd.org.uk package Syntax::Operator::Elem 0.06; use v5.14; use warnings; use Carp; =encoding UTF-8 =head1 NAME C - element-of-list operators =head1 SYNOPSIS On Perl v5.38 or later: use Syntax::Operator::Elem; if($x elem @some_strings) { say "x is one of the given strings"; } Or on Perl v5.14 or later: use v5.14; use Syntax::Operator::Elem qw( elem_str ); if(elem_str $x, @some_strings) { say "x is one of the given strings"; } =head1 DESCRIPTION This module provides infix operators that implement element-of-list tests for strings and numbers. Support for custom infix operators was added in the Perl 5.37.x development cycle and is available from development release v5.37.7 onwards, and therefore in Perl v5.38 onwards. The documentation of L describes the situation in more detail. While Perl versions before this do not support custom infix operators, they can still be used via C and hence L. Custom keywords which attempt to parse operator syntax may be able to use these. Additionally, earlier versions of perl can still use the function-like wrapper versions of these operators. Even though the syntax appears like a regular function call, the code is compiled internally into the same more efficient operator internally, so will run without the function-call overhead of a regular function. =cut sub import { my $pkg = shift; my $caller = caller; $pkg->import_into( $caller, @_ ); } sub unimport { my $pkg = shift; my $caller = caller; $pkg->unimport_into( $caller, @_ ); } sub import_into { shift->apply( 1, @_ ) } sub unimport_into { shift->apply( 0, @_ ) } sub apply { my $pkg = shift; my ( $on, $caller, @syms ) = @_; require Syntax::Operator::In; # no import @syms or @syms = qw( elem ); my %syms = map { $_ => 1 } @syms; if( delete $syms{elem} ) { $on ? $^H{"Syntax::Operator::Elem/elem"}++ : delete $^H{"Syntax::Operator::Elem/elem"}; } foreach (qw( elem_str elem_num )) { next unless delete $syms{$_}; no strict 'refs'; $on ? *{"${caller}::$_"} = \&{$_} : warn "TODO: implement unimport of package symbol"; } croak "Unrecognised import symbols @{[ keys %syms ]}" if keys %syms; } =head1 OPERATORS =head2 elem my $present = $lhs elem @rhs; Yields true if the string on the lefthand side is equal to any of the strings in the list on the right. Note that it is specifically B guaranteed that this test will be performed in any particular order. Nor is it guaranteed that any C operator overloading present on any of the elements is respected. These conditions may allow an implementation at least partially based on a hash, balanced binary tree, or other techniques. =head2 ∈ my $present = $lhs ∈ @rhs; Yields true if the number on the lefthand side is equal to any of the numbers in the list on the right. Note that it is specifically B guaranteed that this test will be performed in any particular order. Nor is it guaranteed that any C<==> operator overloading present on any of the elements is respected. These conditions may allow an implementation at least partially based on a hash, balanced binary tree, or other techniques. =cut =head1 FUNCTIONS As a convenience, the following functions may be imported which implement the same behaviour as the infix operators, though are accessed via regular function call syntax. =head2 elem_str my $present = elem_str( $lhs, @rhs ); A function version of the L stringy operator. =head2 elem_num my $present = elem_num( $lhs, @rhs ); A function version of the L numerical operator. =cut =head1 AUTHOR Paul Evans =cut 0x55AA; Syntax-Operator-In-0.06/lib/Syntax/Operator/In.pm000444001750001750 654514456460514 20516 0ustar00leoleo000000000000# You may distribute under the terms of either the GNU General Public License # or the Artistic License (the same terms as Perl itself) # # (C) Paul Evans, 2021,2022 -- leonerd@leonerd.org.uk package Syntax::Operator::In 0.06; use v5.14; use warnings; use Carp; require XSLoader; XSLoader::load( __PACKAGE__, our $VERSION ); =head1 NAME C - infix element-of-list meta-operator =head1 SYNOPSIS On Perl v5.38 or later: use Syntax::Operator::In; if($x in:eq @some_strings) { say "x is one of the given strings"; } =head1 DESCRIPTION This module provides an infix meta-operator that implements a element-of-list test on either strings or numbers. Support for custom infix operators was added in the Perl 5.37.x development cycle and is available from development release v5.37.7 onwards, and therefore in Perl v5.38 onwards. The documentation of L describes the situation in more detail. While Perl versions before this do not support custom infix operators, they can still be used via C and hence L. Custom keywords which attempt to parse operator syntax may be able to use these. For operators that already specialize on string or numerical equality, see instead L. =cut sub import { my $pkg = shift; my $caller = caller; $pkg->import_into( $caller, @_ ); } sub unimport { my $pkg = shift; my $caller = caller; $pkg->unimport_into( $caller, @_ ); } sub import_into { shift->apply( 1, @_ ) } sub unimport_into { shift->apply( 0, @_ ) } sub apply { my $pkg = shift; my ( $on, $caller, @syms ) = @_; @syms or @syms = qw( in ); my %syms = map { $_ => 1 } @syms; if( delete $syms{in} ) { $on ? $^H{"Syntax::Operator::In/in"}++ : delete $^H{"Syntax::Operator::In/in"}; } croak "Unrecognised import symbols @{[ keys %syms ]}" if keys %syms; } =head1 OPERATORS =head2 in my $present = $lhs in:OP @rhs; my $present = $lhs in @rhs; Yields true if the value on the lefhand side is equal to any of the values in the list on the right, according to some equality test operator C. This test operator must be either C for string match, or C<==> for number match, or any other custom infix operator that is registered in the C classification. There are currently two accepted forms of the syntax for this operator, using either a prefix colon or a circumfix pair of angle-brackets. They are entirely identical in semantics, differing only in the surface-level syntax to notate them. This is because I'm still entirely undecided on which notation is better in terms of readable neatness, flexibility, parsing ambiguity and so on. This is somewhat of an experiment to see which will eventually win. =cut =head1 TODO =over 4 =item * Improve runtime performance of compiletime-constant sets of strings, by detecting when the RHS contains string constants and convert it into a hash lookup. =item * Consider cross-module integration with L, permitting match($val : elem) { case(@arr_of_strings) { ... } } Or perhaps this would be too weird, and maybe C should have an "any-of" list/array matching ability itself. See also L. =back =head1 AUTHOR Paul Evans =cut 0x55AA; Syntax-Operator-In-0.06/lib/Syntax/Operator/In.xs000444001750001750 1244014456460514 20543 0ustar00leoleo000000000000/* You may distribute under the terms of either the GNU General Public License * or the Artistic License (the same terms as Perl itself) * * (C) Paul Evans, 2021 -- leonerd@leonerd.org.uk */ #include "EXTERN.h" #include "perl.h" #include "XSUB.h" #define HAVE_PERL_VERSION(R, V, S) \ (PERL_REVISION > (R) || (PERL_REVISION == (R) && (PERL_VERSION > (V) || (PERL_VERSION == (V) && (PERL_SUBVERSION >= (S)))))) #include "perl-backcompat.c.inc" #include "newOP_CUSTOM.c.inc" #include "BINOP_ANY.c.inc" #include "XSParseInfix.h" enum Inop_Operator { INOP_CUSTOM, INOP_NUMBER, INOP_STRING, }; static OP *pp_in(pTHX) { dSP; dMARK; SV **svp; enum Inop_Operator type = PL_op->op_private; OP cmpop; switch(type) { case INOP_CUSTOM: { ANY *op_any = cBINOP_ANY->op_any; cmpop.op_type = OP_CUSTOM; cmpop.op_flags = 0; cmpop.op_ppaddr = op_any[0].any_ptr; break; } case INOP_NUMBER: cmpop.op_type = OP_EQ; cmpop.op_flags = 0; cmpop.op_ppaddr = PL_ppaddr[OP_EQ]; break; case INOP_STRING: cmpop.op_type = OP_SEQ; cmpop.op_flags = 0; cmpop.op_ppaddr = PL_ppaddr[OP_SEQ]; break; } SV *lhs = *MARK; SV **listend = SP; SP = MARK - 1; PUTBACK; ENTER; SAVEVPTR(PL_op); PL_op = &cmpop; EXTEND(SP, 2); for(svp = MARK + 1; svp <= listend; svp++) { SV *rhs = *svp; PUSHs(lhs); PUSHs(rhs); PUTBACK; (*cmpop.op_ppaddr)(aTHX); SPAGAIN; SV *ret = POPs; if(SvTRUE(ret)) { LEAVE; PUSHs(&PL_sv_yes); RETURN; } } LEAVE; PUSHs(&PL_sv_no); RETURN; } #ifndef isIDCONT_utf8_safe /* It doesn't really matter that this is not "safe", because the function is * only ever called on perls new enough to have PL_infix_plugin, and in that * case they'll have the _safe version anyway */ # define isIDCONT_utf8_safe(s, e) isIDCONT_utf8(s) #endif static void parse_in(pTHX_ U32 flags, SV **parsedata, void *hookdata) { bool using_circumfix = false; if(lex_peek_unichar(0) == '<') using_circumfix = true; else if(lex_peek_unichar(0) != ':') croak("Expected ':' or '<'"); lex_read_unichar(0); lex_read_space(0); struct XSParseInfixInfo *info; if(!parse_infix(XPI_SELECT_ANY, &info)) croak("Expected an equality test operator"); if(info->cls != XPI_CLS_EQUALITY) croak("The %s operator is not permitted for the in: meta-operator (cls=%d)", info->opname, info->cls); /* parsedata will be an AV containing * [0] IV = enum Inop_Operator * [1] UV = PTR to pp_addr if CUSTOM */ AV *parsedata_av = newAV(); *parsedata = newRV_noinc((SV *)parsedata_av); /* See if we got one of the core ones */ if(info->opcode == OP_EQ) { av_push(parsedata_av, newSViv(INOP_NUMBER)); } else if(info->opcode == OP_SEQ) { av_push(parsedata_av, newSViv(INOP_STRING)); } else if(info->opcode == OP_CUSTOM) { if(info->hooks->new_op) croak("TODO: handle custom op using the new_op function for '%s'", info->opname); av_push(parsedata_av, newSViv(INOP_CUSTOM)); av_push(parsedata_av, newSVuv(PTR2UV(info->hooks->ppaddr))); } else croak("Expected an equality test operator name but found '%s'", info->opname); if(using_circumfix) { if(lex_peek_unichar(0) != '>') croak("Expected '>'"); lex_read_unichar(0); } } static OP *newop_in(pTHX_ U32 flags, OP *lhs, OP *rhs, SV **parsedata, void *hookdata) { AV *parsedata_av = AV_FROM_REF(*parsedata); enum Inop_Operator operator = SvIV(AvARRAY(parsedata_av)[0]); OP *ret; switch(operator) { case INOP_CUSTOM: ret = newBINOP_ANY_CUSTOM(&pp_in, 0, lhs, rhs, 1); cBINOP_ANYx(ret)->op_any[0].any_ptr = INT2PTR(void *, SvUV(AvARRAY(parsedata_av)[1])); ret->op_private = INOP_CUSTOM; break; case INOP_NUMBER: case INOP_STRING: ret = newBINOP_CUSTOM(&pp_in, 0, lhs, rhs); ret->op_private = operator; break; } return ret; } static OP *newop_in_str(pTHX_ U32 flags, OP *lhs, OP *rhs, SV **parsedata, void *hookdata) { OP *ret = newBINOP_CUSTOM(&pp_in, 0, lhs, rhs); ret->op_private = INOP_STRING; return ret; } static OP *newop_in_num(pTHX_ U32 flags, OP *lhs, OP *rhs, SV **parsedata, void *hookdata) { OP *ret = newBINOP_CUSTOM(&pp_in, 0, lhs, rhs); ret->op_private = INOP_NUMBER; return ret; } struct XSParseInfixHooks infix_in = { .cls = XPI_CLS_MATCH_MISC, .rhs_flags = XPI_OPERAND_LIST, .permit_hintkey = "Syntax::Operator::In/in", .parse = &parse_in, .new_op = &newop_in, }; struct XSParseInfixHooks infix_elem_str = { .cls = XPI_CLS_MATCH_MISC, .rhs_flags = XPI_OPERAND_LIST, .permit_hintkey = "Syntax::Operator::Elem/elem", .wrapper_func_name = "Syntax::Operator::Elem::elem_str", .new_op = &newop_in_str, }; struct XSParseInfixHooks infix_elem_num = { .cls = XPI_CLS_MATCH_MISC, .rhs_flags = XPI_OPERAND_LIST, .permit_hintkey = "Syntax::Operator::Elem/elem", .wrapper_func_name = "Syntax::Operator::Elem::elem_num", .new_op = &newop_in_num, }; MODULE = Syntax::Operator::In PACKAGE = Syntax::Operator::In BOOT: boot_xs_parse_infix(0.28); register_xs_parse_infix("in", &infix_in, NULL); register_xs_parse_infix("elem", &infix_elem_str, NULL); register_xs_parse_infix("∈", &infix_elem_num, NULL); Syntax-Operator-In-0.06/t000755001750001750 014456460514 14057 5ustar00leoleo000000000000Syntax-Operator-In-0.06/t/00use.t000444001750001750 20214456460514 15307 0ustar00leoleo000000000000#!/usr/bin/perl use v5.14; use warnings; use Test2::V0; require Syntax::Operator::In; pass( "Modules loaded" ); done_testing; Syntax-Operator-In-0.06/t/01in-numbery.t000444001750001750 151114456460514 16625 0ustar00leoleo000000000000#!/usr/bin/perl use v5.14; use warnings; use Test2::V0; use Syntax::Operator::In; BEGIN { plan skip_all => "No PL_infix_plugin" unless XS::Parse::Infix::HAVE_PL_INFIX_PLUGIN; } my $warnings = 0; $SIG{__WARN__} = sub { $warnings++ }; ## Circumfix notation # List literals ok( 3 in<==> (1..5) , '3 is in 1..5'); ok(not(6 in<==> (1..5)), '6 is not in 1..5'); ## Colon notation # List literals ok( 3 in:== (1..5) , '3 is in 1..5'); ok(not(6 in:== (1..5)), '6 is not in 1..5'); # Arrays my @AtoE = (10 .. 15); ok( 13 in:== @AtoE , '13 is in @AtoE'); ok(not(16 in:== @AtoE), '16 is not in @AtoE'); # Function calls sub hundred { return 100 .. 105 } ok(102 in:== hundred(), '102 is in hundred()'); # This is a numeric match ok("1.0" in:== ("1", "2"), 'match is done numerically'); ok(!$warnings, 'no warnings'); done_testing; Syntax-Operator-In-0.06/t/01in-stringy.t000444001750001750 164214456460514 16650 0ustar00leoleo000000000000#!/usr/bin/perl use v5.14; use warnings; use Test2::V0; use Syntax::Operator::In; BEGIN { plan skip_all => "No PL_infix_plugin" unless XS::Parse::Infix::HAVE_PL_INFIX_PLUGIN; } my $warnings = 0; $SIG{__WARN__} = sub { $warnings++ }; ## Circumfix notation # List literals ok( "c" in ("a".."e") , 'c is in a..e'); ok(not("f" in ("a".."e")), 'f is not in a..e'); ## Colon notation # List literals ok( "c" in:eq ("a".."e") , 'c is in a..e'); ok(not("f" in:eq ("a".."e")), 'f is not in a..e'); # Arrays my @AtoE = ("A" .. "E"); ok( "C" in:eq @AtoE , 'C is in @AtoE'); ok(not("F" in:eq @AtoE), 'F is not in @AtoE'); # Function calls sub XtoZ { return "X" .. "Z" } ok("Y" in:eq XtoZ(), 'Y is in XtoZ()'); # unimport { no Syntax::Operator::In; sub in { return "normal function" } is( in, "normal function", 'in() parses as a normal function call' ); } ok(!$warnings, 'no warnings'); done_testing; Syntax-Operator-In-0.06/t/02elem-numbery.t000444001750001750 125414456460514 17146 0ustar00leoleo000000000000#!/usr/bin/perl use v5.14; use warnings; use Test2::V0; use Syntax::Operator::Elem; BEGIN { plan skip_all => "No PL_infix_plugin" unless XS::Parse::Infix::HAVE_PL_INFIX_PLUGIN; } my $warnings = 0; $SIG{__WARN__} = sub { $warnings++ }; # List literals ok( 3 ∈ (1..5) , '3 is in 1..5'); ok(not(6 ∈ (1..5)), '6 is not in 1..5'); # Arrays my @AtoE = (10 .. 15); ok( 13 ∈ @AtoE , '13 is in @AtoE'); ok(not(16 ∈ @AtoE), '16 is not in @AtoE'); # Function calls sub hundred { return 100 .. 105 } ok(102 ∈ hundred(), '102 is in hundred()'); # This is a numeric match ok("1.0" ∈ ("1", "2"), 'match is done numerically'); ok(!$warnings, 'no warnings'); done_testing; Syntax-Operator-In-0.06/t/02elem-stringy.t000444001750001750 173514456460514 17170 0ustar00leoleo000000000000#!/usr/bin/perl use v5.14; use warnings; use Test2::V0; use Syntax::Operator::Elem; BEGIN { plan skip_all => "No PL_infix_plugin" unless XS::Parse::Infix::HAVE_PL_INFIX_PLUGIN; } my $warnings = 0; $SIG{__WARN__} = sub { $warnings++ }; # List literals ok( "c" elem ("a".."e") , 'c is in a..e'); ok(not("f" elem ("a".."e")), 'f is not in a..e'); # Arrays my @AtoE = ("A" .. "E"); ok( "C" elem @AtoE , 'C is in @AtoE'); ok(not("F" elem @AtoE), 'F is not in @AtoE'); # Function calls sub XtoZ { return "X" .. "Z" } ok("Y" elem XtoZ(), 'Y is in XtoZ()'); # This is a stringy match ok(!("1.0" elem (1, 2, 3)), 'match is done stringly, not numerically'); # stack discipline is( [ 1, 2, ("+" elem ("+", "-")), 3, 4 ], [ 1, 2, 1, 3, 4 ], 'elem preserves stack' ); # unimport { no Syntax::Operator::Elem; sub elem { return "normal function" } is( elem, "normal function", 'elem() parses as a normal function call' ); } ok(!$warnings, 'no warnings'); done_testing; Syntax-Operator-In-0.06/t/11func.t000444001750001750 53414456460514 15460 0ustar00leoleo000000000000#!/usr/bin/perl use v5.14; use warnings; use Test2::V0; use Syntax::Operator::Elem qw( elem_str elem_num ); # stringy { ok( elem_str("c", "a".."e"), 'c is in a..e'); ok(!elem_str("f", "a".."e"), 'f is not in a..e'); } # numbery { ok( elem_num(3, 1..5), '3 is in 1..5'); ok(!elem_num(6, 1..5), '6 is not in 1..5'); } done_testing; Syntax-Operator-In-0.06/t/80in+equ.t000444001750001750 230214456460514 15742 0ustar00leoleo000000000000#!/usr/bin/perl use v5.14; use warnings; use Test2::V0; BEGIN { plan skip_all => "Syntax::Operator::In >= 0.03 is not available" unless eval { require Syntax::Operator::In; Syntax::Operator::In->VERSION( '0.03' ) }; plan skip_all => "Syntax::Operator::Equ is not available" unless eval { require Syntax::Operator::Equ; }; Syntax::Operator::In->import; Syntax::Operator::Equ->import; diag( "Syntax::Operator::In $Syntax::Operator::In::VERSION, " . "Syntax::Operator::Equ $Syntax::Operator::Equ::VERSION" ); } BEGIN { plan skip_all => "No PL_infix_plugin" unless XS::Parse::Infix::HAVE_PL_INFIX_PLUGIN; } ok( 0 in:=== (0..4) , '0 is in 0..4 by ==='); ok(not(6 in:=== (0..4)), '6 is not in 0..4 by ==='); ok( undef in:=== (1, undef, 3), 'undef is in list containing undef by ==='); ok(not(undef in:=== (0..4)), 'undef is not in 0..4 by ==='); ok( 'a' in:equ ('a'..'e') , 'a is in a..e by equ'); ok(not('f' in:equ ('a'..'e')), 'f is not in a..e by equ'); ok( undef in:equ ('a', undef, 'c'), 'undef is in list containing undef by equ'); ok(not(undef in:equ ('a', '', 'c')), 'undef is not in list containing empty string by equ'); done_testing; Syntax-Operator-In-0.06/t/99pod.t000444001750001750 25514456460514 15327 0ustar00leoleo000000000000#!/usr/bin/perl use v5.14; use warnings; use Test2::V0; eval "use Test::Pod 1.00"; plan skip_all => "Test::Pod 1.00 required for testing POD" if $@; all_pod_files_ok();