Document the dispatch_tree feature for O(n) to O(len) lookup

2 files changed, 3 insertions, 1 deletions

diff --git a/CHANGELOG.md b/CHANGELOG.md
index e4adeff..583766d 100644
--- a/CHANGELOG.md
+++ b/CHANGELOG.md
@@ -35,6 +35,8 @@ fn proc(prev: HelloEntry) -> ChainProcess<ThisProgram> {
 }
 ```
 
+3. **\[mingling\]** Added the `dispatch_tree` feature. When enabled, it will automatically generate a prefix tree, improving the command lookup efficiency from O(n) to O(len)
+
 #### **BREAKING CHANGES**:
 None
 
diff --git a/README.md b/README.md
index 019ee2a..e272cc0 100644
--- a/README.md
+++ b/README.md
@@ -252,7 +252,7 @@ You can read the following docs to learn more about the `Mingling` framework:
 - [x] \[[0.1.7](https://docs.rs/mingling/0.1.7/mingling/)\] Clap Parser Support
 - [x] core: \[[0.1.7](https://docs.rs/mingling/0.1.7/mingling/)\] Help System
 - [x] mling: \[[0.1.7](https://docs.rs/mingling/0.1.7/mingling/)\] Mingling-CLI Tool ( `mling` )
-- [ ] core: \[**0.1.8**\] Compile-Time Dispatcher Tree
+- [X] core: \[[0.1.8](https://docs.rs/mingling/0.1.8/mingling/)\] Compile-Time Dispatcher Tree
 - [ ] \[**0.1.9**\] Helpdoc Generation
 - [ ] core: \[**0.1.9**\] Debug Toolkits ( `InvokeStackDisplay` )
 - [ ] core: \[**0.2.0**\] REPL Mode ( `program.exec_repl();` )