[packages/perl-Crypt-Primes] use generic url

[glen]

commit 7c68b70cc57eb8b1cf9f99de4fab1dc4ba5c9805
Author: Elan Ruusamäe <glen at delfi.ee>
Date:   Tue Nov 25 11:22:32 2014 +0200

    use generic url

 perl-Crypt-Primes.spec | 15 ++++++++-------
 1 file changed, 8 insertions(+), 7 deletions(-)
---
diff --git a/perl-Crypt-Primes.spec b/perl-Crypt-Primes.spec
index 7a84fdb..e9e9fd8 100644
--- a/perl-Crypt-Primes.spec
+++ b/perl-Crypt-Primes.spec
@@ -1,10 +1,10 @@
 #
 # Conditional build:
 %bcond_without	tests	# do not perform "make test"
-#
-%include	/usr/lib/rpm/macros.perl
+
 %define		pdir	Crypt
 %define		pnam	Primes
+%include	/usr/lib/rpm/macros.perl
 Summary:	Crypt::Primes - provable prime number generator suitable for cryptographic applications
 Summary(pl.UTF-8):	Crypt::Primes - wiarygodny generator liczb pierwszych, nadający się do aplikacji kryptograficznych
 Name:		perl-Crypt-Primes
@@ -15,9 +15,10 @@ License:	GPL v1+ or Artistic
 Group:		Development/Languages/Perl
 Source0:	http://www.cpan.org/modules/by-module/%{pdir}/%{pdir}-%{pnam}-%{version}.tar.gz
 # Source0-md5:	041947b9645142615d687b89cf2e1a7b
-BuildRequires:	perl-devel >= 1:5.8.0
+URL:		http://search.cpan.org/dist/Crypt-Primes/
 BuildRequires:	perl-Crypt-Random >= 0.33
 BuildRequires:	perl-Math-Pari >= 2.001804
+BuildRequires:	perl-devel >= 1:5.8.0
 BuildRequires:	rpm-perlprov >= 4.1-13
 BuildArch:	noarch
 BuildRoot:	%{tmpdir}/%{name}-%{version}-root-%(id -u -n)
@@ -25,10 +26,10 @@ BuildRoot:	%{tmpdir}/%{name}-%{version}-root-%(id -u -n)
 %description
 Crypt::Primes module implements in pure Perl Ueli Maurer's algorithm
 for generating large provable primes and secure parameters for
-public-key cryptosystems.  The generated primes are almost uniformly
+public-key cryptosystems. The generated primes are almost uniformly
 distributed over the set of primes of the specified bitsize and
 expected time for generation is less than the time required for
-generating a pseudo-prime of the same size with Miller-Rabin tests. 
+generating a pseudo-prime of the same size with Miller-Rabin tests.
 Detailed description and running time analysis of the algorithm can be
 found in Maurer's paper (Fast Generation of Prime Numbers and Secure
 Public-Key Cryptographic Parameters, Ueli Maurer (1994)).
@@ -45,8 +46,8 @@ testów Millera-Rabina. Szczegółowy opis i analizy czasowe algorytmu
 można znaleźć z artykule Maurera (Fast Generation of Prime Numbers and
 Secure Public-Key Cryptographic Parameters, Ueli Maurer (1994))
 
-- wiarygodny generator liczb pierwszych,
-nadający się dla aplikacji kryptograficznych.
+- wiarygodny generator liczb pierwszych, nadający się dla aplikacji
+  kryptograficznych.
 
 %prep
 %setup -q -n %{pdir}-%{pnam}-%{version}
================================================================

---- gitweb:

http://git.pld-linux.org/gitweb.cgi/packages/perl-Crypt-Primes.git/commitdiff/7c68b70cc57eb8b1cf9f99de4fab1dc4ba5c9805