🚨 Fix or ignore bandit errors

pytudes/_2021/coderbyte/math_challenge__hard.py

@@ -63,7 +63,9 @@ def MathChallenge(rpn_expression: str) -> int:
             curr_num = curr_num * 10 + int(token)
 
         # Add number from fully-parsed multi-digit string to operand stack
-        elif token == " " and curr_num is not None:  # Operand/operator delimiter
+        elif (
+            token == " " and curr_num is not None  # Operand/operator delimiter # nosec
+        ):
             operand_stack.append(curr_num)
             curr_num = None
 

pytudes/_2021/educative/grokking_the_coding_interview/topological_sort/_4__all_tasks_scheduling_orders__hard.py

@@ -112,7 +112,7 @@ def compute_topological_orders(
         for child in graph[curr_source_vertex]:  # 3
             in_degree[child] += 1
         unpop = acc_topological_order.pop()  # 2
-        assert unpop == curr_source_vertex
+        assert unpop == curr_source_vertex  # nosec
         sources.append(curr_source_vertex)  # 1
 
     return topological_orders

pytudes/_2021/leetcode/hard/_224_basic_calculator.py

@@ -85,9 +85,9 @@ def move_greater_or_equal_precedence_operators_in_curr_scope_to_rpn_stack() -> N
 
         # Update operators in intermediate stack/Move to RPN stack
         if token in operator_precedence:
-            if token != "(":
+            if token != "(":  # nosec
                 move_greater_or_equal_precedence_operators_in_curr_scope_to_rpn_stack()
-            if token != ")":
+            if token != ")":  # nosec
                 intermediate_operator_tokens.append(token)
 
     rpn_tokens += reversed(intermediate_operator_tokens)

pytudes/_2021/leetcode/medium/_150__evaluate_reverse_polish_notation.py

@@ -232,11 +232,11 @@ def eval_RPN_classic(tokens: list[str]) -> int:
     for token in tokens:
         if token in arithmetic_operators:
             right_operand, left_operand = operand_stack.pop(), operand_stack.pop()
-            if token == "+":
+            if token == "+":  # nosec
                 new_operand = left_operand + right_operand
-            elif token == "-":
+            elif token == "-":  # nosec
                 new_operand = left_operand - right_operand
-            elif token == "*":
+            elif token == "*":  # nosec
                 new_operand = left_operand * right_operand
             else:  # token == "/"
                 # Integer division is truncated toward zero.

pytudes/_2021/leetcode/medium/_973__closest_k_points_to_origin__quickselect.py

@@ -138,7 +138,7 @@ def swap_elements(i, j) -> None:
     get_distance = lambda i: sum(coord**2 for coord in points[i])
 
     ## INITIALIZE VARS ##
-    pivot_idx = random.randint(start, end)  # inclusive range
+    pivot_idx = random.randint(start, end)  # inclusive range  # nosec
     pivot_distance = get_distance(pivot_idx)
 
     ## 3-WAY PARTITION ##
@@ -209,7 +209,7 @@ def swap_elements(i, j) -> None:
     while start < end:  # pragma: no branch
 
         ## INITIALIZE VARS ##
-        pivot_idx = random.randint(start, end)  # inclusive range
+        pivot_idx = random.randint(start, end)  # inclusive range  # nosec
         pivot_distance = get_distance(pivot_idx)
 
         ## 3-WAY PARTITION ##

pytudes/_2021/miscellany/bit_manipulation.py

@@ -208,7 +208,7 @@ def set_negation(A: int) -> int:
     """
     normal_neg = ~A
     XOR_neg = A ^ all_1_bits()  # ~0
-    assert normal_neg == XOR_neg == -A - 1
+    assert normal_neg == XOR_neg == -A - 1  # nosec
     return normal_neg
 
 
@@ -334,7 +334,7 @@ def extract_last_bit(A: int) -> int:
     mask_with_twos_complement_negation_of_A = A & -A
     mask_with_negation_of_A_minus_1 = A & ~(A - 1)
     XOR_with_A_last_on_bit_dropped = A ^ remove_last_on_bit(A)  # A ^ (A & (A - 1))
-    assert (
+    assert (  # nosec
         mask_with_twos_complement_negation_of_A
         == mask_with_negation_of_A_minus_1
         == XOR_with_A_last_on_bit_dropped

pytudes/_2021/miscellany/sorting/quicksort_related/quicksort.py

@@ -55,7 +55,7 @@ def swap_elements(i, j):
         return
 
     ## INITIALIZE VARS ##
-    pivot_idx = random.randint(start, end)
+    pivot_idx = random.randint(start, end)  # nosec
     pivot = items[pivot_idx]
 
     ## 3-WAY PARTITION ##

pytudes/_2021/miscellany/sorting/quicksort_related/three_way_partition.py

@@ -52,7 +52,7 @@ def swap_elements(i, j):
         items[i], items[j] = items[j], items[i]
 
     ## INITIALIZE VARS ##
-    pivot_idx = random.randint(start, end)
+    pivot_idx = random.randint(start, end)  # nosec
     pivot = items[pivot_idx]
 
     ## 3-WAY PARTITION ##