Parallel-Runner-0.014000755001750001750 014612470771 15053 5ustar00exodistexodist000000000000README100644001750001750 1600414612470771 16035 0ustar00exodistexodist000000000000Parallel-Runner-0.014NAME Parallel::Runner - An object to manage running things in parallel processes. DESCRIPTION There are several other modules to do this, you probably want one of them. This module exists as a super specialised parallel task manager. You create the object with a process limit and callbacks for what to do while waiting for a free process slot, as well as a callback for what a process should do just before exiting. You must explicitly call $runner->finish() when you are done. If the runner is destroyed before it's children are finished a warning will be generated and your child processes will be killed, by force if necessary. If you specify a maximum of 1 then no forking will occur, and run() will block until the coderef returns. You can force a fork by providing a boolean true value as the second argument to run(), this will force the runner to fork before running the coderef, however run() will still block until it the child exits. SYNOPSYS #!/usr/bin/perl use strict; use warnings; use Parallel::Runner; my $runner = Parallel::Runner->new(4); $runner->run( sub { ... } ); $runner->run( sub { ... } ); $runner->run( sub { ... } ); $runner->run( sub { ... } ); # This will block until one of the previous 4 finishes $runner->run( sub { ... } ); # Do not forget this. $runner->finish; CONSTRUCTOR $runner = $class->new( $max, $accessor => $value, ... ); Create a new instance of Parallel::Runner. $accessor can be anything listed under the ACCESSORS section. $max should be the maximum number of processes allowed, defaults to 1. ACCESSORS These are simple accessors, providing an argument sets the accessor to that argument, no argument it simply returns the current value. $val = $runner->data_callback( \&callback ) If this is specified than IPC will be automatically enabled, and the final return from each process will be passed into this handler in the main process. Due to the way IPC works only strings/numerical data is passed, if you need to pass a ref you will need to serialize it yourself before returning it, followed by deserializing it in your callback. Example: # Place to put the accumulated data my @accum_data; # Create the runner with a callback that pushes the data onto our array. $runner = $CLASS->new( 2, data_callback => sub { my ($data) = @_; push @accum_data => $data; }, ); # 4 processes that return data $runner->run( sub { return "foo" }); $runner->run( sub { return "bar" }); $runner->run( sub { return "baz" }); $runner->run( sub { return "bat" }); $runner->finish; # Verify the data (order is not predictable) is_deeply( [ sort @accum_data ], [ sort qw/foo bar baz bat/ ], "Got all data returned by subprocesses" ); $val = $runner->exit_callback( \&callback ) Codref to call just before a child exits (called within child) $val = $runner->iteration_delay( $float ); How long to wait per iterate if nothing has changed. $val = $runner->iteration_callback( $newval ) Coderef to call multiple times in a loop while run() is blocking waiting for a process slot. $val = $runner->reap_callback( $newval ) Codref to call whenever a pid is reaped using waitpid. The callback sub will be passed 3 values The first is the exit status of the child process. The second is the pid of the child process. The third used to be the return of waitpid, but this is deprecated as Child is now used and throws an exception when waitpid is not what it should be. The third is simply the pid of the child process again. The final argument is the child process object itself. $runner->reap_callback( sub { my ( $status, $pid, $pid_again, $proc ) = @_; # Status as returned from system, so 0 is good, 1+ is bad. die "Child $pid did not exit 0" if $status; }); @children = $runner->children( @append ) Returns a list of Child::Link::Proc objects. $val = $runner->pid() pid of the parent process $val = $runner->max( $newval ) Maximum number of children OBJECT METHODS run( $code ) run( $code, $force_fork ) Run the specified code in a child process. Blocks if no free slots are available. Force fork can be used to force a fork when max is 1, however it will still block until the child exits. finish() finish( $timeout ) finish( $timeout, $timeoutcallback ) Wait for all children to finish, then clean up after them. If a timeout is specified it will return after the timeout regardless of wether or not children have all exited. If there is a timeout call back then that code will be run upon timeout just before the method returns. NOTE: DO NOT LET YOUR RUNNER BE DESTROYED BEFORE FINISH COMPLETES WITHOUT A TIMEOUT. the runner will kill all children, possibly with force if your runner is destroyed with children still running, or not waited on. killall( $sig ) Send all children the specified kill signal. DESTROY() Automagically called when the object is destroyed. If called while children are running it will forcefully clean up after you as follows: 1) Sends an ugly warning. 2) Will first give all your children 1 second to complete. Windows) Strawberry fails with processes, so on windows DESTROY will wait as long as needed, possibly forever. 3) Sends kill signal 15 to all children then waits up to 4 seconds. 4) Sends kill signal 9 to any remaining children then waits up to 10 seconds 5) Gives up and returns FENNEC PROJECT This module is part of the Fennec project. See Fennec for more details. Fennec is a project to develop an extendable and powerful testing framework. Together the tools that make up the Fennec framework provide a potent testing environment. The tools provided by Fennec are also useful on their own. Sometimes a tool created for Fennec is useful outside the greater framework. Such tools are turned into their own projects. This is one such project. Fennec - The core framework The primary Fennec project that ties them all together. AUTHORS Chad Granum exodist7@gmail.com COPYRIGHT Copyright (C) 2010 Chad Granum Parallel-Runner is free software; Standard perl licence. Parallel-Runner 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 license for more details. LICENSE100644001750001750 4642414612470771 16173 0ustar00exodistexodist000000000000Parallel-Runner-0.014This software is copyright (c) 2024 by Chad Granum. This is free software; you can redistribute it and/or modify it under the same terms as the Perl 5 programming language system itself. Terms of the Perl programming language system itself a) the GNU General Public License as published by the Free Software Foundation; either version 1, or (at your option) any later version, or b) the "Artistic License" --- The GNU General Public License, Version 1, February 1989 --- This software is Copyright (c) 2024 by Chad Granum. This is free software, licensed under: The GNU General Public License, Version 1, February 1989 GNU GENERAL PUBLIC LICENSE Version 1, February 1989 Copyright (C) 1989 Free Software Foundation, Inc. 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. Preamble The license agreements of most software companies try to keep users at the mercy of those companies. By contrast, our General Public License is intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users. The General Public License applies to the Free Software Foundation's software and to any other program whose authors commit to using it. You can use it for your programs, too. When we speak of free software, we are referring to freedom, not price. Specifically, the General Public License is designed to make sure that you have the freedom to give away or sell copies of free software, that you receive source code or can get it if you want it, that you can change the software or use pieces of it in new free programs; and that you know you can do these things. To protect your rights, we need to make restrictions that forbid anyone to deny you these rights or to ask you to surrender the rights. These restrictions translate to certain responsibilities for you if you distribute copies of the software, or if you modify it. For example, if you distribute copies of a such a program, whether gratis or for a fee, you must give the recipients all the rights that you have. You must make sure that they, too, receive or can get the source code. And you must tell them their rights. We protect your rights with two steps: (1) copyright the software, and (2) offer you this license which gives you legal permission to copy, distribute and/or modify the software. Also, for each author's protection and ours, we want to make certain that everyone understands that there is no warranty for this free software. If the software is modified by someone else and passed on, we want its recipients to know that what they have is not the original, so that any problems introduced by others will not reflect on the original authors' reputations. The precise terms and conditions for copying, distribution and modification follow. GNU GENERAL PUBLIC LICENSE TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 0. This License Agreement applies to any program or other work which contains a notice placed by the copyright holder saying it may be distributed under the terms of this General Public License. The "Program", below, refers to any such program or work, and a "work based on the Program" means either the Program or any work containing the Program or a portion of it, either verbatim or with modifications. Each licensee is addressed as "you". 1. You may copy and distribute verbatim copies of the Program's source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice and disclaimer of warranty; keep intact all the notices that refer to this General Public License and to the absence of any warranty; and give any other recipients of the Program a copy of this General Public License along with the Program. You may charge a fee for the physical act of transferring a copy. 2. You may modify your copy or copies of the Program or any portion of it, and copy and distribute such modifications under the terms of Paragraph 1 above, provided that you also do the following: a) cause the modified files to carry prominent notices stating that you changed the files and the date of any change; and b) cause the whole of any work that you distribute or publish, that in whole or in part contains the Program or any part thereof, either with or without modifications, to be licensed at no charge to all third parties under the terms of this General Public License (except that you may choose to grant warranty protection to some or all third parties, at your option). c) If the modified program normally reads commands interactively when run, you must cause it, when started running for such interactive use in the simplest and most usual way, to print or display an announcement including an appropriate copyright notice and a notice that there is no warranty (or else, saying that you provide a warranty) and that users may redistribute the program under these conditions, and telling the user how to view a copy of this General Public License. d) You may charge a fee for the physical act of transferring a copy, and you may at your option offer warranty protection in exchange for a fee. Mere aggregation of another independent work with the Program (or its derivative) on a volume of a storage or distribution medium does not bring the other work under the scope of these terms. 3. You may copy and distribute the Program (or a portion or derivative of it, under Paragraph 2) in object code or executable form under the terms of Paragraphs 1 and 2 above provided that you also do one of the following: a) accompany it with the complete corresponding machine-readable source code, which must be distributed under the terms of Paragraphs 1 and 2 above; or, b) accompany it with a written offer, valid for at least three years, to give any third party free (except for a nominal charge for the cost of distribution) a complete machine-readable copy of the corresponding source code, to be distributed under the terms of Paragraphs 1 and 2 above; or, c) accompany it with the information you received as to where the corresponding source code may be obtained. (This alternative is allowed only for noncommercial distribution and only if you received the program in object code or executable form alone.) Source code for a work means the preferred form of the work for making modifications to it. For an executable file, complete source code means all the source code for all modules it contains; but, as a special exception, it need not include source code for modules which are standard libraries that accompany the operating system on which the executable file runs, or for standard header files or definitions files that accompany that operating system. 4. You may not copy, modify, sublicense, distribute or transfer the Program except as expressly provided under this General Public License. Any attempt otherwise to copy, modify, sublicense, distribute or transfer the Program is void, and will automatically terminate your rights to use the Program under this License. However, parties who have received copies, or rights to use copies, from you under this General Public License will not have their licenses terminated so long as such parties remain in full compliance. 5. By copying, distributing or modifying the Program (or any work based on the Program) you indicate your acceptance of this license to do so, and all its terms and conditions. 6. Each time you redistribute the Program (or any work based on the Program), the recipient automatically receives a license from the original licensor to copy, distribute or modify the Program subject to these terms and conditions. You may not impose any further restrictions on the recipients' exercise of the rights granted herein. 7. The Free Software Foundation may publish revised and/or new versions of the General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. Each version is given a distinguishing version number. If the Program specifies a version number of the license which applies to it and "any later version", you have the option of following the terms and conditions either of that version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of the license, you may choose any version ever published by the Free Software Foundation. 8. If you wish to incorporate parts of the Program into other free programs whose distribution conditions are different, write to the author to ask for permission. For software which is copyrighted by the Free Software Foundation, write to the Free Software Foundation; we sometimes make exceptions for this. Our decision will be guided by the two goals of preserving the free status of all derivatives of our free software and of promoting the sharing and reuse of software generally. NO WARRANTY 9. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 10. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. END OF TERMS AND CONDITIONS Appendix: How to Apply These Terms to Your New Programs If you develop a new program, and you want it to be of the greatest possible use to humanity, the best way to achieve this is to make it free software which everyone can redistribute and change under these terms. To do so, attach the following notices to the program. It is safest to attach them to the start of each source file to most effectively convey the exclusion of warranty; and each file should have at least the "copyright" line and a pointer to where the full notice is found. Copyright (C) 19yy This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 1, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston MA 02110-1301 USA Also add information on how to contact you by electronic and paper mail. If the program is interactive, make it output a short notice like this when it starts in an interactive mode: Gnomovision version 69, Copyright (C) 19xx name of author Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'. This is free software, and you are welcome to redistribute it under certain conditions; type `show c' for details. The hypothetical commands `show w' and `show c' should show the appropriate parts of the General Public License. Of course, the commands you use may be called something other than `show w' and `show c'; they could even be mouse-clicks or menu items--whatever suits your program. You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the program, if necessary. Here a sample; alter the names: Yoyodyne, Inc., hereby disclaims all copyright interest in the program `Gnomovision' (a program to direct compilers to make passes at assemblers) written by James Hacker. , 1 April 1989 Ty Coon, President of Vice That's all there is to it! --- The Perl Artistic License 1.0 --- This software is Copyright (c) 2024 by Chad Granum. This is free software, licensed under: The Perl Artistic License 1.0 The "Artistic License" Preamble The intent of this document is to state the conditions under which a Package may be copied, such that the Copyright Holder maintains some semblance of artistic control over the development of the package, while giving the users of the package the right to use and distribute the Package in a more-or-less customary fashion, plus the right to make reasonable modifications. Definitions: "Package" refers to the collection of files distributed by the Copyright Holder, and derivatives of that collection of files created through textual modification. "Standard Version" refers to such a Package if it has not been modified, or has been modified in accordance with the wishes of the Copyright Holder as specified below. "Copyright Holder" is whoever is named in the copyright or copyrights for the package. "You" is you, if you're thinking about copying or distributing this Package. "Reasonable copying fee" is whatever you can justify on the basis of media cost, duplication charges, time of people involved, and so on. (You will not be required to justify it to the Copyright Holder, but only to the computing community at large as a market that must bear the fee.) "Freely Available" means that no fee is charged for the item itself, though there may be fees involved in handling the item. It also means that recipients of the item may redistribute it under the same conditions they received it. 1. You may make and give away verbatim copies of the source form of the Standard Version of this Package without restriction, provided that you duplicate all of the original copyright notices and associated disclaimers. 2. You may apply bug fixes, portability fixes and other modifications derived from the Public Domain or from the Copyright Holder. A Package modified in such a way shall still be considered the Standard Version. 3. You may otherwise modify your copy of this Package in any way, provided that you insert a prominent notice in each changed file stating how and when you changed that file, and provided that you do at least ONE of the following: a) place your modifications in the Public Domain or otherwise make them Freely Available, such as by posting said modifications to Usenet or an equivalent medium, or placing the modifications on a major archive site such as uunet.uu.net, or by allowing the Copyright Holder to include your modifications in the Standard Version of the Package. b) use the modified Package only within your corporation or organization. c) rename any non-standard executables so the names do not conflict with standard executables, which must also be provided, and provide a separate manual page for each non-standard executable that clearly documents how it differs from the Standard Version. d) make other distribution arrangements with the Copyright Holder. 4. You may distribute the programs of this Package in object code or executable form, provided that you do at least ONE of the following: a) distribute a Standard Version of the executables and library files, together with instructions (in the manual page or equivalent) on where to get the Standard Version. b) accompany the distribution with the machine-readable source of the Package with your modifications. c) give non-standard executables non-standard names, and clearly document the differences in manual pages (or equivalent), together with instructions on where to get the Standard Version. d) make other distribution arrangements with the Copyright Holder. 5. You may charge a reasonable copying fee for any distribution of this Package. You may charge any fee you choose for support of this Package. You may not charge a fee for this Package itself. However, you may distribute this Package in aggregate with other (possibly commercial) programs as part of a larger (possibly commercial) software distribution provided that you do not advertise this Package as a product of your own. You may embed this Package's interpreter within an executable of yours (by linking); this shall be construed as a mere form of aggregation, provided that the complete Standard Version of the interpreter is so embedded. 6. The scripts and library files supplied as input to or produced as output from the programs of this Package do not automatically fall under the copyright of this Package, but belong to whoever generated them, and may be sold commercially, and may be aggregated with this Package. If such scripts or library files are aggregated with this Package via the so-called "undump" or "unexec" methods of producing a binary executable image, then distribution of such an image shall neither be construed as a distribution of this Package nor shall it fall under the restrictions of Paragraphs 3 and 4, provided that you do not represent such an executable image as a Standard Version of this Package. 7. C subroutines (or comparably compiled subroutines in other languages) supplied by you and linked into this Package in order to emulate subroutines and variables of the language defined by this Package shall not be considered part of this Package, but are the equivalent of input as in Paragraph 6, provided these subroutines do not change the language in any way that would cause it to fail the regression tests for the language. 8. Aggregation of this Package with a commercial distribution is always permitted provided that the use of this Package is embedded; that is, when no overt attempt is made to make this Package's interfaces visible to the end user of the commercial distribution. Such use shall not be construed as a distribution of this Package. 9. The name of the Copyright Holder may not be used to endorse or promote products derived from this software without specific prior written permission. 10. THIS PACKAGE IS PROVIDED "AS IS" AND WITHOUT ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. The End Changes100644001750001750 14714612470771 16411 0ustar00exodistexodist000000000000Parallel-Runner-0.0140.014 2024-04-25 16:08:40+01:00 Europe/Lisbon - Move to Dist::Zilla - Switch to Test2::V0 MANIFEST100644001750001750 40214612470771 16241 0ustar00exodistexodist000000000000Parallel-Runner-0.014# This file was automatically generated by Dist::Zilla::Plugin::Manifest v6.031. Changes LICENSE MANIFEST META.json META.yml Makefile.PL README README.md cpanfile dist.ini lib/Parallel/Runner.pm t/Destruction.t t/Runner.t t/Timeouts.t xt/author/pod-syntax.t dist.ini100644001750001750 316314612470771 16603 0ustar00exodistexodist000000000000Parallel-Runner-0.014name = Parallel-Runner author = Chad Granum license = Perl_5 copyright_holder = Chad Granum [RewriteVersion] ; sets dist version from main module's $VERSION [License] [ManifestSkip] [Manifest] [NextRelease] [GatherDir] exclude_filename = LICENSE exclude_filename = Makefile.PL exclude_filename = cpanfile exclude_filename = README exclude_filename = README.md [PodSyntaxTests] [TestRelease] [MetaResources] bugtracker.web = https://github.com/exodist/Parallel-Runner/issues repository.url = https://github.com/exodist/Parallel-Runner/ repository.type = git [Prereqs] perl = 5.10.1 Child = 0.009 Time::HiRes = 0 [Prereqs / TestRequires] Test2::V0 = 0.000159 [MakeMaker] [CPANFile] [MetaYAML] [MetaJSON] ; authordep Pod::Markdown [ReadmeFromPod / Markdown] filename = lib/Parallel/Runner.pm type = markdown readme = README.md [ReadmeFromPod / Text] filename = lib/Parallel/Runner.pm type = text readme = README [CopyFilesFromBuild] copy = LICENSE copy = cpanfile copy = README copy = README.md copy = Makefile.PL [Git::Check] allow_dirty = Makefile.PL allow_dirty = README allow_dirty = README.md allow_dirty = cpanfile allow_dirty = LICENSE allow_dirty = Changes [Git::Commit] allow_dirty = Makefile.PL allow_dirty = README allow_dirty = README.md allow_dirty = cpanfile allow_dirty = LICENSE allow_dirty = Changes [Git::Tag] [FakeRelease] [BumpVersionAfterRelease] [Git::Commit / Commit_Changes] munge_makefile_pl = true allow_dirty_match = ^lib allow_dirty = Makefile.PL allow_dirty = README allow_dirty = README.md allow_dirty = cpanfile allow_dirty = LICENSE commit_msg = Automated Version Bump cpanfile100644001750001750 65114612470771 16622 0ustar00exodistexodist000000000000Parallel-Runner-0.014# This file is generated by Dist::Zilla::Plugin::CPANFile v6.031 # Do not edit this file directly. To change prereqs, edit the `dist.ini` file. requires "Child" => "0.009"; requires "Time::HiRes" => "0"; requires "perl" => "v5.10.1"; on 'test' => sub { requires "Test2::V0" => "0.000159"; }; on 'configure' => sub { requires "ExtUtils::MakeMaker" => "0"; }; on 'develop' => sub { requires "Test::Pod" => "1.41"; }; META.yml100644001750001750 142014612470771 16402 0ustar00exodistexodist000000000000Parallel-Runner-0.014--- abstract: 'An object to manage running things in parallel processes.' author: - 'Chad Granum ' build_requires: Test2::V0: '0.000159' configure_requires: ExtUtils::MakeMaker: '0' dynamic_config: 0 generated_by: 'Dist::Zilla version 6.031, CPAN::Meta::Converter version 2.150010' license: perl meta-spec: url: http://module-build.sourceforge.net/META-spec-v1.4.html version: '1.4' name: Parallel-Runner requires: Child: '0.009' Time::HiRes: '0' perl: v5.10.1 resources: bugtracker: https://github.com/exodist/Parallel-Runner/issues repository: https://github.com/exodist/Parallel-Runner/ version: '0.014' x_generated_by_perl: v5.38.2 x_serialization_backend: 'YAML::Tiny version 1.74' x_spdx_expression: 'Artistic-1.0-Perl OR GPL-1.0-or-later' META.json100644001750001750 255214612470771 16561 0ustar00exodistexodist000000000000Parallel-Runner-0.014{ "abstract" : "An object to manage running things in parallel processes.", "author" : [ "Chad Granum " ], "dynamic_config" : 0, "generated_by" : "Dist::Zilla version 6.031, CPAN::Meta::Converter version 2.150010", "license" : [ "perl_5" ], "meta-spec" : { "url" : "http://search.cpan.org/perldoc?CPAN::Meta::Spec", "version" : 2 }, "name" : "Parallel-Runner", "prereqs" : { "configure" : { "requires" : { "ExtUtils::MakeMaker" : "0" } }, "develop" : { "requires" : { "Test::Pod" : "1.41" } }, "runtime" : { "requires" : { "Child" : "0.009", "Time::HiRes" : "0", "perl" : "v5.10.1" } }, "test" : { "requires" : { "Test2::V0" : "0.000159" } } }, "release_status" : "stable", "resources" : { "bugtracker" : { "web" : "https://github.com/exodist/Parallel-Runner/issues" }, "repository" : { "type" : "git", "url" : "https://github.com/exodist/Parallel-Runner/" } }, "version" : "0.014", "x_generated_by_perl" : "v5.38.2", "x_serialization_backend" : "Cpanel::JSON::XS version 4.37", "x_spdx_expression" : "Artistic-1.0-Perl OR GPL-1.0-or-later" } README.md100644001750001750 1550414612470771 16440 0ustar00exodistexodist000000000000Parallel-Runner-0.014# NAME Parallel::Runner - An object to manage running things in parallel processes. # DESCRIPTION There are several other modules to do this, you probably want one of them. This module exists as a super specialised parallel task manager. You create the object with a process limit and callbacks for what to do while waiting for a free process slot, as well as a callback for what a process should do just before exiting. You must explicitly call $runner->finish() when you are done. If the runner is destroyed before it's children are finished a warning will be generated and your child processes will be killed, by force if necessary. If you specify a maximum of 1 then no forking will occur, and run() will block until the coderef returns. You can force a fork by providing a boolean true value as the second argument to run(), this will force the runner to fork before running the coderef, however run() will still block until it the child exits. # SYNOPSYS #!/usr/bin/perl use strict; use warnings; use Parallel::Runner; my $runner = Parallel::Runner->new(4); $runner->run( sub { ... } ); $runner->run( sub { ... } ); $runner->run( sub { ... } ); $runner->run( sub { ... } ); # This will block until one of the previous 4 finishes $runner->run( sub { ... } ); # Do not forget this. $runner->finish; # CONSTRUCTOR - $runner = $class->new( $max, $accessor => $value, ... ); Create a new instance of Parallel::Runner. $accessor can be anything listed under the ACCESSORS section. $max should be the maximum number of processes allowed, defaults to 1. # ACCESSORS These are simple accessors, providing an argument sets the accessor to that argument, no argument it simply returns the current value. - $val = $runner->data\_callback( \\&callback ) If this is specified than IPC will be automatically enabled, and the final return from each process will be passed into this handler in the main process. Due to the way IPC works only strings/numerical data is passed, if you need to pass a ref you will need to serialize it yourself before returning it, followed by deserializing it in your callback. Example: # Place to put the accumulated data my @accum_data; # Create the runner with a callback that pushes the data onto our array. $runner = $CLASS->new( 2, data_callback => sub { my ($data) = @_; push @accum_data => $data; }, ); # 4 processes that return data $runner->run( sub { return "foo" }); $runner->run( sub { return "bar" }); $runner->run( sub { return "baz" }); $runner->run( sub { return "bat" }); $runner->finish; # Verify the data (order is not predictable) is_deeply( [ sort @accum_data ], [ sort qw/foo bar baz bat/ ], "Got all data returned by subprocesses" ); - $val = $runner->exit\_callback( \\&callback ) Codref to call just before a child exits (called within child) - $val = $runner->iteration\_delay( $float ); How long to wait per iterate if nothing has changed. - $val = $runner->iteration\_callback( $newval ) Coderef to call multiple times in a loop while run() is blocking waiting for a process slot. - $val = $runner->reap\_callback( $newval ) Codref to call whenever a pid is reaped using waitpid. The callback sub will be passed 3 values The first is the exit status of the child process. The second is the pid of the child process. The third used to be the return of waitpid, but this is deprecated as [Child](https://metacpan.org/pod/Child) is now used and throws an exception when waitpid is not what it should be. The third is simply the pid of the child process again. The final argument is the child process object itself. $runner->reap_callback( sub { my ( $status, $pid, $pid_again, $proc ) = @_; # Status as returned from system, so 0 is good, 1+ is bad. die "Child $pid did not exit 0" if $status; }); - @children = $runner->children( @append ) Returns a list of [Child::Link::Proc](https://metacpan.org/pod/Child%3A%3ALink%3A%3AProc) objects. - $val = $runner->pid() pid of the parent process - $val = $runner->max( $newval ) Maximum number of children # OBJECT METHODS - run( $code ) - run( $code, $force\_fork ) Run the specified code in a child process. Blocks if no free slots are available. Force fork can be used to force a fork when max is 1, however it will still block until the child exits. - finish() - finish( $timeout ) - finish( $timeout, $timeoutcallback ) Wait for all children to finish, then clean up after them. If a timeout is specified it will return after the timeout regardless of wether or not children have all exited. If there is a timeout call back then that code will be run upon timeout just before the method returns. NOTE: DO NOT LET YOUR RUNNER BE DESTROYED BEFORE FINISH COMPLETES WITHOUT A TIMEOUT. the runner will kill all children, possibly with force if your runner is destroyed with children still running, or not waited on. - killall( $sig ) Send all children the specified kill signal. - DESTROY() Automagically called when the object is destroyed. If called while children are running it will forcefully clean up after you as follows: 1) Sends an ugly warning. 2) Will first give all your children 1 second to complete. Windows) Strawberry fails with processes, so on windows DESTROY will wait as long as needed, possibly forever. 3) Sends kill signal 15 to all children then waits up to 4 seconds. 4) Sends kill signal 9 to any remaining children then waits up to 10 seconds 5) Gives up and returns # FENNEC PROJECT This module is part of the Fennec project. See [Fennec](https://metacpan.org/pod/Fennec) for more details. Fennec is a project to develop an extendable and powerful testing framework. Together the tools that make up the Fennec framework provide a potent testing environment. The tools provided by Fennec are also useful on their own. Sometimes a tool created for Fennec is useful outside the greater framework. Such tools are turned into their own projects. This is one such project. - [Fennec](https://metacpan.org/pod/Fennec) - The core framework The primary Fennec project that ties them all together. # AUTHORS Chad Granum [exodist7@gmail.com](https://metacpan.org/pod/exodist7%40gmail.com) # COPYRIGHT Copyright (C) 2010 Chad Granum Parallel-Runner is free software; Standard perl licence. Parallel-Runner 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 license for more details. t000755001750001750 014612470771 15237 5ustar00exodistexodist000000000000Parallel-Runner-0.014Runner.t100644001750001750 643314612470771 17043 0ustar00exodistexodist000000000000Parallel-Runner-0.014/t#!/usr/bin/perl use strict; use warnings; use Test2::V0 -target => 'Parallel::Runner'; use Test2::IPC; can_ok( $CLASS, qw/new exit_callback iteration_callback children _children pid max/ ); ok( my $one = $CLASS->new, "Created one" ); $one->reap_callback( sub { my ( $status, $pid, $pid_again, $proc ) = @_; ok( !$status, "Child exited cleanly" ); } ); isa_ok( $one, $CLASS ); is( $one->max, 1, "got max" ); is( $one->pid, $$, "Stored pid" ); is( $one, { iteration_delay => 0.1, max => 1, pid => $$, _children => [], reap_callback => $one->reap_callback, }, "Built properly" ); my $parent_pid = $$; $one->run( sub { if ( $$ == $parent_pid ) { warn "Did not fork!"; exit(1); } else { diag "Forked as expected"; } }, 'force_fork', ); $one->finish; like( dies { my $one = $CLASS->new(2); $one->pid(0.5); $one->run(sub { 1 }); }, qr/Called run\(\) in child process/, "Do not run in fork" ); my $ran = 0; my $iter_callback = sub { $ran++ }; my $reap_callback = sub { my ( $exit, $pid, $ret ) = @_; ok( !$exit, "Exited 0" ); is( $pid, $ret, "Return pid, not -1 or 0" ); }; $one = $CLASS->new( 2, iteration_callback => $iter_callback, reap_callback => $reap_callback, pipe => 1, ); is( $one->iteration_callback, $iter_callback, "Stored iter callback" ); is( $one->reap_callback, $reap_callback, "Stored reap callback" ); is( $one->pipe, 1, "Spawn with pipes" ); $one->run( sub { sleep 5 } ); $one->run( sub { sleep 5 } ); ok( !$ran, "No waiting yet" ); $one->run( sub { 1 } ); ok( $ran > 20, "Iterated while waiting" ); $one->finish; $ran = 0; $one->max(1); ok( !$ran, "No waiting yet" ); $one->run( sub { sleep 5 }, 1 ); ok( $ran > 20, "Iterated while waiting" ); $one->finish; my ( $read, $write ); unless ( pipe( $read, $write ) ) { skip "Pipe not available: $!", 1; done_testing; exit; } my $ecallback = sub { print $write "ran\n" }; $one = $CLASS->new( 2, exit_callback => $ecallback, reap_callback => $reap_callback, ); $one->run( sub { 1 } ); $one->finish; my $data; ok( lives { local $SIG{ALRM} = sub { die('alarm') }; alarm 5; $data = <$read>; alarm 0; }, "read from pipe" ); is( $data, "ran\n", "exit callback ran" ); my @accum_data; $one = $CLASS->new( 2, data_callback => sub { my ($data) = @_; push @accum_data => $data; }, ); $one->run( sub { return "foo" } ); $one->run( sub { return "bar" } ); $one->run( sub { return "baz" } ); $one->run( sub { return "bat" } ); $one->finish; is( [sort @accum_data], [sort qw/foo bar baz bat/], "Got all data returned by subprocesses" ); @accum_data = (); $one = $CLASS->new( 0, data_callback => sub { my ($data) = @_; push @accum_data => $data; }, ); $one->run( sub { return "foo" } ); $one->run( sub { return "bar" } ); $one->run( sub { return "baz" } ); $one->run( sub { return "bat" } ); $one->finish; is( [sort @accum_data], [sort qw/foo bar baz bat/], "Got all data returned when not forking" ); done_testing; Makefile.PL100644001750001750 215514612470771 17111 0ustar00exodistexodist000000000000Parallel-Runner-0.014# This file was automatically generated by Dist::Zilla::Plugin::MakeMaker v6.031. use strict; use warnings; use 5.010001; use ExtUtils::MakeMaker; my %WriteMakefileArgs = ( "ABSTRACT" => "An object to manage running things in parallel processes.", "AUTHOR" => "Chad Granum ", "CONFIGURE_REQUIRES" => { "ExtUtils::MakeMaker" => 0 }, "DISTNAME" => "Parallel-Runner", "LICENSE" => "perl", "MIN_PERL_VERSION" => "5.010001", "NAME" => "Parallel::Runner", "PREREQ_PM" => { "Child" => "0.009", "Time::HiRes" => 0 }, "TEST_REQUIRES" => { "Test2::V0" => "0.000159" }, "VERSION" => "0.014", "test" => { "TESTS" => "t/*.t" } ); my %FallbackPrereqs = ( "Child" => "0.009", "Test2::V0" => "0.000159", "Time::HiRes" => 0 ); unless ( eval { ExtUtils::MakeMaker->VERSION(6.63_03) } ) { delete $WriteMakefileArgs{TEST_REQUIRES}; delete $WriteMakefileArgs{BUILD_REQUIRES}; $WriteMakefileArgs{PREREQ_PM} = \%FallbackPrereqs; } delete $WriteMakefileArgs{CONFIGURE_REQUIRES} unless eval { ExtUtils::MakeMaker->VERSION(6.52) }; WriteMakefile(%WriteMakefileArgs); Timeouts.t100644001750001750 556014612470771 17403 0ustar00exodistexodist000000000000Parallel-Runner-0.014/t#!/usr/bin/perl use strict; use warnings; use Test2::V0 -target => 'Parallel::Runner'; use Child qw/child/; sub timed_fork { my ($count) = @_; my $pid = fork; return $pid if $pid; sleep $count; exit; } ok(my $one = $CLASS->new(1), "Created one"); isa_ok($one, $CLASS); my $fast_child = child {}; ok($fast_child, "Created a fast child"); $one->children($fast_child); ok( lives { local $SIG{ALRM} = sub { die("fast child took too long") }; alarm 5; $one->finish; alarm 0; }, "reaping" ); $one->max(2); $one->children(child { sleep 10 }); $one->children(child { sleep 10 }); like( dies { local $SIG{ALRM} = sub { die("alarm") }; alarm 5; $one->run(sub { 1 }); alarm 0; }, qr/alarm/, "Timed out" ); $one->children(child { sleep 10 }); $one->children(child { sleep 10 }); ok( lives { local $SIG{ALRM} = sub { die("alarm") }; alarm 20; my $start = time; $one->run(sub { 1 }); ok(time - $start > 3, "was blocking"); alarm 0; }, "Subprocess did not exit" ); $one->finish; $one->max(3); ok( lives { local $SIG{ALRM} = sub { die("alarm") }; alarm 5; $one->run(sub { sleep 15 }); $one->run(sub { sleep 15 }); $one->run(sub { sleep 15 }); alarm 0; }, "3 processes w/o waiting" ); like( dies { local $SIG{ALRM} = sub { die("alarm") }; alarm 5; $one->run(sub { sleep 1 }); alarm 0 }, qr/alarm/, "Blocked" ); ok( lives { local $SIG{ALRM} = sub { die("alarm") }; alarm 30; my $start = time; $one->run(sub { sleep 1 }); ok(1, "Eventually ran"); ok(time - $start > 5, "Blocked a while"); alarm 0 }, "Blocked" ); $one->finish; $one->max(1); ok( lives { local $SIG{ALRM} = sub { die("alarm") }; alarm 5; $one->run(sub { 1 }); alarm 0; ok(1, "Not blocked"); }, "Not blocked" ); my $temp; like( dies { local $SIG{ALRM} = sub { die("alarm") }; alarm 5; $one->run(sub { $temp = 'inside'; sleep 10 }); alarm 0; }, qr/alarm/, "Run w/o fork" ); ok(!$one->children, "no new pids"); is($temp, 'inside', "Ran, but did not fork"); $one->finish; $temp = 'fork'; like( dies { local $SIG{ALRM} = sub { die("alarm") }; alarm 5; $one->run(sub { $temp = 'no fork'; sleep 10 }, 1); alarm 0; }, qr/alarm/, "fork but wait" ); is($temp, 'fork', "Forked"); $one->finish; ok( lives { local $SIG{ALRM} = sub { die("alarm") }; alarm 15; my $start = time; $one->run(sub { sleep 7 }, 1); ok(time - $start > 4, "fork finished"); alarm 0; }, "fork finished" ); $one->finish; done_testing; Destruction.t100644001750001750 502014612470771 20064 0ustar00exodistexodist000000000000Parallel-Runner-0.014/t#!/usr/bin/perl use strict; use warnings; use Test2::V0 -target => 'Parallel::Runner'; use Child qw/child/; my $one = $CLASS->new(2); $one->_children([child { sleep 10 }]); # Test::Warn does not handle multi-line warnings properly # https://rt.cpan.org/Public/Bug/Display.html?id=25427 { my @warn; local $SIG{__WARN__} = sub { push @warn => @_ }; $one = undef; ok(@warn, "Got a warning"); is($warn[0], < @_ }; $one = $CLASS->new(2); $one->run(sub { sleep 30 }); $one = undef; sleep 10; }, "Did not kill self" ); } SKIP: { skip("Kill tests are only run when \$ENV{RUN_KILL_TESTS} is set", 5) unless $ENV{'RUN_KILL_TESTS'}; $one = $CLASS->new(3); $one->run(sub { sleep 30 }); $one->run(sub { sleep 30 }); ok( lives { my @warn; local $SIG{__WARN__} = sub { push @warn => @_ }; local $SIG{ALRM} = sub { die('alarm') }; alarm 10; $one->killall(15, 1); $one->finish; alarm 0; like($warn[0], qr/\d+ - Killing: /, "Warn for first pid"); like($warn[1], qr/\d+ - Killing: /, "Warn for second pid"); }, "Killed, no timeout" ); { my @warn; local $SIG{__WARN__} = sub { push @warn => @_ }; $one = $CLASS->new(2); $one->run(sub { local $SIG{TERM} = sub { sleep 30 }; sleep 30; }); $one = undef; sleep 8; my ($siga, $sigb) = map { s/\s+.*//s; $_ } @warn[-2, -1]; my $diff = $sigb - $siga; ok($diff > 3, "First signal sent after delay"); ok($diff < 8, "Second signal sent before too long"); }; { my @warn; local $SIG{__WARN__} = sub { push @warn => @_ }; my $one = $CLASS->new(3); $one = undef; ok(!@warn, "No warnings for out of scope w/o tasks"); } } ok( lives { my $one = $CLASS->new(); $one->_children(undef); $one = undef; }, "Handles empty pids accessor" ); done_testing; Parallel000755001750001750 014612470771 17276 5ustar00exodistexodist000000000000Parallel-Runner-0.014/libRunner.pm100644001750001750 2446614612470771 21301 0ustar00exodistexodist000000000000Parallel-Runner-0.014/lib/Parallelpackage Parallel::Runner; use strict; use warnings; use POSIX (); use Time::HiRes qw/sleep/; use Carp; use Child qw/child/; our $VERSION = '0.014'; for my $accessor (qw/ exit_callback data_callback iteration_callback _children pid max iteration_delay reap_callback pipe/) { my $sub = sub { my $self = shift; ( $self->{$accessor} ) = @_ if @_; return $self->{$accessor}; }; no strict 'refs'; *$accessor = $sub; } sub children { my $self = shift; my @active; for my $proc ( @{$self->_children || []}, @_ ) { if ( defined $proc->exit_status ) { if ( $self->data_callback ) { my $data = $proc->read(); $self->data_callback->($data); } $self->reap_callback->( $proc->exit_status, $proc->pid, $proc->pid, $proc ) if $self->reap_callback; next; } push @active => $proc; } $self->_children( \@active ); return @active; } sub new { my $class = shift; my ($max) = shift; return bless( { _children => [], pid => $$, max => $max || 1, iteration_delay => 0.1, @_, }, $class ); } sub run { my $self = shift; my ( $code, $force_fork ) = @_; croak("Called run() in child process") unless $self->pid == $$; my $fork = $force_fork || $self->max > 1; return $self->_fork($code) if $fork; my ($data) = $code->(); $self->data_callback->($data) if $self->data_callback; return; } sub _fork { my $self = shift; my ($code) = @_; # Wait for a slot $self->_iterate( sub { $self->children >= $self->max; } ); my $proc = Child->new( sub { my $parent = shift; $self->_children( [] ); my @return = $code->($parent); $self->exit_callback->(@return) if $self->exit_callback; $parent->write( $return[0] ) if $self->data_callback; }, $self->pipe || $self->data_callback ? ( pipe => $self->pipe ) : () )->start(); $self->_iterate( sub { !defined $proc->exit_status } ) if $self->max == 1; $self->children($proc) unless defined $proc->exit_status; return $proc; } sub finish { my $self = shift; $self->_iterate( sub { $self->children }, @_ ); } sub _iterate { my $self = shift; my ( $condition, $timeout, $timeoutsub ) = @_; my $counter = 0; while ( $condition->() ) { $self->iteration_callback->($self) if $self->iteration_callback; $counter += $self->iteration_delay; last if $timeout and $counter >= $timeout; sleep $self->iteration_delay; } $timeoutsub->() if $timeout && $timeoutsub && $counter >= $timeout; 1; } sub killall { my $self = shift; my ( $sig, $warn ) = @_; if ($warn) { warn time . " - Killing: $_ - $sig\n" for grep { $_->pid } $self->children; } $_->kill($sig) for $self->children; } sub DESTROY { my $self = shift; return unless $self->pid == $$ && $self->children; warn <finish() if $^O eq 'MSWin32'; $self->finish( 1, sub { $self->killall( 15, 1 ); $self->finish( 4, sub { $self->killall( 9, 1 ); $self->finish(10); } ); } ); } 1; =pod =head1 NAME Parallel::Runner - An object to manage running things in parallel processes. =head1 DESCRIPTION There are several other modules to do this, you probably want one of them. This module exists as a super specialised parallel task manager. You create the object with a process limit and callbacks for what to do while waiting for a free process slot, as well as a callback for what a process should do just before exiting. You must explicitly call $runner->finish() when you are done. If the runner is destroyed before it's children are finished a warning will be generated and your child processes will be killed, by force if necessary. If you specify a maximum of 1 then no forking will occur, and run() will block until the coderef returns. You can force a fork by providing a boolean true value as the second argument to run(), this will force the runner to fork before running the coderef, however run() will still block until it the child exits. =head1 SYNOPSYS #!/usr/bin/perl use strict; use warnings; use Parallel::Runner; my $runner = Parallel::Runner->new(4); $runner->run( sub { ... } ); $runner->run( sub { ... } ); $runner->run( sub { ... } ); $runner->run( sub { ... } ); # This will block until one of the previous 4 finishes $runner->run( sub { ... } ); # Do not forget this. $runner->finish; =head1 CONSTRUCTOR =over 4 =item $runner = $class->new( $max, $accessor => $value, ... ); Create a new instance of Parallel::Runner. $accessor can be anything listed under the ACCESSORS section. $max should be the maximum number of processes allowed, defaults to 1. =back =head1 ACCESSORS These are simple accessors, providing an argument sets the accessor to that argument, no argument it simply returns the current value. =over 4 =item $val = $runner->data_callback( \&callback ) If this is specified than IPC will be automatically enabled, and the final return from each process will be passed into this handler in the main process. Due to the way IPC works only strings/numerical data is passed, if you need to pass a ref you will need to serialize it yourself before returning it, followed by deserializing it in your callback. Example: # Place to put the accumulated data my @accum_data; # Create the runner with a callback that pushes the data onto our array. $runner = $CLASS->new( 2, data_callback => sub { my ($data) = @_; push @accum_data => $data; }, ); # 4 processes that return data $runner->run( sub { return "foo" }); $runner->run( sub { return "bar" }); $runner->run( sub { return "baz" }); $runner->run( sub { return "bat" }); $runner->finish; # Verify the data (order is not predictable) is_deeply( [ sort @accum_data ], [ sort qw/foo bar baz bat/ ], "Got all data returned by subprocesses" ); =item $val = $runner->exit_callback( \&callback ) Codref to call just before a child exits (called within child) =item $val = $runner->iteration_delay( $float ); How long to wait per iterate if nothing has changed. =item $val = $runner->iteration_callback( $newval ) Coderef to call multiple times in a loop while run() is blocking waiting for a process slot. =item $val = $runner->reap_callback( $newval ) Codref to call whenever a pid is reaped using waitpid. The callback sub will be passed 3 values The first is the exit status of the child process. The second is the pid of the child process. The third used to be the return of waitpid, but this is deprecated as L is now used and throws an exception when waitpid is not what it should be. The third is simply the pid of the child process again. The final argument is the child process object itself. $runner->reap_callback( sub { my ( $status, $pid, $pid_again, $proc ) = @_; # Status as returned from system, so 0 is good, 1+ is bad. die "Child $pid did not exit 0" if $status; }); =item @children = $runner->children( @append ) Returns a list of L objects. =item $val = $runner->pid() pid of the parent process =item $val = $runner->max( $newval ) Maximum number of children =back =head1 OBJECT METHODS =over 4 =item run( $code ) =item run( $code, $force_fork ) Run the specified code in a child process. Blocks if no free slots are available. Force fork can be used to force a fork when max is 1, however it will still block until the child exits. =item finish() =item finish( $timeout ) =item finish( $timeout, $timeoutcallback ) Wait for all children to finish, then clean up after them. If a timeout is specified it will return after the timeout regardless of wether or not children have all exited. If there is a timeout call back then that code will be run upon timeout just before the method returns. NOTE: DO NOT LET YOUR RUNNER BE DESTROYED BEFORE FINISH COMPLETES WITHOUT A TIMEOUT. the runner will kill all children, possibly with force if your runner is destroyed with children still running, or not waited on. =item killall( $sig ) Send all children the specified kill signal. =item DESTROY() Automagically called when the object is destroyed. If called while children are running it will forcefully clean up after you as follows: 1) Sends an ugly warning. 2) Will first give all your children 1 second to complete. Windows) Strawberry fails with processes, so on windows DESTROY will wait as long as needed, possibly forever. 3) Sends kill signal 15 to all children then waits up to 4 seconds. 4) Sends kill signal 9 to any remaining children then waits up to 10 seconds 5) Gives up and returns =back =head1 FENNEC PROJECT This module is part of the Fennec project. See L for more details. Fennec is a project to develop an extendable and powerful testing framework. Together the tools that make up the Fennec framework provide a potent testing environment. The tools provided by Fennec are also useful on their own. Sometimes a tool created for Fennec is useful outside the greater framework. Such tools are turned into their own projects. This is one such project. =over 2 =item L - The core framework The primary Fennec project that ties them all together. =back =head1 AUTHORS Chad Granum L =head1 COPYRIGHT Copyright (C) 2010 Chad Granum Parallel-Runner is free software; Standard perl licence. Parallel-Runner 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 license for more details. author000755001750001750 014612470771 16731 5ustar00exodistexodist000000000000Parallel-Runner-0.014/xtpod-syntax.t100644001750001750 25214612470771 21343 0ustar00exodistexodist000000000000Parallel-Runner-0.014/xt/author#!perl # This file was automatically generated by Dist::Zilla::Plugin::PodSyntaxTests. use strict; use warnings; use Test::More; use Test::Pod 1.41; all_pod_files_ok();