summaryrefslogtreecommitdiff
path: root/src/main/scala/com/nsrddyn/cpu/ALU/Hash.scala
diff options
context:
space:
mode:
Diffstat (limited to 'src/main/scala/com/nsrddyn/cpu/ALU/Hash.scala')
-rw-r--r--src/main/scala/com/nsrddyn/cpu/ALU/Hash.scala31
1 files changed, 0 insertions, 31 deletions
diff --git a/src/main/scala/com/nsrddyn/cpu/ALU/Hash.scala b/src/main/scala/com/nsrddyn/cpu/ALU/Hash.scala
deleted file mode 100644
index 9dc5a98..0000000
--- a/src/main/scala/com/nsrddyn/cpu/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)
-
- }
-}