Interesting. Use case is so that there is some code exercising this path. While the algorithm is cool, of course, the code itself is quite straightforward as i

Interesting. Use case is so that there is some code exercising this path. While the algorithm is cool, of course, the code itself is quite straightforward as it is. An interesting thing I didn’t know is that the kernel code avoids recursion (this one has a depth parameter to prevent recursion past some point). I can see why this was picked as a candidate. Straightforward implementation. Good test suite. Self-contained and not a moving target. Lots of the code is using the coefficients array against the framecontext but I don’t know how to enforce the bounds invariant that the two are the same. For the fixed size arrays I could see how it’s done, but otherwise it seems like the bounds checker will trigger. But I’m reading on my phone so maybe that’s just a misread. Not a big performance hit even if it does. But perhaps it doesn’t, and I’d be curious why.