meisel

11 ms·

31.
by meisel 11mo ago
No it’s not? Her Wikipedia page says “Hedy”
32.
by meisel 11mo ago
For a language that’s so low level and performance focused, I’m surprised that it has those extra io and allocator arguments to functions. Isn’t that creating code bloat and runtime overhead?
33.
by meisel 11mo ago
The real optimization here is to move off UIKit and interact with the GPU more directly
34.
by meisel 1y ago
In my experience, C++ is a much more complicated language. The 8 ways to initialize something, the 5 types of values (xvalues etc.), inconsistent formatting conventions, inconsistent naming conventions, the rule of 5, exceptions, always rem
35.
by meisel 1y ago
Would it help a lot to run it through multiple different AI systems and verify that they agree on the result?
36.
by meisel 1y ago
Is there a target use case(s) for this language, at least initially? It seems to focus on programming in a platform-independent sense, but where is it most likely to actually succeed? Are there particular OS’s or other languages that they t
37.
by meisel 1y ago
How does Flix decide if it’s worth it to auto parallelize a map operation? Eg, if it’s a very trivial map operation, it may add overhead to parallelize it
38.
by meisel 1y ago
Yeah, and his behavior in this LLVM discourse thread made me not want to ever try Zig: https://discourse.llvm.org/t/rfc-libc-taking-a-dependency-on...
39.
by meisel 1y ago
Another speed up method here would be using simd, although it would be interesting to see in the assembly if it was auto-vectorized already. This reminds me of a trick to sort floats faster, even if they have negatives, nans, and inf: map e
40.
by meisel 1y ago
Yes, that's the one I was thinking of, thank you
41.
by meisel 1y ago
I knew that name looked familiar, I thought about mentioning tpde here :) That's interesting to hear that IR is missing a lot. I'm also surprised that it could provide much gain over hashing the preprocessed output - maybe my work
42.
by meisel 1y ago
Very interesting stuff. However, for my day-to-day work, I'm in a large C++ code base where most of the code has to be in headers due to templating. The bottlenecks are, very roughly: - Header parsing (40% of time) - Template instantia
43.
by meisel 1y ago
Another idea would be to still run the rest of the E2E tests pre-merge, but as a separate job that only makes itself known if a failure occurs.
44.
by meisel 1y ago
I don’t think you truly get the “best” of both worlds, because the rate of accidentally omitting a broken test and letting something slip into master is now non-zero (flaky tests aside). This is still a tradeoff. But maybe it’s a good one!
45.
by meisel 1y ago
It seems like it takes just one user using a certain piece of hardware to justify it being supported in the kernel, which is surprising to me. The cost to kernel dev velocity is not weighed more heavily against that?
46.
by meisel 1y ago
Yeah, I’ve hit many pain points over the years with SwiftPM. Its restrictions on compiler flags is also problematic.
47.
by meisel 1y ago
Thanks for that sequence, I can really picture it now
48.
by meisel 1y ago
TurboTax and other tax companies don’t just lobby to prevent a free filing solution, they also lobby for more complicated tax laws to create a greater need for their product
49.
by meisel 1y ago
If you’re at the point where the shell might be a bottleneck to your script, it probably should be written in a proper language and not bash
50.
by meisel 1y ago
Got it, so this could not be extended to non-literal strings
51.
by meisel 1y ago
How does this work under the hood? Does Ruby keep a giant map of all strings in the application to check new strings against to see if it can dedupe? Does it keep a reference count to each unique string that requires a set lookup to update
52.
by meisel 1y ago
What would you call TypeScript’s tsc, which translates TS to JS? Microsoft would say it’s a compiler: https://code.visualstudio.com/docs/typescript/typescript-com...
53.
by meisel 1y ago
I believe there’s no other allocator besides jemalloc that can seamlessly override macOS malloc/free like people do with LD_PRELOAD on Linux (at least as of ~2020). jemalloc has a very nice zone-based way of making itself the default,
54.
by meisel 1y ago
What are the advantages of this over using higher order functions? In Ruby I can do list.map { }.select { } …. That feels more natural (doesn’t require special language support), has a very rich set of functions (group_by, chunk_while, etc.
55.
by meisel 1y ago
This title should have “How” prepended to it
56.
by meisel 1y ago
I figured it might, but I think that this is a top of mind question for people and would be nice to make clear in the comments of the post too. So often there’s some theoretical improvement on multiplication that isn’t actually practical. R
57.
by meisel 1y ago
Is this like the Karatsuba algorithm, where it's theoretically faster but not actually faster when run on real hardware? Btw, it's worth noting that if you know that the result will be symmetric (such as is the case for X * X^T),
58.
by meisel 1y ago
Aren't there some scripting languages designed around seamless interop with Rust that could be used here for scripting/prototyping? Not that it would fix all the issues in that blog post, but maybe some of them.
59.
by meisel 1y ago
I’m surprised this isn’t getting more love. My experience with other debuggers with Rust was quite poor, I hope this one can fare much better. For example, I couldn’t call functions with previous debuggers
60.
by meisel 1y ago
These variable-length arrays are getting quite advanced

More ›