dioxus/packages/web
Demonthos 047ed1e553
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.
2022-09-30 12:03:06 -07:00
..
.vscode fix: setnode method for rehydration code 2022-03-17 10:51:23 -04:00
examples Subtree memorization / reactive templates (#488) 2022-09-30 12:03:06 -07:00
src Subtree memorization / reactive templates (#488) 2022-09-30 12:03:06 -07:00
tests Less clumsy configuration for desktop and mobile (#553) 2022-09-13 16:22:27 -07:00
BUGS.md polish: examples 2021-09-24 00:05:56 -04:00
Cargo.toml Subtree memorization / reactive templates (#488) 2022-09-30 12:03:06 -07:00
CHANGELOG.md feat: add changelogs 2022-01-29 10:17:14 -05:00
README.md wip: enable more diffing 2021-07-05 01:11:49 -04:00

Dioxus-Web

Build interactive user experiences directly in the web browser!

Dioxus-web provides a WebsysRenderer for the Dioxus Virtual Dom that handles events, progresses components, and updates the actual DOM using web-sys methods.

Web-specific Optimizations

  • Uses string interning of all common node types
  • Optimistically interns short strings
  • Builds trees completely before mounting them