I'm a developer (please ignore/forgive the NFT stuff).
Question: How is hashbrown faster than the stdlib HashMap?
I'm curious as to how the hashbrown crate can have up to 2x performance on certain operations, even though it looks like the standard library's HashMap is just a wrapper for hashbrown.
I understand that a wrapper could add a small overhead, but 50% of the original performance is a bit silly, especially considering all of the functions in the wrapper are #[inline], so there should be no overhead in calling most functions.
Does anyone know the reason for this?
You should see some threads linked on github-drama, there were >1000 comments when audacity tried to add telemetry.
On duckduckgo you can also search !cache + url to do the same thing.
It may be a problem with your browser or lemmy-ui, you could try with a different browser and/or open an issue on the lemmy-ui github repo.
Some instances are under a fairly heavy load at the moment, gifs are fairly big files, so it could be that.
If you try to download the gif directly (copy/paste the url into the browser's url bar) it will probably return 502 Bad Gateway if that's the case.
Cool, how did you do the lines on the outside? Did you use a shader or were they just seperate faces?
Also new to Lemmy, but it looks like it only really matters which instance you register with if the instance shuts down (your account will be lost).
You should also try to pick a smaller instance, to avoid unneccessary load on the few 'main' ones, but also make sure you're on a reliable instance, since you'll lose access to Lemmy in downtime.
Also, when communicating with other instances, they can see the one you signed up to (I'm on sh.itjust.works).