Updates dependencies to latest published crates, including wgpu 0.18 and winit 0.28.

WIP

Have written reduce and scan but not tested

The shaders are mostly written, with some TODOs, but haven't been tested.

Starting to wire up sizes, buffer bindings, etc., in preparation for actually running the pipeline.

The count stage seems to be generating correct output. Next step is wiring up sums.

It seems like reduce works.

Fix some sizing issues, seems to get to top-level scan correctly now.

The prefix sum stages seem to be generating correct output.

This seems to be a working scatter, which means that the core of the algorithm is done. Also just starting to look at performance characteristics. That's why there's a simpler count stage, the huge shared array seemed to be a problem.

The sort pipeline is wired up, and results are close to being sorted, but there are zero elements in the output.

This sorts up to 2^16, but fails at 2^17.

Multisplit appears to work in isolation, we'll see whether that holds up.

It works (and doesn't seem to have the same problem as the scatter from Fidelity), but seems to be a bit slower than that. Perhaps that can be improved (subgroups would obviously help a lot), and it's also possible it would unlock going to 8 bits per pass.

Just iterate all the keys, it's faster. Also suggests a substantial fraction of all time is going into the ballot.

We can use either 16 or 32 for warp size. The former is faster (on M1 Max). 8 is also a possibility but then the size of the histogram array would exceed the workgroup, so threads would need to deal with multiple histogram values.

Quick experiments with ELEMENTS_PER_THREAD show no gains for values other than 4.