Fast F#: Mapping Domain to Indexes 

Great video as always! I'm really interested in this topic. Would love to hear you discuss it more, for example: how to manage live cycles and retain cache locality, tradeoffs between reusing an index vs. other techniques.

If you're still curious about if there is an existing name for this kind of pattern, in Data Science/Machine Learning it's called One Hot Encoding.

At 19:31 what happens in your ChickenIndex module's last line (n * 1)? What is this called?

6:06 "Instead of using the raw chicken..." 😆

How can the integers be used for something useful in the engine code - they don't have any data - do you end up packing some data into high bits of the integers or something similar?

Aren't we going to have same performance issues when we need to back and forward from chicken to index and then back? Is it easier if our chicken would have Id for example?

Have you ever tried to use marshalling/native memory management? It might help even more with the performance. You need to define struktural layout for each record/struct type, then you can read, write and use indirect typed pointers to them. If you know the number og can compute the number of elements you will use in a computation you can bulk allocate continues memory for them up front and place them there and free the memory once afterwards. This way you can handle when and how the memory are allocated and deallocated..

Great video as always, loved your topological sort and dictionary series. Looking forward to some more long run content!