NobodyNada

10 ms·

91.
by NobodyNada 1y ago
> if you `Vec::reserve_exact` with size N, fill to N, and then append a single element you are guaranteeing that that first append triggers a potentially O(N) resize. The documentation does not guarantee this, because memory allocators
92.
by NobodyNada 1y ago
In this case, the implementation is not free to ignore calls to reserve or reserve_exact -- the documentation makes explicit guarantees about this: "After calling reserve, capacity will be greater than or equal to self.len() + additi
93.
by NobodyNada 1y ago
> I strongly oppose any kind of "panopticon" like ChatControl. What I would like to see, is, say, Signal [...] provide cleartext contents of communications to/from a cleary identified party Those statements simply aren&#x2
94.
by NobodyNada 1y ago
Right. The comment you replied to said "Rc/Arc and some manual management" -- "some manual management" implying that you need to account for the change to semantics in the manner appropriate for your application.
95.
by NobodyNada 1y ago
The discussion is about a project for securing legacy code by machine-translating it to Rust. Fil-C is an alternative way to secure legacy code using a different C implementation. I think that's highly relevant to the discussion.
96.
by NobodyNada 1y ago
> The argument for using Rust instead of a memory safe implementation of C is all about performance. And that’s not a bad argument! But we should be honest about it. This is half of it; the other half is that there's more to writing
97.
by NobodyNada 1y ago
Sure it does. Make the backreferences weak, or use a library that provides cycle detection (or even full-on tracing GC if you really want).
98.
by NobodyNada 1y ago
I'm about as AI-pessimist as it gets, but Kagi's use of LLMs is the most tasteful and practical I've seen. It's always completely opt-in (e.g. "append a ? to your search query if you want an AI summary", as opp
99.
by NobodyNada 1y ago
> Probably somewhere on the internet is a fantastic interactive diagram that would clearly demonstrate this for you, but I couldn't google one up. Links solicited. Here's one: https://apenwarr.ca/beamlab -- as
100.
by NobodyNada 1y ago
For what it's worth, your initial comment showed for me as dead (i.e. shadowbanned) until I vouched for it (within an hour or so after you posted it). It would appear you managed to trip some filters with this thread :)
101.
by NobodyNada 1y ago
> it's banned some places "Engine braking" bans usually target jake braking [0] (opening the exhaust valve at the end of the compression stroke), which greatly increases the effect of engine braking at the cost of producin
102.
by NobodyNada 1y ago
This is definitely an actual phenomenon on HN -- someone posts something interesting and it gets a bunch of HNers to go down the rabbit hole together. A couple weeks ago there was one about leeches: "You shouldn't salt a leech tha
103.
by NobodyNada 1y ago
I think the headline is wrong: at 20:18 in Apple's presentation, the presenter said they expect to notify one million people during the year, not 100 million.
104.
by NobodyNada 1y ago
Of course. I usually don't 100% metroidvanias for this reason. But I also don't usually look up a guide (unless I really want to find a specific boss or secret or something). I just put the game down and come back to it later if I
105.
by NobodyNada 1y ago
#2 seems like a technically solvable problem: AES-encrypt the preload and distribute the key on launch day.
106.
by NobodyNada 1y ago
Sure, but the viral meme aspect is because HK was such a well received game and Silksong has been so highly anticipated for so long, not the other way around. It certainly contributes to the hype today, but memes are not the reason for th
107.
by NobodyNada 1y ago
I don't think that's necessary. Hollow Knight is a game whose appeal comes from exploring a massive, beautiful world and and discovering its secrets -- using a guide would take away a lot of the fun, at least for me. Yeah, HK is a
108.
by NobodyNada 1y ago
Applying this to answer the question directly -- no, this doesn't waste CPU cycles or memory because UIPickerView only keeps the visible rows in memory and generates them lazily as you scroll. Thus, the number of rows does not affect t
109.
by NobodyNada 1y ago
Zig's trying to be a "nicer C" that's easy to learn and fast to compile. It's a great language with a lot of neat design, and definitely setting itself up to be a "valid challenger" in a lot of the systems
110.
by NobodyNada 1y ago
I was specifically responding to the statement "Zig and rust do not have the same scope. I honestly do not think they should be compared". I don't know enough Zig to have a qualified opinion on the particular example (besides
111.
by NobodyNada 1y ago
Rust and Zig are the two most prominent new systems programming languages. It's only natural for people to compare them, from perspectives such as "I'm starting a project and need to choose what language to use". The lan
112.
by NobodyNada 1y ago
The way that this fully works together is: - The return type of Mutex::lock() is a MutexGuard, which is a smart pointer type that 1) implements Deref so it can be dereferenced to access the underlying data, 2) implements Drop to unlock the
113.
by NobodyNada 1y ago
...Huh? Why would that be sad? My parents have formative memories of watching the moon landings as kids, and I of watching the space shuttle. As someone who ended up where I am in large part due to my curiosity about the world growing up, r
114.
by NobodyNada 1y ago
> Apple CPU's are even optimized for Apple software GC calls like Retain/Release objects. I assume this is referring to the tweet from the launch of the M1 showing off that retaining and releasing an NSObject is like 3x faster.
115.
by NobodyNada 1y ago
There have definitely been some applications of this sort of thing to speedrunning -- though far less sophisticated than the approach here, and usually only testing against a very small subset of the game. I've heard of some of this ki
116.
by NobodyNada 1y ago
That works! (The braces are droppable for 16-bit codepoints in JS, but required in Rust.)
117.
by NobodyNada 1y ago
That would be "\U0001F926\U0001F3FC\u200D\u2642\uFE0F" in Python's syntax, or "\u{1F926}\u{1F3FC}\u{200D}\u{2642}\u{FE0F}" in Rust or JavaScript. Might be a little long for a title :)
118.
by NobodyNada 1y ago
The math in the article assumes scrapers only need one Anubis token per site, whereas a scraper using 500,000 IPs would require 500,000 tokens. Scaling up the math in the article, which states it would take 6 CPU-minutes to generate enoug
119.
by NobodyNada 1y ago
It's impossible to prove a negative, like "Apple doesn't have a backdoor". One can prove the existence of a backdoor by reverse-engineering suspicious code or network traffic, but not the non existence without poring ov
120.
by NobodyNada 1y ago
My understanding is that AI scrapers rotate IPs to bypass rate-limiting. Anubis requires clients to solve a proof-of-work challenge upon their first visit to the site to obtain a token that is tied to their IP and is valid for some number o

More ›