From f06aa5ee9c33b7bd2ef6e69fe937097378e57bc4 Mon Sep 17 00:00:00 2001 From: Ben Finney Date: Tue, 19 Apr 2016 17:46:54 +1000 Subject: [PATCH] Imported Upstream version 0.2.2a --- CHANGES.txt | 6 ++++++ PKG-INFO | 9 +++++---- setup.py | 10 +++++++--- src/pyprimes/__init__.py | 4 ++-- 4 files changed, 20 insertions(+), 9 deletions(-) diff --git a/CHANGES.txt b/CHANGES.txt index f6cdbbe..7acc1a3 100644 --- a/CHANGES.txt +++ b/CHANGES.txt @@ -2,6 +2,12 @@ C H A N G E L O G ========================================================================= +Version 0.2.2a 2015-01-19 + * Improved handling of expensive tests (thanks to Ben Finney) + +Version 0.2.1a 2015-01-08 + * Version bump to satisfy PyPI packaging difficulties. + Version 0.2a 2015-01-07 * Python 3.x support. * pyprimes now also works with Python 2.4 through 2.7. diff --git a/PKG-INFO b/PKG-INFO index 7d2c0fe..9e71ce9 100644 --- a/PKG-INFO +++ b/PKG-INFO @@ -1,13 +1,13 @@ Metadata-Version: 1.1 Name: pyprimes -Version: 0.2.1a +Version: 0.2.2a Summary: Generate and test for prime numbers. Home-page: http://code.google.com/p/pyprimes/ Author: Steven D'Aprano Author-email: steve+python@pearwood.info License: MIT Description: The pyprimes package offers a variety of algorithms for generating prime - numbers and fast primality test, written in pure Python. + numbers and fast primality tests, written in pure Python. Prime numbers are those positive integers which are not divisible exactly by any number other than itself or one. Generating primes and testing for @@ -25,10 +25,10 @@ Description: The pyprimes package offers a variety of algorithms for generating division, Turner's algorithm, and primality testing using a regular expression. - Factorise small numbers into the product of prime factors. - - Suitable for Python 2.4 through 3.2 from one code base. + - Suitable for Python 2.4 through 3.x from one code base. -Keywords: prime,primes,primality,math,maths,algorithm,fermat,miller-rabin +Keywords: algorithm,eratosthenes,factors,fermat,math,maths,miller-rabin,primality,prime,primes,sieve Platform: UNKNOWN Classifier: Development Status :: 3 - Alpha Classifier: Programming Language :: Python @@ -36,6 +36,7 @@ Classifier: Programming Language :: Python :: 2.4 Classifier: Programming Language :: Python :: 2.5 Classifier: Programming Language :: Python :: 2.6 Classifier: Programming Language :: Python :: 2.7 +Classifier: Programming Language :: Python :: 3 Classifier: Programming Language :: Python :: 3.0 Classifier: Programming Language :: Python :: 3.1 Classifier: Programming Language :: Python :: 3.2 diff --git a/setup.py b/setup.py index a7faf8a..193e600 100644 --- a/setup.py +++ b/setup.py @@ -27,11 +27,14 @@ setup( author = __author__, author_email = __author_email__, url = 'http://code.google.com/p/pyprimes/', - keywords = "prime primes primality math maths algorithm fermat miller-rabin".split(), + keywords = sorted([ + 'algorithm', 'eratosthenes', 'factors', 'fermat', 'math', 'maths', + 'miller-rabin', 'primality', 'prime', 'primes', 'sieve', + ]), description = "Generate and test for prime numbers.", long_description = """\ The pyprimes package offers a variety of algorithms for generating prime -numbers and fast primality test, written in pure Python. +numbers and fast primality tests, written in pure Python. Prime numbers are those positive integers which are not divisible exactly by any number other than itself or one. Generating primes and testing for @@ -49,7 +52,7 @@ as of great practical importance for encrypting data. division, Turner's algorithm, and primality testing using a regular expression. - Factorise small numbers into the product of prime factors. - - Suitable for Python 2.4 through 3.2 from one code base. + - Suitable for Python 2.4 through 3.x from one code base. """, license = 'MIT', # apologies for the American spelling @@ -60,6 +63,7 @@ as of great practical importance for encrypting data. "Programming Language :: Python :: 2.5", "Programming Language :: Python :: 2.6", "Programming Language :: Python :: 2.7", + "Programming Language :: Python :: 3", "Programming Language :: Python :: 3.0", "Programming Language :: Python :: 3.1", "Programming Language :: Python :: 3.2", diff --git a/src/pyprimes/__init__.py b/src/pyprimes/__init__.py index 56269ef..ee17a84 100644 --- a/src/pyprimes/__init__.py +++ b/src/pyprimes/__init__.py @@ -180,8 +180,8 @@ from pyprimes.utilities import filter_between # Module metadata. -__version__ = "0.2.1a" -__date__ = "2015-01-07" +__version__ = "0.2.2a" +__date__ = "2015-01-19" __author__ = "Steven D'Aprano" __author_email__ = "steve+python@pearwood.info" -- 2.11.4.GIT