COPYRIGHT000644001750001750 262013613525654 15764 0ustar00taitai000000000000JSON-MultiValueOrdered-0.006Format: http://www.debian.org/doc/packaging-manuals/copyright-format/1.0/ Upstream-Name: JSON-MultiValueOrdered Upstream-Contact: Toby Inkster (TOBYINK) Source: https://metacpan.org/release/JSON-MultiValueOrdered Files: README lib/JSON/MultiValueOrdered.pm lib/JSON/Tiny/Subclassable.pm lib/Tie/Hash/MultiValueOrdered.pm t/01basic.t t/02synopsis.t t/03pretty.t t/04hash.t Copyright: This software is copyright (c) 2012-2013 by Toby Inkster. License: GPL-1.0+ or Artistic-1.0 Files: Changes META.json META.yml doap.ttl Copyright: Copyright 2020 Toby Inkster. License: GPL-1.0+ or Artistic-1.0 Files: COPYRIGHT CREDITS SIGNATURE Copyright: None License: public-domain Files: INSTALL LICENSE examples/eg1.pl Copyright: Unknown License: Unknown Files: Makefile.PL Copyright: Copyright 2013 Toby Inkster. License: GPL-1.0+ or Artistic-1.0 Files: dist.ini Copyright: Copyright 2014 Toby Inkster. License: GPL-1.0+ or Artistic-1.0 Files: t/05j.t Copyright: This software is copyright (c) 2013 by Toby Inkster. License: GPL-1.0+ or Artistic-1.0 License: Artistic-1.0 This software is Copyright (c) 2020 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) 2020 by the copyright holder(s). This is free software, licensed under: The GNU General Public License, Version 1, February 1989 CREDITS000644001750001750 16413613525654 15472 0ustar00taitai000000000000JSON-MultiValueOrdered-0.006Maintainer: - Toby Inkster (TOBYINK) Contributor: - David J. Oswald (DAVIDO) Changes000644001750001750 163713613525654 15773 0ustar00taitai000000000000JSON-MultiValueOrdered-0.006JSON-MultiValueOrdered ====================== Created: 2012-11-08 Home page: Bug tracker: Maintainer: Toby Inkster (TOBYINK) 0.006 2020-01-27 - Tie::Hash::MultiValueOrdered `pairs` and `pair_refs` (and `all_values` which calls them) shouldn't need to deep clone values, just shallow clone the lists of values. 0.005 2014-09-11 [ Packaging ] - Switch to Dist::Inkt. 0.004 2013-05-14 - Changed heuristics for number detection to better line up with user expectations. 0.003 2013-02-27 [ Documentation ] - Document test suite. [ Other ] - Added: Implement 'j' function as supported by JSON::Tiny. 0.002 2012-11-11 Perl 5.8 compatibility release - Avoid defined-or operator. - Require UNIVERSAL::DOES on Perl 5.8. 0.001 2012-11-08 Initial release INSTALL000644001750001750 175413613525654 15531 0ustar00taitai000000000000JSON-MultiValueOrdered-0.006 Installing JSON-MultiValueOrdered should be straightforward. INSTALLATION WITH CPANMINUS If you have cpanm, you only need one line: % cpanm JSON::MultiValueOrdered 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 JSON::MultiValueOrdered INSTALLATION WITH THE CPAN SHELL Alternatively, if your CPAN shell is set up, you should just be able to do: % cpan JSON::MultiValueOrdered 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 JSON-MultiValueOrdered: % 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 4365513613525654 15533 0ustar00taitai000000000000JSON-MultiValueOrdered-0.006This software is copyright (c) 2020 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) 2020 by Toby Inkster. This is free software, licensed under: The GNU General Public License, Version 1, February 1989 GNU GENERAL PUBLIC LICENSE Version 1, February 1989 Copyright (C) 1989 Free Software Foundation, Inc. 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. Preamble The license agreements of most software companies try to keep users at the mercy of those companies. By contrast, our General Public License is intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users. The General Public License applies to the Free Software Foundation's software and to any other program whose authors commit to using it. You can use it for your programs, too. When we speak of free software, we are referring to freedom, not price. Specifically, the General Public License is designed to make sure that you have the freedom to give away or sell copies of free software, that you receive source code or can get it if you want it, that you can change the software or use pieces of it in new free programs; and that you know you can do these things. To protect your rights, we need to make restrictions that forbid anyone to deny you these rights or to ask you to surrender the rights. These restrictions translate to certain responsibilities for you if you distribute copies of the software, or if you modify it. For example, if you distribute copies of a such a program, whether gratis or for a fee, you must give the recipients all the rights that you have. You must make sure that they, too, receive or can get the source code. And you must tell them their rights. We protect your rights with two steps: (1) copyright the software, and (2) offer you this license which gives you legal permission to copy, distribute and/or modify the software. Also, for each author's protection and ours, we want to make certain that everyone understands that there is no warranty for this free software. If the software is modified by someone else and passed on, we want its recipients to know that what they have is not the original, so that any problems introduced by others will not reflect on the original authors' reputations. The precise terms and conditions for copying, distribution and modification follow. GNU GENERAL PUBLIC LICENSE TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 0. This License Agreement applies to any program or other work which contains a notice placed by the copyright holder saying it may be distributed under the terms of this General Public License. The "Program", below, refers to any such program or work, and a "work based on the Program" means either the Program or any work containing the Program or a portion of it, either verbatim or with modifications. Each licensee is addressed as "you". 1. You may copy and distribute verbatim copies of the Program's source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice and disclaimer of warranty; keep intact all the notices that refer to this General Public License and to the absence of any warranty; and give any other recipients of the Program a copy of this General Public License along with the Program. You may charge a fee for the physical act of transferring a copy. 2. You may modify your copy or copies of the Program or any portion of it, and copy and distribute such modifications under the terms of Paragraph 1 above, provided that you also do the following: a) cause the modified files to carry prominent notices stating that you changed the files and the date of any change; and b) cause the whole of any work that you distribute or publish, that in whole or in part contains the Program or any part thereof, either with or without modifications, to be licensed at no charge to all third parties under the terms of this General Public License (except that you may choose to grant warranty protection to some or all third parties, at your option). c) If the modified program normally reads commands interactively when run, you must cause it, when started running for such interactive use in the simplest and most usual way, to print or display an announcement including an appropriate copyright notice and a notice that there is no warranty (or else, saying that you provide a warranty) and that users may redistribute the program under these conditions, and telling the user how to view a copy of this General Public License. d) You may charge a fee for the physical act of transferring a copy, and you may at your option offer warranty protection in exchange for a fee. Mere aggregation of another independent work with the Program (or its derivative) on a volume of a storage or distribution medium does not bring the other work under the scope of these terms. 3. You may copy and distribute the Program (or a portion or derivative of it, under Paragraph 2) in object code or executable form under the terms of Paragraphs 1 and 2 above provided that you also do one of the following: a) accompany it with the complete corresponding machine-readable source code, which must be distributed under the terms of Paragraphs 1 and 2 above; or, b) accompany it with a written offer, valid for at least three years, to give any third party free (except for a nominal charge for the cost of distribution) a complete machine-readable copy of the corresponding source code, to be distributed under the terms of Paragraphs 1 and 2 above; or, c) accompany it with the information you received as to where the corresponding source code may be obtained. (This alternative is allowed only for noncommercial distribution and only if you received the program in object code or executable form alone.) Source code for a work means the preferred form of the work for making modifications to it. For an executable file, complete source code means all the source code for all modules it contains; but, as a special exception, it need not include source code for modules which are standard libraries that accompany the operating system on which the executable file runs, or for standard header files or definitions files that accompany that operating system. 4. You may not copy, modify, sublicense, distribute or transfer the Program except as expressly provided under this General Public License. Any attempt otherwise to copy, modify, sublicense, distribute or transfer the Program is void, and will automatically terminate your rights to use the Program under this License. However, parties who have received copies, or rights to use copies, from you under this General Public License will not have their licenses terminated so long as such parties remain in full compliance. 5. By copying, distributing or modifying the Program (or any work based on the Program) you indicate your acceptance of this license to do so, and all its terms and conditions. 6. Each time you redistribute the Program (or any work based on the Program), the recipient automatically receives a license from the original licensor to copy, distribute or modify the Program subject to these terms and conditions. You may not impose any further restrictions on the recipients' exercise of the rights granted herein. 7. The Free Software Foundation may publish revised and/or new versions of the General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. Each version is given a distinguishing version number. If the Program specifies a version number of the license which applies to it and "any later version", you have the option of following the terms and conditions either of that version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of the license, you may choose any version ever published by the Free Software Foundation. 8. If you wish to incorporate parts of the Program into other free programs whose distribution conditions are different, write to the author to ask for permission. For software which is copyrighted by the Free Software Foundation, write to the Free Software Foundation; we sometimes make exceptions for this. Our decision will be guided by the two goals of preserving the free status of all derivatives of our free software and of promoting the sharing and reuse of software generally. NO WARRANTY 9. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 10. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. END OF TERMS AND CONDITIONS Appendix: How to Apply These Terms to Your New Programs If you develop a new program, and you want it to be of the greatest possible use to humanity, the best way to achieve this is to make it free software which everyone can redistribute and change under these terms. To do so, attach the following notices to the program. It is safest to attach them to the start of each source file to most effectively convey the exclusion of warranty; and each file should have at least the "copyright" line and a pointer to where the full notice is found. Copyright (C) 19yy This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 1, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston MA 02110-1301 USA Also add information on how to contact you by electronic and paper mail. If the program is interactive, make it output a short notice like this when it starts in an interactive mode: Gnomovision version 69, Copyright (C) 19xx name of author Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'. This is free software, and you are welcome to redistribute it under certain conditions; type `show c' for details. The hypothetical commands `show w' and `show c' should show the appropriate parts of the General Public License. Of course, the commands you use may be called something other than `show w' and `show c'; they could even be mouse-clicks or menu items--whatever suits your program. You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the program, if necessary. Here a sample; alter the names: Yoyodyne, Inc., hereby disclaims all copyright interest in the program `Gnomovision' (a program to direct compilers to make passes at assemblers) written by James Hacker. , 1 April 1989 Ty Coon, President of Vice That's all there is to it! --- The Artistic License 1.0 --- This software is Copyright (c) 2020 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 43613613525654 15605 0ustar00taitai000000000000JSON-MultiValueOrdered-0.006COPYRIGHT CREDITS Changes INSTALL LICENSE MANIFEST META.json META.yml Makefile.PL README SIGNATURE dist.ini doap.ttl examples/eg1.pl lib/JSON/MultiValueOrdered.pm lib/JSON/Tiny/Subclassable.pm lib/Tie/Hash/MultiValueOrdered.pm t/01basic.t t/02synopsis.t t/03pretty.t t/04hash.t t/05j.t META.json000644001750001750 417013613525654 16114 0ustar00taitai000000000000JSON-MultiValueOrdered-0.006{ "abstract" : "handle JSON like {\"a\":1, \"a\":2}", "author" : [ "Toby Inkster (TOBYINK) " ], "dynamic_config" : 0, "generated_by" : "Dist::Inkt::Profile::TOBYINK version 0.024, CPAN::Meta::Converter version 2.150010", "keywords" : [], "license" : [ "perl_5" ], "meta-spec" : { "url" : "http://search.cpan.org/perldoc?CPAN::Meta::Spec", "version" : "2" }, "name" : "JSON-MultiValueOrdered", "no_index" : { "directory" : [ "eg", "examples", "inc", "t", "xt" ] }, "optional_features" : {}, "prereqs" : { "configure" : { "requires" : { "ExtUtils::MakeMaker" : "6.17" } }, "runtime" : { "requires" : { "perl" : "5.008000" } }, "test" : { "requires" : { "Test::More" : "0.61" } } }, "provides" : { "JSON::MultiValueOrdered" : { "file" : "lib/JSON/MultiValueOrdered.pm", "version" : "0.006" }, "JSON::Tiny::Subclassable" : { "file" : "lib/JSON/Tiny/Subclassable.pm", "version" : "0.006" }, "Tie::Hash::MultiValueOrdered" : { "file" : "lib/Tie/Hash/MultiValueOrdered.pm", "version" : "0.006" } }, "release_status" : "stable", "resources" : { "bugtracker" : { "web" : "http://rt.cpan.org/Dist/Display.html?Queue=JSON-MultiValueOrdered" }, "homepage" : "https://metacpan.org/release/JSON-MultiValueOrdered", "license" : [ "http://dev.perl.org/licenses/" ], "repository" : { "type" : "git", "url" : "git://github.com/tobyink/p5-json-multivalueordered.git", "web" : "https://github.com/tobyink/p5-json-multivalueordered" }, "x_identifier" : "http://purl.org/NET/cpan-uri/dist/JSON-MultiValueOrdered/project" }, "version" : "0.006", "x_contributors" : [ "David J. Oswald (DAVIDO) " ], "x_serialization_backend" : "JSON::PP version 2.27400_02", "x_static_install" : 1 } META.yml000644001750001750 253013613525654 15742 0ustar00taitai000000000000JSON-MultiValueOrdered-0.006--- abstract: 'handle JSON like {"a":1, "a":2}' author: - 'Toby Inkster (TOBYINK) ' build_requires: Test::More: '0.61' configure_requires: ExtUtils::MakeMaker: '6.17' dynamic_config: 0 generated_by: 'Dist::Inkt::Profile::TOBYINK version 0.024, CPAN::Meta::Converter version 2.150010' keywords: [] license: perl meta-spec: url: http://module-build.sourceforge.net/META-spec-v1.4.html version: '1.4' name: JSON-MultiValueOrdered no_index: directory: - eg - examples - inc - t - xt optional_features: {} provides: JSON::MultiValueOrdered: file: lib/JSON/MultiValueOrdered.pm version: '0.006' JSON::Tiny::Subclassable: file: lib/JSON/Tiny/Subclassable.pm version: '0.006' Tie::Hash::MultiValueOrdered: file: lib/Tie/Hash/MultiValueOrdered.pm version: '0.006' requires: perl: '5.008000' resources: Identifier: http://purl.org/NET/cpan-uri/dist/JSON-MultiValueOrdered/project bugtracker: http://rt.cpan.org/Dist/Display.html?Queue=JSON-MultiValueOrdered homepage: https://metacpan.org/release/JSON-MultiValueOrdered license: http://dev.perl.org/licenses/ repository: git://github.com/tobyink/p5-json-multivalueordered.git version: '0.006' x_contributors: - 'David J. Oswald (DAVIDO) ' x_serialization_backend: 'CPAN::Meta::YAML version 0.018' x_static_install: 1 Makefile.PL000644001750001750 1221113613525654 16460 0ustar00taitai000000000000JSON-MultiValueOrdered-0.006use strict; use ExtUtils::MakeMaker 6.17; my $EUMM = eval( $ExtUtils::MakeMaker::VERSION ); my $meta = { "abstract" => "handle JSON like {\"a\":1, \"a\":2}", "author" => ["Toby Inkster (TOBYINK) "], "dynamic_config" => 0, "generated_by" => "Dist::Inkt::Profile::TOBYINK version 0.024, CPAN::Meta::Converter version 2.150010", "keywords" => [], "license" => ["perl_5"], "meta-spec" => { url => "http://search.cpan.org/perldoc?CPAN::Meta::Spec", version => 2, }, "name" => "JSON-MultiValueOrdered", "no_index" => { directory => ["eg", "examples", "inc", "t", "xt"] }, "prereqs" => { configure => { requires => { "ExtUtils::MakeMaker" => 6.17 } }, runtime => { requires => { perl => "5.008000" } }, test => { requires => { "Test::More" => 0.61 } }, }, "provides" => { "JSON::MultiValueOrdered" => { file => "lib/JSON/MultiValueOrdered.pm", version => 0.006 }, "JSON::Tiny::Subclassable" => { file => "lib/JSON/Tiny/Subclassable.pm", version => 0.006 }, "Tie::Hash::MultiValueOrdered" => { file => "lib/Tie/Hash/MultiValueOrdered.pm", version => 0.006 }, }, "release_status" => "stable", "resources" => { bugtracker => { web => "http://rt.cpan.org/Dist/Display.html?Queue=JSON-MultiValueOrdered", }, homepage => "https://metacpan.org/release/JSON-MultiValueOrdered", license => ["http://dev.perl.org/licenses/"], repository => { type => "git", url => "git://github.com/tobyink/p5-json-multivalueordered.git", web => "https://github.com/tobyink/p5-json-multivalueordered", }, x_identifier => "http://purl.org/NET/cpan-uri/dist/JSON-MultiValueOrdered/project", }, "version" => 0.006, "x_contributors" => ["David J. Oswald (DAVIDO) "], "x_static_install" => 1, }; 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 611213613525654 15351 0ustar00taitai000000000000JSON-MultiValueOrdered-0.006NAME JSON::MultiValueOrdered - handle JSON like {"a":1, "a":2} SYNOPSIS use Test::More tests => 4; use JSON::MultiValueOrdered; my $j = JSON::MultiValueOrdered->new; isa_ok $j, 'JSON::Tiny'; my $data = $j->decode(<<'JSON'); { "a": 1, "b": 2, "a": 3, "b": 4 } JSON # As you'd expect, for repeated values, the last value is used is_deeply( $data, { a => 3, b => 4 }, ); # But hashes within the structure are tied to Tie::Hash::MultiValueOrdered is_deeply( [ tied(%$data)->get('b') ], [ 2, 4 ], ); # And the extra information from the tied hash is used when re-encoding is( $j->encode($data), q({"a":1,"b":2,"a":3,"b":4}), ); done_testing; DESCRIPTION The JSON specification allows keys to be repeated within objects. It remains silent on how repeated keys should be interpreted. Most JSON implementations end up choosing just one of the values; sometimes the first, sometimes the last. JSON::MultiValueOrdered is a subclass of JSON::Tiny which treats objects as ordered lists of key-value pairs, with duplicate keys allowed. It achieves this by returning all hashes as tied using Tie::Hash::MultiValueOrdered. While these hashes behave like standard Perl hashes (albeit while preserving the original order of the keys), they provide a tied object interface allowing you to retrieve additional values for each key. JSON::MultiValueOrdered serialisation also serialises these additional values and preserves order. JSON::MultiValueOrdered is a subclass of JSON::Tiny::Subclassable and JSON::Tiny, which is itself a fork of Mojo::JSON. Except where noted, the methods listed below behave identically to the methods of the same names in the superclasses. Constructor `new(%attributes)` Attributes `pretty` `error` Methods `decode($bytes)` `encode($ref)` `false` `true` Functions `j(\@array)` / `j(\%hash)` / `j($bytes)` Encode or decode JSON as applicable. This function may be exported, but is not exported by default. You may request to import it with a different name: use JSON::MultiValueOrdered j => { -as => 'quick_json' }; BUGS Please report any bugs to . SEE ALSO JSON::Tiny::Subclassable, JSON::Tiny, Mojo::JSON. Tie::Hash::MultiValueOrdered. AUTHOR Toby Inkster . COPYRIGHT AND LICENCE This software is copyright (c) 2012-2013 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 472513613525654 15765 0ustar00taitai000000000000JSON-MultiValueOrdered-0.006This file contains message digests of all files listed in MANIFEST, signed via the Module::Signature module, version 0.83. 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 SHA256 bd84410bd587e66a84d64cde439fd2b7e03b3fa93e4bd18984c33cac1a878ab9 COPYRIGHT SHA256 cc4516b7ec41ab1678ae79b4e218bd3cd3f9667f4b4426cafaf998611cc91a0b CREDITS SHA256 0c83923b9e242646d6127f710c85eb795a57dec23ef713fd81d74624421babe0 Changes SHA256 07a99216b069529fc515a6bfa88c4b7b68700fdad7cff2f69445951f4238aac6 INSTALL SHA256 1fb7395e76eabf94c421912d7d0a4f7fa745d49e1acb76b222c21d605b66bd25 LICENSE SHA256 aef395d1e84615a9721dc04589f8fb63d6da342a25f93832d24d8fd0c8c9575c MANIFEST SHA256 58b10313c2246638f6a35bca16489dd027e99a56fa366fa6557452efd0ad2aa1 META.json SHA256 e4bd1a9ad0ade57302a05fe8d0df82558ba1edd3fa2f274a6e6ef4e97e0176cb META.yml SHA256 a19549e2a76e58cc9c3a38c9de696623c51f13e6fb0530ff26845c0138043d4b Makefile.PL SHA256 06e7810999497b93baf2f27fb69909f7e758f75cc9fb03e1982e660145661b14 README SHA256 bc9a7bae71413fa52282d7b1e63fd47109e067fd983a63d9f79357b0a4f5b57d dist.ini SHA256 6fd40f3b55dc17c80859e1f387766c535472285b98c4f8bbe6b4f992512c2a10 doap.ttl SHA256 8e279a24eb42c4513dc380f61c7f3ebe01533ec73e374097d0605014d32aaa1a examples/eg1.pl SHA256 905932be9082385bfc10157c5752de738272e51180f13be19e12c1c6d8834028 lib/JSON/MultiValueOrdered.pm SHA256 624f4c17468f0eb037df6d8dbb48e4e482e51c88ffaa7ca51722efb7e8844e24 lib/JSON/Tiny/Subclassable.pm SHA256 096f6eac37e267d19728840a9218bb3e8b93ff9cfae42b3cff47842d7632c72d lib/Tie/Hash/MultiValueOrdered.pm SHA256 32f196bbbeb6cb2da6b8f587b9221179868fe6e17eccc275ced999160dd65ae9 t/01basic.t SHA256 9f41689ad64f9e5440959a14dfa08e1f51e82d472144943a71838bf00d84e04c t/02synopsis.t SHA256 3ee6036218592a5f4e4a14dcaeac76e6e27f7d767d37eb2e5f38deb628357d65 t/03pretty.t SHA256 8c5d0b5376e2259d99b64551d636be2f19b0be0a267b97dc8f0b1aa64d19cb86 t/04hash.t SHA256 5a13360f26e6af1a6cde67360c5f6d55d7691f140322f0c4b89f91058b339db0 t/05j.t -----BEGIN PGP SIGNATURE----- iF0EARECAB0WIQRVJKj/4+s6z4WzNujOv4Eoaip9OQUCXi6rrAAKCRDOv4Eoaip9 OaG8AJ9m9J3pJcvXbjHPinkvErfBA0elvgCgjPRufHjF1nEvxwAKEL8w9E8a6SE= =Mg1V -----END PGP SIGNATURE----- dist.ini000644001750001750 10713613525654 16113 0ustar00taitai000000000000JSON-MultiValueOrdered-0.006;;class='Dist::Inkt::Profile::TOBYINK' ;;name='JSON-MultiValueOrdered' doap.ttl000644001750001750 1432313613525654 16164 0ustar00taitai000000000000JSON-MultiValueOrdered-0.006@prefix dc: . @prefix doap: . @prefix doap-changeset: . @prefix doap-deps: . @prefix foaf: . @prefix rdfs: . @prefix xsd: . dc:title "the same terms as the perl 5 programming language system itself". a doap:Project; dc:contributor ; doap-deps:runtime-requirement [ doap-deps:on "perl 5.008000"^^doap-deps:CpanId ]; doap-deps:test-requirement [ doap-deps:on "Test::More 0.61"^^doap-deps:CpanId ]; doap:bug-database ; doap:created "2012-11-08"^^xsd:date; doap:developer , ; doap:download-page ; doap:homepage ; doap:license ; doap:maintainer ; doap:name "JSON-MultiValueOrdered"; doap:programming-language "Perl"; doap:release , , , , , ; doap:repository [ a doap:GitRepository; doap:browse ; ]; doap:shortdesc "handle JSON like {\"a\":1, \"a\":2}". a doap:Version; rdfs:label "Initial release"; dc:identifier "JSON-MultiValueOrdered-0.001"^^xsd:string; dc:issued "2012-11-08"^^xsd:date; doap-changeset:released-by ; doap:file-release ; doap:revision "0.001"^^xsd:string. a doap:Version; rdfs:label "Perl 5.8 compatibility release"; dc:identifier "JSON-MultiValueOrdered-0.002"^^xsd:string; dc:issued "2012-11-11"^^xsd:date; doap-changeset:changeset [ doap-changeset:item [ a doap-changeset:Change; rdfs:label "Require UNIVERSAL::DOES on Perl 5.8."; ], [ a doap-changeset:Change; rdfs:label "Avoid defined-or operator."; ]; ]; doap-changeset:released-by ; doap:file-release ; doap:revision "0.002"^^xsd:string. a doap:Version; dc:identifier "JSON-MultiValueOrdered-0.003"^^xsd:string; dc:issued "2013-02-27"^^xsd:date; doap-changeset:changeset [ doap-changeset:item [ a doap-changeset:Addition; rdfs:label "Implement 'j' function as supported by JSON::Tiny."; ], [ a doap-changeset:Documentation; rdfs:label "Document test suite."; ]; ]; doap-changeset:released-by ; doap:file-release ; doap:revision "0.003"^^xsd:string. a doap:Version; dc:identifier "JSON-MultiValueOrdered-0.004"^^xsd:string; dc:issued "2013-05-14"^^xsd:date; doap-changeset:changeset [ doap-changeset:item [ rdfs:label "Changed heuristics for number detection to better line up with user expectations."; rdfs:comment "Mojolicious commit 9f75c27"; ]; ]; doap-changeset:released-by ; doap:file-release ; doap:revision "0.004"^^xsd:string. a doap:Version; dc:identifier "JSON-MultiValueOrdered-0.005"^^xsd:string; dc:issued "2014-09-11"^^xsd:date; doap-changeset:changeset [ doap-changeset:item [ a doap-changeset:Packaging; rdfs:label "Switch to Dist::Inkt."; ]; ]; doap-changeset:released-by ; doap:file-release ; doap:revision "0.005"^^xsd:string. a doap:Version; dc:identifier "JSON-MultiValueOrdered-0.006"^^xsd:string; dc:issued "2020-01-27"^^xsd:date; doap-changeset:changeset [ doap-changeset:item [ a doap-changeset:Change; rdfs:label "Tie::Hash::MultiValueOrdered `pairs` and `pair_refs` (and `all_values` which calls them) shouldn't need to deep clone values, just shallow clone the lists of values."; ]; ]; doap-changeset:released-by ; doap:file-release ; doap:revision "0.006"^^xsd:string. a foaf:Person; foaf:name "David J. Oswald"; foaf:nick "DAVIDO"; foaf:page . a foaf:Person; foaf:mbox ; foaf:name "Toby Inkster"; foaf:nick "TOBYINK"; foaf:page . eg1.pl000644001750001750 26613613525654 17304 0ustar00taitai000000000000JSON-MultiValueOrdered-0.006/examplesuse 5.010; use JSON::MultiValueOrdered; my $json = JSON::MultiValueOrdered->new; my $data = $json->decode(q( {"a":1,"b":2,"b":3} )) or die $json->error; say $json->encode($data); 01basic.t000644001750001750 65113613525654 16325 0ustar00taitai000000000000JSON-MultiValueOrdered-0.006/t=head1 PURPOSE Test that L compiles. =head1 AUTHOR Toby Inkster Etobyink@cpan.orgE. =head1 COPYRIGHT AND LICENCE This software is copyright (c) 2012-2013 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 Test::More tests => 1; BEGIN { use_ok('JSON::MultiValueOrdered') }; 02synopsis.t000644001750001750 167113613525654 17157 0ustar00taitai000000000000JSON-MultiValueOrdered-0.006/t=head1 PURPOSE Run the test case from the SYNOPSIS of L. =head1 AUTHOR Toby Inkster Etobyink@cpan.orgE. =head1 COPYRIGHT AND LICENCE This software is copyright (c) 2012-2013 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 Test::More tests => 4; use JSON::MultiValueOrdered; my $j = JSON::MultiValueOrdered->new; isa_ok $j, 'JSON::Tiny'; my $data = $j->decode(<<'JSON'); { "a": 1, "b": 2, "a": 3, "b": 4 } JSON # As you'd expect, for repeated values, the last value is used is_deeply( $data, { a => 3, b => 4 }, ); # But hashes within the structure are tied to Tie::Hash::MultiValueOrdered is_deeply( [ tied(%$data)->get('b') ], [ 2, 4 ], ); # And the extra information from the tied hash is used when re-encoding is( $j->encode($data), q({"a":1,"b":2,"a":3,"b":4}), ); done_testing; 03pretty.t000644001750001750 127613613525654 16621 0ustar00taitai000000000000JSON-MultiValueOrdered-0.006/t=head1 PURPOSE Round-trip some JSON through pretty-printing. =head1 AUTHOR Toby Inkster Etobyink@cpan.orgE. =head1 COPYRIGHT AND LICENCE This software is copyright (c) 2012-2013 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 Test::More tests => 2; use JSON::MultiValueOrdered; my $str = <<'JSON'; { "a": [ 1, 2, 3 ], "a": true, "a": false, "a": 99.999, "a": null, "a": { "b": 4, "c": [ 1 ], "d": [], "e": {} } } JSON my $json = JSON::MultiValueOrdered->new(pretty => 1); ok($json->pretty); is( $json->encode($json->decode($str)), $str, ); 04hash.t000644001750001750 235613613525654 16216 0ustar00taitai000000000000JSON-MultiValueOrdered-0.006/t=head1 PURPOSE Run the test case from the SYNOPSIS of L. =head1 AUTHOR Toby Inkster Etobyink@cpan.orgE. =head1 COPYRIGHT AND LICENCE This software is copyright (c) 2012-2013 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 Test::More; use Tie::Hash::MultiValueOrdered; my $tied = tie my %hash, "Tie::Hash::MultiValueOrdered"; $hash{a} = 1; $hash{b} = 2; $hash{a} = 3; $hash{b} = 4; # Order of keys is predictable is_deeply( [ keys %hash ], [ qw( a b ) ], ); # Order of values is predictable # Note that the last values of 'a' and 'b' are returned. is_deeply( [ values %hash ], [ qw( 3 4 ) ], ); # Can retrieve list of all key-value pairs is_deeply( [ $tied->pairs ], [ qw( a 1 b 2 a 3 b 4 ) ], ); # Switch the retrieval mode for the hash. $tied->fetch_first; # Now the first values of 'a' and 'b' are returned. is_deeply( [ values %hash ], [ qw( 1 2 ) ], ); # Switch the retrieval mode for the hash. $tied->fetch_list; # Now arrayrefs are returned. is_deeply( [ values %hash ], [ [1,3], [2,4] ], ); # Restore the default retrieval mode for the hash. $tied->fetch_last; done_testing; 05j.t000644001750001750 156313613525654 15524 0ustar00taitai000000000000JSON-MultiValueOrdered-0.006/t=head1 PURPOSE =head1 AUTHOR Toby Inkster Etobyink@cpan.orgE. =head1 COPYRIGHT AND LICENCE This software is copyright (c) 2013 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; { package Foo; use JSON::Tiny::Subclassable 'j'; my $r = j('{"a":1,"a":2}'); ::ok($r->{a}==1 or $r->{a}==2); } { package Bar; use JSON::MultiValueOrdered 'j'; my $r = j('{"a":1,"a":2}'); ::ok(tied(%$r), 'j() returns tied hashref'); (tied %$r)->fetch_list; ::is_deeply($r, { a => [1, 2] }); } { package Foo; use JSON::MultiValueOrdered 'j' => { -as => 'json' }; my $r = json('{"a":1,"a":2}'); ::ok(tied(%$r), 'json() returns tied hashref'); (tied %$r)->fetch_list; ::is_deeply($r, { a => [1, 2] }); } done_testing; MultiValueOrdered.pm000644001750001750 1060013613525654 21757 0ustar00taitai000000000000JSON-MultiValueOrdered-0.006/lib/JSONuse 5.008; use strict; use warnings; use if $] < 5.010, 'UNIVERSAL::DOES'; { package JSON::MultiValueOrdered; our $AUTHORITY = 'cpan:TOBYINK'; our $VERSION = '0.006'; use base qw(JSON::Tiny::Subclassable); use Tie::Hash::MultiValueOrdered (); sub _new_hash { tie my %h, 'Tie::Hash::MultiValueOrdered'; return \%h } sub _encode_object { my $self = shift; my $object = shift; my $indent; if (exists $self->{_indent}) { $indent = $self->{_indent}; $self->{_indent} .= "\t"; } my @pairs; my $space = defined $indent ? q( ) : q(); my $tied = tied(%$object); if ($tied and $tied->DOES('Tie::Hash::MultiValueOrdered')) { my @list = $tied->pairs; for (my $i = 0; $i < @list; $i+=2) { push @pairs, sprintf( '%s:%s%s', $self->_encode_string($list[$i]), $space, $self->_encode_values($list[$i + 1]), ); } } else { while (my ($k, $v) = each %$object) { push @pairs, sprintf( '%s:%s%s', $self->_encode_string($k), $space, $self->_encode_values($v), ); } } if (defined $indent) { $self->{_indent} =~ s/^.//; return "{}" unless @pairs; return "\{\n$indent\t" . join(",\n$indent\t", @pairs) . "\n$indent\}"; } else { return '{' . join(',', @pairs) . '}'; } } __PACKAGE__->import('j'); } 1; __END__ =head1 NAME JSON::MultiValueOrdered - handle JSON like {"a":1, "a":2} =head1 SYNOPSIS use Test::More tests => 4; use JSON::MultiValueOrdered; my $j = JSON::MultiValueOrdered->new; isa_ok $j, 'JSON::Tiny'; my $data = $j->decode(<<'JSON'); { "a": 1, "b": 2, "a": 3, "b": 4 } JSON # As you'd expect, for repeated values, the last value is used is_deeply( $data, { a => 3, b => 4 }, ); # But hashes within the structure are tied to Tie::Hash::MultiValueOrdered is_deeply( [ tied(%$data)->get('b') ], [ 2, 4 ], ); # And the extra information from the tied hash is used when re-encoding is( $j->encode($data), q({"a":1,"b":2,"a":3,"b":4}), ); done_testing; =head1 DESCRIPTION The JSON specification allows keys to be repeated within objects. It remains silent on how repeated keys should be interpreted. Most JSON implementations end up choosing just one of the values; sometimes the first, sometimes the last. JSON::MultiValueOrdered is a subclass of L which treats objects as ordered lists of key-value pairs, with duplicate keys allowed. It achieves this by returning all hashes as tied using L. While these hashes behave like standard Perl hashes (albeit while preserving the original order of the keys), they provide a tied object interface allowing you to retrieve additional values for each key. JSON::MultiValueOrdered serialisation also serialises these additional values and preserves order. JSON::MultiValueOrdered is a subclass of L and L, which is itself a fork of L. Except where noted, the methods listed below behave identically to the methods of the same names in the superclasses. =head2 Constructor =over =item C<< new(%attributes) >> =back =head2 Attributes =over =item C<< pretty >> =item C<< error >> =back =head2 Methods =over =item C<< decode($bytes) >> =item C<< encode($ref) >> =item C<< false >> =item C<< true >> =back =head2 Functions =over =item C<< j(\@array) >> / C<< j(\%hash) >> / C<< j($bytes) >> Encode or decode JSON as applicable. This function may be exported, but is not exported by default. You may request to import it with a different name: use JSON::MultiValueOrdered j => { -as => 'quick_json' }; =back =head1 BUGS Please report any bugs to L. =head1 SEE ALSO L, L, L. L. =head1 AUTHOR Toby Inkster Etobyink@cpan.orgE. =head1 COPYRIGHT AND LICENCE This software is copyright (c) 2012-2013 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. Subclassable.pm000644001750001750 2737113613525654 21726 0ustar00taitai000000000000JSON-MultiValueOrdered-0.006/lib/JSON/Tinyuse 5.008; use strict; use warnings; { package JSON::Tiny::Subclassable; our $AUTHORITY = 'cpan:TOBYINK'; our $VERSION = '0.006'; our @ISA = qw(JSON::Tiny); use B; use Encode (); use Scalar::Util (); BEGIN { eval { require Sub::Name; Sub::Name->import('subname'); 1 } or eval q{ sub subname { $_[1] } }; }; sub new { my $class = shift; bless @_ ? @_ > 1 ? {@_} : {%{$_[0]}} : {}, $class; } sub error { $_[0]->{error} = $_[1] if @_ > 1; return $_[0]->{error}; } sub pretty { $_[0]->{pretty} = $_[1] if @_ > 1; return $_[0]->{pretty}; } sub import { my $class = shift; my $caller = caller; my $opts = {}; while (@_) { my $arg = shift; $opts->{$arg} = ref $_[0] ? shift @_ : undef; } if (exists $opts->{'j'}) { my $func = ((ref $opts->{j} eq 'HASH') && $opts->{j}{-as}) || 'j'; no strict 'refs'; *{"$caller\::$func"} = subname "$class\::j" => sub { my $d = shift; return $class->new->encode($d) if ref $d eq 'ARRAY' || ref $d eq 'HASH'; return $class->new->decode($d); }; delete $opts->{'j'}; } } __PACKAGE__->import('j'); # Literal names my $FALSE = bless \(my $false = 0), 'JSON::Tiny::_Bool'; my $TRUE = bless \(my $true = 1), 'JSON::Tiny::_Bool'; # Escaped special character map (with u2028 and u2029) my %ESCAPE = ( '"' => '"', '\\' => '\\', '/' => '/', 'b' => "\x07", 'f' => "\x0C", 'n' => "\x0A", 'r' => "\x0D", 't' => "\x09", 'u2028' => "\x{2028}", 'u2029' => "\x{2029}" ); my %REVERSE = map { $ESCAPE{$_} => "\\$_" } keys %ESCAPE; for (0x00 .. 0x1F, 0x7F) { my $k = pack 'C', $_; $REVERSE{$k} = sprintf '\u%.4X', $_ unless defined $REVERSE{$k}; } # Unicode encoding detection my $UTF_PATTERNS = { 'UTF-32BE' => qr/^\0\0\0[^\0]/, 'UTF-16BE' => qr/^\0[^\0]\0[^\0]/, 'UTF-32LE' => qr/^[^\0]\0\0\0/, 'UTF-16LE' => qr/^[^\0]\0[^\0]\0/ }; my $WHITESPACE_RE = qr/[\x20\x09\x0a\x0d]*/; sub DOES { my ($proto, $role) = @_; return 1 if $role eq 'Mojo::JSON'; return $proto->SUPER::DOES($role); } sub decode { my ($self, $bytes) = @_; # Cleanup $self->error(undef); # Missing input $self->error('Missing or empty input') and return undef unless $bytes; ## no critic (undef) # Remove BOM $bytes =~ s/^(?:\357\273\277|\377\376\0\0|\0\0\376\377|\376\377|\377\376)//g; # Wide characters $self->error('Wide character in input') and return undef ## no critic (undef) unless utf8::downgrade($bytes, 1); # Detect and decode Unicode my $encoding = 'UTF-8'; $bytes =~ $UTF_PATTERNS->{$_} and $encoding = $_ for keys %$UTF_PATTERNS; my $d_res = eval { $bytes = Encode::decode($encoding, $bytes, 1); 1 }; $bytes = undef unless $d_res; # Object or array my $res = eval { local $_ = $bytes; # Leading whitespace m/\G$WHITESPACE_RE/gc; # Array my $ref; if (m/\G\[/gc) { $ref = $self->_decode_array() } # Object elsif (m/\G\{/gc) { $ref = $self->_decode_object() } # Unexpected else { $self->_exception('Expected array or object') } # Leftover data unless (m/\G$WHITESPACE_RE\z/gc) { my $got = ref $ref eq 'ARRAY' ? 'array' : 'object'; $self->_exception("Unexpected data after $got"); } $ref; }; # Exception if (!$res && (my $e = $@)) { chomp $e; $self->error($e); } return $res; } sub encode { my ($self, $ref) = @_; my $eof = ''; if ($self->pretty) { $self->{_indent} = ''; $eof .= "\n"; } return Encode::encode 'UTF-8', $self->_encode_values($ref).$eof; } sub false {$FALSE} sub true {$TRUE} sub _new_hash { +{} } sub _new_array { +[] } sub _decode_array { my $self = shift; my $array = $self->_new_array; until (m/\G$WHITESPACE_RE\]/gc) { # Value push @$array, $self->_decode_value(); # Separator redo if m/\G$WHITESPACE_RE,/gc; # End last if m/\G$WHITESPACE_RE\]/gc; # Invalid character $self->_exception('Expected comma or right square bracket while parsing array'); } return $array; } sub _decode_object { my $self = shift; my $hash = $self->_new_hash; until (m/\G$WHITESPACE_RE\}/gc) { # Quote m/\G$WHITESPACE_RE"/gc or $self->_exception('Expected string while parsing object'); # Key my $key = $self->_decode_string(); # Colon m/\G$WHITESPACE_RE:/gc or $self->_exception('Expected colon while parsing object'); # Value $hash->{$key} = $self->_decode_value(); # Separator redo if m/\G$WHITESPACE_RE,/gc; # End last if m/\G$WHITESPACE_RE\}/gc; # Invalid character $self->_exception('Expected comma or right curly bracket while parsing object'); } return $hash; } sub _decode_string { my $self = shift; my $pos = pos; # Extract string with escaped characters m#\G(((?:[^\x00-\x1F\\"]|\\(?:["\\/bfnrt]|u[[:xdigit:]]{4})){0,32766})*)#gc; my $str = $1; # Missing quote unless (m/\G"/gc) { $self->_exception('Unexpected character or invalid escape while parsing string') if m/\G[\x00-\x1F\\]/; $self->_exception('Unterminated string'); } # Unescape popular characters if (index($str, '\\u') < 0) { $str =~ s!\\(["\\/bfnrt])!$ESCAPE{$1}!gs; return $str; } # Unescape everything else my $buffer = ''; while ($str =~ m/\G([^\\]*)\\(?:([^u])|u(.{4}))/gc) { $buffer .= $1; # Popular character if ($2) { $buffer .= $ESCAPE{$2} } # Escaped else { my $ord = hex $3; # Surrogate pair if (($ord & 0xF800) == 0xD800) { # High surrogate ($ord & 0xFC00) == 0xD800 or pos($_) = $pos + pos($str), $self->_exception('Missing high-surrogate'); # Low surrogate $str =~ m/\G\\u([Dd][C-Fc-f]..)/gc or pos($_) = $pos + pos($str), $self->_exception('Missing low-surrogate'); # Pair $ord = 0x10000 + ($ord - 0xD800) * 0x400 + (hex($1) - 0xDC00); } # Character $buffer .= pack 'U', $ord; } } # The rest return $buffer . substr $str, pos($str), length($str); } sub _decode_value { my $self = shift; # Leading whitespace m/\G$WHITESPACE_RE/gc; # String return $self->_decode_string() if m/\G"/gc; # Array return $self->_decode_array() if m/\G\[/gc; # Object return $self->_decode_object() if m/\G\{/gc; # Number return 0 + $1 if m/\G([-]?(?:0|[1-9][0-9]*)(?:\.[0-9]*)?(?:[eE][+-]?[0-9]+)?)/gc; # True return $self->true if m/\Gtrue/gc; # False return $self->false if m/\Gfalse/gc; # Null return undef if m/\Gnull/gc; ## no critic (return) # Invalid data $self->_exception('Expected string, array, object, number, boolean or null'); } sub _encode_array { my $self = shift; return "[]" unless @{$_[0]}; return '[' . join(',', map { $self->_encode_values($_) } @{shift()}) . ']' unless exists $self->{_indent}; my $indent = $self->{_indent}; return "\[\n$indent\t" . join(",\n$indent\t", map { local $self->{_indent} = "$indent\t"; $self->_encode_values($_) } @{shift()}) . "\n$indent\]"; } sub _encode_object { my $self = shift; my $object = shift; my $indent; if (exists $self->{_indent}) { $indent = $self->{_indent}; $self->{_indent} .= "\t"; } # Encode pairs my @pairs; my $space = defined $indent ? q( ) : q(); while (my ($k, $v) = each %$object) { push @pairs, sprintf( '%s:%s%s', $self->_encode_string($k), $space, $self->_encode_values($v), ); } if (defined $indent) { $self->{_indent} =~ s/^.//; return "{}" unless @pairs; return "\{\n$indent\t" . join(",\n$indent\t", @pairs) . "\n$indent\}"; } else { return '{' . join(',', @pairs) . '}'; } } sub _encode_string { my $self = shift; my $string = shift; # Escape string $string =~ s!([\x00-\x1F\x7F\x{2028}\x{2029}\\"/\b\f\n\r\t])!$REVERSE{$1}!gs; # Stringify return "\"$string\""; } sub _encode_values { my $self = shift; my $value = shift; # Reference if (my $ref = ref $value) { # Array return $self->_encode_array($value) if $ref eq 'ARRAY'; # Object return $self->_encode_object($value) if $ref eq 'HASH'; # True or false return $$value ? 'true' : 'false' if $ref eq 'SCALAR'; return $value ? 'true' : 'false' if $ref eq 'JSON::Tiny::_Bool'; # Blessed reference with TO_JSON method if (Scalar::Util::blessed $value && (my $sub = $value->can('TO_JSON'))) { return $self->_encode_values($value->$sub); } } # Null return 'null' unless defined $value; # Number return 0 + $value if B::svref_2object(\$value)->FLAGS & (B::SVp_IOK | B::SVp_NOK); # String return $self->_encode_string($value); } sub _exception { my $self = shift; # Leading whitespace m/\G$WHITESPACE_RE/gc; # Context my $context = 'Malformed JSON: ' . shift; if (m/\G\z/gc) { $context .= ' before end of data' } else { my @lines = split /\n/, substr($_, 0, pos); $context .= ' at line ' . @lines . ', offset ' . length(pop @lines || ''); } # Throw die "$context\n"; } } { package JSON::Tiny::_Bool; no warnings; use overload '0+' => sub { ${$_[0]} }, '""' => sub { ${$_[0]} }, fallback => 1, ; sub DOES { my ($proto, $role) = @_; return 1 if $role eq 'Mojo::JSON::_Bool'; return 1 if $role =~ /^JSON::(?:PP::|XS::)?Boolean$/; return $proto->SUPER::DOES($role); } } 1; __END__ =head1 NAME JSON::Tiny::Subclassable =head1 DESCRIPTION Although technically this is a subclass of L, in practice it's a fork because it overrides every method, and never calls the supermethods. In fact, even though this is a subclass of L, you don't need to have the latter installed to use this module. The main difference between this module and its parent is that all the internal calls to private functions have been replaces with calls to private methods. This makes it easy to override particular parts of the JSON parsing/generation algorithm. The other tiny added feature is to support pretty indented output. This module was written was to make developing L simpler, but it may be of some use for other purposes as well. JSON::Tiny::Subclassable is a subclass of L, which is itself a fork of L. Except where noted, the methods listed below behave identically to the methods of the same names in the superclass. =head2 Constructor =over =item C<< new(%attributes) >> =back =head2 Attributes =over =item C<< pretty >> If set to true, indents generated JSON in a pretty fashion. =item C<< error >> =back =head2 Methods =over =item C<< decode($bytes) >> =item C<< encode($ref) >> =item C<< false >> =item C<< true >> =item C<< DOES($role) >> As per L::C. Returns true for L. =back =head2 Functions =over =item C<< j(\@array) >> / C<< j(\%hash) >> / C<< j($bytes) >> Encode or decode JSON as applicable. This function may be exported, but is not exported by default. You may request to import it with a different name: use JSON::Tiny::Subclassable j => { -as => 'quick_json' }; =back =head1 BUGS Please report any bugs to L. =head1 SEE ALSO L, L. =head1 AUTHORS David J. Oswald. Toby Inkster Etobyink@cpan.orgE. =head1 COPYRIGHT AND LICENCE This software is copyright (c) 2012-2013 by Toby Inkster. Portions copyright 2012-2013 David J. Oswald. 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. MultiValueOrdered.pm000644001750001750 1655113613525654 22625 0ustar00taitai000000000000JSON-MultiValueOrdered-0.006/lib/Tie/Hashuse 5.008; use strict; use warnings; { package Tie::Hash::MultiValueOrdered; our $AUTHORITY = 'cpan:TOBYINK'; our $VERSION = '0.006'; use constant { IDX_DATA => 0, IDX_ORDER => 1, IDX_LAST => 2, IDX_SEEN => 3, IDX_MODE => 4, NEXT_IDX => 5, }; use constant { MODE_LAST => -1, MODE_FIRST => 0, MODE_REF => 'ref', MODE_ITER => 'iter', }; sub fetch_first { $_[0][IDX_MODE] = MODE_FIRST } sub fetch_last { $_[0][IDX_MODE] = MODE_LAST } sub fetch_list { $_[0][IDX_MODE] = MODE_REF } sub fetch_iterator { $_[0][IDX_MODE] = MODE_ITER } sub TIEHASH { my $class = shift; bless [{}, [], 0, {}, -1], $class; } sub STORE { my ($tied, $key, $value) = @_; $key = "$key"; push @{$tied->[IDX_ORDER]}, $key; push @{$tied->[IDX_DATA]{$key}}, $value; } sub FETCH { my ($tied, $key) = @_; my $mode = $tied->[IDX_MODE]; if ($mode eq 'ref') { return $tied->[IDX_DATA]{$key} || []; } elsif ($mode eq 'iter') { my @values = @{ $tied->[IDX_DATA]{$key} || [] }; return sub { shift @values }; } else { return unless exists $tied->[IDX_DATA]{"$key"}; return $tied->[IDX_DATA]{$key}[$mode]; } } sub EXISTS { my ($tied, $key) = @_; return exists $tied->[IDX_DATA]{"$key"}; } sub DELETE { my ($tied, $key) = @_; my $r = delete $tied->[IDX_DATA]{"$key"}; return $r->[-1] if $r; return; } sub CLEAR { my $tied = shift; $tied->[IDX_DATA] = {}; $tied->[IDX_ORDER] = []; $tied->[IDX_LAST] = 0; $tied->[IDX_SEEN] = {}; return; } sub FIRSTKEY { my $tied = shift; $tied->[IDX_LAST] = -1; $tied->[IDX_SEEN] = {}; return $tied->NEXTKEY; } sub NEXTKEY { no warnings qw(uninitialized); my $tied = shift; my $i = ++$tied->[IDX_LAST]; $i++ while $tied->[IDX_SEEN]{ $tied->[IDX_ORDER][$i] }; $tied->[IDX_SEEN]{ $tied->[IDX_ORDER][$i] }++; my $key = $tied->[IDX_ORDER][$i]; if (wantarray) { return ( $tied->[IDX_ORDER][$i], $tied->FETCH( $tied->[IDX_ORDER][$i] ), ); } return $tied->[IDX_ORDER][$i]; } sub get { my ($tied, $key) = @_; return my @list = @{ $tied->[IDX_DATA]{"$key"} || [] }; } # not deep clone but data clone sub _dclone { my $tied = shift; my %data; while (my ($key, $value) = each %{$tied->[IDX_DATA]}) { $data{$key} = [@$value]; } \%data; } sub pairs { my $tied = shift; my %clone = %{ $tied->_dclone }; return map { $_, shift @{$clone{$_}} } @{$tied->[IDX_ORDER]} } sub pair_refs { my $tied = shift; my %clone = %{ $tied->_dclone }; return map { [ $_, shift @{$clone{$_}} ] } @{$tied->[IDX_ORDER]} } sub all_keys { my $tied = shift; return @{$tied->[IDX_ORDER]}; } sub keys { my $tied = shift; my %seen; return grep { not $seen{$_}++ } @{$tied->[IDX_ORDER]}; } sub rr_keys { my $tied = shift; my %seen; return reverse grep { not $seen{$_}++ } reverse @{$tied->[IDX_ORDER]}; } sub all_values { my $tied = shift; my $alt = 1; return grep { $alt=!$alt } $tied->pairs; } sub values { my $tied = shift; return map { $tied->[IDX_DATA]{$_}[-1] } $tied->keys; } sub rr_values { my $tied = shift; return map { $tied->[IDX_DATA]{$_}[0] } $tied->keys; } } 1; __END__ =head1 NAME Tie::Hash::MultiValueOrdered - hash with multiple values per key, and ordered keys =head1 SYNOPSIS use Test::More; use Tie::Hash::MultiValueOrdered; my $tied = tie my %hash, "Tie::Hash::MultiValueOrdered"; $hash{a} = 1; $hash{b} = 2; $hash{a} = 3; $hash{b} = 4; # Order of keys is predictable is_deeply( [ keys %hash ], [ qw( a b ) ], ); # Order of values is predictable # Note that the last values of 'a' and 'b' are returned. is_deeply( [ values %hash ], [ qw( 3 4 ) ], ); # Can retrieve list of all key-value pairs is_deeply( [ $tied->pairs ], [ qw( a 1 b 2 a 3 b 4 ) ], ); # Switch the retrieval mode for the hash. $tied->fetch_first; # Now the first values of 'a' and 'b' are returned. is_deeply( [ values %hash ], [ qw( 1 2 ) ], ); # Switch the retrieval mode for the hash. $tied->fetch_list; # Now arrayrefs are returned. is_deeply( [ values %hash ], [ [1,3], [2,4] ], ); # Restore the default retrieval mode for the hash. $tied->fetch_last; done_testing; =head1 DESCRIPTION A hash tied to this class acts more or less like a standard hash, except that when you assign a new value to an existing key, the old value is retained underneath. An explicit C deletes all values associated with a key. By default, the old values are inaccessible through the hash interface, but can be retrieved via the tied object: my @values = tied(%hash)->get($key); However, the C<< fetch_* >> methods provide a means to alter the behaviour of the hash. =head2 Tied Object Methods =over =item C<< pairs >> Returns all the hash's key-value pairs (including duplicates) as a flattened list. =item C<< pair_refs >> Returns all the hash's key-value pairs (including duplicates) as a list of two item arrayrefs. =item C<< get($key) >> Returns the list of all values associated with a key. =item C<< keys >> The list of all hash keys in their original order. Where a key is duplicated, only the first occurance is returned. =item C<< rr_keys >> The list of all hash keys in their original order. Where a key is duplicated, only the last occurance is returned. =item C<< all_keys >> The list of all hash keys in their original order, including duplicates. =item C<< values >> The values correponding to C. =item C<< rr_values >> The values correponding to C. =item C<< all_values >> The values correponding to C. =back =head2 Fetch Styles =over =item C<< fetch_last >> This is the default style of fetching. tie my %hash, "Tie::Hash::MultiValueOrdered"; $hash{a} = 1; $hash{b} = 2; $hash{b} = 3; tied(%hash)->fetch_last; is($hash{a}, 1); is($hash{b}, 3); =item C<< fetch_first >> tie my %hash, "Tie::Hash::MultiValueOrdered"; $hash{a} = 1; $hash{b} = 2; $hash{b} = 3; tied(%hash)->fetch_first; is($hash{a}, 1); is($hash{b}, 2); =item C<< fetch_list >> tie my %hash, "Tie::Hash::MultiValueOrdered"; $hash{a} = 1; $hash{b} = 2; $hash{b} = 3; tied(%hash)->fetch_first; is_deeply($hash{a}, [1]); is_deeply($hash{b}, [2, 3]); =item C<< fetch_iterator >> This fetch style is experimental and subject to change. tie my %hash, "Tie::Hash::MultiValueOrdered"; $hash{a} = 1; $hash{b} = 2; $hash{b} = 3; tied(%hash)->fetch_iterator; my $A = $hash{a}; my $B = $hash{b}; is($A->(), 1); is($B->(), 2); is($B->(), 3); =back =head1 BUGS Please report any bugs to L. =head1 SEE ALSO L, L, L. =head1 AUTHOR Toby Inkster Etobyink@cpan.orgE. =head1 COPYRIGHT AND LICENCE This software is copyright (c) 2012-2013 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.