updated both

Author: Wakidur Rahaman

src/course-master-the-coding/data-structures/hash-tables/hash-tables-03.js

@@ -39,7 +39,7 @@ var HashTableMain = /** @class */ (function () {
     /**
      * keys
      */
-    HashTableMain.prototype.keys = function () {
+    HashTableMain.prototype.keysOld = function () {
         var keysArray = [];
         console.log(this.data.length);
         for (var i = 0; i < this.data.length; i++) {
@@ -52,6 +52,28 @@ var HashTableMain = /** @class */ (function () {
         }
         return keysArray;
     };
+    HashTableMain.prototype.keys = function () {
+        if (!this.data.length) {
+            return undefined;
+        }
+        var result = [];
+        // loop through all the elements
+        for (var i = 0; i < this.data.length; i++) {
+            // if it's not an empty memory cell
+            if (this.data[i] && this.data[i].length) {
+                // but also loop through all the potential collisions
+                if (this.data.length > 1) {
+                    for (var j = 0; j < this.data[i].length; j++) {
+                        result.push(this.data[i][j][0]);
+                    }
+                }
+                else {
+                    result.push(this.data[i][0]);
+                }
+            }
+        }
+        return result;
+    };
     return HashTableMain;
 }());
 // Example
@@ -64,3 +86,24 @@ myHashTable01.set('banana', 'Nice foots');
 myHashTable01.get('banana');
 myHashTable01.keys();
 console.log(myHashTable01.data);
+console.log(myHashTable01.keys());
+/**
+ *
+ *
+ *
+ [
+  [
+    [ 'a', 'Nice foots' ],
+    [ 'b', 'Nice foots' ],
+    [ 'c', 'Nice foots' ],
+    [ 'd', 'Nice foots' ],
+    [ 'e', 'Nice foots' ],
+    [ 'f', 'Nice foots' ],
+    [ 'g', 'Nice foots' ]
+  ],
+  <2 empty items>,
+  [ [ 'grapes', 10000 ], [ 'banana', 'Nice foots' ] ],
+  <5 empty items>,
+  [ [ 'apples', 9 ] ]
+]
+ */

src/course-master-the-coding/data-structures/hash-tables/hash-tables-03.ts

@@ -44,7 +44,7 @@ class HashTableMain {
   /**
    * keys
    */
-  public keys(): (number | string)[] {
+  public keysOld(): (number | string)[] {
     const keysArray: (number | string)[] = [];
     console.log(this.data.length);
     for (let i = 0; i < this.data.length; i++) {
@@ -57,6 +57,28 @@ class HashTableMain {
     }
     return keysArray;
   }
+
+  public keys(): undefined | (string | [string, string | number])[] {
+    if (!this.data.length) {
+      return undefined;
+    }
+    let result: (string | [string, string | number])[] = [];
+    // loop through all the elements
+    for (let i = 0; i < this.data.length; i++) {
+      // if it's not an empty memory cell
+      if (this.data[i] && this.data[i].length) {
+        // but also loop through all the potential collisions
+        if (this.data.length > 1) {
+          for (let j = 0; j < this.data[i].length; j++) {
+            result.push(this.data[i][j][0]);
+          }
+        } else {
+          result.push(this.data[i][0]);
+        }
+      }
+    }
+    return result;
+  }
 }
 
 // Example
@@ -69,3 +91,25 @@ myHashTable01.set('banana', 'Nice foots');
 myHashTable01.get('banana');
 myHashTable01.keys();
 console.log(myHashTable01.data);
+console.log(myHashTable01.keys());
+
+/**
+ * 
+ * 
+ * 
+ [
+  [
+    [ 'a', 'Nice foots' ],
+    [ 'b', 'Nice foots' ],
+    [ 'c', 'Nice foots' ],
+    [ 'd', 'Nice foots' ],
+    [ 'e', 'Nice foots' ],
+    [ 'f', 'Nice foots' ],
+    [ 'g', 'Nice foots' ]
+  ],
+  <2 empty items>,
+  [ [ 'grapes', 10000 ], [ 'banana', 'Nice foots' ] ],
+  <5 empty items>,
+  [ [ 'apples', 9 ] ]
+]
+ */