Halfway there just need an extra push any suggestions. public class Chaining { s

Question

Halfway there just need an extra push any suggestions.

public class Chaining {

   static class Node {
       Object key;
       Object value;
Node next;
};

static public class HashTable {
       Node [] buckets = new Node[10];
       int size;
       final double threshold = 0.75;

       public void print() {
           for (int i = 0; i < buckets.length; ++i) {
               System.out.print(String.format("%4d : ", i));
        Node current = buckets[i];
               while (current != null) {
                   System.out.print("->");
                   System.out.print(current.key);
                   System.out.print(":");
                   System.out.print(current.value);
                   current = current.next;
               }
               System.out.println();
           }      
       }

       public Object insert(Object key, Object value) {
           int code = key.hashCode();
int index = code % this.size;
  
  
  

           //TODO insert the new object.
  
           //TODO: if the load factor exceeds this.threshold,
           // then double the capacity of the table

           //If the key was already in the table, just change
           //the value and return the previouse value
          
           return null; //TODO: <--- replace that!
       }

          
       private Node find(Object key) {
           //TODO: return a node that satisfies node.value.equals(key)
           // or return null if the key is not in the table
  
      
  
  

return null;
          
       }

       public double loadFactor() {
           return 0.0; //TODO:<-- replace that
       }

       public Object get(Object key, Object defaultValue) {
           //TODO: if the key is in the table, return it. Else return defaultvalue.
           return null;
       }

       public Object get(Object key) {
           return this.get(key, null);
       }

       public boolean contains(Object key) {
           return find(key) != null;
       }

       private void resize(int newsize) {
           Node[] oldbuckets = this.buckets;
           this.buckets = new Node[newsize];
           this.size = 0;
          
           for (Node bucket: oldbuckets) {
               Node current = bucket;
               while (current != null){
                   insert(current.key, current.value);
                   current = current.next;
               }
           }
       }

   }

   public static void main(String[] args) {
       java.util.Scanner s = new java.util.Scanner(System.in);
       HashTable table = new HashTable();

      
       //-->Whenever there is an = sign on the line, we split the
       // line into a key and value and insert into the table
       //-->Whenever there is NOT an = sign, we lookup the entire
       // line as a key.
       while (s.hasNextLine()){
           String line = s.nextLine();
           if (line.contains("=")) {
               String[] kv = line.split("=");
               String key = kv[0].trim();
               String value = kv[1];
               String last = (String)table.insert(key, value);
              
               System.out.println("----------------");
               System.out.print("inserted "+key + ":" + value);
               if (last != null){
                   System.out.print(" returned previous value of " + last);
               }
               System.out.println();
               System.out.println("----------------");          
               table.print();
           } else {
               String key = line.trim();
               System.out.println("----------------");
               System.out.print("Looking up " + key);
               String value = (String)table.get(key);
               System.out.print(" found " + value);
               System.out.println();
               System.out.println("----------------");
           }
       }  
      
   }

}

Explanation / Answer

//I think the following 2 methods will help.

//PM me if you need more help.

//Cheers

//This is the Get Method

     public Object get(Object key, Object defaultValue) {
           int i =0;
           int k =0;
           while(i<this.size){
               if(buckets[i].value == key){
                   k = i;
                   i = this.size;
                   return key;                 
               }
               else{
                   i++;
               }
           }
           if(i == this.size && buckets[k].value != key){
                return null;  
           }
           else{
               return key;
           }          
       }

//This is the insert function

       public Object insert(Object key, Object value) {
           int code = key.hashCode();
        double index = code % this.size;
        if(index < threshold){
            resize(2*this.size);
        }
        for(int i = 0 ; i<10; i++){
            if(buckets[i].next == null){
                buckets[i].next. key = key;
                buckets[i].next.value = value;
            }
            else if(buckets[i].key == key){
                Object value1 = buckets[i].value;
                buckets[i].value = value;
                return value1;
            }
        }

Related Questions

Navigate

• Browse (All)
• Browse H
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.