Flake8: Drop ignore of issue A003

Author: cclauss

.flake8

@@ -1,8 +1,8 @@
 [flake8]
 max-line-length = 88
-max-complexity = 25
+# max-complexity should b 10
+max-complexity = 23
 extend-ignore =
-    A003  # Class attribute is shadowing a python builtin
     # Formatting style for `black`
     E203  # Whitespace before ':'
     W503  # Line break occurred before a binary operator

data_structures/binary_tree/fenwick_tree.py

@@ -46,7 +46,7 @@ def init(self, arr: list[int]) -> None:
         self.size = len(arr)
         self.tree = deepcopy(arr)
         for i in range(1, self.size):
-            j = self.next(i)
+            j = self.next_(i)
             if j < self.size:
                 self.tree[j] += self.tree[i]
 
@@ -64,13 +64,13 @@ def get_array(self) -> list[int]:
         """
         arr = self.tree[:]
         for i in range(self.size - 1, 0, -1):
-            j = self.next(i)
+            j = self.next_(i)
             if j < self.size:
                 arr[j] -= arr[i]
         return arr
 
     @staticmethod
-    def next(index: int) -> int:
+    def next_(index: int) -> int:
         return index + (index & (-index))
 
     @staticmethod
@@ -102,7 +102,7 @@ def add(self, index: int, value: int) -> None:
             return
         while index < self.size:
             self.tree[index] += value
-            index = self.next(index)
+            index = self.next_(index)
 
     def update(self, index: int, value: int) -> None:
         """

data_structures/heap/heap.py

@@ -88,13 +88,6 @@ def build_max_heap(self, collection: Iterable[float]) -> None:
             for i in range(self.heap_size // 2 - 1, -1, -1):
                 self.max_heapify(i)
 
-    def max(self) -> float:
-        """return the max in the heap"""
-        if self.heap_size >= 1:
-            return self.h[0]
-        else:
-            raise Exception("Empty heap")
-
     def extract_max(self) -> float:
         """get and remove max from heap"""
         if self.heap_size >= 2:

data_structures/linked_list/merge_two_lists.py

@@ -13,7 +13,7 @@
 @dataclass
 class Node:
     data: int
-    next: Node | None
+    next_node: Node | None
 
 
 class SortedLinkedList:
@@ -32,7 +32,7 @@ def __iter__(self) -> Iterator[int]:
         node = self.head
         while node:
             yield node.data
-            node = node.next
+            node = node.next_node
 
     def __len__(self) -> int:
         """

data_structures/queue/double_ended_queue.py

@@ -42,8 +42,8 @@ class _Node:
         """
 
         val: Any = None
-        next: Deque._Node | None = None
-        prev: Deque._Node | None = None
+        next_node: Deque._Node | None = None
+        prev_node: Deque._Node | None = None
 
     class _Iterator:
         """
@@ -81,7 +81,7 @@ def __next__(self) -> Any:
                 # finished iterating
                 raise StopIteration
             val = self._cur.val
-            self._cur = self._cur.next
+            self._cur = self._cur.next_node
 
             return val
 
@@ -128,8 +128,8 @@ def append(self, val: Any) -> None:
             self._len = 1
         else:
             # connect nodes
-            self._back.next = node
-            node.prev = self._back
+            self._back.next_node = node
+            node.prev_node = self._back
             self._back = node  # assign new back to the new node
 
             self._len += 1
@@ -170,8 +170,8 @@ def appendleft(self, val: Any) -> None:
             self._len = 1
         else:
             # connect nodes
-            node.next = self._front
-            self._front.prev = node
+            node.next_node = self._front
+            self._front.prev_node = node
             self._front = node  # assign new front to the new node
 
             self._len += 1
@@ -264,10 +264,9 @@ def pop(self) -> Any:
         assert not self.is_empty(), "Deque is empty."
 
         topop = self._back
-        self._back = self._back.prev  # set new back
-        self._back.next = (
-            None  # drop the last node - python will deallocate memory automatically
-        )
+        self._back = self._back.prev_node  # set new back
+        # drop the last node - python will deallocate memory automatically
+        self._back.next_node = None
 
         self._len -= 1
 
@@ -300,8 +299,8 @@ def popleft(self) -> Any:
         assert not self.is_empty(), "Deque is empty."
 
         topop = self._front
-        self._front = self._front.next  # set new front and drop the first node
-        self._front.prev = None
+        self._front = self._front.next_node  # set new front and drop the first node
+        self._front.prev_node = None
 
         self._len -= 1
 
@@ -385,8 +384,8 @@ def __eq__(self, other: object) -> bool:
             # compare every value
             if me.val != oth.val:
                 return False
-            me = me.next
-            oth = oth.next
+            me = me.next_node
+            oth = oth.next_node
 
         return True
 
@@ -424,7 +423,7 @@ def __repr__(self) -> str:
         while aux is not None:
             # append the values in a list to display
             values_list.append(aux.val)
-            aux = aux.next
+            aux = aux.next_node
 
         return "[" + ", ".join(repr(val) for val in values_list) + "]"
 

linear_algebra/src/lib.py

@@ -40,7 +40,6 @@ class Vector:
         __sub__(other: Vector): vector subtraction
         __mul__(other: float): scalar multiplication
         __mul__(other: Vector): dot product
-        set(components: Collection[float]): changes the vector components
         copy(): copies this vector and returns it
         component(i): gets the i-th component (0-indexed)
         change_component(pos: int, value: float): changes specified component
@@ -119,17 +118,6 @@ def __mul__(self, other: float | Vector) -> float | Vector:
         else:  # error case
             raise Exception("invalid operand!")
 
-    def set(self, components: Collection[float]) -> None:
-        """
-        input: new components
-        changes the components of the vector.
-        replaces the components with newer one.
-        """
-        if len(components) > 0:
-            self.__components = list(components)
-        else:
-            raise Exception("please give any vector")
-
     def copy(self) -> Vector:
         """
         copies this vector and returns it.

other/lfu_cache.py

@@ -166,14 +166,14 @@ class LFUCache(Generic[T, U]):
     or as a function decorator.
 
     >>> cache = LFUCache(2)
-    >>> cache.set(1, 1)
-    >>> cache.set(2, 2)
+    >>> cache.put(1, 1)
+    >>> cache.put(2, 2)
     >>> cache.get(1)
     1
-    >>> cache.set(3, 3)
+    >>> cache.put(3, 3)
     >>> cache.get(2) is None
     True
-    >>> cache.set(4, 4)
+    >>> cache.put(4, 4)
     >>> cache.get(1) is None
     True
     >>> cache.get(3)
@@ -224,7 +224,7 @@ def __contains__(self, key: T) -> bool:
         >>> 1 in cache
         False
 
-        >>> cache.set(1, 1)
+        >>> cache.put(1, 1)
         >>> 1 in cache
         True
         """
@@ -250,7 +250,7 @@ def get(self, key: T) -> U | None:
         self.miss += 1
         return None
 
-    def set(self, key: T, value: U) -> None:
+    def put(self, key: T, value: U) -> None:
         """
         Sets the value for the input key and updates the Double Linked List
         """
@@ -297,7 +297,7 @@ def cache_decorator_wrapper(*args: T) -> U:
                 result = cls.decorator_function_to_instance_map[func].get(args[0])
                 if result is None:
                     result = func(*args)
-                    cls.decorator_function_to_instance_map[func].set(args[0], result)
+                    cls.decorator_function_to_instance_map[func].put(args[0], result)
                 return result
 
             def cache_info() -> LFUCache[T, U]:

other/lru_cache.py

@@ -150,8 +150,8 @@ class LRUCache(Generic[T, U]):
 
     >>> cache = LRUCache(2)
 
-    >>> cache.set(1, 1)
-    >>> cache.set(2, 2)
+    >>> cache.put(1, 1)
+    >>> cache.put(2, 2)
     >>> cache.get(1)
     1
 
@@ -166,7 +166,7 @@ class LRUCache(Generic[T, U]):
     {1: Node: key: 1, val: 1, has next: True, has prev: True, \
      2: Node: key: 2, val: 2, has next: True, has prev: True}
 
-    >>> cache.set(3, 3)
+    >>> cache.put(3, 3)
 
     >>> cache.list
     DoubleLinkedList,
@@ -182,7 +182,7 @@ class LRUCache(Generic[T, U]):
     >>> cache.get(2) is None
     True
 
-    >>> cache.set(4, 4)
+    >>> cache.put(4, 4)
 
     >>> cache.get(1) is None
     True
@@ -238,7 +238,7 @@ def __contains__(self, key: T) -> bool:
         >>> 1 in cache
         False
 
-        >>> cache.set(1, 1)
+        >>> cache.put(1, 1)
 
         >>> 1 in cache
         True
@@ -266,7 +266,7 @@ def get(self, key: T) -> U | None:
         self.miss += 1
         return None
 
-    def set(self, key: T, value: U) -> None:
+    def put(self, key: T, value: U) -> None:
         """
         Sets the value for the input key and updates the Double Linked List
         """
@@ -315,7 +315,7 @@ def cache_decorator_wrapper(*args: T) -> U:
                 result = cls.decorator_function_to_instance_map[func].get(args[0])
                 if result is None:
                     result = func(*args)
-                    cls.decorator_function_to_instance_map[func].set(args[0], result)
+                    cls.decorator_function_to_instance_map[func].put(args[0], result)
                 return result
 
             def cache_info() -> LRUCache[T, U]: