Improve code

Author: andrelbd1

python_utils/decorator/decorator_as_class.py

@@ -1,12 +1,13 @@
 import functools
 
 # The typical way to maintain state in Python is by using classes.
-# Recall that the decorator syntax @decorator is just a quicker way of saying func = decorator(func). 
-# Therefore, if decorator is a class, it needs to take func as an argument in its .__init__() initializer. 
+# Recall that the decorator syntax @decorator is just a quicker way of saying func = decorator(func).
+# Therefore, if decorator is a class, it needs to take func as an argument in its .__init__() initializer.
 # Furthermore, the class instance needs to be callable so that it can stand in for the decorated function.
 # For a class instance to be callable, you implement the special .__call__() method.
 # The .__call__() method is executed each time you try to call an instance of the class:
 
+
 class CountCalls:
     def __init__(self, func):
         functools.update_wrapper(self, func)
@@ -18,9 +19,11 @@ def __call__(self, *args, **kwargs):
         print(f"Call {self.num_calls} of {self.func.__name__}()")
         return self.func(*args, **kwargs)
 
+
 @CountCalls
 def say_hi():
     print("Hi!")
 
+
 for i in range(4):
-    say_hi()
+    say_hi()

python_utils/decorator/decorator_as_function.py

@@ -1,9 +1,10 @@
 import time
 import functools
 
-# The @functools.wraps decorator uses functools.update_wrapper() to update 
+# The @functools.wraps decorator uses functools.update_wrapper() to update
 # special attributes like __name__ and __doc__ that are used in the introspection.
 
+
 def duration(func):
     """Print the runtime of the decorated function"""
     @functools.wraps(func)
@@ -16,6 +17,7 @@ def wrapper(*args, **kwargs):
         return res
     return wrapper
 
+
 def do_twice(func):
     """Call twice the decorated function"""
     @functools.wraps(func)
@@ -25,29 +27,33 @@ def wrapper(*args, **kwargs):
         # return res
     return wrapper
 
+
 @duration
 def soma():
-    total=0
-    for i in range(0,1000):
-        total+=i
+    total = 0
+    for i in range(1000):
+        total += i
     return total
 
+
 @duration
 def multiplicacao():
-    total=1
-    for i in range(1,1000):
-        total*=i
+    total = 1
+    for i in range(1, 1000):
+        total *= i
+
 
 # Nesting decorators
 @do_twice
 @duration
 def twice_multiplicacao():
-    total=1
-    for i in range(1,1000):
-        total*=i
+    total = 1
+    for i in range(1, 1000):
+        total *= i
+
 
 print(soma())
-print(f'-------------------------------------')
+print('-------------------------------------')
 print(multiplicacao())
-print(f'-------------------------------------')
-print(twice_multiplicacao())
+print('-------------------------------------')
+print(twice_multiplicacao())

python_utils/decorator/examples/caching.py

@@ -1,6 +1,7 @@
 import functools
 from count_calls import CountCalls
 
+
 def cache(func):
     """Keep a cache of previous function calls"""
     @functools.wraps(func)
@@ -12,20 +13,23 @@ def wrapper_cache(*args, **kwargs):
     wrapper_cache.cache = {}
     return wrapper_cache
 
+
 @CountCalls
 def fibonacci_straightforward(num):
     if num < 2:
         return num
     return fibonacci_straightforward(num - 1) + fibonacci_straightforward(num - 2)
 
+
 @cache
 @CountCalls
 def fibonacci_memoization(num):
     if num < 2:
         return num
     return fibonacci_memoization(num - 1) + fibonacci_memoization(num - 2)
 
-n=8
+
+n = 8
 print(fibonacci_straightforward(n))
-print(f'----------------------------------')
-print(fibonacci_memoization(n))
+print('----------------------------------')
+print(fibonacci_memoization(n))

python_utils/decorator/examples/count_calls.py

@@ -1,12 +1,13 @@
 import functools
 
 # The typical way to maintain state in Python is by using classes.
-# Recall that the decorator syntax @decorator is just a quicker way of saying func = decorator(func). 
-# Therefore, if decorator is a class, it needs to take func as an argument in its .__init__() initializer. 
+# Recall that the decorator syntax @decorator is just a quicker way of saying func = decorator(func).
+# Therefore, if decorator is a class, it needs to take func as an argument in its .__init__() initializer.
 # Furthermore, the class instance needs to be callable so that it can stand in for the decorated function.
 # For a class instance to be callable, you implement the special .__call__() method.
 # The .__call__() method is executed each time you try to call an instance of the class:
 
+
 class CountCalls:
     def __init__(self, func):
         functools.update_wrapper(self, func)
@@ -18,9 +19,11 @@ def __call__(self, *args, **kwargs):
         print(f"Call {self.num_calls} of {self.func.__name__}()")
         return self.func(*args, **kwargs)
 
+
 @CountCalls
 def say_hi():
     print("Hi!")
 
+
 for i in range(4):
-    say_hi()
+    say_hi()

python_utils/decorator/examples/countdown.py

@@ -1,6 +1,7 @@
 import functools
 import time
 
+
 def slow_down(_func=None, *, rate=1):
     """Sleep given amount of seconds before calling the function"""
     def decorator_slow_down(func):
@@ -15,6 +16,7 @@ def wrapper_slow_down(*args, **kwargs):
     else:
         return decorator_slow_down(_func)
 
+
 @slow_down(rate=1)
 def countdown(from_number):
     if from_number < 1:
@@ -23,4 +25,5 @@ def countdown(from_number):
         print(from_number)
         countdown(from_number - 1)
 
-countdown(3)
+
+countdown(3)

python_utils/decorator/examples/singleton.py

@@ -1,5 +1,6 @@
 import functools
 
+
 def singleton(cls):
     """Make a class a Singleton class (only one instance)"""
     @functools.wraps(cls)
@@ -10,12 +11,14 @@ def wrapper_singleton(*args, **kwargs):
     wrapper_singleton.instance = None
     return wrapper_singleton
 
+
 @singleton
 class Foo:
     pass
 
+
 first_one = Foo()
 another_one = Foo()
-print(f'{first_one = }')
-print(f'{another_one = }')
-print(f'first_one is another_one: {first_one is another_one}')
+print(f'{first_one=}')
+print(f'{another_one=}')
+print(f'first_one is another_one: {first_one is another_one}')

python_utils/list_comprehension/list_comprehension.py

@@ -1,18 +1,18 @@
-# List Comprehension
-## List comprehension in Python are constructed as follows:
-lst = [i for i in range(0,6)]
+""" List Comprehension """
+# List comprehension in Python are constructed as follows:
+lst = [i for i in range(6)]
 print(lst)
 
-## Sum 2 in each list item
+# Sum 2 in each list item
 res = []
 for i in lst:
     res.append(i+2)
 print(res)
 
-## Sum 2 in each list item using list comprehensions
+# Sum 2 in each list item using list comprehensions
 res = [i+2 for i in lst]
 print(res)
 
-## Sum 2 in each even list item using list comprehensions
-res = [i+2 if i%2==0 and i!=0 else i for i in lst]
-print(res)
+# Sum 2 in each even list item using list comprehensions
+res = [i+2 if i % 2 == 0 and i != 0 else i for i in lst]
+print(res)

python_utils/pdb/example2.py

@@ -11,4 +11,4 @@ def get_path(filename):
 
 
 filename = __file__
-print(f'path = {get_path(filename)}')
+print(f'path = {get_path(filename)}')

python_utils/pdb/example3.py

@@ -12,4 +12,4 @@ def get_path(filename):
 filename = __file__
 breakpoint()
 filename_path = get_path(filename)
-print(f'path = {filename_path}')
+print(f'path = {filename_path}')

python_utils/pdb/example4.py

@@ -5,4 +5,4 @@
 filename = __file__
 breakpoint()
 filename_path = util.get_path(filename)
-print(f'path = {filename_path}')
+print(f'path = {filename_path}')

python_utils/pdb/example5.py

@@ -14,4 +14,4 @@ def get_path(fname):
 
 filename = __file__
 filename_path = get_path(filename)
-print(f'path = {filename_path}')
+print(f'path = {filename_path}')

python_utils/pdb/example6.py

@@ -10,4 +10,4 @@ def get_file_info(full_fname):
 
 filename = __file__
 filename_path = get_file_info(filename)
-print(f'path = {filename_path}')
+print(f'path = {filename_path}')

python_utils/pdb/fileutil.py

@@ -3,4 +3,4 @@ def get_path(fname):
     import os
     breakpoint()
     head, tail = os.path.split(fname)
-    return head
+    return head

python_utils/pdb/util.py

@@ -2,4 +2,4 @@ def get_path(filename):
     """Return file's path or empty string if no path."""
     import os
     head, tail = os.path.split(filename)
-    return head
+    return head

python_utils/walrus_operator/walrus_operator.py

@@ -20,7 +20,7 @@
 }
 print(description)
 
-'''The variables num_length and num_sum are only used to optimize the calculations 
+'''The variables num_length and num_sum are only used to optimize the calculations
 inside the dictionary. By using the walrus operator, you can make this role clearer'''
 description = {
     "length": (num_length := len(numbers)),
@@ -34,11 +34,13 @@
 '''Here, you filter the numbers list and leave the positive results from applying slow().
 The problem with this code is that this expensive function is called twice.
 '''
+numbers = [7, 6, 1, 4, 1, 8, 0, 6]
+
+
 def slow(x):
     return x-2
 
 
-numbers = [7, 6, 1, 4, 1, 8, 0, 6]
 results = [slow(num) for num in numbers if slow(num) > 0]
 print(results)
 
@@ -49,8 +51,8 @@ def slow(x):
 print(results)
 
 
-'''Here, you first capture all city names that start with "B". 
-Then, if there’s at least one such city name, you print out the 
+'''Here, you first capture all city names that start with "B".
+Then, if there’s at least one such city name, you print out the
 first city name starting with "B".'''
 cities = ['Monaco', 'Vancouver', 'Rio de Janeiro', 'Berlin', 'La Paz', 'Bogota', 'Dallas']
 
@@ -61,6 +63,8 @@ def slow(x):
 
 '''You can more clearly see what’s happening by wrapping .startswith("B") in a function that
 also prints out which item is being checked:'''
+
+
 def starts_with_b(name):
     print(f"Checking {name}: {(result := name.startswith('B'))}")
     return result

python_utils/yield/example_1.py

@@ -2,10 +2,12 @@ def random_numbers():
     for i in range(10):
         yield i
 
-gen = random_numbers()
 
-print(next(gen))
-print(next(gen))
-print(next(gen))
-print(next(gen))
-print(list(gen))
+if __name__ == '__main__':
+    gen = random_numbers()
+
+    print(next(gen))
+    print(next(gen))
+    print(next(gen))
+    print(next(gen))
+    print(list(gen))

python_utils/yield/example_2.py

@@ -2,15 +2,18 @@ def random_numbers():
     for i in range(3):
         yield i
 
+
 def random_numbers_100():
-    for i in range(100,105):
+    for i in range(100, 105):
         yield i
 
+
 def generator():
     yield from random_numbers()
     print('Next generator')
     yield from random_numbers_100()
 
+
 if __name__ == '__main__':
     gen = generator()
     print(next(gen))

solutions/buildings/build.py

@@ -26,7 +26,7 @@ def bfs(w, h, area):
             if (newx >= w) | (newy >= h) | (newx < 0) | (newy < 0):
                 continue
 
-            if(dist[newx][newy] == -1):
+            if (dist[newx][newy] == -1):
                 dist[newx][newy] = dist[x][y] + 1
                 q.append([newx, newy])