MobX and the unique symbiosis of predictability and speed
summary
Walks through concrete implementation: builds observable boxes and an autorun that links getters to effects, replaces React memo with observer and shows UI rerenders drop to only impacted nodes. Demonstrates computed values suspend when unused and that action batches updates, turning three noisy recomputations into a single one, and explains the topological sort that guarantees minimal, correctly ordered recomputation.
AI-written summary · about
chapters (5)
- 0:00Start
- 4:44PURE FUNCTIONS
- 9:23REACTIVE PROGRAMMING
- 16:29WAYS TO OPTIMIZE LINES
- 24:47OPTIMIZING RENDER
