Introduced binary_sum_with_carry and rewrote binary_sum accordingly.

Added carry return (VERY NOT SURE IF IT WORKS CORRECTLY).

bitutilities.py

@@ -1,19 +1,40 @@
 from collections import deque
+from typing_extensions import Self
 
 
 class BasicRegister:
-    """The BasicRegister represents a hardware register capable of manipulating multiple bits at a time.
+    """
+    The BasicRegister represents a hardware register capable of manipulating multiple bits at a time.
 
     :param deque[bool] memory: The bits stored inside the register.
     """
 
     def __init__(self, memory: list[bool]):
-        """Constructor method"""
         self.memory: deque[bool] = deque(memory)
 
+    def __repr__(self) -> str:
+        return f"Memory: {[int(value) for value in  self.memory]}"
+
     def __str__(self) -> str:
         return f"Memory: {[int(value) for value in  self.memory]}"
 
+    def __len__(self) -> int:
+        return len(self.memory)
+
+    def adjusted_by_size(self, resulting_size: int) -> Self:
+        """
+        Adjusts a register to a given size.
+
+        :param int resulting_size: The size of the resulting register.
+
+        :return: A register of a specified size.
+        :rtype: BasicRegister
+        """
+        current_memory_size: int = len(self.memory)
+        return BasicRegister(
+            [False] * max(resulting_size - current_memory_size, 0) + list(self.memory)[-resulting_size:]
+        )
+
     def reverse(self):
         self.memory = deque([not value for value in self.memory])
 
@@ -27,10 +48,6 @@ class BasicRegister:
         shifted_radices: deque[bool] = deque([self.memory.pop() for _i in range(steps_shifted)])
         return shifted_radices
 
-    def adjust_size(self, s: int) -> None:
-        current_memory_size: int = len(self.memory)
-        return BasicRegister([False] * max(s - current_memory_size, 0) + list(self.memory)[-current_memory_size:])
-
 
 def get_memory(variable_name: str) -> list[bool]:
     """
@@ -50,37 +67,57 @@ def get_memory(variable_name: str) -> list[bool]:
             print(f"[ERROR] The {variable_name} may contain only 1-s and 0-s!")
 
 
-def sum(a_original: BasicRegister, b_original: BasicRegister) -> BasicRegister:
+def binary_sum_with_carry(first_term: BasicRegister, second_term: BasicRegister) -> tuple[BasicRegister, int]:
+    result_term = BasicRegister([False] * len(first_term))
+
+    carry = False
+    for i in range(len(first_term) - 1, 0, -1):
+        current_bit_sum = first_term.memory[i] + second_term.memory[i] + carry
+        carry = bool(current_bit_sum & 2)
+        result_term.memory[i] = bool(current_bit_sum & 1)
+
+    final_bit_sum = first_term.memory[0] + second_term.memory[0] + carry
+    final_carry = bool(final_bit_sum & 2)
+    result_term.memory[0] = bool(final_bit_sum & 1)
+
+    return result_term, final_carry
+
+
+def binary_sum(first_term: BasicRegister, second_term: BasicRegister) -> BasicRegister:
     """
     Sums two registers' values.
 
-    :param BasicRegister a: First register.
-    :param BasicRegister b: Second register.
+    :param BasicRegister first_term: First register.
+    :param BasicRegister second_term: Second register.
 
-    :return: Register containing the result.
-    :rtype: BasicRegister
+    :return: Register containing the sum or the tuple containing the register and carried radix.
+    :rtype: BasicRegister | tuple[BasicRegister, int]
     """
-    size_a = len(a_original.memory)
-    size_b = len(b_original.memory)
+    return binary_sum_with_carry(first_term, second_term)[0]
 
-    required_size = max(size_a, size_b)
 
-    if size_a != size_b:
-        a = a_original.adjust_size(required_size)
-        b = b_original.adjust_size(required_size)
+def binary_subtraction(first_term: BasicRegister, second_term: BasicRegister) -> BasicRegister:
+    second_term.reverse()
+
+    result: BasicRegister
+    final_carry: bool
+    result, final_carry = binary_sum_with_carry(first_term, second_term)
+
+    if final_carry:
+        return binary_sum(result, BasicRegister([False] * (len(result) - 1) + [True]))
     else:
-        a = a_original
-        b = b_original
+        result.reverse()
+        return result
 
-    c = BasicRegister([False] * required_size)
 
-    carry = False
-    for i in range(size_a - 1, 0, -1):
-        current_bit_sum = a.memory[i] + b.memory[i] + carry
-        carry = bool(current_bit_sum & 2)
-        c.memory[i] = bool(current_bit_sum & 1)
+def align_registers(first_register: BasicRegister, second_register: BasicRegister) \
+        -> tuple[BasicRegister, BasicRegister]:
+    first_size = len(first_register)
+    second_size = len(second_register)
 
-    final_bit_sum = a.memory[0] + b.memory[0] + carry
-    c.memory[0] = bool(final_bit_sum & 1)
+    required_size = max(first_size, second_size)
 
-    return c
+    if first_size != second_size:
+        return first_register.adjusted_by_size(required_size), second_register.adjusted_by_size(required_size)
+    else:
+        return first_register, second_register

main.py

@@ -1,28 +1,32 @@
-from bitutilities import *
-import timeit
+import bitutilities as bu
+
+
+def input_handler(first_register: bu.BasicRegister, second_register: bu.BasicRegister):
+    first_register, second_register = bu.align_registers(first_register, second_register)
+
+    print()
+    print(first_register)
+    print(second_register)
+
+    while True:
+        print()
+        match input("Choose the operation:\n[a]ddition, [s]ubtraction, [m]ultiplication, [d]ivision, [q]uit\n>>> "):
+            case "a":
+                print(f"Sum:\n{bu.binary_sum(first_register, second_register)}")
+            case "s":
+                print(f"Subtraction:\n{bu.binary_subtraction(first_register, second_register)}")
+            case "m":
+                pass
+            case "d":
+                pass
+            case "q":
+                exit()
+            case _:
+                print("Not an available operation, try again.")
 
 
 if __name__ == '__main__':
-    reg: BasicRegister = BasicRegister(get_memory("memory"))
-    # print(type(reg))
+    reg: bu.BasicRegister = bu.BasicRegister(bu.get_memory("memory"))
+    reg2: bu.BasicRegister = bu.BasicRegister(bu.get_memory("more memory"))
 
-    print("\nRegister:")
-    print(reg)
-
-    print("\nReversed:")
-    reg.reverse()
-    print(reg)
-
-    print("\nShifted left:")
-    print([int(value) for value in reg.left_shift()])
-    print(reg)
-
-    print("\nShifted right:")
-    print([int(value) for value in reg.right_shift()])
-    print(reg)
-
-    reg2: BasicRegister = BasicRegister(get_memory("more memory"))
-
-    reg3: BasicRegister = sum(reg, reg2)
-
-    print(reg3)
+    input_handler(reg, reg2)