orlp

7 ms·

61.
by orlp 1y ago
I'm working on implementing extension types in Polars. Stay tuned.
62.
by orlp 1y ago
Aarch64 does indeed have a proper atomic max, but even on x86-64 you can get a wait-free atomic max as long as you only need to support integers up to 64. In that case you can simply do a `lock or` with 1 << i as your maximum. You can
63.
by orlp 1y ago
I take it you never wrote code involving atomic pointers. Regardless of memory usage, a lot of platforms only provide single-word atomics (efficiently), making bitpacking crucial for lockfree algorithms.
64.
by orlp 1y ago
> Reliable pointer tagging is not trivial. It is if you use alignment bits. Not always possible if you don't control the data though.
65.
by orlp 1y ago
Yes. But there is no decider for n-state Turing machines that works regardless of n.
66.
by orlp 1y ago
Well, years back I released an unstable sort called pdqsort in C++. Then stjepang ported it to the Rust standard library. So at first... nothing. Someone else did it. A couple years later I was doing my PhD and I spent a lot of time optimiz
67.
by orlp 1y ago
I (Orson Peters) am also here if anyone has any questions :)
68.
by orlp 1y ago
As I mentioned in my other comment: > I'd just like to clarify that I'm not saying this is necessarily the solution the problem writers were looking for, or that it will run within the allocated time. Just that it's a feas
69.
by orlp 1y ago
Every developer I've talked to has had the same experience with compilation caches as me: they're great. Until one day you waste a couple hours of your time chasing a bug caused by a stale cache. From that point on your trust is s
70.
by orlp 1y ago
The team manual I referred to when I was in university does in fact contain such a basic simplex LP solver: https://github.com/ludopulles/tcr/blob/master/tcr.pdf (page 22). I'd just like to clarify
71.
by orlp 1y ago
With all due respect, have you actually used the Polars expression API? We actually strive for composability of simple functions over dedicated methods with tons of options, where possible. The original comment I responded to was confusing
72.
by orlp 1y ago
It doesn't seem that hard to solve to me either. It's solvable with basic linear programming. 1. Add a variable for each node, and a variable for each output edge from stations. 2. For each reservoir add equality constra
73.
by orlp 1y ago
> The creator of duckdb argues that people using pandas are missing out of the 50 years of progress in database research, in the first 5 minutes of his talk here. That's pandas. Polars builds on much of the same 50 years of progress
74.
by orlp 1y ago
> The width increase (10-100x) completely overwhelms the depth increase (maybe 3-10x), so surface area increases substantially. No it doesn't. The only thing that matters (in this oversimplified calculation which only takes into acc
75.
by orlp 1y ago
> On the one hand, a huge dam reservoir does increase the level of water evaporation relative to an undammed river by increasing the amount of water surface area. That depends entirely on the depth of the river and the depth of the reser
76.
by orlp 1y ago
The marketing doesn't even matter. It either needs to be full self driving, or nothing at all. The "semi self-driving but you're still responsible when shit hits the fan" just doesn't work. Humans are simply incapab
77.
by orlp 1y ago
Not sure why this is being upvoted as the article is not describing interval arithmetic. It supports all kinds of uncertainty distributions.
78.
by orlp 1y ago
Actually in math it's very common for the more general system to be simpler. Compare for example the prime numbers with the integers, or general groups with finite simple groups and the monster group.
79.
by orlp 1y ago
I assume they've made up their mind and are now just tired of discussing it. I don't know why they refuse to even consider an option for it.
80.
by orlp 1y ago
I and others have brought this up with the dirs Rust crate maintainer but they refuse to see it this way: https://codeberg.org/dirs/dirs-rs/issues/64 . It's very frustrating. I now use a combination of xd
81.
by orlp 1y ago
Are you using a third-party DNS like 1.1.1.1 or 8.8.8.8?
82.
by orlp 1y ago
> will solve 90% of the problem Remind me again, what the problem they're trying to solve is?
83.
by orlp 1y ago
That is something I can agree with, but I can't in good faith just let "it's just a hint, they don't have anything to do with correctness" stand unchallenged.
84.
by orlp 1y ago
> Non-temporal instructions don't have anything to do with correctness. They are for cache management; a non-temporal write is a hint to the cache system that you don't expect to read this data (well, address) back soon I disag
85.
by orlp 1y ago
My favorite pens are the Frixxion pens. You can erase them, and it actually works well.
86.
by orlp 1y ago
This is useless. You can't stop Collective Shout (their campaign almost surely falls under First Amendment rights), and even if you could, 30 minutes later a new group pops up. Plus your message would fall completely on deaf ears for a
87.
Dyeing to get in (2014)(genuineideas.com)
18 points by orlp 1y ago|2 comments
88.
by orlp 1y ago
> Wow, that's smart. I was wondering whether there is a way for the bots to generate "unpredictable" domains such that security researchers could not predict them efficiently (even with source code), but the botnet control
89.
by orlp 1y ago
Intel's C++ compiler is known to add branches in its generated code checking if the CPU is "GenuineIntel" and if not use a worse routine: https://en.wikipedia.org/wiki/Intel_C%2B%2B_Compiler#Support... .
90.
by orlp 1y ago
GenuineIntel moment.

More ›