Add files via upload

Author: GUO Joanna

build/lib/find_primes/__init__.py

@@ -19,8 +19,8 @@
 except ImportError:
     NUMPY_ENABLED = False
 
-PRIME_TEST = False
-FACTOR_TEST = False
+PRIME_TEST = True
+FACTOR_TEST = True
 try:
     from rsa import newkeys, __version__
     print('Detected rsa version {__version__}'.format(**locals()))
@@ -2909,7 +2909,7 @@ def multiply_point(P, k, curve):
 
         return P2
 
-    def lenstra(n, mode = 1, tries = 10):
+    def factor(n, mode = 1, tries = 10):
         factors = []
         for i in (2, 3):
             while n % i == 0:
@@ -2990,7 +2990,7 @@ def lenstra(n, mode = 1, tries = 10):
         factors.sort()
         return factors
 
-    return lenstra(n)
+    return factor(n)
 
 def factor_pollardpm1(n, retry = 1):
     '''
@@ -3219,9 +3219,7 @@ def test():
 
 if __name__ == '__main__':
     if version_info[0] == 3 and version_info[1] >= 6:
-        if list(reversed(list(vars(args).values()))) == list(vars(args).values()):
-            test()
-            print(factor_williamspp1(137817))
+        test()
 
     else:
         print('The test method can\'t run in your python version.')

dist/find_primes-2.1.5-py3-none-any.whl

@@ -1,6 +1,6 @@
 Metadata-Version: 2.1
 Name: find-primes
-Version: 2.1.4
+Version: 2.1.5
 Summary: A module for finding primes and finding factors of big numbers.
 Home-page: https://github.com/git4robot/pypi_find_primes
 Author: JamesJ

dist/find_primes-2.1.5.tar.gz

@@ -19,8 +19,8 @@
 except ImportError:
     NUMPY_ENABLED = False
 
-PRIME_TEST = False
-FACTOR_TEST = False
+PRIME_TEST = True
+FACTOR_TEST = True
 try:
     from rsa import newkeys, __version__
     print('Detected rsa version {__version__}'.format(**locals()))
@@ -2909,7 +2909,7 @@ def multiply_point(P, k, curve):
 
         return P2
 
-    def lenstra(n, mode = 1, tries = 10):
+    def factor(n, mode = 1, tries = 10):
         factors = []
         for i in (2, 3):
             while n % i == 0:
@@ -2990,7 +2990,7 @@ def lenstra(n, mode = 1, tries = 10):
         factors.sort()
         return factors
 
-    return lenstra(n)
+    return factor(n)
 
 def factor_pollardpm1(n, retry = 1):
     '''
@@ -3219,9 +3219,7 @@ def test():
 
 if __name__ == '__main__':
     if version_info[0] == 3 and version_info[1] >= 6:
-        if list(reversed(list(vars(args).values()))) == list(vars(args).values()):
-            test()
-            print(factor_williamspp1(137817))
+        test()
 
     else:
         print('The test method can\'t run in your python version.')

find_primes.egg-info/PKG-INFO

@@ -7,7 +7,7 @@
 
 setup(
     name = 'find_primes',
-    version = '2.1.4',
+    version = '2.1.5',
     author = 'JamesJ',
     author_email = 'GGJamesQQ@yeah.net',
     description = 'A module for finding primes and finding factors of big numbers.',