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-08-24 00:57:14 +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,181 @@
+/*
+ * File: hash_map_open_addressing.rs
+ * Created Time: 2023-07-16
+ * Author: WSL0809 (wslzzy@outlook.com), night-cruise (2586447362@qq.com)
+ */
+#![allow(non_snake_case)]
+#![allow(unused)]
+
+mod array_hash_map;
+
+use array_hash_map::Pair;
+
+/* Hash table with open addressing */
+struct HashMapOpenAddressing {
+    size: usize,                // Number of key-value pairs
+    capacity: usize,            // Hash table capacity
+    load_thres: f64,            // Load factor threshold for triggering expansion
+    extend_ratio: usize,        // Expansion multiplier
+    buckets: Vec<Option<Pair>>, // Bucket array
+    TOMBSTONE: Option<Pair>,    // Removal marker
+}
+
+impl HashMapOpenAddressing {
+    /* Constructor */
+    fn new() -> Self {
+        Self {
+            size: 0,
+            capacity: 4,
+            load_thres: 2.0 / 3.0,
+            extend_ratio: 2,
+            buckets: vec![None; 4],
+            TOMBSTONE: Some(Pair {
+                key: -1,
+                val: "-1".to_string(),
+            }),
+        }
+    }
+
+    /* Hash function */
+    fn hash_func(&self, key: i32) -> usize {
+        (key % self.capacity as i32) as usize
+    }
+
+    /* Load factor */
+    fn load_factor(&self) -> f64 {
+        self.size as f64 / self.capacity as f64
+    }
+
+    /* Search for bucket index corresponding to key */
+    fn find_bucket(&mut self, key: i32) -> usize {
+        let mut index = self.hash_func(key);
+        let mut first_tombstone = -1;
+        // Linear probing, break when encountering an empty bucket
+        while self.buckets[index].is_some() {
+            // If key is found, return corresponding bucket index
+            if self.buckets[index].as_ref().unwrap().key == key {
+                // If deletion marker was encountered before, move key-value pair to that index
+                if first_tombstone != -1 {
+                    self.buckets[first_tombstone as usize] = self.buckets[index].take();
+                    self.buckets[index] = self.TOMBSTONE.clone();
+                    return first_tombstone as usize; // Return the moved bucket index
+                }
+                return index; // Return bucket index
+            }
+            // Record the first removal marker encountered
+            if first_tombstone == -1 && self.buckets[index] == self.TOMBSTONE {
+                first_tombstone = index as i32;
+            }
+            // Calculate bucket index, wrap around to the head if past the tail
+            index = (index + 1) % self.capacity;
+        }
+        // If key does not exist, return the index for insertion
+        if first_tombstone == -1 {
+            index
+        } else {
+            first_tombstone as usize
+        }
+    }
+
+    /* Query operation */
+    fn get(&mut self, key: i32) -> Option<&str> {
+        // Search for bucket index corresponding to key
+        let index = self.find_bucket(key);
+        // If key-value pair is found, return corresponding val
+        if self.buckets[index].is_some() && self.buckets[index] != self.TOMBSTONE {
+            return self.buckets[index].as_ref().map(|pair| &pair.val as &str);
+        }
+        // If key-value pair does not exist, return null
+        None
+    }
+
+    /* Add operation */
+    fn put(&mut self, key: i32, val: String) {
+        // When load factor exceeds threshold, perform expansion
+        if self.load_factor() > self.load_thres {
+            self.extend();
+        }
+        // Search for bucket index corresponding to key
+        let index = self.find_bucket(key);
+        // If key-value pair is found, overwrite val and return
+        if self.buckets[index].is_some() && self.buckets[index] != self.TOMBSTONE {
+            self.buckets[index].as_mut().unwrap().val = val;
+            return;
+        }
+        // If key-value pair does not exist, add the key-value pair
+        self.buckets[index] = Some(Pair { key, val });
+        self.size += 1;
+    }
+
+    /* Remove operation */
+    fn remove(&mut self, key: i32) {
+        // Search for bucket index corresponding to key
+        let index = self.find_bucket(key);
+        // If key-value pair is found, overwrite it with removal marker
+        if self.buckets[index].is_some() && self.buckets[index] != self.TOMBSTONE {
+            self.buckets[index] = self.TOMBSTONE.clone();
+            self.size -= 1;
+        }
+    }
+
+    /* Expand hash table */
+    fn extend(&mut self) {
+        // Temporarily store the original hash table
+        let buckets_tmp = self.buckets.clone();
+        // Initialize expanded new hash table
+        self.capacity *= self.extend_ratio;
+        self.buckets = vec![None; self.capacity];
+        self.size = 0;
+
+        // Move key-value pairs from original hash table to new hash table
+        for pair in buckets_tmp {
+            if pair.is_none() || pair == self.TOMBSTONE {
+                continue;
+            }
+            let pair = pair.unwrap();
+
+            self.put(pair.key, pair.val);
+        }
+    }
+    /* Print hash table */
+    fn print(&self) {
+        for pair in &self.buckets {
+            if pair.is_none() {
+                println!("null");
+            } else if pair == &self.TOMBSTONE {
+                println!("TOMBSTONE");
+            } else {
+                let pair = pair.as_ref().unwrap();
+                println!("{} -> {}", pair.key, pair.val);
+            }
+        }
+    }
+}
+
+/* Driver Code */
+fn main() {
+    /* Initialize hash table */
+    let mut hashmap = HashMapOpenAddressing::new();
+
+    /* Add operation */
+    // Add key-value pair (key, value) to the hash table
+    hashmap.put(12836, "Xiao Ha".to_string());
+    hashmap.put(15937, "Xiao Luo".to_string());
+    hashmap.put(16750, "Xiao Suan".to_string());
+    hashmap.put(13276, "Xiao Fa".to_string());
+    hashmap.put(10583, "Xiao Ya".to_string());
+
+    println!("\nAfter adding is complete, hash table is\nKey -> Value");
+    hashmap.print();
+
+    /* Query operation */
+    // Input key into hash table to get value val
+    let name = hashmap.get(13276).unwrap();
+    println!("\nInput student ID 13276, found name {}", name);
+
+    /* Remove operation */
+    // Remove key-value pair (key, val) from hash table
+    hashmap.remove(16750);
+    println!("\nAfter removing 16750, hash table is\nKey -> Value");
+    hashmap.print();
+}