Translate all code to English (#1836)

* Review the EN heading format. * Fix pythontutor headings. * Fix pythontutor headings. * bug fixes * Fix headings in **/summary.md * Revisit the CN-to-EN translation for Python code using Claude-4.5 * Revisit the CN-to-EN translation for Java code using Claude-4.5 * Revisit the CN-to-EN translation for Cpp code using Claude-4.5. * Fix the dictionary. * Fix cpp code translation for the multipart strings. * Translate Go code to English. * Update workflows to test EN code. * Add EN translation for C. * Add EN translation for CSharp. * Add EN translation for Swift. * Trigger the CI check. * Revert. * Update en/hash_map.md * Add the EN version of Dart code. * Add the EN version of Kotlin code. * Add missing code files. * Add the EN version of JavaScript code. * Add the EN version of TypeScript code. * Fix the workflows. * Add the EN version of Ruby code. * Add the EN version of Rust code. * Update the CI check for the English version code. * Update Python CI check. * Fix cmakelists for en/C code. * Fix Ruby comments
2026-04-09 13:51:48 +08:00 · 2025-12-31 07:44:52 +08:00
parent 45e1295241
commit 2778a6f9c7
1284 changed files with 71557 additions and 3275 deletions
--- a/en/codes/javascript/chapter_hashing/array_hash_map.js
+++ b/en/codes/javascript/chapter_hashing/array_hash_map.js
@@ -0,0 +1,128 @@
+/**
+ * File: array_hash_map.js
+ * Created Time: 2022-12-26
+ * Author: Justin (xiefahit@gmail.com)
+ */
+
+/* Key-value pair Number -> String */
+class Pair {
+    constructor(key, val) {
+        this.key = key;
+        this.val = val;
+    }
+}
+
+/* Hash table based on array implementation */
+class ArrayHashMap {
+    #buckets;
+    constructor() {
+        // Initialize array with 100 buckets
+        this.#buckets = new Array(100).fill(null);
+    }
+
+    /* Hash function */
+    #hashFunc(key) {
+        return key % 100;
+    }
+
+    /* Query operation */
+    get(key) {
+        let index = this.#hashFunc(key);
+        let pair = this.#buckets[index];
+        if (pair === null) return null;
+        return pair.val;
+    }
+
+    /* Add operation */
+    set(key, val) {
+        let index = this.#hashFunc(key);
+        this.#buckets[index] = new Pair(key, val);
+    }
+
+    /* Remove operation */
+    delete(key) {
+        let index = this.#hashFunc(key);
+        // Set to null to represent deletion
+        this.#buckets[index] = null;
+    }
+
+    /* Get all key-value pairs */
+    entries() {
+        let arr = [];
+        for (let i = 0; i < this.#buckets.length; i++) {
+            if (this.#buckets[i]) {
+                arr.push(this.#buckets[i]);
+            }
+        }
+        return arr;
+    }
+
+    /* Get all keys */
+    keys() {
+        let arr = [];
+        for (let i = 0; i < this.#buckets.length; i++) {
+            if (this.#buckets[i]) {
+                arr.push(this.#buckets[i].key);
+            }
+        }
+        return arr;
+    }
+
+    /* Get all values */
+    values() {
+        let arr = [];
+        for (let i = 0; i < this.#buckets.length; i++) {
+            if (this.#buckets[i]) {
+                arr.push(this.#buckets[i].val);
+            }
+        }
+        return arr;
+    }
+
+    /* Print hash table */
+    print() {
+        let pairSet = this.entries();
+        for (const pair of pairSet) {
+            console.info(`${pair.key} -> ${pair.val}`);
+        }
+    }
+}
+
+/* Driver Code */
+/* Initialize hash table */
+const map = new ArrayHashMap();
+/* Add operation */
+// Add key-value pair (key, value) to the hash table
+map.set(12836, 'Xiao Ha');
+map.set(15937, 'Xiao Luo');
+map.set(16750, 'Xiao Suan');
+map.set(13276, 'Xiao Fa');
+map.set(10583, 'Xiao Ya');
+console.info('\nAfter adding is complete, hash table is\nKey -> Value');
+map.print();
+
+/* Query operation */
+// Input key into hash table to get value
+let name = map.get(15937);
+console.info('\nInput student ID 15937, query name ' + name);
+
+/* Remove operation */
+// Remove key-value pair (key, value) from hash table
+map.delete(10583);
+console.info('\nAfter removing 10583, hash table is\nKey -> Value');
+map.print();
+
+/* Traverse hash table */
+console.info('\nTraverse key-value pairs Key->Value');
+for (const pair of map.entries()) {
+    if (!pair) continue;
+    console.info(pair.key + ' -> ' + pair.val);
+}
+console.info('\nTraverse keys only Key');
+for (const key of map.keys()) {
+    console.info(key);
+}
+console.info('\nTraverse values only Value');
+for (const val of map.values()) {
+    console.info(val);
+}