Skip to content

Raise error not string #7945

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 15 commits into from
Nov 6, 2022
Merged

Raise error not string #7945

Show file tree
Hide file tree
Changes from 1 commit
Commits
Show all changes
15 commits
Select commit Hold shift + click to select a range
5be2a1f
ci: Add `B023` to `.flake8` ignores
CaedenPH Nov 1, 2022
644e9ca
Merge branch 'TheAlgorithms:master' into master
CaedenPH Nov 2, 2022
8cebc9f
refactor: Return `bool`/raise Exception
CaedenPH Nov 2, 2022
5d0cafa
[pre-commit.ci] auto fixes from pre-commit.com hooks
pre-commit-ci[bot] Nov 2, 2022
982f458
revert: Remove previous branch commit
CaedenPH Nov 2, 2022
9857297
Merge branch 'raise-error-not-string' of https://github.com/caedenph/…
CaedenPH Nov 2, 2022
d3b1f15
Update data_structures/binary_tree/segment_tree_other.py
CaedenPH Nov 2, 2022
ae1f7bc
feat: Apply `__repr__` changes
CaedenPH Nov 2, 2022
5f347e9
chore: Fix failing tests
CaedenPH Nov 2, 2022
34a1d64
[pre-commit.ci] auto fixes from pre-commit.com hooks
pre-commit-ci[bot] Nov 2, 2022
7025252
Update data_structures/binary_tree/segment_tree_other.py
CaedenPH Nov 2, 2022
62a5a4f
Merge branch 'master' into raise-error-not-string
CaedenPH Nov 6, 2022
53a9259
test: Fix doctests
CaedenPH Nov 6, 2022
5b18251
random.choice(population_score[:N_SELECTED])[0]
cclauss Nov 6, 2022
8cab3eb
Update basic_string.py
cclauss Nov 6, 2022
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions boolean_algebra/quine_mc_cluskey.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -37,10 +37,10 @@ def check(binary: list[str]) -> list[str]:
for i in range(len(binary)):
for j in range(i + 1, len(binary)):
k = compare_string(binary[i], binary[j])
if k != "X":
if k is False:
check1[i] = "*"
check1[j] = "*"
temp.append(k)
temp.append("X")
for i in range(len(binary)):
if check1[i] == "$":
pi.append(binary[i])
Expand Down
2 changes: 1 addition & 1 deletion computer_vision/harris_corner.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -22,7 +22,7 @@ def __init__(self, k: float, window_size: int):
raise ValueError("invalid k value")

def __str__(self) -> str:
return self.k
return str(self.k)

def detect(self, img_path: str) -> tuple[cv2.Mat, list[list[int]]]:

Expand Down
108 changes: 54 additions & 54 deletions data_structures/binary_tree/segment_tree_other.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -27,29 +27,29 @@ class SegmentTree:
>>> for node in num_arr.traverse():
... print(node)
...
<val=15 start=0 end=4>
<val=8 start=0 end=2>
<val=7 start=3 end=4>
<val=3 start=0 end=1>
<val=5 start=2 end=2>
<val=3 start=3 end=3>
<val=4 start=4 end=4>
<val=2 start=0 end=0>
<val=1 start=1 end=1>
SegmentTreeNode(start=0, end=4, val=15)
SegmentTreeNode(start=0, end=2, val=8)
SegmentTreeNode(start=3, end=4, val=7)
SegmentTreeNode(start=0, end=1, val=3)
SegmentTreeNode(start=2, end=2, val=5)
SegmentTreeNode(start=3, end=3, val=3)
SegmentTreeNode(start=4, end=4, val=4)
SegmentTreeNode(start=0, end=0, val=2)
SegmentTreeNode(start=1, end=1, val=1)
>>>
>>> num_arr.update(1, 5)
>>> for node in num_arr.traverse():
... print(node)
...
<val=19 start=0 end=4>
<val=12 start=0 end=2>
<val=7 start=3 end=4>
<val=7 start=0 end=1>
<val=5 start=2 end=2>
<val=3 start=3 end=3>
<val=4 start=4 end=4>
<val=2 start=0 end=0>
<val=5 start=1 end=1>
SegmentTreeNode(start=0, end=4, val=19)
SegmentTreeNode(start=0, end=2, val=12)
SegmentTreeNode(start=3, end=4, val=7)
SegmentTreeNode(start=0, end=1, val=7)
SegmentTreeNode(start=2, end=2, val=5)
SegmentTreeNode(start=3, end=3, val=3)
SegmentTreeNode(start=4, end=4, val=4)
SegmentTreeNode(start=0, end=0, val=2)
SegmentTreeNode(start=1, end=1, val=5)
>>>
>>> num_arr.query_range(3, 4)
7
Expand All @@ -62,29 +62,29 @@ class SegmentTree:
>>> for node in max_arr.traverse():
... print(node)
...
<val=5 start=0 end=4>
<val=5 start=0 end=2>
<val=4 start=3 end=4>
<val=2 start=0 end=1>
<val=5 start=2 end=2>
<val=3 start=3 end=3>
<val=4 start=4 end=4>
<val=2 start=0 end=0>
<val=1 start=1 end=1>
SegmentTreeNode(start=0, end=4, val=5)
SegmentTreeNode(start=0, end=2, val=5)
SegmentTreeNode(start=3, end=4, val=4)
SegmentTreeNode(start=0, end=1, val=2)
SegmentTreeNode(start=2, end=2, val=5)
SegmentTreeNode(start=3, end=3, val=3)
SegmentTreeNode(start=4, end=4, val=4)
SegmentTreeNode(start=0, end=0, val=2)
SegmentTreeNode(start=1, end=1, val=1)
>>>
>>> max_arr.update(1, 5)
>>> for node in max_arr.traverse():
... print(node)
...
<val=5 start=0 end=4>
<val=5 start=0 end=2>
<val=4 start=3 end=4>
<val=5 start=0 end=1>
<val=5 start=2 end=2>
<val=3 start=3 end=3>
<val=4 start=4 end=4>
<val=2 start=0 end=0>
<val=5 start=1 end=1>
SegmentTreeNode(start=0, end=4, val=5)
SegmentTreeNode(start=0, end=2, val=5)
SegmentTreeNode(start=3, end=4, val=4)
SegmentTreeNode(start=0, end=1, val=5)
SegmentTreeNode(start=2, end=2, val=5)
SegmentTreeNode(start=3, end=3, val=3)
SegmentTreeNode(start=4, end=4, val=4)
SegmentTreeNode(start=0, end=0, val=2)
SegmentTreeNode(start=1, end=1, val=5)
>>>
>>> max_arr.query_range(3, 4)
4
Expand All @@ -97,29 +97,29 @@ class SegmentTree:
>>> for node in min_arr.traverse():
... print(node)
...
<val=1 start=0 end=4>
<val=1 start=0 end=2>
<val=3 start=3 end=4>
<val=1 start=0 end=1>
<val=5 start=2 end=2>
<val=3 start=3 end=3>
<val=4 start=4 end=4>
<val=2 start=0 end=0>
<val=1 start=1 end=1>
SegmentTreeNode(start=0, end=4, val=1)
SegmentTreeNode(start=0, end=2, val=1)
SegmentTreeNode(start=3, end=4, val=3)
SegmentTreeNode(start=0, end=1, val=1)
SegmentTreeNode(start=2, end=2, val=5)
SegmentTreeNode(start=3, end=3, val=3)
SegmentTreeNode(start=4, end=4, val=4)
SegmentTreeNode(start=0, end=0, val=2)
SegmentTreeNode(start=1, end=1, val=1)
>>>
>>> min_arr.update(1, 5)
>>> for node in min_arr.traverse():
... print(node)
...
<val=2 start=0 end=4>
<val=2 start=0 end=2>
<val=3 start=3 end=4>
<val=2 start=0 end=1>
<val=5 start=2 end=2>
<val=3 start=3 end=3>
<val=4 start=4 end=4>
<val=2 start=0 end=0>
<val=5 start=1 end=1>
SegmentTreeNode(start=0, end=4, val=2)
SegmentTreeNode(start=0, end=2, val=2)
SegmentTreeNode(start=3, end=4, val=3)
SegmentTreeNode(start=0, end=1, val=2)
SegmentTreeNode(start=2, end=2, val=5)
SegmentTreeNode(start=3, end=3, val=3)
SegmentTreeNode(start=4, end=4, val=4)
SegmentTreeNode(start=0, end=0, val=2)
SegmentTreeNode(start=1, end=1, val=5)
>>>
>>> min_arr.query_range(3, 4)
3
Expand Down
6 changes: 3 additions & 3 deletions data_structures/binary_tree/wavelet_tree.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -24,11 +24,11 @@ def __repr__(self) -> str:
"""
>>> node = Node(length=27)
>>> repr(node)
'<min_value=-1 max_value=-1>'
'Node(min_value=-1 max_value=-1)'
>>> repr(node) == str(node)
True
"""
return f"<min_value={self.minn} max_value={self.maxx}>"
return f"Node(min_value={self.minn} max_value={self.maxx})"


def build_tree(arr: list[int]) -> Node | None:
Expand All @@ -37,7 +37,7 @@ def build_tree(arr: list[int]) -> Node | None:
of the constructed tree

>>> build_tree(test_array)
<min_value=0 max_value=9>
Node(min_value=0 max_value=9)
"""
root = Node(len(arr))
root.minn, root.maxx = min(arr), max(arr)
Expand Down
4 changes: 2 additions & 2 deletions matrix/cramers_rule_2x2.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,7 @@
# https://en.wikipedia.org/wiki/Cramer%27s_rule


def cramers_rule_2x2(equation1: list[int], equation2: list[int]) -> tuple[float]:
def cramers_rule_2x2(equation1: list[int], equation2: list[int]) -> tuple[float, float]:
"""
Solves the system of linear equation in 2 variables.
:param: equation1: list of 3 numbers
Expand Down Expand Up @@ -76,7 +76,7 @@ def cramers_rule_2x2(equation1: list[int], equation2: list[int]) -> tuple[float]
else:
if determinant_x == determinant_y == 0:
# Trivial solution (Inconsistent system)
return (0, 0)
return (0.0, 0.0)
else:
x = determinant_x / determinant
y = determinant_y / determinant
Expand Down