Wookash Podcast Anton’s Lesson on State Management in C++
Feb 7, 2026
Anton Mikhailov, a software engineer and game-engine developer focused on state management and memory-friendly data structures. He demos a large-arrays-of-things approach and live-coding. Topics include why typical C++ entity designs fail, replacing pointers with indices to avoid invalidation, intrusive lists/trees stored in arrays, slot-map style pools with nil sentinels, and practical trade-offs for performance.
AI Snips
Chapters
Transcript
Episode notes
Large Arrays Of Things Over Classic Entities
- Anton frames the problem as "large arrays of things" to focus on memory layout and state rather than OO entity classes.
- He argues this simpler model reduces tangled callbacks, hidden state, and ownership complexity in small game engines.
Use Indices Instead Of Raw Pointers
- Replace raw pointers with stable integer indices to avoid invalidation when arrays reallocate.
- Use indices to make lifetime and serialization simpler and to survive vector reallocations.
Trade Random Access For Lean Nodes
- Favor forward iteration over random child access; store first-child on parent and next-sibling on child for a lean tree.
- Accept O(n) child traversal for rare operations to keep node size small and cache-friendly.