The Odin Project - Hash Map Assignment

All the magic is in the console.

This HashMap implementations uses a simple hash provided by The Odin Project to store key/value pairs. The initial capacity is `16` and expands at `capacity = capacity*2;` as the load exceeds `0.75`. It also has collision protection, and its values are stored in the custom implementation of LinkedList from the previous Odin Project assignment.

Create a new HashMap with

new HashMap()

or use one of the premade LinkedLists

window.hmA = [ ['apple', 'red'], ['banana', 'yellow'], ['carrot', 'orange'], ['dog', 'brown'], ['elephant', 'gray'], ['frog', 'green'], ['grape', 'purple'], ['hat', 'black'], ['ice cream', 'white'], ['jacket', 'blue'], ['kite', 'pink'], ['lion', 'golden'] ] 
window.hmB = [['Carlos', 'CarlosNameTag'], ['Carla', 'CarlaNameTag'], ['Alex', 'AlexNameTag']]];

Interact with a HashMap via the following methods:

• set(key, value) - set a key/value pair to be stored in the HashMap
• get(key) - returns the value associated with `key` or `null`
• has(key) - returns true if the `key` exists in the HashMap
• remove(key) - removes the key/value pair associated with `key`, returns true if the value existed, false if it did not
• length() - returns the number of stored `key`s
• clear() - clears the HashMap
• keys() - returns an array of all `key`
• values() - returns an array of all `value`
• entries() - returns an array containing an array containing each key/value pair as a 2-element array -- [[firstKey, firstValue], [secondKey, secondValue], ... ]