Added test for backend argument

Author: czgdp1807

pydatastructs/miscellaneous_data_structures/stack.py

@@ -88,7 +88,10 @@ class ArrayStack(Stack):
 
     __slots__ = ['items']
 
-    def __new__(cls, items=None, dtype=NoneType):
+    def __new__(cls, items=None, dtype=NoneType,
+                **kwargs):
+        raise_if_backend_is_not_python(
+            cls, kwargs.get('backend', Backend.PYTHON))
         if items is None:
             items = DynamicOneDimensionalArray(dtype, 0)
         else:
@@ -137,7 +140,9 @@ class LinkedListStack(Stack):
 
     __slots__ = ['stack']
 
-    def __new__(cls, items=None):
+    def __new__(cls, items=None, **kwargs):
+        raise_if_backend_is_not_python(
+            cls, kwargs.get('backend', Backend.PYTHON))
         obj = object.__new__(cls)
         obj.stack = SinglyLinkedList()
         if items is None:

pydatastructs/trees/heaps.py

@@ -74,7 +74,10 @@ class DHeap(Heap):
     """
     __slots__ = ['_comp', 'heap', 'd', 'heap_property', '_last_pos_filled']
 
-    def __new__(cls, elements=None, heap_property="min", d=4):
+    def __new__(cls, elements=None, heap_property="min", d=4,
+                **kwargs):
+        raise_if_backend_is_not_python(
+            cls, kwargs.get('backend', Backend.PYTHON))
         obj = Heap.__new__(cls)
         obj.heap_property = heap_property
         obj.d = d
@@ -265,7 +268,10 @@ class BinaryHeap(DHeap):
 
     .. [1] https://en.m.wikipedia.org/wiki/Binary_heap
     """
-    def __new__(cls, elements=None, heap_property="min"):
+    def __new__(cls, elements=None, heap_property="min",
+                **kwargs):
+        raise_if_backend_is_not_python(
+            cls, kwargs.get('backend', Backend.PYTHON))
         obj = DHeap.__new__(cls, elements, heap_property, 2)
         return obj
 
@@ -329,7 +335,10 @@ class TernaryHeap(DHeap):
     .. [1] https://en.wikipedia.org/wiki/D-ary_heap
     .. [2] https://ece.uwaterloo.ca/~dwharder/aads/Algorithms/d-ary_heaps/Ternary_heaps/
     """
-    def __new__(cls, elements=None, heap_property="min"):
+    def __new__(cls, elements=None, heap_property="min",
+                **kwargs):
+        raise_if_backend_is_not_python(
+            cls, kwargs.get('backend', Backend.PYTHON))
         obj = DHeap.__new__(cls, elements, heap_property, 3)
         return obj
 
@@ -369,7 +378,9 @@ class BinomialHeap(Heap):
     """
     __slots__ = ['root_list']
 
-    def __new__(cls, root_list=None):
+    def __new__(cls, root_list=None, **kwargs):
+        raise_if_backend_is_not_python(
+            cls, kwargs.get('backend', Backend.PYTHON))
         if root_list is None:
             root_list = []
         if not all((_check_type(root, BinomialTree))

pydatastructs/utils/tests/test_code_quality.py

@@ -1,4 +1,5 @@
 import os, re, sys, pydatastructs, inspect
+from typing import Type
 
 def _list_files():
     root_path = os.path.abspath(
@@ -129,10 +130,25 @@ def test_public_api():
                                     _class, method
                                 ))
 
-# def test_backend_argument():
-#     apis = _apis()
-#     for api in apis:
-#         try:
-#             api()
-#         except ValueError as error:
-#             assert str(api) in error.args[0]
+def test_backend_argument():
+
+    def call_and_raise(api, pos_args_count=0):
+        try:
+            if pos_args_count == 0:
+                api(backend=None)
+            elif pos_args_count == 1:
+                api(None, backend=None)
+            elif pos_args_count == 2:
+                api(None, None, backend=None)
+        except ValueError as value_error:
+            assert str(api) in value_error.args[0]
+        except TypeError as type_error:
+            max_pos_args_count = 2
+            if pos_args_count <= max_pos_args_count:
+                call_and_raise(api, pos_args_count + 1)
+            else:
+                raise type_error
+
+    apis = _apis()
+    for api in apis:
+        call_and_raise(api, 0)