Flake8: Drop ignore of issue A003 (#7949)

* Flake8: Drop ignore of issue A003

* updating DIRECTORY.md

Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
This commit is contained in:
Christian Clauss
2022-11-02 19:20:45 +01:00
committed by GitHub
parent 598f6a26a1
commit 45b3383c39
9 changed files with 42 additions and 62 deletions

View File

@ -46,7 +46,7 @@ class FenwickTree:
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 @@ class FenwickTree:
"""
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 @@ class FenwickTree:
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:
"""

View File

@ -88,13 +88,6 @@ class Heap:
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:

View File

@ -13,7 +13,7 @@ test_data_even = (4, 6, 2, 0, 8, 10, 3, -2)
@dataclass
class Node:
data: int
next: Node | None
next_node: Node | None
class SortedLinkedList:
@ -32,7 +32,7 @@ class SortedLinkedList:
node = self.head
while node:
yield node.data
node = node.next
node = node.next_node
def __len__(self) -> int:
"""

View File

@ -42,8 +42,8 @@ class Deque:
"""
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 @@ class Deque:
# 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 @@ class Deque:
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 @@ class Deque:
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 @@ class Deque:
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 @@ class Deque:
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 @@ class Deque:
# 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 @@ class Deque:
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) + "]"