Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
afdbcreid
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
4 ms
·
1.
▲
by
afdbcreid
9d ago
You were clear, and you were wrong. The annotations are checked like I said, you cannot break the guarantees using them. If they're incorrect they won't pass verification. They just help the verifier.
2.
▲
by
afdbcreid
9d ago
This is intended to warn prominent Rust community members. There was also a post in an internal Zulip channel for Rust project members which are at greater risk.
3.
▲
by
afdbcreid
9d ago
Because Rust is not Verus, and not all unsafe code needs formal-verification-level of rigorousness. Also, there are other verifiers as well.
4.
▲
by
afdbcreid
9d ago
You seem to have misunderstood the idea. The entire idea of proof annotations is that they are not manual. Rather, the verifier checks you fulfill the preconditions for the method you calls, and it checks inside the method that if the pre
5.
▲
by
afdbcreid
9d ago
`AsyncMethodBuilder` is a way to declare async methods that return your own task types. AFAIK it is not supported with the current runtime async, and maybe never will be - it's quite hard to support, I believe.
6.
▲
by
afdbcreid
11d ago
This wasn't GitHub's fault in any way.
7.
▲
by
afdbcreid
11d ago
> virtually every other language used for game development was originally intended to solve other problems: ... JavaScript for enabling supply chain attacks, C++ for getting rid of your remaining toes That's a good way to put it!
8.
▲
by
afdbcreid
11d ago
Incorrect. `become` does change drop order - https://play.rust-lang.org/?version=nightly&mode=debug&editi... .
9.
▲
by
afdbcreid
16d ago
Measurement is for micro-optimizations, and it's definitely important. But you should also know the complexity.
10.
▲
by
afdbcreid
16d ago
Because complexity models that involve memory hierarchy are an active research area and are super complex. Also, "plain" complexity is still useful: despite the constant factor, at large N (and this is sometimes a real possibility
11.
▲
by
afdbcreid
16d ago
It is both amortized and average, because the map may need to grow. But the complexity without growing is average, not amortized (it's possible to build hash functions for which the probability will mean O(1) for all accesses, and hash
12.
▲
by
afdbcreid
16d ago
Allegedly, there is Rust in macOS (but maybe not in iOS), so maybe it's true even if you're using Safari.
13.
▲
by
afdbcreid
16d ago
Rust is already used in production for embedded (although only here and there). Not all places are ready, but I don't believe it's a decade away anymore.
14.
▲
by
afdbcreid
16d ago
No, after this made some waves he or some other senior (I don't remember exactly) reported that this is not an official plan.
15.
▲
by
afdbcreid
16d ago
There's an interop initiative by the Rust Foundation, there is a project goal to map the problem space, there was an effort to introduce an attribute (`#[rustc_splat]`) to allow calling overloaded functions, and there are various commu
16.
▲
by
afdbcreid
16d ago
Zig too. But this is far from being mainstream. Rust took around 5 years I think to become accepted in major companies, and those languages are harder to justify.
17.
▲
by
afdbcreid
16d ago
"Keep calm and clone" is a good advice for beginners. Then it is also a good advice for experts - because when you're an expert and you just think of cloning, that probably means it is easier than borrowing which you would
18.
▲
by
afdbcreid
16d ago
> This has also been a lot less effort than writing Rust I have never written such Go, but as an experienced Rust programmer I can tell you Rust is not hard to write after learning it. Learning it can take more time than usual (although
19.
▲
by
afdbcreid
16d ago
Android is a bit special inside Google (also Chromium). They are managed outside the main monorepo (google3) and their policies are different. From what people inside Google have told me, they do want to introduce Rust into google3 but that
20.
▲
by
afdbcreid
16d ago
It could as well be the opposite, but Rust does not need a proof of quality today, certainly not from Microsoft. Still, becoming Tier 1 in major trillion-dollar corporations (Microsoft, Meta, Amazon, and I know Google also has efforts in th
21.
▲
by
afdbcreid
16d ago
Yes, about as good as a language that is 40 years old, and was also (like Rust) 10 years old when becoming Tier 1 inside Microsoft, while there were far less alternatives. Seems pretty good to me ;) (I know you're joking).
22.
▲
by
afdbcreid
16d ago
They responded in the Zulip threads that yes, this is the plan, although they don't know if and what things will be open-source yet.
23.
▲
by
afdbcreid
16d ago
It is, with extensions (using rust-analyzer of course). I don't know what's the status inside Microsoft.
24.
▲
by
afdbcreid
21d ago
Not more than regular collections (unless you mean working on different parts with different threads, then it's still possible but harder, just like with regular collections).
25.
▲
by
afdbcreid
21d ago
Internally? No. Externally? Yes. That is the point.
26.
▲
by
afdbcreid
23d ago
Easy. https://docs.rs/intrusive-collections .
27.
▲
by
afdbcreid
25d ago
Also: > This is why most large and long-running programs have abandoned low-level programming languages. That's not true, as evidenced by the fact that this move has started before extremely sophisticated JIT compilers or garbage co
28.
▲
by
afdbcreid
25d ago
I know that. I also know that JITs cannot optimize to the same amount as LLVM due to the time limit, and that C++ and Rust are allocating much, much less than Java and even C# or Go, so a faster allocation scheme is much less needed there.
29.
▲
by
afdbcreid
25d ago
> If you trust those benchmarks then you deserve whatever you pick. I was talking about experienced experts who understand performance. Low-level languages can help your performance when the program is small and they generally hurt it wh
30.
▲
Rui Ueyama: "We are rewriting the mold linker in Rust"
(twitter.com)
6 points
by
afdbcreid
25d ago
|
7 comments
More ›