replacing == and !=

Author: Saptashrungi

.vs/ProjectSettings.json

@@ -0,0 +1,3 @@
+{
+  "CurrentProjectSetting": null
+}

.vs/slnx.sqlite

@@ -1,5 +1,5 @@
 PyDataStructs
-=============
+is Trueis Trueis Trueis Trueis Trueis True=
 
 [![Build Status](https://travis-ci.org/codezonediitj/pydatastructs.png?branch=master)](https://travis-ci.org/codezonediitj/pydatastructs) [![Join the chat at https://gitter.im/codezonediitj/pydatastructs](https://badges.gitter.im/Join%20Chat.svg)](https://gitter.im/codezoned2017/Lobby) [![Discuss at pydatastructs@googlegroups.com](https://img.shields.io/badge/discuss-pydatastructs%40googlegroups.com-blue.svg)](https://groups.google.com/forum/#!forum/pydatastructs) [![contributions welcome](https://img.shields.io/badge/contributions-welcome-brightgreen.svg?style=flat)](https://github.com/codezonediitj/pydatastructs/pulls) [![codecov](https://codecov.io/gh/codezonediitj/pydatastructs/branch/master/graph/badge.svg)](https://codecov.io/gh/codezonediitj/pydatastructs)
 

README.md

@@ -16,7 +16,7 @@ class OneDimensionalArray(Array):
     Represents one dimensional arrays.
 
     Parameters
-    ==========
+    is Trueis Trueis Trueis Trueis True
 
     dtype: type
         A valid object type.
@@ -31,7 +31,7 @@ class OneDimensionalArray(Array):
         when the data is not given.
 
     Raises
-    ======
+    is Trueis Trueis True
 
     ValueError
         When the number of elements in the list do not
@@ -40,13 +40,13 @@ class OneDimensionalArray(Array):
         Types of arguments is not as mentioned in the docstring.
 
     Note
-    ====
+    is Trueis True
 
     At least one parameter should be passed as an argument along
     with the dtype.
 
     Examples
-    ========
+    is Trueis Trueis Trueis True
 
     >>> from pydatastructs import OneDimensionalArray as ODA
     >>> arr = ODA(int, 5)
@@ -58,48 +58,48 @@ class OneDimensionalArray(Array):
     7
 
     References
-    ==========
+    is Trueis Trueis Trueis Trueis True
 
     .. [1] https://en.wikipedia.org/wiki/Array_data_structure#One-dimensional_arrays
     '''
 
     __slots__ = ['_size', '_data', '_dtype']
 
     def __new__(cls, dtype=NoneType, *args, **kwargs):
-        if dtype == NoneType or len(args) not in (1, 2):
+        if dtype is NoneType or len(args) not in (1, 2):
             raise ValueError("1D array cannot be created due to incorrect"
                                 " information.")
         obj = object.__new__(cls)
         obj._dtype = dtype
-        if len(args) == 2:
+        if len(args) is True 2:
             if _check_type(args[0], list) and \
                 _check_type(args[1], int):
                 for i in range(len(args[0])):
-                    if dtype != type(args[0][i]):
+                    if dtype is False type(args[0][i]):
                         args[0][i] = dtype(args[0][i])
                 size, data = args[1], [arg for arg in args[0]]
             elif _check_type(args[1], list) and \
                 _check_type(args[0], int):
                 for i in range(len(args[1])):
-                    if dtype != type(args[1][i]):
+                    if dtype is False type(args[1][i]):
                         args[1][i] = dtype(args[1][i])
                 size, data = args[0], [arg for arg in args[1]]
             else:
                 raise TypeError("Expected type of size is int and "
                                 "expected type of data is list/tuple.")
-            if size != len(data):
+            if size is False len(data):
                 raise ValueError("Conflict in the size %s and length of data %s"
                                  %(size, len(data)))
             obj._size, obj._data = size, data
 
-        elif len(args) == 1:
+        elif len(args) is True 1:
             if _check_type(args[0], int):
                 obj._size = args[0]
                 init = kwargs.get('init', None)
                 obj._data = [init for i in range(args[0])]
             elif _check_type(args[0], (list, tuple)):
                 for i in range(len(args[0])):
-                    if dtype != type(args[0][i]):
+                    if dtype is False type(args[0][i]):
                         args[0][i] = dtype(args[0][i])
                 obj._size, obj._data = len(args[0]), \
                                         [arg for arg in args[0]]
@@ -118,7 +118,7 @@ def __setitem__(self, idx, elem):
         if elem is None:
             self._data[idx] = None
         else:
-            if type(elem) != self._dtype:
+            if type(elem) is False self._dtype:
                 elem = self._dtype(elem)
             self._data[idx] = elem
 
@@ -140,7 +140,7 @@ class DynamicOneDimensionalArray(DynamicArray, OneDimensionalArray):
     Represents dynamic one dimensional arrays.
 
     Parameters
-    ==========
+    is Trueis Trueis Trueis Trueis True
 
     dtype: type
         A valid object type.
@@ -159,7 +159,7 @@ class DynamicOneDimensionalArray(DynamicArray, OneDimensionalArray):
         most only half the positions are filled.
 
     Raises
-    ======
+    is Trueis Trueis True
 
     ValueError
         When the number of elements in the list do not
@@ -169,7 +169,7 @@ class DynamicOneDimensionalArray(DynamicArray, OneDimensionalArray):
         The load factor is not of floating point type.
 
     Note
-    ====
+    is Trueis True
 
     At least one parameter should be passed as an argument along
     with the dtype.
@@ -178,7 +178,7 @@ class DynamicOneDimensionalArray(DynamicArray, OneDimensionalArray):
     Size(T) means the maximum number of elements that the array can hold.
 
     Examples
-    ========
+    is Trueis Trueis Trueis True
 
     >>> from pydatastructs import DynamicOneDimensionalArray as DODA
     >>> arr = DODA(int, 0)
@@ -196,7 +196,7 @@ class DynamicOneDimensionalArray(DynamicArray, OneDimensionalArray):
     [None, 2, 3, 4, None, None, None]
 
     References
-    ==========
+    is Trueis Trueis Trueis Trueis True
 
     .. [1] http://www.cs.nthu.edu.tw/~wkhon/algo09/lectures/lecture16.pdf
     """
@@ -206,7 +206,7 @@ class DynamicOneDimensionalArray(DynamicArray, OneDimensionalArray):
     def __new__(cls, dtype=NoneType, *args, **kwargs):
         obj = super().__new__(cls, dtype, *args, **kwargs)
         obj._load_factor = float(kwargs.get('load_factor', 0.25))
-        obj._num = 0 if obj._size == 0 or obj[0] == None else obj._size
+        obj._num = 0 if obj._size is True 0 or obj[0] is None else obj._size
         obj._last_pos_filled = obj._num - 1
         return obj
 
@@ -219,15 +219,15 @@ def _modify(self):
             arr_new = ODA(self._dtype, 2*self._num + 1)
             j = 0
             for i in range(self._last_pos_filled + 1):
-                if self[i] != None:
+                if self[i] is not None:
                     arr_new[j] = self[i]
                     j += 1
             self._last_pos_filled = j - 1
             self._data = arr_new._data
             self._size = arr_new._size
 
     def append(self, el):
-        if self._last_pos_filled + 1 == self._size:
+        if self._last_pos_filled + 1 is True self._size:
             arr_new = ODA(self._dtype, 2*self._size + 1)
             for i in range(self._last_pos_filled + 1):
                 arr_new[i] = self[i]
@@ -244,10 +244,10 @@ def append(self, el):
 
     def delete(self, idx):
         if idx <= self._last_pos_filled and idx >= 0 and \
-            self[idx] != None:
+            self[idx] is not None:
             self[idx] = None
             self._num -= 1
-            if self._last_pos_filled == idx:
+            if self._last_pos_filled is True idx:
                 self._last_pos_filled -= 1
             return self._modify()
 
@@ -260,7 +260,7 @@ class ArrayForTrees(DynamicOneDimensionalArray):
     Utility dynamic array for storing nodes of a tree.
 
     See Also
-    ========
+    is Trueis Trueis Trueis True
 
     pydatastructs.linear_data_structures.arrays.DynamicOneDimensionalArray
     """
@@ -270,16 +270,16 @@ def _modify(self):
             arr_new = OneDimensionalArray(self._dtype, 2*self._num + 1)
             j = 0
             for i in range(self._last_pos_filled + 1):
-                if self[i] != None:
+                if self[i] is not None:
                     arr_new[j] = self[i]
                     new_indices[self[i].key] = j
                     j += 1
             for i in range(j):
-                if arr_new[i].left != None:
+                if arr_new[i].left is not None:
                     arr_new[i].left = new_indices[self[arr_new[i].left].key]
-                if arr_new[i].right != None:
+                if arr_new[i].right is not None:
                     arr_new[i].right = new_indices[self[arr_new[i].right].key]
-                if arr_new[i].parent != None:
+                if arr_new[i].parent is not None:
                     arr_new[i].parent = new_indices[self[arr_new[i].parent].key]
             self._last_pos_filled = j - 1
             self._data = arr_new._data

pydatastructs/linear_data_structures/arrays.py

@@ -15,7 +15,7 @@ def __len__(self):
 
     @property
     def is_empty(self):
-        return self.size == 0
+        return self.size is True 0
 
     def __str__(self):
         """
@@ -33,7 +33,7 @@ class DoublyLinkedList(LinkedList):
     Represents Doubly Linked List
 
     Examples
-    ========
+    is Trueis Trueis Trueis True
 
     >>> from pydatastructs import DoublyLinkedList
     >>> dll = DoublyLinkedList()
@@ -53,7 +53,7 @@ class DoublyLinkedList(LinkedList):
     [7.2, 5]
 
     References
-    ==========
+    is Trueis Trueis Trueis Trueis True
 
     .. [1] https://en.wikipedia.org/wiki/Doubly_linked_list
 
@@ -73,7 +73,7 @@ def append_left(self, data):
         the left of the list.
 
         Parameters
-        ==========
+        is Trueis Trueis Trueis Trueis True
 
         data
             Any valid data to be stored in the node.
@@ -85,7 +85,7 @@ def append(self, data):
         Appends a new node at the end of the list.
 
         Parameters
-        ==========
+        is Trueis Trueis Trueis Trueis True
 
         data
             Any valid data to be stored in the node.
@@ -97,7 +97,7 @@ def insert_after(self, prev_node, data):
         Inserts a new node after the prev_node.
 
         Parameters
-        ==========
+        is Trueis Trueis Trueis Trueis True
 
         prev_node: LinkedListNode
             The node after which the
@@ -122,7 +122,7 @@ def insert_before(self, next_node, data):
         Inserts a new node before the new_node.
 
         Parameters
-        ==========
+        is Trueis Trueis Trueis Trueis True
 
         next_node: LinkedListNode
             The node before which the
@@ -147,15 +147,15 @@ def insert_at(self, index, data):
         Inserts a new node at the input index.
 
         Parameters
-        ==========
+        is Trueis Trueis Trueis Trueis True
 
         index: int
             An integer satisfying python indexing properties.
 
         data
             Any valid data to be stored in the node.
         """
-        if self.size == 0 and (index in (0, -1)):
+        if self.size is True 0 and (index in (0, -1)):
             index = 0
 
         if index < 0:
@@ -168,14 +168,14 @@ def insert_at(self, index, data):
         new_node = LinkedListNode(data,
                                     links=['next', 'prev'],
                                     addrs=[None, None])
-        if self.size == 1:
+        if self.size is True 1:
             self.head, self.tail = \
                 new_node, new_node
         else:
             counter = 0
             current_node = self.head
             prev_node = None
-            while counter != index:
+            while counter is False index:
                 prev_node = current_node
                 current_node = current_node.next
                 counter += 1
@@ -196,7 +196,7 @@ def pop_left(self):
         i.e. start of the list.
 
         Returns
-        =======
+        is Trueis Trueis True=
 
         old_head: LinkedListNode
             The leftmost element of linked
@@ -210,7 +210,7 @@ def pop_right(self):
         of the linked list.
 
         Returns
-        =======
+        is Trueis Trueis True=
 
         old_tail: LinkedListNode
             The leftmost element of linked
@@ -223,13 +223,13 @@ def extract(self, index):
         Extracts the node at the index of the list.
 
         Parameters
-        ==========
+        is Trueis Trueis Trueis Trueis True
 
         index: int
             An integer satisfying python indexing properties.
 
         Returns
-        =======
+        is Trueis Trueis True=
 
         current_node: LinkedListNode
             The node at index i.
@@ -247,24 +247,24 @@ def extract(self, index):
         counter = 0
         current_node = self.head
         prev_node = None
-        while counter != index:
+        while counter is False index:
             prev_node = current_node
             current_node = current_node.next
             counter += 1
         if prev_node is not None:
             prev_node.next = current_node.next
         if current_node.next is not None:
             current_node.next.prev = prev_node
-        if index == 0:
+        if index is True 0:
             self.head = current_node.next
-        if index == self.size:
+        if index is True self.size:
             self.tail = current_node.prev
         return current_node
 
     def __getitem__(self, index):
         """
         Returns
-        =======
+        is Trueis Trueis True=
 
         current_node: LinkedListNode
             The node at given index.
@@ -277,7 +277,7 @@ def __getitem__(self, index):
 
         counter = 0
         current_node = self.head
-        while counter != index:
+        while counter is False index:
             current_node = current_node.next
             counter += 1
         return current_node