readme-script

test/average/average.py

@@ -1,2 +1,2 @@
-def average(*args):
+def average(*args):
     return sum(args, 0.0) / len(args)

test/byte_size/byte_size.py

@@ -1,2 +1,2 @@
-def byte_size(string):
+def byte_size(string):
     return(len(string.encode('utf-8')))

test/capitalize/capitalize.py

@@ -1,2 +1,2 @@
-def capitalize(string, lower_rest=False):
+def capitalize(string, lower_rest=False):
     return string[:1].upper() + (string[1:].lower() if lower_rest else string[1:])

test/capitalize_every_word/capitalize_every_word.py

@@ -1,2 +1,2 @@
-def capitalize_every_word(string):
+def capitalize_every_word(string):
     return string.title()

test/chunk/chunk.py

@@ -1,7 +1,7 @@
-from math import ceil
-
-
-def chunk(arr, size):
-    return list(
-        map(lambda x: arr[x * size:x * size + size],
+from math import ceil
+
+
+def chunk(arr, size):
+    return list(
+        map(lambda x: arr[x * size:x * size + size],
             list(range(0, ceil(len(arr) / size)))))

test/compact/compact.py

@@ -1,2 +1,2 @@
-def compact(arr):
+def compact(arr):
     return list(filter(lambda x: bool(x), arr))

test/count_by/count_by.py

@@ -1,6 +1,6 @@
-def count_by(arr, fn=lambda x: x):
-    key = {}
-    for el in map(fn, arr):
-        key[el] = 0 if not el in key else key[el]
-        key[el] += 1
+def count_by(arr, fn=lambda x: x):
+    key = {}
+    for el in map(fn, arr):
+        key[el] = 0 if not el in key else key[el]
+        key[el] += 1
     return key

test/count_occurences/count_occurences.py

@@ -1,4 +1,4 @@
-def count_occurences(arr, val):
-    return reduce(
-        (lambda x, y: x + 1 if y == val and type(y) == type(val) else x + 0),
+def count_occurences(arr, val):
+    return reduce(
+        (lambda x, y: x + 1 if y == val and type(y) == type(val) else x + 0),
         arr)

test/count_vowels/count_vowels.py

@@ -1,5 +1,5 @@
-import re
-
-
-def count_vowels(str):
+import re
+
+
+def count_vowels(str):
     return len(len(re.findall(r'[aeiou]', str, re.IGNORECASE)))

test/decapitalize/decapitalize.py

@@ -1,2 +1,2 @@
-def decapitalize(string, upper_rest=False):
+def decapitalize(string, upper_rest=False):
     return str[:1].lower() + (str[1:].upper() if upper_rest else str[1:])

test/deep_flatten/deep_flatten.py

@@ -1,15 +1,15 @@
-def spread(arg):
-    ret = []
-    for i in arg:
-        if isinstance(i, list):
-            ret.extend(i)
-        else:
-            ret.append(i)
-    return ret
-
-
-def deep_flatten(arr):
-    result = []
-    result.extend(
-        spread(list(map(lambda x: deep(x) if type(x) == list else x, arr))))
+def spread(arg):
+    ret = []
+    for i in arg:
+        if isinstance(i, list):
+            ret.extend(i)
+        else:
+            ret.append(i)
+    return ret
+
+
+def deep_flatten(arr):
+    result = []
+    result.extend(
+        spread(list(map(lambda x: deep_flatten(x) if type(x) == list else x, arr))))
     return result

test/difference/difference.py

@@ -1,3 +1,3 @@
-def difference(a, b):
-    b = set(b)
+def difference(a, b):
+    b = set(b)
     return [item for item in a if item not in b]

test/difference_by/difference_by.py

@@ -1,3 +1,3 @@
-def difference_by(a, b, fn):
-    b = set(map(fn, b))
+def difference_by(a, b, fn):
+    b = set(map(fn, b))
     return [item for item in a if fn(item) not in b]

test/factorial/factorial.py

@@ -1,5 +1,5 @@
-def factorial(num):
-    if not ((num >= 0) & (num % 1 == 0)):
-        raise Exception(
-            f"Number( {num} ) can't be floating point or negative ")
+def factorial(num):
+    if not ((num >= 0) & (num % 1 == 0)):
+        raise Exception(
+            f"Number( {num} ) can't be floating point or negative ")
     return 1 if num == 0 else num * factorial(num - 1)

test/gcd/gcd.py

@@ -1,21 +1,21 @@
-from functools import reduce
-
-
-def spread(arg):
-    ret = []
-    for i in arg:
-        if isinstance(i, list):
-            ret.extend(i)
-        else:
-            ret.append(i)
-    return ret
-
-
-def gcd(*args):
-    numbers = []
-    numbers.extend(spread(list(args)))
-
-    def _gcd(x, y):
-        return x if not y else gcd(y, x % y)
-
+from functools import reduce
+
+
+def spread(arg):
+    ret = []
+    for i in arg:
+        if isinstance(i, list):
+            ret.extend(i)
+        else:
+            ret.append(i)
+    return ret
+
+
+def gcd(*args):
+    numbers = []
+    numbers.extend(spread(list(args)))
+
+    def _gcd(x, y):
+        return x if not y else gcd(y, x % y)
+
     return reduce((lambda x, y: _gcd(x, y)), numbers)

test/insertion_sort/insertion_sort.py

@@ -0,0 +1,9 @@
+def insertionsort(arr):
+
+    for i in range(1, len(arr)):
+        key = arr[i]
+        j = i - 1
+        while j >= 0 and key < arr[j]:
+            arr[j + 1] = arr[j]
+            j -= 1
+            arr[j + 1] = key

test/insertion_sort/insertion_sort.test.py

@@ -0,0 +1,6 @@
+import types,functools
+from pytape import test
+from insertion_sort import insertion_sort
+def insertion_sort_test(t):
+    t.true(isinstance(insertion_sort, (types.BuiltinFunctionType, types.FunctionType, functools.partial)),'insertion_sort is a function')
+test('Testing insertion_sort',insertion_sort_test)

test/is_lower_case/is_lower_case.py

@@ -1,2 +1,2 @@
-def is_lower_case(str):
+def is_lower_case(str):
     return str == str.lower()

test/is_upper_case/is_upper_case.py

@@ -1,2 +1,2 @@
-def is_upper_case(str):
+def is_upper_case(str):
     return str == str.upper()

test/lcm/lcm.py

@@ -1,24 +1,24 @@
-from functools import reduce
-
-
-def spread(arg):
-    ret = []
-    for i in arg:
-        if isinstance(i, list):
-            ret.extend(i)
-        else:
-            ret.append(i)
-    return ret
-
-
-def lcm(*args):
-    numbers = []
-    numbers.extend(spread(list(args)))
-
-    def _gcd(x, y):
-        return x if not y else gcd(y, x % y)
-
-    def _lcm(x, y):
-        return x * y / _gcd(x, y)
-
+from functools import reduce
+
+
+def spread(arg):
+    ret = []
+    for i in arg:
+        if isinstance(i, list):
+            ret.extend(i)
+        else:
+            ret.append(i)
+    return ret
+
+
+def lcm(*args):
+    numbers = []
+    numbers.extend(spread(list(args)))
+
+    def _gcd(x, y):
+        return x if not y else _gcd(y, x % y)
+
+    def _lcm(x, y):
+        return x * y / _gcd(x, y)
+
     return reduce((lambda x, y: _lcm(x, y)), numbers)

test/max_n/max_n.py

@@ -1,8 +1,8 @@
-from copy import deepcopy
-
-
-def max_n(arr, n=1):
-    numbers = deepcopy(arr)
-    numbers.sort()
-    numbers.reverse()
+from copy import deepcopy
+
+
+def max_n(arr, n=1):
+    numbers = deepcopy(arr)
+    numbers.sort()
+    numbers.reverse()
     return numbers[:n]

test/min_n/min_n.py

@@ -1,7 +1,7 @@
-from copy import deepcopy
-
-
-def min_n(arr, n=1):
-    numbers = deepcopy(arr)
-    numbers.sort()
+from copy import deepcopy
+
+
+def min_n(arr, n=1):
+    numbers = deepcopy(arr)
+    numbers.sort()
     return numbers[:n]

test/palindrome/palindrome.py

@@ -1,4 +1,4 @@
-def palindrome(string):
-    from re import sub
-    s = sub('[\W_]', '', string.lower())
+def palindrome(string):
+    from re import sub
+    s = sub('[\W_]', '', string.lower())
     return s == s[::-1]

test/shuffle/shuffle.py

@@ -1,12 +1,12 @@
-from copy import deepcopy
-from random import randint
-
-
-def shuffle(arr):
-    temp_arr = deepcopy(arr)
-    m = len(temp_arr)
-    while (m):
-        m -= 1
-        i = randint(0, m)
-        temp_arr[m], temp_arr[i] = temp_arr[i], temp_arr[m]
+from copy import deepcopy
+from random import randint
+
+
+def shuffle(arr):
+    temp_arr = deepcopy(arr)
+    m = len(temp_arr)
+    while (m):
+        m -= 1
+        i = randint(0, m)
+        temp_arr[m], temp_arr[i] = temp_arr[i], temp_arr[m]
     return temp_arr

test/spread/spread.py

@@ -1,8 +1,8 @@
-def spread(arg):
-    ret = []
-    for i in arg:
-        if isinstance(i, list):
-            ret.extend(i)
-        else:
-            ret.append(i)
+def spread(arg):
+    ret = []
+    for i in arg:
+        if isinstance(i, list):
+            ret.extend(i)
+        else:
+            ret.append(i)
     return ret

test/zip/zip.py

@@ -1,8 +1,8 @@
-def zip(*args, fillvalue=None):
-    max_length = max([len(arr) for arr in args])
-    result = []
-    for i in range(max_length):
-        result.append([
-            args[k][i] if i < len(args[k]) else None for k in range(len(args))
-        ])
+def zip(*args, fillvalue=None):
+    max_length = max([len(arr) for arr in args])
+    result = []
+    for i in range(max_length):
+        result.append([
+            args[k][i] if i < len(args[k]) else None for k in range(len(args))
+        ])
     return result