Skip to content

Commit ae1f7bc

Browse files
CaedenPHCaedenPH
committed
feat: Apply __repr__ changes
1 parent d3b1f15 commit ae1f7bc

File tree

5 files changed

+62
-62
lines changed

5 files changed

+62
-62
lines changed

‎boolean_algebra/quine_mc_cluskey.py

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -37,10 +37,10 @@ def check(binary: list[str]) -> list[str]:
3737
for i in range(len(binary)):
3838
for j in range(i + 1, len(binary)):
3939
k = compare_string(binary[i], binary[j])
40-
if k != "X":
40+
if k is False:
4141
check1[i] = "*"
4242
check1[j] = "*"
43-
temp.append(k)
43+
temp.append("X")
4444
for i in range(len(binary)):
4545
if check1[i] == "$":
4646
pi.append(binary[i])

‎computer_vision/harris_corner.py

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -22,7 +22,7 @@ def __init__(self, k: float, window_size: int):
2222
raise ValueError("invalid k value")
2323

2424
def __str__(self) -> str:
25-
return self.k
25+
return str(self.k)
2626

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

‎data_structures/binary_tree/segment_tree_other.py

Lines changed: 54 additions & 54 deletions
Original file line numberDiff line numberDiff line change
@@ -27,29 +27,29 @@ class SegmentTree:
2727
>>> for node in num_arr.traverse():
2828
... print(node)
2929
...
30-
<val=15 start=0 end=4>
31-
<val=8 start=0 end=2>
32-
<val=7 start=3 end=4>
33-
<val=3 start=0 end=1>
34-
<val=5 start=2 end=2>
35-
<val=3 start=3 end=3>
36-
<val=4 start=4 end=4>
37-
<val=2 start=0 end=0>
38-
<val=1 start=1 end=1>
30+
SegmentTreeNode(start=0, end=4, val=15)
31+
SegmentTreeNode(start=0, end=2, val=8)
32+
SegmentTreeNode(start=3, end=4, val=7)
33+
SegmentTreeNode(start=0, end=1, val=3)
34+
SegmentTreeNode(start=2, end=2, val=5)
35+
SegmentTreeNode(start=3, end=3, val=3)
36+
SegmentTreeNode(start=4, end=4, val=4)
37+
SegmentTreeNode(start=0, end=0, val=2)
38+
SegmentTreeNode(start=1, end=1, val=1)
3939
>>>
4040
>>> num_arr.update(1, 5)
4141
>>> for node in num_arr.traverse():
4242
... print(node)
4343
...
44-
<val=19 start=0 end=4>
45-
<val=12 start=0 end=2>
46-
<val=7 start=3 end=4>
47-
<val=7 start=0 end=1>
48-
<val=5 start=2 end=2>
49-
<val=3 start=3 end=3>
50-
<val=4 start=4 end=4>
51-
<val=2 start=0 end=0>
52-
<val=5 start=1 end=1>
44+
SegmentTreeNode(start=0, end=4, val=19)
45+
SegmentTreeNode(start=0, end=2, val=12)
46+
SegmentTreeNode(start=3, end=4, val=7)
47+
SegmentTreeNode(start=0, end=1, val=7)
48+
SegmentTreeNode(start=2, end=2, val=5)
49+
SegmentTreeNode(start=3, end=3, val=3)
50+
SegmentTreeNode(start=4, end=4, val=4)
51+
SegmentTreeNode(start=0, end=0, val=2)
52+
SegmentTreeNode(start=1, end=1, val=5)
5353
>>>
5454
>>> num_arr.query_range(3, 4)
5555
7
@@ -62,29 +62,29 @@ class SegmentTree:
6262
>>> for node in max_arr.traverse():
6363
... print(node)
6464
...
65-
<val=5 start=0 end=4>
66-
<val=5 start=0 end=2>
67-
<val=4 start=3 end=4>
68-
<val=2 start=0 end=1>
69-
<val=5 start=2 end=2>
70-
<val=3 start=3 end=3>
71-
<val=4 start=4 end=4>
72-
<val=2 start=0 end=0>
73-
<val=1 start=1 end=1>
65+
SegmentTreeNode(start=0, end=4, val=5)
66+
SegmentTreeNode(start=0, end=2, val=5)
67+
SegmentTreeNode(start=3, end=4, val=4)
68+
SegmentTreeNode(start=0, end=1, val=2)
69+
SegmentTreeNode(start=2, end=2, val=5)
70+
SegmentTreeNode(start=3, end=3, val=3)
71+
SegmentTreeNode(start=4, end=4, val=4)
72+
SegmentTreeNode(start=0, end=0, val=2)
73+
SegmentTreeNode(start=1, end=1, val=1)
7474
>>>
7575
>>> max_arr.update(1, 5)
7676
>>> for node in max_arr.traverse():
7777
... print(node)
7878
...
79-
<val=5 start=0 end=4>
80-
<val=5 start=0 end=2>
81-
<val=4 start=3 end=4>
82-
<val=5 start=0 end=1>
83-
<val=5 start=2 end=2>
84-
<val=3 start=3 end=3>
85-
<val=4 start=4 end=4>
86-
<val=2 start=0 end=0>
87-
<val=5 start=1 end=1>
79+
SegmentTreeNode(start=0, end=4, val=5)
80+
SegmentTreeNode(start=0, end=2, val=5)
81+
SegmentTreeNode(start=3, end=4, val=4)
82+
SegmentTreeNode(start=0, end=1, val=5)
83+
SegmentTreeNode(start=2, end=2, val=5)
84+
SegmentTreeNode(start=3, end=3, val=3)
85+
SegmentTreeNode(start=4, end=4, val=4)
86+
SegmentTreeNode(start=0, end=0, val=2)
87+
SegmentTreeNode(start=1, end=1, val=5)
8888
>>>
8989
>>> max_arr.query_range(3, 4)
9090
4
@@ -97,29 +97,29 @@ class SegmentTree:
9797
>>> for node in min_arr.traverse():
9898
... print(node)
9999
...
100-
<val=1 start=0 end=4>
101-
<val=1 start=0 end=2>
102-
<val=3 start=3 end=4>
103-
<val=1 start=0 end=1>
104-
<val=5 start=2 end=2>
105-
<val=3 start=3 end=3>
106-
<val=4 start=4 end=4>
107-
<val=2 start=0 end=0>
108-
<val=1 start=1 end=1>
100+
SegmentTreeNode(start=0, end=4, val=1)
101+
SegmentTreeNode(start=0, end=2, val=1)
102+
SegmentTreeNode(start=3, end=4, val=3)
103+
SegmentTreeNode(start=0, end=1, val=1)
104+
SegmentTreeNode(start=2, end=2, val=5)
105+
SegmentTreeNode(start=3, end=3, val=3)
106+
SegmentTreeNode(start=4, end=4, val=4)
107+
SegmentTreeNode(start=0, end=0, val=2)
108+
SegmentTreeNode(start=1, end=1, val=1)
109109
>>>
110110
>>> min_arr.update(1, 5)
111111
>>> for node in min_arr.traverse():
112112
... print(node)
113113
...
114-
<val=2 start=0 end=4>
115-
<val=2 start=0 end=2>
116-
<val=3 start=3 end=4>
117-
<val=2 start=0 end=1>
118-
<val=5 start=2 end=2>
119-
<val=3 start=3 end=3>
120-
<val=4 start=4 end=4>
121-
<val=2 start=0 end=0>
122-
<val=5 start=1 end=1>
114+
SegmentTreeNode(start=0, end=4, val=2)
115+
SegmentTreeNode(start=0, end=2, val=2)
116+
SegmentTreeNode(start=3, end=4, val=3)
117+
SegmentTreeNode(start=0, end=1, val=2)
118+
SegmentTreeNode(start=2, end=2, val=5)
119+
SegmentTreeNode(start=3, end=3, val=3)
120+
SegmentTreeNode(start=4, end=4, val=4)
121+
SegmentTreeNode(start=0, end=0, val=2)
122+
SegmentTreeNode(start=1, end=1, val=5)
123123
>>>
124124
>>> min_arr.query_range(3, 4)
125125
3

‎data_structures/binary_tree/wavelet_tree.py

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -24,11 +24,11 @@ def __repr__(self) -> str:
2424
"""
2525
>>> node = Node(length=27)
2626
>>> repr(node)
27-
'<min_value=-1 max_value=-1>'
27+
'Node(min_value=-1 max_value=-1)'
2828
>>> repr(node) == str(node)
2929
True
3030
"""
31-
return f"<min_value={self.minn} max_value={self.maxx}>"
31+
return f"Node(min_value={self.minn} max_value={self.maxx})"
3232

3333

3434
def build_tree(arr: list[int]) -> Node | None:
@@ -37,7 +37,7 @@ def build_tree(arr: list[int]) -> Node | None:
3737
of the constructed tree
3838
3939
>>> build_tree(test_array)
40-
<min_value=0 max_value=9>
40+
Node(min_value=0 max_value=9)
4141
"""
4242
root = Node(len(arr))
4343
root.minn, root.maxx = min(arr), max(arr)

‎matrix/cramers_rule_2x2.py

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22
# https://en.wikipedia.org/wiki/Cramer%27s_rule
33

44

5-
def cramers_rule_2x2(equation1: list[int], equation2: list[int]) -> tuple[float]:
5+
def cramers_rule_2x2(equation1: list[int], equation2: list[int]) -> tuple[float, float]:
66
"""
77
Solves the system of linear equation in 2 variables.
88
:param: equation1: list of 3 numbers
@@ -76,7 +76,7 @@ def cramers_rule_2x2(equation1: list[int], equation2: list[int]) -> tuple[float]
7676
else:
7777
if determinant_x == determinant_y == 0:
7878
# Trivial solution (Inconsistent system)
79-
return (0, 0)
79+
return (0.0, 0.0)
8080
else:
8181
x = determinant_x / determinant
8282
y = determinant_y / determinant

0 commit comments

Comments
 (0)