build

en/docs/chapter_hashing/hash_algorithm.md

@@ -594,6 +594,18 @@ The design of hash algorithms is a complex issue that requires consideration of
     }
     ```
 
+=== "Ruby"
+
+    ```ruby title="simple_hash.rb"
+    [class]{}-[func]{add_hash}
+
+    [class]{}-[func]{mul_hash}
+
+    [class]{}-[func]{xor_hash}
+
+    [class]{}-[func]{rot_hash}
+    ```
+
 === "Zig"
 
     ```zig title="simple_hash.zig"

en/docs/chapter_hashing/hash_collision.md

@@ -1426,6 +1426,12 @@ The code below provides a simple implementation of a separate chaining hash tabl
     }
     ```
 
+=== "Ruby"
+
+    ```ruby title="hash_map_chaining.rb"
+    [class]{HashMapChaining}-[func]{}
+    ```
+
 === "Zig"
 
     ```zig title="hash_map_chaining.zig"
@@ -3072,6 +3078,12 @@ The code below implements an open addressing (linear probing) hash table with la
     }
     ```
 
+=== "Ruby"
+
+    ```ruby title="hash_map_open_addressing.rb"
+    [class]{HashMapOpenAddressing}-[func]{}
+    ```
+
 === "Zig"
 
     ```zig title="hash_map_open_addressing.zig"

en/docs/chapter_hashing/hash_map.md

@@ -1697,6 +1697,14 @@ The following code implements a simple hash table. Here, we encapsulate `key` an
     }
     ```
 
+=== "Ruby"
+
+    ```ruby title="array_hash_map.rb"
+    [class]{Pair}-[func]{}
+
+    [class]{ArrayHashMap}-[func]{}
+    ```
+
 === "Zig"
 
     ```zig title="array_hash_map.zig"