Add files via upload

Author: CokeStudios

build/lib/find_primes/__init__.py

@@ -281,7 +281,7 @@ def find_palindromes(n):
     palin_primes = []
     for ix, xp in enumerate(primes):
         palin_num = int(str(xp)[::-1])
-        if is_prime(palin_num) and palin_num == xp and xp > 10:
+        if is_prime(palin_num) and palin_num == xp:
             palin_primes.append(palin_num)
 
     return palin_primes
@@ -310,7 +310,7 @@ def find_reverses(n):
     reverse_primes = {}
     for ix, xp in enumerate(primes):
         reverse_num = int(str(xp)[::-1])
-        if is_prime(reverse_num) and xp > 10:
+        if is_prime(reverse_num):
             reverse_primes[xp] = reverse_num
 
     palin_primes = find_palindromes(n)

build/lib/find_primes/test.py

@@ -0,0 +1,44 @@
+from requests import get
+from unittest import TestCase, main
+try:
+    from .find_primes import *
+
+except ImportError:
+    from find_primes import *
+
+def get_answer(string):
+    try:
+        t = get(f'https://oeis.org/{string}').text
+    
+    except Exception:
+        try:
+            t = get(f'https://oeis.org/{string}').text
+        
+        except Exception:
+            return
+    
+    located_1 = t.find('<tt>')
+    located_2 = t.find('</tt>')
+    answer_str = t[located_1:located_2][4:]
+    return [int(x) for x in answer_str.split(', ')]
+
+class TestAnswer(TestCase):
+    def test_all_prime(self):
+        result = all_primes(275, 'list')
+        answer = get_answer('A000040')
+        self.assertEqual(result, answer)
+
+    def test_twin_prime(self):
+        result = find_twins(1610)
+        answer1 = get_answer('A001359')
+        answer2 = get_answer('A006512')
+        self.assertEqual(list(result.keys()), answer1)
+        self.assertEqual(list(result.values()), answer2)
+    
+    def test_palindome_prime(self):
+        result = find_palindromes(18190)
+        answer = get_answer('A002385')
+        self.assertEqual(result, answer)
+
+if __name__ == '__main__':
+    main()

dist/find_primes-2.2.0.post1-py3-none-any.whl

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

dist/find_primes-2.2.0.post1.tar.gz

@@ -3,6 +3,7 @@ README.md
 setup.py
 bin/find_primes.py
 find_primes/__init__.py
+find_primes/test.py
 find_primes.egg-info/PKG-INFO
 find_primes.egg-info/SOURCES.txt
 find_primes.egg-info/dependency_links.txt

find_primes.egg-info/PKG-INFO

@@ -1,3 +1,4 @@
 numpy
 rsa
 mpmath
+requests

find_primes.egg-info/SOURCES.txt

@@ -281,7 +281,7 @@ def find_palindromes(n):
     palin_primes = []
     for ix, xp in enumerate(primes):
         palin_num = int(str(xp)[::-1])
-        if is_prime(palin_num) and palin_num == xp and xp > 10:
+        if is_prime(palin_num) and palin_num == xp:
             palin_primes.append(palin_num)
 
     return palin_primes
@@ -310,7 +310,7 @@ def find_reverses(n):
     reverse_primes = {}
     for ix, xp in enumerate(primes):
         reverse_num = int(str(xp)[::-1])
-        if is_prime(reverse_num) and xp > 10:
+        if is_prime(reverse_num):
             reverse_primes[xp] = reverse_num
 
     palin_primes = find_palindromes(n)

find_primes.egg-info/requires.txt

@@ -0,0 +1,44 @@
+from requests import get
+from unittest import TestCase, main
+try:
+    from .find_primes import *
+
+except ImportError:
+    from find_primes import *
+
+def get_answer(string):
+    try:
+        t = get(f'https://oeis.org/{string}').text
+    
+    except Exception:
+        try:
+            t = get(f'https://oeis.org/{string}').text
+        
+        except Exception:
+            return
+    
+    located_1 = t.find('<tt>')
+    located_2 = t.find('</tt>')
+    answer_str = t[located_1:located_2][4:]
+    return [int(x) for x in answer_str.split(', ')]
+
+class TestAnswer(TestCase):
+    def test_all_prime(self):
+        result = all_primes(275, 'list')
+        answer = get_answer('A000040')
+        self.assertEqual(result, answer)
+
+    def test_twin_prime(self):
+        result = find_twins(1610)
+        answer1 = get_answer('A001359')
+        answer2 = get_answer('A006512')
+        self.assertEqual(list(result.keys()), answer1)
+        self.assertEqual(list(result.values()), answer2)
+    
+    def test_palindome_prime(self):
+        result = find_palindromes(18190)
+        answer = get_answer('A002385')
+        self.assertEqual(result, answer)
+
+if __name__ == '__main__':
+    main()

find_primes/__init__.py

@@ -7,11 +7,11 @@
 
 setup(
     name = 'find_primes',
-    version = '2.2.0',
+    version = '2.2.0.post1',
     author = 'JamesJ',
     author_email = 'GGJamesQQ@yeah.net',
     description = 'A module to find primes and factors of big numbers.',
-    install_requires = ['numpy', 'rsa', 'mpmath'],
+    install_requires = ['numpy', 'rsa', 'mpmath', 'requests'],
     python_requires = '>=3.6.0',
     classifiers = [
         'Programming Language :: Python',