feat(maps): implement clear method for hashMap and treeMap

Author: amejiarosario

src/data-structures/maps/hash-maps/hash-map.js

@@ -31,7 +31,9 @@ class HashMap {
   }
 
   /**
-   * Reset or reinitialize all values on the hashmap. Used for rehashing.
+   * Reset or reinitialize all values on the hashmap.
+   *
+   * Used for rehashing, clear and initializing the map.
    *
    * @param {array} buckets - New bucket.
    * @param {number} size - The new size of the hashmap.
@@ -282,6 +284,13 @@ class HashMap {
   get length() {
     return this.size;
   }
+
+  /**
+   * Removes all key/value pairs from the Map object.
+   */
+  clear() {
+    this.reset();
+  }
 }
 
 // Aliases

src/data-structures/maps/hash-maps/hash-map.spec.js

@@ -265,7 +265,7 @@ describe('HashMap Tests', () => {
       hashMap.delete('All About That Bass');
       hashMap.set('All About That Bass', 'Meghan Trainor');
       expect(hashMap.keysTrackerIndex).toBe(12);
-      // should hava a hole
+      // should have a hole
       expect(hashMap.keysTrackerArray).toEqual(['Pineapple', 'Despacito', 'Bailando', 'Dura', 'Lean On', 'Hello',
         undefined,
         'Wake Me Up', 'Brother', 'Faded', 'The Spectre', 'All About That Bass']);

src/data-structures/maps/map.spec.js

@@ -138,5 +138,19 @@ mapImplementations.forEach((MapImplementation) => {
         ]);
       });
     });
+
+    describe('#clear', () => {
+      beforeEach(() => {
+        map.set(1, 2);
+        map.set(2, 'dos');
+        map.set(3, 3);
+      });
+
+      it('should work', () => {
+        expect(map.size).toBe(3);
+        expect(map.clear()).toEqual();
+        expect(map.size).toBe(0);
+      });
+    });
   });
 });

src/data-structures/maps/tree-maps/tree-map.js

@@ -133,6 +133,13 @@ class TreeMap {
       yield [node.value, node.data()];
     }
   }
+
+  /**
+   * Removes all key/value pairs from the Map object.
+   */
+  clear() {
+    this.tree = new Tree();
+  }
 }
 
 // Aliases