Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
Arnavion
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
8 ms
·
61.
▲
by
Arnavion
1y ago
>This dance to get access is just a minor annoyance for me, but I question how it proves I’m not a bot. These steps can be trivially and cheaply automated. >I think the end result is just an internet resource I need is a little harder
62.
▲
by
Arnavion
1y ago
Oh I see.
63.
▲
by
Arnavion
1y ago
systemd's method does not require the service process to have access to the original creds file, or even the filesystem that contains it. In fact the original credentials file might even be an encrypted file and the key (and/or ha
64.
▲
by
Arnavion
1y ago
Yes, C#'s DSL that compiles to SQL (LINQ-to-SQL) does the same thing, `from` before the other clauses, for the same reason that it allows the IDE code completion to offer fields while typing the other clauses.
65.
▲
by
Arnavion
1y ago
>Just an example of systemd limitation is that systemd does not support musl, so if you want to build a tiny embedded sysroot, you already have some limitations. OpenEmbedded has carried a patchset to build systemd against musl for use i
66.
▲
by
Arnavion
1y ago
You can do it with an NS record, ie _acme_challenge.realdomain.com pointing to the DNS server that you can program to serve the challenge response. No need to make a CNAME and involve an additional domain in the middle.
67.
▲
by
Arnavion
1y ago
It is also how RISC-V floating point registers are required to store floats of smaller widths. Eg if your CPU supports 64-bit floats (D extension), its FPU registers will be 64-bit wide. If you use an instruction to load a 16-bit float (Zfh
68.
▲
by
Arnavion
1y ago
Could be a monitor with a mini PC on the back.
69.
▲
by
Arnavion
1y ago
I stand corrected. I didn't know rustc supported such a coercion automatically. Now I see it is documented in CoerceUnsized + Unsize. That said, other than the problem of this being a breaking API change for Read::read_to_end, another
70.
▲
by
Arnavion
1y ago
>No option to disable this either, per discussion in https://bugs.debian.org/cgi-bin/bugreport.cgi?bug=1085370 The discussion in that bug is that the Debian maintainer (and upstream dev) is open to an upstream patch
71.
▲
by
Arnavion
1y ago
It's also not a wasted skill. Once you've learned how to `git send-email` for the sake of one project, you're now prepared to do the same for others.
72.
▲
by
Arnavion
1y ago
First of all, `dyn Vec` is impossible. Vec is a concrete type, not a trait. I assume you meant `Vec<u8, dyn Allocator>`. Second, no a `&mut Vec<u8, A>` is not convertible to `&mut Vec<u8, dyn Allocator>`. This kind
73.
▲
by
Arnavion
1y ago
The article is about how and why mixing allocators fails, not if it fails or how to fix the problem.
74.
▲
by
Arnavion
1y ago
>But with the upcoming support for passing an allocator to any data structure (in the Rust standard library anyway) I think this gets a lot easier? Yes and no. Even within libstd, some things require A=GlobalAlloc, eg `std::io::Read::rea
75.
▲
by
Arnavion
1y ago
I don't know what examples you've been seeing. The interop structs are just regular Rust structs with the `#[repr(C)]` attribute applied to them, to ensure that the Rust compiler lays the struct out exactly as the C compiler for t
76.
▲
by
Arnavion
1y ago
I see. I've never had to deal with any Option ROMs myself. In that case the easier option is to add their hash to db?
77.
▲
by
Arnavion
1y ago
`fn partition[T: ...]` uses `[]` to define T. `s: Slice(T)` uses `(T)` to invoke the type constructor `Slice` with the type argument T. So you could say that's fine because these are different operations. But then defining a type const
78.
▲
by
Arnavion
1y ago
There is also the option of enrolling your own certs and resigning the bootloader and any Option ROMs you need, if you're really worried / expect to actually be broken by this.
79.
▲
by
Arnavion
1y ago
The reason Rust doesn't have those things in libstd is because it doesn't want to commit to backward compatibility for them. Note that Rust is 1.0 and has no plans to switch to 2.0. Zig will presumably have the same care about bac
80.
▲
by
Arnavion
1y ago
There isn't anything fundamental about Zig that makes it immune from package explosion. It simply isn't popular and stable enough for that to have happened yet.
81.
▲
by
Arnavion
1y ago
>> 9. the end-to-end encryption is also annoyingly fragile >Not any more; we fixed it over the course of 2024 [...] If anyone sees Unable To Decrypt messages these days (at least on Element Web or Element X + Synapse) we need to kn
82.
▲
by
Arnavion
1y ago
Just an idea. In my SwayWM setup, a) I run every application in its own cgroup (via systemd-run), and b) I have a daemon that subscribes to window and workspace events, gets the current tree, figures out the PIDs corresponding to invisible
83.
▲
by
Arnavion
1y ago
Proc macros themselves are slow too. If you compile them in debug mode, they run slowly. If you compile them in release mode, they run faster but take longer to compile. This is especially noticeable with behemoth macros like serde that use
84.
▲
by
Arnavion
1y ago
>It's not great, but you can't expect people to fix everything, especially for fairly minor issues like this. 1. It's not a minor issue that a privacy feature doesn't work. 2. OP clearly stated ( https://gi
85.
▲
by
Arnavion
1y ago
Stacked borrows is miri's runtime model. Run it under miri and you will see the error reported for the `*x = 10;` version but not the `write(x);` version - "Undefined Behavior: attempting a write access using [...] but that tag do
86.
▲
by
Arnavion
1y ago
The * value is the result of converting 10 miles to meters, as requested. The / value is the inverse of that in case you wanted that, ie 0.1 meters in miles. It's explained in `man 1 units`
87.
▲
by
Arnavion
1y ago
>Have you actually ever encountered such a bug in tmux though? Because I've been using it for around 15 years and can honestly say I haven't. Since you asked, once every few months or so the whole server crashes which takes out
88.
▲
by
Arnavion
1y ago
The article says to use the "XOR of all elements" method to find u^v, then do the partitioning, then use the "XOR of all elements" method on the first partition to find u, then use the "XOR of all elements" met
89.
▲
by
Arnavion
1y ago
Even with the original formulation, the array doesn't have to fit in available memory. mmap exists.
90.
▲
by
Arnavion
1y ago
It doesn't matter. Overflow is a non-issue as long as you have wrapping addition and subtraction operators, which C# does - regular `+` and `-` not inside `checked {}`. You don't need to reach for BigInteger.
More ›