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-07-08 21:46:06 +00:00 · 2025-12-31 07:44:52 +08:00
parent 45e1295241
commit 2778a6f9c7
1284 changed files with 71557 additions and 3275 deletions
@@ -0,0 +1,142 @@
+/**
+ * File: hash_map_chaining.js
+ * Created Time: 2023-08-06
+ * Author: yuan0221 (yl1452491917@gmail.com)
+ */
+
+/* Key-value pair Number -> String */
+class Pair {
+    constructor(key, val) {
+        this.key = key;
+        this.val = val;
+    }
+}
+
+/* Hash table with separate chaining */
+class HashMapChaining {
+    #size; // Number of key-value pairs
+    #capacity; // Hash table capacity
+    #loadThres; // Load factor threshold for triggering expansion
+    #extendRatio; // Expansion multiplier
+    #buckets; // Bucket array
+
+    /* Constructor */
+    constructor() {
+        this.#size = 0;
+        this.#capacity = 4;
+        this.#loadThres = 2.0 / 3.0;
+        this.#extendRatio = 2;
+        this.#buckets = new Array(this.#capacity).fill(null).map((x) => []);
+    }
+
+    /* Hash function */
+    #hashFunc(key) {
+        return key % this.#capacity;
+    }
+
+    /* Load factor */
+    #loadFactor() {
+        return this.#size / this.#capacity;
+    }
+
+    /* Query operation */
+    get(key) {
+        const index = this.#hashFunc(key);
+        const bucket = this.#buckets[index];
+        // Traverse bucket, if key is found, return corresponding val
+        for (const pair of bucket) {
+            if (pair.key === key) {
+                return pair.val;
+            }
+        }
+        // If key is not found, return null
+        return null;
+    }
+
+    /* Add operation */
+    put(key, val) {
+        // When load factor exceeds threshold, perform expansion
+        if (this.#loadFactor() > this.#loadThres) {
+            this.#extend();
+        }
+        const index = this.#hashFunc(key);
+        const bucket = this.#buckets[index];
+        // Traverse bucket, if specified key is encountered, update corresponding val and return
+        for (const pair of bucket) {
+            if (pair.key === key) {
+                pair.val = val;
+                return;
+            }
+        }
+        // If key does not exist, append key-value pair to the end
+        const pair = new Pair(key, val);
+        bucket.push(pair);
+        this.#size++;
+    }
+
+    /* Remove operation */
+    remove(key) {
+        const index = this.#hashFunc(key);
+        let bucket = this.#buckets[index];
+        // Traverse bucket and remove key-value pair from it
+        for (let i = 0; i < bucket.length; i++) {
+            if (bucket[i].key === key) {
+                bucket.splice(i, 1);
+                this.#size--;
+                break;
+            }
+        }
+    }
+
+    /* Expand hash table */
+    #extend() {
+        // Temporarily store the original hash table
+        const bucketsTmp = this.#buckets;
+        // Initialize expanded new hash table
+        this.#capacity *= this.#extendRatio;
+        this.#buckets = new Array(this.#capacity).fill(null).map((x) => []);
+        this.#size = 0;
+        // Move key-value pairs from original hash table to new hash table
+        for (const bucket of bucketsTmp) {
+            for (const pair of bucket) {
+                this.put(pair.key, pair.val);
+            }
+        }
+    }
+
+    /* Print hash table */
+    print() {
+        for (const bucket of this.#buckets) {
+            let res = [];
+            for (const pair of bucket) {
+                res.push(pair.key + ' -> ' + pair.val);
+            }
+            console.log(res);
+        }
+    }
+}
+
+/* Driver Code */
+/* Initialize hash table */
+const map = new HashMapChaining();
+
+/* Add operation */
+// Add key-value pair (key, value) to the hash table
+map.put(12836, 'Xiao Ha');
+map.put(15937, 'Xiao Luo');
+map.put(16750, 'Xiao Suan');
+map.put(13276, 'Xiao Fa');
+map.put(10583, 'Xiao Ya');
+console.log('\nAfter adding is complete, hash table is\nKey -> Value');
+map.print();
+
+/* Query operation */
+// Input key into hash table to get value
+const name = map.get(13276);
+console.log('\nInput student ID 13276, query name ' + name);
+
+/* Remove operation */
+// Remove key-value pair (key, value) from hash table
+map.remove(12836);
+console.log('\nAfter removing 12836, hash table is\nKey -> Value');
+map.print();