4,235 karma · joined September 10, 2015
Not using async or async crates is not recommended since most new or updated high quality crates now use async.
So in practice it's probably going to be fixed by the time a new game is released, and otherwise you can tell users to start the browser with the proper command line, or contribute a workaround to Godot yourself.
There's a lot of distracting glitches like the K and Q having small gaps where strokes come together, and even glyphs like the N, M, Y and Z have weird little gaps at the joints, the F and B have a bizarre overhang at the upper horizontal stroke, the 1 and 6 have a weird cut in their strokes.
There are lots of weird confusing choices like the parenthesis being a round rect instead of a bow shape, the @ having a "complex a" inside, the 3 and 5 using a "cute" diagonal layout instead of the normal "rounded-and-rect layout".
Seems horrible for something that should be as simple as possible. The default system UI fonts like DejaVu Sans, Segoe UI, Roboto, etc. are far better.
For instance, it could start with "Was", "I was", "verifying" could be "checking" or "computing" or "testing", etc.
A bit tight, but it seems feasible with some work.
If you terminate the system right after sending a form there is no guarantee that the data even left the local buffers for the network.
If it's dynamic, you can use Cow or the supercow/bos/... crates if you want Arc/Rc to be options as well.
Or in other words, the goal is that you can think in abstract what the natural optimal machine code would be for a program, and you can write a Rust program that, in principle, can compile to that machine code, with as little constraints as possible on what that machine code looks like.
Unlike C, that also has this property, Rust additionally seeks to guarantee that any code will satisfy a bunch of invariants (such as that a variable of a data type actually always holds a valid value of that data type) provided the unsafe code part satisfies a bunch of invariants.
If you use Go or Haskell, that's not possible.
For example, Go requires a GC (and thus requires to waste CPU cycles uselessly scanning memory), and Haskell requires to use memory to store thunks rather than the actual data and has limited mutation (meaning you waste CPU cycles uselessly handling lazy computations and copying data). Obviously neither of this are required for the vast majority of programs, so choosing such a language means your program is unfixably handicapped in term of efficiency, and has no chance to compile to the machine code that any reasonable programmer would conceive as the best solution to the problem.
Would be very interesting to learn how that was possible, it seems surprising to me that there wasn't even one instance that the owner forgot about or just was unwilling to do any work on.
It's possible that credit card expiration was the key, as that may have automatically disabled almost all forgotten accounts.
For example, you can walk the kernel-only page tables, find all executable pages, and scan them for a magic string that the other module puts in their text section.
And the answer is you wouldn't use it if there's a library or existing codebase in another language that is much better than the Rust equivalent, and the program is short enough that it's simpler to directly use that language rather than writing a binding or RPC interface.
Or if you need the software to be written by someone who doesn't know Rust and doesn't want to learn (but in that case, they might not be able to write a correct program in any language, so this strategy is probably best reserved when a program that only works properly sometimes is acceptable).
GrapheneOS for instance uses this mechanism.
Unfortunately you can only register one key and you have to wipe the device to change it, but that's still fine for most use cases.
The easy fix would be to cap track time weight, although that is susceptible to an attack of splitting the white noise in many parts and publishing a playlist.
I guess a possibility could be to somehow compute "song variety" (i.e. entropy in a model where the decoder can generate noise/randomness) and weight by that, but not sure if the available lossy codecs are good enough to do that.
However, maintaining a variant of Ungoogled Chromium or Vanadium targeted at desktop Linux would be feasible.
->
said of an algebraic structure such that for every x != y there exists z such that x < z and z < y
->
characteristic ("nimi"?) of a set ("poki") where for ("tawa?") all ("ale") thing ("ijo") different ("ante" + "lon"?) than other ("ante" + "nimi"?) thing ("ito") there exists ("lon") a new ("sin") thing ("ijo") such that the first ("wan" + "nimi" + "ito"?) thing is less ("lili") than the new thing ("sin" + "ito"?) and the new thing ("sin" + "ito"?) is less ("lili") that the second thing ("tu" + "nimi" + "ito"?)
Would need some way to join into a grammatical structure and probably a preamble that establishes that the context is mathematics.
"In mathematics, a real number is a number that can be used to measure a continuous one-dimensional quantity such as a distance, duration or temperature. Here, continuous means that pairs of values can have arbitrarily small differences. Every real number can be almost uniquely represented by an infinite decimal expansion."
->
"toki pi nanpa, nanpa lon li nanpa li ken lukin e suli tawa wan. lon ni la, nanpa tu li ken ala li poka li ken lili. nanpa lon ali li ken lukin kepeken nimi nanpa mute tawa pini ala"
->
"Talking about numbers, when a number is present, it can be seen to be important or significant to an individual."
"In this context, the number two might not be significant or might be seen as small or lesser."
"All numbers can be seen using many number names endlessly or without an end."
ChatGPT 4, obviously in separate chats: as you can see a complete failure to convey and roundtrip the original message.