mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-01-31 06:33:44 +00:00
Code Issues Packages Projects Releases Wiki Activity

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

Browse Source 
for more information, see https://pre-commit.ci
This commit is contained in:
pre-commit-ci[bot] 2024-12-03 23:58:25 +00:00
parent eb16b2dfc4
commit 4cf6dbf9a4
4 changed files with 6 additions and 12 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
digital_image_processing/filters/gabor_filter.py
View File

@ -48,9 +48,9 @@ def gabor_filter_kernel(
_y = -sin_theta * px + cos_theta * py _y = -sin_theta * px + cos_theta * py
# fill kernel # fill kernel
gabor[y, x] = np.exp( gabor[y, x] = np.exp(-(_x**2 + gamma**2 * _y**2) / (2 * sigma**2)) * np.cos(
-(_x**2 + gamma**2 * _y**2) / (2 * sigma**2) 2 * np.pi * _x / lambd + psi
) * np.cos(2 * np.pi * _x / lambd + psi) )
return gabor return gabor

4
machine_learning/frequent_pattern_growth.py
View File

@ -240,9 +240,7 @@ def ascend_tree(leaf_node: TreeNode, prefix_path: list[str]) -> None:
ascend_tree(leaf_node.parent, prefix_path) ascend_tree(leaf_node.parent, prefix_path)
def find_prefix_path( def find_prefix_path(base_pat: frozenset, tree_node: TreeNode | None) -> dict: # noqa: ARG001
base_pat: frozenset, tree_node: TreeNode | None
) -> dict: # noqa: ARG001
""" """
Find the conditional pattern base for a given base pattern. Find the conditional pattern base for a given base pattern.

4
sorts/bead_sort.py
View File

@ -31,9 +31,7 @@ def bead_sort(sequence: list) -> list:
if any(not isinstance(x, int) or x < 0 for x in sequence): if any(not isinstance(x, int) or x < 0 for x in sequence):
raise TypeError("Sequence must be list of non-negative integers") raise TypeError("Sequence must be list of non-negative integers")
for _ in range(len(sequence)): for _ in range(len(sequence)):
for i, (rod_upper, rod_lower) in enumerate( for i, (rod_upper, rod_lower) in enumerate(zip(sequence, sequence[1:])): # noqa: RUF007
zip(sequence, sequence[1:])
): # noqa: RUF007
if rod_upper > rod_lower: if rod_upper > rod_lower:
sequence[i] -= rod_upper - rod_lower sequence[i] -= rod_upper - rod_lower
sequence[i + 1] += rod_upper - rod_lower sequence[i + 1] += rod_upper - rod_lower

4
strings/min_cost_string_conversion.py
View File

@ -132,9 +132,7 @@ if __name__ == "__main__":
elif op[0] == "R": elif op[0] == "R":
string[i] = op[2] string[i] = op[2]
file.write( file.write("%-16s" % ("Replace %c" % op[1] + " with " + str(op[2]))) # noqa: UP031
"%-16s" % ("Replace %c" % op[1] + " with " + str(op[2]))
) # noqa: UP031
file.write("\t\t" + "".join(string)) file.write("\t\t" + "".join(string))
file.write("\r\n") file.write("\r\n")