Math-Random-ISAAC-1.004000700001750001750 011527357352 13202 5ustar00jonjon000000000000README000644001750001750 170411527357352 14156 0ustar00jonjon000000000000Math-Random-ISAAC-1.004 This archive contains the distribution Math-Random-ISAAC, version 1.004: Perl interface to the ISAAC PRNG algorithm Legally speaking, this package and its contents are: Copyright (c) 2011 by Jonathan Yu . But this is really just a legal technicality that allows the author to offer this package under the public domain and also a variety of licensing options. For all intents and purposes, this is public domain software, which means you can do whatever you want with it. The software is provided "AS IS", without warranty of any kind, express or implied, including but not limited to the warranties of merchantability, fitness for a particular purpose and noninfringement. In no event shall the authors or copyright holders be liable for any claim, damages or other liability, whether in an action of contract, tort or otherwise, arising from, out of or in connection with the software or the use or other dealings in the software. Changes000600001750001750 565411527357352 14571 0ustar00jonjon000000000000Math-Random-ISAAC-1.0041.004 2011-02-17 21:52:18 America/Toronto Correct dependencies to indicate Math::Random::ISAAC::XS is a runtime dependency (thanks rjbs) 1.003 2011-01-15 08:47:25 America/Toronto Update MANIFEST.SKIP according to new defaults provided by ExtUtils::Manifest (Closes RT#64536) Move package to Dist::Zilla format 1.002 2009-12-03 Changed my mail address to jawnsy@cpan.org Updated test sequence Remove modules available in core since Perl 5.6 from requires Fix POD Add information about potentially-discovered attacks 1.001 2009-08-17 Remove generated files from the repository Use a simple string version, per David Golden's article: http://www.dagolden.com/index.php/369/version-numbers-should-be-boring/ No longer use Perl::Critic to test 1.0.5 2009-07-25 No longer test Perl::Critic during AUTOMATED_TESTING, only RELEASE_TESTING. Thanks to Elliot Shank for the discussion in a private mail. Changed critic.rc to ignore PodSpelling policy (fixes a bug in Debian, BTS#538115 -- when Pod::Spell and other dependencies are installed) COPYRIGHT AND LICENSE -> LICENSE in POD No more versioned dependency on version.pm Overhaul test scripts, remove author tests from Recommends (Alias' journal #5375) Update LICENSE and README to a smaller format. Clarify POD. No longer generates a readme using pod2text All the copyrights now reference the main file, to reduce the number of things that need to be updated in case the years are updated Require Internet (TEST_INTERNET) to do the signature test, since it tries to download the key from a keyserver Make it clearer in POD that there is no default seeding mechanism No longer enforce "one dot only" in filenames. This breaks compatibility with OpenVMS. New simplified license - Public Domain (fallback on MIT, Artistic-2+, GPL-2+ only) 1.0.4 2009-04-26 Added some more tests for fallback functionality; I believe having 'use' for ISAAC meant that it would be put in a BEGIN{} block, which means selection happens before Test::Without::Module is even loaded Added a test to ensure the module was compiled/loaded, then check if $Math::Random::ISAAC::DRIVER is defined first Added Build.bat to MANIFEST.SKIP for Win32 builds... 1.0.3 2009-04-23 Added example scripts Move calls to $self->{randa} outside the for loop to increase performance 1.0.1 2009-04-06 Fixed the PurePerl algorithm to mask out high bits for 64-bit systems, so as to be portable 1.0 2009-03-25 Initial release LICENSE000644001750001750 13434411527357352 14352 0ustar00jonjon000000000000Math-Random-ISAAC-1.004Legally speaking, this package and its contents are: Copyright (c) 2011 by Jonathan Yu . But this is really just a legal technicality that allows the author to offer this package under the public domain and also a variety of licensing options. For all intents and purposes, this is public domain software, which means you can do whatever you want with it. The software is provided "AS IS", without warranty of any kind, express or implied, including but not limited to the warranties of merchantability, fitness for a particular purpose and noninfringement. In no event shall the authors or copyright holders be liable for any claim, damages or other liability, whether in an action of contract, tort or otherwise, arising from, out of or in connection with the software or the use or other dealings in the software. PUBLIC DOMAIN PSEUDO-LICENSE I, the copyright holder of this package, hereby release the entire contents therein into the public domain. This applies worldwide, to the extent that it is permissible by law. In case this is not legally possible, I grant any entity the right to use this work for any purpose, without any conditions, unless such conditions are required by law. If you so choose, or if you are legally compelled to do so, you may use this software under the terms of your choice of the following licenses: 1. The MIT/X11 License; or, 2. The Perl Artistic License, version 1 or later; or, 3. The GNU General Public License, version 1 or later For the sake of convenience, the full text of the latest versions of these licenses (as of writing) follows. --------- The MIT (X11) License --------- This software is Copyright (c) 2011 by Jonathan Yu . This is free software, licensed under: The MIT (X11) License The MIT License Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. --------- The Artistic License 2.0 --------- This software is Copyright (c) 2011 by Jonathan Yu . This is free software, licensed under: The Artistic License 2.0 The Artistic License 2.0 Copyright (c) 2000-2006, The Perl Foundation. Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. Preamble This license establishes the terms under which a given free software Package may be copied, modified, distributed, and/or redistributed. The intent is that the Copyright Holder maintains some artistic control over the development of that Package while still keeping the Package available as open source and free software. You are always permitted to make arrangements wholly outside of this license directly with the Copyright Holder of a given Package. If the terms of this license do not permit the full use that you propose to make of the Package, you should contact the Copyright Holder and seek a different licensing arrangement. Definitions "Copyright Holder" means the individual(s) or organization(s) named in the copyright notice for the entire Package. "Contributor" means any party that has contributed code or other material to the Package, in accordance with the Copyright Holder's procedures. "You" and "your" means any person who would like to copy, distribute, or modify the Package. "Package" means the collection of files distributed by the Copyright Holder, and derivatives of that collection and/or of those files. A given Package may consist of either the Standard Version, or a Modified Version. "Distribute" means providing a copy of the Package or making it accessible to anyone else, or in the case of a company or organization, to others outside of your company or organization. "Distributor Fee" means any fee that you charge for Distributing this Package or providing support for this Package to another party. It does not mean licensing fees. "Standard Version" refers to the Package if it has not been modified, or has been modified only in ways explicitly requested by the Copyright Holder. "Modified Version" means the Package, if it has been changed, and such changes were not explicitly requested by the Copyright Holder. "Original License" means this Artistic License as Distributed with the Standard Version of the Package, in its current version or as it may be modified by The Perl Foundation in the future. "Source" form means the source code, documentation source, and configuration files for the Package. "Compiled" form means the compiled bytecode, object code, binary, or any other form resulting from mechanical transformation or translation of the Source form. Permission for Use and Modification Without Distribution (1) You are permitted to use the Standard Version and create and use Modified Versions for any purpose without restriction, provided that you do not Distribute the Modified Version. Permissions for Redistribution of the Standard Version (2) You may Distribute verbatim copies of the Source form of the Standard Version of this Package in any medium without restriction, either gratis or for a Distributor Fee, provided that you duplicate all of the original copyright notices and associated disclaimers. At your discretion, such verbatim copies may or may not include a Compiled form of the Package. (3) You may apply any bug fixes, portability changes, and other modifications made available from the Copyright Holder. The resulting Package will still be considered the Standard Version, and as such will be subject to the Original License. Distribution of Modified Versions of the Package as Source (4) You may Distribute your Modified Version as Source (either gratis or for a Distributor Fee, and with or without a Compiled form of the Modified Version) provided that you clearly document how it differs from the Standard Version, including, but not limited to, documenting any non-standard features, executables, or modules, and provided that you do at least ONE of the following: (a) make the Modified Version available to the Copyright Holder of the Standard Version, under the Original License, so that the Copyright Holder may include your modifications in the Standard Version. (b) ensure that installation of your Modified Version does not prevent the user installing or running the Standard Version. In addition, the Modified Version must bear a name that is different from the name of the Standard Version. (c) allow anyone who receives a copy of the Modified Version to make the Source form of the Modified Version available to others under (i) the Original License or (ii) a license that permits the licensee to freely copy, modify and redistribute the Modified Version using the same licensing terms that apply to the copy that the licensee received, and requires that the Source form of the Modified Version, and of any works derived from it, be made freely available in that license fees are prohibited but Distributor Fees are allowed. Distribution of Compiled Forms of the Standard Version or Modified Versions without the Source (5) You may Distribute Compiled forms of the Standard Version without the Source, provided that you include complete instructions on how to get the Source of the Standard Version. Such instructions must be valid at the time of your distribution. If these instructions, at any time while you are carrying out such distribution, become invalid, you must provide new instructions on demand or cease further distribution. If you provide valid instructions or cease distribution within thirty days after you become aware that the instructions are invalid, then you do not forfeit any of your rights under this license. (6) You may Distribute a Modified Version in Compiled form without the Source, provided that you comply with Section 4 with respect to the Source of the Modified Version. Aggregating or Linking the Package (7) You may aggregate the Package (either the Standard Version or Modified Version) with other packages and Distribute the resulting aggregation provided that you do not charge a licensing fee for the Package. Distributor Fees are permitted, and licensing fees for other components in the aggregation are permitted. The terms of this license apply to the use and Distribution of the Standard or Modified Versions as included in the aggregation. (8) You are permitted to link Modified and Standard Versions with other works, to embed the Package in a larger work of your own, or to build stand-alone binary or bytecode versions of applications that include the Package, and Distribute the result without restriction, provided the result does not expose a direct interface to the Package. Items That are Not Considered Part of a Modified Version (9) Works (including, but not limited to, modules and scripts) that merely extend or make use of the Package, do not, by themselves, cause the Package to be a Modified Version. In addition, such works are not considered parts of the Package itself, and are not subject to the terms of this license. General Provisions (10) Any use, modification, and distribution of the Standard or Modified Versions is governed by this Artistic License. By using, modifying or distributing the Package, you accept this license. Do not use, modify, or distribute the Package, if you do not accept this license. (11) If your Modified Version has been derived from a Modified Version made by someone other than you, you are nevertheless required to ensure that your Modified Version complies with the requirements of this license. (12) This license does not grant you the right to use any trademark, service mark, tradename, or logo of the Copyright Holder. (13) This license includes the non-exclusive, worldwide, free-of-charge patent license to make, have made, use, offer to sell, sell, import and otherwise transfer the Package with respect to any patent claims licensable by the Copyright Holder that are necessarily infringed by the Package. If you institute patent litigation (including a cross-claim or counterclaim) against any party alleging that the Package constitutes direct or contributory patent infringement, then this Artistic License to you shall terminate on the date that such litigation is filed. (14) Disclaimer of Warranty: THE PACKAGE IS PROVIDED BY THE COPYRIGHT HOLDER AND CONTRIBUTORS "AS IS" AND WITHOUT ANY EXPRESS OR IMPLIED WARRANTIES. THE IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, OR NON-INFRINGEMENT ARE DISCLAIMED TO THE EXTENT PERMITTED BY YOUR LOCAL LAW. UNLESS REQUIRED BY LAW, NO COPYRIGHT HOLDER OR CONTRIBUTOR WILL BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, OR CONSEQUENTIAL DAMAGES ARISING IN ANY WAY OUT OF THE USE OF THE PACKAGE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --------- The GNU General Public License, Version 3, June 2007 --------- This software is Copyright (c) 2011 by Jonathan Yu . This is free software, licensed under: The GNU General Public License, Version 3, June 2007 GNU GENERAL PUBLIC LICENSE Version 3, 29 June 2007 Copyright (C) 2007 Free Software Foundation, Inc. Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. Preamble The GNU General Public License is a free, copyleft license for software and other kinds of works. The licenses for most software and other practical works are designed to take away your freedom to share and change the works. By contrast, the GNU General Public License is intended to guarantee your freedom to share and change all versions of a program--to make sure it remains free software for all its users. We, the Free Software Foundation, use the GNU General Public License for most of our software; it applies also to any other work released this way by its authors. You can apply it to your programs, too. When we speak of free software, we are referring to freedom, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for them if you wish), 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 prevent others from denying you these rights or asking you to surrender the rights. Therefore, you have certain responsibilities if you distribute copies of the software, or if you modify it: responsibilities to respect the freedom of others. For example, if you distribute copies of such a program, whether gratis or for a fee, you must pass on to the recipients the same freedoms that you received. You must make sure that they, too, receive or can get the source code. And you must show them these terms so they know their rights. Developers that use the GNU GPL protect your rights with two steps: (1) assert copyright on the software, and (2) offer you this License giving you legal permission to copy, distribute and/or modify it. For the developers' and authors' protection, the GPL clearly explains that there is no warranty for this free software. For both users' and authors' sake, the GPL requires that modified versions be marked as changed, so that their problems will not be attributed erroneously to authors of previous versions. Some devices are designed to deny users access to install or run modified versions of the software inside them, although the manufacturer can do so. This is fundamentally incompatible with the aim of protecting users' freedom to change the software. The systematic pattern of such abuse occurs in the area of products for individuals to use, which is precisely where it is most unacceptable. Therefore, we have designed this version of the GPL to prohibit the practice for those products. If such problems arise substantially in other domains, we stand ready to extend this provision to those domains in future versions of the GPL, as needed to protect the freedom of users. Finally, every program is threatened constantly by software patents. States should not allow patents to restrict development and use of software on general-purpose computers, but in those that do, we wish to avoid the special danger that patents applied to a free program could make it effectively proprietary. To prevent this, the GPL assures that patents cannot be used to render the program non-free. The precise terms and conditions for copying, distribution and modification follow. TERMS AND CONDITIONS 0. Definitions. "This License" refers to version 3 of the GNU General Public License. "Copyright" also means copyright-like laws that apply to other kinds of works, such as semiconductor masks. "The Program" refers to any copyrightable work licensed under this License. Each licensee is addressed as "you". "Licensees" and "recipients" may be individuals or organizations. To "modify" a work means to copy from or adapt all or part of the work in a fashion requiring copyright permission, other than the making of an exact copy. The resulting work is called a "modified version" of the earlier work or a work "based on" the earlier work. A "covered work" means either the unmodified Program or a work based on the Program. To "propagate" a work means to do anything with it that, without permission, would make you directly or secondarily liable for infringement under applicable copyright law, except executing it on a computer or modifying a private copy. Propagation includes copying, distribution (with or without modification), making available to the public, and in some countries other activities as well. To "convey" a work means any kind of propagation that enables other parties to make or receive copies. Mere interaction with a user through a computer network, with no transfer of a copy, is not conveying. An interactive user interface displays "Appropriate Legal Notices" to the extent that it includes a convenient and prominently visible feature that (1) displays an appropriate copyright notice, and (2) tells the user that there is no warranty for the work (except to the extent that warranties are provided), that licensees may convey the work under this License, and how to view a copy of this License. If the interface presents a list of user commands or options, such as a menu, a prominent item in the list meets this criterion. 1. Source Code. The "source code" for a work means the preferred form of the work for making modifications to it. "Object code" means any non-source form of a work. A "Standard Interface" means an interface that either is an official standard defined by a recognized standards body, or, in the case of interfaces specified for a particular programming language, one that is widely used among developers working in that language. The "System Libraries" of an executable work include anything, other than the work as a whole, that (a) is included in the normal form of packaging a Major Component, but which is not part of that Major Component, and (b) serves only to enable use of the work with that Major Component, or to implement a Standard Interface for which an implementation is available to the public in source code form. A "Major Component", in this context, means a major essential component (kernel, window system, and so on) of the specific operating system (if any) on which the executable work runs, or a compiler used to produce the work, or an object code interpreter used to run it. The "Corresponding Source" for a work in object code form means all the source code needed to generate, install, and (for an executable work) run the object code and to modify the work, including scripts to control those activities. However, it does not include the work's System Libraries, or general-purpose tools or generally available free programs which are used unmodified in performing those activities but which are not part of the work. For example, Corresponding Source includes interface definition files associated with source files for the work, and the source code for shared libraries and dynamically linked subprograms that the work is specifically designed to require, such as by intimate data communication or control flow between those subprograms and other parts of the work. The Corresponding Source need not include anything that users can regenerate automatically from other parts of the Corresponding Source. The Corresponding Source for a work in source code form is that same work. 2. Basic Permissions. All rights granted under this License are granted for the term of copyright on the Program, and are irrevocable provided the stated conditions are met. This License explicitly affirms your unlimited permission to run the unmodified Program. The output from running a covered work is covered by this License only if the output, given its content, constitutes a covered work. This License acknowledges your rights of fair use or other equivalent, as provided by copyright law. You may make, run and propagate covered works that you do not convey, without conditions so long as your license otherwise remains in force. You may convey covered works to others for the sole purpose of having them make modifications exclusively for you, or provide you with facilities for running those works, provided that you comply with the terms of this License in conveying all material for which you do not control copyright. Those thus making or running the covered works for you must do so exclusively on your behalf, under your direction and control, on terms that prohibit them from making any copies of your copyrighted material outside their relationship with you. Conveying under any other circumstances is permitted solely under the conditions stated below. Sublicensing is not allowed; section 10 makes it unnecessary. 3. Protecting Users' Legal Rights From Anti-Circumvention Law. No covered work shall be deemed part of an effective technological measure under any applicable law fulfilling obligations under article 11 of the WIPO copyright treaty adopted on 20 December 1996, or similar laws prohibiting or restricting circumvention of such measures. When you convey a covered work, you waive any legal power to forbid circumvention of technological measures to the extent such circumvention is effected by exercising rights under this License with respect to the covered work, and you disclaim any intention to limit operation or modification of the work as a means of enforcing, against the work's users, your or third parties' legal rights to forbid circumvention of technological measures. 4. Conveying Verbatim Copies. You may convey 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; keep intact all notices stating that this License and any non-permissive terms added in accord with section 7 apply to the code; keep intact all notices of the absence of any warranty; and give all recipients a copy of this License along with the Program. You may charge any price or no price for each copy that you convey, and you may offer support or warranty protection for a fee. 5. Conveying Modified Source Versions. You may convey a work based on the Program, or the modifications to produce it from the Program, in the form of source code under the terms of section 4, provided that you also meet all of these conditions: a) The work must carry prominent notices stating that you modified it, and giving a relevant date. b) The work must carry prominent notices stating that it is released under this License and any conditions added under section 7. This requirement modifies the requirement in section 4 to "keep intact all notices". c) You must license the entire work, as a whole, under this License to anyone who comes into possession of a copy. This License will therefore apply, along with any applicable section 7 additional terms, to the whole of the work, and all its parts, regardless of how they are packaged. This License gives no permission to license the work in any other way, but it does not invalidate such permission if you have separately received it. d) If the work has interactive user interfaces, each must display Appropriate Legal Notices; however, if the Program has interactive interfaces that do not display Appropriate Legal Notices, your work need not make them do so. A compilation of a covered work with other separate and independent works, which are not by their nature extensions of the covered work, and which are not combined with it such as to form a larger program, in or on a volume of a storage or distribution medium, is called an "aggregate" if the compilation and its resulting copyright are not used to limit the access or legal rights of the compilation's users beyond what the individual works permit. Inclusion of a covered work in an aggregate does not cause this License to apply to the other parts of the aggregate. 6. Conveying Non-Source Forms. You may convey a covered work in object code form under the terms of sections 4 and 5, provided that you also convey the machine-readable Corresponding Source under the terms of this License, in one of these ways: a) Convey the object code in, or embodied in, a physical product (including a physical distribution medium), accompanied by the Corresponding Source fixed on a durable physical medium customarily used for software interchange. b) Convey the object code in, or embodied in, a physical product (including a physical distribution medium), accompanied by a written offer, valid for at least three years and valid for as long as you offer spare parts or customer support for that product model, to give anyone who possesses the object code either (1) a copy of the Corresponding Source for all the software in the product that is covered by this License, on a durable physical medium customarily used for software interchange, for a price no more than your reasonable cost of physically performing this conveying of source, or (2) access to copy the Corresponding Source from a network server at no charge. c) Convey individual copies of the object code with a copy of the written offer to provide the Corresponding Source. This alternative is allowed only occasionally and noncommercially, and only if you received the object code with such an offer, in accord with subsection 6b. d) Convey the object code by offering access from a designated place (gratis or for a charge), and offer equivalent access to the Corresponding Source in the same way through the same place at no further charge. You need not require recipients to copy the Corresponding Source along with the object code. If the place to copy the object code is a network server, the Corresponding Source may be on a different server (operated by you or a third party) that supports equivalent copying facilities, provided you maintain clear directions next to the object code saying where to find the Corresponding Source. Regardless of what server hosts the Corresponding Source, you remain obligated to ensure that it is available for as long as needed to satisfy these requirements. e) Convey the object code using peer-to-peer transmission, provided you inform other peers where the object code and Corresponding Source of the work are being offered to the general public at no charge under subsection 6d. A separable portion of the object code, whose source code is excluded from the Corresponding Source as a System Library, need not be included in conveying the object code work. A "User Product" is either (1) a "consumer product", which means any tangible personal property which is normally used for personal, family, or household purposes, or (2) anything designed or sold for incorporation into a dwelling. In determining whether a product is a consumer product, doubtful cases shall be resolved in favor of coverage. For a particular product received by a particular user, "normally used" refers to a typical or common use of that class of product, regardless of the status of the particular user or of the way in which the particular user actually uses, or expects or is expected to use, the product. A product is a consumer product regardless of whether the product has substantial commercial, industrial or non-consumer uses, unless such uses represent the only significant mode of use of the product. "Installation Information" for a User Product means any methods, procedures, authorization keys, or other information required to install and execute modified versions of a covered work in that User Product from a modified version of its Corresponding Source. The information must suffice to ensure that the continued functioning of the modified object code is in no case prevented or interfered with solely because modification has been made. If you convey an object code work under this section in, or with, or specifically for use in, a User Product, and the conveying occurs as part of a transaction in which the right of possession and use of the User Product is transferred to the recipient in perpetuity or for a fixed term (regardless of how the transaction is characterized), the Corresponding Source conveyed under this section must be accompanied by the Installation Information. But this requirement does not apply if neither you nor any third party retains the ability to install modified object code on the User Product (for example, the work has been installed in ROM). The requirement to provide Installation Information does not include a requirement to continue to provide support service, warranty, or updates for a work that has been modified or installed by the recipient, or for the User Product in which it has been modified or installed. Access to a network may be denied when the modification itself materially and adversely affects the operation of the network or violates the rules and protocols for communication across the network. Corresponding Source conveyed, and Installation Information provided, in accord with this section must be in a format that is publicly documented (and with an implementation available to the public in source code form), and must require no special password or key for unpacking, reading or copying. 7. Additional Terms. "Additional permissions" are terms that supplement the terms of this License by making exceptions from one or more of its conditions. Additional permissions that are applicable to the entire Program shall be treated as though they were included in this License, to the extent that they are valid under applicable law. If additional permissions apply only to part of the Program, that part may be used separately under those permissions, but the entire Program remains governed by this License without regard to the additional permissions. When you convey a copy of a covered work, you may at your option remove any additional permissions from that copy, or from any part of it. (Additional permissions may be written to require their own removal in certain cases when you modify the work.) You may place additional permissions on material, added by you to a covered work, for which you have or can give appropriate copyright permission. Notwithstanding any other provision of this License, for material you add to a covered work, you may (if authorized by the copyright holders of that material) supplement the terms of this License with terms: a) Disclaiming warranty or limiting liability differently from the terms of sections 15 and 16 of this License; or b) Requiring preservation of specified reasonable legal notices or author attributions in that material or in the Appropriate Legal Notices displayed by works containing it; or c) Prohibiting misrepresentation of the origin of that material, or requiring that modified versions of such material be marked in reasonable ways as different from the original version; or d) Limiting the use for publicity purposes of names of licensors or authors of the material; or e) Declining to grant rights under trademark law for use of some trade names, trademarks, or service marks; or f) Requiring indemnification of licensors and authors of that material by anyone who conveys the material (or modified versions of it) with contractual assumptions of liability to the recipient, for any liability that these contractual assumptions directly impose on those licensors and authors. All other non-permissive additional terms are considered "further restrictions" within the meaning of section 10. If the Program as you received it, or any part of it, contains a notice stating that it is governed by this License along with a term that is a further restriction, you may remove that term. If a license document contains a further restriction but permits relicensing or conveying under this License, you may add to a covered work material governed by the terms of that license document, provided that the further restriction does not survive such relicensing or conveying. If you add terms to a covered work in accord with this section, you must place, in the relevant source files, a statement of the additional terms that apply to those files, or a notice indicating where to find the applicable terms. Additional terms, permissive or non-permissive, may be stated in the form of a separately written license, or stated as exceptions; the above requirements apply either way. 8. Termination. You may not propagate or modify a covered work except as expressly provided under this License. Any attempt otherwise to propagate or modify it is void, and will automatically terminate your rights under this License (including any patent licenses granted under the third paragraph of section 11). However, if you cease all violation of this License, then your license from a particular copyright holder is reinstated (a) provisionally, unless and until the copyright holder explicitly and finally terminates your license, and (b) permanently, if the copyright holder fails to notify you of the violation by some reasonable means prior to 60 days after the cessation. Moreover, your license from a particular copyright holder is reinstated permanently if the copyright holder notifies you of the violation by some reasonable means, this is the first time you have received notice of violation of this License (for any work) from that copyright holder, and you cure the violation prior to 30 days after your receipt of the notice. Termination of your rights under this section does not terminate the licenses of parties who have received copies or rights from you under this License. If your rights have been terminated and not permanently reinstated, you do not qualify to receive new licenses for the same material under section 10. 9. Acceptance Not Required for Having Copies. You are not required to accept this License in order to receive or run a copy of the Program. Ancillary propagation of a covered work occurring solely as a consequence of using peer-to-peer transmission to receive a copy likewise does not require acceptance. However, nothing other than this License grants you permission to propagate or modify any covered work. These actions infringe copyright if you do not accept this License. Therefore, by modifying or propagating a covered work, you indicate your acceptance of this License to do so. 10. Automatic Licensing of Downstream Recipients. Each time you convey a covered work, the recipient automatically receives a license from the original licensors, to run, modify and propagate that work, subject to this License. You are not responsible for enforcing compliance by third parties with this License. An "entity transaction" is a transaction transferring control of an organization, or substantially all assets of one, or subdividing an organization, or merging organizations. If propagation of a covered work results from an entity transaction, each party to that transaction who receives a copy of the work also receives whatever licenses to the work the party's predecessor in interest had or could give under the previous paragraph, plus a right to possession of the Corresponding Source of the work from the predecessor in interest, if the predecessor has it or can get it with reasonable efforts. You may not impose any further restrictions on the exercise of the rights granted or affirmed under this License. For example, you may not impose a license fee, royalty, or other charge for exercise of rights granted under this License, and you may not initiate litigation (including a cross-claim or counterclaim in a lawsuit) alleging that any patent claim is infringed by making, using, selling, offering for sale, or importing the Program or any portion of it. 11. Patents. A "contributor" is a copyright holder who authorizes use under this License of the Program or a work on which the Program is based. The work thus licensed is called the contributor's "contributor version". A contributor's "essential patent claims" are all patent claims owned or controlled by the contributor, whether already acquired or hereafter acquired, that would be infringed by some manner, permitted by this License, of making, using, or selling its contributor version, but do not include claims that would be infringed only as a consequence of further modification of the contributor version. For purposes of this definition, "control" includes the right to grant patent sublicenses in a manner consistent with the requirements of this License. Each contributor grants you a non-exclusive, worldwide, royalty-free patent license under the contributor's essential patent claims, to make, use, sell, offer for sale, import and otherwise run, modify and propagate the contents of its contributor version. In the following three paragraphs, a "patent license" is any express agreement or commitment, however denominated, not to enforce a patent (such as an express permission to practice a patent or covenant not to sue for patent infringement). To "grant" such a patent license to a party means to make such an agreement or commitment not to enforce a patent against the party. If you convey a covered work, knowingly relying on a patent license, and the Corresponding Source of the work is not available for anyone to copy, free of charge and under the terms of this License, through a publicly available network server or other readily accessible means, then you must either (1) cause the Corresponding Source to be so available, or (2) arrange to deprive yourself of the benefit of the patent license for this particular work, or (3) arrange, in a manner consistent with the requirements of this License, to extend the patent license to downstream recipients. "Knowingly relying" means you have actual knowledge that, but for the patent license, your conveying the covered work in a country, or your recipient's use of the covered work in a country, would infringe one or more identifiable patents in that country that you have reason to believe are valid. If, pursuant to or in connection with a single transaction or arrangement, you convey, or propagate by procuring conveyance of, a covered work, and grant a patent license to some of the parties receiving the covered work authorizing them to use, propagate, modify or convey a specific copy of the covered work, then the patent license you grant is automatically extended to all recipients of the covered work and works based on it. A patent license is "discriminatory" if it does not include within the scope of its coverage, prohibits the exercise of, or is conditioned on the non-exercise of one or more of the rights that are specifically granted under this License. You may not convey a covered work if you are a party to an arrangement with a third party that is in the business of distributing software, under which you make payment to the third party based on the extent of your activity of conveying the work, and under which the third party grants, to any of the parties who would receive the covered work from you, a discriminatory patent license (a) in connection with copies of the covered work conveyed by you (or copies made from those copies), or (b) primarily for and in connection with specific products or compilations that contain the covered work, unless you entered into that arrangement, or that patent license was granted, prior to 28 March 2007. Nothing in this License shall be construed as excluding or limiting any implied license or other defenses to infringement that may otherwise be available to you under applicable patent law. 12. No Surrender of Others' Freedom. If conditions are imposed on you (whether by court order, agreement or otherwise) that contradict the conditions of this License, they do not excuse you from the conditions of this License. If you cannot convey a covered work so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not convey it at all. For example, if you agree to terms that obligate you to collect a royalty for further conveying from those to whom you convey the Program, the only way you could satisfy both those terms and this License would be to refrain entirely from conveying the Program. 13. Use with the GNU Affero General Public License. Notwithstanding any other provision of this License, you have permission to link or combine any covered work with a work licensed under version 3 of the GNU Affero General Public License into a single combined work, and to convey the resulting work. The terms of this License will continue to apply to the part which is the covered work, but the special requirements of the GNU Affero General Public License, section 13, concerning interaction through a network will apply to the combination as such. 14. Revised Versions of this License. The Free Software Foundation may publish revised and/or new versions of the GNU 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 that a certain numbered version of the GNU General Public License "or any later version" applies to it, you have the option of following the terms and conditions either of that numbered version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of the GNU General Public License, you may choose any version ever published by the Free Software Foundation. If the Program specifies that a proxy can decide which future versions of the GNU General Public License can be used, that proxy's public statement of acceptance of a version permanently authorizes you to choose that version for the Program. Later license versions may give you additional or different permissions. However, no additional obligations are imposed on any author or copyright holder as a result of your choosing to follow a later version. 15. Disclaimer of Warranty. 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. 16. Limitation of Liability. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 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. 17. Interpretation of Sections 15 and 16. If the disclaimer of warranty and limitation of liability provided above cannot be given local legal effect according to their terms, reviewing courts shall apply local law that most closely approximates an absolute waiver of all civil liability in connection with the Program, unless a warranty or assumption of liability accompanies a copy of the Program in return for a fee. END OF TERMS AND CONDITIONS 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 the public, 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 state 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) 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 3 of the License, 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, see . Also add information on how to contact you by electronic and paper mail. If the program does terminal interaction, make it output a short notice like this when it starts in an interactive mode: Copyright (C) This program 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, your program's commands might be different; for a GUI interface, you would use an "about box". You should also get your employer (if you work as a programmer) or school, if any, to sign a "copyright disclaimer" for the program, if necessary. For more information on this, and how to apply and follow the GNU GPL, see . The GNU General Public License does not permit incorporating your program into proprietary programs. If your program is a subroutine library, you may consider it more useful to permit linking proprietary applications with the library. If this is what you want to do, use the GNU Lesser General Public License instead of this License. But first, please read . dist.ini000600001750001750 446111527357352 14735 0ustar00jonjon000000000000Math-Random-ISAAC-1.004name = Math-Random-ISAAC main_module = lib/Math/Random/ISAAC.pm author = Jonathan Yu copyright_holder = Jonathan Yu license = PD ; choose files to include [GatherDir] ; everything under top dir [PruneCruft] ; default stuff to skip [ManifestSkip] ; custom stuff to skip [Prereqs] perl = 5.006 [Prereqs / RuntimeRecommends] Math::Random::ISAAC::XS = 0 [Prereqs / TestRequires] Test::More = 0.62 Test::NoWarnings = 0.084 ; manage Git repository [Git::Init] ; initialize repository on dzil new [Git::Check] ; ensure repository is not dirty [Git::CommitBuild] ; track build results [Git::NextVersion] ; bump last git release tag [Git::Tag] ; tag new version ; set up author, release and automated tests [ExtraTests] ; install stuff in xt/ [PodCoverageTests] ; Test::Pod::Coverage [PodSyntaxTests] ; Test::Pod [DistManifestTests] ; Test::DistManifest [PortabilityTests] ; Test::Portability::Files [KwaliteeTests] ; Test::Kwalitee ; important package metadata [MetaResources] ; additional information for META `resources' homepage = http://search.cpan.org/dist/Math-Random-ISAAC bugtracker.web = http://rt.cpan.org/NoAuth/Bugs.html?Dist=Math-Random-ISAAC repository.url = git://github.com/jawnsy/Math-Random-ISAAC.git repository.web = http://github.com/jawnsy/Math-Random-ISAAC repository.type = git ; munge files [PkgVersion] ; inject $VERSION into modules [PodWeaver] ; weave POD together [NextRelease] ; update next version in Changes ; generate expected files automagically [License] ; based on the `license' [Readme] ; a small boilerplate blurb [MetaYAML] ; generate a META.yml [ExecDir] ; include `bin/' as executables [ShareDir] ; include `share/' for File::ShareDir [MakeMaker] ; create Makefile.PL (EUMM) [Manifest] ; build MANIFEST file (do this last) ; verify and release the distribution [TestRelease] ; run tests before releasing [ConfirmRelease] ; ask to confirm release/upload [UploadToCPAN] ; push it to CPAN [Git::Push] ; push everything to remote repository META.yml000644001750001750 133411527357352 14546 0ustar00jonjon000000000000Math-Random-ISAAC-1.004--- abstract: 'Perl interface to the ISAAC PRNG algorithm' author: - 'Jonathan Yu ' build_requires: Test::More: 0.62 Test::NoWarnings: 0.084 configure_requires: ExtUtils::MakeMaker: 6.31 dynamic_config: 0 generated_by: 'Dist::Zilla version 4.200003, CPAN::Meta::Converter version 2.102400' license: unrestricted meta-spec: url: http://module-build.sourceforge.net/META-spec-v1.4.html version: 1.4 name: Math-Random-ISAAC recommends: Math::Random::ISAAC::XS: 0 requires: perl: 5.006 resources: bugtracker: http://rt.cpan.org/NoAuth/Bugs.html?Dist=Math-Random-ISAAC homepage: http://search.cpan.org/dist/Math-Random-ISAAC repository: git://github.com/jawnsy/Math-Random-ISAAC.git version: 1.004 MANIFEST000644001750001750 61211527357352 14404 0ustar00jonjon000000000000Math-Random-ISAAC-1.004Changes LICENSE MANIFEST MANIFEST.SKIP META.yml Makefile.PL README dist.ini examples/benchmark.pl examples/distribution.pl lib/Math/Random/ISAAC.pm lib/Math/Random/ISAAC/PP.pm t/01compile.t t/02sequence.t t/03memory.t t/04uniform.t t/05fallback.t t/06exceptions.t t/release-dist-manifest.t t/release-kwalitee.t t/release-pod-coverage.t t/release-pod-syntax.t t/release-portability.t weaver.ini weaver.ini000600001750001750 123011527357352 15252 0ustar00jonjon000000000000Math-Random-ISAAC-1.004[@CorePrep] ; commonly-needed POD prep work [Name] ; add the abstract to the NAME section [Version] ; add version number from $VERSION [Region / prelude] ; include from =begin prelude section [Generic / SYNOPSIS] [Generic / DESCRIPTION] [Collect / METHODS] ; collect entries with =method prefix command = method [Leftovers] ; pass everything else through untouched [Region / postlude] ; include from =begin postlude section [Bugs] ; details about bug reporting [Authors] ; authors from dist.ini [Legal] ; legal clause (copyright and license) Makefile.PL000644001750001750 206411527357352 15250 0ustar00jonjon000000000000Math-Random-ISAAC-1.004 use strict; use warnings; BEGIN { require 5.006; } use ExtUtils::MakeMaker 6.31; my %WriteMakefileArgs = ( 'ABSTRACT' => 'Perl interface to the ISAAC PRNG algorithm', 'AUTHOR' => 'Jonathan Yu ', 'BUILD_REQUIRES' => { 'Test::More' => '0.62', 'Test::NoWarnings' => '0.084' }, 'CONFIGURE_REQUIRES' => { 'ExtUtils::MakeMaker' => '6.31' }, 'DISTNAME' => 'Math-Random-ISAAC', 'EXE_FILES' => [], 'LICENSE' => 'unrestricted', 'NAME' => 'Math::Random::ISAAC', 'PREREQ_PM' => {}, 'VERSION' => '1.004', 'test' => { 'TESTS' => 't/*.t' } ); unless ( eval { ExtUtils::MakeMaker->VERSION(6.56) } ) { my $br = delete $WriteMakefileArgs{BUILD_REQUIRES}; my $pp = $WriteMakefileArgs{PREREQ_PM}; for my $mod ( keys %$br ) { if ( exists $pp->{$mod} ) { $pp->{$mod} = $br->{$mod} if $br->{$mod} > $pp->{$mod}; } else { $pp->{$mod} = $br->{$mod}; } } } delete $WriteMakefileArgs{CONFIGURE_REQUIRES} unless eval { ExtUtils::MakeMaker->VERSION(6.52) }; WriteMakefile(%WriteMakefileArgs); t000700001750001750 011527357352 13366 5ustar00jonjon000000000000Math-Random-ISAAC-1.00403memory.t000600001750001750 124211527357352 15366 0ustar00jonjon000000000000Math-Random-ISAAC-1.004/t#!/usr/bin/perl -T # Test for memory leaks use strict; use warnings; use Test::More; use Math::Random::ISAAC::PP (); if (exists($INC{'Devel/Cover.pm'})) { plan skip_all => 'This test is not compatible with Devel::Cover'; } eval { require Test::LeakTrace; }; if ($@) { plan skip_all => 'Test::LeakTrace required to test memory leaks'; } plan tests => 2; Test::LeakTrace->import; no_leaks_ok(sub { my $obj = Math::Random::ISAAC::PP->new(time); for (0..10) { $obj->irand(); } }, '->irand does not leak memory'); no_leaks_ok(sub { my $obj = Math::Random::ISAAC::PP->new(time); for (0..30) { $obj->rand(); } }, '->rand does not leak memory'); MANIFEST.SKIP000600001750001750 162411527357352 15165 0ustar00jonjon000000000000Math-Random-ISAAC-1.004# Avoid version control files. \bRCS\b \bCVS\b \bSCCS\b ,v$ \B\.svn\b \B\.git\b \B\.gitignore\b \b_darcs\b \B\.cvsignore$ # Avoid VMS specific MakeMaker generated files \bDescrip.MMS$ \bDESCRIP.MMS$ \bdescrip.mms$ # Avoid Makemaker generated and utility files. \bMANIFEST\.bak \bMakefile$ \bblib/ \bMakeMaker-\d \bpm_to_blib\.ts$ \bpm_to_blib$ \bblibdirs\.ts$ # 6.18 through 6.25 generated this # Avoid Module::Build generated and utility files. \bBuild$ \b_build/ \bBuild.bat$ \bBuild.COM$ \bBUILD.COM$ \bbuild.com$ # Avoid temp and backup files. ~$ \.old$ \#$ \b\.# \.bak$ \.tmp$ \.# \.rej$ # Avoid OS-specific files/dirs # Mac OSX metadata \B\.DS_Store # Mac OSX SMB mount metadata files \B\._ # Avoid Devel::Cover and Devel::CoverX::Covered files. \bcover_db\b \bcovered\b # Avoid MYMETA files ^MYMETA\. # Test::Kwalitee cache files. ^Debian_CPANTS\.txt # Debian package control files ^debian/ 01compile.t000600001750001750 33611527357352 15467 0ustar00jonjon000000000000Math-Random-ISAAC-1.004/t#!/usr/bin/perl -T use strict; use warnings; use Test::More tests => 3; use Test::NoWarnings; # 1 test # Check that we can load the module BEGIN { use_ok('Math::Random::ISAAC::PP'); use_ok('Math::Random::ISAAC'); } 04uniform.t000600001750001750 457711527357352 15554 0ustar00jonjon000000000000Math-Random-ISAAC-1.004/t#!/usr/bin/perl -T # Check the generated sequence for uniformity use strict; use warnings; use Test::More; # Test the Pure Perl version only; the XS version has its own tests use Math::Random::ISAAC::PP (); unless ($ENV{AUTOMATED_TESTING} or $ENV{RELEASE_TESTING}) { plan skip_all => 'Author tests not required for installation'; } my %MODULES = ( 'Statistics::Test::RandomWalk' => 0, ); while (my ($module, $version) = each %MODULES) { eval "use $module $version"; next unless $@; if ($ENV{RELEASE_TESTING}) { die 'Could not load release-testing module ' . $module; } else { plan skip_all => $module . ' not available for testing'; } } my $no_bins = 20; plan tests => 3 * $no_bins; # Default unseeded sequence sub runtest { my ($rng) = @_; my $tester = Statistics::Test::RandomWalk->new(); $tester->set_data(sub { $rng->rand(); }, 1_000_000); my ($quant, $got, $expected) = $tester->test($no_bins); for (0 .. $no_bins-1) { ok((abs($got->[$_] - $expected->[$_]) / $expected->[$_]) < 0.02, 'Quantile ' . $quant->[$_] . ' is within 2% of the expected ' . $expected->[$_]); } if ($ENV{TEST_VERBOSE}) { diag('Output summary:'); diag($tester->data_to_report($quant, $got, $expected)); } } runtest(Math::Random::ISAAC::PP->new()); # First 32 bits of fractional parts of cube roots of 64 primes (2..311) # Copied from the SHA256 algorithm :-) runtest(Math::Random::ISAAC::PP->new( 0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5, 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174, 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da, 0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967, 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85, 0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070, 0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3, 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2 )); # Run the test with the current time as a seed runtest(Math::Random::ISAAC::PP->new(time)); 02sequence.t000600001750001750 1722411527357352 15714 0ustar00jonjon000000000000Math-Random-ISAAC-1.004/t#!/usr/bin/perl -T # Check the generated sequence against the reference implementation use strict; use warnings; use Test::More; # Test the Pure Perl version only; the XS version has its own tests use Math::Random::ISAAC::PP (); my @results = ( 405143795, 806046349, 807101986, 2961886497, 695195257, 2572289769, 3019876533, 264870948, 1594302383, 1378164207, 2303672770, 3427572475, 2529378164, 880588573, 3373240253, 2790847866, 3317866008, 1649015337, 3135336442, 633893309, 4106706468, 1521740473, 2890206095, 371838884, 1501295, 4068232461, 1734642455, 96489422, 1154744185, 3333214735, 1194318228, 2216767940, 3939805440, 3223247373, 2657111163, 4220128921, 48331631, 3904173607, 3338935982, 1121033431, 2740513684, 432677208, 1810288257, 1267770590, 653293389, 1317245706, 613602422, 3112172222, 1734133934, 1291702868, 1564213482, 2075811501, 1866864656, 3203809002, 1928033915, 3983447611, 2955280749, 399212223, 2816241238, 4099980785, 536743428, 2418750589, 46192811, 2563456907, 1865783865, 2502001247, 2418465150, 3727959318, 2299163660, 254372324, 780052973, 961251919, 467607504, 366306740, 3136307309, 1303126235, 53844018, 3813147349, 3428843266, 154512750, 2085865906, 2970311977, 1337693374, 3622077766, 3083838012, 2131238042, 3768171249, 2625487651, 3090263316, 1532375297, 4199887259, 101576020, 3309404452, 1985940922, 450091477, 1057483849, 3713926854, 3257983660, 3334084977, 2629925836, 280111650, 2113703039, 3006333747, 542453998, 3690171023, 3801845, 8296099, 912622081, 148887119, 1651879155, 1026123419, 1798260024, 2966172523, 489702379, 449959780, 1281710980, 2054314930, 3019660390, 2159327509, 2999704036, 697491398, 3750487368, 3004223598, 1130595782, 1154934931, 1153750941, 3820691556, 3827213413, 1073007728, 2636229698, 1730950949, 2755271938, 4253331867, 1534046514, 1257506966, 3780116646, 2091586294, 2341369148, 4213519444, 899335014, 1736584005, 688525632, 2917590056, 1620438987, 2581125606, 2780141597, 858559958, 2942106795, 371154086, 407162594, 4290292572, 2197605099, 1240267130, 2053175997, 4183317050, 1320598834, 993292290, 4103278010, 1562498334, 1692984308, 1384128424, 1909362812, 2267513764, 123853952, 1548785736, 1102719708, 2117031200, 2244341442, 915225856, 1606927859, 3091847045, 3646891443, 2038439893, 3206824918, 906838477, 1696272832, 2149222858, 2342415252, 4259480516, 3428739444, 724519945, 2334220456, 3690299137, 1990859854, 300974874, 1416707351, 3382322745, 1278688890, 166126975, 1911962375, 2078535726, 747666142, 3858008566, 185390810, 3043418444, 261445993, 2699391243, 2161689310, 2574378134, 3354377263, 2544143955, 763649037, 3776531214, 2905318528, 3575985490, 3397978929, 1611008763, 2312825127, 1449009705, 1135329820, 64820389, 3148730756, 2660734722, 795187331, 4078153196, 1645991882, 3058108468, 1278804422, 839027640, 2649588292, 1720743508, 168211058, 1250870832, 1107809135, 1048218441, 327621607, 3212506254, 1038147385, 243680578, 2349402659, 2945508510, 2540051550, 911910508, 7594818, 2626339911, 1868031950, 3586031610, 2305105284, 1408732842, 2171853828, 3607830032, 1136764283, 281585067, 3983195490, 797183555, 1215551774, 1240732668, 1569300929, 3550710012, 2529533172, 1164910301, 1037172771, 2724522291, 3542701797, 3642402616, 3882734393, 2053665039, 1700047834, 2428569431, 190727007, 2944212920, 26296275, 1779797264, 3103194442, 3266947638, 2530879061, 4263396053, 1457966369, 3585267536, 1915349633, 1575516859, 3065632614, 504783180, 997232537, 1559766221, 2764705009, 1658001681, 2094884399, 3416135011, 2041465872, 135035372, 403180686, 1242179644, 1037999929, 163803024, 2908124739, 136922982, 3024183165, 1436019727, 2030019944, 2343364142, 1099481037, 3363602438, 2947099245, 1358725524, 3404259002, 871815089, 1394891641, 1628543578, 2117163755, 3881517513, 3534306129, 3964055734, 517209934, 1560428133, 2918628387, 4160065403, 3841172074, 207035005, 3979732462, 3940466348, 817678180, 1727127723, 2188245641, 228359806, 3890374017, 3583577595, 46774596, 1091754348, 1072817444, 3277735296, 4261344813, 3091174778, 3217553356, 3037777422, 3446935975, 81481235, 1989167981, 140541700, 924374423, 1187030773, 2215031095, 815528824, 4157862815, 2351893845, 3323195735, 310236208, 1925780349, 1755550552, 130190545, 2223985162, 3710763477, 2475209019, 686279544, 66816244, 2964868731, 348651675, 2286774309, 566325740, 134866068, 1779463561, 307845657, 196290111, 1301261954, 714609178, 2953404602, 1728619196, 899753141, 3167399661, 692926437, 3557154520, 2671370969, 562256973, 3902478907, 1935971403, 3173928996, 1779580759, 873486988, 1523635120, 3422764259, 3575580989, 1453326819, 27901296, 2291250139, 330160418, 1031264674, 243142247, 3611259604, 2440814274, 2743034879, 601313102, 980214665, 101109663, 3725716788, 1892455598, 3406753354, 334348491, 4264125980, 3681402518, 3012090220, 867975261, 2798723329, 792132230, 2112698479, 3862185041, 3445082103, 453889473, 3444173787, 2659865050, 312498507, 1624561144, 2445859109, 3829206971, 1563055151, 1159626440, 724979804, 935390469, 593797546, 2169225804, 3819332313, 4072000517, 3098594556, 2958605051, 988429804, 218269316, 1689194479, 554645797, 3061760314, 2534829332, 4158770640, 1524326631, 3576258236, 679687458, 1626187994, 2076665873, 2896160413, 816550892, 57239060, 367240633, 3972390033, 490442391, 1920328311, 1401823054, 1823565787, 2812474370, 766729726, 2830942765, 3636824682, 1783798539, 265566563, 2948692631, 2486975604, 2501085033, 1867384690, 2974004872, 991487826, 1775428782, 2164771327, 3451675362, 1468088655, 2340897662, 2802716929, 2447031397, 1310928080, 580340149, 3610798086, 3015963211, 1625051655, 198941744, 443607017, 4085019093, 1152949000, 3033725302, 3020826556, 4292840064, 2621512234, 3505894269, 4015247044, 3970225546, 194130432, 3475169380, 2394923779, 4157571404, 850274859, 3051437486, 3382245887, 882460592, 701461198, 400789381, 4088553769, 3562892673, 162778776, 2248488632, 3849924123, 313353241, 4126612585, 3418929090, 2405766745, 2697753843, 3616323998, 1371573635, 703943753, 3069715, 950543603, 1461067254, 1951589145, 629739054, 3343131699, 1247765333, 1787027936, 2185031094, 4057220331, 2285375639, 1575187518, 1187663770, 3627484295, 3991672138, 1128209147, 4126856527, 2564501428, 3829983597, 4132496584, 1270198057, 2642763401, 3310147931, 1188650149, 4017355760, 4181980786, 2260357759, 2643269896, 4080077970, 87297557, 131070681, 568480894, 2350378992, 3542868064, 2327461883, 2496921893, 3316152136, 2186027017, 1942021986, 3456025263, 241979827, 2825881438, 3160502983, 4159935985, 1064663475, 2057377005, 375066645, 3576763930, 3815699899, 3692379743, 487372827, 3472867655, 1618601166, 3272879503, 2786566275, 3041914223, 3284647468, 39930559, 1874185814, 3525212524, 755598814, 3925360995, 3248954940, 679991663, 1472514341, 99607188, 2283106643, 2586887400, 2287247521, 38813565, 215412609, 497349210, 3908712544, 853774963, 1283871446, 2595464239, 2662170480, 2204991491, 1824422197, 1913979613, 1514698076, 122256558, 3729141581, 2465562279, 534932704, 667427458, 3605802795, 2160518146, 3464953340, 1382325612, 3348688967, 1169876486, 2300243017, 1724478272, 2628017692, 1116103068, 4126788667, 1317157587, 3235238954, 2934018198, 1028035331, 4266439552, 3385688204, 933854710, 814707999, 661516468, 3858479559, 2546606192, ); plan tests => scalar(@results); my $rng = Math::Random::ISAAC::PP->new(); foreach my $num (@results) { is($rng->irand(), $num); } 05fallback.t000600001750001750 202211527357352 15614 0ustar00jonjon000000000000Math-Random-ISAAC-1.004/t#!/usr/bin/perl -T # Tests use of the Pure Perl interface use strict; use warnings; use Test::More; # Cannot 'use' because we might skip tests require Test::NoWarnings; eval { require Test::Without::Module; require Math::Random::ISAAC::XS; }; if ($@) { plan skip_all => 'Test::Without::Module and Math::Random::ISAAC::XS ' . 'required to test fallback ability'; } plan tests => 7; # Delay loading of test hooks Test::NoWarnings->import(); # Hide the XS version Test::Without::Module->import('Math::Random::ISAAC::XS'); # Try to load Math::Random::ISAAC eval { require Math::Random::ISAAC; Math::Random::ISAAC->import(); }; ok(!$@, 'Math::Random::ISAAC interface compiled and loaded'); my $rng = Math::Random::ISAAC->new(); isa_ok($rng, 'Math::Random::ISAAC'); ok(defined $Math::Random::ISAAC::DRIVER, 'The DRIVER is defined'); is($Math::Random::ISAAC::DRIVER, 'PP', 'Pure Perl port is loaded'); ok($rng->irand() > 0, 'Generate first integer in sequence'); ok($rng->rand() > 0, 'Generate second number in sequence'); 06exceptions.t000600001750001750 75411527357352 16231 0ustar00jonjon000000000000Math-Random-ISAAC-1.004/t#!/usr/bin/perl -T # Tests exceptions raised with obvious mistakes use strict; use warnings; use Test::More tests => 4; use Test::NoWarnings; use Math::Random::ISAAC; # Incorrectly called methods { my $obj = Math::Random::ISAAC->new(); eval { $obj->new(); }; ok($@, '->new called as an object method'); eval { Math::Random::ISAAC->rand(); }; ok($@, '->rand called as a class method'); eval { Math::Random::ISAAC->irand(); }; ok($@, '->irand called as a class method'); } release-kwalitee.t000644001750001750 43311527357352 17127 0ustar00jonjon000000000000Math-Random-ISAAC-1.004/t#!perl BEGIN { unless ($ENV{RELEASE_TESTING}) { require Test::More; Test::More::plan(skip_all => 'these tests are for release candidate testing'); } } use Test::More; eval "use Test::Kwalitee"; plan skip_all => "Test::Kwalitee required for testing kwalitee" if $@; examples000700001750001750 011527357352 14741 5ustar00jonjon000000000000Math-Random-ISAAC-1.004benchmark.pl000600001750001750 1051211527357352 17410 0ustar00jonjon000000000000Math-Random-ISAAC-1.004/examples#!/usr/bin/perl -T # examples/benchmark.pl # Compare the ISAAC RNG implementations between each other, and between # other algorithms. # # $Id$ use strict; use warnings; eval { require Benchmark::ProgressBar; Benchmark::ProgressBar->import('cmpthese'); }; if ($@) { require Benchmark; Benchmark->import('cmpthese'); } =head1 NAME benchmark.pl - Test performance of various random number generators =head1 VERSION Version 1.0 ($Id$) =cut use version; our $VERSION = qv('1.0'); my $LOOPS = 10_000; # Number of sequences to generate my $NUMTESTS = 2_500; # Numbers to generate each test my %TESTING; # modules we're testing =head1 SYNOPSIS Usage: benchmark.pl This script will automatically detect available PRNG algorithms and compare them using the Benchmark module. It will keep Pure Perl and C/XS modules separate, so as to compare apples to apples. =head1 DESCRIPTION This script currently knows about the following modules, and will compare them if they are installed. This module will first compile all of the modules; loading time is also benchmarked and compared, but separately from the rest of the operation. For object oriented random number algorithms, the constructor is called during the benchmark loop, so overhead due to initialization is fairly counted too. It will get 5 million integers from each, so as to provide a good sample size. You can tune this, but you'll have to edit the file. =head2 ALGORITHMS =over =item * Math::Random::ISAAC::PP (Perl) =item * Math::Random::ISAAC::XS (XS/C) =item * Math::Random::MT (XS/C) =item * Math::Random::MT::Perl (Perl) =item * Math::Random::TT800 (XS/C) =item * Math::Random::random_uniform_integer (XS/C) =item * Perl core rand() function =back =cut print "Loading modules, please wait...\n"; load('Math::Random'); load('Math::Random::ISAAC::XS'); load('Math::Random::ISAAC::PP'); load('Math::Random::TT800'); load('Math::Random::MT'); load('Math::Random::MT::Perl'); print 'Setting up C/XS number generators... '; my $seed = time; my $code = {}; # Set up all of the modules we've just loaded $code->{'Core'} = sub { my $var; srand($seed); for (1..$NUMTESTS) { $var = rand(); } }; if ($TESTING{'Math::Random'}) { $code->{'Math::Random'} = sub { my $var; Math::Random::random_set_seed($seed, $seed); for (1..$NUMTESTS) { $var = Math::Random::random_uniform(); } }; } if ($TESTING{'Math::Random::ISAAC::XS'}) { $code->{'ISAAC::XS'} = sub { my $rng = Math::Random::ISAAC::XS->new($seed); my $var; for (1..$NUMTESTS) { $var = $rng->irand(); } }; } if ($TESTING{'Math::Random::ISAAC::PP'}) { $code->{'ISAAC::PP'} = sub { my $rng = Math::Random::ISAAC::PP->new($seed); my $var; for (1..$NUMTESTS) { $var = $rng->irand(); } }; } if ($TESTING{'Math::Random::TT800'}) { $code->{'TT800'} = sub { my $rng = Math::Random::TT800->new($seed); my $var; for (1..$NUMTESTS) { $var = $rng->next_int(); } }; } if ($TESTING{'Math::Random::MT'}) { $code->{'MT'} = sub { my $rng = Math::Random::MT->new($seed); my $var; for (1..$NUMTESTS) { $var = $rng->rand(); } }; } if ($TESTING{'Math::Random::MT::Perl'}) { $code->{'MT::Perl'} = sub { my $rng = Math::Random::MT::Perl->new($seed); my $var; for (1..$NUMTESTS) { $var = $rng->rand(); } }; } print "done.\n"; print "Running comparisons (this might take a while)...\n\n"; cmpthese($LOOPS, $code); sub load { my ($module) = @_; print ' ' . $module . '... '; eval 'use ' . $module; if ($@) { print 'not installed.'; $TESTING{$module} = 0; } else { print 'done.'; $TESTING{$module} = 1; } print "\n"; return; } =head1 AUTHOR Jonathan Yu Ejawnsy@cpan.orgE =head1 SUPPORT For support details, please look at C and use the corresponding support methods. =head1 LICENSE This has the same copyright and licensing terms as L. =head1 SEE ALSO L, L, L, L, L, L, =cut release-pod-syntax.t000644001750001750 45011527357352 17427 0ustar00jonjon000000000000Math-Random-ISAAC-1.004/t#!perl BEGIN { unless ($ENV{RELEASE_TESTING}) { require Test::More; Test::More::plan(skip_all => 'these tests are for release candidate testing'); } } use Test::More; eval "use Test::Pod 1.41"; plan skip_all => "Test::Pod 1.41 required for testing POD" if $@; all_pod_files_ok(); release-portability.t000644001750001750 47711527357352 17674 0ustar00jonjon000000000000Math-Random-ISAAC-1.004/t#!perl BEGIN { unless ($ENV{RELEASE_TESTING}) { require Test::More; Test::More::plan(skip_all => 'these tests are for release candidate testing'); } } use Test::More; eval "use Test::Portability::Files"; plan skip_all => "Test::Portability::Files required for testing portability" if $@; run_tests(); distribution.pl000600001750001750 504311527357352 20160 0ustar00jonjon000000000000Math-Random-ISAAC-1.004/examples#!/usr/bin/perl -T # examples/distribution.pl # Check the uniformity of the distribution generated by ISAAC by # charting it. # # $Id$ use strict; use warnings; use Math::Random::ISAAC; use Chart::Bars; =head1 NAME distribution.pl - Show the distribution of numbers generated =head1 VERSION Version 1.0 ($Id$) =cut use version; our $VERSION = qv('1.0'); =head1 SYNOPSIS Usage: distribution.pl This script plots the distribution of data generated by ISAAC. It's a pretty simple module but might eventually make something neat, as the data is being plotted randomly. However it's unlikely to do so, since ISAAC is uniformly distributed. It outputs a file named C in the current working directory. Currently this is hardcoded, but this should probably change in the future. =head1 DESCRIPTION This module uses 10 million numbers for graphing, so hopefully it removes any potential slight nonuniformities caused by the seed. Currently it just uses an instance seeded once with the time. This isn't quite as good as using an ISAAC instance to initialize another one, since it only begins with one seed value and must do enough mixing to start getting some random-looking data. Most likely though, the data will just be a uniform-looking graph. If you find otherwise then you've found a bias with ISAAC, and that's a potential security bug. In that case, you should contact Bob Jenkins, author of the algorithm. =cut my $no_bins = 50; my $size = 1 / $no_bins; my $count = 10_000_000; my $rng = Math::Random::ISAAC->new(time); my @bins; print "Generating some data (this might take a while)...\n"; for (1..$count) { my $rand = $rng->rand(); $bins[$rand*$no_bins]++; } print "Creating a chart...\n"; my $chart = Chart::Bars->new(640, 480); $chart->set( title => 'ISAAC Data Distribution', legend => 'none', x_label => 'Quantile', y_label => 'Number of Items', spaced_bars => 0, min_val => 0, max_val => $count / ($no_bins-1), max_y_ticks => 10, ); $chart->add_dataset (1..$no_bins); $chart->add_dataset (@bins); $chart->png('chart.png'); =head1 AUTHOR Jonathan Yu Ejawnsy@cpan.orgE =head1 SUPPORT For support details, please look at C and use the corresponding support methods. =head1 LICENSE This has the same copyright and licensing terms as L. =head1 SEE ALSO L, L, L, =cut Random000700001750001750 011527357352 16002 5ustar00jonjon000000000000Math-Random-ISAAC-1.004/lib/MathISAAC.pm000600001750001750 2234111527357352 17343 0ustar00jonjon000000000000Math-Random-ISAAC-1.004/lib/Math/Randompackage Math::Random::ISAAC; BEGIN { $Math::Random::ISAAC::VERSION = '1.004'; } # ABSTRACT: Perl interface to the ISAAC PRNG algorithm use strict; use warnings; use Carp (); our $DRIVER = 'PP'; # Try to load the XS version first eval { require Math::Random::ISAAC::XS; $DRIVER = 'XS'; }; # Fall back on the Perl version if ($@) { require Math::Random::ISAAC::PP; } # Wrappers around the actual methods sub new { my ($class, @seed) = @_; Carp::croak('You must call this as a class method') if ref($class); my $self = { }; if ($DRIVER eq 'XS') { $self->{backend} = Math::Random::ISAAC::XS->new(@seed); } else { $self->{backend} = Math::Random::ISAAC::PP->new(@seed); } bless($self, $class); return $self; } # This package should have an interface similar to the builtin Perl # random number routines; these are methods, not functions, so they # are not problematic ## no critic (ProhibitBuiltinHomonyms) sub rand { my ($self) = @_; Carp::croak('You must call this method as an object') unless ref($self); return $self->{backend}->rand(); } sub irand { my ($self) = @_; Carp::croak('You must call this method as an object') unless ref($self); return $self->{backend}->irand(); } 1; __END__ =pod =head1 NAME Math::Random::ISAAC - Perl interface to the ISAAC PRNG algorithm =head1 VERSION version 1.004 =head1 SYNOPSIS use Math::Random::ISAAC; my $rng = Math::Random::ISAAC->new(@seeds); for (0..30) { print 'Result: ' . $rng->irand() . "\n"; } =head1 DESCRIPTION As with other Pseudo-Random Number Generator (PRNG) algorithms like the Mersenne Twister (see L), this algorithm is designed to take some seed information and produce seemingly random results as output. However, ISAAC (Indirection, Shift, Accumulate, Add, and Count) has different goals than these commonly used algorithms. In particular, it's really fast - on average, it requires only 18.75 machine cycles to generate a 32-bit value. This makes it suitable for applications where a significant amount of random data needs to be produced quickly, such solving using the Monte Carlo method or for games. The results are uniformly distributed, unbiased, and unpredictable unless you know the seed. The algorithm was published by Bob Jenkins in the late 90s and despite the best efforts of many security researchers, no feasible attacks have been found to date. =head2 USAGE WARNING There was no method supplied to provide the initial seed data by the author. On his web site, Bob Jenkins writes: Seeding a random number generator is essentially the same problem as encrypting the seed with a block cipher. In the same spirit, by default, this module does not seed the algorithm at all -- it simply fills the state with zeroes -- if no seed is provided. The idea is to remind users that selecting good seed data for their purpose is important, and for the module to conveniently set it to something like C behind-the-scenes hurts users in the long run, since they don't understand the limitations of doing so. The type of seed you might want to use depends entirely on the purpose of using this algorithm in your program in the first place. Here are some possible seeding methods: =over =item 1 Math::TrulyRandom The L module provides a way of obtaining truly random data by using timing interrupts. This is probably one of the better ways to seed the algorithm. =item 2 /dev/random Using the system random device is, in principle, the best idea, since it gathers entropy from various sources including interrupt timing, other device interrupts, etc. However, it's not portable to anything other than Unix-like platforms, and might not produce good data on some systems. =item 3 localtime() This works for basic things like simulations, but results in not-so-random output, especially if you create new instances quickly (as the seeds would be the same within per-second resolution). =item 4 Time::HiRes In theory, using L is the same as option (2), but you get a higher resolution time so you're less likely to have the same seed twice. Note that you need to transform the output into an integer somehow, perhaps by taking the least significant bits or using a hash function. This would be less prone to duplicate instances, but it's still not ideal. =back =head1 METHODS =head2 new Math::Random::ISAAC->new( @seeds ) Creates a C object, based upon either the optimized C/XS version of the algorithm, L, or falls back to the included Pure Perl module, L. Example code: my $rng = Math::Random::ISAAC->new(time); This method will return an appropriate B object or throw an exception on error. =head2 rand $rng->rand() Returns a random double-precision floating point number which is normalized between 0 and 1 (inclusive; it's a closed interval). Internally, this simply takes the uniformly distributed unsigned integer from C<$rng-Eirand()> and divides it by C<2**32-1> (maximum unsigned integer size) Example code: my $next = $rng->rand(); This method will return a double-precision floating point number or throw an exception on error. =head2 irand $rng->irand() Returns the next unsigned 32-bit random integer. It will return a value with a value such that: B<0 E= x E= 2**32-1>. Example code: my $next = $rng->irand(); This method will return a 32-bit unsigned integer or throw an exception on error. =head1 PURPOSE The intent of this module is to provide single simple interface to the two compatible implementations of this module, namely, L and L. If, for some reason, you need to determine what version of the module is actually being included by C, then: print 'Backend type: ', $Math::Random::ISAAC::DRIVER, "\n"; In order to force use of one or the other, simply load the appropriate module: use Math::Random::ISAAC::XS; my $rng = Math::Random::ISAAC::XS->new(); # or use Math::Random::ISAAC::PP; my $rng = Math::Random::ISAAC::PP->new(); =head1 ACKNOWLEDGEMENTS =over =item * Special thanks to Bob Jenkins Ebob_jenkins@burtleburtle.netE for devising this very clever algorithm and releasing it into the public domain. =item * Thanks to John L. Allen (contact unknown) for providing a Perl port of the original ISAAC code, upon which C is heavily based. His version is available on Bob's web site, in the SEE ALSO section. =back =head1 SEE ALSO L, the C/XS optimized version of this module, which will be used automatically if available. L, Bob Jenkins' page about ISAAC, which explains the algorithm as well as potential attacks. L, a paper entitled "On the pseudo-random generator ISAAC," which claims there are many seeds which will produce non-uniform results. The author, Jean-Philippe Aumasson, argues ISAAC should be using rotations (circular shifts) instead of normal shifts to increase diffusion of the state, among other things. L, a paper by Marina Pudovkina discussing plaintext attacks on the ISAAC keystream generator. Among other things, it notes that the time complexity is B, so it remains a secure cipher for practical applications. =head1 CAVEATS =over =item * There is no method that allows re-seeding of algorithms. This is not really necessary because one can simply call C again with the new seed data periodically. But he also provides a simple workaround: As ISAAC is intended to be a secure cipher, if you want to reseed it, one way is to use some other cipher to seed some initial version of ISAAC, then use ISAAC's output as a seed for other instances of ISAAC whenever they need to be reseeded. =item * There is no way to clone a PRNG instance. I'm not sure why this is might even be necessary or useful. File a bug report with an explanation why and I'll consider adding it to the next release. =back =head1 BUGS Please report any bugs or feature requests on the bugtracker website http://rt.cpan.org/NoAuth/Bugs.html?Dist=Math-Random-ISAAC When submitting a bug or request, please include a test-file or a patch to an existing test-file that illustrates the bug or desired feature. =head1 AUTHOR Jonathan Yu =head1 COPYRIGHT AND LICENSE Legally speaking, this package and its contents are: Copyright (c) 2011 by Jonathan Yu . But this is really just a legal technicality that allows the author to offer this package under the public domain and also a variety of licensing options. For all intents and purposes, this is public domain software, which means you can do whatever you want with it. The software is provided "AS IS", without warranty of any kind, express or implied, including but not limited to the warranties of merchantability, fitness for a particular purpose and noninfringement. In no event shall the authors or copyright holders be liable for any claim, damages or other liability, whether in an action of contract, tort or otherwise, arising from, out of or in connection with the software or the use or other dealings in the software. =cut release-pod-coverage.t000644001750001750 76511527357352 17705 0ustar00jonjon000000000000Math-Random-ISAAC-1.004/t#!perl BEGIN { unless ($ENV{RELEASE_TESTING}) { require Test::More; Test::More::plan(skip_all => 'these tests are for release candidate testing'); } } use Test::More; eval "use Test::Pod::Coverage 1.08"; plan skip_all => "Test::Pod::Coverage 1.08 required for testing POD coverage" if $@; eval "use Pod::Coverage::TrustPod"; plan skip_all => "Pod::Coverage::TrustPod required for testing POD coverage" if $@; all_pod_coverage_ok({ coverage_class => 'Pod::Coverage::TrustPod' }); release-dist-manifest.t000644001750001750 46611527357352 20077 0ustar00jonjon000000000000Math-Random-ISAAC-1.004/t#!perl BEGIN { unless ($ENV{RELEASE_TESTING}) { require Test::More; Test::More::plan(skip_all => 'these tests are for release candidate testing'); } } use Test::More; eval "use Test::DistManifest"; plan skip_all => "Test::DistManifest required for testing the manifest" if $@; manifest_ok(); ISAAC000700001750001750 011527357352 16622 5ustar00jonjon000000000000Math-Random-ISAAC-1.004/lib/Math/RandomPP.pm000600001750001750 2025311527357352 17662 0ustar00jonjon000000000000Math-Random-ISAAC-1.004/lib/Math/Random/ISAACpackage Math::Random::ISAAC::PP; BEGIN { $Math::Random::ISAAC::PP::VERSION = '1.004'; } # ABSTRACT: Pure Perl port of the ISAAC PRNG algorithm use strict; use warnings; use Carp (); sub new { my ($class, @seed) = @_; my $seedsize = scalar(@seed); my @mm; $#mm = $#seed = 255; # predeclare arrays with 256 slots # Zero-fill our seed data for ($seedsize .. 255) { $seed[$_] = 0; } my $self = { randrsl => \@seed, randcnt => 0, randmem => \@mm, randa => 0, randb => 0, randc => 0, }; bless($self, $class); $self->_randinit(); return $self; } # This package should have an interface similar to the builtin Perl # random number routines; these are methods, not functions, so they # are not problematic ## no critic (ProhibitBuiltinHomonyms) sub rand { my ($self) = @_; return ($self->irand() / (2**32-1)); } sub irand { my ($self) = @_; # Reset the sequence if we run out of random stuff if (!$self->{randcnt}--) { # Call method like this because of our hack above _isaac($self); $self->{randcnt} = 255; } return sprintf('%u', $self->{randrsl}->[$self->{randcnt}]); } # C-style for loops are used a lot since this is a port of the C version ## no critic (ProhibitCStyleForLoops) # Numbers are specified in hex, so they don't need separators ## no critic (RequireNumberSeparators) sub _isaac { my ($self) = @_; # Use integer math use integer; my $mm = $self->{randmem}; my $r = $self->{randrsl}; # $a and $b are reserved (see 'sort') my $aa = $self->{randa}; my $bb = ($self->{randb} + (++$self->{randc})) & 0xffffffff; my ($x, $y); # temporary storage # The C code deals with two halves of the randmem separately; we deal with # it here in one loop, by adding the &0xff parts. These calls represent the # rngstep() macro, but it's inlined here for speed. for (my $i = 0; $i < 256; $i += 4) { $x = $mm->[$i ]; $aa = (($aa ^ ($aa << 13)) + $mm->[($i + 128) & 0xff]); $aa &= 0xffffffff; # Mask out high bits for 64-bit systems $mm->[$i ] = $y = ($mm->[($x >> 2) & 0xff] + $aa + $bb) & 0xffffffff; $r->[$i ] = $bb = ($mm->[($y >> 10) & 0xff] + $x) & 0xffffffff; # I don't actually know why the "0x03ffffff" stuff is for. It was in # John L. Allen's code. If you can explain this please file a bug report. $x = $mm->[$i+1]; $aa = (($aa ^ (0x03ffffff & ($aa >> 6))) + $mm->[($i+1+128) & 0xff]); $aa &= 0xffffffff; $mm->[$i+1] = $y = ($mm->[($x >> 2) & 0xff] + $aa + $bb) & 0xffffffff; $r->[$i+1] = $bb = ($mm->[($y >> 10) & 0xff] + $x) & 0xffffffff; $x = $mm->[$i+2]; $aa = (($aa ^ ($aa << 2)) + $mm->[($i+2 + 128) & 0xff]); $aa &= 0xffffffff; $mm->[$i+2] = $y = ($mm->[($x >> 2) & 0xff] + $aa + $bb) & 0xffffffff; $r->[$i+2] = $bb = ($mm->[($y >> 10) & 0xff] + $x) & 0xffffffff; $x = $mm->[$i+3]; $aa = (($aa ^ (0x0000ffff & ($aa >> 16))) + $mm->[($i+3 + 128) & 0xff]); $aa &= 0xffffffff; $mm->[$i+3] = $y = ($mm->[($x >> 2) & 0xff] + $aa + $bb) & 0xffffffff; $r->[$i+3] = $bb = ($mm->[($y >> 10) & 0xff] + $x) & 0xffffffff; } $self->{randb} = $bb; $self->{randa} = $aa; return; } sub _randinit { my ($self) = @_; use integer; # $a and $b are reserved (see 'sort'); $i is the iterator my ($c, $d, $e, $f, $g, $h, $j, $k); $c=$d=$e=$f=$g=$h=$j=$k = 0x9e3779b9; # The golden ratio my $mm = $self->{randmem}; my $r = $self->{randrsl}; for (1..4) { $c ^= $d << 11; $f += $c; $d += $e; $d ^= 0x3fffffff & ($e >> 2); $g += $d; $e += $f; $e ^= $f << 8; $h += $e; $f += $g; $f ^= 0x0000ffff & ($g >> 16); $j += $f; $g += $h; $g ^= $h << 10; $k += $g; $h += $j; $h ^= 0x0fffffff & ($j >> 4); $c += $h; $j += $k; $j ^= $k << 8; $d += $j; $k += $c; $k ^= 0x007fffff & ($c >> 9); $e += $k; $c += $d; } for (my $i = 0; $i < 256; $i += 8) { $c += $r->[$i ]; $d += $r->[$i+1]; $e += $r->[$i+2]; $f += $r->[$i+3]; $g += $r->[$i+4]; $h += $r->[$i+5]; $j += $r->[$i+6]; $k += $r->[$i+7]; $c ^= $d << 11; $f += $c; $d += $e; $d ^= 0x3fffffff & ($e >> 2); $g += $d; $e += $f; $e ^= $f << 8; $h += $e; $f += $g; $f ^= 0x0000ffff & ($g >> 16); $j += $f; $g += $h; $g ^= $h << 10; $k += $g; $h += $j; $h ^= 0x0fffffff & ($j >> 4); $c += $h; $j += $k; $j ^= $k << 8; $d += $j; $k += $c; $k ^= 0x007fffff & ($c >> 9); $e += $k; $c += $d; $mm->[$i ] = $c; $mm->[$i+1] = $d; $mm->[$i+2] = $e; $mm->[$i+3] = $f; $mm->[$i+4] = $g; $mm->[$i+5] = $h; $mm->[$i+6] = $j; $mm->[$i+7] = $k; } for (my $i = 0; $i < 256; $i += 8) { $c += $mm->[$i ]; $d += $mm->[$i+1]; $e += $mm->[$i+2]; $f += $mm->[$i+3]; $g += $mm->[$i+4]; $h += $mm->[$i+5]; $j += $mm->[$i+6]; $k += $mm->[$i+7]; $c ^= $d << 11; $f += $c; $d += $e; $d ^= 0x3fffffff & ($e >> 2); $g += $d; $e += $f; $e ^= $f << 8; $h += $e; $f += $g; $f ^= 0x0000ffff & ($g >> 16); $j += $f; $g += $h; $g ^= $h << 10; $k += $g; $h += $j; $h ^= 0x0fffffff & ($j >> 4); $c += $h; $j += $k; $j ^= $k << 8; $d += $j; $k += $c; $k ^= 0x007fffff & ($c >> 9); $e += $k; $c += $d; $mm->[$i ] = $c; $mm->[$i+1] = $d; $mm->[$i+2] = $e; $mm->[$i+3] = $f; $mm->[$i+4] = $g; $mm->[$i+5] = $h; $mm->[$i+6] = $j; $mm->[$i+7] = $k; } $self->_isaac(); $self->{randcnt} = 256; return; } 1; __END__ =pod =head1 NAME Math::Random::ISAAC::PP - Pure Perl port of the ISAAC PRNG algorithm =head1 VERSION version 1.004 =head1 SYNOPSIS This module implements the same interface as C and can be used as a drop-in replacement. However, it is recommended that you let the C module decide whether to use the PurePerl or XS version of this module, instead of choosing manually. Selecting the backend to use manually really only has two uses: =over =item * If you are trying to avoid the small overhead incurred with dispatching method calls to the appropriate backend modules. =item * If you are testing the module for performance and wish to explicitly decide which module you would like to use. =back Example code: # With Math::Random::ISAAC my $rng = Math::Random::ISAAC->new(time); my $rand = $rng->rand(); # With Math::Random::ISAAC::PP my $rng = Math::Random::ISAAC::PP->new(time); my $rand = $rng->rand(); =head1 DESCRIPTION See L for the full description. =head1 METHODS =head2 new Math::Random::ISAAC::PP->new( @seeds ) Implements the interface as specified in C =head2 rand $rng->rand() Implements the interface as specified in C =head2 irand $rng->irand() Implements the interface as specified in C =head1 SEE ALSO L =head1 BUGS Please report any bugs or feature requests on the bugtracker website http://rt.cpan.org/NoAuth/Bugs.html?Dist=Math-Random-ISAAC When submitting a bug or request, please include a test-file or a patch to an existing test-file that illustrates the bug or desired feature. =head1 AUTHOR Jonathan Yu =head1 COPYRIGHT AND LICENSE Legally speaking, this package and its contents are: Copyright (c) 2011 by Jonathan Yu . But this is really just a legal technicality that allows the author to offer this package under the public domain and also a variety of licensing options. For all intents and purposes, this is public domain software, which means you can do whatever you want with it. The software is provided "AS IS", without warranty of any kind, express or implied, including but not limited to the warranties of merchantability, fitness for a particular purpose and noninfringement. In no event shall the authors or copyright holders be liable for any claim, damages or other liability, whether in an action of contract, tort or otherwise, arising from, out of or in connection with the software or the use or other dealings in the software. =cut