Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
fweimer
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
21 ms
·
421.
▲
by
fweimer
2y ago
Any idea what this means for Google Drive support in rclone and similar tools?
422.
▲
by
fweimer
2y ago
Comparing PIE executables is a bit of an anachronism. They did not really exist when x86-64 was introduced. Position-dependent executables are more compact on i386 because its lack of PC-relative addressing (the %rip stuff on x86-64) does n
423.
▲
by
fweimer
2y ago
I don't think constructors are the challenging part. It's about lexically scoped destruction. Certainly there are languages that have that and permit garbage collection, however those constructed values are necessarily second-clas
424.
▲
by
fweimer
2y ago
The 6-bit byte was still common at the time. Previous DEC machines had word sizes like 12 bits, 18 bits, or 36 bits. Apparently, the PDP-11 instruction encoding mostly had field widths that are multiples of three bits (although the opcode f
425.
▲
by
fweimer
2y ago
B-trees are supposed to address the bad cache behavior of binary trees because they are generally much shallower. Crit-bit trees as originally described do not have this property.
426.
▲
by
fweimer
2y ago
One issue is that with GC, you lose prompt finalization of resources. A lot of code is written with this assumption in mind (e.g., file buffers are flushed if the last reference to the file is dropped—which is arguable incorrect due to the
427.
▲
Register Allocation in the Go Compiler
(developers.redhat.com)
3 points
by
fweimer
2y ago
|
1 comments
428.
▲
by
fweimer
2y ago
Competitors likely have the resources to figure out how to be compliant (with or without giving back), so that's not really it. And as far as I understand the startup situation, most struggle to attract paying customers at all. If you
429.
▲
by
fweimer
2y ago
Pull requests predate Git. The kernel developers used them in the Bitkeeper days: I exported this a patch and then imported onto a clone of Marcelo's tree, so it appears as a single cset where the changes that got un-done
430.
▲
by
fweimer
2y ago
GCC is still expected to bootstrap from a C++11 compiler. (For self-hosting compilers, language version choice is not only about useful language features.) The built compiler defaults to C++17. I think the remaining obstacle before moving t
431.
▲
by
fweimer
2y ago
Some are not. You can try this: diff --git a/src/runtime/mgc.go b/src/runtime/mgc.go index a2b6b979c1..d2f2852294 100644 --- a/src/runtime/mgc.go +++ b/src/runtime
432.
▲
by
fweimer
2y ago
As far as I can tell from the article, the primary coolant loop extends to the surface, and that's a key aspect of the proposal. Obviously not everything is very far down. The idea certainly is cute, but potential failure modes look mo
433.
▲
by
fweimer
2y ago
It has happened with OpenJDK, first downstream with the IcedTea distribution, and then gradually things were replaced upstream or opened by Oracle. I think today, only the browser plugin is missing, and nobody really wants that anymore. It&
434.
▲
by
fweimer
2y ago
It should not break userland. GNU/Linux (not necessarily Android though) has supported 64K pages pretty much from the start because that was the originally page size chosen for server-focus kernels and distributions. But there are some
435.
▲
by
fweimer
2y ago
If the fallback path can be invoked repeatedly for one message (depending on message size), the tail call is a correctness issue because your stack is probably not going to be large enough to keep all the fallback path frames.
436.
▲
by
fweimer
2y ago
It's a hard problem because many ABIs cannot do tail calls even for very basic stuff, like calls to extern functions with matching argument and return types. It looks like Clang has some heuristics for changing call sequences for mustt
437.
▲
by
fweimer
2y ago
Some widely-installed GNOME applications are written in it. The compiler (actually a transpiler to C) has some issues and couldn't really be adopted to emit standard C: https://gitlab.gnome.org/GNOME/vala/-&#x
438.
▲
by
fweimer
2y ago
It depends on the CLA. In some countries, you cannot not have a CLA because there's always an implied contract. Many CLAs are just a hassle (basically, DCO that has to be reviewed by the legal department). But a lot are asymmetrical in
439.
▲
by
fweimer
2y ago
I think it's mentioned in this document: https://www.apache.org/foundation/records/certificate.html
440.
▲
by
fweimer
2y ago
The AGPL does not restrict running the program. Only if you run modified versions, things get complicated. That being said, I think the AGPL is only appropriate for programs that come with a built-in source redistribution mechanism that ens
441.
▲
by
fweimer
2y ago
I would assume that this site is completely unaffiliated with the Staub brand. Their official web site is here: https://www.zwilling.com/us/staub/
442.
▲
by
fweimer
2y ago
On the hand, g is about 32.2 ft/s². So it's suddenly related to π³? I think there's no connection at all, it's just an accident. It would be really weird if some contemporary property of the earth were actually related t
443.
▲
by
fweimer
2y ago
The technical details have been published: https://ghostwriteattack.com/riscvuzz.pdf ; t0 = physical address, a0 = byte to be written vsetvli zero, zero, e8, m1 vmv.v.x v0, a0 ; encoded: 0x10028027 vse
444.
▲
by
fweimer
2y ago
There's also the macro expansion/amplification issue (explained at the end of the page you reference). _Generic seems a dead end, it doesn't even work in practice for <tgmath.h>.
445.
▲
by
fweimer
2y ago
I don't quite get what the problem is here. Has Adobe already updated their subscription offerings? I see both yearly and monthly subscription options. If anything, it's unusual that you can subscribe to an annual plan and get out
446.
▲
by
fweimer
2y ago
Don't these public clusters exist today, and have been around for decades at this point, with varying architectures? In the sense that you submit a proposal, it gets approved, and then you get access for your research?
447.
▲
by
fweimer
2y ago
This seems to be the other direction. I assume the question was about extracting a cryptographic proof from a TLS session that (say) a bank statement downloaded over HTTPS (in HTML, no API) has not been tampered with. I really doubt this is
448.
▲
by
fweimer
2y ago
That's what I meant with a common understanding of what the ciphertext is. I don't think this is possible if all you have is your own recording of the ciphertext, with no proof that it was actually transferred over the wire. This
449.
▲
by
fweimer
2y ago
Surely you can have one layer per directory or something like that? Splitting along those lines works as long as everything isn't in one big file. I think it was a mistake to make layers as a storage model visible in to the end user. T
450.
▲
by
fweimer
2y ago
Do you mean that you can prove to a third party that a TLS transcript is accurate? Then the answer is no. TLS authenticates application data with a symmetric algorithm based on a negotiated secret. To verify authenticity, you need to disclo
More ›