Optimised reverse method (I have proofs of speed) (I have been slightly mistaken).

2023-06-25 22:57:12 +03:00 · 2023-06-25 22:57:12 +03:00 · ede83eeb8e
parent f747e3b530
commit ede83eeb8e
1 changed files with 1 additions and 2 deletions
--- a/bitutilities.py
+++ b/bitutilities.py
@ -15,8 +15,7 @@ class BasicRegister:
        return f"Memory: {[int(value) for value in  self.memory]}"

    def reverse(self):
-        for i, value in enumerate(self.memory):
-            self.memory[i] = not value
+        self.memory = deque([not value for value in self.memory])

    def left_shift(self, digit_to_fill: bool = False, steps_shifted: int = 1) -> deque[bool]:
        self.memory.extend([digit_to_fill] * steps_shifted)