orlp

16 ms·

241.
by orlp 3y ago
Or mass surveillance.
242.
Tic-tac-toe implemented in a single call to printf(github.com)
4 points by orlp 3y ago|0 comments
243.
by orlp 3y ago
I take it you view drug / gambling addicts not as people with a mental health issue making irrational decisions, but rather fully rational people that prefer "short-term pleasure over long-term stability"?
244.
by orlp 3y ago
BitTorrent is just an objectively superior method of delivering a lot of data to a lot of people.
245.
by orlp 3y ago
Your comment made me realize how some younger people have no idea of, or at least no first-hand experience of static on TV and radio since it is all digital nowadays.
246.
by orlp 3y ago
Last time I checked the sun transfers its light through the vacuum of space to us.
247.
by orlp 3y ago
Has it ever been successfully argued in a court of law that forgetting a minor detail of the CC license counts as "willfully infringement"?
248.
by orlp 3y ago
> Self-referential structs work fine in Rust and always have. They 'work fine' in that the Rust compiler will let you create one and then never let you move it or access the whole object mutably again while it is self-referenti
249.
by orlp 3y ago
I'm not saying a theoretical language couldn't be made that allows this, but in Rust it would be breaking backwards compatibility. For example [T]::sort (obviously) needs to be able to move the elements in the passed array, but th
250.
by orlp 3y ago
No, self-referential structs are disallowed by the nature of Rust having move semantics by default, without a concept of a 'move constructor'.
251.
by orlp 3y ago
> At 400Hz, I'd be impressed by someone really seeing the difference. Trivial. Drag your white cursor quickly across the screen against a black background. You will see clear gaps between the individual cursor afterimages on your r
252.
by orlp 3y ago
You're not going to like the French language...
253.
by orlp 3y ago
Assuming a, b are integers, the following answers are exact: def div_floor(a, b): return a // b def div_ceil(a, b): return (a + b - 1) // b def div_trunc(a, b): return a /&#x2
254.
by orlp 3y ago
An example of when it's not necessary: for i in 0..v.len() { v[i] += 1; } Because the compiler can prove that i < v.len() due to the loop condition, the bounds check gets eliminated.
255.
by orlp 3y ago
Python's floating point flooring division operator also has a pitfall: it gives a correctly rounded result as if you computed (a / b) with infinite precision before flooring. This can lead to the following: >>> 1 &#
256.
by orlp 3y ago
> Not to mention the strong conflict of interest for netlify, who stands to gain from their customers being attacked. Netlify is getting paid for something criminal in nature having occurred. I think you could argue that Netlify is guilt
257.
by orlp 3y ago
I don't know, and I don't feel like paying $200 per chapter to find out.
258.
by orlp 3y ago
QUALIFY is not part of the SQL standard.
259.
by orlp 3y ago
In the Netherlands we typically use https://tweakers.net/ .
260.
by orlp 3y ago
> Instead, he got convicted for revenge on the current tenant. No, he got convicted for wire fraud. Which is super weird.
261.
by orlp 3y ago
You have the Rosetta version of Python installed, which lacks the SIMD instructions we compile Polars with. Reinstalling Python as a native package should fix this. I have recently added a warning to Polars for this on import, could you con
262.
by orlp 3y ago
What I find strange is that the original person who was threatened with swatting who gave the 'fake' address was convicted of wire fraud. I do understand why he was convicted: > Viner threatened to swat Gaskill over the loss. G
263.
by orlp 3y ago
I didn't mean for it to be snarky, I just found it funny.
264.
by orlp 3y ago
On the very page you linked it is explained what the theta means. Ironic.
265.
by orlp 3y ago
It kind of implies that the left join process works by first taking the left table and then filling in the right table with a match if one exists, and otherwise null. That model obviously doesn't work because if there's more than
266.
by orlp 3y ago
I also mentioned it explicitly as a source of CVE's two years ago in a talk I gave on pdqsort: https://youtu.be/jz-PBiWwNjc?t=856
267.
by orlp 3y ago
Alright let's test this hypothesis. Load up a bitcoin wallet and post the private key here with 1 random bit flip :)
268.
by orlp 3y ago
DuckDB isn't optimized for writing speed, but it is not read-only.
269.
by orlp 3y ago
Follow up question: > You are given an urn containing 100 balls; n of them are red, and 100-n are green, where n is chosen uniformly at random in [0, 100]. You select 99 balls at random and find that they are all red. What is the probabi
270.
by orlp 3y ago
You can write it like this to get the compiler to generate SIMD: https://godbolt.org/z/ohvoEb7er It's certainly not perfect though (in particular the final reduction/remainder handling). Unfortunately Rust do

More ›