working version

diff --git a/Robust/src/Benchmarks/SingleTM/Genome/ByteString.java b/Robust/src/Benchmarks/SingleTM/Genome/ByteString.java
index 7f956af2bb48ed18edfdd10468d1a41889c7a68d..d8f0c783794ba0fbdc7701625121c4cfe746599c 100644 (file)
--- a/Robust/src/Benchmarks/SingleTM/Genome/ByteString.java
+++ b/Robust/src/Benchmarks/SingleTM/Genome/ByteString.java
@@ -165,7 +165,9 @@ public class ByteString {
       byte c = value[index+off];
       hash = c + (hash << 6) + (hash << 16) - hash;
     }
-    cachedHashcode=hash<0?-hash:hash;
+    if (hash<0)
+      hash=-hash;
+    cachedHashcode=hash;
     return hash;
   }
 

diff --git a/Robust/src/Benchmarks/SingleTM/Genome/Table.java b/Robust/src/Benchmarks/SingleTM/Genome/Table.java
index 653728f76af43f5b70b50a32b66c5d1fcc3d2665..f7c7674dbb61c908ed0b4d57eafcc651f879c3a4 100644 (file)
--- a/Robust/src/Benchmarks/SingleTM/Genome/Table.java
+++ b/Robust/src/Benchmarks/SingleTM/Genome/Table.java
@@ -1,5 +1,4 @@
 public class Table {
-
     LinkedList buckets[];
     int numBucket;
 
@@ -10,16 +9,11 @@ public class Table {
      * =============================================================================
      */
     Table (int myNumBucket) {
-    
-      int i;
-
       buckets = new LinkedList[myNumBucket];
-      for(i = 0; i < myNumBucket; i++) {
+      for(int i = 0; i < myNumBucket; i++) {
         buckets[i] = new LinkedList();      
       }
-
       numBucket = myNumBucket;
-      
     }
 
 
@@ -29,8 +23,8 @@ public class Table {
      * =============================================================================
      */
     boolean table_insert (int hash, Object dataPtr) {
-      int i = (int)(hash % numBucket);
-      if(i < 0) i *= -1;
+      int i = hash % numBucket;
+      if (i<0) i=-i;
       if(buckets[i].contains(dataPtr)) {
         return false;
       }
@@ -44,16 +38,13 @@ public class Table {
      * =============================================================================
      */
     boolean table_remove (int hash, Object dataPtr) {
-    
-      int i = (int)(hash % numBucket);
+      int i = (hash % numBucket);
+      if (i<0) i=-i;
       boolean tempbool = buckets[i].contains(dataPtr);
       if (tempbool) {
           buckets[i].remove(dataPtr);
           return true;
       }
-
       return false;
-    
     }
-
 }