Using a Parallel Word Count to Find the End of a Sequence

The search criterion could actually be anything right. The interesting cases are the one where i say like hey find find all of the places in this sequence that satisfy this criterion and then give me their locations. With this type of reduction you can in a single pass a single paralyzable pass you can do that searchYeah i mean what's with the simpler problem before you added the locations  what's awesome about your solution is that the once you do the adjacent transform and you have your diffs you can you can use it to slice up sequences.