AndyKelley

10 ms·

91.
by AndyKelley 1y ago
Apple.com advertising a Mac Mini: > Built for Apple Intelligence. > 16-core Neural Engine These Xcode release notes: > Claude in Xcode is now available in the Intelligence settings panel, allowing users to seamlessly add their exis
92.
by AndyKelley 1y ago
It's to keep buffered bytes buffered until the producer is ready for them to be dropped. This is relevant for example for decompression streams which keep a "window" of decompressed bytes around to refer to when matching. O
93.
by AndyKelley 1y ago
haha :)
94.
by AndyKelley 1y ago
全然怖くないよね
95.
by AndyKelley 1y ago
It's unfortunate that the original authors of this interface didn't understand how important infallibility is to resource deallocation, and it's unfortunate that NFS authors didn't think carefully about this at all, but
96.
by AndyKelley 1y ago
Wrong.
97.
by AndyKelley 1y ago
It's a bug to flush (fallible operation) in a destructor (infallible operation).
98.
by AndyKelley 1y ago
My point is that the application doesn't have to care if it's running in Gnome or KDE. It just speaks Wayland protocol and then it gets a Window and some UI in it. The gnome window manager / KDE window manager then makes that
99.
by AndyKelley 1y ago
That's precisely the point! It would be really nice for applications to be able to operate agnostic from the DE's decisions about UX and design. Applications want something much more high level: button here, scroll bar there, text
100.
by AndyKelley 1y ago
Yeah. I just wish Microsoft were better stewards of the OS.
101.
by AndyKelley 1y ago
Windows is becoming less and less of a platform every year
102.
by AndyKelley 1y ago
Oh, I would love it if Wayland provided a standard UI toolkit (server-side)! Is that a thing that happened when I wasn't looking?
103.
by AndyKelley 1y ago
True pirates maintain > 1.0 ratio
104.
by AndyKelley 1y ago
Missing SIMD functionality is welcome issue reports. Obviously we're not going to copy the C intrinsics directly since Zig SIMD is portable, but everything should be expressible. It doesn't really have to do with what operations L
105.
by AndyKelley 1y ago
Indeed: https://github.com/ziglang/zig/issues/1629
106.
by AndyKelley 1y ago
I'd like to note that std.json, as it currently stands, is not a good example of proper error handling. Unless you use that awkward lower level Scanner API, if you get a schema mismatch it reports some failure code and does not populat
107.
by AndyKelley 1y ago
one of my favorite songs embodies this concept: https://soundcloud.com/adventurecapitalists/moving-mt-fuji lyrics: https://genius.com/Adventure-capitalists-moving-mt-fuji-lyri... but it's not the
108.
by AndyKelley 1y ago
What a lazy and worthless analysis. It argues, poorly, that big tech created the golden age of programming until the economy destroyed it while purportedly arguing the opposite.
109.
by AndyKelley 1y ago
I think you're misinterpreting OP's excitement here. The technique isn't novel but the ergonomics are. > you can implement this pattern ergonomically in C++, lmao
110.
by AndyKelley 1y ago
2017: https://github.com/ziglang/zig/issues/225 when I had been only thinking about zig for 2 years, I thought the same.
111.
by AndyKelley 1y ago
Bingo. That completes the picture: https://github.com/ziglang/zig/issues/23367
112.
by AndyKelley 1y ago
You can put a big buffer on the stack, and use this buffer to break your cycles. At some point you'll run out of this buffer and be forced to handle failure, rather than triggering a stack overflow segfault. So it will be the same thin
113.
by AndyKelley 1y ago
Zig's linker will calculate this information automatically in most cases when statically linking (via analysis of machine code disassembly). Otherwise, there is a default upper bound stack value, overridable via user annotation.
114.
by AndyKelley 1y ago
All Zig code is in one compilation unit, so the compiler has access to the entire function call graph. Cycles in the graph (recursion) cause an error. To break cycles in the graph, one must use a language builtin to call a function using a
115.
by AndyKelley 1y ago
Wisdom
116.
by AndyKelley 1y ago
Note that not having runtime-known stack allocations is a key piece of the puzzle in Zig's upcoming async I/O strategy because it allows the compiler to calculate upper bound stack usage for a given function call. At a fundamental
117.
by AndyKelley 1y ago
That's totally fair to be salty about a legitimately annoying situation. But I think it's actually an interesting, fundamental complexity of computer science, as opposed to some accidental complexity that LLVM is bringing to the t
118.
by AndyKelley 1y ago
Sounds like not HTTP 1.1's problem.
119.
by AndyKelley 1y ago
HTTP/1.1 is nice and simple compared to HTTP/2, which I think is severely overengineered. This "desync" attack seems completely pointless, it's not going to bypass TLS, and if you're not using an encrypted tran
120.
by AndyKelley 1y ago
No, I hadn't read the linked thread until you prodded me. Now I have and I understand the situation entirely. I'll give a brief overview; feel free to ask any followup questions. A straightforward implementation of memchr, i.e. fi

More ›