From 11669bb62fe21c373ef511f8ebb329fa99422e9d Mon Sep 17 00:00:00 2001 From: yichuan-w Date: Wed, 20 Aug 2025 17:31:12 -0700 Subject: [PATCH] update readme --- README.md | 15 +++++++++++++-- 1 file changed, 13 insertions(+), 2 deletions(-) diff --git a/README.md b/README.md index 132ea6a..bf8282f 100755 --- a/README.md +++ b/README.md @@ -176,8 +176,7 @@ response = chat.ask("How much storage does LEANN save?", top_k=1) LEANN supports RAG on various data sources including documents (`.pdf`, `.txt`, `.md`), Apple Mail, Google Search History, WeChat, and more. -**AST-Aware Code Chunking** - LEANN also features intelligent code chunking that preserves semantic boundaries (functions, classes, methods) for Python, Java, C#, and TypeScript files, providing improved code understanding compared to traditional text-based approaches. -πŸ“– Read the [AST Chunking Guide β†’](docs/ast_chunking_guide.md) to learn more. + ### Generation Model Setup @@ -477,6 +476,15 @@ Once the index is built, you can ask questions like: ### πŸš€ Claude Code Integration: Transform Your Development Workflow! +
+NEW!! AST‑Aware Code Chunking + +LEANN features intelligent code chunking that preserves semantic boundaries (functions, classes, methods) for Python, Java, C#, and TypeScript, improving code understanding compared to text-based chunking. + +πŸ“– Read the [AST Chunking Guide β†’](docs/ast_chunking_guide.md) + +
+ **The future of code assistance is here.** Transform your development workflow with LEANN's native MCP integration for Claude Code. Index your entire codebase and get intelligent code assistance directly in your IDE. **Key features:** @@ -697,6 +705,9 @@ MIT License - see [LICENSE](LICENSE) for details. Core Contributors: [Yichuan Wang](https://yichuan-w.github.io/) & [Zhifei Li](https://github.com/andylizf). +Active Contributors: [Gabriel Dehan](https://github.com/gabriel-dehan) + + We welcome more contributors! Feel free to open issues or submit PRs. This work is done at [**Berkeley Sky Computing Lab**](https://sky.cs.berkeley.edu/).