Sesse__

25 ms·

481.
by Sesse__ 2y ago
192 kHz? That makes no sense, unless you want to have a telephone conversation between bats.
482.
by Sesse__ 2y ago
Modern cellphone networks support wideband codecs, e.g. AMR-WB.
483.
by Sesse__ 2y ago
Is “area” just a box filter, which is what it sounds like? If so, it gives really blurry results; hardly great.
484.
by Sesse__ 2y ago
Basically the entire premise of the Steam Deck is built on WINE (via a Valve-developed fork, Proton).
485.
by Sesse__ 2y ago
This is the standard API for deduplication on Linux (used for btrfs and XFS); you ask the OS nicely to deduplicate a given set of ranges, and it responds by locking the ranges, verifying that they are indeed identical and only then deduplic
486.
by Sesse__ 2y ago
FWIW, I found that when doing Robin Hood, SSE is just a loss, since you usually find the element so soon. (If you are dominated by non-matching lookups, you can consider putting a Bloom filter in front.)
487.
by Sesse__ 2y ago
Intel PT is indeed useful (although very, very slow compared to regular sampling profiling), but there's hardly any CPUs that actually implement PTWRITE. (IIRC there's some obscure Xeon or something?) Typically you get a cycle cou
488.
by Sesse__ 2y ago
It's much worse, since you can't inline it; it becomes a shared-library call.
489.
by Sesse__ 2y ago
“:set hlsearch” in pretty much any version of vim. (I don't know if vim 9.0 changed the default or not.)
490.
by Sesse__ 2y ago
A Sudoku solver isn't a hard problem. It's more like scoring 30% on a couple simple layup shots, then LeBron James comes along and dunks it out of the sky, but you still tell everyone that your way of training basketball is the be
491.
by Sesse__ 2y ago
My point was that there hasn't been a revolution in branch prediction (or really any sort of speculation) the last 5–10 years. Things have become incrementally better as always, and the M1 presumably has some sort of pointer value spec
492.
by Sesse__ 2y ago
> At least I think sqrt, sin, and cos are generally considered to be slow. […] Based on X you can calculate a range of legal Y that will still fall within the circle. Yup, that calculation is called sqrt(1 - x²). > Try to use a lookup
493.
by Sesse__ 2y ago
Nearly any real-world Huffman encoder is trivially optimal, i.e., given a set of symbols with probabilities, it is easy to construct the optimal set of output bits for each symbol. (There are some exceptions in that if you have a huge amoun
494.
by Sesse__ 2y ago
Ten years ago, you already have Skylake with pretty good indirect branch predictors...
495.
by Sesse__ 2y ago
It is, in general, a poorly understood disease (as lots of others in the thread are pointing out). And everybody's case is different. I will point out that I've never gotten so much unsolicited low-quality advice before, though; p
496.
by Sesse__ 2y ago
I am in the process of recovering from CFS (currently back to working 100%, though still not being where I want to be with everything else) and at no point my doctor has done anything but take it seriously. Of course, a doctor can only do s
497.
by Sesse__ 2y ago
The forward affine matrix is useful for all sorts of bit manipulation, e.g. something as simple as a bit reversal.
498.
by Sesse__ 2y ago
Let me guess, didn't read the article?
499.
by Sesse__ 2y ago
The place where I see this really hurts goes when Clang/LLVM gets too fancy, in situations like this: - Function A calls function B, which returns some struct S (for instance on the stack). - B writes S by individual (small) stor
500.
by Sesse__ 2y ago
Najdork is now headcanon.
501.
by Sesse__ 2y ago
Try the Mel or Bark scales :-)
502.
by Sesse__ 2y ago
> I am not sure if reshaping is a reasonable thing. Yet people are celebrating when ZFS adds it. Was it all for nothing?
503.
by Sesse__ 2y ago
Well, then they made a design choice in their RAID implementation that made fairly reasonable things hard. I don't know what md does if the parity doesn't match up, no. (I've never ever had that happen, in more than 25 years
504.
by Sesse__ 2y ago
> Do you mean WSS and mdadm/lvm will allow an automatic live rebalance and then reconfigure of the drive topo? mdadm can convert RAID-5 to a larger or smaller RAID-5, RAID-6 to a larger or smaller RAID-6, RAID-5 to RAID-6 or the oth
505.
by Sesse__ 2y ago
> That is just what a bot does by default. It will almost always give up after a few retries. I've had them go on for hours. (This is not mainly bots, but various crap desktop applications.) > The IPs that you actually need to bl
506.
by Sesse__ 2y ago
I've seen _plenty_ of user agents that respond to 429 by immediately trying again. Like, literally immediately; full hammer. I had to eventually automatically blackhole IP addresses that got 429 too often.
507.
by Sesse__ 2y ago
I took my most bothered page IPv6-only, the AI bots vanished in the course of a couple days :-) (Hardly any complaints from actual users yet. Not zero, though.)
508.
by Sesse__ 2y ago
> On a hard disk, copying multiple files in parallel is likely to make the copy run slower because it spends more time seeking back and forth between the files (except for small files). Certainly not; it's likely to make it run fast
509.
by Sesse__ 2y ago
Yes, I feared as much. Perhaps trying to get a copy of Piouffe’s inverter would be possible, but I don't know.
510.
by Sesse__ 2y ago
Not at all; with io_uring, you can copy multiple files in parallel (and in fewer syscalls), which is a huge win for small files.

More ›