mirror of
https://github.com/bjornbytes/lovr.git
synced 2024-07-04 13:33:34 +00:00
Nodes can have either a transform matrix, or decomposed transform properties, but never both. Using a union means we can store both of those variants in the same piece of memory, using the existing matrix boolean to figure out which one to use. This reduces the size of the struct by 48 bytes (152 -> 104), which ends up speeding up some model operations, I'm guessing due to the CPU cache. |
||
---|---|---|
.. | ||
audio | ||
data | ||
event | ||
filesystem | ||
graphics | ||
headset | ||
math | ||
physics | ||
thread | ||
timer |