Query-Based Incremental Computation Engine

QBICE is an asynchronous incremental computation framework for Rust. Define your computation as a graph of queries, and QBICE automatically determines what needs to be recomputed when inputs change—minimizing redundant work through intelligent caching and dependency tracking.

For detailed documentation, examples, and API reference, please visit:

• docs.rs/qbice — Full API documentation with examples
• crates.io/crates/qbice — Package information
• Tutorials and Guides — Step-by-step tutorials and advanced topics

• Incremental Computation — Only recomputes what's necessary when inputs change
• Async-First Design — Built on Tokio for efficient concurrent execution
• Cycle Detection — Automatically detects and handles cyclic dependencies
• Type-Safe — Strongly-typed queries with associated value types
• Thread-Safe — Safely share the engine across multiple threads
• Visualization — Generate interactive HTML dependency graphs

This project is licensed under the MIT License - see the LICENSE file for details.

QBICE is inspired by:

• Salsa — A generic framework for on-demand, incrementalized computation
• Adapton — A library for incremental computing