5 Commits

Author SHA1 Message Date
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
6 changed files with 117 additions and 161 deletions

View File

@@ -1,16 +0,0 @@
[package]
name = "rust_tests"
version = "0.1.0"
edition = "2021"
# See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html
[profile.release]
opt-level = 'z' # Optimize for size
lto = true # Enable link-time optimization
codegen-units = 1 # Reduce number of codegen units to increase optimizations
panic = 'abort' # Abort on panic
strip = true # Strip symbols from binary*
[dependencies]
text_io = "0.1.12"

View File

@@ -0,0 +1,3 @@
# binaryCalculatorPrototype
This is a Python language prototype for a binary calculator to be used in Computer Arithmetics lab works for first-year students studying Computer Engineering at KPI.

86
bitutilities.py Normal file
View File

@@ -0,0 +1,86 @@
from collections import deque
class BasicRegister:
"""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 __str__(self) -> str:
return f"Memory: {[int(value) for value in self.memory]}"
def reverse(self):
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)
shifted_radices: deque[bool] = deque([self.memory.popleft() for _i in range(steps_shifted)])
return shifted_radices
def right_shift(self, digit_to_fill: bool = False, steps_shifted: int = 1) -> deque[bool]:
self.memory.extendleft([digit_to_fill] * steps_shifted)
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]:
"""
Reads user input to be used as a memory array.
:param str variable_name: The name to be displayed in the input line.
:return: A list of boolean values read from user.
:rtype: list[bool]
"""
while True:
input_chars: list[str] = list(input(f"Enter {variable_name}: "))
if all(character in ["0", "1"] for character in input_chars):
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 sum(a_original: BasicRegister, b_original: BasicRegister) -> BasicRegister:
"""
Sums two registers' values.
:param BasicRegister a: First register.
:param BasicRegister b: Second register.
:return: Register containing the result.
:rtype: BasicRegister
"""
size_a = len(a_original.memory)
size_b = len(b_original.memory)
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)
else:
a = a_original
b = b_original
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)
final_bit_sum = a.memory[0] + b.memory[0] + carry
c.memory[0] = bool(final_bit_sum & 1)
return c

28
main.py Normal file
View File

@@ -0,0 +1,28 @@
from bitutilities import *
import timeit
if __name__ == '__main__':
reg: BasicRegister = BasicRegister(get_memory("memory"))
# print(type(reg))
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)

View File

@@ -1,101 +0,0 @@
use std::fmt;
use std::fmt::Formatter;
fn capitalise(s: &str) -> String {
let mut c = s.chars();
match c.next() {
None => String::new(),
Some(f) => f.to_uppercase().collect::<String>() + c.as_str(),
}
}
/// A basic register capable of storing binary data.
#[derive(Debug)]
pub struct BasicRegister {
/// A [Vec] that stores the binary data of the register.
memory: Vec<bool>,
}
impl BasicRegister {
pub fn l_shift(&mut self) {
let mut res: Vec<bool> = vec![false; self.memory.len()];
res[..(self.memory.len() - 1)]
.copy_from_slice(&self.memory[1..((self.memory.len() - 1) + 1)]);
self.memory = res;
}
pub fn r_shift(&mut self) {
let mut res: Vec<bool> = vec![false; self.memory.len()];
for i in (1..self.memory.len()).rev() {
res[i] = self.memory[i - 1];
}
self.memory = res;
}
pub fn reverse(&mut self) {
self.memory = self.memory.iter().map(|val| !val).collect();
}
pub fn new(memory: Vec<bool>) -> Self {
Self { memory }
}
}
impl Default for BasicRegister {
fn default() -> Self {
Self {
memory: vec![false],
}
}
}
impl fmt::Display for BasicRegister {
fn fmt(&self, f: &mut Formatter<'_>) -> fmt::Result {
write!(f, "Memory: [")?;
for (count, v) in self.memory.iter().enumerate() {
if count != 0 {
write!(f, ", ")?;
}
write!(f, "{}", *v as u8)?;
}
write!(f, "]")
}
}
fn read_vec(variable_name: &str) -> Vec<char> {
loop {
print!("Enter {variable_name}: ");
let input: String = text_io::read!("{}\n");
match input.chars().all(|c| c == '1' || c == '0') {
true => return input.chars().collect(),
false => eprintln!(
"[ERROR] {} may contain only 1-s and 0-s with no whitespaces!",
capitalise(variable_name)
),
}
}
}
pub fn char_to_bool_vector(char_vector: Vec<char>) -> Vec<bool> {
let mut bool_vector: Vec<bool> = Vec::new();
for value in char_vector.iter() {
match value {
'0' => bool_vector.push(false),
'1' => bool_vector.push(true),
_ => (),
}
}
bool_vector
}
pub fn get_memory(variable_name: &str) -> Vec<bool> {
char_to_bool_vector(read_vec(variable_name))
}

View File

@@ -1,44 +0,0 @@
#[allow(dead_code)]
mod bit_utilities;
use bit_utilities::*;
// use text_io::read;
fn main() {
let mut reg = BasicRegister::new(get_memory("your number"));
// let mut reg: BasicRegister = Default::default();
println!("\nRegister:");
println!("{}", reg);
println!("\nShifted right:");
reg.r_shift();
println!("{}", reg);
println!("\nShifted left:");
reg.l_shift();
println!("{}", reg);
println!("\nReversed:");
reg.reverse();
println!("{}", reg);
// println!("{}", true);
// println!("{}", true);
// let a: i8 = read!();
// println!("{} {0:b}", a);
// println!("{} {0:b}", a >> 1);
// println!("{} {0:b}", a << 1);
// println!("{} {0:b}", !a);
// println!("{}", '3'.to_digit(2).unwrap());
// let f_text = format!("{a:b}").chars().collect::<Vec<char>>();
// println!("{:?}", f_text);
// println!("{:?}", char_to_bool_vector(f_text.clone()));
// let b: BasicRegister = BasicRegister::new(char_to_bool_vector(f_text));
// b.print_register();
// println!("{:?}", get_memory(format!("{a:b}")));
// println!("{:?}", a.split(" ").collect::<Vec<&str>>());
// a = text_io::read!("{}\n");
// println!("{a}")
}