removed implementation classes from global namespace

pydatastructs/miscellaneous_data_structures/__init__.py

@@ -11,15 +11,11 @@
 __all__.extend(binomial_trees.__all__)
 
 from .stack import (
-    Stack,
-    ArrayStack,
-    LinkedListStack
+    Stack
 )
 __all__.extend(stack.__all__)
 
 from .queue import (
-    Queue,
-    ArrayQueue,
-    LinkedListQueue
+    Queue
 )
 __all__.extend(queue.__all__)

pydatastructs/miscellaneous_data_structures/queue.py

@@ -3,9 +3,7 @@
 from copy import deepcopy as dc
 
 __all__ = [
-    'Queue',
-    'ArrayQueue',
-    'LinkedListQueue'
+    'Queue'
 ]
 
 class Queue(object):
@@ -75,8 +73,6 @@ class ArrayQueue(Queue):
 
     def __new__(cls, items=None, dtype=NoneType):
         if items is None:
-            #TODO: Better implementation of ArrayQueue(items=None, dtype=NoneType)
-            dtype = int
             items = DynamicOneDimensionalArray(dtype, 0)
         else:
             dtype = type(items[0])

pydatastructs/miscellaneous_data_structures/stack.py

@@ -4,8 +4,6 @@
 
 __all__ = [
     'Stack',
-    'ArrayStack',
-    'LinkedListStack'
 ]
 
 class Stack(object):
@@ -84,8 +82,6 @@ class ArrayStack(Stack):
 
     def __new__(cls, items=None, dtype=NoneType):
         if items is None:
-            #TODO: Better implementation of ArrayStack(items=None, dtype=NoneType)
-            dtype = int
             items = DynamicOneDimensionalArray(dtype, 0)
         else:
             items = DynamicOneDimensionalArray(dtype, items)

pydatastructs/miscellaneous_data_structures/tests/test_queue.py

@@ -1,5 +1,4 @@
-from pydatastructs.miscellaneous_data_structures import (
-    Queue, ArrayQueue, LinkedListQueue)
+from pydatastructs.miscellaneous_data_structures import Queue
 from pydatastructs.utils.raises_util import raises
 
 def test_Queue():
@@ -8,11 +7,9 @@ def test_Queue():
     q1 = Queue(implementation='linked_list')
 
 def test_ArrayQueue():
-    q = ArrayQueue()
     q1 = Queue()
     raises(IndexError, lambda: q1.popleft())
     q1 = Queue(implementation='array', items=[0])
-    assert type(q) == type(q1)
     q1.append(1)
     q1.append(2)
     q1.append(3)
@@ -26,9 +23,7 @@ def test_ArrayQueue():
     assert len(q1) == 0
 
 def test_LinkedListQueue():
-    q = LinkedListQueue()
     q1 = Queue(implementation='linked_list')
-    assert type(q) == type(q1)
     q1.append(1)
     assert raises(TypeError, lambda: Queue(implementation='linked_list', items={0, 1}))
     q1 = Queue(implementation='linked_list', items = [0, 1])

pydatastructs/miscellaneous_data_structures/tests/test_stack.py

@@ -1,4 +1,4 @@
-from pydatastructs.miscellaneous_data_structures import Stack, ArrayStack, LinkedListStack
+from pydatastructs.miscellaneous_data_structures import Stack
 from pydatastructs.linear_data_structures import OneDimensionalArray
 from pydatastructs.utils.raises_util import raises
 
@@ -8,7 +8,7 @@ def test_Stack():
     s = Stack(implementation='linked_list')
 
 def test_ArrayStack():
-    s = ArrayStack()
+    s = Stack(implementation='array')
     s.push(1)
     s.push(2)
     s.push(3)