This series is a rather lazy exploration of how to work with sparse data in Morton order. Along the way we'll be composing a number of useful data structures and twiddling a lot of bits.
Revisiting Matrix Multiplication
As of March 2020, School of Haskell has been switched to read-only mode.
- This post shows how we can define Morton Order via bit shuffling operations.