Adopt Python >= 3.8 assignment expressions using auto-walrus (#7737)

* Adopt Python >= 3.8 assignment expressions using auto-walrus

* updating DIRECTORY.md

* [pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>

.pre-commit-config.yaml

@@ -13,6 +13,11 @@ repos:
           )$
       - id: requirements-txt-fixer
 
+  - repo: https://github.com/MarcoGorelli/auto-walrus
+    rev: v0.2.1
+    hooks:
+    -   id: auto-walrus
+
   - repo: https://github.com/psf/black
     rev: 22.10.0
     hooks:

DIRECTORY.md

@@ -45,6 +45,7 @@
   * [Count 1S Brian Kernighan Method](bit_manipulation/count_1s_brian_kernighan_method.py)
   * [Count Number Of One Bits](bit_manipulation/count_number_of_one_bits.py)
   * [Gray Code Sequence](bit_manipulation/gray_code_sequence.py)
+  * [Highest Set Bit](bit_manipulation/highest_set_bit.py)
   * [Is Even](bit_manipulation/is_even.py)
   * [Reverse Bits](bit_manipulation/reverse_bits.py)
   * [Single Bit Manipulation Operations](bit_manipulation/single_bit_manipulation_operations.py)
@@ -326,6 +327,7 @@
 ## Financial
   * [Equated Monthly Installments](financial/equated_monthly_installments.py)
   * [Interest](financial/interest.py)
+  * [Price Plus Tax](financial/price_plus_tax.py)
 
 ## Fractals
   * [Julia Sets](fractals/julia_sets.py)
@@ -669,6 +671,7 @@
   * [Horizontal Projectile Motion](physics/horizontal_projectile_motion.py)
   * [Kinetic Energy](physics/kinetic_energy.py)
   * [Lorentz Transformation Four Vector](physics/lorentz_transformation_four_vector.py)
+  * [Malus Law](physics/malus_law.py)
   * [N Body Simulation](physics/n_body_simulation.py)
   * [Newtons Law Of Gravitation](physics/newtons_law_of_gravitation.py)
   * [Newtons Second Law Of Motion](physics/newtons_second_law_of_motion.py)

ciphers/enigma_machine2.py

@@ -86,8 +86,7 @@ def _validator(
     """
     # Checks if there are 3 unique rotors
 
-    unique_rotsel = len(set(rotsel))
+    if (unique_rotsel := len(set(rotsel))) < 3:
-    if unique_rotsel < 3:
         raise Exception(f"Please use 3 unique rotors (not {unique_rotsel})")
 
     # Checks if rotor positions are valid

data_structures/linked_list/doubly_linked_list_two.py

@@ -143,9 +143,8 @@ class LinkedList:
         raise Exception("Node not found")
 
     def delete_value(self, value):
-        node = self.get_node(value)
 
-        if node is not None:
+        if (node := self.get_node(value)) is not None:
             if node == self.head:
                 self.head = self.head.get_next()
 

dynamic_programming/fibonacci.py

@@ -18,8 +18,7 @@ class Fibonacci:
         >>> Fibonacci().get(5)
         [0, 1, 1, 2, 3]
         """
-        difference = index - (len(self.sequence) - 2)
+        if (difference := index - (len(self.sequence) - 2)) >= 1:
-        if difference >= 1:
             for _ in range(difference):
                 self.sequence.append(self.sequence[-1] + self.sequence[-2])
         return self.sequence[:index]

machine_learning/sequential_minimum_optimization.py

@@ -321,10 +321,9 @@ class SmoSVM:
         k11 = k(i1, i1)
         k22 = k(i2, i2)
         k12 = k(i1, i2)
-        eta = k11 + k22 - 2.0 * k12
 
         # select the new alpha2 which could get the minimal objectives
-        if eta > 0.0:
+        if (eta := k11 + k22 - 2.0 * k12) > 0.0:
             a2_new_unc = a2 + (y2 * (e1 - e2)) / eta
             # a2_new has a boundary
             if a2_new_unc >= h:

strings/indian_phone_validator.py

@@ -20,8 +20,7 @@ def indian_phone_validator(phone: str) -> bool:
     True
     """
     pat = re.compile(r"^(\+91[\-\s]?)?[0]?(91)?[789]\d{9}$")
-    match = re.search(pat, phone)
+    if match := re.search(pat, phone):
-    if match:
         return match.string == phone
     return False