https://github.com/storycraft/reactive
Experimental zero cost(no_std, no_alloc) declarative fine grained reactivity system
https://github.com/storycraft/reactive
Last synced: 3 months ago
JSON representation
Experimental zero cost(no_std, no_alloc) declarative fine grained reactivity system
- Host: GitHub
- URL: https://github.com/storycraft/reactive
- Owner: storycraft
- License: apache-2.0
- Created: 2025-02-05T13:47:35.000Z (4 months ago)
- Default Branch: main
- Last Pushed: 2025-02-27T07:38:05.000Z (3 months ago)
- Last Synced: 2025-02-27T10:22:46.039Z (3 months ago)
- Language: Rust
- Homepage:
- Size: 329 KB
- Stars: 3
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE-APACHE
Awesome Lists containing this project
README
# Tbd
Experimental zero cost declarative fine grained reactivity system
## Safety requirement
Due to lack of drop guarantee in Rust, it can be unsound if the effect is leaked.
This is same limitation as scoped task.
It's unsafe to manually poll boxed future containing effects and leaking it.
You can't have undefined behaviour by using well defined executors(like tokio or async_std) and future combinators
## How it works
* `DependencyTracker`: 1 pointer sized main reactive primitive wrapping Intrusive linked list. Which contains start pointer to `Binding`
* `Binding`: Node of `DependencyTracker`. Unlinked on drop. Each node contains pointer to `Effect`'s queue node
* `Effect`: Contains constant number of bindings(Each one for depending `DependencyTracker`) and a node which can be linked to a queue
* `Queue`: Lazily evaluated effect queue. Evaluate queued effects and provides an asynchronous interface.
1. `DependencyTracker`s are created and pinned
2. `Effect`s are created, pinned, initialized and evaluate the effect closure once
3. During evaluation, each `Binding`s are attached to a corresponding `DependencyTracker`
4. When a value changes, corresponding `DependencyTracker` is notified.
5. Notified `DependencyTracker` traverses linked `Binding` nodes, link the `Effect` node to the `Queue` and clear the list
6. `Waker` in the `Queue` notify upper `Executor` when nodes are added
7. On next poll, the `Queue` pops first linked node, run effect closure. Repeat until there is no nodes left in the queue
See `crates/example-app` for more complex example
> [!NOTE]
> Number of required bindings are calculated in compile time(using macro).
## License
The project is dual-licensed under Apache-2.0 and MIT.