Skip Navigation

InitialsDiceBearhttps://github.com/dicebear/dicebearhttps://creativecommons.org/publicdomain/zero/1.0/„Initials” (https://github.com/dicebear/dicebear) by „DiceBear”, licensed under „CC0 1.0” (https://creativecommons.org/publicdomain/zero/1.0/)RA
Posts
0
Comments
80
Joined
2 yr. ago

  • Almost all programs use both 32bit and 64bit integers, sometimes even smaller ones, if possible. Being memory efficient is critical for performance, as L1 caches are still very small.

    Garbage collection is a feature of programming languages, not an OS. Almost all native linux software is written in systems programming languages like C, Rust or C++, none of which have a garbage collector.

    Swap is used the same way on both linux and windows, but kicking toolbar items out of ram is not actually a thing. It needs to be drawn to the screen every frame, so it (or a pixel buffer for the entire toolbar) will kick around in VRAM at the very least. A transfer from disk to VRAM can take hundreds of milliseconds, which would limit you to like 5 fps, no one retransfers images like that every frame.

    Also your icon is 1.1Mbit not 1.1MB

    I have a gentoo install that uses 50MB of ram for everything including its GUI. A webbrowser will still eat up gigabytes of ram, the OS has literally no say in this.

  • If you look at its protondb page, it seems there was an issue with the nvidia drivers that got fixed, so it may work better now. It's still only silver-rated though, so there are probably issues left. Admittedly, I'm sidestepping a lot of this as I have an AMD gpu, but even with nvidias quality drivers games with such issues tend to be more of an exception.

  • But if you say you are on each track with p=1/2 then you also assume (different) details about how you were chosen

    The task is unclear here, you have to make an assumption. I don't know which is intended.

  • 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.

  • They're giving you shit about complaining about a nice and working color picker for no reason except that somebody made something similar quite a while ago. Nobody cares about your color picker, you are the only one bringing it up.