18 Commits

Author SHA1 Message Date
6413927d70 fix wrong carry bit output 2023-06-27 15:00:10 +03:00
544031efbb Just some testing. 2023-06-27 14:18:37 +03:00
d2df4bbf28 Renamed arguments inside binary_sum.
Added carry return (VERY NOT SURE IF IT WORKS CORRECTLY).
2023-06-27 14:18:10 +03:00
132a0b5659 Changed the conditions checking register lengths. 2023-06-27 14:09:07 +03:00
75f7dba546 Implemented __repr__ and __len__ for BasicRegister. 2023-06-27 14:07:47 +03:00
f2ee4cd709 fix BasicRegister shrinking 2023-06-26 22:33:41 +03:00
8f68099309 Minor adjustments to bitutilities.py. 2023-06-26 21:58:24 +03:00
a9cfd1ec97 Merge pull request 'Core: add the sum function for BasicRegister objects' (#1) from feature-sum into master
Reviewed-on: #1
2023-06-26 21:29:25 +03:00
d25dacf35b add sum function for addition of two registers 2023-06-26 21:05:45 +03:00
4dfd6ef417 revert 65750694e4
revert Delete 'bitutilities.py'
2023-06-26 00:26:09 +03:00
a6e4b4b4d6 revert e80304f84d
revert Delete 'main.py'
2023-06-26 00:24:47 +03:00
b64516243c revert 0dc2bd3950
revert Delete 'README.md'
2023-06-26 00:24:33 +03:00
d2eaf9fe76 revert c730e0d1bd
revert Rusty implementation.
2023-06-26 00:23:54 +03:00
c730e0d1bd Rusty implementation. 2023-06-26 00:24:45 +03:00
e80304f84d Delete 'main.py' 2023-06-26 00:15:11 +03:00
65750694e4 Delete 'bitutilities.py' 2023-06-26 00:15:07 +03:00
0dc2bd3950 Delete 'README.md' 2023-06-26 00:15:01 +03:00
ede83eeb8e Optimised reverse method (I have proofs of speed) (I have been slightly mistaken). 2023-06-25 22:57:12 +03:00
2 changed files with 88 additions and 17 deletions

View File

@@ -1,22 +1,42 @@
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):
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)
@@ -45,3 +65,45 @@ def get_memory(variable_name: str) -> list[bool]:
return [True if character == "1" else False for character in input_chars]
else:
print(f"[ERROR] The {variable_name} may contain only 1-s and 0-s!")
def binary_sum(first_term: BasicRegister, second_term: BasicRegister, return_remainder: bool = False)\
-> BasicRegister | tuple[BasicRegister, int]:
"""
Sums two registers' values.
:param BasicRegister first_term: First register.
:param BasicRegister second_term: Second register.
:param bool return_remainder: True to return the tuple, False to return just the register.
:return: Register containing the sum or the tuple containing the register and carried radix.
:rtype: BasicRegister | tuple[BasicRegister, int]
"""
size_a = len(first_term)
size_b = len(second_term)
required_size = max(size_a, size_b)
a = first_term
b = second_term
if size_a != size_b:
a = a.adjusted_by_size(required_size)
b = b.adjusted_by_size(required_size)
c = BasicRegister([False] * required_size)
carry = False
for i in range(required_size - 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)
final_bit_sum = a.memory[0] + b.memory[0] + carry
carry = bool(final_bit_sum & 2)
c.memory[0] = bool(final_bit_sum & 1)
if return_remainder:
return c, carry
else:
return c

35
main.py
View File

@@ -1,22 +1,31 @@
from bitutilities import *
import bitutilities as bu
import timeit
if __name__ == '__main__':
reg: BasicRegister = BasicRegister(get_memory("memory"))
# print(type(reg))
reg: bu.BasicRegister = bu.BasicRegister(bu.get_memory("memory"))
print("\nRegister:")
print()
print("Register 1:")
print(reg)
print("\nReversed:")
reg.reverse()
print(reg)
print()
reg2: bu.BasicRegister = bu.BasicRegister(bu.get_memory("more memory"))
print("\nShifted left:")
print([int(value) for value in reg.left_shift()])
print(reg)
print()
print("Register 2:")
print(reg2)
print("\nShifted right:")
print([int(value) for value in reg.right_shift()])
print(reg)
print()
reg3: bu.BasicRegister = bu.binary_sum(reg, reg2)
print()
print("Sum:")
print(reg3)
carry_sum_test: tuple[bu.BasicRegister, int] = bu.binary_sum(reg, reg2, True)
print()
print("Sum & carry:")
# print(type(carry_sum_test))
print(carry_sum_test)