Radix tree implementations for prefix matching and cache-aware routing.
This module provides radix tree data structures that mirror SGLang's scheduler memory management patterns. Two implementations are available:
- [
StringTree]: Character-based tree for HTTP router (text input) - [
TokenTree]: Token-based tree for gRPC router (pre-tokenized input)
Both implementations support:
- Multi-tenant prefix tracking with LRU eviction
- Concurrent access via DashMap and RwLock
- Efficient prefix matching with match counts