I wish had a shorter/less noisey way to `collect` an `Iterator` into a `Vec`. Getting tired of writing `.collect::<Vec<_>>()` so much.

I wanna be a good library maintainer, and this is a lot of the little busy work that I would like to see automated.

Show thread

I've created & uploaded several crates. Is there an easy & standard way to download/check them all out, and check if all the dependencies are at their latest versions, try to upgrade those deps & run my unit tests?

Time to do trying to write my own graph algorithms in and just use a library instead. I would like to get results!

What's everyone using as a PAGER on now-a-days? `less(1)` is still the default on many systems I use, but I've sometimes uses `most(1)`.

Is there some fancy-pants modern based pager or anything now?

Oh Heaptrack is a nice programme to measure & analyze heap memory access of a programme. Works nicely & easily with code.
I'm finding it quite easily to reduce memory allocations in my code.

Sometime I should give a try to build a web app in . I used to do a lot of . But I'm doing my coding in Rust now.

ooohโ€ฆ 's `std::iter::from_fn(move || { โ€ฆ })` is pretty useful. ๐Ÿ™‚

$ ( ls Cargo.toml ; find ./src/ -type f -name '*.rs' ) | entr -r cargo test

this is what I use to automatically run tests when a file is saved

Show thread

RT: @gf_256@twitter.com:
The year is 20XX. Web apps are built in C++ and with WebAssembly, and desktop apps are built in with Electron.


Grrr! I'm not supposed to get segfaults when writing programmes! This makes things hard

Show older
โ›ง MOYTURA โ›ง

The social network of the future: No ads, no corporate surveillance, ethical design, and decentralization! Own your data with Mastodon!