SymbolTable

starting to implement it.

Author: codelogicws

out/production/Algorithms/ws/codelogic/algorithms/SymbolTable/SymbolTable.class

@@ -0,0 +1,32 @@
+package ws.codelogic.algorithms.SymbolTable;
+
+public class SymbolTable <T>{
+
+    Comparable[] keys;
+    T[] values;
+    int currentIndex = -1;
+
+    public SymbolTable(T[] emptyValuesArray){
+        keys = new Comparable[emptyValuesArray.length];
+        values = emptyValuesArray;
+    }
+
+    public void add(Comparable key, T value){
+        currentIndex ++;
+        keys[currentIndex] = key;
+        values[currentIndex] = value;
+    }
+
+    public T get(Comparable key){
+        for(int i=0;i<keys.length;i++){
+            if(key == keys[i]){
+                return values[i];
+            }
+        }
+        return null;
+    }
+
+    public boolean contains(Comparable key){
+        return get(key) != null;
+    }
+}

out/production/Algorithms/ws/codelogic/algorithms/SymbolTable/SymbolTableTest.class

@@ -0,0 +1,26 @@
+package ws.codelogic.algorithms.SymbolTable;
+
+import org.junit.Before;
+import org.junit.Test;
+import static org.junit.Assert.*;
+
+public class SymbolTableTest {
+
+    private SymbolTable<String> symbolTable;
+
+    @Before
+    public void setUp() {
+        String[] emptyArray = new String[10];
+        symbolTable = new SymbolTable<String>(emptyArray);
+        symbolTable.add(1, "foo");
+        symbolTable.add(2, "bar");
+        symbolTable.add(3, "big");
+        symbolTable.add(4, "boy");
+    }
+
+    @Test
+    public void getElementThatWasStored() {
+        String returned = symbolTable.get(4);
+        assertEquals("boy", returned);
+    }
+}

out/production/Algorithms/ws/codelogic/algorithms/priorityqueue/BinaryTree.class

@@ -69,7 +69,7 @@ public Comparable remove(){
     private void sink(int index){
         while(2*index <= indexOfLastElement){
             int child = 2*index;
-            if(child <= indexOfLastElement && less(child, child + 1)){
+            if(child < indexOfLastElement && less(child, child + 1)){
                 child++;
             }
             if(less(child, index)){

out/production/Algorithms/ws/codelogic/test/TestSuite.class

@@ -4,6 +4,7 @@
 import org.junit.runners.Suite;
 import ws.codelogic.algorithms.Stack.ArrayStackTest;
 import ws.codelogic.algorithms.Stack.LinkStackTest;
+import ws.codelogic.algorithms.SymbolTable.SymbolTableTest;
 import ws.codelogic.algorithms.arithmetic.evaluation.DijkstrasTwoStackTest;
 import ws.codelogic.algorithms.priorityqueue.PriorityQueueTest;
 import ws.codelogic.algorithms.search.SearchTest;
@@ -15,6 +16,7 @@
 
 @RunWith(Suite.class)
 @Suite.SuiteClasses({
+        SymbolTableTest.class,
         PriorityQueueTest.class,
         Dijkstras3WayPartitionTest.class,
         QuickSelectTest.class,