algorithm/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2026-03-13 09:50:19 +08:00
Code Issues Packages Projects Releases Wiki Activity

Add flake8 pluin flake8 bugbear to pre-commit (#7132)

Browse Source 
* ci(pre-commit): Add ``flake8-builtins`` additional dependency to ``pre-commit`` (#7104)

* refactor: Fix ``flake8-builtins`` (#7104)

* fix(lru_cache): Fix naming conventions in docstrings (#7104)

* ci(pre-commit): Order additional dependencies alphabetically (#7104)

* fix(lfu_cache): Correct function name in docstring (#7104)

* Update strings/snake_case_to_camel_pascal_case.py

Co-authored-by: Christian Clauss <cclauss@me.com>

* Update data_structures/stacks/next_greater_element.py

Co-authored-by: Christian Clauss <cclauss@me.com>

* Update digital_image_processing/index_calculation.py

Co-authored-by: Christian Clauss <cclauss@me.com>

* Update graphs/prim.py

Co-authored-by: Christian Clauss <cclauss@me.com>

* Update hashes/djb2.py

Co-authored-by: Christian Clauss <cclauss@me.com>

* refactor: Rename `_builtin` to `builtin_` ( #7104)

* fix: Rename all instances (#7104)

* refactor: Update variable names (#7104)

* [pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

* ci: Create ``tox.ini`` and ignore ``A003`` (#7123)

* revert: Remove function name changes (#7104)

* [pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

* Rename tox.ini to .flake8

* Update data_structures/heap/heap.py

Co-authored-by: Dhruv Manilawala <dhruvmanila@gmail.com>

* refactor: Rename `next_` to `next_item` (#7104)

* ci(pre-commit): Add `flake8` plugin `flake8-bugbear` (#7127)

* refactor: Follow `flake8-bugbear` plugin (#7127)

* fix: Correct `knapsack` code (#7127)

* [pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

Co-authored-by: Christian Clauss <cclauss@me.com>
Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
Co-authored-by: Dhruv Manilawala <dhruvmanila@gmail.com>
This commit is contained in:
Caeden
2022-10-13 17:03:06 +01:00
committed by GitHub
parent f176786d12
commit 4d0c830d2c
71 changed files with 137 additions and 124 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
data_structures/binary_tree/binary_search_tree_recursive.py
View File

@@ -357,7 +357,7 @@ class BinarySearchTreeTest(unittest.TestCase):
assert t.root.left.left.parent == t.root.left
assert t.root.left.left.label == 1
with self.assertRaises(Exception):
with self.assertRaises(Exception): # noqa: B017
t.put(1)
def test_search(self) -> None:
@@ -369,7 +369,7 @@ class BinarySearchTreeTest(unittest.TestCase):
node = t.search(13)
assert node.label == 13
with self.assertRaises(Exception):
with self.assertRaises(Exception): # noqa: B017
t.search(2)
def test_remove(self) -> None:
@@ -515,7 +515,7 @@ class BinarySearchTreeTest(unittest.TestCase):
assert t.get_max_label() == 14
t.empty()
with self.assertRaises(Exception):
with self.assertRaises(Exception): # noqa: B017
t.get_max_label()
def test_get_min_label(self) -> None:
@@ -524,7 +524,7 @@ class BinarySearchTreeTest(unittest.TestCase):
assert t.get_min_label() == 1
t.empty()
with self.assertRaises(Exception):
with self.assertRaises(Exception): # noqa: B017
t.get_min_label()
def test_inorder_traversal(self) -> None:

8
data_structures/linked_list/circular_linked_list.py
View File

@@ -94,25 +94,25 @@ def test_circular_linked_list() -> None:
try:
circular_linked_list.delete_front()
assert False # This should not happen
raise AssertionError() # This should not happen
except IndexError:
assert True # This should happen
try:
circular_linked_list.delete_tail()
assert False # This should not happen
raise AssertionError() # This should not happen
except IndexError:
assert True # This should happen
try:
circular_linked_list.delete_nth(-1)
assert False
raise AssertionError()
except IndexError:
assert True
try:
circular_linked_list.delete_nth(0)
assert False
raise AssertionError()
except IndexError:
assert True

8
data_structures/linked_list/doubly_linked_list.py
View File

@@ -96,7 +96,7 @@ class DoublyLinkedList:
self.tail = new_node
else:
temp = self.head
for i in range(0, index):
for _ in range(0, index):
temp = temp.next
temp.previous.next = new_node
new_node.previous = temp.previous
@@ -145,7 +145,7 @@ class DoublyLinkedList:
self.tail.next = None
else:
temp = self.head
for i in range(0, index):
for _ in range(0, index):
temp = temp.next
delete_node = temp
temp.next.previous = temp.previous
@@ -194,13 +194,13 @@ def test_doubly_linked_list() -> None:
try:
linked_list.delete_head()
assert False # This should not happen.
raise AssertionError() # This should not happen.
except IndexError:
assert True # This should happen.
try:
linked_list.delete_tail()
assert False # This should not happen.
raise AssertionError() # This should not happen.
except IndexError:
assert True # This should happen.

2
data_structures/linked_list/middle_element_of_linked_list.py
View File

@@ -62,7 +62,7 @@ class LinkedList:
if __name__ == "__main__":
link = LinkedList()
for i in range(int(input().strip())):
for _ in range(int(input().strip())):
data = int(input().strip())
link.push(data)
print(link.middle_element())

6
data_structures/linked_list/singly_linked_list.py
View File

@@ -132,7 +132,7 @@ class LinkedList:
if not 0 <= index < len(self):
raise ValueError("list index out of range.")
current = self.head
for i in range(index):
for _ in range(index):
current = current.next
current.data = data
@@ -352,13 +352,13 @@ def test_singly_linked_list() -> None:
try:
linked_list.delete_head()
assert False # This should not happen.
raise AssertionError() # This should not happen.
except IndexError:
assert True # This should happen.
try:
linked_list.delete_tail()
assert False # This should not happen.
raise AssertionError() # This should not happen.
except IndexError:
assert True # This should happen.

4
data_structures/linked_list/skip_list.py
View File

@@ -205,7 +205,7 @@ class SkipList(Generic[KT, VT]):
if level > self.level:
# After level increase we have to add additional nodes to head.
for i in range(self.level - 1, level):
for _ in range(self.level - 1, level):
update_vector.append(self.head)
self.level = level
@@ -407,7 +407,7 @@ def test_iter_always_yields_sorted_values():
def pytests():
for i in range(100):
for _ in range(100):
# Repeat test 100 times due to the probabilistic nature of skip list
# random values == random bugs
test_insert()

2
data_structures/queue/queue_on_list.py
View File

@@ -37,7 +37,7 @@ class Queue:
number of times to rotate queue"""
def rotate(self, rotation):
for i in range(rotation):
for _ in range(rotation):
self.put(self.get())
"""Enqueues {@code item}

2
data_structures/queue/queue_on_pseudo_stack.py
View File

@@ -37,7 +37,7 @@ class Queue:
number of times to rotate queue"""
def rotate(self, rotation: int) -> None:
for i in range(rotation):
for _ in range(rotation):
temp = self.stack[0]
self.stack = self.stack[1:]
self.put(temp)

6
data_structures/stacks/stack.py
View File

@@ -92,13 +92,13 @@ def test_stack() -> None:
try:
_ = stack.pop()
assert False # This should not happen
raise AssertionError() # This should not happen
except StackUnderflowError:
assert True # This should happen
try:
_ = stack.peek()
assert False # This should not happen
raise AssertionError() # This should not happen
except StackUnderflowError:
assert True # This should happen
@@ -118,7 +118,7 @@ def test_stack() -> None:
try:
stack.push(200)
assert False # This should not happen
raise AssertionError() # This should not happen
except StackOverflowError:
assert True # This should happen