Noo! There will never be another like him :(
Noo! There will never be another like him :(
But be careful, you can pretty easily break stuff by messing up fstab
What does type() mean here?
The effective vibe is much more important than any underlying biology.
Tomatoes are vegetables.
If it’s networking related, I like “Layer 8 Issue”
Does Javascript have anything to say about promises that are never resolved/rejected? Is that something that happens?
This may be a stupid question but is your video cable plugged into the gpu or into the motherboard?
That would be extremely funny
Not really cylinders, but toruses. Disks with extent are cylinders.
Are you sure? The way I understand it, ray marching is not something that can really replace ray/pathtracing, it’s mainly used for rendering signed distance fields which is cool if you want to draw fractals and stuff, but not very efficient for classical geometry
In your case I would just start by copying a full setup someone else made and then customizing it, starting from scratch always takes a lot of effort. Reddit’s unixporn was great for that, the alternatives on lemmy are sadly still a little empty.
Someone needs to maintain them for them to keep working. Nobody else is willing to do that anymore, but you can still volunteer as a maintainer. If you don’t, it’s as much your fault as anyone elses.
I like your doubled use of “a” and wish you a long and prosperous life.
He is the dark path in this meme, at least
cmake now finally supports c++20 modules
I wouldn’t use modules in production quite yet, there’s still a lot of implementation bugs, but for experimenting its quite usable
a fallen apart burrito is still tasty
Well landau notation only describes the behaviour as an input value tends to infinty, so yes, every real machine with constant finite memory will complete everything in constant time or loop forever, as it can only be in a finite amount of states.
Luckily, even if our computation models (RAM/TM/…) assume infinite memory, for most algorithms the asymptotic behaviour is describing small-case behaviour quite well.
But not always, e.g. InsertionSort is an O(n^2) algorithm, but IRL much faster than O(n log n) QuickSort/MergeSort, for n up to 7 or so. This is why in actual programs hybrid algorithms are used.
I love how the text seems to be right from the time where the symbol was already abstract, but it was still used as an et ligature instead of a standalone symbol