Add coverall to algorithms (#261)

* Add coverall to Algorithms

* Add .coverage to gitignore

* Fix prime_test in tests.math

* Add coveral badge to README

* Change the prime_test to prime_check

Author: Hai Hoang Dang

.coveragerc

@@ -0,0 +1,5 @@
+[report]
+omit =
+    */python?.?/*
+    */site-packages/nose/*
+    *__init__*

.gitignore

@@ -2,4 +2,5 @@ __pycache__/
 *.py[cod]
 .idea/
 .cache/
-.pytest_cache/
+.pytest_cache/
+.coverage

.travis.yml

@@ -12,6 +12,9 @@ matrix:
 install:
     - pip install -r requirements.txt
     - pip install flake8  # pytest  # add another testing frameworks later
+    - pip install python-coveralls
+    - pip install coverage
+    - pip install nose
 before_script:
     # stop the build if there are Python syntax errors or undefined names
     - flake8 . --count --select=E901,E999,F821,F822,F823 --show-source --statistics
@@ -22,6 +25,11 @@ script:
     - python3 -m unittest discover tests
     # Check pytest running
     - python3 -m pytest tests
+    # Run nose with coverage support
+    - nosetests --with-coverage
 notifications:
     on_success: change
     on_failure: change  # `always` will be the setting once code changes slow down
+
+after_success:
+  - coveralls

README.md

@@ -2,6 +2,7 @@ English | [简体中文](https://github.com/yunshuipiao/algorithms/blob/master/R
 
 [![Open Source Helpers](https://www.codetriage.com/keon/algorithms/badges/users.svg)](https://www.codetriage.com/keon/algorithms)
 [![Build Status](https://travis-ci.org/keon/algorithms.svg?branch=master)](https://travis-ci.org/keon/algorithms)
+[![Coverage Status](https://coveralls.io/repos/github/keon/algorithms/badge.svg?branch=master)](https://coveralls.io/github/keon/algorithms?branch=master)
 
 Pythonic Data Structures and Algorithms
 =========================================
@@ -153,7 +154,7 @@ For running all tests write down:
     - [next_bigger](maths/next_bigger.py)
     - [next_perfect_square](maths/next_perfect_square.py)
     - [nth_digit](maths/nth_digit.py)
-    - [prime_test](maths/prime_test.py)
+    - [prime_check](maths/prime_check.py)
     - [primes_sieve_of_eratosthenes](maths/primes_sieve_of_eratosthenes.py)
     - [pythagoras](maths/pythagoras.py)
     - [rabin_miller](maths/rabin_miller.py)

maths/prime_test.py renamed to maths/prime_check.py

@@ -2,7 +2,7 @@
 prime_test(n) returns a True if n is a prime number else it returns False
 """
 
-def prime_test(n):
+def prime_check(n):
     if n <= 1:
         return False
     if n == 2 or n == 3:
@@ -17,7 +17,7 @@ def prime_test(n):
     return True
 
 
-def prime_test2(n):
+def prime_check2(n):
     # prime numbers are greater than 1
     if n > 1:
         # check for factors
@@ -26,11 +26,11 @@ def prime_test2(n):
                 # print(num, "is not a prime number")
                 # print(i, "times", num//i, "is", num)
                 return False
-        
+
         # print(num, "is a prime number")
         return True
 
     # if input number is less than
     # or equal to 1, it is not prime
     else:
-        return False
+        return False

tests/test_maths.py

@@ -4,7 +4,7 @@
 from maths.generate_strobogrammtic import gen_strobogrammatic, strobogrammatic_in_range
 from maths.is_strobogrammatic import is_strobogrammatic, is_strobogrammatic2
 from maths.next_perfect_square import find_next_square, find_next_square2
-from maths.prime_test import prime_test
+from maths.prime_check import prime_check, prime_check2
 from maths.primes_sieve_of_eratosthenes import primes
 from maths.pythagoras import pythagoras
 from maths.rabin_miller import is_prime
@@ -96,7 +96,7 @@ def test_is_strobogrammatic2(self):
 class TestNextPerfectSquare(unittest.TestCase):
     """[summary]
     Test for the file next_perfect_square.py
-    
+
     Arguments:
         unittest {[type]} -- [description]
     """
@@ -137,7 +137,7 @@ def test_prime_test(self):
         """
         counter = 0
         for i in range(2, 101):
-            if prime_test(i):
+            if prime_check(i):
                 counter += 1
         self.assertEqual(25, counter)
 
@@ -148,14 +148,14 @@ def test_prime_test2(self):
         """
         counter = 0
         for i in range(2, 101):
-            if prime_test(i):
+            if prime_check2(i):
                 counter += 1
         self.assertEqual(25, counter)
 
 
 class TestPythagoras(unittest.TestCase):
     """[summary]
-    Test for the file pythagoras.py 
+    Test for the file pythagoras.py
 
     Arguments:
         unittest {[type]} -- [description]
@@ -188,7 +188,7 @@ class TestRSA(unittest.TestCase):
     """
 
     def test_encrypt_decrypt(self):
-      
+
         self.assertEqual(7, decrypt(encrypt(7, 23, 143), 47, 143))
 
     # def test_key_generator(self):  # this test takes a while!