[libmath-prime-util-perl] 45/72: Remove trailing whitespace
Partha P. Mukherjee
ppm-guest at moszumanska.debian.org
Thu May 21 18:49:40 UTC 2015
This is an automated email from the git hooks/post-receive script.
ppm-guest pushed a commit to annotated tag v0.32
in repository libmath-prime-util-perl.
commit 468aacb26eb3d656f7f70d619abea8f0579a2853
Author: Dana Jacobsen <dana at acm.org>
Date: Wed Sep 25 17:50:43 2013 -0700
Remove trailing whitespace
---
Changes | 7 +++++--
XS.xs | 2 +-
lib/Math/Prime/Util/ECAffinePoint.pm | 2 +-
lib/Math/Prime/Util/ECProjectivePoint.pm | 2 +-
lib/Math/Prime/Util/ZetaBigFloat.pm | 2 +-
5 files changed, 9 insertions(+), 6 deletions(-)
diff --git a/Changes b/Changes
index ff72b29..3657197 100644
--- a/Changes
+++ b/Changes
@@ -43,6 +43,9 @@ Revision history for Perl module Math::Prime::Util
- Some fixes around near maxint primes, forprimes, etc.
+ - Bytes::Random::Secure is loaded only when random prime functionality
+ is used. Shaves a few milliseconds and bytes off of startup.
+
0.31 2013-08-07
- Change proof certificate documentation to reflect the new text format.
@@ -126,7 +129,7 @@ Revision history for Perl module Math::Prime::Util
$sum = 0; forprimes { $sum += $_ } 1000,50000; say $sum;
forprimes { say if is_prime($_+2) } 10000; # print twin primes
- - my $it = prime_iterator(10000); say $it->();
+ - my $it = prime_iterator(10000); say $it->();
This is experimental (that is, the interface may change).
0.27 2013-05-20
@@ -456,7 +459,7 @@ Revision history for Perl module Math::Prime::Util
[Minor Changes]
- Make miller_rabin return 0 if given even number.
- The XS miller_rabin code now works with large base > n.
- - factor always returns sorted results
+ - factor always returns sorted results
- miller_rabin() deprecated. Use is_strong_pseudoprime instead.
[Support all functionality of:]
diff --git a/XS.xs b/XS.xs
index daf3125..b6cd063 100644
--- a/XS.xs
+++ b/XS.xs
@@ -788,7 +788,7 @@ forprimes (SV* block, IN SV* svbeg, IN SV* svend = 0)
/* Handle early part */
while (beg < 6) {
dSP;
- beg = (beg <= 2) ? 2 : (beg <= 3) ? 3 : 5;
+ beg = (beg <= 2) ? 2 : (beg <= 3) ? 3 : 5;
if (beg <= end) {
sv_setuv(svarg, beg);
GvSV(PL_defgv) = svarg;
diff --git a/lib/Math/Prime/Util/ECAffinePoint.pm b/lib/Math/Prime/Util/ECAffinePoint.pm
index 8fe8a9b..725efd9 100644
--- a/lib/Math/Prime/Util/ECAffinePoint.pm
+++ b/lib/Math/Prime/Util/ECAffinePoint.pm
@@ -120,7 +120,7 @@ sub add {
$other->{'x'}, $other->{'y'});
return $self;
}
-
+
sub a { return shift->{'a'}; }
sub b { return shift->{'b'}; }
diff --git a/lib/Math/Prime/Util/ECProjectivePoint.pm b/lib/Math/Prime/Util/ECProjectivePoint.pm
index 9501627..89a662a 100644
--- a/lib/Math/Prime/Util/ECProjectivePoint.pm
+++ b/lib/Math/Prime/Util/ECProjectivePoint.pm
@@ -38,7 +38,7 @@ sub new {
bless $self, $class;
return $self;
}
-
+
sub _addx {
my ($x1, $x2, $xin, $n) = @_;
diff --git a/lib/Math/Prime/Util/ZetaBigFloat.pm b/lib/Math/Prime/Util/ZetaBigFloat.pm
index c76cc37..350ad23 100644
--- a/lib/Math/Prime/Util/ZetaBigFloat.pm
+++ b/lib/Math/Prime/Util/ZetaBigFloat.pm
@@ -345,7 +345,7 @@ sub RiemannZeta {
my $dig = int($_Borwein_n / 1.3)+1;
_Recompute_Dk( int($xdigits * 1.3) + 4 ) if $dig < $xdigits;
}
-
+
if (ref $_Borwein_dk[0] ne 'Math::BigInt') {
@_Borwein_dk = map { Math::BigInt->new("$_") } @_Borwein_dk;
}
--
Alioth's /usr/local/bin/git-commit-notice on /srv/git.debian.org/git/pkg-perl/packages/libmath-prime-util-perl.git
More information about the Pkg-perl-cvs-commits
mailing list