This is an implementation of a hash map. Hash maps or hash tables are data structures that implement an unordered associative array. This simply means that it maps a key on to a value to create a [key,value] pairing. This paring is also known as a dictionary. With this data structure, you can search for a value with it's associated key, which acts as the index of the pairing.
This program has the following features:
hashthat takes a value and produces a has code with it.setwhich takes two arguments [key, value], where value is assigned to key. If key already exists, then the old value is overwritten.gettakes one argument as key and returns value that is assigned to the key. If key not found, return null.hasthat takes a key as an argument and returns true or false based on whether or not is in the hash map.removewhich takes a key as an argument and removes it from the hash table.lengthwho returns the number of stored keys in th hash map.clearwhich removes all entries in the hash map.keysthat returns an array containing all the keys inside the hash mapvalueswhich returns an array containing all the values.entriesthat returns an array that contains each key/value pair.