Immutability, interactivity & JavaScript

on YouTube ↗26m

" summary

Claims that JavaScript engines' fast mutation enables persistent Vectors built from trees of arrays, with a 32-branching bitmapped vector trie that reaches ~34 billion indices in seven hops and updates by cloning only seven arrays. Implements this approach in Om (ClojureScript) + React and exposes it to JS via Mori library. Demonstrations: undo/redo for a todo app in a handful of lines, a 64×64 pixel editor with fast previews, and a memory test showing 1,000 saved frames as ~1.7 MB instead of ~210 MB.

AI-written summary · about

" chapters (6)

1. 0:00Start
2. 7:46Functional Programming and Data
3. 9:40Sharing structure
4. 9:56Phil Bagwell
5. 10:12Bitmapped Vector Trie
6. 11:03Persistent Vector

" related talks

• 33mImmutable data structures for functional JSAnjana Vakil · RuhrJS 2017
• 27mImmutable data structures for functional JSAnjana Vakil · JSConf EU 2017
• 45mJavaScript Immutability - "Don't Go Changing"Mark Volkmann · Jfokus 2016
• 54mClojurescript and Om - Pragmatic functional programming in the Javascript LandVagmi Mudumbai · Functional Conf 2014
• 31mImmutable Data and ReactLee Byron · React.js Conf 2015
• 41mThe ReactJS LandscapeLuke VanderHart · Clojure/West 2015
• 24mmö.js - explaining js vm in jsVyacheslav Egorov · JSConf EU 2012
• 36mRelevance of ClojureScriptJearvon Dharrie · Strange Loop 2015