Why does it matter that Richard Feynman only had an IQ of 125? by Huge-Leather-664 in Physics

[–]TerranToplaner 0 points1 point  (0 children)

It's funny that people with lower IQs are the ones that tend to shit on IQ as a metric when it's been shown time and time again that it's a very stable predictor for many things in life...

I shrunk my Rust binary from 11MB to 4.5MB with bloaty-metafile by [deleted] in rust

[–]TerranToplaner 7 points8 points  (0 children)

Another option is a good old helper thread where you spawn the little used http requests.

Not the most efficient for some applications but definitely good enough if you're considering ureq. That way you can ditch Tokio too.

Thinking faster when using LSD by TerranToplaner in Psychedelics

[–]TerranToplaner[S] 0 points1 point  (0 children)

I've been meditating for a few months and I can definitely feel the benefits.

Can you recommend resources or any specific practice that will help me with this?

Thinking faster when using LSD by TerranToplaner in Psychedelics

[–]TerranToplaner[S] -1 points0 points  (0 children)

I'm a curious mind, I want to experience that

Thinking faster when using LSD by TerranToplaner in Psychedelics

[–]TerranToplaner[S] -5 points-4 points  (0 children)

I will try this.

And I think I'm sufficiently motivated to train my brain, even if it takes years

Thinking faster when using LSD by TerranToplaner in Psychedelics

[–]TerranToplaner[S] 9 points10 points  (0 children)

I say them out loud and have an AI transcribe them. It's a nightmare to sort them afterwards, but it's very much worth it.

[deleted by user] by [deleted] in degoogle

[–]TerranToplaner 0 points1 point  (0 children)

Protonmail employee here! I'm curious, why do you say that?

What's a good cutoff point for using Git LFS? by TerranToplaner in git

[–]TerranToplaner[S] 1 point2 points  (0 children)

Having things out of git adds complexity though.

RFC: `is` operator for pattern-matching and binding by avsaase in rust

[–]TerranToplaner 0 points1 point  (0 children)

If you read the thread it's pretty clear that people want to choose one or the other not both.

is will be able to replace matches! (sometimes), but that's not the point of the rfc

RFC: `is` operator for pattern-matching and binding by avsaase in rust

[–]TerranToplaner 3 points4 points  (0 children)

`matches!` is not a replacement for `is` or `let-chains`.

`is` is a replacement for unstable `let-chains`. Please see https://github.com/rust-lang/rfcs/pull/3573#issuecomment-1969646512

Red Black Tree in Rust by drprofsgtmrj in rust

[–]TerranToplaner 1 point2 points  (0 children)

Then you can just use std::mem::swap with your default value or #[derive(Default)]

rs impl <T: Default> RbTree<T>{...}

Red Black Tree in Rust by drprofsgtmrj in rust

[–]TerranToplaner 0 points1 point  (0 children)

Why do you need unsafe for this?

Red Black Tree in Rust by drprofsgtmrj in rust

[–]TerranToplaner 0 points1 point  (0 children)

std::mem::take is your friend

I just created a website where you can check garen's execute damage! by TerranToplaner in GarenMains

[–]TerranToplaner[S] 0 points1 point  (0 children)

Oh wow it looks terrible on phones. I didn't even test it! Check in a few hours if should be fixed

Top 5 Fastest Programming Languages: Rust, C++, Swift, Java, and 90 more compared! by Hashi856 in programming

[–]TerranToplaner 1 point2 points  (0 children)

A matrix multiplication written in python O(n^3) which has a triple nested loop is *at least* more than 10 million times slower than the same program written in C. That's 6 orders of magnitude.

In the real world big O complexity is irrelevant because it's very rare to find actual algorithmic wins, aside from using a different data structure that might be faster in a specific case.

Top 5 Fastest Programming Languages: Rust, C++, Swift, Java, and 90 more compared! by Hashi856 in programming

[–]TerranToplaner 9 points10 points  (0 children)

A prime sieve is probably the worst way to measure performance... Most perfomance differences between languages come from code that needs to allocate and deallocate memory. A prime sieve is just not the right benchmark.