Techniques for Wielding Data and Behaviors
summary
Shows concrete code (mostly D with some C++) that builds a mini VMlike command queue and several data/behavior abstractions so you can reproduce them: bit swizzling on 32bit RGBA integers, runtime “var” structs implemented with tagged unions, per-entity function-pointer strategies and component maps, and a bytecode-style instruction stream with up to eight payload arguments. Demonstrates worked examples (GitHub code referenced), notes tradeoffs: full dynamism versus raw native speed and extra bookkeeping for safety.
AI-written summary · about
chapters (11)
- 0:00Welcome
- 1:56Bits and data transformation
- 8:00B to C evolution
- 11:32Data types and bit manipulation
- 15:44Unions and tag unions
- 19:17Object-oriented programming and behaviors
- 23:11Algorithms with function pointers
- 28:51Dynamic data structures
- 36:39Programs as data
- 40:53Virtual machine with bytecode
- 47:55Summary
related talks
01h 02mAdvanced Levelization Techniques (part 2 of 3)
01h 28mModern C++ Design reloaded
59mThe Most Valuable Values
01h 08mRuntime Polymorphism: Back to the Basics
52mBehavioral Programming: Aligning Code with How We Think -
01h 16mPolymorphism, Cohesion, and Coupling in C++
40mLessons from two decades of writing bad code
56m“High Performance Code 201: Hybrid Data Structures"