C++ Standard Transform Reduce With a Parallel Algorithm Policy

In APL and BQN you can think about two solutions to the same problem. The first is a transform where it's taking in three input sequences. And then that returns you whether or not all three of those consecutive elements are are odd. Then there's a third solution which is basically turn everything once again into zeros, ones one being an even or a true and false is. You could also do this wouldn't be as performant but do a slide or an adjacent which looks at three at a time turns those into bullions or ones and just checks for each other. In spirit like this now covers kind of two of the solutions. So you encoded the second solution in a