sofia-m-a

Should it be rather ``` contraverse :: Divisible f => (a -> f b) -> t a -> f (t b) ``` etc?

What would the ideal complexity for something like that be? I worry that too complex a language will distract from the error-reporting stuff, but too simple and there won't be...

[Here's a first attempt at reducing it](https://github.com/sofia-m-a/bevy1-1/tree/reducing) The level generation is still complex but the main relevant files are [`src/main.rs`](https://github.com/sofia-m-a/bevy1-1/blob/reducing/src/main.rs), [`src/camera.rs`](https://github.com/sofia-m-a/bevy1-1/blob/reducing/src/camera.rs), and [`src/world/mod.rs`](https://github.com/sofia-m-a/bevy1-1/blob/reducing/src/world/mod.rs), which is about 800 lines to look...

There already seems to be https://github.com/solidsnack/wcwidth but it seems to have a few issues

Might need to update the tests...

Yep, looks like I broke something, argh