programming-talkscurated list on GitHubRecommends
Under “JavaScript”
Immutable Data and React 00:31:10 by **Lee Byron** (2015)
0:00 / 0:00
#immutable.js#react#persistentdatastructures
React.js Conf 2015 - Immutable Data and React
Meta Developers
311K subscribers • 8 videos on Hallway
- Recommended by 6 people: 5 on Hacker News and 1 curated list.
- A classic. People kept recommending it from 2015 to 2022.
- Presented by Lee Byron, Facebook
- May be out of date. Uploaded 11 years ago, in an area where tools change fast.
Intermediate. Assumes working knowledge.
158K views11 years ago6 recommendations
Web developmentSoftware designReactVue, Svelte, Angular and othersFunctional programming
Lee Byron explains how persistent immutable data structures work and how they enable high-performance rendering and state management in React.
Lee Byron, Facebook Immutable data unlocks powerful memoization techniques and prohibits accidental coupling via shared mutable state. It's no accident that these are the the same benefits provided by React. Persistent data structures provide the benefits of immutability while maintaining high performance reads and writes and present a familiar API. Learn about how persistent immutable data structures work, and techniques for using them in your React applications with Immutable.js, a library of fully persistent immutable data structures.Why it's here
6 people recommend thisWhat people say. Highly recommended as a foundational talk explaining the performance benefits of immutability and the mechanics of persistent data structures.
netgustoon Hacker News • Recommends
On “Hamsa – A simple data-binding and observable model”
IMHO, one-way data flow + immutability competes with (beats ?) observed mutations in many use cases. See link to this video , and more specifically link to this video
victorcaseon Hacker News • Recommends
On “Immutable.js: An Introduction with examples written for humans”
@diegorbaquero you should watch that link to this video . The author spoke about performance and immutability-data structures like Directional Acyclic Graphs and Trie.
clay_to_non Hacker News • Recommends
On “Build Yourself a Redux”
For anyone interested, there's a great conference talk on this topic by Lee Byron from Facebook: link to this video
icc97on Hacker News • Recommends
On “Git is a purely functional data structure (2013)”
I found the explanation from the Immutable JS presentation easier to understand when talking about Immutable data structures 0 0: link to this video
jamesgpearceon Hacker News • Recommends
On “Ask HN: Best dev tool pitches of all time?”
Lee Byron on Immutable/React/Flux: link to this video “I only have a minute left, which is more than enough time to build the undo stack”
icc97on Hacker News • Mentions
On “Modern JavaScript for Ancient Web Developers”
I attacked the modern Javascript approach through first focusing on functional programming. 1. Python + functional programming in Python Python is hardly a pure functional language, but it's lovely and simple and has all the core concepts including list comprehensions. This leads you on to... 2. Haskell If you want to find a pure functional solution to a Python problem, first search for the Haskell one and translate it. Then read Learn You a Haskell 0 which was the funniest programming book I ever read and almost, almost taught me about monads (I had it for a second, then tried to explain it in Python and all was lost) Now you can relax cause the hard bit is done. 3. Read Javascript the Go…
fypon Hacker News • Mentions
On “Reasons to Learn Redux as a JavaScript Developer”
…sert/delete/update to any particular index will only cost around sizeOfNode * numParents=32 * log_32(n). This comes with a cost that indexing is now log_32(n) but it's usually a fair price to pay. In javascript, immutable.js implement these same ideas (as least according to these talks where they talk about index tries and hash array mapped tries: link to this video ) If you want native support, javascript engines are actually free to swap out their implementation of arrays! I know they already do depending on whether they think your array is sparse("holey") or not: link . I also vaguely recall someone saying that unshift (push to front) is automatically optimized by switching to a deque/circular buf…