mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2024-11-23 21:11:08 +00:00
Code Issues Packages Projects Releases Wiki Activity

fix: function name typo (#11319)

Browse Source 
* fix: function name typo

Signed-off-by: guoguangwu <guoguangwug@gmail.com>

* lfu_cache.py: Use f-strings

* rsa_cipher.py: Use f-strings

---------

Signed-off-by: guoguangwu <guoguangwug@gmail.com>
Co-authored-by: Christian Clauss <cclauss@me.com>
This commit is contained in:
guangwu 2024-03-12 16:40:32 +08:00 committed by GitHub
parent fd27953d44
commit 5f95d6f805
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
2 changed files with 3 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
ciphers/rsa_cipher.py
View File

@ -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 = []

4
machine_learning/astar.py
View File

@ -57,7 +57,7 @@ class Gridworld:
def show(self):
print(self.w)
def get_neigbours(self, cell):
def get_neighbours(self, cell):
"""
Return the neighbours of cell
"""
@ -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