libunicode-stringprep-perl-1.104+dfsg.orig/0000755000175000017500000000000011773612617020152 5ustar gregoagregoalibunicode-stringprep-perl-1.104+dfsg.orig/LICENSE0000444000175000017500000004375211670230013021146 0ustar gregoagregoaThis software is copyright (c) 2011 by Claus Färber . 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) 2011 by Claus Färber . 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) 2011 by Claus Färber . 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 libunicode-stringprep-perl-1.104+dfsg.orig/MANIFEST0000444000175000017500000000110211773612617021273 0ustar gregoagregoaREADME Changes LICENSE MANIFEST Build.PL Makefile.PL lib/Unicode/Stringprep.pm lib/Unicode/Stringprep/BiDi.pm lib/Unicode/Stringprep/Mapping.pm lib/Unicode/Stringprep/Prohibited.pm lib/Unicode/Stringprep/Unassigned.pm lib/Unicode/Stringprep/_Common.pm t/00_use.t t/01_references.t t/10_pod_check.t t/11_pod_coverage.t t/30_mappings.t t/31_prohibited_characters.t t/31_prohibited_characters_extra.t t/32_nfkc_3_2.t t/99_perl-5.11.3.t t/saslprep.t t/saslprep_bytes.t eg/Readme-Examples.pod eg/Nameprep.pm eg/SASLprep.pm META.yml META.json SIGNATURE Added here by Module::Build libunicode-stringprep-perl-1.104+dfsg.orig/Changes0000444000175000017500000000325311670230013021424 0ustar gregoagregoaRevision history for Perl extension Unicode::Stringprep 1.104 (2011-12-08) - FIXES: #72615 faulty data in Build.PL causes a lack of meta files, which breaks carton. 1.103 (2010-01-16) - fix 'couldn't find diagnostic data' in tests on some machines 1.102 (2010-01-09) - fix utf8 warning in _NFKC_3_2 1.101 (2010-01-03) - fix v-string warning on perl >= 5.10 1.100 (2010-01-01) - release as 1.10 1.09_70091231 (2009-12-28) - add support for stored strings 1.09_70091230 (2009-12-28) - add 3.2-compatible normalization 1.09_70091228 Dec 26 00:00:00 2009 - add tests for automatic promotion to utf8 (bytes input) - warn with old perls < 5.8.3 1.09_70091227 Dec 26 00:00:00 2009 (broken) - re-enable some tests for 5.6.x (broken) 1.09_70091226 Dec 26 00:00:00 2009 - switch to Module::Build - only use ASCII in POD, fixes FAILs with perl 5.6.x 1.02 Sun Dec 13 00:00:00 2009 - FIXES: #52734: Undeclared dependency on Test::NoWarnings reported by ANDK 1.01 Thu Dec 10 00:00:00 2009 - release 1.00_20080919 as 1.01 - add Example.pod - add dist signature - add LICENSE file 1.00_20080919 Sat Sep 19 00:00:00 2008 - fixed compile error on Solaris 2.11 (i86pc-solaris-64int) - add SIGNATURE - pod cleanup 1.00 Fri Oct 12 00:00:00 2007 - first release - cleanup 0.99_20071004 Thu Oct 04 00:00:00 2007 - better 5.6.x compatibility II - skip some tests for perl versions <5.8.3. 0.99_20070927 Fri Sep 28 00:00:00 2007 - better 5.6.x compatibility - better performance (using regular expression) 0.99_20070922 Wed Sep 22 00:00:00 2007 - first public developer release - based on RFC 3454, includes test vectors from Internet Draft draft-josefsson-idn-test-vectors-00. libunicode-stringprep-perl-1.104+dfsg.orig/Build.PL0000444000175000017500000000134411670230013021424 0ustar gregoagregoa#!/usr/bin/perl use 5.006; use strict; use Module::Build; my $b = Module::Build->new( 'module_name' => 'Unicode::Stringprep', 'license' => 'perl', 'dist_author' => 'Claus Färber ', 'dist_abstract' => 'Preparation of Internationalized Strings (RFC 3454)', 'sign' => 1, 'create_license' => 1, 'create_makefile_pl' => 'traditional', 'requires' => { 'Unicode::Normalize' => 1, 'perl' => 5.008003, }, 'build_requires' => { 'Test::NoWarnings' => 0, 'Test::More' => 0, }, 'no_index' => { 'directory' => ['eg'], }, 'resources' => { 'homepage' => 'http://search.cpan.org/dist/Unicode-Stringprep', 'repository' => 'http://github.com/cfaerber/Unicode-Stringprep', }, ); $b->create_build_script; libunicode-stringprep-perl-1.104+dfsg.orig/README0000444000175000017500000000240711670230013021011 0ustar gregoagregoaNAME Unicode::Stringprep - Preparation of Internationalized Strings (RFC 3454) DESCRIPTION This module implements the stringprep framework for preparing Unicode text strings in order to increase the likelihood that string input and string comparison work in ways that make sense for typical users throughout the world. The stringprep protocol is useful for protocol identifier values, company and personal names, internationalized domain names, and other text strings. The stringprep framework does not specify how protocols should prepare text strings. Protocols must create profiles of stringprep in order to fully specify the processing options. INSTALLATION To install this module type the following: perl Build.PL ./Build ./Build test ./Build install DEPENDENCIES This module requires these other modules and libraries: Unicode::Normalize (core module of perl 5.8.x and higher) PERL VERSION You should use perl 5.8.3 or higher. There are limitations with perl 5.6.x; please read the POD for more details. AUTHOR Claus Färber ACKNOWLEDGMENTS P. Hoffman (editor of RFC 3454) M. Blanchet (editor of RFC 3454) S. Josefsson (draft-josefsson-idn-test-vectors-00.txt) libunicode-stringprep-perl-1.104+dfsg.orig/eg/0000755000175000017500000000000011670230013020523 5ustar gregoagregoalibunicode-stringprep-perl-1.104+dfsg.orig/eg/SASLprep.pm0000444000175000017500000000231211670230013022506 0ustar gregoagregoapackage Acme::Examples::Authen::SASL::SASLprep; use strict; use utf8; use warnings; require 5.006_000; our $VERSION = '1.00'; $VERSION = eval $VERSION; require Exporter; our @ISA = qw(Exporter); our @EXPORT = qw(saslprep); use Unicode::Stringprep; use Unicode::Stringprep::Mapping; use Unicode::Stringprep::Prohibited; my %C12_to_SPACE = (); for(my $pos=0; $pos <= $#Unicode::Stringprep::Prohibited::C12; $pos+=2) { for(my $char = $Unicode::Stringprep::Prohibited::C12[$pos]; defined $Unicode::Stringprep::Prohibited::C12[$pos] && $char <= $Unicode::Stringprep::Prohibited::C12[$pos]; $char++) { $C12_to_SPACE{$char} = ' '; } }; *saslprep = Unicode::Stringprep->new( 3.2, [ \@Unicode::Stringprep::Mapping::B1, \%C12_to_SPACE ], 'KC', [ \@Unicode::Stringprep::Prohibited::C12, \@Unicode::Stringprep::Prohibited::C21, \@Unicode::Stringprep::Prohibited::C22, \@Unicode::Stringprep::Prohibited::C3, \@Unicode::Stringprep::Prohibited::C4, \@Unicode::Stringprep::Prohibited::C5, \@Unicode::Stringprep::Prohibited::C6, \@Unicode::Stringprep::Prohibited::C7, \@Unicode::Stringprep::Prohibited::C8, \@Unicode::Stringprep::Prohibited::C9, ], 1 ); 1; libunicode-stringprep-perl-1.104+dfsg.orig/eg/Nameprep.pm0000444000175000017500000000154211670230013022630 0ustar gregoagregoapackage Acme::Examples::Net::IDN::Nameprep; use strict; use utf8; use warnings; require 5.006_000; our $VERSION = '1.00'; $VERSION = eval $VERSION; require Exporter; our @ISA = qw(Exporter); our @EXPORT = qw(nameprep); use Unicode::Stringprep; use Unicode::Stringprep::Mapping; use Unicode::Stringprep::Prohibited; *nameprep = Unicode::Stringprep->new( 3.2, [ @Unicode::Stringprep::Mapping::B1, @Unicode::Stringprep::Mapping::B2 ], 'KC', [ @Unicode::Stringprep::Prohibited::C12, @Unicode::Stringprep::Prohibited::C22, @Unicode::Stringprep::Prohibited::C3, @Unicode::Stringprep::Prohibited::C4, @Unicode::Stringprep::Prohibited::C5, @Unicode::Stringprep::Prohibited::C6, @Unicode::Stringprep::Prohibited::C7, @Unicode::Stringprep::Prohibited::C8, @Unicode::Stringprep::Prohibited::C9 ], 1, ); 1; libunicode-stringprep-perl-1.104+dfsg.orig/eg/Readme-Examples.pod0000444000175000017500000000055311670230013024201 0ustar gregoagregoa=head1 README These examples have been simplified. For more elaborate examples including examples for documentation, see L and L. If you want to write a perl distribution implementing a Stringprep profile, the easiest way is to fork L from L. libunicode-stringprep-perl-1.104+dfsg.orig/t/0000755000175000017500000000000011773612617020415 5ustar gregoagregoalibunicode-stringprep-perl-1.104+dfsg.orig/t/01_references.t0000444000175000017500000000052711670230013023203 0ustar gregoagregoause strict; use utf8; use Test::More tests => 4; use Test::NoWarnings; use Unicode::Stringprep; my $prep = Unicode::Stringprep->new( 3.2, [ ], '', [ ], 0 ); is(ref $prep, 'Unicode::Stringprep', 'bless you'); *prep = $prep; is(eval { prep('TEST') }, 'TEST', 'direct call'); is(eval { $prep->('TEST') }, 'TEST', 'indirect call'); libunicode-stringprep-perl-1.104+dfsg.orig/t/30_mappings.t0000444000175000017500000000075511670230013022705 0ustar gregoagregoause strict; use utf8; no warnings 'utf8'; use Test::More; use Test::NoWarnings; use Unicode::Stringprep; our @data = ( [ 0x0000 => '^@' ], [ 0x0001 => '^A' ], [ 0x0041 => 'a' ], [ 0x00DF => 'ss' ], [ 0x123 => "ä" ], [ 0x20AC => 'EUR' ], [ 0x10FFFF => '#' ], ); plan tests => ($#data+1) + 1; my $prep = Unicode::Stringprep->new( 3.2, [ @data ], '', [ ], 0 ); foreach(@data) { my ($in,$out) = @{$_}; is($prep->(chr($in)), $out, sprintf 'U+%04X', $in); } libunicode-stringprep-perl-1.104+dfsg.orig/t/31_prohibited_characters_extra.t0000444000175000017500000000066311670230013026621 0ustar gregoagregoause strict; use utf8; no warnings 'utf8'; use Test::More; use Test::NoWarnings; use Unicode::Stringprep; our @map_data = ( 0xE0001, 0xE0001, 0xE0020, 0xE007F, 0xEFFFE, 0x10FFFF, ); our @data = ( 0xE0002, ); plan tests => ($#data+1) + 1; my $prep = Unicode::Stringprep->new( 3.2, [ ], '', [ @map_data ], 0 ); foreach(@data) { my $in = $_; is( eval { $prep->(chr($in)) }, chr($in), sprintf 'U+%04X', $in); } libunicode-stringprep-perl-1.104+dfsg.orig/t/saslprep_bytes.t0000444000175000017500000000334311670230013023620 0ustar gregoagregoause strict; use bytes; # !!! use Test::More; use Test::NoWarnings; use Unicode::Stringprep; our @strprep = ( # test vectors from RFC 4013, section 3. # [ "I\xADX", 'IX', 'SOFT HYPHEN mapped to nothing' ], [ 'user', 'user', 'no transformation' ], [ 'USER', 'USER', 'case preserved, will not match #2' ], [ "\xAA", 'a', 'output is NFKC, input in ISO 8859-1' ], [ "\x07", undef, 'Error - prohibited character' ], # some more tests # [ 'ÄÖÜß', 'ÄÖÜß', 'German umlaut case preserved' ], [ 'äöüß', 'äöüß', 'German umlaut case preserved' ], [ " ", ' ', 'no-break space mapped to ASCII space' ], [ "\xA0  ", ' ', 'no space collapsing' ], ); plan tests => ($#strprep+1) + 1; my %C12_to_SPACE = (); for(my $pos=0; $pos <= $#Unicode::Stringprep::Prohibited::C12; $pos+=2) { for(my $char = $Unicode::Stringprep::Prohibited::C12[$pos]; defined $Unicode::Stringprep::Prohibited::C12[$pos] && $char <= $Unicode::Stringprep::Prohibited::C12[$pos]; $char++) { $C12_to_SPACE{$char} = ' '; } }; *saslprep = Unicode::Stringprep->new( 3.2, [ \@Unicode::Stringprep::Mapping::B1, \%C12_to_SPACE ], 'KC', [ \@Unicode::Stringprep::Prohibited::C12, \@Unicode::Stringprep::Prohibited::C21, \@Unicode::Stringprep::Prohibited::C22, \@Unicode::Stringprep::Prohibited::C3, \@Unicode::Stringprep::Prohibited::C4, \@Unicode::Stringprep::Prohibited::C5, \@Unicode::Stringprep::Prohibited::C6, \@Unicode::Stringprep::Prohibited::C7, \@Unicode::Stringprep::Prohibited::C8, \@Unicode::Stringprep::Prohibited::C9, ], 1 ); foreach my $test (@strprep) { my ($in,$out,$comment) = @{$test}; is(eval{saslprep($in)}, $out, $comment); } libunicode-stringprep-perl-1.104+dfsg.orig/t/10_pod_check.t0000444000175000017500000000021711670230013022775 0ustar gregoagregoause strict; use Test::More; eval "use Test::Pod 1.00"; plan skip_all => "Test::Pod 1.00 required for testing POD" if $@; all_pod_files_ok(); libunicode-stringprep-perl-1.104+dfsg.orig/t/11_pod_coverage.t0000444000175000017500000000030711670230013023514 0ustar gregoagregoause strict; use Test::More; eval "use Test::Pod::Coverage;"; plan skip_all => "Test::Pod::Coverage required for testing POD coverage" if $@; all_pod_coverage_ok( 'all modules are covered by POD' ) libunicode-stringprep-perl-1.104+dfsg.orig/t/99_perl-5.11.3.t0000444000175000017500000000207311670230013022566 0ustar gregoagregoause strict; use utf8; no warnings 'utf8'; use Test::More tests => 14; use Test::NoWarnings; use Unicode::Normalize; is( Unicode::Normalize::NFKC("\x{1FFF}"), "\x{1FFF}", 'U+1FFF' ); is( Unicode::Normalize::NFKC("\x{2000}"), " ", 'U+2000 EN QUAD' ); is( Unicode::Normalize::NFKC("\x{2001}"), " ", 'U+2001 EM SPACE' ); is( Unicode::Normalize::NFKC("\x{2002}"), " ", 'U+2002 EN SPACE' ); is( Unicode::Normalize::NFKC("\x{2003}"), " ", 'U+2003 EM SPACE' ); is( Unicode::Normalize::NFKC("\x{2004}"), " ", 'U+2004 THREE-PER-EM SPACE' ); is( Unicode::Normalize::NFKC("\x{2005}"), " ", 'U+2005 FOUR-PER-EM SPACE' ); is( Unicode::Normalize::NFKC("\x{2006}"), " ", 'U+2006 SIX-PER-EM SPACE' ); is( Unicode::Normalize::NFKC("\x{2007}"), " ", 'U+2007 FIGURE SPACE' ); is( Unicode::Normalize::NFKC("\x{2008}"), " ", 'U+2008 PUNCTUATION SPACE' ); is( Unicode::Normalize::NFKC("\x{2009}"), " ", 'U+2009 THIN SPACE' ); is( Unicode::Normalize::NFKC("\x{200A}"), " ", 'U+200A HAIR SPACE' ); is( Unicode::Normalize::NFKC("\x{200B}"), "\x{200B}", 'U+200B ZERO WIDTH SPACE' ); libunicode-stringprep-perl-1.104+dfsg.orig/t/31_prohibited_characters.t0000444000175000017500000000065511670230013025417 0ustar gregoagregoause strict; use utf8; no warnings 'utf8'; use Test::More; use Test::NoWarnings; use Unicode::Stringprep; our @data = ( 0x0000, 0x0001, 0x0041, 0x004F, 0x00DF, 0x123, 0x20AC, 0xD800, 0x10F000, 0x10FFFF, ); plan tests => ($#data+1) + 1; my $prep = Unicode::Stringprep->new( 3.2, [ ], '', [ @data ], 0 ); foreach(@data) { my $in = $_; is( eval { $prep->(chr($in)) }, undef, sprintf 'U+%04X', $in); } libunicode-stringprep-perl-1.104+dfsg.orig/t/00_use.t0000444000175000017500000000044611670230013021655 0ustar gregoagregoause strict; use Test::More tests=>6; use Test::NoWarnings; BEGIN { use_ok 'Unicode::Stringprep' } BEGIN { use_ok 'Unicode::Stringprep::Unassigned' } BEGIN { use_ok 'Unicode::Stringprep::Mapping' } BEGIN { use_ok 'Unicode::Stringprep::Prohibited' } BEGIN { use_ok 'Unicode::Stringprep::BiDi' } libunicode-stringprep-perl-1.104+dfsg.orig/t/32_nfkc_3_2.t0000444000175000017500000000324511670230013022452 0ustar gregoagregoause strict; use utf8; no warnings 'utf8'; use Test::More; use Test::NoWarnings; use Unicode::Stringprep; my @data; while() { my @c = map { s/^\s+|\s+$//g;$_; } split m/;/, $_, 3; push @data, \@c if $#c > 1; } plan tests => ($#data+1) + 2; ok($#data > 2, 'number of test patterns'); my $func = Unicode::Stringprep->new('3.2', undef, 'KC'); foreach my $d (@data) { $d->[2] = sprintf('U+%s - %s', uc($d->[0]), $d->[2]) unless $d->[0] =~ m/\s/; $d->[1] ||= $d->[0]; foreach my $c (0..1) { if($d->[$c] =~ m/undef/) { $d->[$c] = undef; next; } $d->[$c] = join '', map { chr hex $_ } grep { length($_) > 0 } split /\s+/, $d->[$c]; } is( eval{ $func->($d->[0]) }, $d->[1], $d->[2] ); }; exit(0); __DATA__ F951; 964B; Erroneous mapping (Corrigendum 3, corrected in Unicode 3.2) 2F868; 2136A; Erroneous mapping (Corrigendum 4, corrected in Unicode 4.0) 2F874; 5F33; Erroneous mapping (Corrigendum 4, corrected in Unicode 4.0) 2F91F; 43AB; Erroneous mapping (Corrigendum 4, corrected in Unicode 4.0) 2F95F; 7AAE; Erroneous mapping (Corrigendum 4, corrected in Unicode 4.0) 2F9BF; 4D57; Erroneous mapping (Corrigendum 4, corrected in Unicode 4.0) 2047; 3F 3F; DOUBLE QUESTION MARK (added in 3.2) 205F; 20; MEDIUM MATHEMATICAL SPACE (added in 3.2) 30FF; 30B3 30C8; KATAKANA DIGRAPH KOTO (added in 3.2) 2ADC; 2ADD 0338; FORKING (added in 3.2) 1D15E; 1D157 1D165; MUSICAL SYMBOL HALF NOTE (added in 3.1) 213B;; FACSIMILE SIGN (added in 4.0) 1EA5 35D 329;; No reordering for U+035D (added in 4.0) 0B47 0300 0B3E; undef; PR 29 test case 1 1100 0300 1161; undef; PR 29 test case 2 1100 0300 1161 0323; undef; PR 29 test case 2, expanded libunicode-stringprep-perl-1.104+dfsg.orig/t/saslprep.t0000444000175000017500000000403011670230013022404 0ustar gregoagregoause strict; use utf8; use Test::More; use Test::NoWarnings; use Unicode::Stringprep; our @strprep = ( # test vectors from RFC 4013, section 3. # [ "I\x{00AD}X", 'IX', 'SOFT HYPHEN mapped to nothing' ], [ 'user', 'user', 'no transformation' ], [ 'USER', 'USER', 'case preserved, will not match #2' ], [ "\x{00AA}", 'a', 'output is NFKC, input in ISO 8859-1' ], [ "\x{2168}", 'IX', 'output is NFKC, will match #1' ], [ "\x{0007}", undef, 'Error - prohibited character' ], [ "\x{0627}\x{0031}", undef, 'Error - bidirectional check' ], # some more tests # [ 'ÄÖÜß', 'ÄÖÜß', 'German umlaut case preserved' ], [ 'äöüß', 'äöüß', 'German umlaut case preserved' ], [ "\x{A0}", ' ', 'no-break space mapped to ASCII space' ], [ "\x{2009}", ' ', 'thin space mapped to ASCII space' ], [ "\x{3000}", ' ', 'ideographic space mapped to ASCII space' ], [ "\x{A0}\x{2009}\x{3000}", ' ', 'no space collapsing' ], ); plan tests => ($#strprep+1) + 1; my %C12_to_SPACE = (); for(my $pos=0; $pos <= $#Unicode::Stringprep::Prohibited::C12; $pos+=2) { for(my $char = $Unicode::Stringprep::Prohibited::C12[$pos]; defined $Unicode::Stringprep::Prohibited::C12[$pos] && $char <= $Unicode::Stringprep::Prohibited::C12[$pos]; $char++) { $C12_to_SPACE{$char} = ' '; } }; *saslprep = Unicode::Stringprep->new( 3.2, [ \@Unicode::Stringprep::Mapping::B1, \%C12_to_SPACE ], 'KC', [ \@Unicode::Stringprep::Prohibited::C12, \@Unicode::Stringprep::Prohibited::C21, \@Unicode::Stringprep::Prohibited::C22, \@Unicode::Stringprep::Prohibited::C3, \@Unicode::Stringprep::Prohibited::C4, \@Unicode::Stringprep::Prohibited::C5, \@Unicode::Stringprep::Prohibited::C6, \@Unicode::Stringprep::Prohibited::C7, \@Unicode::Stringprep::Prohibited::C8, \@Unicode::Stringprep::Prohibited::C9, ], 1 ); foreach my $test (@strprep) { my ($in,$out,$comment) = @{$test}; is(eval{saslprep($in)}, $out, $comment); } libunicode-stringprep-perl-1.104+dfsg.orig/lib/0000755000175000017500000000000011670230013020676 5ustar gregoagregoalibunicode-stringprep-perl-1.104+dfsg.orig/lib/Unicode/0000755000175000017500000000000011670230013022264 5ustar gregoagregoalibunicode-stringprep-perl-1.104+dfsg.orig/lib/Unicode/Stringprep.pm0000444000175000017500000004657011670230013024771 0ustar gregoagregoapackage Unicode::Stringprep; require 5.008_003; use strict; use utf8; use warnings; our $VERSION = "1.104"; $VERSION = eval $VERSION; require Exporter; our @ISA = qw(Exporter); our @EXPORT = qw(stringprep); use Carp; use Unicode::Normalize(); use Unicode::Stringprep::Unassigned; use Unicode::Stringprep::Mapping; use Unicode::Stringprep::Prohibited; use Unicode::Stringprep::BiDi; sub new { my $self = shift; my $class = ref($self) || $self; return bless _compile(@_), $class; } ## Here be eval dragons sub _compile { my $unicode_version = shift; my $mapping_tables = shift; my $unicode_normalization = uc shift; my $prohibited_tables = shift; my $bidi_check = shift; my $unassigned_check = shift; croak 'Unsupported Unicode version '.$unicode_version.'.' if $unicode_version != 3.2; my $mapping_sub = _compile_mapping($mapping_tables); my $normalization_sub = _compile_normalization($unicode_normalization); my $prohibited_sub = _compile_prohibited($prohibited_tables); my $bidi_sub = $bidi_check ? '_check_bidi($string)' : undef; my $unassigned_sub = $unassigned_check ? '_check_unassigned($string)' : undef; my $pr29_sub = (defined $normalization_sub) ? '_check_pr29($string)' : undef; my $code = "sub { no warnings 'utf8';". 'my $string = shift;'; $code .= '$string .= pack("U0");' if $] < 5.008; $code .= join('', map { $_ ? "{$_}\n" : ''} grep { defined $_ } $mapping_sub, $normalization_sub, $prohibited_sub, $bidi_sub, $unassigned_sub, $pr29_sub ). 'return $string;'. '}'; return eval $code || die $@; } ## generic compilation functions for matching/mapping characters ## sub _compile_mapping { my %map = (); sub _mapping_tables { my $map = shift; while(@_) { my $data = shift; if(ref($data) eq 'HASH') { %{$map} = (%{$map},%{$data}) } elsif(ref($data) eq 'ARRAY') { _mapping_tables($map,@{$data}) } elsif(defined $data){ $map->{$data} = shift }; } } _mapping_tables(\%map,@_); return '' if !%map; sub _compile_mapping_r { my $map = shift; if($#_ <= 7) { return (join '', (map { '$char == '.$_. ' ? "'.(join '', map { quotemeta($_); } ( $$map{$_} )).'"'. ' : ' } @_)).' die'; } else { my @a = splice @_, 0, int($#_/2); return '$char < '.$_[0].' ? ('. _compile_mapping_r($map,@a). ') : ('. _compile_mapping_r($map,@_). ')'; } }; my @from = sort { $a <=> $b } keys %map; return undef if !@from; return '$string =~ s/('._compile_set( map { $_ => $_ } @from).')/my $char = ord($1); '. _compile_mapping_r(\%map, @from).'/ge;', } sub _compile_set { my @collect = (); sub _set_tables { my $set = shift; while(@_) { my $data = shift; if(ref($data) eq 'HASH') { _set_tables($set, %{$data}); } elsif(ref($data) eq 'ARRAY') { _set_tables($set, @{$data}); } elsif(defined $data){ push @{$set}, [$data,shift || $data] }; } } _set_tables(\@collect,@_); # NB: This destroys @collect as it modifies the anonymous ARRAYs # referenced in @collect. # This is harmless as it only modifies ARRAYs after they've been # inspected. my @set = (); foreach my $d (sort { $a->[0]<=>$b->[0] } @collect) { if(!@set || $set[$#set]->[1]+1 < $d->[0]) { push @set, $d; } elsif($set[$#set]->[1] < $d->[1]) { $set[$#set]->[1] = $d->[1]; } } return undef if !@set; return '['.join('', map { sprintf( $_->[0] >= $_->[1] ? "\\x{%X}" : "\\x{%X}-\\x{%X}", @{$_}) } @set ).']'; } ## specific functions for individual stringprep steps ## sub _compile_normalization { my $unicode_normalization = uc shift; $unicode_normalization =~ s/^NF//; return '$string = _NFKC_3_2($string)' if $unicode_normalization eq 'KC'; return undef if !$unicode_normalization; croak 'Unsupported Unicode normalization (NF)'.$unicode_normalization.'.'; } my $is_Unassigned = _compile_set(@Unicode::Stringprep::Unassigned::A1); sub _NFKC_3_2 { my $string = shift; ## pre-map characters corrected in Corrigendum #4 ## no warnings 'utf8'; $string =~ tr/\x{2F868}\x{2F874}\x{2F91F}\x{2F95F}\x{2F9BF}/\x{2136A}\x{5F33}\x{43AB}\x{7AAE}\x{4D57}/; ## only normalize runs of assigned characters ## my @s = split m/($is_Unassigned+)/o, $string; for( my $i = 0; $i <= $#s ; $i+=2 ) { # skips delimiters == is_Unassigned no warnings 'utf8'; $s[$i] = Unicode::Normalize::NFKC($s[$i]); } return join '', @s; } sub _check_unassigned { if( shift =~ m/($is_Unassigned)/os ) { die sprintf("unassigned character U+%04X",ord($1)); } } sub _compile_prohibited { my $prohibited = _compile_set(@_); if($prohibited) { return 'if($string =~ m/('.$prohibited.')/os) {'. 'die sprintf("prohibited character U+%04X",ord($1))'. '}'; } } my $is_RandAL = _compile_set(@Unicode::Stringprep::BiDi::D1); my $is_L = _compile_set(@Unicode::Stringprep::BiDi::D2); sub _check_bidi { my $string = shift; if($string =~ m/$is_RandAL/os) { if($string =~ m/$is_L/os) { die "string contains both RandALCat and LCat characters" } elsif($string !~ m/^(?:$is_RandAL)/os) { die "string contains RandALCat character but does not start with one" } elsif($string !~ m/(?:$is_RandAL)$/os) { die "string contains RandALCat character but does not end with one" } } } my $is_Combining = _compile_set( 0x0300,0x0314, 0x0316,0x0319, 0x031C,0x0320, 0x0321,0x0322, 0x0323,0x0326, 0x0327,0x0328, 0x0329,0x0333, 0x0334,0x0338, 0x0339,0x033C, 0x033D,0x0344, 0x0347,0x0349, 0x034A,0x034C, 0x034D,0x034E, 0x0360,0x0361, 0x0363,0x036F, 0x0483,0x0486, 0x0592,0x0595, 0x0597,0x0599, 0x059C,0x05A1, 0x05A3,0x05A7, 0x05A8,0x05A9, 0x05AB,0x05AC, 0x0653,0x0654, 0x06D6,0x06DC, 0x06DF,0x06E2, 0x06E7,0x06E8, 0x06EB,0x06EC, 0x0732,0x0733, 0x0735,0x0736, 0x0737,0x0739, 0x073B,0x073C, 0x073F,0x0741, 0x0749,0x074A, 0x0953,0x0954, 0x0E38,0x0E39, 0x0E48,0x0E4B, 0x0EB8,0x0EB9, 0x0EC8,0x0ECB, 0x0F18,0x0F19, 0x0F7A,0x0F7D, 0x0F82,0x0F83, 0x0F86,0x0F87, 0x20D0,0x20D1, 0x20D2,0x20D3, 0x20D4,0x20D7, 0x20D8,0x20DA, 0x20DB,0x20DC, 0x20E5,0x20E6, 0x302E,0x302F, 0x3099,0x309A, 0xFE20,0xFE23, 0x1D165,0x1D166, 0x1D167,0x1D169, 0x1D16E,0x1D172, 0x1D17B,0x1D182, 0x1D185,0x1D189, 0x1D18A,0x1D18B, 0x1D1AA,0x1D1AD, map { ($_,$_) } 0x0315, 0x031A, 0x031B, 0x0345, 0x0346, 0x0362, 0x0591, 0x0596, 0x059A, 0x059B, 0x05AA, 0x05AD, 0x05AE, 0x05AF, 0x05B0, 0x05B1, 0x05B2, 0x05B3, 0x05B4, 0x05B5, 0x05B6, 0x05B7, 0x05B8, 0x05B9, 0x05BB, 0x05BC, 0x05BD, 0x05BF, 0x05C1, 0x05C2, 0x05C4, 0x064B, 0x064C, 0x064D, 0x064E, 0x064F, 0x0650, 0x0651, 0x0652, 0x0655, 0x0670, 0x06E3, 0x06E4, 0x06EA, 0x06ED, 0x0711, 0x0730, 0x0731, 0x0734, 0x073A, 0x073D, 0x073E, 0x0742, 0x0743, 0x0744, 0x0745, 0x0746, 0x0747, 0x0748, 0x093C, 0x094D, 0x0951, 0x0952, 0x09BC, 0x09CD, 0x0A3C, 0x0A4D, 0x0ABC, 0x0ACD, 0x0B3C, 0x0B4D, 0x0BCD, 0x0C4D, 0x0C55, 0x0C56, 0x0CCD, 0x0D4D, 0x0DCA, 0x0E3A, 0x0F35, 0x0F37, 0x0F39, 0x0F71, 0x0F72, 0x0F74, 0x0F80, 0x0F84, 0x0FC6, 0x1037, 0x1039, 0x1714, 0x1734, 0x17D2, 0x18A9, 0x20E1, 0x20E7, 0x20E8, 0x20E9, 0x20EA, 0x302A, 0x302B, 0x302C, 0x302D, 0xFB1E, 0x1D16D, ); my $is_HangulLV = _compile_set( map { ($_,$_) } 0xAC00, 0xAC1C, 0xAC38, 0xAC54, 0xAC70, 0xAC8C, 0xACA8, 0xACC4, 0xACE0, 0xACFC, 0xAD18, 0xAD34, 0xAD50, 0xAD6C, 0xAD88, 0xADA4, 0xADC0, 0xADDC, 0xADF8, 0xAE14, 0xAE30, 0xAE4C, 0xAE68, 0xAE84, 0xAEA0, 0xAEBC, 0xAED8, 0xAEF4, 0xAF10, 0xAF2C, 0xAF48, 0xAF64, 0xAF80, 0xAF9C, 0xAFB8, 0xAFD4, 0xAFF0, 0xB00C, 0xB028, 0xB044, 0xB060, 0xB07C, 0xB098, 0xB0B4, 0xB0D0, 0xB0EC, 0xB108, 0xB124, 0xB140, 0xB15C, 0xB178, 0xB194, 0xB1B0, 0xB1CC, 0xB1E8, 0xB204, 0xB220, 0xB23C, 0xB258, 0xB274, 0xB290, 0xB2AC, 0xB2C8, 0xB2E4, 0xB300, 0xB31C, 0xB338, 0xB354, 0xB370, 0xB38C, 0xB3A8, 0xB3C4, 0xB3E0, 0xB3FC, 0xB418, 0xB434, 0xB450, 0xB46C, 0xB488, 0xB4A4, 0xB4C0, 0xB4DC, 0xB4F8, 0xB514, 0xB530, 0xB54C, 0xB568, 0xB584, 0xB5A0, 0xB5BC, 0xB5D8, 0xB5F4, 0xB610, 0xB62C, 0xB648, 0xB664, 0xB680, 0xB69C, 0xB6B8, 0xB6D4, 0xB6F0, 0xB70C, 0xB728, 0xB744, 0xB760, 0xB77C, 0xB798, 0xB7B4, 0xB7D0, 0xB7EC, 0xB808, 0xB824, 0xB840, 0xB85C, 0xB878, 0xB894, 0xB8B0, 0xB8CC, 0xB8E8, 0xB904, 0xB920, 0xB93C, 0xB958, 0xB974, 0xB990, 0xB9AC, 0xB9C8, 0xB9E4, 0xBA00, 0xBA1C, 0xBA38, 0xBA54, 0xBA70, 0xBA8C, 0xBAA8, 0xBAC4, 0xBAE0, 0xBAFC, 0xBB18, 0xBB34, 0xBB50, 0xBB6C, 0xBB88, 0xBBA4, 0xBBC0, 0xBBDC, 0xBBF8, 0xBC14, 0xBC30, 0xBC4C, 0xBC68, 0xBC84, 0xBCA0, 0xBCBC, 0xBCD8, 0xBCF4, 0xBD10, 0xBD2C, 0xBD48, 0xBD64, 0xBD80, 0xBD9C, 0xBDB8, 0xBDD4, 0xBDF0, 0xBE0C, 0xBE28, 0xBE44, 0xBE60, 0xBE7C, 0xBE98, 0xBEB4, 0xBED0, 0xBEEC, 0xBF08, 0xBF24, 0xBF40, 0xBF5C, 0xBF78, 0xBF94, 0xBFB0, 0xBFCC, 0xBFE8, 0xC004, 0xC020, 0xC03C, 0xC058, 0xC074, 0xC090, 0xC0AC, 0xC0C8, 0xC0E4, 0xC100, 0xC11C, 0xC138, 0xC154, 0xC170, 0xC18C, 0xC1A8, 0xC1C4, 0xC1E0, 0xC1FC, 0xC218, 0xC234, 0xC250, 0xC26C, 0xC288, 0xC2A4, 0xC2C0, 0xC2DC, 0xC2F8, 0xC314, 0xC330, 0xC34C, 0xC368, 0xC384, 0xC3A0, 0xC3BC, 0xC3D8, 0xC3F4, 0xC410, 0xC42C, 0xC448, 0xC464, 0xC480, 0xC49C, 0xC4B8, 0xC4D4, 0xC4F0, 0xC50C, 0xC528, 0xC544, 0xC560, 0xC57C, 0xC598, 0xC5B4, 0xC5D0, 0xC5EC, 0xC608, 0xC624, 0xC640, 0xC65C, 0xC678, 0xC694, 0xC6B0, 0xC6CC, 0xC6E8, 0xC704, 0xC720, 0xC73C, 0xC758, 0xC774, 0xC790, 0xC7AC, 0xC7C8, 0xC7E4, 0xC800, 0xC81C, 0xC838, 0xC854, 0xC870, 0xC88C, 0xC8A8, 0xC8C4, 0xC8E0, 0xC8FC, 0xC918, 0xC934, 0xC950, 0xC96C, 0xC988, 0xC9A4, 0xC9C0, 0xC9DC, 0xC9F8, 0xCA14, 0xCA30, 0xCA4C, 0xCA68, 0xCA84, 0xCAA0, 0xCABC, 0xCAD8, 0xCAF4, 0xCB10, 0xCB2C, 0xCB48, 0xCB64, 0xCB80, 0xCB9C, 0xCBB8, 0xCBD4, 0xCBF0, 0xCC0C, 0xCC28, 0xCC44, 0xCC60, 0xCC7C, 0xCC98, 0xCCB4, 0xCCD0, 0xCCEC, 0xCD08, 0xCD24, 0xCD40, 0xCD5C, 0xCD78, 0xCD94, 0xCDB0, 0xCDCC, 0xCDE8, 0xCE04, 0xCE20, 0xCE3C, 0xCE58, 0xCE74, 0xCE90, 0xCEAC, 0xCEC8, 0xCEE4, 0xCF00, 0xCF1C, 0xCF38, 0xCF54, 0xCF70, 0xCF8C, 0xCFA8, 0xCFC4, 0xCFE0, 0xCFFC, 0xD018, 0xD034, 0xD050, 0xD06C, 0xD088, 0xD0A4, 0xD0C0, 0xD0DC, 0xD0F8, 0xD114, 0xD130, 0xD14C, 0xD168, 0xD184, 0xD1A0, 0xD1BC, 0xD1D8, 0xD1F4, 0xD210, 0xD22C, 0xD248, 0xD264, 0xD280, 0xD29C, 0xD2B8, 0xD2D4, 0xD2F0, 0xD30C, 0xD328, 0xD344, 0xD360, 0xD37C, 0xD398, 0xD3B4, 0xD3D0, 0xD3EC, 0xD408, 0xD424, 0xD440, 0xD45C, 0xD478, 0xD494, 0xD4B0, 0xD4CC, 0xD4E8, 0xD504, 0xD520, 0xD53C, 0xD558, 0xD574, 0xD590, 0xD5AC, 0xD5C8, 0xD5E4, 0xD600, 0xD61C, 0xD638, 0xD654, 0xD670, 0xD68C, 0xD6A8, 0xD6C4, 0xD6E0, 0xD6FC, 0xD718, 0xD734, 0xD750, 0xD76C, 0xD788, ); sub _check_pr29 { die "String contains Unicode Corrigendum #5 problem sequences" if shift =~ m/ \x{09C7}$is_Combining+[\x{09BE}\x{09D7}] | # BENGALI VOWEL SIGN E \x{0B47}$is_Combining+[\x{0B3E}\x{0B56}\x{0B57}] | # ORIYA VOWEL SIGN E \x{0BC6}$is_Combining+[\x{0BBE}\x{0BD7}] | # TAMIL VOWEL SIGN E \x{0BC7}$is_Combining+\x{0BBE} | # TAMIL VOWEL SIGN EE \x{0B92}$is_Combining+\x{0BD7} | # TAMIL LETTER O \x{0CC6}$is_Combining+[\x{0CC2}\x{0CD5}\x{0CD6}] | # KANNADA VOWEL SIGN E [\x{0CBF}\x{0CCA}]$is_Combining\x{0CD5} | # KANNADA VOWEL SIGN I or KANNADA VOWEL SIGN O \x{0D47}$is_Combining+\x{0D3E} | # MALAYALAM VOWEL SIGN EE \x{0D46}$is_Combining+[\x{0D3E}\x{0D57}] | # MALAYALAM VOWEL SIGN E \x{1025}$is_Combining+\x{102E} | # MYANMAR LETTER U \x{0DD9}$is_Combining+[\x{0DCF}\x{0DDF}] | # SINHALA VOWEL SIGN KOMBUVA [\x{1100}-\x{1112}]$is_Combining[\x{1161}-\x{1175} ] | # HANGUL CHOSEONG KIYEOK..HIEUH ($is_HangulLV|[\x{1100}-\x{1112}][\x{1161}-\x{1175}])($is_Combining)([\x{11A8}-\x{11C2}]) # HANGUL SyllableType=LV /osx; } 1; __END__ =head1 NAME Unicode::Stringprep - Preparation of Internationalized Strings (S) =head1 SYNOPSIS use Unicode::Stringprep; use Unicode::Stringprep::Mapping; use Unicode::Stringprep::Prohibited; my $prepper = Unicode::Stringprep->new( 3.2, [ { 32 => ''}, ], 'KC', [ @Unicode::Stringprep::Prohibited::C12, @Unicode::Stringprep::Prohibited::C22, @Unicode::Stringprep::Prohibited::C3, @Unicode::Stringprep::Prohibited::C4, @Unicode::Stringprep::Prohibited::C5, @Unicode::Stringprep::Prohibited::C6, @Unicode::Stringprep::Prohibited::C7, @Unicode::Stringprep::Prohibited::C8, @Unicode::Stringprep::Prohibited::C9 ], 1, 0 ); $output = $prepper->($input) =head1 DESCRIPTION This module implements the I framework for preparing Unicode text strings in order to increase the likelihood that string input and string comparison work in ways that make sense for typical users throughout the world. The I protocol is useful for protocol identifier values, company and personal names, internationalized domain names, and other text strings. The I framework does not specify how protocols should prepare text strings. Protocols must create profiles of stringprep in order to fully specify the processing options. =head1 FUNCTIONS This module provides a single function, C, that creates a perl function implementing a I profile. This module exports nothing. =over 4 =item B Creates a Ced function reference that implements a stringprep profile. This function takes the following parameters: =over =item $unicode_version The Unicode version specified by the stringprep profile. Currently, this parameter must be C<3.2> (numeric). =item $mapping_tables The mapping tables used for stringprep. The parameter may be a reference to a hash or an array, or C. A hash must map Unicode codepoints (as integers, S C<0x0020> for U+0020) to replacement strings (as perl strings). An array may contain pairs of Unicode codepoints and replacement strings as well as references to nested hashes and arrays. L provides the tables from S, S. For further information on the mapping step, see S, S
. =item $unicode_normalization The Unicode normalization to be used. Currently, C/C<''> (no normalization) and C<'KC'> (compatibility composed) are specified for I. For further information on the normalization step, see S, S
. Normalization form KC will also enable checks for some problem sequences for which the normalization can't be implemented in an interoperable way. For more information, see L below. =item $prohibited_tables The list of prohibited output characters for stringprep. The parameter may be a reference to an array, or C. The array contains B of codepoints, which define the B and B of a Unicode character range (as integers). The end character may be C, specifying a single-character range. The array may also contain references to nested arrays. L provides the tables from S, S. For further information on the prohibition checking step, see S, S
. =item $bidi_check Whether to employ checks for confusing bidirectional text. A boolean value. For further information on the bidi checking step, see S, S
. =item $unassigned_check Whether to check for and prohibit unassigned characters. A boolean value. The check must be used when creating I strings. It should not be used for I strings, increasing the chance that newly assigned characters work as expected. For further information on I and I strings, see S, S
. =back The function returned can be called with a single parameter, the string to be prepared, and returns the prepared string. It will die if the input string cannot be successfully prepared because it would contain invalid output (so use C if necessary). For performance reasons, it is strongly recommended to call the C function as few times as possible, S exactly once per I profile. It might also be better not to use this module directly but to use (or write) a module implementing a profile, such as L. =back =head1 IMPLEMENTING PROFILES You can easily implement a I profile without subclassing: package ACME::ExamplePrep; use Unicode::Stringprep; use Unicode::Stringprep::Mapping; use Unicode::Stringprep::Prohibited; *exampleprep = Unicode::Stringprep->new( 3.2, [ \@Unicode::Stringprep::Mapping::B1, ], '', [ \@Unicode::Stringprep::Prohibited::C12, \@Unicode::Stringprep::Prohibited::C22, ], 1, ); This binds C to the function created by Cnew>. Usually, it is not necessary to subclass this module. Sublassing this module is not recommended. =head1 DATA TABLES The following modules contain the data tables from S. These modules are automatically loaded when loading C. =over 4 =item * L @Unicode::Stringprep::Unassigned::A1 # Appendix A.1 =item * L @Unicode::Stringprep::Mapping::B1 # Appendix B.1 @Unicode::Stringprep::Mapping::B2 # Appendix B.2 @Unicode::Stringprep::Mapping::B2 # Appendix B.3 =item * L @Unicode::Stringprep::Prohibited::C11 # Appendix C.1.1 @Unicode::Stringprep::Prohibited::C12 # Appendix C.1.2 @Unicode::Stringprep::Prohibited::C21 # Appendix C.2.1 @Unicode::Stringprep::Prohibited::C22 # Appendix C.2.2 @Unicode::Stringprep::Prohibited::C3 # Appendix C.3 @Unicode::Stringprep::Prohibited::C4 # Appendix C.4 @Unicode::Stringprep::Prohibited::C5 # Appendix C.5 @Unicode::Stringprep::Prohibited::C6 # Appendix C.6 @Unicode::Stringprep::Prohibited::C7 # Appendix C.7 @Unicode::Stringprep::Prohibited::C8 # Appendix C.8 @Unicode::Stringprep::Prohibited::C9 # Appendix C.9 =item * L @Unicode::Stringprep::BiDi::D1 # Appendix D.1 @Unicode::Stringprep::BiDi::D2 # Appendix D.2 =back =head1 CAVEATS In Unicode 3.2 to 4.0.1, the specification of UAX #15: Unicode Normalization Forms for forms NFC and NFKC is not logically self-consistent. This has been fixed in Corrigendum #5 (L). Unfortunately, this yields two ways to implement NFC and NFKC in Unicode 3.2, on which the Stringprep standard is based: one based on a literal interpretation of the original specification and one based on the corrected specification. The output of these implementations differs for a small class of strings, all of which can't appear in meaningful text. See UAX #15, section 19 L for details. This module will check for these strings and, if normalization is done, prohibit them in output as it is not possible to interoperate under these circumstandes. Please note that due to this, the I step may cause the preparation to fail. That is, the preparation function may die even if there are no prohibited characters and no checks for bidi sequences and unassigned characters, which may be surprising. =head1 AUTHOR Claus FErber =head1 LICENSE Copyright 2007-2009 Claus FErber. This library is free software; you can redistribute it and/or modify it under the same terms as Perl itself. =head1 SEE ALSO L, S (L) =cut libunicode-stringprep-perl-1.104+dfsg.orig/lib/Unicode/Stringprep/0000755000175000017500000000000011670230013024421 5ustar gregoagregoalibunicode-stringprep-perl-1.104+dfsg.orig/lib/Unicode/Stringprep/Prohibited.pm0000444000175000017500000001051311670230013027046 0ustar gregoagregoapackage Unicode::Stringprep::Prohibited; use strict; use utf8; use warnings; our $VERSION = "1.10"; use Unicode::Stringprep::_Common; our @C11 = _mk_set(<, S =head1 SYNOPSIS @Unicode::Stringprep::Prohibited::C11 # Appendix C.1.1 @Unicode::Stringprep::Prohibited::C12 # Appendix C.1.2 @Unicode::Stringprep::Prohibited::C21 # Appendix C.2.1 @Unicode::Stringprep::Prohibited::C22 # Appendix C.2.2 @Unicode::Stringprep::Prohibited::C3 # Appendix C.3 @Unicode::Stringprep::Prohibited::C4 # Appendix C.4 @Unicode::Stringprep::Prohibited::C5 # Appendix C.5 @Unicode::Stringprep::Prohibited::C6 # Appendix C.6 @Unicode::Stringprep::Prohibited::C7 # Appendix C.7 @Unicode::Stringprep::Prohibited::C8 # Appendix C.8 @Unicode::Stringprep::Prohibited::C9 # Appendix C.9 =head1 DESCRIPTION The tables are provided as arrays, which contain pairs of Unicode codepoints (as integers) defining the start and end of a Unicode range. This module exports nothing. =head1 AUTHOR Claus FErber ECFAERBER@cpan.orgE =head1 LICENSE Copyright 2007-2009 Claus FErber. This library is free software; you can redistribute it and/or modify it under the same terms as Perl itself. =head1 SEE ALSO L, S (L) =cut libunicode-stringprep-perl-1.104+dfsg.orig/lib/Unicode/Stringprep/BiDi.pm0000444000175000017500000001313511670230013025567 0ustar gregoagregoapackage Unicode::Stringprep::BiDi; use strict; use utf8; use warnings; our $VERSION = "1.10"; use Unicode::Stringprep::_Common; our @D1 = _mk_set(<, S =head1 SYNOPSIS @Unicode::Stringprep::Bidi::D1 # Appendix D.1 @Unicode::Stringprep::Bidi::D2 # Appendix D.2 =head1 DESCRIPTION The tables are provided as arrays, which contain pairs of Unicode codepoints (as integers) defining the start and end of a Unicode range. The module exports nothing. =head1 AUTHOR Claus FErber ECFAERBER@cpan.orgE =head1 LICENSE Copyright 2007-2009 Claus FErber. This library is free software; you can redistribute it and/or modify it under the same terms as Perl itself. =head1 SEE ALSO L, S (L) =cut libunicode-stringprep-perl-1.104+dfsg.orig/lib/Unicode/Stringprep/_Common.pm0000444000175000017500000000223411670230013026345 0ustar gregoagregoapackage Unicode::Stringprep::_Common; require 5.008_003; use strict; use utf8; use warnings; use Exporter; our $VERSION = "1.10"; $VERSION = eval { $VERSION }; our @ISA = ('Exporter'); our @EXPORT = ('_mk_set', '_mk_map'); sub _mk_set { my @data = (); foreach my $line (split /\n/, shift) { my($from,$comment) = split /;/, $line; $from =~ s/[^0-9A-Z-]//gi; ($from,my $to) = split(/-/, $from, 2); push @data, (hex($from), ($to ? hex($to) : undef)); } return @data; }; sub _mk_map { my @data = (); foreach my $line (split /\n/, shift) { my($from,$to,$comment) = split /;/, $line; $from =~ s/[^0-9A-F]//gi; $to =~ s/[^0-9A-F ]//gi; push @data, hex($from), join('',map { $_ eq '' ? '' : chr(hex($_)) } split(' ', $to)); } return @data; }; 1; =head1 NAME Unicode::Stringprep::_Common - Internal functions for C =head1 AUTHOR Claus FErber ECFAERBER@cpan.orgE =head1 LICENSE Copyright 2007-2009 Claus FErber. All rights reserved. This library is free software; you can redistribute it and/or modify it under the same terms as Perl itself. libunicode-stringprep-perl-1.104+dfsg.orig/lib/Unicode/Stringprep/Unassigned.pm0000444000175000017500000001231711670230013027061 0ustar gregoagregoapackage Unicode::Stringprep::Unassigned; use strict; use utf8; use warnings; our $VERSION = "1.10"; use Unicode::Stringprep::_Common; our @A1 = _mk_set(<, S =head1 SYNPOSIS @Unicode::Stringprep::Unassigned::A1 # Appendix A.1 =head1 DESCRIPTION The tables are provided as arrays, which contain pairs of Unicode codepoints (as integers) defining the start and end of a Unicode range. This module exports nothing. =head1 AUTHOR Claus FErber ECFAERBER@cpan.orgE =head1 LICENSE Copyright 2007-2009 Claus FErber. All rights reserved. This library is free software; you can redistribute it and/or modify it under the same terms as Perl itself. =head1 SEE ALSO L, S (L) =cut libunicode-stringprep-perl-1.104+dfsg.orig/lib/Unicode/Stringprep/Mapping.pm0000444000175000017500000017140511670230013026360 0ustar gregoagregoapackage Unicode::Stringprep::Mapping; use strict; use utf8; use warnings; our $VERSION = "1.10"; use Unicode::Stringprep::_Common; our @B1 = _mk_map(<, S =head1 SYNOPSIS @Unicode::Stringprep::Mapping::B1 # Appendix B.1 @Unicode::Stringprep::Mapping::B2 # Appendix B.2 @Unicode::Stringprep::Mapping::B3 # Appendix B.3 =head1 DESCRIPTION The tables are provided as arrays, which contain pairs of a Unicode codepoint (as an integer) and replacements string (as a UTF8 perl string). This module exports nothing. =head1 AUTHOR Claus FErber ECFAERBER@cpan.orgE =head1 LICENSE Copyright 2007-2010 Claus FErber. This library is free software; you can redistribute it and/or modify it under the same terms as Perl itself. =head1 SEE ALSO L, S (L) =cut libunicode-stringprep-perl-1.104+dfsg.orig/Makefile.PL0000444000175000017500000000104111670230013022074 0ustar gregoagregoa# Note: this file was auto-generated by Module::Build::Compat version 0.3800 require 5.008003; use ExtUtils::MakeMaker; WriteMakefile ( 'PL_FILES' => {}, 'INSTALLDIRS' => 'site', 'NAME' => 'Unicode::Stringprep', 'EXE_FILES' => [], 'VERSION_FROM' => 'lib/Unicode/Stringprep.pm', 'PREREQ_PM' => { 'Test::More' => 0, 'Test::NoWarnings' => 0, 'Unicode::Normalize' => 1 } ) ; libunicode-stringprep-perl-1.104+dfsg.orig/META.yml0000444000175000017500000000204711670230013021402 0ustar gregoagregoa--- abstract: 'Preparation of Internationalized Strings (RFC 3454)' author: - 'Claus Färber ' build_requires: Test::More: 0 Test::NoWarnings: 0 configure_requires: Module::Build: 0.38 dynamic_config: 1 generated_by: 'Module::Build version 0.38, CPAN::Meta::Converter version 2.112621' license: perl meta-spec: url: http://module-build.sourceforge.net/META-spec-v1.4.html version: 1.4 name: Unicode-Stringprep no_index: directory: - eg provides: Unicode::Stringprep: file: lib/Unicode/Stringprep.pm version: 1.104 Unicode::Stringprep::BiDi: file: lib/Unicode/Stringprep/BiDi.pm version: 1.10 Unicode::Stringprep::Mapping: file: lib/Unicode/Stringprep/Mapping.pm version: 1.10 Unicode::Stringprep::Prohibited: file: lib/Unicode/Stringprep/Prohibited.pm version: 1.10 Unicode::Stringprep::Unassigned: file: lib/Unicode/Stringprep/Unassigned.pm version: 1.10 requires: Unicode::Normalize: 1 perl: 5.008003 resources: license: http://dev.perl.org/licenses/ version: 1.104 libunicode-stringprep-perl-1.104+dfsg.orig/SIGNATURE0000644000175000017500000000527011670230015021422 0ustar gregoagregoaThis file contains message digests of all files listed in MANIFEST, signed via the Module::Signature module, version 0.66. 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 6701a8831679bf0bef1a00ee92e3c8227d6ac1af Build.PL SHA1 56997ad02c8bb6444b2d82a457217867145a0b77 Changes SHA1 be42753051b0a286712b2df238e1654a883be73b LICENSE SHA1 5947211a7123cedadfe1fe4d58b0274a32045212 MANIFEST SHA1 2e87438f9a4c4b36a9adbd6e01ade962b4fce8d2 META.json SHA1 7e555241921865cf50a930ea467f4997ee792433 META.yml SHA1 ff5e339153c6a8874192cd2f10020ce759166622 Makefile.PL SHA1 76b5306b21e526d332660e5ca9ad9a5f77eacaea README SHA1 f6829baa052c940d0bd9ccecff132671f97395b3 eg/Nameprep.pm SHA1 85a3ac0c5d7af229a576358a738c1bc0ddf03848 eg/Readme-Examples.pod SHA1 43f88ca4db5e7eb71e2e01f068dac3006530d093 eg/SASLprep.pm SHA1 a011532784b72ad3e6ab57435338c83358dcdd79 lib/Unicode/Stringprep.pm SHA1 06b50c467935acee6dce848b6a7a236d0c702bfb lib/Unicode/Stringprep/BiDi.pm SHA1 2c2b5f45dec9a663690a614c3a7cbc324368f346 lib/Unicode/Stringprep/Mapping.pm SHA1 321adeb3c3cc69b7d34bbce5a6ed9d0a7f01b96d lib/Unicode/Stringprep/Prohibited.pm SHA1 38a62800f63561f82012bbf7b936ce1b9f665802 lib/Unicode/Stringprep/Unassigned.pm SHA1 26ef2cc5b56fe7ee09d4055aa6e6ce5d6ed28235 lib/Unicode/Stringprep/_Common.pm SHA1 41e0e43142b871a776bccde036bb73c64d102f98 t/00_use.t SHA1 ab73a06aad69cc7d949f171887174cb11c62c5b2 t/01_references.t SHA1 056063d18c3f48338620bbff698f81f91f2ea4d0 t/10_pod_check.t SHA1 b0c66bcb572f82e4401fee07b5342d09f6918c87 t/11_pod_coverage.t SHA1 a3758f6e1dc4c908b4ce0a9e026a44d8ec554959 t/30_mappings.t SHA1 67066846e401ec89de19ce295a93c865a7ccb898 t/31_prohibited_characters.t SHA1 e4e46d46098fdb9590cb9cb1eb4c04dce8a17ee4 t/31_prohibited_characters_extra.t SHA1 eab9140472500d97c6ab376c12c9105f26657fa0 t/32_nfkc_3_2.t SHA1 d669c53711a9bd390d68a2a9140f9a81bc245ad0 t/99_perl-5.11.3.t SHA1 571afb1f57976934f7b045346c6d3754684007ec t/nameprep.t SHA1 37ce46ea177f432e74688df86766fe5f7ac027f6 t/nameprep_bytes.t SHA1 ee424fa556e217ca673ec6d4d5f29c7c41f0f5de t/nameprep_stored.t SHA1 f5053025cd885fb2828897100235fbb1eb57c9df t/saslprep.t SHA1 34c09f6db7be90d9c8ebd3be1d10979d2af901b8 t/saslprep_bytes.t -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.11 (Darwin) iEYEARECAAYFAk7hMAsACgkQSKUOY2OWgPDM0wCfQx/XtQQibl1/fEBzJ5OMzDZP 9ZgAnj3cSv+BJtRW4l71JGahNRymsZEB =u6Vt -----END PGP SIGNATURE----- libunicode-stringprep-perl-1.104+dfsg.orig/META.json0000444000175000017500000000327311670230013021554 0ustar gregoagregoa{ "abstract" : "Preparation of Internationalized Strings (RFC 3454)", "author" : [ "Claus Färber " ], "dynamic_config" : 1, "generated_by" : "Module::Build version 0.38, CPAN::Meta::Converter version 2.112621", "license" : [ "perl_5" ], "meta-spec" : { "url" : "http://search.cpan.org/perldoc?CPAN::Meta::Spec", "version" : "2" }, "name" : "Unicode-Stringprep", "no_index" : { "directory" : [ "eg" ] }, "prereqs" : { "build" : { "requires" : { "Test::More" : 0, "Test::NoWarnings" : 0 } }, "configure" : { "requires" : { "Module::Build" : "0.38" } }, "runtime" : { "requires" : { "Unicode::Normalize" : "1", "perl" : "5.008003" } } }, "provides" : { "Unicode::Stringprep" : { "file" : "lib/Unicode/Stringprep.pm", "version" : "1.104" }, "Unicode::Stringprep::BiDi" : { "file" : "lib/Unicode/Stringprep/BiDi.pm", "version" : "1.10" }, "Unicode::Stringprep::Mapping" : { "file" : "lib/Unicode/Stringprep/Mapping.pm", "version" : "1.10" }, "Unicode::Stringprep::Prohibited" : { "file" : "lib/Unicode/Stringprep/Prohibited.pm", "version" : "1.10" }, "Unicode::Stringprep::Unassigned" : { "file" : "lib/Unicode/Stringprep/Unassigned.pm", "version" : "1.10" } }, "release_status" : "stable", "resources" : { "license" : [ "http://dev.perl.org/licenses/" ] }, "version" : "1.104" }