Sesse__

41 ms·

661.
by Sesse__ 2y ago
Yes, obviously. Direct dial-up plus local serial cable.
662.
by Sesse__ 2y ago
Very nice post! I did something related to this a decade back, except it was for Tiberian Sun and to patch its networking code. Jumping into other people's code like this is like having a shared connection in a sense. I noticed to my h
663.
by Sesse__ 2y ago
Lichess is a great example of how efficient Wikipedia should have been (both on the code and organization level). :-)
664.
by Sesse__ 2y ago
First impressions: 1. curl | sh, seriously 2. The default theme is so low-contrast that I seriously struggled to read text. I could not find something that was, like, actual white on actual black. 3. I can figure out how to enable C
665.
by Sesse__ 2y ago
> If the idea behind the system was to give people a financial incentive to innovate No, it wasn't. The idea behind the system was to give people a financial incentive to be _open_. Patents are a trade with the commons; you would gi
666.
by Sesse__ 2y ago
I must admit that on U-Boot platforms, I use U-Boot EFI to load grub-efi, so that I can have a non-terrible bootloader…
667.
by Sesse__ 2y ago
> The overhead is rarely critical in practice. Depends; you add two extra pointers for each element, so your int → int hash table balloons in size.
668.
by Sesse__ 2y ago
This is one of many reasons why we generally don't use the x87 registers anymore.
669.
by Sesse__ 2y ago
Not the least that you should get the same result from your code every time, even if you compile it with a different compiler. Doesn't matter if that result is somehow better or worse or “difference is so small that it doesn't mat
670.
by Sesse__ 2y ago
> it's possible that the processor has facilities for bucketing the data such that results from such a dataset are the same or more accurate than the naive approach. It absolutely is not. Floating-point addition is completely define
671.
by Sesse__ 2y ago
Yes. MapReduce's model is basically: 1. Map (key, value) -> (new_key, tmp_value) 2. Group by new_key 3. Reduce (new_key, all tmp_values for that key) -> (new_key, new_values) In that respect, it's not that far fro
672.
by Sesse__ 2y ago
Note that there was not a step directly from Dijkstra to contraction hierarchies (CH); in particular, you could route using Highway hierarchies (HH) before CH came along. Both assume a fairly static network, though.
673.
by Sesse__ 2y ago
> So for example your 600mbps WiFi channel actually beacons and does the handshake at 10mbps (or whatever the negotiation speed is specified to be) 802.11 beacons are sent at the lowest basic rate configured for the network, which in the
674.
by Sesse__ 2y ago
Don't worry; a function blocking indefinitely (i.e., there is some point where it stops giving off side effects, and never returns) is also UB. C++ attempts to guarantee a certain amount of forward progress, for now.
675.
by Sesse__ 2y ago
“apt install foo+ bar-” will install foo and remove bar, in one operation.
676.
by Sesse__ 2y ago
Spoiler alert: Software doesn't jump from “uses one core” to “efficiently uses 192 cores” once you remove the first lock.
677.
by Sesse__ 2y ago
It should be said that Sollya doesn't _really_ use floats. It restricts its coefficients to rationals that are (mostly) representable by floats, but the minimax is still run in full precision. Which means you can often beat it by brute
678.
by Sesse__ 2y ago
They used to, though! The AMD K5 paper is a classic, and it describes how they used Taylor series because they could compute them on-the-fly (they had limited ROM space). https://www.researchgate.net/publication/3612479
679.
by Sesse__ 2y ago
You can dither the decoded data to the output display, though (assuming you either are in a float codec, or a 10-bit or higher). It won't solve all problems, but it's not completely unheard of either (e.g. I believe JPEG-XL does i
680.
by Sesse__ 2y ago
I looked up; PGN 8.2.3.5 says: > Neither the appearance nor the absence of either a check or checkmating indicator is used for disambiguation purposes. This means that if two (or more) pieces of the same type can move to the same square
681.
by Sesse__ 2y ago
Point, I should have written Rbc2, not Rac1.
682.
by Sesse__ 2y ago
Notating checks is not even redundant; it can disambiguate which piece is to move without additional information (e.g. Rac1 and Rhc1; only one of them might give a discovered check, so Rc1+ could then be an unambiguous notation where the ch
683.
by Sesse__ 2y ago
There was no command line at all.
684.
by Sesse__ 2y ago
Windows 9x/XP did not come with C#, Visual C++ or Visual Basic. Likewise, classic macOS did not come with any programming or scripting languages. In this respect, they were equally “shitty”, and your solution would have been unavailabl
685.
by Sesse__ 2y ago
You may be interested in the Baseline initiative, then. ( https://web.dev/baseline/2024 )
686.
by Sesse__ 2y ago
> CSS is a very inefficient way to represent styling logic which is why web devs write dialects like sass that are more compact, but browsers don't adopt it. I don't know exactly which features you are referring to, but you may
687.
by Sesse__ 2y ago
HN loads quickly for me _despite_ the 147 ms. I guess partially because it doesn't need 20 roundtrips to sent useful content to me. At some point, I wrote a webapp (with one specific, limited function, of course) and optimized it to th
688.
by Sesse__ 2y ago
Characters is a pretty poor term these days, since it can refer to any of bytes, code points, extended grapheme clusters, or possibly more I haven't thought of.
689.
by Sesse__ 2y ago
The same, since lossy compression can never be worse than lossless compression. (Also, it is more complex since you have to define your loss somehow. These Neuralink samples seemingly come as .wav files, but you probably wouldn't want
690.
by Sesse__ 2y ago
There is not, because there could always be some underlying tricky generator that you just haven't discovered, and discovering that pattern is basically equivalent to solving the halting problem. (See https://en.wikipedia.or

More ›