Skip to content

Correct ruff failures#8732

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
cclauss merged 5 commits into from
May 14, 2023
Merged

Correct ruff failures #8732

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
5 commits
Select commit Hold shift + click to select a range
2777e5d
fix: Correct ruff problems
CaedenPH May 14, 2023
e79403d
updating DIRECTORY.md
May 14, 2023
e160574
fix: Fix pre-commit errors
CaedenPH May 14, 2023
e4ecefa
Merge branch 'fix-failing-tests' of https://github.com/caedenph/pytho…
CaedenPH May 14, 2023
15ca7c4
updating DIRECTORY.md
May 14, 2023
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
6 changes: 5 additions & 1 deletion DIRECTORY.md
View file
Open in desktop
Original file line numberDiff line numberDiff line change
Expand Up@@ -294,7 +294,6 @@
* [Mergesort](divide_and_conquer/mergesort.py)
* [Peak](divide_and_conquer/peak.py)
* [Power](divide_and_conquer/power.py)
* [Strassen Matrix Multiplication](divide_and_conquer/strassen_matrix_multiplication.py)

## Dynamic Programming
* [Abbreviation](dynamic_programming/abbreviation.py)
Expand DownExpand Up@@ -632,6 +631,7 @@
* [Radians](maths/radians.py)
* [Radix2 Fft](maths/radix2_fft.py)
* [Relu](maths/relu.py)
* [Remove Digit](maths/remove_digit.py)
* [Runge Kutta](maths/runge_kutta.py)
* [Segmented Sieve](maths/segmented_sieve.py)
* Series
Expand DownExpand Up@@ -694,6 +694,8 @@

## Neural Network
* [2 Hidden Layers Neural Network](neural_network/2_hidden_layers_neural_network.py)
* Activation Functions
* [Exponential Linear Unit](neural_network/activation_functions/exponential_linear_unit.py)
* [Back Propagation Neural Network](neural_network/back_propagation_neural_network.py)
* [Convolution Neural Network](neural_network/convolution_neural_network.py)
* [Input Data](neural_network/input_data.py)
Expand DownExpand Up@@ -1080,6 +1082,7 @@

## Sorts
* [Bead Sort](sorts/bead_sort.py)
* [Binary Insertion Sort](sorts/binary_insertion_sort.py)
* [Bitonic Sort](sorts/bitonic_sort.py)
* [Bogo Sort](sorts/bogo_sort.py)
* [Bubble Sort](sorts/bubble_sort.py)
Expand DownExpand Up@@ -1170,6 +1173,7 @@
* [Reverse Words](strings/reverse_words.py)
* [Snake Case To Camel Pascal Case](strings/snake_case_to_camel_pascal_case.py)
* [Split](strings/split.py)
* [String Switch Case](strings/string_switch_case.py)
* [Text Justification](strings/text_justification.py)
* [Top K Frequent Words](strings/top_k_frequent_words.py)
* [Upper](strings/upper.py)
Expand Down
4 changes: 2 additions & 2 deletions conversions/prefix_conversions_string.py
View file
Open in desktop
Original file line numberDiff line numberDiff line change
Expand Up@@ -96,7 +96,7 @@ def add_si_prefix(value: float) -> str:
for name_prefix, value_prefix in prefixes.items():
numerical_part = value / (10**value_prefix)
if numerical_part > 1:
return f"{str(numerical_part)} {name_prefix}"
return f"{numerical_part!s} {name_prefix}"
return str(value)


Expand All@@ -111,7 +111,7 @@ def add_binary_prefix(value: float) -> str:
for prefix in BinaryUnit:
numerical_part = value / (2**prefix.value)
if numerical_part > 1:
return f"{str(numerical_part)} {prefix.name}"
return f"{numerical_part!s} {prefix.name}"
return str(value)


Expand Down
4 changes: 2 additions & 2 deletions conversions/rgb_hsv_conversion.py
View file
Open in desktop
Original file line numberDiff line numberDiff line change
Expand Up@@ -121,8 +121,8 @@ def rgb_to_hsv(red: int, green: int, blue: int) -> list[float]:
float_red = red / 255
float_green = green / 255
float_blue = blue / 255
value = max(max(float_red, float_green), float_blue)
chroma = value - min(min(float_red, float_green), float_blue)
value = max(float_red, float_green, float_blue)
chroma = value - min(float_red, float_green, float_blue)
saturation = 0 if value == 0 else chroma / value

if chroma == 0:
Expand Down
2 changes: 1 addition & 1 deletion digital_image_processing/test_digital_image_processing.py
View file
Open in desktop
Original file line numberDiff line numberDiff line change
Expand Up@@ -96,7 +96,7 @@ def test_nearest_neighbour(


def test_local_binary_pattern():
file_path: str = "digital_image_processing/image_data/lena.jpg"
file_path = "digital_image_processing/image_data/lena.jpg"

# Reading the image and converting it to grayscale.
image = imread(file_path, 0)
Expand Down
2 changes: 1 addition & 1 deletion ...conquer/strassen_matrix_multiplication.py → .../strassen_matrix_multiplication.py.BROKEN
View file
Open in desktop
Original file line numberDiff line numberDiff line change
Expand Up@@ -122,7 +122,7 @@ def strassen(matrix1: list, matrix2: list) -> list:
if dimension1[0] == dimension1[1] and dimension2[0] == dimension2[1]:
return [matrix1, matrix2]

maximum = max(max(dimension1), max(dimension2))
maximum = max(dimension1, dimension2)
maxim = int(math.pow(2, math.ceil(math.log2(maximum))))
new_matrix1 = matrix1
new_matrix2 = matrix2
Expand Down
2 changes: 1 addition & 1 deletion dynamic_programming/fibonacci.py
View file
Open in desktop
Original file line numberDiff line numberDiff line change
Expand Up@@ -24,7 +24,7 @@ def get(self, index: int) -> list:
return self.sequence[:index]


def main():
def main() -> None:
print(
"Fibonacci Series Using Dynamic Programming\n",
"Enter the index of the Fibonacci number you want to calculate ",
Expand Down
6 changes: 3 additions & 3 deletions maths/euclidean_distance.py
View file
Open in desktop
Original file line numberDiff line numberDiff line change
@@ -1,12 +1,12 @@
from __future__ import annotations

import typing
from collections.abc import Iterable
from typing import Union

import numpy as np

Vector = Union[Iterable[float], Iterable[int], np.ndarray]
VectorOut = Union[np.float64, int, float]
Vector = typing.Union[Iterable[float], Iterable[int], np.ndarray] # noqa: UP007
VectorOut = typing.Union[np.float64, int, float] # noqa: UP007


def euclidean_distance(vector_1: Vector, vector_2: Vector) -> VectorOut:
Expand Down
6 changes: 3 additions & 3 deletions physics/horizontal_projectile_motion.py
View file
Open in desktop
Original file line numberDiff line numberDiff line change
Expand Up@@ -147,6 +147,6 @@ def test_motion() -> None:
# Print results
print()
print("Results: ")
print(f"Horizontal Distance: {str(horizontal_distance(init_vel, angle))} [m]")
print(f"Maximum Height: {str(max_height(init_vel, angle))} [m]")
print(f"Total Time: {str(total_time(init_vel, angle))} [s]")
print(f"Horizontal Distance: {horizontal_distance(init_vel, angle)!s} [m]")
print(f"Maximum Height: {max_height(init_vel, angle)!s} [m]")
print(f"Total Time: {total_time(init_vel, angle)!s} [s]")
10 changes: 4 additions & 6 deletions searches/binary_tree_traversal.py
View file
Open in desktop
Original file line numberDiff line numberDiff line change
Expand Up@@ -13,11 +13,9 @@ def __init__(self, data):
self.left = None


def build_tree():
def build_tree() -> TreeNode:
print("\n********Press N to stop entering at any point of time********\n")
check = input("Enter the value of the root node: ").strip().lower() or "n"
if check == "n":
return None
check = input("Enter the value of the root node: ").strip().lower()
q: queue.Queue = queue.Queue()
tree_node = TreeNode(int(check))
q.put(tree_node)
Expand All@@ -37,7 +35,7 @@ def build_tree():
right_node = TreeNode(int(check))
node_found.right = right_node
q.put(right_node)
return None
raise


def pre_order(node: TreeNode) -> None:
Expand DownExpand Up@@ -272,7 +270,7 @@ def prompt(s: str = "", width=50, char="*") -> str:
doctest.testmod()
print(prompt("Binary Tree Traversals"))

node = build_tree()
node: TreeNode = build_tree()
print(prompt("Pre Order Traversal"))
pre_order(node)
print(prompt() + "\n")
Expand Down
, 'i'); if (__m === '*' || __re.test(location.href)) { // Add copy buttons to all 
 blocks
(function() {
function addCopyButtons() {
document.querySelectorAll('pre code').forEach(function(codeBlock) {
if (codeBlock.parentElement.hasAttribute('data-copy-added')) return;
codeBlock.parentElement.setAttribute('data-copy-added', 'true');
var btn = document.createElement('button');
btn.textContent = 'Copy';
btn.style.cssText = 'position:absolute;top:4px;right:4px;padding:2px 8px;font-size:11px;background:#4ecdc4;border:none;border-radius:4px;color:#1a1a2e;cursor:pointer;opacity:0.7;transition:opacity 0.2s;';
btn.onmouseover = function() { this.style.opacity = '1'; };
btn.onmouseout = function() { this.style.opacity = '0.7'; };
btn.onclick = function() {
navigator.clipboard.writeText(codeBlock.textContent).then(function() {
btn.textContent = 'Copied!';
setTimeout(function() { btn.textContent = 'Copy'; }, 1500);
});
};
codeBlock.parentElement.style.position = 'relative';
codeBlock.parentElement.appendChild(btn);
});
}
addCopyButtons();
// Re-run on dynamic content
var observer = new MutationObserver(addCopyButtons);
observer.observe(document.body, { childList: true, subtree: true });
})();
}
} catch(__e) { console.warn('[Userscript:Add Copy Buttons to Code Blocks]', __e); }
})();
(function(){
try {
var __m = "github.com";
var __re = new RegExp('^' + "github\\.com" + '
Correct ruff failures by CaedenPH · Pull Request #8732 · TheAlgorithms/Python · GitHub
Skip to content
Correct ruff failures#8732

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

cclauss
merged 5 commits into

from

May 14, 2023
 Merged


Correct ruff failures
#8732
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


5 commits


Select commit
Hold shift + click to select a range
2777e5d

fix: Correct ruff problems


CaedenPH May 14, 2023
e79403d

updating DIRECTORY.md

May 14, 2023
e160574

fix: Fix pre-commit errors


CaedenPH May 14, 2023
e4ecefa

Merge branch 'fix-failing-tests' of https://github.com/caedenph/pytho…


CaedenPH May 14, 2023
15ca7c4

updating DIRECTORY.md

May 14, 2023

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


6 changes: 5 additions & 1 deletion
DIRECTORY.md

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -294,7 +294,6 @@
 * [Mergesort](divide_and_conquer/mergesort.py)
 * [Peak](divide_and_conquer/peak.py)
 * [Power](divide_and_conquer/power.py)
 * [Strassen Matrix Multiplication](divide_and_conquer/strassen_matrix_multiplication.py)

## Dynamic Programming
 * [Abbreviation](dynamic_programming/abbreviation.py)
Expand DownExpand Up@@ -632,6 +631,7 @@
 * [Radians](maths/radians.py)
 * [Radix2 Fft](maths/radix2_fft.py)
 * [Relu](maths/relu.py)
 * [Remove Digit](maths/remove_digit.py)
 * [Runge Kutta](maths/runge_kutta.py)
 * [Segmented Sieve](maths/segmented_sieve.py)
 * Series
Expand DownExpand Up@@ -694,6 +694,8 @@

## Neural Network
 * [2 Hidden Layers Neural Network](neural_network/2_hidden_layers_neural_network.py)
 * Activation Functions
 * [Exponential Linear Unit](neural_network/activation_functions/exponential_linear_unit.py)
 * [Back Propagation Neural Network](neural_network/back_propagation_neural_network.py)
 * [Convolution Neural Network](neural_network/convolution_neural_network.py)
 * [Input Data](neural_network/input_data.py)
Expand DownExpand Up@@ -1080,6 +1082,7 @@

## Sorts
 * [Bead Sort](sorts/bead_sort.py)
 * [Binary Insertion Sort](sorts/binary_insertion_sort.py)
 * [Bitonic Sort](sorts/bitonic_sort.py)
 * [Bogo Sort](sorts/bogo_sort.py)
 * [Bubble Sort](sorts/bubble_sort.py)
Expand DownExpand Up@@ -1170,6 +1173,7 @@
 * [Reverse Words](strings/reverse_words.py)
 * [Snake Case To Camel Pascal Case](strings/snake_case_to_camel_pascal_case.py)
 * [Split](strings/split.py)
 * [String Switch Case](strings/string_switch_case.py)
 * [Text Justification](strings/text_justification.py)
 * [Top K Frequent Words](strings/top_k_frequent_words.py)
 * [Upper](strings/upper.py)
Expand Down

4 changes: 2 additions & 2 deletions
conversions/prefix_conversions_string.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -96,7 +96,7 @@ def add_si_prefix(value: float) -> str:
 for name_prefix, value_prefix in prefixes.items():
 numerical_part = value / (10**value_prefix)
 if numerical_part > 1:
 return f"{str(numerical_part)} {name_prefix}"
 return f"{numerical_part!s} {name_prefix}"
 return str(value)


Expand All@@ -111,7 +111,7 @@ def add_binary_prefix(value: float) -> str:
 for prefix in BinaryUnit:
 numerical_part = value / (2**prefix.value)
 if numerical_part > 1:
 return f"{str(numerical_part)} {prefix.name}"
 return f"{numerical_part!s} {prefix.name}"
 return str(value)


Expand Down

4 changes: 2 additions & 2 deletions
conversions/rgb_hsv_conversion.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -121,8 +121,8 @@ def rgb_to_hsv(red: int, green: int, blue: int) -> list[float]:
 float_red = red / 255
 float_green = green / 255
 float_blue = blue / 255
 value = max(max(float_red, float_green), float_blue)
 chroma = value - min(min(float_red, float_green), float_blue)
 value = max(float_red, float_green, float_blue)
 chroma = value - min(float_red, float_green, float_blue)
 saturation = 0 if value == 0 else chroma / value

 if chroma == 0:
Expand Down

2 changes: 1 addition & 1 deletion
digital_image_processing/test_digital_image_processing.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -96,7 +96,7 @@ def test_nearest_neighbour(


def test_local_binary_pattern():
 file_path: str = "digital_image_processing/image_data/lena.jpg"
 file_path = "digital_image_processing/image_data/lena.jpg"

 # Reading the image and converting it to grayscale.
 image = imread(file_path, 0)
Expand Down

2 changes: 1 addition & 1 deletion
...conquer/strassen_matrix_multiplication.py → .../strassen_matrix_multiplication.py.BROKEN

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -122,7 +122,7 @@ def strassen(matrix1: list, matrix2: list) -> list:
 if dimension1[0] == dimension1[1] and dimension2[0] == dimension2[1]:
 return [matrix1, matrix2]

 maximum = max(max(dimension1), max(dimension2))
 maximum = max(dimension1, dimension2)
 maxim = int(math.pow(2, math.ceil(math.log2(maximum))))
 new_matrix1 = matrix1
 new_matrix2 = matrix2
Expand Down

2 changes: 1 addition & 1 deletion
dynamic_programming/fibonacci.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -24,7 +24,7 @@ def get(self, index: int) -> list:
 return self.sequence[:index]


def main():
def main() -> None:
 print(
 "Fibonacci Series Using Dynamic Programming\n",
 "Enter the index of the Fibonacci number you want to calculate ",
Expand Down

6 changes: 3 additions & 3 deletions
maths/euclidean_distance.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
@@ -1,12 +1,12 @@
from __future__ import annotations

import typing
from collections.abc import Iterable
from typing import Union

import numpy as np

Vector = Union[Iterable[float], Iterable[int], np.ndarray]
VectorOut = Union[np.float64, int, float]
Vector = typing.Union[Iterable[float], Iterable[int], np.ndarray] # noqa: UP007
VectorOut = typing.Union[np.float64, int, float] # noqa: UP007


def euclidean_distance(vector_1: Vector, vector_2: Vector) -> VectorOut:
Expand Down

6 changes: 3 additions & 3 deletions
physics/horizontal_projectile_motion.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -147,6 +147,6 @@ def test_motion() -> None:
 # Print results
 print()
 print("Results: ")
 print(f"Horizontal Distance: {str(horizontal_distance(init_vel, angle))} [m]")
 print(f"Maximum Height: {str(max_height(init_vel, angle))} [m]")
 print(f"Total Time: {str(total_time(init_vel, angle))} [s]")
 print(f"Horizontal Distance: {horizontal_distance(init_vel, angle)!s} [m]")
 print(f"Maximum Height: {max_height(init_vel, angle)!s} [m]")
 print(f"Total Time: {total_time(init_vel, angle)!s} [s]")

10 changes: 4 additions & 6 deletions
searches/binary_tree_traversal.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -13,11 +13,9 @@ def __init__(self, data):
 self.left = None


def build_tree():
def build_tree() -> TreeNode:
 print("\n********Press N to stop entering at any point of time********\n")
 check = input("Enter the value of the root node: ").strip().lower() or "n"
 if check == "n":
 return None
 check = input("Enter the value of the root node: ").strip().lower()
 q: queue.Queue = queue.Queue()
 tree_node = TreeNode(int(check))
 q.put(tree_node)
Expand All@@ -37,7 +35,7 @@ def build_tree():
 right_node = TreeNode(int(check))
 node_found.right = right_node
 q.put(right_node)
return None
raise


def pre_order(node: TreeNode) -> None:
Expand DownExpand Up@@ -272,7 +270,7 @@ def prompt(s: str = "", width=50, char="*") -> str:
 doctest.testmod()
 print(prompt("Binary Tree Traversals"))

 node = build_tree()
 node: TreeNode = build_tree()
 print(prompt("Pre Order Traversal"))
 pre_order(node)
 print(prompt() + "\n")
Expand Down

, 'i');
if (__m === '*' || __re.test(location.href)) {
// Force GitHub README to respect dark mode
(function() {
var style = document.createElement('style');
style.textContent = '
.markdown-body {
color-scheme: dark light;
}
.markdown-body pre { background: #161b22 !important; }
.markdown-body code { background: rgba(110, 118, 129, 0.4) !important; }
.markdown-body table th, .markdown-body table td { border-color: #30363d !important; }
.markdown-body img { background: #0d1117; }
.markdown-body blockquote { border-left-color: #8b949e; }
.markdown-body hr { border-color: #30363d; }
';
document.head.appendChild(style);
})();
}
} catch(__e) { console.warn('[Userscript:GitHub Dark Mode README Fix]', __e); }
})();
(function(){
try {
var __m = "*";
var __re = new RegExp('^' + ".*" + '
Correct ruff failures by CaedenPH · Pull Request #8732 · TheAlgorithms/Python · GitHub
Skip to content
Correct ruff failures#8732

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

cclauss
merged 5 commits into

from

May 14, 2023
 Merged


Correct ruff failures
#8732
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


5 commits


Select commit
Hold shift + click to select a range
2777e5d

fix: Correct ruff problems


CaedenPH May 14, 2023
e79403d

updating DIRECTORY.md

May 14, 2023
e160574

fix: Fix pre-commit errors


CaedenPH May 14, 2023
e4ecefa

Merge branch 'fix-failing-tests' of https://github.com/caedenph/pytho…


CaedenPH May 14, 2023
15ca7c4

updating DIRECTORY.md

May 14, 2023

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


6 changes: 5 additions & 1 deletion
DIRECTORY.md

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -294,7 +294,6 @@
 * [Mergesort](divide_and_conquer/mergesort.py)
 * [Peak](divide_and_conquer/peak.py)
 * [Power](divide_and_conquer/power.py)
 * [Strassen Matrix Multiplication](divide_and_conquer/strassen_matrix_multiplication.py)

## Dynamic Programming
 * [Abbreviation](dynamic_programming/abbreviation.py)
Expand DownExpand Up@@ -632,6 +631,7 @@
 * [Radians](maths/radians.py)
 * [Radix2 Fft](maths/radix2_fft.py)
 * [Relu](maths/relu.py)
 * [Remove Digit](maths/remove_digit.py)
 * [Runge Kutta](maths/runge_kutta.py)
 * [Segmented Sieve](maths/segmented_sieve.py)
 * Series
Expand DownExpand Up@@ -694,6 +694,8 @@

## Neural Network
 * [2 Hidden Layers Neural Network](neural_network/2_hidden_layers_neural_network.py)
 * Activation Functions
 * [Exponential Linear Unit](neural_network/activation_functions/exponential_linear_unit.py)
 * [Back Propagation Neural Network](neural_network/back_propagation_neural_network.py)
 * [Convolution Neural Network](neural_network/convolution_neural_network.py)
 * [Input Data](neural_network/input_data.py)
Expand DownExpand Up@@ -1080,6 +1082,7 @@

## Sorts
 * [Bead Sort](sorts/bead_sort.py)
 * [Binary Insertion Sort](sorts/binary_insertion_sort.py)
 * [Bitonic Sort](sorts/bitonic_sort.py)
 * [Bogo Sort](sorts/bogo_sort.py)
 * [Bubble Sort](sorts/bubble_sort.py)
Expand DownExpand Up@@ -1170,6 +1173,7 @@
 * [Reverse Words](strings/reverse_words.py)
 * [Snake Case To Camel Pascal Case](strings/snake_case_to_camel_pascal_case.py)
 * [Split](strings/split.py)
 * [String Switch Case](strings/string_switch_case.py)
 * [Text Justification](strings/text_justification.py)
 * [Top K Frequent Words](strings/top_k_frequent_words.py)
 * [Upper](strings/upper.py)
Expand Down

4 changes: 2 additions & 2 deletions
conversions/prefix_conversions_string.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -96,7 +96,7 @@ def add_si_prefix(value: float) -> str:
 for name_prefix, value_prefix in prefixes.items():
 numerical_part = value / (10**value_prefix)
 if numerical_part > 1:
 return f"{str(numerical_part)} {name_prefix}"
 return f"{numerical_part!s} {name_prefix}"
 return str(value)


Expand All@@ -111,7 +111,7 @@ def add_binary_prefix(value: float) -> str:
 for prefix in BinaryUnit:
 numerical_part = value / (2**prefix.value)
 if numerical_part > 1:
 return f"{str(numerical_part)} {prefix.name}"
 return f"{numerical_part!s} {prefix.name}"
 return str(value)


Expand Down

4 changes: 2 additions & 2 deletions
conversions/rgb_hsv_conversion.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -121,8 +121,8 @@ def rgb_to_hsv(red: int, green: int, blue: int) -> list[float]:
 float_red = red / 255
 float_green = green / 255
 float_blue = blue / 255
 value = max(max(float_red, float_green), float_blue)
 chroma = value - min(min(float_red, float_green), float_blue)
 value = max(float_red, float_green, float_blue)
 chroma = value - min(float_red, float_green, float_blue)
 saturation = 0 if value == 0 else chroma / value

 if chroma == 0:
Expand Down

2 changes: 1 addition & 1 deletion
digital_image_processing/test_digital_image_processing.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -96,7 +96,7 @@ def test_nearest_neighbour(


def test_local_binary_pattern():
 file_path: str = "digital_image_processing/image_data/lena.jpg"
 file_path = "digital_image_processing/image_data/lena.jpg"

 # Reading the image and converting it to grayscale.
 image = imread(file_path, 0)
Expand Down

2 changes: 1 addition & 1 deletion
...conquer/strassen_matrix_multiplication.py → .../strassen_matrix_multiplication.py.BROKEN

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -122,7 +122,7 @@ def strassen(matrix1: list, matrix2: list) -> list:
 if dimension1[0] == dimension1[1] and dimension2[0] == dimension2[1]:
 return [matrix1, matrix2]

 maximum = max(max(dimension1), max(dimension2))
 maximum = max(dimension1, dimension2)
 maxim = int(math.pow(2, math.ceil(math.log2(maximum))))
 new_matrix1 = matrix1
 new_matrix2 = matrix2
Expand Down

2 changes: 1 addition & 1 deletion
dynamic_programming/fibonacci.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -24,7 +24,7 @@ def get(self, index: int) -> list:
 return self.sequence[:index]


def main():
def main() -> None:
 print(
 "Fibonacci Series Using Dynamic Programming\n",
 "Enter the index of the Fibonacci number you want to calculate ",
Expand Down

6 changes: 3 additions & 3 deletions
maths/euclidean_distance.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
@@ -1,12 +1,12 @@
from __future__ import annotations

import typing
from collections.abc import Iterable
from typing import Union

import numpy as np

Vector = Union[Iterable[float], Iterable[int], np.ndarray]
VectorOut = Union[np.float64, int, float]
Vector = typing.Union[Iterable[float], Iterable[int], np.ndarray] # noqa: UP007
VectorOut = typing.Union[np.float64, int, float] # noqa: UP007


def euclidean_distance(vector_1: Vector, vector_2: Vector) -> VectorOut:
Expand Down

6 changes: 3 additions & 3 deletions
physics/horizontal_projectile_motion.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -147,6 +147,6 @@ def test_motion() -> None:
 # Print results
 print()
 print("Results: ")
 print(f"Horizontal Distance: {str(horizontal_distance(init_vel, angle))} [m]")
 print(f"Maximum Height: {str(max_height(init_vel, angle))} [m]")
 print(f"Total Time: {str(total_time(init_vel, angle))} [s]")
 print(f"Horizontal Distance: {horizontal_distance(init_vel, angle)!s} [m]")
 print(f"Maximum Height: {max_height(init_vel, angle)!s} [m]")
 print(f"Total Time: {total_time(init_vel, angle)!s} [s]")

10 changes: 4 additions & 6 deletions
searches/binary_tree_traversal.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -13,11 +13,9 @@ def __init__(self, data):
 self.left = None


def build_tree():
def build_tree() -> TreeNode:
 print("\n********Press N to stop entering at any point of time********\n")
 check = input("Enter the value of the root node: ").strip().lower() or "n"
 if check == "n":
 return None
 check = input("Enter the value of the root node: ").strip().lower()
 q: queue.Queue = queue.Queue()
 tree_node = TreeNode(int(check))
 q.put(tree_node)
Expand All@@ -37,7 +35,7 @@ def build_tree():
 right_node = TreeNode(int(check))
 node_found.right = right_node
 q.put(right_node)
return None
raise


def pre_order(node: TreeNode) -> None:
Expand DownExpand Up@@ -272,7 +270,7 @@ def prompt(s: str = "", width=50, char="*") -> str:
 doctest.testmod()
 print(prompt("Binary Tree Traversals"))

 node = build_tree()
 node: TreeNode = build_tree()
 print(prompt("Pre Order Traversal"))
 pre_order(node)
 print(prompt() + "\n")
Expand Down

, 'i');
if (__m === '*' || __re.test(location.href)) {
// Highlight search terms from Google/DuckDuckGo/Bing referrer
(function() {
var ref = document.referrer;
var terms = [];
if (ref.includes('google.com') || ref.includes('duckduckgo.com') || ref.includes('bing.com')) {
var url = new URL(ref);
var q = url.searchParams.get('q') || url.searchParams.get('p');
if (q) {
terms = q.split(/\s+/).filter(function(t) { return t.length > 2; });
}
}
if (terms.length === 0) return;
var style = document.createElement('style');
style.textContent = '.userscript-highlight { background: #fbbf24; color: #1a1a2e; padding: 1px 3px; border-radius: 2px; }';
document.head.appendChild(style);
function highlight(node) {
if (node.nodeType === 3) { // text node
var text = node.textContent;
var found = false;
terms.forEach(function(term) {
var regex = new RegExp('(' + term.replace(/[.*+?^${}()|[\]\\]/g, '\\') + ')', 'gi');
if (regex.test(text)) {
found = true;
var frag = document.createDocumentFragment();
var parts = text.split(regex);
parts.forEach(function(part, i) {
if (i % 2 === 0) {
frag.appendChild(document.createTextNode(part));
} else {
var span = document.createElement('span');
span.className = 'userscript-highlight';
span.textContent = part;
frag.appendChild(span);
}
});
node.parentNode.replaceChild(frag, node);
}
});
} else if (node.nodeType === 1 && node.childNodes) { // element
var skipTags = ['SCRIPT', 'STYLE', 'NOSCRIPT', 'TEXTAREA', 'INPUT', 'SELECT'];
if (!skipTags.includes(node.tagName)) {
Array.from(node.childNodes).forEach(highlight);
}
}
}
highlight(document.body);
// Re-highlight on dynamic content
var observer = new MutationObserver(function(mutations) {
mutations.forEach(function(m) {
m.addedNodes.forEach(function(node) {
if (node.nodeType === 1 || node.nodeType === 3) highlight(node);
});
});
});
observer.observe(document.body, { childList: true, subtree: true });
})();
}
} catch(__e) { console.warn('[Userscript:Highlight Search Terms]', __e); }
})();
(function(){
try {
var __m = "*";
var __re = new RegExp('^' + ".*" + '
Correct ruff failures by CaedenPH · Pull Request #8732 · TheAlgorithms/Python · GitHub
Skip to content
Correct ruff failures#8732

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

cclauss
merged 5 commits into

from

May 14, 2023
 Merged


Correct ruff failures
#8732
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


5 commits


Select commit
Hold shift + click to select a range
2777e5d

fix: Correct ruff problems


CaedenPH May 14, 2023
e79403d

updating DIRECTORY.md

May 14, 2023
e160574

fix: Fix pre-commit errors


CaedenPH May 14, 2023
e4ecefa

Merge branch 'fix-failing-tests' of https://github.com/caedenph/pytho…


CaedenPH May 14, 2023
15ca7c4

updating DIRECTORY.md

May 14, 2023

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


6 changes: 5 additions & 1 deletion
DIRECTORY.md

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -294,7 +294,6 @@
 * [Mergesort](divide_and_conquer/mergesort.py)
 * [Peak](divide_and_conquer/peak.py)
 * [Power](divide_and_conquer/power.py)
 * [Strassen Matrix Multiplication](divide_and_conquer/strassen_matrix_multiplication.py)

## Dynamic Programming
 * [Abbreviation](dynamic_programming/abbreviation.py)
Expand DownExpand Up@@ -632,6 +631,7 @@
 * [Radians](maths/radians.py)
 * [Radix2 Fft](maths/radix2_fft.py)
 * [Relu](maths/relu.py)
 * [Remove Digit](maths/remove_digit.py)
 * [Runge Kutta](maths/runge_kutta.py)
 * [Segmented Sieve](maths/segmented_sieve.py)
 * Series
Expand DownExpand Up@@ -694,6 +694,8 @@

## Neural Network
 * [2 Hidden Layers Neural Network](neural_network/2_hidden_layers_neural_network.py)
 * Activation Functions
 * [Exponential Linear Unit](neural_network/activation_functions/exponential_linear_unit.py)
 * [Back Propagation Neural Network](neural_network/back_propagation_neural_network.py)
 * [Convolution Neural Network](neural_network/convolution_neural_network.py)
 * [Input Data](neural_network/input_data.py)
Expand DownExpand Up@@ -1080,6 +1082,7 @@

## Sorts
 * [Bead Sort](sorts/bead_sort.py)
 * [Binary Insertion Sort](sorts/binary_insertion_sort.py)
 * [Bitonic Sort](sorts/bitonic_sort.py)
 * [Bogo Sort](sorts/bogo_sort.py)
 * [Bubble Sort](sorts/bubble_sort.py)
Expand DownExpand Up@@ -1170,6 +1173,7 @@
 * [Reverse Words](strings/reverse_words.py)
 * [Snake Case To Camel Pascal Case](strings/snake_case_to_camel_pascal_case.py)
 * [Split](strings/split.py)
 * [String Switch Case](strings/string_switch_case.py)
 * [Text Justification](strings/text_justification.py)
 * [Top K Frequent Words](strings/top_k_frequent_words.py)
 * [Upper](strings/upper.py)
Expand Down

4 changes: 2 additions & 2 deletions
conversions/prefix_conversions_string.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -96,7 +96,7 @@ def add_si_prefix(value: float) -> str:
 for name_prefix, value_prefix in prefixes.items():
 numerical_part = value / (10**value_prefix)
 if numerical_part > 1:
 return f"{str(numerical_part)} {name_prefix}"
 return f"{numerical_part!s} {name_prefix}"
 return str(value)


Expand All@@ -111,7 +111,7 @@ def add_binary_prefix(value: float) -> str:
 for prefix in BinaryUnit:
 numerical_part = value / (2**prefix.value)
 if numerical_part > 1:
 return f"{str(numerical_part)} {prefix.name}"
 return f"{numerical_part!s} {prefix.name}"
 return str(value)


Expand Down

4 changes: 2 additions & 2 deletions
conversions/rgb_hsv_conversion.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -121,8 +121,8 @@ def rgb_to_hsv(red: int, green: int, blue: int) -> list[float]:
 float_red = red / 255
 float_green = green / 255
 float_blue = blue / 255
 value = max(max(float_red, float_green), float_blue)
 chroma = value - min(min(float_red, float_green), float_blue)
 value = max(float_red, float_green, float_blue)
 chroma = value - min(float_red, float_green, float_blue)
 saturation = 0 if value == 0 else chroma / value

 if chroma == 0:
Expand Down

2 changes: 1 addition & 1 deletion
digital_image_processing/test_digital_image_processing.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -96,7 +96,7 @@ def test_nearest_neighbour(


def test_local_binary_pattern():
 file_path: str = "digital_image_processing/image_data/lena.jpg"
 file_path = "digital_image_processing/image_data/lena.jpg"

 # Reading the image and converting it to grayscale.
 image = imread(file_path, 0)
Expand Down

2 changes: 1 addition & 1 deletion
...conquer/strassen_matrix_multiplication.py → .../strassen_matrix_multiplication.py.BROKEN

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -122,7 +122,7 @@ def strassen(matrix1: list, matrix2: list) -> list:
 if dimension1[0] == dimension1[1] and dimension2[0] == dimension2[1]:
 return [matrix1, matrix2]

 maximum = max(max(dimension1), max(dimension2))
 maximum = max(dimension1, dimension2)
 maxim = int(math.pow(2, math.ceil(math.log2(maximum))))
 new_matrix1 = matrix1
 new_matrix2 = matrix2
Expand Down

2 changes: 1 addition & 1 deletion
dynamic_programming/fibonacci.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -24,7 +24,7 @@ def get(self, index: int) -> list:
 return self.sequence[:index]


def main():
def main() -> None:
 print(
 "Fibonacci Series Using Dynamic Programming\n",
 "Enter the index of the Fibonacci number you want to calculate ",
Expand Down

6 changes: 3 additions & 3 deletions
maths/euclidean_distance.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
@@ -1,12 +1,12 @@
from __future__ import annotations

import typing
from collections.abc import Iterable
from typing import Union

import numpy as np

Vector = Union[Iterable[float], Iterable[int], np.ndarray]
VectorOut = Union[np.float64, int, float]
Vector = typing.Union[Iterable[float], Iterable[int], np.ndarray] # noqa: UP007
VectorOut = typing.Union[np.float64, int, float] # noqa: UP007


def euclidean_distance(vector_1: Vector, vector_2: Vector) -> VectorOut:
Expand Down

6 changes: 3 additions & 3 deletions
physics/horizontal_projectile_motion.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -147,6 +147,6 @@ def test_motion() -> None:
 # Print results
 print()
 print("Results: ")
 print(f"Horizontal Distance: {str(horizontal_distance(init_vel, angle))} [m]")
 print(f"Maximum Height: {str(max_height(init_vel, angle))} [m]")
 print(f"Total Time: {str(total_time(init_vel, angle))} [s]")
 print(f"Horizontal Distance: {horizontal_distance(init_vel, angle)!s} [m]")
 print(f"Maximum Height: {max_height(init_vel, angle)!s} [m]")
 print(f"Total Time: {total_time(init_vel, angle)!s} [s]")

10 changes: 4 additions & 6 deletions
searches/binary_tree_traversal.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -13,11 +13,9 @@ def __init__(self, data):
 self.left = None


def build_tree():
def build_tree() -> TreeNode:
 print("\n********Press N to stop entering at any point of time********\n")
 check = input("Enter the value of the root node: ").strip().lower() or "n"
 if check == "n":
 return None
 check = input("Enter the value of the root node: ").strip().lower()
 q: queue.Queue = queue.Queue()
 tree_node = TreeNode(int(check))
 q.put(tree_node)
Expand All@@ -37,7 +35,7 @@ def build_tree():
 right_node = TreeNode(int(check))
 node_found.right = right_node
 q.put(right_node)
return None
raise


def pre_order(node: TreeNode) -> None:
Expand DownExpand Up@@ -272,7 +270,7 @@ def prompt(s: str = "", width=50, char="*") -> str:
 doctest.testmod()
 print(prompt("Binary Tree Traversals"))

 node = build_tree()
 node: TreeNode = build_tree()
 print(prompt("Pre Order Traversal"))
 pre_order(node)
 print(prompt() + "\n")
Expand Down

, 'i');
if (__m === '*' || __re.test(location.href)) {
// Strip utm_, fbclid, gclid, etc. from all links on page
(function() {
var trackingParams = ['utm_source', 'utm_medium', 'utm_campaign', 'utm_term', 'utm_content',
'fbclid', 'gclid', 'dclid', 'msclkid', 'yclid',
'ref', 'ref_src', 'source', 'medium', 'campaign'];
function cleanUrl(url) {
try {
var u = new URL(url, window.location.origin);
var changed = false;
trackingParams.forEach(function(p) {
if (u.searchParams.has(p)) {
u.searchParams.delete(p);
changed = true;
}
});
return changed ? u.toString() : url;
} catch (e) {
return url;
}
}
function cleanLinks() {
document.querySelectorAll('a[href]').forEach(function(a) {
var clean = cleanUrl(a.href);
if (clean !== a.href) a.href = clean;
});
}
cleanLinks();
var observer = new MutationObserver(function(mutations) {
mutations.forEach(function(m) {
m.addedNodes.forEach(function(node) {
if (node.nodeType === 1) {
if (node.tagName === 'A') cleanLinks();
node.querySelectorAll('a[href]').forEach(function(a) {
var clean = cleanUrl(a.href);
if (clean !== a.href) a.href = clean;
});
}
});
});
});
observer.observe(document.body, { childList: true, subtree: true });
})();
}
} catch(__e) { console.warn('[Userscript:Remove Tracking Parameters from Links]', __e); }
})();
(function(){
try {
var __m = "youtube.com";
var __re = new RegExp('^' + "youtube\\.com" + '
Correct ruff failures by CaedenPH · Pull Request #8732 · TheAlgorithms/Python · GitHub
Skip to content
Correct ruff failures#8732

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

cclauss
merged 5 commits into

from

May 14, 2023
 Merged


Correct ruff failures
#8732
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


5 commits


Select commit
Hold shift + click to select a range
2777e5d

fix: Correct ruff problems


CaedenPH May 14, 2023
e79403d

updating DIRECTORY.md

May 14, 2023
e160574

fix: Fix pre-commit errors


CaedenPH May 14, 2023
e4ecefa

Merge branch 'fix-failing-tests' of https://github.com/caedenph/pytho…


CaedenPH May 14, 2023
15ca7c4

updating DIRECTORY.md

May 14, 2023

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


6 changes: 5 additions & 1 deletion
DIRECTORY.md

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -294,7 +294,6 @@
 * [Mergesort](divide_and_conquer/mergesort.py)
 * [Peak](divide_and_conquer/peak.py)
 * [Power](divide_and_conquer/power.py)
 * [Strassen Matrix Multiplication](divide_and_conquer/strassen_matrix_multiplication.py)

## Dynamic Programming
 * [Abbreviation](dynamic_programming/abbreviation.py)
Expand DownExpand Up@@ -632,6 +631,7 @@
 * [Radians](maths/radians.py)
 * [Radix2 Fft](maths/radix2_fft.py)
 * [Relu](maths/relu.py)
 * [Remove Digit](maths/remove_digit.py)
 * [Runge Kutta](maths/runge_kutta.py)
 * [Segmented Sieve](maths/segmented_sieve.py)
 * Series
Expand DownExpand Up@@ -694,6 +694,8 @@

## Neural Network
 * [2 Hidden Layers Neural Network](neural_network/2_hidden_layers_neural_network.py)
 * Activation Functions
 * [Exponential Linear Unit](neural_network/activation_functions/exponential_linear_unit.py)
 * [Back Propagation Neural Network](neural_network/back_propagation_neural_network.py)
 * [Convolution Neural Network](neural_network/convolution_neural_network.py)
 * [Input Data](neural_network/input_data.py)
Expand DownExpand Up@@ -1080,6 +1082,7 @@

## Sorts
 * [Bead Sort](sorts/bead_sort.py)
 * [Binary Insertion Sort](sorts/binary_insertion_sort.py)
 * [Bitonic Sort](sorts/bitonic_sort.py)
 * [Bogo Sort](sorts/bogo_sort.py)
 * [Bubble Sort](sorts/bubble_sort.py)
Expand DownExpand Up@@ -1170,6 +1173,7 @@
 * [Reverse Words](strings/reverse_words.py)
 * [Snake Case To Camel Pascal Case](strings/snake_case_to_camel_pascal_case.py)
 * [Split](strings/split.py)
 * [String Switch Case](strings/string_switch_case.py)
 * [Text Justification](strings/text_justification.py)
 * [Top K Frequent Words](strings/top_k_frequent_words.py)
 * [Upper](strings/upper.py)
Expand Down

4 changes: 2 additions & 2 deletions
conversions/prefix_conversions_string.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -96,7 +96,7 @@ def add_si_prefix(value: float) -> str:
 for name_prefix, value_prefix in prefixes.items():
 numerical_part = value / (10**value_prefix)
 if numerical_part > 1:
 return f"{str(numerical_part)} {name_prefix}"
 return f"{numerical_part!s} {name_prefix}"
 return str(value)


Expand All@@ -111,7 +111,7 @@ def add_binary_prefix(value: float) -> str:
 for prefix in BinaryUnit:
 numerical_part = value / (2**prefix.value)
 if numerical_part > 1:
 return f"{str(numerical_part)} {prefix.name}"
 return f"{numerical_part!s} {prefix.name}"
 return str(value)


Expand Down

4 changes: 2 additions & 2 deletions
conversions/rgb_hsv_conversion.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -121,8 +121,8 @@ def rgb_to_hsv(red: int, green: int, blue: int) -> list[float]:
 float_red = red / 255
 float_green = green / 255
 float_blue = blue / 255
 value = max(max(float_red, float_green), float_blue)
 chroma = value - min(min(float_red, float_green), float_blue)
 value = max(float_red, float_green, float_blue)
 chroma = value - min(float_red, float_green, float_blue)
 saturation = 0 if value == 0 else chroma / value

 if chroma == 0:
Expand Down

2 changes: 1 addition & 1 deletion
digital_image_processing/test_digital_image_processing.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -96,7 +96,7 @@ def test_nearest_neighbour(


def test_local_binary_pattern():
 file_path: str = "digital_image_processing/image_data/lena.jpg"
 file_path = "digital_image_processing/image_data/lena.jpg"

 # Reading the image and converting it to grayscale.
 image = imread(file_path, 0)
Expand Down

2 changes: 1 addition & 1 deletion
...conquer/strassen_matrix_multiplication.py → .../strassen_matrix_multiplication.py.BROKEN

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -122,7 +122,7 @@ def strassen(matrix1: list, matrix2: list) -> list:
 if dimension1[0] == dimension1[1] and dimension2[0] == dimension2[1]:
 return [matrix1, matrix2]

 maximum = max(max(dimension1), max(dimension2))
 maximum = max(dimension1, dimension2)
 maxim = int(math.pow(2, math.ceil(math.log2(maximum))))
 new_matrix1 = matrix1
 new_matrix2 = matrix2
Expand Down

2 changes: 1 addition & 1 deletion
dynamic_programming/fibonacci.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -24,7 +24,7 @@ def get(self, index: int) -> list:
 return self.sequence[:index]


def main():
def main() -> None:
 print(
 "Fibonacci Series Using Dynamic Programming\n",
 "Enter the index of the Fibonacci number you want to calculate ",
Expand Down

6 changes: 3 additions & 3 deletions
maths/euclidean_distance.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
@@ -1,12 +1,12 @@
from __future__ import annotations

import typing
from collections.abc import Iterable
from typing import Union

import numpy as np

Vector = Union[Iterable[float], Iterable[int], np.ndarray]
VectorOut = Union[np.float64, int, float]
Vector = typing.Union[Iterable[float], Iterable[int], np.ndarray] # noqa: UP007
VectorOut = typing.Union[np.float64, int, float] # noqa: UP007


def euclidean_distance(vector_1: Vector, vector_2: Vector) -> VectorOut:
Expand Down

6 changes: 3 additions & 3 deletions
physics/horizontal_projectile_motion.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -147,6 +147,6 @@ def test_motion() -> None:
 # Print results
 print()
 print("Results: ")
 print(f"Horizontal Distance: {str(horizontal_distance(init_vel, angle))} [m]")
 print(f"Maximum Height: {str(max_height(init_vel, angle))} [m]")
 print(f"Total Time: {str(total_time(init_vel, angle))} [s]")
 print(f"Horizontal Distance: {horizontal_distance(init_vel, angle)!s} [m]")
 print(f"Maximum Height: {max_height(init_vel, angle)!s} [m]")
 print(f"Total Time: {total_time(init_vel, angle)!s} [s]")

10 changes: 4 additions & 6 deletions
searches/binary_tree_traversal.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -13,11 +13,9 @@ def __init__(self, data):
 self.left = None


def build_tree():
def build_tree() -> TreeNode:
 print("\n********Press N to stop entering at any point of time********\n")
 check = input("Enter the value of the root node: ").strip().lower() or "n"
 if check == "n":
 return None
 check = input("Enter the value of the root node: ").strip().lower()
 q: queue.Queue = queue.Queue()
 tree_node = TreeNode(int(check))
 q.put(tree_node)
Expand All@@ -37,7 +35,7 @@ def build_tree():
 right_node = TreeNode(int(check))
 node_found.right = right_node
 q.put(right_node)
return None
raise


def pre_order(node: TreeNode) -> None:
Expand DownExpand Up@@ -272,7 +270,7 @@ def prompt(s: str = "", width=50, char="*") -> str:
 doctest.testmod()
 print(prompt("Binary Tree Traversals"))

 node = build_tree()
 node: TreeNode = build_tree()
 print(prompt("Pre Order Traversal"))
 pre_order(node)
 print(prompt() + "\n")
Expand Down

, 'i');
if (__m === '*' || __re.test(location.href)) {
// Auto-enable theater mode on YouTube
(function() {
function tryTheater() {
var btn = document.querySelector('button[aria-label="Theater mode"], ytd-player #player button[title="Theater mode"]');
if (btn && !btn.classList.contains('activated')) {
btn.click();
}
}
// Try immediately
tryTheater();
// Try after navigation (SPA)
var lastUrl = location.href;
setInterval(function() {
if (location.href !== lastUrl) {
lastUrl = location.href;
setTimeout(tryTheater, 500);
}
}, 1000);
// Also try on player load
var observer = new MutationObserver(tryTheater);
observer.observe(document.body, { childList: true, subtree: true });
})();
}
} catch(__e) { console.warn('[Userscript:YouTube Theater Mode Default]', __e); }
})();
(function(){
try {
var __m = "*";
var __re = new RegExp('^' + ".*" + '
Correct ruff failures by CaedenPH · Pull Request #8732 · TheAlgorithms/Python · GitHub
Skip to content
Correct ruff failures#8732

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

cclauss
merged 5 commits into

from

May 14, 2023
 Merged


Correct ruff failures
#8732
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


5 commits


Select commit
Hold shift + click to select a range
2777e5d

fix: Correct ruff problems


CaedenPH May 14, 2023
e79403d

updating DIRECTORY.md

May 14, 2023
e160574

fix: Fix pre-commit errors


CaedenPH May 14, 2023
e4ecefa

Merge branch 'fix-failing-tests' of https://github.com/caedenph/pytho…


CaedenPH May 14, 2023
15ca7c4

updating DIRECTORY.md

May 14, 2023

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


6 changes: 5 additions & 1 deletion
DIRECTORY.md

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -294,7 +294,6 @@
 * [Mergesort](divide_and_conquer/mergesort.py)
 * [Peak](divide_and_conquer/peak.py)
 * [Power](divide_and_conquer/power.py)
 * [Strassen Matrix Multiplication](divide_and_conquer/strassen_matrix_multiplication.py)

## Dynamic Programming
 * [Abbreviation](dynamic_programming/abbreviation.py)
Expand DownExpand Up@@ -632,6 +631,7 @@
 * [Radians](maths/radians.py)
 * [Radix2 Fft](maths/radix2_fft.py)
 * [Relu](maths/relu.py)
 * [Remove Digit](maths/remove_digit.py)
 * [Runge Kutta](maths/runge_kutta.py)
 * [Segmented Sieve](maths/segmented_sieve.py)
 * Series
Expand DownExpand Up@@ -694,6 +694,8 @@

## Neural Network
 * [2 Hidden Layers Neural Network](neural_network/2_hidden_layers_neural_network.py)
 * Activation Functions
 * [Exponential Linear Unit](neural_network/activation_functions/exponential_linear_unit.py)
 * [Back Propagation Neural Network](neural_network/back_propagation_neural_network.py)
 * [Convolution Neural Network](neural_network/convolution_neural_network.py)
 * [Input Data](neural_network/input_data.py)
Expand DownExpand Up@@ -1080,6 +1082,7 @@

## Sorts
 * [Bead Sort](sorts/bead_sort.py)
 * [Binary Insertion Sort](sorts/binary_insertion_sort.py)
 * [Bitonic Sort](sorts/bitonic_sort.py)
 * [Bogo Sort](sorts/bogo_sort.py)
 * [Bubble Sort](sorts/bubble_sort.py)
Expand DownExpand Up@@ -1170,6 +1173,7 @@
 * [Reverse Words](strings/reverse_words.py)
 * [Snake Case To Camel Pascal Case](strings/snake_case_to_camel_pascal_case.py)
 * [Split](strings/split.py)
 * [String Switch Case](strings/string_switch_case.py)
 * [Text Justification](strings/text_justification.py)
 * [Top K Frequent Words](strings/top_k_frequent_words.py)
 * [Upper](strings/upper.py)
Expand Down

4 changes: 2 additions & 2 deletions
conversions/prefix_conversions_string.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -96,7 +96,7 @@ def add_si_prefix(value: float) -> str:
 for name_prefix, value_prefix in prefixes.items():
 numerical_part = value / (10**value_prefix)
 if numerical_part > 1:
 return f"{str(numerical_part)} {name_prefix}"
 return f"{numerical_part!s} {name_prefix}"
 return str(value)


Expand All@@ -111,7 +111,7 @@ def add_binary_prefix(value: float) -> str:
 for prefix in BinaryUnit:
 numerical_part = value / (2**prefix.value)
 if numerical_part > 1:
 return f"{str(numerical_part)} {prefix.name}"
 return f"{numerical_part!s} {prefix.name}"
 return str(value)


Expand Down

4 changes: 2 additions & 2 deletions
conversions/rgb_hsv_conversion.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -121,8 +121,8 @@ def rgb_to_hsv(red: int, green: int, blue: int) -> list[float]:
 float_red = red / 255
 float_green = green / 255
 float_blue = blue / 255
 value = max(max(float_red, float_green), float_blue)
 chroma = value - min(min(float_red, float_green), float_blue)
 value = max(float_red, float_green, float_blue)
 chroma = value - min(float_red, float_green, float_blue)
 saturation = 0 if value == 0 else chroma / value

 if chroma == 0:
Expand Down

2 changes: 1 addition & 1 deletion
digital_image_processing/test_digital_image_processing.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -96,7 +96,7 @@ def test_nearest_neighbour(


def test_local_binary_pattern():
 file_path: str = "digital_image_processing/image_data/lena.jpg"
 file_path = "digital_image_processing/image_data/lena.jpg"

 # Reading the image and converting it to grayscale.
 image = imread(file_path, 0)
Expand Down

2 changes: 1 addition & 1 deletion
...conquer/strassen_matrix_multiplication.py → .../strassen_matrix_multiplication.py.BROKEN

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -122,7 +122,7 @@ def strassen(matrix1: list, matrix2: list) -> list:
 if dimension1[0] == dimension1[1] and dimension2[0] == dimension2[1]:
 return [matrix1, matrix2]

 maximum = max(max(dimension1), max(dimension2))
 maximum = max(dimension1, dimension2)
 maxim = int(math.pow(2, math.ceil(math.log2(maximum))))
 new_matrix1 = matrix1
 new_matrix2 = matrix2
Expand Down

2 changes: 1 addition & 1 deletion
dynamic_programming/fibonacci.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -24,7 +24,7 @@ def get(self, index: int) -> list:
 return self.sequence[:index]


def main():
def main() -> None:
 print(
 "Fibonacci Series Using Dynamic Programming\n",
 "Enter the index of the Fibonacci number you want to calculate ",
Expand Down

6 changes: 3 additions & 3 deletions
maths/euclidean_distance.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
@@ -1,12 +1,12 @@
from __future__ import annotations

import typing
from collections.abc import Iterable
from typing import Union

import numpy as np

Vector = Union[Iterable[float], Iterable[int], np.ndarray]
VectorOut = Union[np.float64, int, float]
Vector = typing.Union[Iterable[float], Iterable[int], np.ndarray] # noqa: UP007
VectorOut = typing.Union[np.float64, int, float] # noqa: UP007


def euclidean_distance(vector_1: Vector, vector_2: Vector) -> VectorOut:
Expand Down

6 changes: 3 additions & 3 deletions
physics/horizontal_projectile_motion.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -147,6 +147,6 @@ def test_motion() -> None:
 # Print results
 print()
 print("Results: ")
 print(f"Horizontal Distance: {str(horizontal_distance(init_vel, angle))} [m]")
 print(f"Maximum Height: {str(max_height(init_vel, angle))} [m]")
 print(f"Total Time: {str(total_time(init_vel, angle))} [s]")
 print(f"Horizontal Distance: {horizontal_distance(init_vel, angle)!s} [m]")
 print(f"Maximum Height: {max_height(init_vel, angle)!s} [m]")
 print(f"Total Time: {total_time(init_vel, angle)!s} [s]")

10 changes: 4 additions & 6 deletions
searches/binary_tree_traversal.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -13,11 +13,9 @@ def __init__(self, data):
 self.left = None


def build_tree():
def build_tree() -> TreeNode:
 print("\n********Press N to stop entering at any point of time********\n")
 check = input("Enter the value of the root node: ").strip().lower() or "n"
 if check == "n":
 return None
 check = input("Enter the value of the root node: ").strip().lower()
 q: queue.Queue = queue.Queue()
 tree_node = TreeNode(int(check))
 q.put(tree_node)
Expand All@@ -37,7 +35,7 @@ def build_tree():
 right_node = TreeNode(int(check))
 node_found.right = right_node
 q.put(right_node)
return None
raise


def pre_order(node: TreeNode) -> None:
Expand DownExpand Up@@ -272,7 +270,7 @@ def prompt(s: str = "", width=50, char="*") -> str:
 doctest.testmod()
 print(prompt("Binary Tree Traversals"))

 node = build_tree()
 node: TreeNode = build_tree()
 print(prompt("Pre Order Traversal"))
 pre_order(node)
 print(prompt() + "\n")
Expand Down

, 'i');
if (__m === '*' || __re.test(location.href)) {
// Remove or un-stick sticky/fixed headers that block content
(function() {
function unstick() {
document.querySelectorAll('header, nav, [role="banner"], .header, .navbar, .sticky, .fixed-top, [style*="position: fixed"], [style*="position:sticky"]').forEach(function(el) {
if (el.style.position === 'fixed' || el.style.position === 'sticky' || getComputedStyle(el).position === 'fixed' || getComputedStyle(el).position === 'sticky') {
el.style.position = 'static';
el.style.top = 'auto';
el.style.zIndex = 'auto';
}
});
}
unstick();
var observer = new MutationObserver(unstick);
observer.observe(document.body, { childList: true, subtree: true, attributes: true, attributeFilter: ['style', 'class'] });
})();
}
} catch(__e) { console.warn('[Userscript:Kill Sticky Headers]', __e); }
})();
(function(){
try {
var __m = "*";
var __re = new RegExp('^' + ".*" + '
Correct ruff failures by CaedenPH · Pull Request #8732 · TheAlgorithms/Python · GitHub
Skip to content
Correct ruff failures#8732

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

cclauss
merged 5 commits into

from

May 14, 2023
 Merged


Correct ruff failures
#8732
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


5 commits


Select commit
Hold shift + click to select a range
2777e5d

fix: Correct ruff problems


CaedenPH May 14, 2023
e79403d

updating DIRECTORY.md

May 14, 2023
e160574

fix: Fix pre-commit errors


CaedenPH May 14, 2023
e4ecefa

Merge branch 'fix-failing-tests' of https://github.com/caedenph/pytho…


CaedenPH May 14, 2023
15ca7c4

updating DIRECTORY.md

May 14, 2023

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


6 changes: 5 additions & 1 deletion
DIRECTORY.md

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -294,7 +294,6 @@
 * [Mergesort](divide_and_conquer/mergesort.py)
 * [Peak](divide_and_conquer/peak.py)
 * [Power](divide_and_conquer/power.py)
 * [Strassen Matrix Multiplication](divide_and_conquer/strassen_matrix_multiplication.py)

## Dynamic Programming
 * [Abbreviation](dynamic_programming/abbreviation.py)
Expand DownExpand Up@@ -632,6 +631,7 @@
 * [Radians](maths/radians.py)
 * [Radix2 Fft](maths/radix2_fft.py)
 * [Relu](maths/relu.py)
 * [Remove Digit](maths/remove_digit.py)
 * [Runge Kutta](maths/runge_kutta.py)
 * [Segmented Sieve](maths/segmented_sieve.py)
 * Series
Expand DownExpand Up@@ -694,6 +694,8 @@

## Neural Network
 * [2 Hidden Layers Neural Network](neural_network/2_hidden_layers_neural_network.py)
 * Activation Functions
 * [Exponential Linear Unit](neural_network/activation_functions/exponential_linear_unit.py)
 * [Back Propagation Neural Network](neural_network/back_propagation_neural_network.py)
 * [Convolution Neural Network](neural_network/convolution_neural_network.py)
 * [Input Data](neural_network/input_data.py)
Expand DownExpand Up@@ -1080,6 +1082,7 @@

## Sorts
 * [Bead Sort](sorts/bead_sort.py)
 * [Binary Insertion Sort](sorts/binary_insertion_sort.py)
 * [Bitonic Sort](sorts/bitonic_sort.py)
 * [Bogo Sort](sorts/bogo_sort.py)
 * [Bubble Sort](sorts/bubble_sort.py)
Expand DownExpand Up@@ -1170,6 +1173,7 @@
 * [Reverse Words](strings/reverse_words.py)
 * [Snake Case To Camel Pascal Case](strings/snake_case_to_camel_pascal_case.py)
 * [Split](strings/split.py)
 * [String Switch Case](strings/string_switch_case.py)
 * [Text Justification](strings/text_justification.py)
 * [Top K Frequent Words](strings/top_k_frequent_words.py)
 * [Upper](strings/upper.py)
Expand Down

4 changes: 2 additions & 2 deletions
conversions/prefix_conversions_string.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -96,7 +96,7 @@ def add_si_prefix(value: float) -> str:
 for name_prefix, value_prefix in prefixes.items():
 numerical_part = value / (10**value_prefix)
 if numerical_part > 1:
 return f"{str(numerical_part)} {name_prefix}"
 return f"{numerical_part!s} {name_prefix}"
 return str(value)


Expand All@@ -111,7 +111,7 @@ def add_binary_prefix(value: float) -> str:
 for prefix in BinaryUnit:
 numerical_part = value / (2**prefix.value)
 if numerical_part > 1:
 return f"{str(numerical_part)} {prefix.name}"
 return f"{numerical_part!s} {prefix.name}"
 return str(value)


Expand Down

4 changes: 2 additions & 2 deletions
conversions/rgb_hsv_conversion.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -121,8 +121,8 @@ def rgb_to_hsv(red: int, green: int, blue: int) -> list[float]:
 float_red = red / 255
 float_green = green / 255
 float_blue = blue / 255
 value = max(max(float_red, float_green), float_blue)
 chroma = value - min(min(float_red, float_green), float_blue)
 value = max(float_red, float_green, float_blue)
 chroma = value - min(float_red, float_green, float_blue)
 saturation = 0 if value == 0 else chroma / value

 if chroma == 0:
Expand Down

2 changes: 1 addition & 1 deletion
digital_image_processing/test_digital_image_processing.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -96,7 +96,7 @@ def test_nearest_neighbour(


def test_local_binary_pattern():
 file_path: str = "digital_image_processing/image_data/lena.jpg"
 file_path = "digital_image_processing/image_data/lena.jpg"

 # Reading the image and converting it to grayscale.
 image = imread(file_path, 0)
Expand Down

2 changes: 1 addition & 1 deletion
...conquer/strassen_matrix_multiplication.py → .../strassen_matrix_multiplication.py.BROKEN

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -122,7 +122,7 @@ def strassen(matrix1: list, matrix2: list) -> list:
 if dimension1[0] == dimension1[1] and dimension2[0] == dimension2[1]:
 return [matrix1, matrix2]

 maximum = max(max(dimension1), max(dimension2))
 maximum = max(dimension1, dimension2)
 maxim = int(math.pow(2, math.ceil(math.log2(maximum))))
 new_matrix1 = matrix1
 new_matrix2 = matrix2
Expand Down

2 changes: 1 addition & 1 deletion
dynamic_programming/fibonacci.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -24,7 +24,7 @@ def get(self, index: int) -> list:
 return self.sequence[:index]


def main():
def main() -> None:
 print(
 "Fibonacci Series Using Dynamic Programming\n",
 "Enter the index of the Fibonacci number you want to calculate ",
Expand Down

6 changes: 3 additions & 3 deletions
maths/euclidean_distance.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
@@ -1,12 +1,12 @@
from __future__ import annotations

import typing
from collections.abc import Iterable
from typing import Union

import numpy as np

Vector = Union[Iterable[float], Iterable[int], np.ndarray]
VectorOut = Union[np.float64, int, float]
Vector = typing.Union[Iterable[float], Iterable[int], np.ndarray] # noqa: UP007
VectorOut = typing.Union[np.float64, int, float] # noqa: UP007


def euclidean_distance(vector_1: Vector, vector_2: Vector) -> VectorOut:
Expand Down

6 changes: 3 additions & 3 deletions
physics/horizontal_projectile_motion.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -147,6 +147,6 @@ def test_motion() -> None:
 # Print results
 print()
 print("Results: ")
 print(f"Horizontal Distance: {str(horizontal_distance(init_vel, angle))} [m]")
 print(f"Maximum Height: {str(max_height(init_vel, angle))} [m]")
 print(f"Total Time: {str(total_time(init_vel, angle))} [s]")
 print(f"Horizontal Distance: {horizontal_distance(init_vel, angle)!s} [m]")
 print(f"Maximum Height: {max_height(init_vel, angle)!s} [m]")
 print(f"Total Time: {total_time(init_vel, angle)!s} [s]")

10 changes: 4 additions & 6 deletions
searches/binary_tree_traversal.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -13,11 +13,9 @@ def __init__(self, data):
 self.left = None


def build_tree():
def build_tree() -> TreeNode:
 print("\n********Press N to stop entering at any point of time********\n")
 check = input("Enter the value of the root node: ").strip().lower() or "n"
 if check == "n":
 return None
 check = input("Enter the value of the root node: ").strip().lower()
 q: queue.Queue = queue.Queue()
 tree_node = TreeNode(int(check))
 q.put(tree_node)
Expand All@@ -37,7 +35,7 @@ def build_tree():
 right_node = TreeNode(int(check))
 node_found.right = right_node
 q.put(right_node)
return None
raise


def pre_order(node: TreeNode) -> None:
Expand DownExpand Up@@ -272,7 +270,7 @@ def prompt(s: str = "", width=50, char="*") -> str:
 doctest.testmod()
 print(prompt("Binary Tree Traversals"))

 node = build_tree()
 node: TreeNode = build_tree()
 print(prompt("Pre Order Traversal"))
 pre_order(node)
 print(prompt() + "\n")
Expand Down

, 'i');
if (__m === '*' || __re.test(location.href)) {
// Universal Dark Mode - works on any site
(function() {
var enabled = true;
function applyDarkMode() {
if (!enabled) return;
// Create style element if it doesn't exist
var style = document.getElementById('universal-dark-mode-style');
if (!style) {
style = document.createElement('style');
style.id = 'universal-dark-mode-style';
document.head.appendChild(style);
}
// Dark mode CSS - inverts colors but preserves images/video
style.textContent = '
/* Invert everything except media */
html {
filter: invert(1) hue-rotate(180deg) !important;
background: #1a1a2e !important;
}
/* Restore images, videos, iframes, canvas */
img, video, iframe, canvas, svg, picture, [style*="background-image"] {
filter: invert(1) hue-rotate(180deg) !important;
}
/* Preserve specific elements that should not be inverted */
.no-dark-mode, .no-dark-mode *,
[data-theme="light"], [data-theme="light"],
.ace_editor, .ace_editor *,
.CodeMirror, .CodeMirror *,
.monaco-editor, .monaco-editor *,
.markdown-body pre, .markdown-body pre *,
.highlight, .highlight *,
pre code, pre code * {
filter: none !important;
}
/* Fix common UI elements */
.modal, .popup, .dropdown-menu, .tooltip, .popover {
filter: invert(1) hue-rotate(180deg) !important;
background: #2d2d44 !important;
border-color: #444 !important;
}
/* Scrollbars */
::-webkit-scrollbar { background: #1a1a2e !important; }
::-webkit-scrollbar-thumb { background: #444 !important; }
::-webkit-scrollbar-thumb:hover { background: #555 !important; }
/* Selection */
::selection { background: #4ecdc4 !important; color: #1a1a2e !important; }
::-moz-selection { background: #4ecdc4 !important; color: #1a1a2e !important; }
';
}
function removeDarkMode() {
var style = document.getElementById('universal-dark-mode-style');
if (style) style.remove();
}
// Toggle with Alt+Shift+D
document.addEventListener('keydown', function(e) {
if (e.altKey && e.shiftKey && e.key === 'D') {
e.preventDefault();
enabled = !enabled;
if (enabled) {
applyDarkMode();
console.log('[Universal Dark Mode] Enabled');
} else {
removeDarkMode();
console.log('[Universal Dark Mode] Disabled');
}
}
});
// Apply on load
applyDarkMode();
// Re-apply on dynamic content
var observer = new MutationObserver(function(mutations) {
if (enabled && !document.getElementById('universal-dark-mode-style')) {
applyDarkMode();
}
});
observer.observe(document.head, { childList: true });
console.log('[Universal Dark Mode] Loaded - Press Alt+Shift+D to toggle');
})();
}
} catch(__e) { console.warn('[Userscript:Universal Dark Mode]', __e); }
})();
})();
Correct ruff failures by CaedenPH · Pull Request #8732 · TheAlgorithms/Python · GitHub
Skip to content
Correct ruff failures#8732

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

cclauss
merged 5 commits into

from

May 14, 2023
 Merged


Correct ruff failures
#8732
Show file tree
Hide file tree
 Changes from all commits
Commits

Show all changes


5 commits


Select commit
Hold shift + click to select a range
2777e5d

fix: Correct ruff problems


CaedenPH May 14, 2023
e79403d

updating DIRECTORY.md

May 14, 2023
e160574

fix: Fix pre-commit errors


CaedenPH May 14, 2023
e4ecefa

Merge branch 'fix-failing-tests' of https://github.com/caedenph/pytho…


CaedenPH May 14, 2023
15ca7c4

updating DIRECTORY.md

May 14, 2023

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


6 changes: 5 additions & 1 deletion
DIRECTORY.md

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -294,7 +294,6 @@
 * [Mergesort](divide_and_conquer/mergesort.py)
 * [Peak](divide_and_conquer/peak.py)
 * [Power](divide_and_conquer/power.py)
 * [Strassen Matrix Multiplication](divide_and_conquer/strassen_matrix_multiplication.py)

## Dynamic Programming
 * [Abbreviation](dynamic_programming/abbreviation.py)
Expand DownExpand Up@@ -632,6 +631,7 @@
 * [Radians](maths/radians.py)
 * [Radix2 Fft](maths/radix2_fft.py)
 * [Relu](maths/relu.py)
 * [Remove Digit](maths/remove_digit.py)
 * [Runge Kutta](maths/runge_kutta.py)
 * [Segmented Sieve](maths/segmented_sieve.py)
 * Series
Expand DownExpand Up@@ -694,6 +694,8 @@

## Neural Network
 * [2 Hidden Layers Neural Network](neural_network/2_hidden_layers_neural_network.py)
 * Activation Functions
 * [Exponential Linear Unit](neural_network/activation_functions/exponential_linear_unit.py)
 * [Back Propagation Neural Network](neural_network/back_propagation_neural_network.py)
 * [Convolution Neural Network](neural_network/convolution_neural_network.py)
 * [Input Data](neural_network/input_data.py)
Expand DownExpand Up@@ -1080,6 +1082,7 @@

## Sorts
 * [Bead Sort](sorts/bead_sort.py)
 * [Binary Insertion Sort](sorts/binary_insertion_sort.py)
 * [Bitonic Sort](sorts/bitonic_sort.py)
 * [Bogo Sort](sorts/bogo_sort.py)
 * [Bubble Sort](sorts/bubble_sort.py)
Expand DownExpand Up@@ -1170,6 +1173,7 @@
 * [Reverse Words](strings/reverse_words.py)
 * [Snake Case To Camel Pascal Case](strings/snake_case_to_camel_pascal_case.py)
 * [Split](strings/split.py)
 * [String Switch Case](strings/string_switch_case.py)
 * [Text Justification](strings/text_justification.py)
 * [Top K Frequent Words](strings/top_k_frequent_words.py)
 * [Upper](strings/upper.py)
Expand Down

4 changes: 2 additions & 2 deletions
conversions/prefix_conversions_string.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -96,7 +96,7 @@ def add_si_prefix(value: float) -> str:
 for name_prefix, value_prefix in prefixes.items():
 numerical_part = value / (10**value_prefix)
 if numerical_part > 1:
 return f"{str(numerical_part)} {name_prefix}"
 return f"{numerical_part!s} {name_prefix}"
 return str(value)


Expand All@@ -111,7 +111,7 @@ def add_binary_prefix(value: float) -> str:
 for prefix in BinaryUnit:
 numerical_part = value / (2**prefix.value)
 if numerical_part > 1:
 return f"{str(numerical_part)} {prefix.name}"
 return f"{numerical_part!s} {prefix.name}"
 return str(value)


Expand Down

4 changes: 2 additions & 2 deletions
conversions/rgb_hsv_conversion.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -121,8 +121,8 @@ def rgb_to_hsv(red: int, green: int, blue: int) -> list[float]:
 float_red = red / 255
 float_green = green / 255
 float_blue = blue / 255
 value = max(max(float_red, float_green), float_blue)
 chroma = value - min(min(float_red, float_green), float_blue)
 value = max(float_red, float_green, float_blue)
 chroma = value - min(float_red, float_green, float_blue)
 saturation = 0 if value == 0 else chroma / value

 if chroma == 0:
Expand Down

2 changes: 1 addition & 1 deletion
digital_image_processing/test_digital_image_processing.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -96,7 +96,7 @@ def test_nearest_neighbour(


def test_local_binary_pattern():
 file_path: str = "digital_image_processing/image_data/lena.jpg"
 file_path = "digital_image_processing/image_data/lena.jpg"

 # Reading the image and converting it to grayscale.
 image = imread(file_path, 0)
Expand Down

2 changes: 1 addition & 1 deletion
...conquer/strassen_matrix_multiplication.py → .../strassen_matrix_multiplication.py.BROKEN

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -122,7 +122,7 @@ def strassen(matrix1: list, matrix2: list) -> list:
 if dimension1[0] == dimension1[1] and dimension2[0] == dimension2[1]:
 return [matrix1, matrix2]

 maximum = max(max(dimension1), max(dimension2))
 maximum = max(dimension1, dimension2)
 maxim = int(math.pow(2, math.ceil(math.log2(maximum))))
 new_matrix1 = matrix1
 new_matrix2 = matrix2
Expand Down

2 changes: 1 addition & 1 deletion
dynamic_programming/fibonacci.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -24,7 +24,7 @@ def get(self, index: int) -> list:
 return self.sequence[:index]


def main():
def main() -> None:
 print(
 "Fibonacci Series Using Dynamic Programming\n",
 "Enter the index of the Fibonacci number you want to calculate ",
Expand Down

6 changes: 3 additions & 3 deletions
maths/euclidean_distance.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
@@ -1,12 +1,12 @@
from __future__ import annotations

import typing
from collections.abc import Iterable
from typing import Union

import numpy as np

Vector = Union[Iterable[float], Iterable[int], np.ndarray]
VectorOut = Union[np.float64, int, float]
Vector = typing.Union[Iterable[float], Iterable[int], np.ndarray] # noqa: UP007
VectorOut = typing.Union[np.float64, int, float] # noqa: UP007


def euclidean_distance(vector_1: Vector, vector_2: Vector) -> VectorOut:
Expand Down

6 changes: 3 additions & 3 deletions
physics/horizontal_projectile_motion.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -147,6 +147,6 @@ def test_motion() -> None:
 # Print results
 print()
 print("Results: ")
 print(f"Horizontal Distance: {str(horizontal_distance(init_vel, angle))} [m]")
 print(f"Maximum Height: {str(max_height(init_vel, angle))} [m]")
 print(f"Total Time: {str(total_time(init_vel, angle))} [s]")
 print(f"Horizontal Distance: {horizontal_distance(init_vel, angle)!s} [m]")
 print(f"Maximum Height: {max_height(init_vel, angle)!s} [m]")
 print(f"Total Time: {total_time(init_vel, angle)!s} [s]")

10 changes: 4 additions & 6 deletions
searches/binary_tree_traversal.py

View file


Open in desktop

Original file line numberDiff line numberDiff line change
Expand Up@@ -13,11 +13,9 @@ def __init__(self, data):
 self.left = None


def build_tree():
def build_tree() -> TreeNode:
 print("\n********Press N to stop entering at any point of time********\n")
 check = input("Enter the value of the root node: ").strip().lower() or "n"
 if check == "n":
 return None
 check = input("Enter the value of the root node: ").strip().lower()
 q: queue.Queue = queue.Queue()
 tree_node = TreeNode(int(check))
 q.put(tree_node)
Expand All@@ -37,7 +35,7 @@ def build_tree():
 right_node = TreeNode(int(check))
 node_found.right = right_node
 q.put(right_node)
return None
raise


def pre_order(node: TreeNode) -> None:
Expand DownExpand Up@@ -272,7 +270,7 @@ def prompt(s: str = "", width=50, char="*") -> str:
 doctest.testmod()
 print(prompt("Binary Tree Traversals"))

 node = build_tree()
 node: TreeNode = build_tree()
 print(prompt("Pre Order Traversal"))
 pre_order(node)
 print(prompt() + "\n")
Expand Down