Subtree memorization / reactive templates (#488)
This commit adds subtree memoization to Dioxus. Subtree memoization is basically a compile-time step that drastically reduces the amount of work the diffing engine needs to do at runtime by extracting non-changing nodes out into a static "template." Templates are then understood by the various renderers in the ecosystem as a faster way of rendering the same items. For example, in the web, templates are simply a set of DOM Nodes created once and then cloned later. This is the same pattern frameworks like Lithtml and SolidJS use to achieve near-perfect performance. Subtree memoization adds an additional level of complexity to Dioxus. The RSX macro needs to be much smarter to identify changing/nonchanging nodes and generate a mapping between the Template and its runtime counterparts. This commit represents a working starter point for this work, adding support for templates for the web, desktop, liveview, ssr, and native-core renderers. In the future we will try to shrink code generation, generally improve performance, and simplify our implementation.
This commit is contained in:
1 parent
b32fd2d2cd
commit
047ed1e553
80 files changed
+6774
-2552
No files matched your search
@@ -34,7 +34,10 @@ impl<'a> Iterator for ElementIdIterator<'a> {
|
||||
if let Some((count, node)) = self.stack.last_mut() {
|
||||
match node {
|
||||
// We can only exit our looping when we get "real" nodes
|
||||
VNode::Element(_) | VNode::Text(_) | VNode::Placeholder(_) => {
|
||||
VNode::Element(_)
|
||||
| VNode::Text(_)
|
||||
| VNode::Placeholder(_)
|
||||
| VNode::TemplateRef(_) => {
|
||||
// We've recursed INTO an element/text
|
||||
// We need to recurse *out* of it and move forward to the next
|
||||
// println!("Found element! Returning it!");
|
||||
@@ -81,3 +84,44 @@ impl<'a> Iterator for ElementIdIterator<'a> {
|
||||
returned_node
|
||||
}
|
||||
}
|
||||
|
||||
/// This intentionally leaks once per element name to allow more flexability when hot reloding templetes
|
||||
#[cfg(all(any(feature = "hot-reload", debug_assertions), feature = "serde"))]
|
||||
mod leaky {
|
||||
use std::sync::Mutex;
|
||||
|
||||
use fxhash::FxHashSet;
|
||||
use once_cell::sync::Lazy;
|
||||
static STATIC_CACHE: Lazy<Mutex<FxHashSet<&'static str>>> =
|
||||
Lazy::new(|| Mutex::new(FxHashSet::default()));
|
||||
|
||||
pub fn deserialize_static_leaky<'de, D>(d: D) -> Result<&'static str, D::Error>
|
||||
where
|
||||
D: serde::Deserializer<'de>,
|
||||
{
|
||||
use serde::Deserialize;
|
||||
let s = <&str>::deserialize(d)?;
|
||||
Ok(if let Some(stat) = STATIC_CACHE.lock().unwrap().get(s) {
|
||||
*stat
|
||||
} else {
|
||||
Box::leak(s.into())
|
||||
})
|
||||
}
|
||||
|
||||
pub fn deserialize_static_leaky_ns<'de, D>(d: D) -> Result<Option<&'static str>, D::Error>
|
||||
where
|
||||
D: serde::Deserializer<'de>,
|
||||
{
|
||||
use serde::Deserialize;
|
||||
Ok(<Option<&str>>::deserialize(d)?.map(|s| {
|
||||
if let Some(stat) = STATIC_CACHE.lock().unwrap().get(s) {
|
||||
*stat
|
||||
} else {
|
||||
Box::leak(s.into())
|
||||
}
|
||||
}))
|
||||
}
|
||||
}
|
||||
|
||||
#[cfg(all(any(feature = "hot-reload", debug_assertions), feature = "serde"))]
|
||||
pub use leaky::*;
|
||||
Reference in new issue
Block a user