Script 'mail_helper' called by obssrc
Hello community,
here is the log from the commit of package perl-Math-Round for openSUSE:Factory
checked in at 2023-10-19 22:49:57
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Comparing /work/SRC/openSUSE:Factory/perl-Math-Round (Old)
and /work/SRC/openSUSE:Factory/.perl-Math-Round.new.1945 (New)
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Package is "perl-Math-Round"
Thu Oct 19 22:49:57 2023 rev:11 rq:1118902 version:0.80.0
Changes:
--------
--- /work/SRC/openSUSE:Factory/perl-Math-Round/perl-Math-Round.changes
2015-01-03 22:01:45.000000000 +0100
+++
/work/SRC/openSUSE:Factory/.perl-Math-Round.new.1945/perl-Math-Round.changes
2023-10-19 22:52:17.877266022 +0200
@@ -1,0 +2,6 @@
+Wed Oct 11 03:08:01 UTC 2023 - Tina Müller <timueller+p...@suse.de>
+
+- updated to 0.08
+ see /usr/share/doc/packages/perl-Math-Round/Changes
+
+-------------------------------------------------------------------
Old:
----
Math-Round-0.07.tar.gz
New:
----
Math-Round-0.08.tar.gz
++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Other differences:
------------------
++++++ perl-Math-Round.spec ++++++
--- /var/tmp/diff_new_pack.qr2Vz1/_old 2023-10-19 22:52:18.397284883 +0200
+++ /var/tmp/diff_new_pack.qr2Vz1/_new 2023-10-19 22:52:18.401285028 +0200
@@ -1,7 +1,7 @@
#
# spec file for package perl-Math-Round
#
-# Copyright (c) 2015 SUSE LINUX Products GmbH, Nuernberg, Germany.
+# Copyright (c) 2023 SUSE LLC
#
# All modifications and additions to the file contributed by third parties
# remain the property of their copyright owners, unless otherwise agreed
@@ -12,26 +12,26 @@
# license that conforms to the Open Source Definition (Version 1.9)
# published by the Open Source Initiative.
-# Please submit bugfixes or comments via http://bugs.opensuse.org/
+# Please submit bugfixes or comments via https://bugs.opensuse.org/
#
+%define cpan_name Math-Round
Name: perl-Math-Round
-Version: 0.07
+Version: 0.80.0
Release: 0
-# MANUAL
-%define cpan_name Math-Round
+%define cpan_version 0.08
+License: Artistic-1.0 OR GPL-1.0-or-later
Summary: Perl extension for rounding numbers
-License: GPL-1.0+ or Artistic-1.0
-Group: Development/Libraries/Perl
-Url: http://search.cpan.org/dist/Math-Round/
-Source:
http://www.cpan.org/authors/id/G/GR/GROMMEL/%{cpan_name}-%{version}.tar.gz
+URL: https://metacpan.org/release/%{cpan_name}
+Source0:
https://cpan.metacpan.org/authors/id/N/NE/NEILB/%{cpan_name}-%{cpan_version}.tar.gz
BuildArch: noarch
-BuildRoot: %{_tmppath}/%{name}-%{version}-build
BuildRequires: perl
BuildRequires: perl-macros
-BuildRequires: perl(AutoLoader)
-Requires: perl(AutoLoader)
+BuildRequires: perl(parent)
+Requires: perl(parent)
+Provides: perl(Math::Round) = 0.80.0
+%define __perllib_provides /bin/true
%{perl_requires}
%description
@@ -40,25 +40,21 @@
available as described below. "use ... qw(:all)" exports all functions.
%prep
-%setup -q -n %{cpan_name}-%{version}
-find . -type f -print0 | xargs -0 chmod 644
+%autosetup -n %{cpan_name}-%{cpan_version}
%build
-%{__perl} Makefile.PL INSTALLDIRS=vendor
-%{__make} %{?_smp_mflags}
+perl Makefile.PL INSTALLDIRS=vendor
+%make_build
%check
-%{__make} test
+make test
%install
%perl_make_install
%perl_process_packlist
%perl_gen_filelist
-%clean
-%{__rm} -rf %{buildroot}
-
%files -f %{name}.files
-%defattr(-,root,root,755)
%doc Changes README
+%license LICENSE
++++++ Math-Round-0.07.tar.gz -> Math-Round-0.08.tar.gz ++++++
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/Math-Round-0.07/Changes new/Math-Round-0.08/Changes
--- old/Math-Round-0.07/Changes 2015-01-02 17:39:17.000000000 +0100
+++ new/Math-Round-0.08/Changes 2023-10-10 13:04:10.000000000 +0200
@@ -1,30 +1,41 @@
Revision history for Perl extension Math::Round.
-0.01 Wed Oct 25 10:32:06 2000
- - original version; created by h2xs 1.18
+0.08 2023-10-10 NEILB
+ - NEILB has taken over maintenance
+ - Added usual directory structure with lib/ and t/
+ - Converted test.pl to traditional Test::More suite
+ - Added LICENSE to doc and ensured metadata has license.
+ I emailed Geoffrey to request this change, and ended
+ up getting co-maint to make this happen :-)
+ - Dropped `use vars`, replaced with `our` and `use warnings`.
+ - Switched to dzil
-0.02 Thu Mar 8 14:16:16 2001
- - Small cosmetic changes (e-mail address and such).
+0.07 2015-01-02 GROMMEL
+ - Perl 5.22 exports POSIX::round, so "use POSIX" had to be
+ changed to "use POSIX ()". Thanks to Jarkko Hietaniemi and
+ Slaven Rezic for the tip.
-0.03 Mon Sep 17 10:34:40 2001
- - Now using a value for one-half that is slightly larger than
- 0.5, to thwart the floating-point units. Thanks to Paul
- Rohwer for pointing this out.
+0.06 2006-11-29 GROMMEL
+ - Streamlined the code. Thanks to Richard Jelinek of PetaMem.
+ - Made $half a package variable. Thanks to Ruud H. G. van Tol
+ for pointing out some peculiarities of the rounding.
+
+0.05 2002-04-22 GROMMEL
+ - Added nlowmult and nhimult at the suggestion of Tielman
+ de Villiers.
-0.04 Mon Mar 4 11:33:15 2002
+0.04 2002-03-04 GROMMEL
- Added nearest_ceil and nearest_floor at the suggestion of
Charlie Kim (Stanford).
-0.05 Mon Apr 22 10:07:09 2002
- - Added nlowmult and nhimult at the suggestion of Tielman
- de Villiers.
+0.03 2001-09-17 GROMMEL
+ - Now using a value for one-half that is slightly larger than
+ 0.5, to thwart the floating-point units. Thanks to Paul
+ Rohwer for pointing this out.
-0.06 Wed Nov 29 20:29:08 2006
- - Streamlined the code. Thanks to Richard Jelinek of PetaMem.
- - Made $half a package variable. Thanks to Ruud H. G. van Tol
- for pointing out some peculiarities of the rounding.
+0.02 2001-03-08 GROMMEL
+ - Small cosmetic changes (e-mail address and such).
+
+0.01 2000-10-25 GROMMEL
+ - original version; created by h2xs 1.18
-0.07 Fri Jan 2 10:35:47 2015
- - Perl 5.22 exports POSIX::round, so "use POSIX" had to be
- changed to "use POSIX ()". Thanks to Jarkko Hietaniemi and
- Slaven Rezic for the tip.
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/Math-Round-0.07/LICENSE new/Math-Round-0.08/LICENSE
--- old/Math-Round-0.07/LICENSE 1970-01-01 01:00:00.000000000 +0100
+++ new/Math-Round-0.08/LICENSE 2023-10-10 13:04:10.000000000 +0200
@@ -0,0 +1,379 @@
+This software is copyright (c) 2000 by Geoffrey Rommel.
+
+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) 2000 by Geoffrey Rommel.
+
+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.
+
+ <one line to give the program's name and a brief idea of what it does.>
+ Copyright (C) 19yy <name of author>
+
+ 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.
+
+ <signature of Ty Coon>, 1 April 1989
+ Ty Coon, President of Vice
+
+That's all there is to it!
+
+
+--- The Artistic License 1.0 ---
+
+This software is Copyright (c) 2000 by Geoffrey Rommel.
+
+This is free software, licensed under:
+
+ The Artistic License 1.0
+
+The Artistic License
+
+Preamble
+
+The intent of this document is to state the conditions under which a Package
+may be copied, such that the Copyright Holder maintains some semblance of
+artistic control over the development of the package, while giving the users of
+the package the right to use and distribute the Package in a more-or-less
+customary fashion, plus the right to make reasonable modifications.
+
+Definitions:
+
+ - "Package" refers to the collection of files distributed by the Copyright
+ Holder, and derivatives of that collection of files created through
+ textual modification.
+ - "Standard Version" refers to such a Package if it has not been modified,
+ or has been modified in accordance with the wishes of the Copyright
+ Holder.
+ - "Copyright Holder" is whoever is named in the copyright or copyrights for
+ the package.
+ - "You" is you, if you're thinking about copying or distributing this
Package.
+ - "Reasonable copying fee" is whatever you can justify on the basis of media
+ cost, duplication charges, time of people involved, and so on. (You will
+ not be required to justify it to the Copyright Holder, but only to the
+ computing community at large as a market that must bear the fee.)
+ - "Freely Available" means that no fee is charged for the item itself, though
+ there may be fees involved in handling the item. It also means that
+ recipients of the item may redistribute it under the same conditions they
+ received it.
+
+1. You may make and give away verbatim copies of the source form of the
+Standard Version of this Package without restriction, provided that you
+duplicate all of the original copyright notices and associated disclaimers.
+
+2. You may apply bug fixes, portability fixes and other modifications derived
+from the Public Domain or from the Copyright Holder. A Package modified in such
+a way shall still be considered the Standard Version.
+
+3. You may otherwise modify your copy of this Package in any way, provided that
+you insert a prominent notice in each changed file stating how and when you
+changed that file, and provided that you do at least ONE of the following:
+
+ a) place your modifications in the Public Domain or otherwise make them
+ Freely Available, such as by posting said modifications to Usenet or an
+ equivalent medium, or placing the modifications on a major archive site
+ such as ftp.uu.net, or by allowing the Copyright Holder to include your
+ modifications in the Standard Version of the Package.
+
+ b) use the modified Package only within your corporation or organization.
+
+ c) rename any non-standard executables so the names do not conflict with
+ standard executables, which must also be provided, and provide a separate
+ manual page for each non-standard executable that clearly documents how it
+ differs from the Standard Version.
+
+ d) make other distribution arrangements with the Copyright Holder.
+
+4. You may distribute the programs of this Package in object code or executable
+form, provided that you do at least ONE of the following:
+
+ a) distribute a Standard Version of the executables and library files,
+ together with instructions (in the manual page or equivalent) on where to
+ get the Standard Version.
+
+ b) accompany the distribution with the machine-readable source of the Package
+ with your modifications.
+
+ c) accompany any non-standard executables with their corresponding Standard
+ Version executables, giving the non-standard executables non-standard
+ names, and clearly documenting the differences in manual pages (or
+ equivalent), together with instructions on where to get the Standard
+ Version.
+
+ d) make other distribution arrangements with the Copyright Holder.
+
+5. You may charge a reasonable copying fee for any distribution of this
+Package. You may charge any fee you choose for support of this Package. You
+may not charge a fee for this Package itself. However, you may distribute this
+Package in aggregate with other (possibly commercial) programs as part of a
+larger (possibly commercial) software distribution provided that you do not
+advertise this Package as a product of your own.
+
+6. The scripts and library files supplied as input to or produced as output
+from the programs of this Package do not automatically fall under the copyright
+of this Package, but belong to whomever generated them, and may be sold
+commercially, and may be aggregated with this Package.
+
+7. C or perl subroutines supplied by you and linked into this Package shall not
+be considered part of this Package.
+
+8. The name of the Copyright Holder may not be used to endorse or promote
+products derived from this software without specific prior written permission.
+
+9. THIS PACKAGE IS PROVIDED "AS IS" AND WITHOUT ANY EXPRESS OR IMPLIED
+WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF
+MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
+
+The End
+
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/Math-Round-0.07/MANIFEST new/Math-Round-0.08/MANIFEST
--- old/Math-Round-0.07/MANIFEST 2006-11-20 21:25:27.000000000 +0100
+++ new/Math-Round-0.08/MANIFEST 2023-10-10 13:04:10.000000000 +0200
@@ -1,7 +1,11 @@
+# This file was automatically generated by Dist::Zilla::Plugin::Manifest
v6.025.
Changes
+LICENSE
MANIFEST
+META.json
+META.yml
Makefile.PL
README
-Round.pm
-test.pl
-META.yml Module meta-data (added by MakeMaker)
+dist.ini
+lib/Math/Round.pm
+t/02-original.t
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/Math-Round-0.07/META.json
new/Math-Round-0.08/META.json
--- old/Math-Round-0.07/META.json 1970-01-01 01:00:00.000000000 +0100
+++ new/Math-Round-0.08/META.json 2023-10-10 13:04:10.000000000 +0200
@@ -0,0 +1,53 @@
+{
+ "abstract" : "Perl extension for rounding numbers",
+ "author" : [
+ "Geoffrey Rommel <grom...@cpan.org>"
+ ],
+ "dynamic_config" : 0,
+ "generated_by" : "Dist::Zilla version 6.025, CPAN::Meta::Converter version
2.150010",
+ "license" : [
+ "perl_5"
+ ],
+ "meta-spec" : {
+ "url" : "http://search.cpan.org/perldoc?CPAN::Meta::Spec";,
+ "version" : 2
+ },
+ "name" : "Math-Round",
+ "prereqs" : {
+ "configure" : {
+ "requires" : {
+ "ExtUtils::MakeMaker" : "0"
+ }
+ },
+ "runtime" : {
+ "requires" : {
+ "Exporter" : "0",
+ "POSIX" : "0",
+ "parent" : "0",
+ "perl" : "5.006",
+ "strict" : "0",
+ "vars" : "0",
+ "warnings" : "0"
+ }
+ },
+ "test" : {
+ "requires" : {
+ "Test::More" : "0"
+ }
+ }
+ },
+ "release_status" : "stable",
+ "resources" : {
+ "homepage" : "https://github.com/neilb/Math-Round";,
+ "repository" : {
+ "type" : "git",
+ "url" : "https://github.com/neilb/Math-Round.git";,
+ "web" : "https://github.com/neilb/Math-Round";
+ }
+ },
+ "version" : "0.08",
+ "x_generated_by_perl" : "v5.32.1",
+ "x_serialization_backend" : "Cpanel::JSON::XS version 4.37",
+ "x_spdx_expression" : "Artistic-1.0-Perl OR GPL-1.0-or-later"
+}
+
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/Math-Round-0.07/META.yml new/Math-Round-0.08/META.yml
--- old/Math-Round-0.07/META.yml 2015-01-02 18:02:28.000000000 +0100
+++ new/Math-Round-0.08/META.yml 2023-10-10 13:04:10.000000000 +0200
@@ -1,20 +1,30 @@
---- #YAML:1.0
-name: Math-Round
-version: 0.07
-abstract: ~
-author: []
-license: unknown
-distribution_type: module
-configure_requires:
- ExtUtils::MakeMaker: 0
+---
+abstract: 'Perl extension for rounding numbers'
+author:
+ - 'Geoffrey Rommel <grom...@cpan.org>'
build_requires:
- ExtUtils::MakeMaker: 0
-requires: {}
-no_index:
- directory:
- - t
- - inc
-generated_by: ExtUtils::MakeMaker version 6.55_02
+ Test::More: '0'
+configure_requires:
+ ExtUtils::MakeMaker: '0'
+dynamic_config: 0
+generated_by: 'Dist::Zilla version 6.025, CPAN::Meta::Converter version
2.150010'
+license: perl
meta-spec:
- url: http://module-build.sourceforge.net/META-spec-v1.4.html
- version: 1.4
+ url: http://module-build.sourceforge.net/META-spec-v1.4.html
+ version: '1.4'
+name: Math-Round
+requires:
+ Exporter: '0'
+ POSIX: '0'
+ parent: '0'
+ perl: '5.006'
+ strict: '0'
+ vars: '0'
+ warnings: '0'
+resources:
+ homepage: https://github.com/neilb/Math-Round
+ repository: https://github.com/neilb/Math-Round.git
+version: '0.08'
+x_generated_by_perl: v5.32.1
+x_serialization_backend: 'YAML::Tiny version 1.73'
+x_spdx_expression: 'Artistic-1.0-Perl OR GPL-1.0-or-later'
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/Math-Round-0.07/Makefile.PL
new/Math-Round-0.08/Makefile.PL
--- old/Math-Round-0.07/Makefile.PL 2006-11-06 16:06:21.000000000 +0100
+++ new/Math-Round-0.08/Makefile.PL 2023-10-10 13:04:10.000000000 +0200
@@ -1,7 +1,57 @@
+# This file was automatically generated by Dist::Zilla::Plugin::MakeMaker
v6.025.
+use strict;
+use warnings;
+
+use 5.006;
+
use ExtUtils::MakeMaker;
-# See lib/ExtUtils/MakeMaker.pm for details of how to influence
-# the contents of the Makefile that is written.
-WriteMakefile(
- 'NAME' => 'Math::Round',
- 'VERSION_FROM' => 'Round.pm', # finds $VERSION
+
+my %WriteMakefileArgs = (
+ "ABSTRACT" => "Perl extension for rounding numbers",
+ "AUTHOR" => "Geoffrey Rommel <grommel\@cpan.org>",
+ "CONFIGURE_REQUIRES" => {
+ "ExtUtils::MakeMaker" => 0
+ },
+ "DISTNAME" => "Math-Round",
+ "LICENSE" => "perl",
+ "MIN_PERL_VERSION" => "5.006",
+ "NAME" => "Math::Round",
+ "PREREQ_PM" => {
+ "Exporter" => 0,
+ "POSIX" => 0,
+ "parent" => 0,
+ "strict" => 0,
+ "vars" => 0,
+ "warnings" => 0
+ },
+ "TEST_REQUIRES" => {
+ "Test::More" => 0
+ },
+ "VERSION" => "0.08",
+ "test" => {
+ "TESTS" => "t/*.t"
+ }
);
+
+
+my %FallbackPrereqs = (
+ "Exporter" => 0,
+ "POSIX" => 0,
+ "Test::More" => 0,
+ "parent" => 0,
+ "strict" => 0,
+ "vars" => 0,
+ "warnings" => 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);
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/Math-Round-0.07/README new/Math-Round-0.08/README
--- old/Math-Round-0.07/README 2015-01-02 17:40:37.000000000 +0100
+++ new/Math-Round-0.08/README 2023-10-10 13:04:10.000000000 +0200
@@ -1,47 +1,12 @@
-Math::Round -- Perl extension for rounding numbers
+This archive contains the distribution Math-Round,
+version 0.08:
-Math::Round is a Perl module. It supplies functions to round numbers,
-both positive and negative, in various ways. This may seem like an
-odd thing to write a whole module for, but rounding can sometimes be
-a little tricky, so I thought some people might find this useful.
+ Perl extension for rounding numbers
-round: round to the nearest integer; numbers ending in .5 go
- "to infinity" (3.5 becomes 4, -3.5 becomes -4)
-round_even: round; numbers ending in .5 go to the even number
-round_odd: round; numbers ending in .5 go to the odd number
-round_rand: round; numbers ending in .5 go up or down randomly
+This software is copyright (c) 2000 by Geoffrey Rommel.
-nearest: round to the nearest multiple of any number
-nearest_ceil: like nearest; numbers halfway between two multiples
- go up
-nearest_floor: like nearest; numbers halfway between two multiples
- go down
-nearest_rand: like nearest; numbers halfway between two multiples
- go up or down randomly
+This is free software; you can redistribute it and/or modify it under
+the same terms as the Perl 5 programming language system itself.
-nlowmult: next lower multiple of a number
-nhimult: next higher multiple of a number
-Recent Changes
-==============
-Version 0.05: Added nlowmult and nhimult.
-Version 0.06: Streamlined the code.
-Version 0.07: Corrected possible conflict with POSIX.
-
-How to Install
-==============
-
- perl Makefile.PL
- make
- make test
- make install
-
-
-Copyright © 2002 Geoffrey Rommel. All rights reserved.
-This program is free software; you can redistribute it and/or modify
-it under the same terms as Perl itself.
-
-Geoffrey Rommel
-grom...@cpan.org
-
-October 2000
+This README file was generated by Dist::Zilla::Plugin::Readme v6.025.
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/Math-Round-0.07/Round.pm new/Math-Round-0.08/Round.pm
--- old/Math-Round-0.07/Round.pm 2015-01-02 18:01:33.000000000 +0100
+++ new/Math-Round-0.08/Round.pm 1970-01-01 01:00:00.000000000 +0100
@@ -1,328 +0,0 @@
-package Math::Round;
-
-use strict;
-use POSIX ();
-use vars qw($VERSION @ISA @EXPORT @EXPORT_OK %EXPORT_TAGS);
-
-require Exporter;
-
-@ISA = qw(Exporter AutoLoader);
-@EXPORT = qw(round nearest);
-@EXPORT_OK = qw(round nearest round_even round_odd round_rand
- nearest_ceil nearest_floor nearest_rand
- nlowmult nhimult );
-$VERSION = '0.07';
-
-%EXPORT_TAGS = ( all => [ @EXPORT_OK ] );
-
-#--- Default value for "one-half". This is the lowest value that
-#--- gives acceptable results for test #6 in test.pl. See the pod
-#--- for more information.
-
-$Math::Round::half = 0.50000000000008;
-
-sub round {
- my $x;
- my @res = map {
- if ($_ >= 0) { POSIX::floor($_ + $Math::Round::half); }
- else { POSIX::ceil($_ - $Math::Round::half); }
- } @_;
-
- return (wantarray) ? @res : $res[0];
-}
-
-sub round_even {
- my @res = map {
- my ($sign, $in, $fr) = _sepnum($_);
- if ($fr == 0.5) {
- $sign * (($in % 2 == 0) ? $in : $in + 1);
- } else {
- $sign * POSIX::floor(abs($_) + $Math::Round::half);
- }
- } @_;
- return (wantarray) ? @res : $res[0];
-}
-
-sub round_odd {
- my @res = map {
- my ($sign, $in, $fr) = _sepnum($_);
- if ($fr == 0.5) {
- $sign * (($in % 2 == 1) ? $in : $in + 1);
- } else {
- $sign * POSIX::floor(abs($_) + $Math::Round::half);
- }
- } @_;
- return (wantarray) ? @res : $res[0];
-}
-
-sub round_rand {
- my @res = map {
- my ($sign, $in, $fr) = _sepnum($_);
- if ($fr == 0.5) {
- $sign * ((rand(4096) < 2048) ? $in : $in + 1);
- } else {
- $sign * POSIX::floor(abs($_) + $Math::Round::half);
- }
- } @_;
- return (wantarray) ? @res : $res[0];
-}
-
-#--- Separate a number into sign, integer, and fractional parts.
-#--- Return as a list.
-sub _sepnum {
- my $x = shift;
- my $sign = ($x >= 0) ? 1 : -1;
- $x = abs($x);
- my $i = int($x);
- return ($sign, $i, $x - $i);
-}
-
-#------ "Nearest" routines (round to a multiple of any number)
-
-sub nearest {
- my $targ = abs(shift);
- my @res = map {
- if ($_ >= 0) { $targ * int(($_ + $Math::Round::half * $targ) / $targ); }
- else { $targ * POSIX::ceil(($_ - $Math::Round::half * $targ) / $targ); }
- } @_;
-
- return (wantarray) ? @res : $res[0];
-}
-
-# In the next two functions, the code for positive and negative numbers
-# turns out to be the same. For negative numbers, the technique is not
-# exactly obvious; instead of floor(x+0.5), we are in effect taking
-# ceiling(x-0.5).
-
-sub nearest_ceil {
- my $targ = abs(shift);
- my @res = map { $targ * POSIX::floor(($_ + $Math::Round::half * $targ) /
$targ) } @_;
-
- return wantarray ? @res : $res[0];
-}
-
-sub nearest_floor {
- my $targ = abs(shift);
- my @res = map { $targ * POSIX::ceil(($_ - $Math::Round::half * $targ) /
$targ) } @_;
-
- return wantarray ? @res : $res[0];
-}
-
-sub nearest_rand {
- my $targ = abs(shift);
-
- my @res = map {
- my ($sign, $in, $fr) = _sepnear($_, $targ);
- if ($fr == 0.5 * $targ) {
- $sign * $targ * ((rand(4096) < 2048) ? $in : $in + 1);
- } else {
- $sign * $targ * int((abs($_) + $Math::Round::half * $targ) / $targ);
- }
- } @_;
- return (wantarray) ? @res : $res[0];
-}
-
-#--- Next lower multiple
-sub nlowmult {
- my $targ = abs(shift);
- my @res = map { $targ * POSIX::floor($_ / $targ) } @_;
-
- return wantarray ? @res : $res[0];
-}
-
-#--- Next higher multiple
-sub nhimult {
- my $targ = abs(shift);
- my @res = map { $targ * POSIX::ceil($_ / $targ) } @_;
-
- return wantarray ? @res : $res[0];
-}
-
-#--- Separate a number into sign, "integer", and "fractional" parts
-#--- for the 'nearest' calculation. Return as a list.
-sub _sepnear {
- my ($x, $targ) = @_;
- my $sign = ($x >= 0) ? 1 : -1;
- $x = abs($x);
- my $i = int($x / $targ);
- return ($sign, $i, $x - $i*$targ);
-}
-
-1;
-
-__END__
-
-=head1 NAME
-
-Math::Round - Perl extension for rounding numbers
-
-=head1 SYNOPSIS
-
- use Math::Round qw(...those desired... or :all);
-
- $rounded = round($scalar);
- @rounded = round(LIST...);
- $rounded = nearest($target, $scalar);
- @rounded = nearest($target, LIST...);
-
- # and other functions as described below
-
-=head1 DESCRIPTION
-
-B<Math::Round> supplies functions that will round numbers in different
-ways. The functions B<round> and B<nearest> are exported by
-default; others are available as described below. "use ... qw(:all)"
-exports all functions.
-
-=head1 FUNCTIONS
-
-=over 2
-
-=item B<round> LIST
-
-Rounds the number(s) to the nearest integer. In scalar context,
-returns a single value; in list context, returns a list of values.
-Numbers that are halfway between two integers are rounded
-"to infinity"; i.e., positive values are rounded up (e.g., 2.5
-becomes 3) and negative values down (e.g., -2.5 becomes -3).
-
-Starting in Perl 5.22, the POSIX module by default exports all functions,
-including one named "round". If you use both POSIX and this module,
-exercise due caution.
-
-=item B<round_even> LIST
-
-Rounds the number(s) to the nearest integer. In scalar context,
-returns a single value; in list context, returns a list of values.
-Numbers that are halfway between two integers are rounded to the
-nearest even number; e.g., 2.5 becomes 2, 3.5 becomes 4, and -2.5
-becomes -2.
-
-=item B<round_odd> LIST
-
-Rounds the number(s) to the nearest integer. In scalar context,
-returns a single value; in list context, returns a list of values.
-Numbers that are halfway between two integers are rounded to the
-nearest odd number; e.g., 3.5 becomes 3, 4.5 becomes 5, and -3.5
-becomes -3.
-
-=item B<round_rand> LIST
-
-Rounds the number(s) to the nearest integer. In scalar context,
-returns a single value; in list context, returns a list of values.
-Numbers that are halfway between two integers are rounded up or
-down in a random fashion. For example, in a large number of trials,
-2.5 will become 2 half the time and 3 half the time.
-
-=item B<nearest> TARGET, LIST
-
-Rounds the number(s) to the nearest multiple of the target value.
-TARGET must be positive.
-In scalar context, returns a single value; in list context, returns
-a list of values. Numbers that are halfway between two multiples
-of the target will be rounded to infinity. For example:
-
- nearest(10, 44) yields 40
- nearest(10, 46) 50
- nearest(10, 45) 50
- nearest(25, 328) 325
- nearest(.1, 4.567) 4.6
- nearest(10, -45) -50
-
-=item B<nearest_ceil> TARGET, LIST
-
-Rounds the number(s) to the nearest multiple of the target value.
-TARGET must be positive.
-In scalar context, returns a single value; in list context, returns
-a list of values. Numbers that are halfway between two multiples
-of the target will be rounded to the ceiling, i.e. the next
-algebraically higher multiple. For example:
-
- nearest_ceil(10, 44) yields 40
- nearest_ceil(10, 45) 50
- nearest_ceil(10, -45) -40
-
-=item B<nearest_floor> TARGET, LIST
-
-Rounds the number(s) to the nearest multiple of the target value.
-TARGET must be positive.
-In scalar context, returns a single value; in list context, returns
-a list of values. Numbers that are halfway between two multiples
-of the target will be rounded to the floor, i.e. the next
-algebraically lower multiple. For example:
-
- nearest_floor(10, 44) yields 40
- nearest_floor(10, 45) 40
- nearest_floor(10, -45) -50
-
-=item B<nearest_rand> TARGET, LIST
-
-Rounds the number(s) to the nearest multiple of the target value.
-TARGET must be positive.
-In scalar context, returns a single value; in list context, returns
-a list of values. Numbers that are halfway between two multiples
-of the target will be rounded up or down in a random fashion.
-For example, in a large number of trials, C<nearest(10, 45)> will
-yield 40 half the time and 50 half the time.
-
-=item B<nlowmult> TARGET, LIST
-
-Returns the next lower multiple of the number(s) in LIST.
-TARGET must be positive.
-In scalar context, returns a single value; in list context, returns
-a list of values. Numbers that are between two multiples of the
-target will be adjusted to the nearest multiples of LIST that are
-algebraically lower. For example:
-
- nlowmult(10, 44) yields 40
- nlowmult(10, 46) 40
- nlowmult(25, 328) 325
- nlowmult(.1, 4.567) 4.5
- nlowmult(10, -41) -50
-
-=item B<nhimult> TARGET, LIST
-
-Returns the next higher multiple of the number(s) in LIST.
-TARGET must be positive.
-In scalar context, returns a single value; in list context, returns
-a list of values. Numbers that are between two multiples of the
-target will be adjusted to the nearest multiples of LIST that are
-algebraically higher. For example:
-
- nhimult(10, 44) yields 50
- nhimult(10, 46) 50
- nhimult(25, 328) 350
- nhimult(.1, 4.512) 4.6
- nhimult(10, -49) -40
-
-=back
-
-=head1 VARIABLE
-
-The variable B<$Math::Round::half> is used by most routines in this
-module. Its value is very slightly larger than 0.5, for reasons
-explained below. If you find that your application does not deliver
-the expected results, you may reset this variable at will.
-
-=head1 STANDARD FLOATING-POINT DISCLAIMER
-
-Floating-point numbers are, of course, a rational subset of the real
-numbers, so calculations with them are not always exact.
-Numbers that are supposed to be halfway between
-two others may surprise you; for instance, 0.85 may not be exactly
-halfway between 0.8 and 0.9, and (0.75 - 0.7) may not be the same as
-(0.85 - 0.8).
-
-In order to give more predictable results,
-these routines use a value for
-one-half that is slightly larger than 0.5. Nevertheless,
-if the numbers to be rounded are stored as floating-point, they will
-be subject as usual to the mercies of your hardware, your C
-compiler, etc.
-
-=head1 AUTHOR
-
-Math::Round was written by Geoffrey Rommel E<lt>grom...@cpan.orge<gt>
-in October 2000.
-
-=cut
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/Math-Round-0.07/dist.ini new/Math-Round-0.08/dist.ini
--- old/Math-Round-0.07/dist.ini 1970-01-01 01:00:00.000000000 +0100
+++ new/Math-Round-0.08/dist.ini 2023-10-10 13:04:10.000000000 +0200
@@ -0,0 +1,17 @@
+name = Math-Round
+author = Geoffrey Rommel <grom...@cpan.org>
+license = Perl_5
+copyright_holder = Geoffrey Rommel
+copyright_year = 2000
+
+version = 0.08
+
+[@Basic]
+[PkgVersion]
+[AutoPrereqs]
+[MetaJSON]
+
+[GithubMeta]
+[Git::Tag]
+tag_message=
+[Git::Push]
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/Math-Round-0.07/lib/Math/Round.pm
new/Math-Round-0.08/lib/Math/Round.pm
--- old/Math-Round-0.07/lib/Math/Round.pm 1970-01-01 01:00:00.000000000
+0100
+++ new/Math-Round-0.08/lib/Math/Round.pm 2023-10-10 13:04:10.000000000
+0200
@@ -0,0 +1,338 @@
+package Math::Round;
+$Math::Round::VERSION = '0.08';
+use 5.006;
+use strict;
+use warnings;
+
+use POSIX ();
+use vars qw($VERSION @ISA @EXPORT @EXPORT_OK %EXPORT_TAGS);
+
+use parent 'Exporter';
+
+our @EXPORT = qw/ round nearest /;
+our @EXPORT_OK = qw/ round nearest round_even round_odd round_rand
+ nearest_ceil nearest_floor nearest_rand
+ nlowmult nhimult /;
+
+our %EXPORT_TAGS = ( all => [ @EXPORT_OK ] );
+
+#--- Default value for "one-half". This is the lowest value that
+#--- gives acceptable results for test #6 in test.pl. See the pod
+#--- for more information.
+
+our $half = 0.50000000000008;
+
+sub round {
+ my $x;
+ my @res = map {
+ if ($_ >= 0) { POSIX::floor($_ + $Math::Round::half); }
+ else { POSIX::ceil($_ - $Math::Round::half); }
+ } @_;
+
+ return (wantarray) ? @res : $res[0];
+}
+
+sub round_even {
+ my @res = map {
+ my ($sign, $in, $fr) = _sepnum($_);
+ if ($fr == 0.5) {
+ $sign * (($in % 2 == 0) ? $in : $in + 1);
+ } else {
+ $sign * POSIX::floor(abs($_) + $Math::Round::half);
+ }
+ } @_;
+ return (wantarray) ? @res : $res[0];
+}
+
+sub round_odd {
+ my @res = map {
+ my ($sign, $in, $fr) = _sepnum($_);
+ if ($fr == 0.5) {
+ $sign * (($in % 2 == 1) ? $in : $in + 1);
+ } else {
+ $sign * POSIX::floor(abs($_) + $Math::Round::half);
+ }
+ } @_;
+ return (wantarray) ? @res : $res[0];
+}
+
+sub round_rand {
+ my @res = map {
+ my ($sign, $in, $fr) = _sepnum($_);
+ if ($fr == 0.5) {
+ $sign * ((rand(4096) < 2048) ? $in : $in + 1);
+ } else {
+ $sign * POSIX::floor(abs($_) + $Math::Round::half);
+ }
+ } @_;
+ return (wantarray) ? @res : $res[0];
+}
+
+#--- Separate a number into sign, integer, and fractional parts.
+#--- Return as a list.
+sub _sepnum {
+ my $x = shift;
+ my $sign = ($x >= 0) ? 1 : -1;
+ $x = abs($x);
+ my $i = int($x);
+ return ($sign, $i, $x - $i);
+}
+
+#------ "Nearest" routines (round to a multiple of any number)
+
+sub nearest {
+ my $targ = abs(shift);
+ my @res = map {
+ if ($_ >= 0) { $targ * int(($_ + $Math::Round::half * $targ) / $targ); }
+ else { $targ * POSIX::ceil(($_ - $Math::Round::half * $targ) / $targ); }
+ } @_;
+
+ return (wantarray) ? @res : $res[0];
+}
+
+# In the next two functions, the code for positive and negative numbers
+# turns out to be the same. For negative numbers, the technique is not
+# exactly obvious; instead of floor(x+0.5), we are in effect taking
+# ceiling(x-0.5).
+
+sub nearest_ceil {
+ my $targ = abs(shift);
+ my @res = map { $targ * POSIX::floor(($_ + $Math::Round::half * $targ) /
$targ) } @_;
+
+ return wantarray ? @res : $res[0];
+}
+
+sub nearest_floor {
+ my $targ = abs(shift);
+ my @res = map { $targ * POSIX::ceil(($_ - $Math::Round::half * $targ) /
$targ) } @_;
+
+ return wantarray ? @res : $res[0];
+}
+
+sub nearest_rand {
+ my $targ = abs(shift);
+
+ my @res = map {
+ my ($sign, $in, $fr) = _sepnear($_, $targ);
+ if ($fr == 0.5 * $targ) {
+ $sign * $targ * ((rand(4096) < 2048) ? $in : $in + 1);
+ } else {
+ $sign * $targ * int((abs($_) + $Math::Round::half * $targ) / $targ);
+ }
+ } @_;
+ return (wantarray) ? @res : $res[0];
+}
+
+#--- Next lower multiple
+sub nlowmult {
+ my $targ = abs(shift);
+ my @res = map { $targ * POSIX::floor($_ / $targ) } @_;
+
+ return wantarray ? @res : $res[0];
+}
+
+#--- Next higher multiple
+sub nhimult {
+ my $targ = abs(shift);
+ my @res = map { $targ * POSIX::ceil($_ / $targ) } @_;
+
+ return wantarray ? @res : $res[0];
+}
+
+#--- Separate a number into sign, "integer", and "fractional" parts
+#--- for the 'nearest' calculation. Return as a list.
+sub _sepnear {
+ my ($x, $targ) = @_;
+ my $sign = ($x >= 0) ? 1 : -1;
+ $x = abs($x);
+ my $i = int($x / $targ);
+ return ($sign, $i, $x - $i*$targ);
+}
+
+1;
+
+__END__
+
+=head1 NAME
+
+Math::Round - Perl extension for rounding numbers
+
+=head1 SYNOPSIS
+
+ use Math::Round qw(...those desired... or :all);
+
+ $rounded = round($scalar);
+ @rounded = round(LIST...);
+ $rounded = nearest($target, $scalar);
+ @rounded = nearest($target, LIST...);
+
+ # and other functions as described below
+
+=head1 DESCRIPTION
+
+B<Math::Round> supplies functions that will round numbers in different
+ways. The functions B<round> and B<nearest> are exported by
+default; others are available as described below. "use ... qw(:all)"
+exports all functions.
+
+=head1 FUNCTIONS
+
+=over 2
+
+=item B<round> LIST
+
+Rounds the number(s) to the nearest integer. In scalar context,
+returns a single value; in list context, returns a list of values.
+Numbers that are halfway between two integers are rounded
+"to infinity"; i.e., positive values are rounded up (e.g., 2.5
+becomes 3) and negative values down (e.g., -2.5 becomes -3).
+
+Starting in Perl 5.22, the POSIX module by default exports all functions,
+including one named "round". If you use both POSIX and this module,
+exercise due caution.
+
+=item B<round_even> LIST
+
+Rounds the number(s) to the nearest integer. In scalar context,
+returns a single value; in list context, returns a list of values.
+Numbers that are halfway between two integers are rounded to the
+nearest even number; e.g., 2.5 becomes 2, 3.5 becomes 4, and -2.5
+becomes -2.
+
+=item B<round_odd> LIST
+
+Rounds the number(s) to the nearest integer. In scalar context,
+returns a single value; in list context, returns a list of values.
+Numbers that are halfway between two integers are rounded to the
+nearest odd number; e.g., 3.5 becomes 3, 4.5 becomes 5, and -3.5
+becomes -3.
+
+=item B<round_rand> LIST
+
+Rounds the number(s) to the nearest integer. In scalar context,
+returns a single value; in list context, returns a list of values.
+Numbers that are halfway between two integers are rounded up or
+down in a random fashion. For example, in a large number of trials,
+2.5 will become 2 half the time and 3 half the time.
+
+=item B<nearest> TARGET, LIST
+
+Rounds the number(s) to the nearest multiple of the target value.
+TARGET must be positive.
+In scalar context, returns a single value; in list context, returns
+a list of values. Numbers that are halfway between two multiples
+of the target will be rounded to infinity. For example:
+
+ nearest(10, 44) yields 40
+ nearest(10, 46) 50
+ nearest(10, 45) 50
+ nearest(25, 328) 325
+ nearest(.1, 4.567) 4.6
+ nearest(10, -45) -50
+
+=item B<nearest_ceil> TARGET, LIST
+
+Rounds the number(s) to the nearest multiple of the target value.
+TARGET must be positive.
+In scalar context, returns a single value; in list context, returns
+a list of values. Numbers that are halfway between two multiples
+of the target will be rounded to the ceiling, i.e. the next
+algebraically higher multiple. For example:
+
+ nearest_ceil(10, 44) yields 40
+ nearest_ceil(10, 45) 50
+ nearest_ceil(10, -45) -40
+
+=item B<nearest_floor> TARGET, LIST
+
+Rounds the number(s) to the nearest multiple of the target value.
+TARGET must be positive.
+In scalar context, returns a single value; in list context, returns
+a list of values. Numbers that are halfway between two multiples
+of the target will be rounded to the floor, i.e. the next
+algebraically lower multiple. For example:
+
+ nearest_floor(10, 44) yields 40
+ nearest_floor(10, 45) 40
+ nearest_floor(10, -45) -50
+
+=item B<nearest_rand> TARGET, LIST
+
+Rounds the number(s) to the nearest multiple of the target value.
+TARGET must be positive.
+In scalar context, returns a single value; in list context, returns
+a list of values. Numbers that are halfway between two multiples
+of the target will be rounded up or down in a random fashion.
+For example, in a large number of trials, C<nearest(10, 45)> will
+yield 40 half the time and 50 half the time.
+
+=item B<nlowmult> TARGET, LIST
+
+Returns the next lower multiple of the number(s) in LIST.
+TARGET must be positive.
+In scalar context, returns a single value; in list context, returns
+a list of values. Numbers that are between two multiples of the
+target will be adjusted to the nearest multiples of LIST that are
+algebraically lower. For example:
+
+ nlowmult(10, 44) yields 40
+ nlowmult(10, 46) 40
+ nlowmult(25, 328) 325
+ nlowmult(.1, 4.567) 4.5
+ nlowmult(10, -41) -50
+
+=item B<nhimult> TARGET, LIST
+
+Returns the next higher multiple of the number(s) in LIST.
+TARGET must be positive.
+In scalar context, returns a single value; in list context, returns
+a list of values. Numbers that are between two multiples of the
+target will be adjusted to the nearest multiples of LIST that are
+algebraically higher. For example:
+
+ nhimult(10, 44) yields 50
+ nhimult(10, 46) 50
+ nhimult(25, 328) 350
+ nhimult(.1, 4.512) 4.6
+ nhimult(10, -49) -40
+
+=back
+
+=head1 VARIABLE
+
+The variable B<$Math::Round::half> is used by most routines in this
+module. Its value is very slightly larger than 0.5, for reasons
+explained below. If you find that your application does not deliver
+the expected results, you may reset this variable at will.
+
+=head1 STANDARD FLOATING-POINT DISCLAIMER
+
+Floating-point numbers are, of course, a rational subset of the real
+numbers, so calculations with them are not always exact.
+Numbers that are supposed to be halfway between
+two others may surprise you; for instance, 0.85 may not be exactly
+halfway between 0.8 and 0.9, and (0.75 - 0.7) may not be the same as
+(0.85 - 0.8).
+
+In order to give more predictable results,
+these routines use a value for
+one-half that is slightly larger than 0.5. Nevertheless,
+if the numbers to be rounded are stored as floating-point, they will
+be subject as usual to the mercies of your hardware, your C
+compiler, etc.
+
+=head1 AUTHOR
+
+Math::Round was written by Geoffrey Rommel E<lt>grom...@cpan.orge<gt>
+in October 2000.
+
+
+=head1 COPYRIGHT AND LICENSE
+
+This software is copyright (c) 2000 by Geoffrey Rommel
E<lt>grom...@cpan.orge<gt>.
+
+This is free software; you can redistribute it and/or modify it under
+the same terms as the Perl 5 programming language system itself.
+
+
+=cut
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/Math-Round-0.07/t/02-original.t
new/Math-Round-0.08/t/02-original.t
--- old/Math-Round-0.07/t/02-original.t 1970-01-01 01:00:00.000000000 +0100
+++ new/Math-Round-0.08/t/02-original.t 2023-10-10 13:04:10.000000000 +0200
@@ -0,0 +1,64 @@
+#!perl
+
+use strict;
+use warnings;
+use Test::More;
+
+use Math::Round qw(:all);
+
+
+ok( round(2.4) == 2
+ && round(2.5) == 3
+ && round(2.6) == 3
+ && eq2(round(-3.9, -2.5), -4, -3), "round");
+
+ok( round_even(2.4) == 2
+ && round_even(2.5) == 2
+ && eq2(round_even(-2.6, 3.5), -3, 4), "round_even");
+
+ok( round_odd(16.4) == 16
+ && round_odd(16.5) == 17
+ && round_odd(16.6) == 17
+ && eq2(round_odd(-16.7, 17.5), -17, 17), "round_odd");
+
+ok( round_rand(16.4) == 16
+ && round_rand(16.6) == 17
+ && eq2(round_rand(-17.8, -29.2), -18, -29), "round_rand");
+
+ok( nearest(20, 9) == 0
+ && nearest(20, 10) == 20
+ && nearest(20, 11) == 20
+ && sprintf("%.2f", nearest(0.01, 16.575)) eq "16.58"
+ && eq2(nearest(20, -98, -110), -100, -120), "nearest");
+
+ok( nearest_ceil(20, 9) == 0
+ && nearest_ceil(20, 10) == 20
+ && nearest_ceil(20, 11) == 20
+ && eq2(nearest_ceil(20, -98, -110), -100, -100), "nearest_ceil");
+
+ok( nearest_floor(20, 9) == 0
+ && nearest_floor(20, 10) == 0
+ && nearest_floor(20, 11) == 20
+ && eq2(nearest_floor(20, -98, -110), -100, -120), "nearest_floor");
+
+ok( nearest_rand(30, 44) == 30
+ && nearest_rand(30, 46) == 60
+ && eq2(nearest_rand(30, -76, -112), -90, -120), "nearest_rand");
+
+ok( nlowmult(10, 44) == 40
+ && nlowmult(10, 46) == 40
+ && eq2(nlowmult(30, -76, -91), -90, -120), "nlowmult");
+
+ok( nhimult(10, 41) == 50
+ && nhimult(10, 49) == 50
+ && eq2(nhimult(30, -74, -119), -60, -90), "nhimult");
+
+done_testing();
+
+
+#--- Compare two lists with 2 elements each for equality.
+sub eq2 {
+ my ($a0, $a1, $b0, $b1) = @_;
+ return ($a0 == $b0 && $a1 == $b1) ? 1 : 0;
+}
+
diff -urN '--exclude=CVS' '--exclude=.cvsignore' '--exclude=.svn'
'--exclude=.svnignore' old/Math-Round-0.07/test.pl new/Math-Round-0.08/test.pl
--- old/Math-Round-0.07/test.pl 2006-11-20 21:25:16.000000000 +0100
+++ new/Math-Round-0.08/test.pl 1970-01-01 01:00:00.000000000 +0100
@@ -1,90 +0,0 @@
-# Before `make install' is performed this script should be runnable with
-# `make test'. After `make install' it should work as `perl test.pl'
-
-################## We start with some black magic to print on failure.
-
-BEGIN { $| = 1; print "1..11\n"; }
-END {print "not ok 1\n" unless $loaded;}
-use Math::Round qw(:all);
-$loaded = 1;
-print "ok 1\n";
-
-################## End of black magic.
-
-my $failed = 0;
-
-#--- Both scalar and list contexts are tested.
-print "round............";
-was_it_ok(2, round(2.4) == 2 &&
- round(2.5) == 3 &&
- round(2.6) == 3 &&
- eq2(round(-3.9, -2.5), -4, -3) );
-
-print "round_even.......";
-was_it_ok(3, round_even(2.4) == 2 &&
- round_even(2.5) == 2 &&
- eq2(round_even(-2.6, 3.5), -3, 4) );
-
-print "round_odd........";
-was_it_ok(4, round_odd(16.4) == 16 &&
- round_odd(16.5) == 17 &&
- round_odd(16.6) == 17 &&
- eq2(round_odd(-16.7, 17.5), -17, 17) );
-
-print "round_rand.......";
-was_it_ok(5, round_rand(16.4) == 16 &&
- round_rand(16.6) == 17 &&
- eq2(round_rand(-17.8, -29.2), -18, -29) );
-
-print "nearest..........";
-was_it_ok(6, nearest(20, 9) == 0 &&
- nearest(20, 10) == 20 &&
- nearest(20, 11) == 20 &&
- sprintf("%.2f", nearest(0.01, 16.575)) eq "16.58" &&
- eq2(nearest(20, -98, -110), -100, -120) );
-
-print "nearest_ceil.....";
-was_it_ok(7, nearest_ceil(20, 9) == 0 &&
- nearest_ceil(20, 10) == 20 &&
- nearest_ceil(20, 11) == 20 &&
- eq2(nearest_ceil(20, -98, -110), -100, -100) );
-
-print "nearest_floor....";
-was_it_ok(8, nearest_floor(20, 9) == 0 &&
- nearest_floor(20, 10) == 0 &&
- nearest_floor(20, 11) == 20 &&
- eq2(nearest_floor(20, -98, -110), -100, -120) );
-
-print "nearest_rand.....";
-was_it_ok(9, nearest_rand(30, 44) == 30 &&
- nearest_rand(30, 46) == 60 &&
- eq2(nearest_rand(30, -76, -112), -90, -120) );
-
-print "nlowmult.........";
-was_it_ok(10, nlowmult(10, 44) == 40 &&
- nlowmult(10, 46) == 40 &&
- eq2(nlowmult(30, -76, -91), -90, -120) );
-
-print "nhimult..........";
-was_it_ok(11, nhimult(10, 41) == 50 &&
- nhimult(10, 49) == 50 &&
- eq2(nhimult(30, -74, -119), -60, -90) );
-
-if ($failed == 0) { print "All tests successful.\n"; }
-else {
- $tt = ($failed == 1) ? "1 test" : "$failed tests";
- print "$tt failed! There is no joy in Mudville.\n";
-}
-
-
-#--- Compare two lists with 2 elements each for equality.
-sub eq2 {
- my ($a0, $a1, $b0, $b1) = @_;
- return ($a0 == $b0 && $a1 == $b1) ? 1 : 0;
-}
-
-sub was_it_ok {
- my ($num, $test) = @_;
- if ($test) { print "ok $num\n"; }
- else { print "not ok $num\n"; $failed++; }
-}
