yayagram VS wg-allocators

Two crates: - parse-size is criminally underrated. It allows you to parse input like "100 MB", "50 kb", "25b" into an integer of bytes. It parses input so intuitively and it works exactly the way I expected. I use it in https://github.com/r00ster91/splitter. - line_drawing is in my opinion the best line algorithm library there is. Extremely clean and nice to use. Exactly what I need for my project https://github.com/r00ster91/yayagram.

Still working on this puzzle game playable in the terminal with the mouse: https://github.com/r00ster91/yayagram In version 0.5.0 I've added a feature to darken all cells in a specific direction from the pointer but now I've figured out that a much better way is to constantly darken all cells in the four directions of the mouse pointer.

This is the repository with much more information in the README.md: https://github.com/r00ster91/yayagram, including an example at the bottom that might help you understand the game better if you are new to this kind of puzzle game. See also: https://en.wikipedia.org/wiki/Nonogram.

Hello Rustaceans. This is a clone of the puzzle game picross (also known as nonograms, griddlers and some other names) but with some additions and novelty, like a blue grid cell (wasn't used in this video) and an editor. If you want to try it, you can install the game with cargo install yayagram. Here is the repository with much more information in the README.md: https://github.com/r00ster91/yayagram, including an example that might help you understand the game better if you are new to this puzzle game.

Today I released the puzzle game yayagram which is picross/nonograms but for the terminal. I've been working on it for what feels like months now and it has really come a long way.

Tracking issue for Storages, and a TLDR on what it is

I must have gotten confused, since from your brief discussion with CAD97 it seemed like there was a way for the concepts to live separately and that Storage could complicate things in comparison. But if implementing Allocator in terms of Storage is basically equivalent and Storage is flexible enough that I could write one to pass memory out to unsafe code, that works just as well.

https://rust-lang.github.io/rfcs/1974-global-allocators.html was the original RFC.

My vague understanding is that there's a working group https://github.com/rust-lang/wg-allocators

The further I get from working on Rust day to day, the less I know about these things, so that's all I've got for you.

If you self-reference using pointers and guarantee the struct will never move, you don't even need unsafe. If you self-reference using offsets from the struct's base pointer, you need a splash of unsafe but your struct can be freely moved without invalidating its self-referential "pointers".

Per-struct allocators are a work in progress (see https://github.com/rust-lang/wg-allocators/issues/48).

Not sure what "non thread local addresses" means, but in my experience Rust is pretty good at sending data between threads (without moving it).

Besides that allocation is not really a problem for no_std. It's resolved by using alloc crate directly, so anything usable with custom allocators is supported. Example in dasp sources - https://github.com/RustAudio/dasp/blob/master/dasp_slice/src/boxed.rs#L14-L19 . Also worth looking at this issue to check what is usable already - https://github.com/rust-lang/wg-allocators/issues/7

But that's on track for rust as well: https://github.com/rust-lang/wg-allocators/issues/7

Here: https://github.com/rust-lang/rfcs/pull/1398. there is also a working group for this: https://github.com/rust-lang/wg-allocators.

It's unstable. wg-allocators contains discussions about design and a tracking issue for collections that need an allocator https://github.com/rust-lang/wg-allocators/issues/7