Sorting small arrays is a relatively common problem in GPGPU
programming. Many useful algorithms exist, and some are provided by
libraries like CUB. An algorithm close to my heart is odd-even sort
because it is exceedingly simply, relatively efficient for small arrays
and, importantly, it uses O(1) space. This commit adds new
implementations of this sorting algorithm for block-wide odd-even sort
in a portable way.

The current CCL kernels have so many parameters that it's a real pain in
the rear to maintain them and to make changes to them. This commit
reduces the number of parameters a little bit by taking all
statically-known shared memory data and unifying it into a single struct
which can be passed around more easily.

Right now we are using a sorting algorithm to ensure that the entire
array of measurements is contiguous in global memory, but this isn't
strictly necessary. This commit alters the CCL algorithm slightly to
guarantee that the output is always contiguous.