That's basically exactly what Go's `go` keyword does. Good design in my opinion.
this project is pretty interesting, although i'm wondering how they're planning to address the "easy sandboxing" design goal in a compiled language with raw pointer arithmetic and clib interop... in that regard i think…
The operation is slightly more complex yes, but has there ever been an x86 CPU where SUB or XOR takes more than a single CPU cycle?
I may have missed something when skimming the paper, but it sounds like Xor filters are constructed offline and can't be modified efficiently afterwards, whereas Bloom filters can be inserted into efficiently. So they…
I wonder if the reason the escape analysis fails could be that, for small enough types, the concrete value is directly inlined inside the interface value, instead of the latter being "a smart pointer" as the author…
I'll have to disagree here. Leaking resources in Rust is pretty trivial: create an Rc cycle with internal mutability. By contrast, in languages with a GC, cycles will be properly collected. And there is nothing…
In Zig's case, you do what Rust/C++ do implicitly and create a table of function pointers
Ah, you're right, I didn't see it's a more recent addition.
I think "packaging" here refers to the process of putting the silicon die in its plastic casing and connecting the die's pad to the case's pins, see https://en.wikipedia.org/wiki/Integrated_circuit_packaging
The author claims that mmap is exposed by glibc whereas memfd_create is not, so they reimplemented it with syscall, but looking at the man page, did they just forget to #define _GNU_SOURCE?
in what way is unicode similar to html, docx, or a file format? the only features I can think of that are even remotely similar to what you're describing are emoji modifiers. and no, this webpage is not result of…
If you want that projection to still be expressible as a matrix transformation, I don't think that's possible.
indeed, Rust can be fast, if you know what you're doing. this indeed means not making unnecessary allocations, but in my opinion, it also means... using byte-based indices instead of insisting on char-based indices, ie.…
given that unix time specifically does not handle leap seconds well, i'm not sure i would say they "had it right" all along
how the hell do they get to a quadrillion? even multiplying the two factors of 100,000 that are mentioned with no regard for coherence doesn't get you that high
that was only the power to the energy measuring device i believe.
your compiler might choose to make that the "implementation-defined behavior", but another compiler could choose to always ignore it and give you no easy means of diagnosis. my understanding is that the proposal of…
“the 2⁵² numbers between 0 and 1 that double precision floating point can represent” it's a bit of a nitpick, but i believe there are 1023×2⁵² such numbers, which is quite a bit more. there are 2⁵² double precision…
That's basically exactly what Go's `go` keyword does. Good design in my opinion.
this project is pretty interesting, although i'm wondering how they're planning to address the "easy sandboxing" design goal in a compiled language with raw pointer arithmetic and clib interop... in that regard i think…
The operation is slightly more complex yes, but has there ever been an x86 CPU where SUB or XOR takes more than a single CPU cycle?
I may have missed something when skimming the paper, but it sounds like Xor filters are constructed offline and can't be modified efficiently afterwards, whereas Bloom filters can be inserted into efficiently. So they…
I wonder if the reason the escape analysis fails could be that, for small enough types, the concrete value is directly inlined inside the interface value, instead of the latter being "a smart pointer" as the author…
I'll have to disagree here. Leaking resources in Rust is pretty trivial: create an Rc cycle with internal mutability. By contrast, in languages with a GC, cycles will be properly collected. And there is nothing…
In Zig's case, you do what Rust/C++ do implicitly and create a table of function pointers
Ah, you're right, I didn't see it's a more recent addition.
I think "packaging" here refers to the process of putting the silicon die in its plastic casing and connecting the die's pad to the case's pins, see https://en.wikipedia.org/wiki/Integrated_circuit_packaging
The author claims that mmap is exposed by glibc whereas memfd_create is not, so they reimplemented it with syscall, but looking at the man page, did they just forget to #define _GNU_SOURCE?
in what way is unicode similar to html, docx, or a file format? the only features I can think of that are even remotely similar to what you're describing are emoji modifiers. and no, this webpage is not result of…
If you want that projection to still be expressible as a matrix transformation, I don't think that's possible.
indeed, Rust can be fast, if you know what you're doing. this indeed means not making unnecessary allocations, but in my opinion, it also means... using byte-based indices instead of insisting on char-based indices, ie.…
given that unix time specifically does not handle leap seconds well, i'm not sure i would say they "had it right" all along
how the hell do they get to a quadrillion? even multiplying the two factors of 100,000 that are mentioned with no regard for coherence doesn't get you that high
that was only the power to the energy measuring device i believe.
your compiler might choose to make that the "implementation-defined behavior", but another compiler could choose to always ignore it and give you no easy means of diagnosis. my understanding is that the proposal of…
“the 2⁵² numbers between 0 and 1 that double precision floating point can represent” it's a bit of a nitpick, but i believe there are 1023×2⁵² such numbers, which is quite a bit more. there are 2⁵² double precision…