Skip to content

fix: function name typo #11319

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 4 commits into from
Mar 12, 2024
Merged

fix: function name typo #11319

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
47c4034
fix: function name typo
testwill Mar 11, 2024
f6d81d7
lfu_cache.py: Use f-strings
cclauss Mar 12, 2024
fd68f35
rsa_cipher.py: Use f-strings
cclauss Mar 12, 2024
0a14d9d
Merge branch 'master' into typo
cclauss Mar 12, 2024
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
3 changes: 1 addition & 2 deletions ciphers/rsa_cipher.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -102,8 +102,7 @@ def read_from_file_and_decrypt(message_filename: str, key_filename: str) -> str:
sys.exit(
f"ERROR: Block size is {block_size * 8} bits and key size is {key_size} "
"bits. The RSA cipher requires the block size to be equal to or greater "
"than the key size. Did you specify the correct key file and encrypted "
"file?"
"than the key size. Were the correct key file and encrypted file specified?"
)

encrypted_blocks = []
Expand Down
4 changes: 2 additions & 2 deletions machine_learning/astar.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -57,7 +57,7 @@ def __init__(self, world_size=(5, 5)):
def show(self):
print(self.w)

def get_neigbours(self, cell):
def get_neighbours(self, cell):
"""
Return the neighbours of cell
"""
Expand Down Expand Up @@ -110,7 +110,7 @@ def astar(world, start, goal):
_closed.append(_open.pop(min_f))
if current == goal:
break
for n in world.get_neigbours(current):
for n in world.get_neighbours(current):
for c in _closed:
if c == n:
continue
Expand Down