orlp

7 ms·

91.
by orlp 1y ago
Literally pasting "Wikipedia list of companies by market cap" into Google gives me https://en.wikipedia.org/wiki/List_of_public_corporations_by... .
92.
by orlp 1y ago
My comment was worded a bit too harshly, sorry about that, I certainly wouldn't have worded that way in a personal message. As I mentioned the hexadecimal printing coincidence is a neat fact, I was just excited when clicking the link t
93.
by orlp 1y ago
> The most novel aspect of OoT bitsets is that the first 4 bits in the 16-bit coordinate IDs index which bit is set. For example, 0xA5 shows that the 5th bit is set in the 10th word of the array of 16-bit integers. This only works in the
94.
by orlp 1y ago
How to create a fair coin from an arbitrarily biased coin: 1. Toss the coin and remember the answer. 2. Toss the coin again, if it is different from your previous toss then your result from #1 is fair. Otherwise, go back to step 1. If p is
95.
by orlp 1y ago
Economic fraud detection is like trying to find a needle in a haystack. Blocking DDoS is like trying to separate the shit from the bread in a shit sandwich. It's a completely different problem.
96.
by orlp 1y ago
> DuckDB is faster than polars Whether or not DuckDB is faster than Polars depends on the query and data size. I've spent a large portion of the last 2 years building a new execution engine for and optimizing Polars, and it shows:
97.
by orlp 1y ago
You won't like bra-ket notation then :)
98.
by orlp 1y ago
I don't believe so, no. Currently these operations only set the LLVM flags to allow reassociation, contraction, division replaced by reciprocal multiplication, and the assumption of no signed zeroes. This can be expanded in the future
99.
by orlp 1y ago
No, there is no guarantee which (if any) optimizations are applied, only that they may be applied. For example a fused multiply-add instruction may be emitted for a*b + c on platforms which support it, which is not cross-platform.
100.
by orlp 1y ago
I helped design an API for "algebraic operations" in Rust: < https://github.com/rust-lang/rust/issues/136469 >, which are coming along nicely. These operations are 1. Localized, not a function-w
101.
by orlp 1y ago
It's not about the percentage of Harvard international students who fall into this category, it's about the percentage of students in this category who go to Harvard.
102.
by orlp 1y ago
It is as easy as it looks to add `freeze`. That is, value-based `freeze`, reference-based `freeze` while seemingly reasonable is broken because of MADV_FREE. Some people simply aren't comfortable with it. Currently sound Rust code does
103.
by orlp 1y ago
This isn't true. In practice people don't use the analytical solution for efficient linear regression, they use stochastic methods. Square error is used because it is the maximum likelihood estimator under the assumption that obse
104.
by orlp 1y ago
This is like banning quotes from your website to 'solve' SQL injection...
105.
by orlp 1y ago
It is pull in the sense that an operator can call `recv().await` (the equivalent of `input.next()` in the article) at any point, which can then block the execution of the operator until more data is available. It is push in the sense that a
106.
by orlp 1y ago
At Polars I developed a new query engine which uses a hybrid of push and pull. I gave a short (and not very technical) talk about the engine at our first meetup recently, which can be viewed here: https://www.youtube.com/wat
107.
by orlp 1y ago
I'd suggest you not take readability advice from a guy who uses a red-green color scheme for their tables.
108.
by orlp 2y ago
What I don't understand is why it took you 8 weeks to distinguish a timer from a transistor. That doesn't make your professor's reaction alright, I just find it puzzling.
109.
by orlp 2y ago
Making it harder to pitch leads to more batters getting hit and more injuries, depending on how it's done.
110.
by orlp 2y ago
The elements are completely contiguous, which can be nice for passing off (subslices) to other APIs, maximum speed iteration, etc.
111.
by orlp 2y ago
I made something similar to this ~10 years ago: https://github.com/orlp/devector . I never finished it (writing proper containers in C++ is a nightmare [1] [2] [3]), although I did start a similar project in Rust a year
112.
by orlp 2y ago
I would suggest fd -t f . cache -X rm -- Which reads as find "any file", "matching .", "in directory cache", then "execute rm -- followed by an argument list of all found files". This ensures
113.
by orlp 2y ago
Two characters, if you do `from polars import col as c` you can simply write `c.foo`, assuming the column name is a valid Python identifier.
114.
by orlp 2y ago
Disclaimer: I work for Polars Inc, but my opinions are my own. Polars itself is FOSS and will remain FOSS. Self-hosted/on-site Polars Cloud is something we intend on developing as there is quite a bit of demand, but it is unlikely to b
115.
by orlp 2y ago
Disclaimer: I work for Polars Inc, but my opinions are my own. If you have a very beefy desktop machine and no giant datasets, there isn't a strong reason to use Polars Cloud. Are you a data scientist running a Polars data pipeline aga
116.
by orlp 2y ago
An 1.5 hour movie at 24 FPS has ~130k frames to render. As long as you have less machines than that the parallelization is essentially free.
117.
by orlp 2y ago
I see, confusing multiple layers of defaults :)
118.
by orlp 2y ago
One thing I found peculiar is that for the GraySort benchmark it dispatches to Polars by default to do the actual sorting, not DuckDB: https://github.com/deepseek-ai/smallpond/blob/ed112db42af4d0... .
119.
by orlp 2y ago
I'm very confused by the article. It's missing about two decades of modern non-cryptographic general hash development, it completely fails to mention the field of universal hashing which created formal criteria for collision proba
120.
by orlp 2y ago
Yes, I meant parity-independence with speculation. Essentially you assume either you are or are not within a string at the start and do your computation based on that assumption, then throw away the result with the unsound assumption. Both

More ›