nanomorph

nanomorph

Hyper fast diffing algorithm for real DOM nodes :zap:

Usage

const nanomorph = require('nanomorph')
const html = require('bel')

var tree = html`<div>hello people</div>`
tree = nanomorph(html`<div>nanananana-na-no</div>`, tree)
tree = nanomorph(html`<div>teeny, tiny, tin bottle</div>`, tree)

Appending to the DOM

const updateDom = require('nanomorph/update-dom')
const html = require('bel')

// create the initial tree, save it and append to DOM
const tree = html`<div>hello people</div>`
const update = updateDom(tree)
document.body.appendChild(tree)

// now each consecutive update will be rendered on the DOM
update(html`<div>hello people</div>`, tree)
update(html`<div>nanananana-na-no</div>`, tree)

API

tree = nanomorph(newTree, oldTree)

Diff a tree of HTML elements against another tree of HTML elements and create a patched result that can be applied on the DOM.

FAQ

Why are you building this?

Experimentin' is fun - all this is is a take on seeing how small we can get with real DOM node diffing. And if we can make some good heuristics happen for efficient tree updates (Merkle trees, anyone?) that'd be nice.

Should I use this right now?

No, probably not but if you do it'll probably be the fastest thing ever. Seriously, I doubt this could be made a lot faster than it is right now, unless we're talking edge cases. But yeah, alright go ahead if you like.

Installation

$ npm install nanomorph

See Also

• morphdom
• yo-yo
• bel
• nanoraf
• choo
• set-dom
• min-document
• how to write your own virtual dom 1
• how to write your own virtual dom 2

License

MIT