From 5c90505fe7b6566049bead5e36a5e3f73d844413 Mon Sep 17 00:00:00 2001
From: nasr <nsrddyn@gmail.com>
Date: Wed, 26 Nov 2025 23:11:25 +0100
Subject: chore: file refactor, imported zio

next steps are running the threads multithreaded  and measuring for
errors
---
 src/main/scala/com/nsrddyn/ALU/Hash.scala | 31 -------------------------------
 1 file changed, 31 deletions(-)
 delete mode 100644 src/main/scala/com/nsrddyn/ALU/Hash.scala

(limited to 'src/main/scala/com/nsrddyn/ALU/Hash.scala')

diff --git a/src/main/scala/com/nsrddyn/ALU/Hash.scala b/src/main/scala/com/nsrddyn/ALU/Hash.scala
deleted file mode 100644
index 9dc5a98..0000000
--- a/src/main/scala/com/nsrddyn/ALU/Hash.scala
+++ /dev/null
@@ -1,31 +0,0 @@
-package com.nsrddyn.alu
-
-import scala.util.hashing
-
-class Hash {
-
-import scala.util.hashing.MurmurHash3
-
-  def run(word: String, loopSize: Int): Unit = {
-
-    /* TODO: implement ALU friendly, so high speed hashing
-     * to continuously loop over voor stressing 
-     * ALU 
-     *
-     * While looking for hashing algorithmes to implement I stumbled on: 
-     * https://scala-lang.org/api/3.x/scala/util/hashing/MurmurHash3$.html
-     *
-     * which is an implemntation of **smasher** http://github.com/aappleby/smhasher
-     * the exact type of hashing algorithm I was looking for
-     *
-     * In the scala description they state: "This algorithm is designed to generate
-     * well-distributed non-cryptographic hashes. It is designed to hash data in 32 bit chunks (ints). "
-     * 
-     * (ints) -> ALU
-     *
-     */ 
-
-     for i <- 0 to loopSize do MurmurHash3.stringHash(word) 
-
-  }
-}
-- 
cgit v1.2.3-70-g09d2