orlp

21 ms·

271.
When Random Isn't(orlp.net)
376 points by orlp 3y ago|147 comments
272.
by orlp 3y ago
One practical use case is for dimensional analysis. A type is then a k-tuple of type-level integers where k is the number of primitive units, e.g. (kg, m, s). Then m^2 / kg would be the tuple (-1, 2, 0). Multiplying two quantities add
273.
When Random Isn't(orlp.net)
4 points by orlp 3y ago|1 comments
274.
by orlp 3y ago
Now I think the interesting barriers are those with log n queries or sqrt n queries.
275.
by orlp 3y ago
More than just a ring, it is the simplest finite field.
276.
by orlp 3y ago
Not a lawyer, not legal advice. The actual font files (e.g. TTF and OTF) are protected by copyright, but the design itself is not. You can copy the design to the minute details, but you'll have to make your own font. This is a lot of w
277.
by orlp 3y ago
Arguably the greatest mathematician alive blogs extensively on WordPress. So at least don't discount the content based on that.
278.
by orlp 3y ago
Last time I checked the T mobile ToS is not law.
279.
by orlp 3y ago
I see, that is a tricky case. When serializability would have required a transaction order that is different from commit order for two transactions, inserting a third snapshot-isolated read in between can violate the (logical) reordering of
280.
by orlp 3y ago
Serializable and snapshot are indistinguishable for read-only transactions, no? That is, a system which guarantees serializability can legally implement any read-only transaction using snapshot isolation. So you might as well state that the
281.
by orlp 3y ago
I had cause and effect backwards of the field contents. I typically refuse to read patents so the language is rather foreign and confusing to me. Either way, reinterpreting a field depending on the mode of communication is equally not novel
282.
by orlp 3y ago
I looked at the patent EP3337077B1... It is utter rent-seeking nonsense. Patents are supposed to be for innovation, the patent literally just claims adding a field to a packet indicating if it's for a single user or multiple is a novel
283.
by orlp 3y ago
"Ditch Vim" is definitely weird wording for people (like myself) that consider Vin great. I can understand it for those who don't grok it though, then it's rather frustrating.
284.
by orlp 3y ago
My algorithm pdqsort fixes this problem fundamentally which turns many identical values into an ideal O(n log k) case where k is the number of unique values, even if it were to use Lomuto.
285.
by orlp 3y ago
> Doesn't the comparison have to be inlined, and tiny, not to mention itself branchless? Yes. This generally means floats and integers, or small combinations thereof. Note that this is after projection of the comparison operator, so
286.
by orlp 3y ago
> Lomuto partitioning is flawed though; when implementing Quicksort, you want the original Hoare one. Can you elaborate? It is 'flawed' in that it requires more moves than Hoare as I write in the conclusion, but as the benchmar
287.
by orlp 3y ago
That's actually fair enough. I'm not certain how well the CPU will like the overlapping SIMD reads/writes on the left hand side. If you have AVX512 available shuffle(xs, lut[movemask(compare_result)]) could also be two compre
288.
by orlp 3y ago
> I was thinking of Quicksort, where j moves left until it meets i, and missed the fact that they both move in the same direction and i runs through the entire list. You were thinking of Hoare partitioning. Quicksort can use either Hoare
289.
by orlp 3y ago
SIMD partitioning is definitely a thing, but I think it is ill-suited for Lomuto-style partitioning. I think fulcrum (what crumsort uses) or out-of-place partitioning (in both cases the output buffers for < and >= are distinct) like g
290.
by orlp 3y ago
The assembly is only for the inner loop, I did not include the preamble/postamble of the functions. You can look at the full assembly here: https://cpp.godbolt.org/z/zzzTh47PG . But the full assembly isn't a f
291.
by orlp 3y ago
> So you start left, the first element on the left partition belongs in the left partition, so you swap it into the right partition? Yes and no. You temporarily do swap it into the right partition, but then increment the pointers which r
292.
by orlp 3y ago
Author here if anyone has any questions.
293.
Branchless Lomuto Partitioning(orlp.net)
3 points by orlp 3y ago|0 comments
294.
by orlp 3y ago
If anything the title should be "inefficient animation implementation in Google Chrome is wasting half a CPU core".
295.
by orlp 3y ago
At least how I read it the linked post was ugrep's author seeking conflict, not the ripgrep's.
296.
by orlp 3y ago
The author should really add at least aria-hidden="true" to the minimap element.
297.
by orlp 3y ago
I fail to see how that is better. Null-terminated strings are a terrible idea in the first place.
298.
by orlp 3y ago
Even taken at face value such pipelines often still rely on OpenCV for I/O, data cleaning and preprocessing.
299.
by orlp 3y ago
High-performance analytic databases also do this. A common representation is to store the length in 4 bytes from a total of 16. Then if the length is <= 12 the rest of the storage is used to store the string inline, otherwise only the fi
300.
by orlp 3y ago
> Yes, because you could in theory run `pip install`, then manually read through every file you've just downloaded, then run `python myapp.py`. This security model is utter nonsense because no one does this.

More ›