Compose an operator's ordering with a derived walk: the SAME steps, with the kernel slots
refilled in the override's order and every insert step left at its derived index.
An override naming a kernel the derived walk does not carry contributes nothing (there is no
slot to put it in), and a kernel the walk carries that the override does not name keeps its
relative position among the leftovers — so this is total for any input and can never return a
list of a different length from the one it was given. That matters because the result goes
straight to mixerSetStripChainOrder, where a dropped step is a stage that stops running.
Compose an operator's ordering with a derived walk: the SAME steps, with the kernel slots refilled in the override's order and every insert step left at its derived index.
An override naming a kernel the derived walk does not carry contributes nothing (there is no slot to put it in), and a kernel the walk carries that the override does not name keeps its relative position among the leftovers — so this is total for any input and can never return a list of a different length from the one it was given. That matters because the result goes straight to
mixerSetStripChainOrder, where a dropped step is a stage that stops running.