CONTRIBUTING000644001750001750 531712322217135 14604 0ustar00taitai000000000000Types-XSD-Lite-0.005NAME 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-2013 by Toby Inkster. CONTRIBUTING.pod is licensed under the Creative Commons Attribution-ShareAlike 2.0 UK: England & Wales License. To view a copy of this license, visit . COPYRIGHT000644001750001750 230612322217135 14240 0ustar00taitai000000000000Types-XSD-Lite-0.005Format: http://www.debian.org/doc/packaging-manuals/copyright-format/1.0/ Upstream-Name: Types-XSD-Lite Upstream-Contact: Toby Inkster (TOBYINK) Source: https://metacpan.org/release/Types-XSD-Lite Files: Changes META.json META.yml dist.ini doap.ttl Copyright: Copyright 2014 Toby Inkster. License: GPL-1.0+ or Artistic-1.0 Files: COPYRIGHT CREDITS SIGNATURE Copyright: None License: public-domain Files: README lib/Types/XSD/Lite.pm t/01basic.t Copyright: This software is copyright (c) 2013-2014 by Toby Inkster. License: GPL-1.0+ or Artistic-1.0 Files: CONTRIBUTING INSTALL LICENSE Copyright: Unknown License: Unknown Files: Makefile.PL Copyright: Copyright 2013 Toby Inkster. License: GPL-1.0+ or Artistic-1.0 Files: t/02inlinegenerator.t Copyright: This software is copyright (c) 2014 by 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 CREDITS000644001750001750 15512322217134 13744 0ustar00taitai000000000000Types-XSD-Lite-0.005Maintainer: - Toby Inkster (TOBYINK) Thanks: - Diab Jerius (DJERIUS) Changes000644001750001750 130012322217134 14230 0ustar00taitai000000000000Types-XSD-Lite-0.005Types-XSD-Lite ============== Created: 2013-07-08 Home page: Bug tracker: Maintainer: Toby Inkster (TOBYINK) 0.005 2014-04-12 [ Documentation ] - s/Types::XSD/Types::XSD::Lite/ in a few places. 0.004 2014-04-12 [ Bug Fixes ] - Fix bug where inline_check called multiple times on a parameterized type works the first time, but ignores all parameters on subsequent calls. Fixes RT#94620. Diab Jerius++ [ Packaging ] - use Dist::Inkt 0.003 2013-07-08 Initial release; split from Types-XSD-0.002 INSTALL000644001750001750 170712322217133 14000 0ustar00taitai000000000000Types-XSD-Lite-0.005 Installing Types-XSD-Lite should be straightforward. INSTALLATION WITH CPANMINUS If you have cpanm, you only need one line: % cpanm Types::XSD::Lite 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 Types::XSD::Lite INSTALLATION WITH THE CPAN SHELL Alternatively, if your CPAN shell is set up, you should just be able to do: % cpan Types::XSD::Lite 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 Types-XSD-Lite: % 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 LICENSE000644001750001750 4365312322217133 14002 0ustar00taitai000000000000Types-XSD-Lite-0.005This 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, Suite 500, Boston, MA 02110-1335 USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. Preamble The license agreements of most software companies try to keep users at the mercy of those companies. By contrast, our General Public License is intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users. The General Public License applies to the Free Software Foundation's software and to any other program whose authors commit to using it. You can use it for your programs, too. When we speak of free software, we are referring to freedom, not price. Specifically, the General Public License is designed to make sure that you have the freedom to give away or sell copies of free software, that you receive source code or can get it if you want it, that you can change the software or use pieces of it in new free programs; and that you know you can do these things. To protect your rights, we need to make restrictions that forbid anyone to deny you these rights or to ask you to surrender the rights. These restrictions translate to certain responsibilities for you if you distribute copies of the software, or if you modify it. For example, if you distribute copies of a such a program, whether gratis or for a fee, you must give the recipients all the rights that you have. You must make sure that they, too, receive or can get the source code. And you must tell them their rights. We protect your rights with two steps: (1) copyright the software, and (2) offer you this license which gives you legal permission to copy, distribute and/or modify the software. Also, for each author's protection and ours, we want to make certain that everyone understands that there is no warranty for this free software. If the software is modified by someone else and passed on, we want its recipients to know that what they have is not the original, so that any problems introduced by others will not reflect on the original authors' reputations. The precise terms and conditions for copying, distribution and modification follow. GNU GENERAL PUBLIC LICENSE TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 0. This License Agreement applies to any program or other work which contains a notice placed by the copyright holder saying it may be distributed under the terms of this General Public License. The "Program", below, refers to any such program or work, and a "work based on the Program" means either the Program or any work containing the Program or a portion of it, either verbatim or with modifications. Each licensee is addressed as "you". 1. You may copy and distribute verbatim copies of the Program's source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice and disclaimer of warranty; keep intact all the notices that refer to this General Public License and to the absence of any warranty; and give any other recipients of the Program a copy of this General Public License along with the Program. You may charge a fee for the physical act of transferring a copy. 2. You may modify your copy or copies of the Program or any portion of it, and copy and distribute such modifications under the terms of Paragraph 1 above, provided that you also do the following: a) cause the modified files to carry prominent notices stating that you changed the files and the date of any change; and b) cause the whole of any work that you distribute or publish, that in whole or in part contains the Program or any part thereof, either with or without modifications, to be licensed at no charge to all third parties under the terms of this General Public License (except that you may choose to grant warranty protection to some or all third parties, at your option). c) If the modified program normally reads commands interactively when run, you must cause it, when started running for such interactive use in the simplest and most usual way, to print or display an announcement including an appropriate copyright notice and a notice that there is no warranty (or else, saying that you provide a warranty) and that users may redistribute the program under these conditions, and telling the user how to view a copy of this General Public License. d) You may charge a fee for the physical act of transferring a copy, and you may at your option offer warranty protection in exchange for a fee. Mere aggregation of another independent work with the Program (or its derivative) on a volume of a storage or distribution medium does not bring the other work under the scope of these terms. 3. You may copy and distribute the Program (or a portion or derivative of it, under Paragraph 2) in object code or executable form under the terms of Paragraphs 1 and 2 above provided that you also do one of the following: a) accompany it with the complete corresponding machine-readable source code, which must be distributed under the terms of Paragraphs 1 and 2 above; or, b) accompany it with a written offer, valid for at least three years, to give any third party free (except for a nominal charge for the cost of distribution) a complete machine-readable copy of the corresponding source code, to be distributed under the terms of Paragraphs 1 and 2 above; or, c) accompany it with the information you received as to where the corresponding source code may be obtained. (This alternative is allowed only for noncommercial distribution and only if you received the program in object code or executable form alone.) Source code for a work means the preferred form of the work for making modifications to it. For an executable file, complete source code means all the source code for all modules it contains; but, as a special exception, it need not include source code for modules which are standard libraries that accompany the operating system on which the executable file runs, or for standard header files or definitions files that accompany that operating system. 4. You may not copy, modify, sublicense, distribute or transfer the Program except as expressly provided under this General Public License. Any attempt otherwise to copy, modify, sublicense, distribute or transfer the Program is void, and will automatically terminate your rights to use the Program under this License. However, parties who have received copies, or rights to use copies, from you under this General Public License will not have their licenses terminated so long as such parties remain in full compliance. 5. By copying, distributing or modifying the Program (or any work based on the Program) you indicate your acceptance of this license to do so, and all its terms and conditions. 6. Each time you redistribute the Program (or any work based on the Program), the recipient automatically receives a license from the original licensor to copy, distribute or modify the Program subject to these terms and conditions. You may not impose any further restrictions on the recipients' exercise of the rights granted herein. 7. The Free Software Foundation may publish revised and/or new versions of the General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. Each version is given a distinguishing version number. If the Program specifies a version number of the license which applies to it and "any later version", you have the option of following the terms and conditions either of that version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of the license, you may choose any version ever published by the Free Software Foundation. 8. If you wish to incorporate parts of the Program into other free programs whose distribution conditions are different, write to the author to ask for permission. For software which is copyrighted by the Free Software Foundation, write to the Free Software Foundation; we sometimes make exceptions for this. Our decision will be guided by the two goals of preserving the free status of all derivatives of our free software and of promoting the sharing and reuse of software generally. NO WARRANTY 9. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 10. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. END OF TERMS AND CONDITIONS Appendix: How to Apply These Terms to Your New Programs If you develop a new program, and you want it to be of the greatest possible use to humanity, the best way to achieve this is to make it free software which everyone can redistribute and change under these terms. To do so, attach the following notices to the program. It is safest to attach them to the start of each source file to most effectively convey the exclusion of warranty; and each file should have at least the "copyright" line and a pointer to where the full notice is found. Copyright (C) 19yy This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 1, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston MA 02110-1301 USA Also add information on how to contact you by electronic and paper mail. If the program is interactive, make it output a short notice like this when it starts in an interactive mode: Gnomovision version 69, Copyright (C) 19xx name of author Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'. This is free software, and you are welcome to redistribute it under certain conditions; type `show c' for details. The hypothetical commands `show w' and `show c' should show the appropriate parts of the General Public License. Of course, the commands you use may be called something other than `show w' and `show c'; they could even be mouse-clicks or menu items--whatever suits your program. You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the program, if necessary. Here a sample; alter the names: Yoyodyne, Inc., hereby disclaims all copyright interest in the program `Gnomovision' (a program to direct compilers to make passes at assemblers) written by James Hacker. , 1 April 1989 Ty Coon, President of Vice That's all there is to it! --- The Artistic License 1.0 --- This software is Copyright (c) 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 MANIFEST000644001750001750 27212322217135 14056 0ustar00taitai000000000000Types-XSD-Lite-0.005CONTRIBUTING COPYRIGHT CREDITS Changes INSTALL LICENSE MANIFEST META.json META.yml Makefile.PL README SIGNATURE dist.ini doap.ttl lib/Types/XSD/Lite.pm t/01basic.t t/02inlinegenerator.t META.json000644001750001750 353212322217135 14370 0ustar00taitai000000000000Types-XSD-Lite-0.005{ "abstract" : "type constraints based on a subset of XML schema datatypes", "author" : [ "Toby Inkster (TOBYINK) " ], "dynamic_config" : 0, "generated_by" : "Dist::Inkt::Profile::TOBYINK version 0.015, CPAN::Meta::Converter version 2.120921", "keywords" : [], "license" : [ "perl_5" ], "meta-spec" : { "url" : "http://search.cpan.org/perldoc?CPAN::Meta::Spec", "version" : "2" }, "name" : "Types-XSD-Lite", "no_index" : { "directory" : [ "eg", "examples", "inc", "t", "xt" ] }, "optional_features" : {}, "prereqs" : { "configure" : { "requires" : { "ExtUtils::MakeMaker" : "6.17" } }, "runtime" : { "requires" : { "Type::Library" : "0.004" } }, "test" : { "recommends" : { "Moo" : "1.003000" }, "requires" : { "Test::Fatal" : "0", "Test::More" : "0.96", "Test::Requires" : "0", "Test::TypeTiny" : "0.004" } } }, "provides" : { "Types::XSD::Lite" : { "file" : "lib/Types/XSD/Lite.pm", "version" : "0.005" } }, "release_status" : "stable", "resources" : { "X_identifier" : "http://purl.org/NET/cpan-uri/dist/Types-XSD-Lite/project", "bugtracker" : { "web" : "http://rt.cpan.org/Dist/Display.html?Queue=Types-XSD-Lite" }, "homepage" : "https://metacpan.org/release/Types-XSD-Lite", "license" : [ "http://dev.perl.org/licenses/" ], "repository" : { "type" : "git", "url" : "git://github.com/tobyink/p5-types-xsd-lite.git", "web" : "https://github.com/tobyink/p5-types-xsd-lite" } }, "version" : "0.005" } META.yml000644001750001750 205412322217135 14216 0ustar00taitai000000000000Types-XSD-Lite-0.005--- abstract: 'type constraints based on a subset of XML schema datatypes' author: - 'Toby Inkster (TOBYINK) ' build_requires: Test::Fatal: 0 Test::More: 0.96 Test::Requires: 0 Test::TypeTiny: 0.004 configure_requires: ExtUtils::MakeMaker: 6.17 dynamic_config: 0 generated_by: 'Dist::Inkt::Profile::TOBYINK version 0.015, CPAN::Meta::Converter version 2.120921' keywords: [] license: perl meta-spec: url: http://module-build.sourceforge.net/META-spec-v1.4.html version: 1.4 name: Types-XSD-Lite no_index: directory: - eg - examples - inc - t - xt optional_features: {} provides: Types::XSD::Lite: file: lib/Types/XSD/Lite.pm version: 0.005 requires: Type::Library: 0.004 resources: X_identifier: http://purl.org/NET/cpan-uri/dist/Types-XSD-Lite/project bugtracker: http://rt.cpan.org/Dist/Display.html?Queue=Types-XSD-Lite homepage: https://metacpan.org/release/Types-XSD-Lite license: http://dev.perl.org/licenses/ repository: git://github.com/tobyink/p5-types-xsd-lite.git version: 0.005 Makefile.PL000644001750001750 1212012322217135 14732 0ustar00taitai000000000000Types-XSD-Lite-0.005use strict; use ExtUtils::MakeMaker 6.17; my $EUMM = eval( $ExtUtils::MakeMaker::VERSION ); my $meta = { "abstract" => "type constraints based on a subset of XML schema datatypes", "author" => ["Toby Inkster (TOBYINK) "], "dynamic_config" => 0, "generated_by" => "Dist::Inkt::Profile::TOBYINK version 0.015, CPAN::Meta::Converter version 2.120921", "keywords" => [], "license" => ["perl_5"], "meta-spec" => { url => "http://search.cpan.org/perldoc?CPAN::Meta::Spec", version => 2, }, "name" => "Types-XSD-Lite", "no_index" => { directory => ["eg", "examples", "inc", "t", "xt"] }, "prereqs" => { configure => { requires => { "ExtUtils::MakeMaker" => 6.17 } }, runtime => { requires => { "Type::Library" => 0.004 } }, test => { recommends => { Moo => "1.003000" }, requires => { "Test::Fatal" => 0, "Test::More" => 0.96, "Test::Requires" => 0, "Test::TypeTiny" => 0.004, }, }, }, "provides" => { "Types::XSD::Lite" => { file => "lib/Types/XSD/Lite.pm", version => 0.005 }, }, "release_status" => "stable", "resources" => { bugtracker => { web => "http://rt.cpan.org/Dist/Display.html?Queue=Types-XSD-Lite", }, homepage => "https://metacpan.org/release/Types-XSD-Lite", license => ["http://dev.perl.org/licenses/"], repository => { type => "git", url => "git://github.com/tobyink/p5-types-xsd-lite.git", web => "https://github.com/tobyink/p5-types-xsd-lite", }, X_identifier => "http://purl.org/NET/cpan-uri/dist/Types-XSD-Lite/project", }, "version" => 0.005, }; 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); README000644001750001750 1621712322217133 13651 0ustar00taitai000000000000Types-XSD-Lite-0.005NAME Types::XSD::Lite - type constraints based on a subset of XML schema datatypes SYNOPSIS package Person; use Moo; use Types::XSD::Lite qw( PositiveInteger String ); has name => (is => "ro", isa => String[ minLength => 1 ]); has age => (is => "ro", isa => PositiveInteger); DESCRIPTION These are all the type constraints from XML Schema that could be implemented without introducing extra runtime dependencies (above Type::Tiny). That's basically all of the XSD types, except datetime-related ones, and XML-specific ones (QNames, IDRefs, etc). If you want the full set of XML Schema types, see Types::XSD. Type Constraints I've added some quick explanations of what each type is, but for details, see the XML Schema specification. `AnyType` As per `Any` from Types::Standard. `AnySimpleType` As per `Value` from Types::Standard. `String` As per `Str` from Types::Standard. `NormalizedString` A string containing no line breaks, carriage returns or tabs. `Token` Like `NormalizedString`, but also no leading or trailing space, and no doubled spaces (i.e. not `/\s{2,}/`). `Language` An RFC 3066 language code. `Boolean` Allows "true", "false", "1" and "0" (case-insensitively). Gotcha: The string "false" evaluates to true in Perl. You probably want to use `Bool` from Types::Standard instead. `Base64Binary` Strings which are valid Base64 data. Allows whitespace. Gotcha: If you parameterize this with `length`, `maxLength` or `minLength`, it is the length of the *decoded* string which will be checked. `HexBinary` Strings which are valid hexadecimal data. Disallows whitespace; disallows leading `0x`. Gotcha: If you parameterize this with `length`, `maxLength` or `minLength`, it is the length of the *decoded* string which will be checked. `Float` As per `Num` from Types::Standard. `Double` As per `Num` from Types::Standard. `AnyURI` Any absolute *or relative* URI. Effectively, any string at all! `Decimal` Numbers possibly including a decimal point, but not allowing exponential notation (e.g. "3.14e-3"). `Integer` As per `Int` from Types::Standard. `NonPositiveInteger` An `Integer` 0 or below. `NegativeInteger` An `Integer` -1 or below. `Long` An `Integer` between -9223372036854775808 and 9223372036854775807 (inclusive). `Int` An `Integer` between -2147483648 and 2147483647 (inclusive). `Short` An `Integer` between -32768 and 32767 (inclusive). `Byte` An `Integer` between -128 and 127 (inclusive). `NonNegativeInteger` An `Integer` 0 or above. `PositiveInteger` An `Integer` 1 or above. `UnsignedLong` A `NonNegativeInteger` between 0 and 18446744073709551615 (inclusive). `UnsignedInt` A `NonNegativeInteger` between 0 and 4294967295 (inclusive). `UnsignedShort` A `NonNegativeInteger` between 0 and 65535 (inclusive). `UnsignedByte` A `NonNegativeInteger` between 0 and 255 (inclusive). Parameters Datatypes can be parameterized using the facets defined by XML Schema. For example: use Types::XSD::Lite qw( String Decimal PositiveInteger Token ); my @sizes = qw( XS S M L XL XXL ); has name => (is => "ro", isa => String[ minLength => 1 ]); has price => (is => "ro", isa => Decimal[ fractionDigits => 2 ]); has rating => (is => "ro", isa => PositiveInteger[ maxInclusive => 5 ]); has size => (is => "ro", isa => Token[ enumeration => \@sizes ]); The following facets exist, but not all facets are supported for all datatypes. (The module will croak if you try to use an unsupported facet.) `enumeration` An arrayref of allowable values. You should probably use Type::Tiny::Enum instead. `pattern` A regular expression that the value is expected to conform to. Use a normal Perl quoted regexp: Token[ pattern => qr{^[a-z]+$} ] `whiteSpace` The `whiteSpace` facet is ignored as I'm not entirely sure what it should do. It perhaps makes sense for coercions, but this module doesn't define any coercions. `assertions` An arrayref of arbitrary additional restrictions, expressed as strings of Perl code or coderefs operating on $_. For example: Integer[ assertions => [ '$_ % 3 == 0', # multiple of three, and... sub { is_nice($_) }, # is nice (whatever that means) ], ], Strings of Perl code will result in faster-running type constraints. `length`, `maxLength`, `minLength` Restrict the length of a value. For example `Integer[length=>2]` allows 10, 99 and -1, but not 100, 9 or -10. Types::XSD::Lite won't prevent you from making ridiculous constraints such as `String[ maxLength => 1, minLength => 2 ]`. Note that on `HexBinary` and `Base64Binary` types, the lengths apply to the decoded string. Length restrictions are silently ignored for `QName` and `Notation` because the W3C doesn't think you should care what length these datatypes are. `maxInclusive`, `minInclusive`, `maxExclusive`, `minExclusive` Supported for numeric types and datetime/duration-related types. Note that to be super-correct, the `{max,min}{Inclusive,Exclusive}` facets for numeric types are performed by passing the numbers through Math::BigInt or Math::BigFloat, so may be a little slow. `totalDigits` For a decimal (or type derived from decimals) specifies that the total number of digits for the value must be at most this number. Given `Decimal[ totalDigits => 3 ]`, 1.23, 12.3, 123, 1.2 and 1 are all allowable; 1.234 is not. 1.230 is also not, but this may change in a future version. `fractionDigits` Like `totalDigits` but ignores digits before the decimal point. CAVEATS This distribution has virtually no test suite, in the hope that Types::XSD's test suite will shake out any bugs in this module. BUGS Please report any bugs to . SEE ALSO Type::Tiny, Types::Standard, Types::XSD. * Datatypes in XML Schema 1.0 * Datatypes in XML Schema 1.1 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. SIGNATURE000644001750001750 315412322217136 14234 0ustar00taitai000000000000Types-XSD-Lite-0.005This file contains message digests of all files listed in MANIFEST, signed via the Module::Signature module, version 0.70. 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 294505f858f11dd062e9916e3f50d88210a9ef54 CONTRIBUTING SHA1 6be7c1f07436a8e34b8837d14b4fe9f278a1e664 COPYRIGHT SHA1 548b9292dad7e3b1968e5157770c54f2ed1cfa9b CREDITS SHA1 93da0e4f76a59070d8586c50caf434eb66594666 Changes SHA1 e7ac696abd96895f77b6bb8e6319c306c07915ae INSTALL SHA1 47870123f373f5185d6893cb98bf06a8a05510aa LICENSE SHA1 0d480ec7ee9a15acad928259bb2b0b1424e9a389 MANIFEST SHA1 349c9f4f76b506522cf621005c40862e77737e78 META.json SHA1 b585564825b42d2e630e59ee2d6985cc341a2cbd META.yml SHA1 3036ba45575be0fd74db188145cdcbfaf14c87a1 Makefile.PL SHA1 df8b39b502f3b206a82b4321e68ea11d07ef9818 README SHA1 d03269c7c8854ab16bbfb5e0a44dc8c5592b8036 dist.ini SHA1 3f5464d340affd19186678c2033cb6c3715d0a1d doap.ttl SHA1 b6a4672b57046f43f669d3aabfdce081a3c6c4cd lib/Types/XSD/Lite.pm SHA1 7e076c52ba1cbcdcfa781d5249a28c93e9b75035 t/01basic.t SHA1 0b38dfc020d4155344b81d2b9171baa7e2375a2b t/02inlinegenerator.t -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.14 (GNU/Linux) iEYEARECAAYFAlNJHl4ACgkQzr+BKGoqfTkdxwCgrqMY+p7gdb7gQVwegScHUYVw NzAAoIF6hC7gXF4xXoyM9P2yTtCd22c2 =spqm -----END PGP SIGNATURE----- dist.ini000644001750001750 10012322217133 14355 0ustar00taitai000000000000Types-XSD-Lite-0.005;;class='Dist::Inkt::Profile::TOBYINK' ;;name='Types-XSD-Lite' doap.ttl000644001750001750 1112712322217135 14436 0ustar00taitai000000000000Types-XSD-Lite-0.005@prefix dc: . @prefix doap: . @prefix doap-bugs: . @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-requirement [ doap-deps:on "Type::Library 0.004"^^doap-deps:CpanId; ]; doap-deps:test-recommendation [ doap-deps:on "Moo 1.003000"^^doap-deps:CpanId ]; doap-deps:test-requirement [ doap-deps:on "Test::More 0.96"^^doap-deps:CpanId ], [ doap-deps:on "Test::TypeTiny 0.004"^^doap-deps:CpanId; ], [ doap-deps:on "Test::Requires"^^doap-deps:CpanId ], [ doap-deps:on "Test::Fatal"^^doap-deps:CpanId ]; doap:bug-database ; doap:created "2013-07-08"^^xsd:date; doap:developer ; doap:download-page ; doap:homepage ; doap:license ; doap:maintainer ; doap:name "Types-XSD-Lite"; doap:programming-language "Perl"; doap:release , , ; doap:repository [ a doap:GitRepository; doap:browse ; ]; doap:shortdesc "type constraints based on a subset of XML schema datatypes". a doap:Version; rdfs:label "Initial release; split from Types-XSD-0.002"; dc:identifier "Types-XSD-Lite-0.003"^^xsd:string; dc:issued "2013-07-08"^^xsd:date; doap-changeset:released-by ; doap:file-release ; doap:revision "0.003"^^xsd:string. a doap:Version; dc:identifier "Types-XSD-Lite-0.004"^^xsd:string; dc:issued "2014-04-12"^^xsd:date; doap-changeset:changeset [ doap-changeset:item [ a doap-changeset:Packaging; rdfs:label "use Dist::Inkt"; ], [ a doap-changeset:Bugfix; rdfs:label "Fix bug where inline_check called multiple times on a parameterized type works the first time, but ignores all parameters on subsequent calls."; doap-changeset:fixes ; doap-changeset:thanks ; ]; ]; doap-changeset:released-by ; doap:file-release ; doap:revision "0.004"^^xsd:string. a doap:Version; dc:identifier "Types-XSD-Lite-0.005"^^xsd:string; dc:issued "2014-04-12"^^xsd:date; doap-changeset:changeset [ doap-changeset:item [ a doap-changeset:Documentation; rdfs:label "s/Types::XSD/Types::XSD::Lite/ in a few places."; ]; ]; doap-changeset:released-by ; doap:file-release ; doap:revision "0.005"^^xsd:string. a foaf:Person; foaf:name "Diab Jerius"; foaf:nick "DJERIUS"; foaf:page . a foaf:Person; foaf:mbox ; foaf:name "Toby Inkster"; foaf:nick "TOBYINK"; foaf:page . a doap-bugs:Issue; doap-bugs:id "94620"^^xsd:string; doap-bugs:page . 01basic.t000644001750001750 70412322217133 14575 0ustar00taitai000000000000Types-XSD-Lite-0.005/t=pod =encoding utf-8 =head1 PURPOSE Test that Types::XSD::Lite compiles. =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('Types::XSD::Lite'); done_testing; 02inlinegenerator.t000644001750001750 244612322217133 16727 0ustar00taitai000000000000Types-XSD-Lite-0.005/t=pod =encoding utf-8 =head1 PURPOSE Test inline generators for Types::XSD::Lite types. =head1 DEPENDENCIES Requires L 1.003000. =head1 AUTHOR Toby Inkster Etobyink@cpan.orgE. Based on a script by Diab Jerius Edjerius@cpan.orgE. =head1 COPYRIGHT AND LICENCE This 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. =cut use strict; use warnings; use Test::More; use Test::Fatal; use Test::Requires { 'Moo' => '1.003000' }; use Test::Requires { 'Types::XSD::Lite' => '0.003' }; my $USE_MOO; BEGIN { $USE_MOO = @ARGV?shift:1 }; use Types::XSD::Lite qw[NonNegativeInteger]; my ($t1, $t2) = ( NonNegativeInteger[ maxInclusive => 9 ], NonNegativeInteger[ maxInclusive => 9 ], ); if ($USE_MOO) { package Foo; use if $USE_MOO, 'Moo'; has(ccd => ( is => 'ro', isa => $t1, )); __PACKAGE__->new(ccd => 1); } is($t1->{uniq}, $t2->{uniq}); ok(! $t1->_is_null_constraint); like( exception { $t1->(10) }, qr/did not pass type constraint/, ); { my $code = $t1->inline_check('$VALUE'); my $pass = eval "my \$VALUE = 10; $code"; ok(!$pass) or note("CODE: $code"); } note explain [ $t1->inlined->($t1, '$VALUE') ]; done_testing; Lite.pm000644001750001750 5264612322217133 16542 0ustar00taitai000000000000Types-XSD-Lite-0.005/lib/Types/XSDpackage Types::XSD::Lite; use 5.008003; use strict; use warnings; use utf8; BEGIN { $Types::XSD::Lite::AUTHORITY = 'cpan:TOBYINK'; $Types::XSD::Lite::VERSION = '0.005'; } use B qw(perlstring); use Carp; use Type::Utils; use Type::Library -base, -declare => qw( AnyType AnySimpleType String NormalizedString Token Language Boolean Base64Binary HexBinary Float Double AnyURI Decimal Integer NonPositiveInteger NegativeInteger Long Int Short Byte NonNegativeInteger PositiveInteger UnsignedLong UnsignedInt UnsignedShort UnsignedByte ); use Types::Standard; our $T; sub create_range_check { my $class = $_[0]; eval "require $class"; my ($lower, $upper) = map(defined($_) ? $class->new($_) : $_, @_[1,2]); my ($lexcl, $uexcl) = map(!!$_, @_[3,4]); my $checker = (defined $lower and defined $upper and $lexcl and $uexcl) ? sub { my $n = $class->new($_); $n > $lower and $n < $upper } : (defined $lower and defined $upper and $lexcl) ? sub { my $n = $class->new($_); $n > $lower and $n <= $upper } : (defined $lower and defined $upper and $uexcl) ? sub { my $n = $class->new($_); $n >= $lower and $n < $upper } : (defined $lower and defined $upper) ? sub { my $n = $class->new($_); $n >= $lower and $n <= $upper } : (defined $lower and $lexcl) ? sub { $class->new($_) > $lower } : (defined $upper and $uexcl) ? sub { $class->new($_) < $upper } : (defined $lower) ? sub { $class->new($_) >= $lower } : (defined $upper) ? sub { $class->new($_) <= $upper } : sub { !!1 }; my $inlined = sub { my $var = $_[1]; my @checks; push @checks, sprintf('$n >%s "%s"->new("%s")', $lexcl?'':'=', $class, $lower) if defined $lower; push @checks, sprintf('$n <%s "%s"->new("%s")', $uexcl?'':'=', $class, $upper) if defined $upper; my $code = sprintf( '%s and do { my $n = "%s"->new(%s); %s }', Types::Standard::Int()->inline_check($var), $class, $var, join(" and ", @checks), ); }; return ( constraint => $checker, inlined => $inlined, ); } sub quick_range_check { my $class = $_[0]; eval "require $class"; my ($lower, $upper) = map(defined($_) ? $class->new($_) : $_, @_[1,2]); my ($lexcl, $uexcl) = map(!!$_, @_[3,4]); my $var = $_[5]; my @checks; push @checks, sprintf('$n >%s "%s"->new("%s")', $lexcl?'':'=', $class, $lower) if defined $lower; push @checks, sprintf('$n <%s "%s"->new("%s")', $uexcl?'':'=', $class, $upper) if defined $upper; my $code = sprintf( 'do { my $n = "%s"->new(%s); %s }', $class, $var, join(" and ", @checks), ); } sub hex_length { my $str = shift; my $len = ($str =~ tr/0-9A-Fa-f//); $len / 2; } sub b64_length { my $str = shift; $str =~ s/[^a-zA-Z0-9+\x{2f}=]//g; my $padding = ($str =~ tr/=//); (length($str) * 3 / 4) - $padding; } our @patterns; my $pattern_i = -1; our @assertions; my $assertion_i = -1; our %facets = ( assertions => sub { my ($o, $var) = @_; return unless exists $o->{assertions}; my $ass = delete $o->{assertions}; $ass = [$ass] unless ref($ass) eq q(ARRAY); my @r; for my $a (@$ass) { require Types::TypeTiny; if (Types::TypeTiny::CodeLike()->check($a)) { $assertion_i++; $assertions[$assertion_i] = $a; push @r, ($var eq '$_') ? sprintf('$Types::XSD::Lite::assertions[%d]->(%s)', $assertion_i, $var) : sprintf('do { local $_ = %s; $Types::XSD::Lite::assertions[%d]->(%s) }', $var, $assertion_i, $var); } elsif (Types::TypeTiny::StringLike()->check($a)) { push @r, ($var eq '$_') ? "do { $a }" : "do { local \$_ = $var; $a }"; } else { croak "assertions should be strings or coderefs"; } } join ' && ', map "($_)", @r; }, length => sub { my ($o, $var) = @_; return unless exists $o->{length}; sprintf('length(%s)==%d', $var, delete $o->{length}); }, maxLength => sub { my ($o, $var) = @_; return unless exists $o->{maxLength}; sprintf('length(%s)<=%d', $var, delete $o->{maxLength}); }, minLength => sub { my ($o, $var) = @_; return unless exists $o->{minLength}; sprintf('length(%s)>=%d', $var, delete $o->{minLength}); }, lengthHex => sub { my ($o, $var) = @_; return unless exists $o->{length}; sprintf('Types::XSD::Lite::hex_length(%s)==%d', $var, delete $o->{length}); }, maxLengthHex => sub { my ($o, $var) = @_; return unless exists $o->{maxLength}; sprintf('Types::XSD::Lite::hex_length(%s)<=%d', $var, delete $o->{maxLength}); }, minLengthHex => sub { my ($o, $var) = @_; return unless exists $o->{minLength}; sprintf('Types::XSD::Lite::hex_length(%s)>=%d', $var, delete $o->{minLength}); }, lengthQName => sub { my ($o, $var) = @_; return unless exists $o->{length}; delete $o->{length}; "!!1" }, maxLengthQName => sub { my ($o, $var) = @_; return unless exists $o->{maxLength}; delete $o->{maxLength}; "!!1" }, minLengthQName => sub { my ($o, $var) = @_; return unless exists $o->{minLength}; delete $o->{minLength}; "!!1" }, lengthB64 => sub { my ($o, $var) = @_; return unless exists $o->{length}; sprintf('Types::XSD::Lite::b64_length(%s)==%d', $var, delete $o->{length}); }, maxLengthB64 => sub { my ($o, $var) = @_; return unless exists $o->{maxLength}; sprintf('Types::XSD::Lite::b64_length(%s)<=%d', $var, delete $o->{maxLength}); }, minLengthB64 => sub { my ($o, $var) = @_; return unless exists $o->{minLength}; sprintf('Types::XSD::Lite::b64_length(%s)>=%d', $var, delete $o->{minLength}); }, pattern => sub { my ($o, $var) = @_; return unless exists $o->{pattern}; $patterns[++$pattern_i] = delete $o->{pattern}; sprintf('%s =~ $Types::XSD::Lite::patterns[%d]', $var, $pattern_i); }, enumeration => sub { my ($o, $var) = @_; return unless exists $o->{enumeration}; my $re = join "|", map quotemeta, @{delete $o->{enumeration}}; sprintf('%s =~ m/^(?:%s)$/sm', $var, $re); }, whiteSpace => sub { my ($o, $var) = @_; return unless exists $o->{whiteSpace}; delete($o->{whiteSpace}); "!!1"; }, maxInclusive => sub { my ($o, $var) = @_; return unless exists $o->{maxInclusive}; quick_range_check("Math::BigInt", undef, delete($o->{maxInclusive}), undef, undef, $var); }, minInclusive => sub { my ($o, $var) = @_; return unless exists $o->{minInclusive}; quick_range_check("Math::BigInt", delete($o->{minInclusive}), undef, undef, undef, $var); }, maxExclusive => sub { my ($o, $var) = @_; return unless exists $o->{maxExclusive}; quick_range_check("Math::BigInt", undef, delete($o->{maxExclusive}), undef, 1, $var); }, minExclusive => sub { my ($o, $var) = @_; return unless exists $o->{minExclusive}; quick_range_check("Math::BigInt", delete($o->{minExclusive}), undef, 1, undef, $var); }, maxInclusiveFloat => sub { my ($o, $var) = @_; return unless exists $o->{maxInclusive}; quick_range_check("Math::BigFloat", undef, delete($o->{maxInclusive}), undef, undef, $var); }, minInclusiveFloat => sub { my ($o, $var) = @_; return unless exists $o->{minInclusive}; quick_range_check("Math::BigFloat", delete($o->{minInclusive}), undef, undef, undef, $var); }, maxExclusiveFloat => sub { my ($o, $var) = @_; return unless exists $o->{maxExclusive}; quick_range_check("Math::BigFloat", undef, delete($o->{maxExclusive}), undef, 1, $var); }, minExclusiveFloat => sub { my ($o, $var) = @_; return unless exists $o->{minExclusive}; quick_range_check("Math::BigFloat", delete($o->{minExclusive}), undef, 1, undef, $var); }, maxInclusiveStr => sub { my ($o, $var) = @_; return unless exists $o->{maxInclusive}; sprintf('%s le %s', $var, perlstring delete $o->{maxInclusive}); }, minInclusiveStr => sub { my ($o, $var) = @_; return unless exists $o->{minInclusive}; sprintf('%s ge %s', $var, perlstring delete $o->{minInclusive}); }, maxExclusiveStr => sub { my ($o, $var) = @_; return unless exists $o->{maxExclusive}; sprintf('%s lt %s', $var, perlstring delete $o->{maxExclusive}); }, minExclusiveStr => sub { my ($o, $var) = @_; return unless exists $o->{minExclusive}; sprintf('%s gt %s', $var, perlstring delete $o->{minExclusive}); }, totalDigits => sub { my ($o, $var) = @_; return unless exists $o->{totalDigits}; sprintf('do { no warnings "uninitialized"; my $tmp = %s; ($tmp=~tr/0-9//) <= %d }', $var, delete $o->{totalDigits}); }, fractionDigits => sub { my ($o, $var) = @_; return unless exists $o->{fractionDigits}; sprintf('do { no warnings "uninitialized"; my (undef, $tmp) = split /\\./, %s; ($tmp=~tr/0-9//) <= %d }', $var, delete $o->{fractionDigits}); }, ); sub facet { my $self = pop; my @facets = ("assertions", @_); my $regexp = qr{^${\(join "|", map quotemeta, @facets)}$}ms; my $name = "$self"; my $inline_generator = sub { my %p_not_destroyed = @_; return sub { local $T = $_[0]->parent; my %p = %p_not_destroyed; # copy; my $var = $_[1]; my $r = sprintf( '(%s)', join( ' and ', $self->inline_check($var), map($facets{$_}->(\%p, $var), @facets), ), ); croak sprintf( 'Attempt to parameterize type "%s" with unrecognised parameter%s %s', $name, scalar(keys %p)==1 ? '' : 's', join(", ", map(qq["$_"], sort keys %p)), ) if keys %p; return $r; }; }; $self->{inline_generator} = $inline_generator; $self->{constraint_generator} = sub { my $sub = sprintf( 'sub { %s }', $inline_generator->(@_)->($self, '$_[0]'), ); eval($sub) or croak "could not build sub: $@\n\nCODE: $sub\n"; }; $self->{name_generator} = sub { my ($s, %a) = @_; sprintf('%s[%s]', $s, join q[,], map sprintf("%s=>%s", $_, perlstring $a{$_}), sort keys %a); }; return if $self->is_anon; no strict qw( refs ); no warnings qw( redefine prototype ); *{$self->library . '::' . $self->name} = $self->library->_mksub($self); } declare AnyType, as Types::Standard::Any; declare AnySimpleType, as Types::Standard::Value; facet qw( length minLength maxLength pattern enumeration whiteSpace ), declare String, as Types::Standard::Str; facet qw( length minLength maxLength pattern enumeration whiteSpace ), declare NormalizedString, as Types::Standard::StrMatch[qr{^[^\t\r\n]*$}sm]; facet qw( length minLength maxLength pattern enumeration whiteSpace ), declare Token, as intersection([ NormalizedString, Types::Standard::StrMatch([qr{^\s}sm])->complementary_type, Types::Standard::StrMatch([qr{\s$}sm])->complementary_type, Types::Standard::StrMatch([qr{\s{2}}sm])->complementary_type, ]); facet qw( length minLength maxLength pattern enumeration whiteSpace ), declare Language, as Types::Standard::StrMatch[qr{^[a-zA-Z]{1,8}(?:-[a-zA-Z0-9]{1,8})*$}sm]; facet qw( pattern whiteSpace ), declare Boolean, as Types::Standard::StrMatch[qr{^(?:true|false|0|1)$}ism]; facet qw( lengthB64 minLengthB64 maxLengthB64 pattern enumeration whiteSpace ), declare Base64Binary, as Types::Standard::StrMatch[qr{^[a-zA-Z0-9+\x{2f}=\s]+$}ism]; facet qw( lengthHex minLengthHex maxLengthHex pattern enumeration whiteSpace ), declare HexBinary, as Types::Standard::StrMatch[qr{^[a-fA-F0-9]+$}ism]; facet qw( pattern enumeration whiteSpace maxInclusiveFloat maxExclusiveFloat minInclusiveFloat minExclusiveFloat ), declare Float, as Types::Standard::Num; facet qw( pattern enumeration whiteSpace maxInclusiveFloat maxExclusiveFloat minInclusiveFloat minExclusiveFloat ), declare Double, as Types::Standard::Num; facet qw( length minLength maxLength pattern enumeration whiteSpace ), declare AnyURI, as Types::Standard::Str; facet qw( totalDigits fractionDigits pattern whiteSpace enumeration maxInclusiveFloat maxExclusiveFloat minInclusiveFloat minExclusiveFloat ), declare Decimal, as Types::Standard::StrMatch[qr{^(?:(?:[+-]?[0-9]+(?:\.[0-9]+)?)|(?:[+-]?\.[0-9]+))$}ism]; facet qw( totalDigits fractionDigits pattern whiteSpace enumeration maxInclusive maxExclusive minInclusive minExclusive ), declare Integer, as Types::Standard::Int; facet qw( totalDigits fractionDigits pattern whiteSpace enumeration maxInclusive maxExclusive minInclusive minExclusive ), declare NonPositiveInteger, as Integer, create_range_check("Math::BigInt", undef, 0); facet qw( totalDigits fractionDigits pattern whiteSpace enumeration maxInclusive maxExclusive minInclusive minExclusive ), declare NegativeInteger, as NonPositiveInteger, create_range_check("Math::BigInt", undef, -1); facet qw( totalDigits fractionDigits pattern whiteSpace enumeration maxInclusive maxExclusive minInclusive minExclusive ), declare NonNegativeInteger, as Integer, create_range_check("Math::BigInt", 0, undef); facet qw( totalDigits fractionDigits pattern whiteSpace enumeration maxInclusive maxExclusive minInclusive minExclusive ), declare PositiveInteger, as NonNegativeInteger, create_range_check("Math::BigInt", 1, undef); facet qw( totalDigits fractionDigits pattern whiteSpace enumeration maxInclusive maxExclusive minInclusive minExclusive ), declare Long, as Integer, create_range_check("Math::BigInt", q[-9223372036854775808], q[9223372036854775807]); facet qw( totalDigits fractionDigits pattern whiteSpace enumeration maxInclusive maxExclusive minInclusive minExclusive ), declare Int, as Long, create_range_check("Math::BigInt", q[-2147483648], q[2147483647]); facet qw( totalDigits fractionDigits pattern whiteSpace enumeration maxInclusive maxExclusive minInclusive minExclusive ), declare Short, as Int, create_range_check("Math::BigInt", q[-32768], q[32767]); facet qw( totalDigits fractionDigits pattern whiteSpace enumeration maxInclusive maxExclusive minInclusive minExclusive ), declare Byte, as Short, create_range_check("Math::BigInt", q[-128], q[127]); facet qw( totalDigits fractionDigits pattern whiteSpace enumeration maxInclusive maxExclusive minInclusive minExclusive ), declare UnsignedLong, as NonNegativeInteger, create_range_check("Math::BigInt", q[0], q[18446744073709551615]); facet qw( totalDigits fractionDigits pattern whiteSpace enumeration maxInclusive maxExclusive minInclusive minExclusive ), declare UnsignedInt, as UnsignedLong, create_range_check("Math::BigInt", q[0], q[4294967295]); facet qw( totalDigits fractionDigits pattern whiteSpace enumeration maxInclusive maxExclusive minInclusive minExclusive ), declare UnsignedShort, as UnsignedInt, create_range_check("Math::BigInt", q[0], q[65535]); facet qw( totalDigits fractionDigits pattern whiteSpace enumeration maxInclusive maxExclusive minInclusive minExclusive ), declare UnsignedByte, as UnsignedShort, create_range_check("Math::BigInt", q[0], q[255]); 1; __END__ =pod =encoding utf-8 =begin stopwords datatypes datetime-related QNames IDRefs whitespace datetime/duration-related =end stopwords =head1 NAME Types::XSD::Lite - type constraints based on a subset of XML schema datatypes =head1 SYNOPSIS package Person; use Moo; use Types::XSD::Lite qw( PositiveInteger String ); has name => (is => "ro", isa => String[ minLength => 1 ]); has age => (is => "ro", isa => PositiveInteger); =head1 DESCRIPTION These are all the type constraints from XML Schema that could be implemented without introducing extra runtime dependencies (above L). That's basically all of the XSD types, except datetime-related ones, and XML-specific ones (QNames, IDRefs, etc). If you want the full set of XML Schema types, see L. =head2 Type Constraints I've added some quick explanations of what each type is, but for details, see the XML Schema specification. =over =item C<< AnyType >> As per C from L. =item C<< AnySimpleType >> As per C from L. =item C<< String >> As per C from L. =item C<< NormalizedString >> A string containing no line breaks, carriage returns or tabs. =item C<< Token >> Like C, but also no leading or trailing space, and no doubled spaces (i.e. not C<< /\s{2,}/ >>). =item C<< Language >> An RFC 3066 language code. =item C<< Boolean >> Allows C<< "true" >>, C<< "false" >>, C<< "1" >> and C<< "0" >> (case-insensitively). Gotcha: The string C<< "false" >> evaluates to true in Perl. You probably want to use C<< Bool >> from L instead. =item C<< Base64Binary >> Strings which are valid Base64 data. Allows whitespace. Gotcha: If you parameterize this with C, C or C, it is the length of the I string which will be checked. =item C<< HexBinary >> Strings which are valid hexadecimal data. Disallows whitespace; disallows leading C<< 0x >>. Gotcha: If you parameterize this with C, C or C, it is the length of the I string which will be checked. =item C<< Float >> As per C from L. =item C<< Double >> As per C from L. =item C<< AnyURI >> Any absolute I<< or relative >> URI. Effectively, any string at all! =item C<< Decimal >> Numbers possibly including a decimal point, but not allowing exponential notation (e.g. C<< "3.14e-3" >>). =item C<< Integer >> As per C from L. =item C<< NonPositiveInteger >> An C 0 or below. =item C<< NegativeInteger >> An C -1 or below. =item C<< Long >> An C between -9223372036854775808 and 9223372036854775807 (inclusive). =item C<< Int >> An C between -2147483648 and 2147483647 (inclusive). =item C<< Short >> An C between -32768 and 32767 (inclusive). =item C<< Byte >> An C between -128 and 127 (inclusive). =item C<< NonNegativeInteger >> An C 0 or above. =item C<< PositiveInteger >> An C 1 or above. =item C<< UnsignedLong >> A C between 0 and 18446744073709551615 (inclusive). =item C<< UnsignedInt >> A C between 0 and 4294967295 (inclusive). =item C<< UnsignedShort >> A C between 0 and 65535 (inclusive). =item C<< UnsignedByte >> A C between 0 and 255 (inclusive). =back =head2 Parameters Datatypes can be parameterized using the facets defined by XML Schema. For example: use Types::XSD::Lite qw( String Decimal PositiveInteger Token ); my @sizes = qw( XS S M L XL XXL ); has name => (is => "ro", isa => String[ minLength => 1 ]); has price => (is => "ro", isa => Decimal[ fractionDigits => 2 ]); has rating => (is => "ro", isa => PositiveInteger[ maxInclusive => 5 ]); has size => (is => "ro", isa => Token[ enumeration => \@sizes ]); The following facets exist, but not all facets are supported for all datatypes. (The module will croak if you try to use an unsupported facet.) =over =item C<< enumeration >> An arrayref of allowable values. You should probably use L instead. =item C<< pattern >> A regular expression that the value is expected to conform to. Use a normal Perl quoted regexp: Token[ pattern => qr{^[a-z]+$} ] =item C<< whiteSpace >> The C facet is ignored as I'm not entirely sure what it should do. It perhaps makes sense for coercions, but this module doesn't define any coercions. =item C<< assertions >> An arrayref of arbitrary additional restrictions, expressed as strings of Perl code or coderefs operating on C<< $_ >>. For example: Integer[ assertions => [ '$_ % 3 == 0', # multiple of three, and... sub { is_nice($_) }, # is nice (whatever that means) ], ], Strings of Perl code will result in faster-running type constraints. =item C<< length >>, C<< maxLength >>, C<< minLength >> Restrict the length of a value. For example C<< Integer[length=>2] >> allows C<10>, C<99> and C<-1>, but not C<100>, C<9> or C<-10>. Types::XSD::Lite won't prevent you from making ridiculous constraints such as C<< String[ maxLength => 1, minLength => 2 ] >>. Note that on C and C types, the lengths apply to the decoded string. Length restrictions are silently ignored for C and C because the W3C doesn't think you should care what length these datatypes are. =item C<< maxInclusive >>, C<< minInclusive >>, C<< maxExclusive >>, C<< minExclusive >> Supported for numeric types and datetime/duration-related types. Note that to be super-correct, the C<< {max,min}{Inclusive,Exclusive} >> facets for numeric types are performed by passing the numbers through L or L, so may be a little slow. =item C<< totalDigits >> For a decimal (or type derived from decimals) specifies that the total number of digits for the value must be at most this number. Given C<< Decimal[ totalDigits => 3 ] >>, C<1.23>, C<12.3>, C<123>, C<1.2> and C<1> are all allowable; C<1.234> is not. C<1.230> is also not, but this may change in a future version. =item C<< fractionDigits >> Like C but ignores digits before the decimal point. =back =head1 CAVEATS This distribution has virtually no test suite, in the hope that Types::XSD's test suite will shake out any bugs in this module. =head1 BUGS Please report any bugs to L. =head1 SEE ALSO L, L, L. =over =item * L Datatypes in XML Schema 1.0 =item * L Datatypes in XML Schema 1.1 =back =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.