Fixed warnings and refactored some code

README.md

@@ -1,4 +1,19 @@
-# UnificationTable
+# disjoint-set
+
+## Introduction
+The disjoint-set, also known as union-find, is a data structure that efficiently supports set union and find operations. It is widely used in various fields such as graph algorithms, type inference, and equivalence class management, and plays a key role in compiler implementation (e.g., for type unification and region analysis).
+
+## Features
+
+- Implements the classic union-find algorithm with path compression and union by rank.
+- Supports set initialization, union, and finding the representative element (find).
+- Supports dynamic elements (no need to pre-allocate the total number of elements).
+- Optionally supports persistent (versioned) structures or undo operations.
+- Optionally implements a "value merging" feature (e.g., for unifying types).
+- Designed with a clean API for easy use in scenarios like compiler implementation, graph algorithms, and region analysis.
+
+## Example
+### UnificationTable
 
 > **Note:** Snapshot operations should follow a stack-like (LIFO) order.  
 > A root snapshot is required for snapshot operations.  
@@ -7,7 +22,7 @@
 ```moonbit
 ///|
 test "UnificationTable::union_test" {
-  let table = new(capacity=5)
+  let table = UnificationTable::new(capacity=5)
   for i in 0..<5 {
     table.push(i)
   }
@@ -23,12 +38,12 @@ test "UnificationTable::union_test" {
 }
 ```
 
-# Snapshot
+### Snapshot
 
 ```moonbit
 ///|
 test "UnificationTable::snapshot_unite_test" {
-  let table = new(capacity=5)
+  let table = UnificationTable::new(capacity=5)
   let _ = table.start_snapshot()
   for i in 0..<5 {
     table.push(i)
@@ -47,4 +62,7 @@ test "UnificationTable::snapshot_unite_test" {
   assert_false!(table.unioned(index1, index3))
   assert_false!(table.unioned(index2, index1))
 }
-```
+```
+
+# Reference
+[ena](https://github.com/rust-lang/ena)