Week 14 Assignment SDEV-350 Java Programming II © Champlain College Assignment This week, we will implement a HashMap with a GUI interface. Requirements  Your GUI may not appear exactly as the sample...

javafx 8 hash mapping. Please see attached PDF. Referend files are in the source.zip


Week 14 Assignment SDEV-350 Java Programming II © Champlain College Assignment This week, we will implement a HashMap with a GUI interface. Requirements  Your GUI may not appear exactly as the sample above. However, it should have all of the components/nodes shown  Create a GUI that will allow an entry of a name and corresponding age into a HashMap  As in the GUI (above), your program should have two TextAreas for display purposes  Utilize the following code from Chapter 27: o MyMap.java interface (Listing 27.1) o MyHashMap.java subclass (Listing 27.2)  The Enter button: o Inserts a key (Name) and a value (Age) from the appropriate TextFields into a HashMap o Displays the Name and Age in the right TextArea once entered (See screen shots) o Displays a message in the left TextArea (See screen shots) o Sets focus to the Name TextField  The Find button: o Searches the HashMap for a key entered into the Name TextField o Displays a message in the left TextArea (See screen shots) o Sets focus to the Name TextField  The Remove button: o Removes an entry from the HashMap whose key (entered into the Name TextField) matches the Name o Updates the Right TextArea (See screen shots) o Displays a message in the left TextArea (See screen shots) o Sets focus to the Name TextField JavaFX Hashing Week 14 Assignment SDEV-350 Java Programming II © Champlain College  The Clear button: o Clears both TextAreas, the HashMap, and any other user entry fields if applicable (See screen shots) o Sets focus to the Name TextField  The Exit button closes the program  Validation/Exception handling where appropriate should inform the user of: o No value entered when the Enter button is pressed (Name OR Age missing) o No value entered when the Remove or Find buttons are pressed (Name missing) o An empty HashMap when searching or removing values when the HashMap is empty o A key value is not found (for Find or Remove button clicks) o Others when/where appropriate  This assignment covers subjects from Chapter 1 - 27 Hints Sample code is readily available in this week’s lecture material as well as the text book and Internet. If you find code on the Internet that you believe might assist, make sure you give proper credit to the source. Make sure that you utilize the most efficient algorithm that you can. Expected Output You have creative freedom with this assignment. Your result is not required to appear exactly as the sample above or screen shots below. However; it must contain all of the same components and include the functionality described above and below in the screen shot examples. Your GUI must also be visually appealing with consistent spacing/gapping. You do not have to incorporate an image in this assignment unless you wish. Deliverables Please zip your program and submit the zip file by the due date listed in the requirements. Screen Shots: (Next page) Week 14 Assignment SDEV-350 Java Programming II © Champlain College After 7 entries. Results shown are after Mary Ann was added to the HashMap After searching for a known entry (Linda) Week 14 Assignment SDEV-350 Java Programming II © Champlain College After Jim was removed from the HashMap After the Clear Button was clicked source/MyHashMap.class public synchronized class MyHashMap implements MyMap { private static int DEFAULT_INITIAL_CAPACITY; private static int MAXIMUM_CAPACITY; private int capacity; private static float DEFAULT_MAX_LOAD_FACTOR; private float loadFactorThreshold; private int size; java.util.LinkedList[] table; static void (); public void MyHashMap(); public void MyHashMap(int); public void MyHashMap(int, float); public void clear(); public boolean containsKey(Object); public boolean containsValue(Object); public java.util.Set entrySet(); public Object get(Object); public boolean isEmpty(); public java.util.Set keySet(); public Object put(Object, Object); public void remove(Object); public int size(); public java.util.Set values(); private int hash(int); private static int supplementalHash(int); private int trimToPowerOf2(int); private void removeEntries(); private void rehash(); public String toString(); } source/MyHashMap.java source/MyHashMap.java import java.util.LinkedList; public class MyHashMap implements MyMap {   // Define the default hash table size. Must be a power of 2   private static int DEFAULT_INITIAL_CAPACITY = 4;      // Define the maximum hash table size. 1 < 30 is same as 2^30   private static int maximum_capacity ="">< 30;    =""   // current hash table capacity. capacity is a power of 2=""   private int capacity;=""   =""   // define default load factor=""   private static float default_max_load_factor =" 0.75f; "   // specify a load factor used in the hash table=""   private float loadfactorthreshold; =""      =""   // the number of entries in the map=""   private int size =" 0; "   =""   // hash table is an array with each cell that is a linked list=""><>>[] table;   /** Construct a map with the default capacity and load factor */   public MyHashMap() {       this(DEFAULT_INITIAL_CAPACITY, DEFAULT_MAX_LOAD_FACTOR);       }      /** Construct a map with the specified initial capacity and     * default load factor */   public MyHashMap(int initialCapacity) {      this(initialCapacity, DEFAULT_MAX_LOAD_FACTOR);       }      /** Construct a map with the specified initial capacity     * and load factor */   public MyHashMap(int initialCapacity, float loadFactorThreshold) {      if (initialCapacity > MAXIMUM_CAPACITY)       this.capacity = MAXIMUM_CAPACITY;     else       this.capacity = trimToPowerOf2(initialCapacity);          this.loadFactorThreshold = loadFactorThreshold;         table = new LinkedList[capacity];   }      @Override /** Remove all of the entries from this map */    public void clear() {     size = 0;     removeEntries();   }   @Override /** Return true if the specified key is in the map */   public boolean containsKey(K key) {         if (get(key) != null)       return true;     else       return false;   }      @Override /** Return true if this map contains the value */    public boolean containsValue(V value) {     for (int i = 0; i < capacity; i++) {       if (table[i] !=" null) {"><>> bucket = table[i];          for (Entry entry: bucket)           if (entry.getValue().equals(value))              return true;       }     }          return false;   }      @Override /** Return a set of entries in the map */   public java.util.Set<>> entrySet() {     java.util.Set<>> set =        new java.util.HashSet<>();          for (int i = 0; i < capacity; i++) {       if (table[i] !=" null) {"><>> bucket = table[i];          for (Entry entry: bucket)           set.add(entry);        }     }          return set;   }   @Override /** Return the value that matches the specified key */   public V get(K key) {     int bucketIndex = hash(key.hashCode());     if (table[bucketIndex] != null) {       LinkedList<>> bucket = table[bucketIndex];        for (Entry entry: bucket)         if (entry.getKey().equals(key))            return entry.getValue();     }          return null;   }      @Override /** Return true if this map contains no entries */   public boolean isEmpty() {     return size == 0;   }        @Override /** Return a set consisting of the keys in this map */   public java.util.Set keySet() {     java.util.Set set = new java.util.HashSet<>();          for (int i = 0; i < capacity; i++) {       if (table[i] !=" null) {"><>> bucket = table[i];          for (Entry entry: bucket)           set.add(entry.getKey());        }     }          return set;   }          @Override /** Add an entry (key, value) into the map */   public V put(K key, V value) {     if (get(key) != null) { // The key is already in the map       int bucketIndex = hash(key.hashCode());       LinkedList<>> bucket = table[bucketIndex];        for (Entry entry: bucket)         if (entry.getKey().equals(key)) {           V oldValue = entry.getValue();           // Replace old value with new value           entry.value = value;            // Return the old value for the key           return oldValue;         }     }        // Check load factor     if (size >= capacity * loadFactorThreshold) {       if (capacity == MAXIMUM_CAPACITY)         throw new RuntimeException("Exceeding maximum capacity");              rehash();     }          int bucketIndex = hash(key.hashCode());          // Create a linked list for the bucket if it is not created     if (table[bucketIndex] == null) {       table[bucketIndex] = new LinkedList<>>();     }     // Add a new entry (key, value) to hashTable[index]     table[bucketIndex].add(new MyMap.Entry(key, value));     size++; // Increase size          return value;     }      @Override /** Remove the entries for the specified key */   public void remove(K key) {     int bucketIndex = hash(key.hashCode());          // Remove the first entry that matches the key from a bucket     if (table[bucketIndex] != null) {       LinkedList<>> bucket = table[bucketIndex];        for (Entry entry: bucket)         if (entry.getKey().equals(key)) {           bucket.remove(entry);           size--; // Decrease size           break; // Remove just one entry that matches the key         }     }   }      @Override /** Return the number of entries in this map */   public int size() {     return size;   }      @Override /** Return a set consisting of the values in this map */   public java.util.Set values() {     java.util.Set set = new java.util.HashSet<>();          for (int i = 0; i < capacity; i++) {       if (table[i] !=" null) {"><>> bucket = table[i];          for (Entry entry: bucket)           set.add(entry.getValue());        }     }          return set;   }      /** Hash function */   private int hash(int hashCode) {     return supplementalHash(hashCode) & (capacity - 1);   }      /** Ensure the hashing is evenly distributed */   private static int supplementalHash(int h) {     h ^= (h >>> 20) ^ (h >>> 12);     return h ^ (h >>> 7) ^ (h >>> 4);   }   /** Return a power of 2 for initialCapacity */   private int trimToPowerOf2(int initialCapacity) {     int capacity = 1;     while (capacity < initialcapacity) {><= 1;     }=""     =""     return capacity;=""   }=""   =""   /** remove all entries from each bucket */=""   private void removeentries() {=""     for (int i ="">< capacity; i++) {       if (table[i] !=" null) {"         table[i].clear();=""       }=""     }=""   }=""   =""   /** rehash the map */=""   private void rehash() {=""><>> set = entrySet(); // Get entries     capacity <= 1;   double capacity    =""     table =" new LinkedList[capacity]; // Create a new hash table"     size =" 0; // Reset size to 0"     =""> entry: set) {       put(entry.getKey(), entry.getValue()); // Store to new table     }   }   @Override   public String toString() {     StringBuilder builder = new StringBuilder("[");          for (int i = 0; i < capacity; i++) {       if (table[i] !=" null && table[i].size() "> 0)          for (Entry entry: table[i])           builder.append(entry);     }          builder.append("]");     return builder.toString();   } } source/MyMap$Entry.class public synchronized class MyMap$Entry { Object key; Object value; public void MyMap$Entry(Object, Object); public Object getKey(); public Object getValue(); public String toString(); } source/MyMap.class public abstract interface MyMap { public abstract void clear(); public abstract boolean containsKey(Object); public abstract boolean containsValue(Object); public abstract java.util.Set entrySet(); public abstract Object get(Object); public abstract boolean isEmpty(); public abstract java.util.Set keySet(); public abstract Object put(Object, Object); public abstract void remove(Object); public abstract int size(); public abstract java.util.Set values(); } source/MyMap.java source/MyMap.java public interface MyMap {   /** Remove all of the entries from this map */    public void clear();      /** Return true if the specified key is in the map */   public boolean containsKey(K key);      /** Return true if this map contains the specified value */    public boolean containsValue(V value);   /** Return a set of entries in the map */   public java.util.Set<>> entrySet();   /** Return the first value that matches the specified key */   public V get(K key);      /** Return true if this map contains no entries */   public boolean isEmpty();   /** Return a set consisting of the keys in this map */   public java.util.Set keySet();      /** Add an entry (key, value) into the map */   public V put(K key, V value);   /** Remove the entries for the specified key */   public void remove(K key);   /** Return the number of mappings in this map */   public int size();   /** Return a set consisting of the values in this map */   public java.util.Set values();      /** Define inner class for Entry */   public static class Entry {     K key;     V value;          public Entry(K key, V value) {       this.key = key;       this.value = value;     }          public K getKey() {       return key;     }          public V getValue() {       return value;     }          @Override     public String toString() {       return "[" + key + ", " + value + "]";     }   } }