I feel the same. I don't particularly mind if a developer overrides the scrollbar, and I would actually argue that in this case it was a good way to present the story and overall I liked it, but you need to do it right. If the sites becomes all clunky, it stutters, and you get text popping up a while after you scrolled, then it's better to focus on the performance and leave aside the animations.
Lately I've been using umu-launcher [1] which is a wrapper and compatibility tool for the proton used by steam and I'm quite satisfied about it. It's shipped with configurations for 3000+ games, might be worth a try if you're having trouble with the configs.
Take it with a grain of salt, I don't have much experience in running windows application on Linux, I just had some problems with wine and I discovered umu to be pretty straightforward and easy to use.
I don't know if the engineering field has the same conventions, but in biology we use "fold" as it was used in the paper.
When comparing the signal of two things, the fold change is how many times one is bigger than the other (basically A/B). If A is 15-fold higher than B then it's 15x B.
What you described is the Log2 Fold Change (log2(A/B)), meaning that if A has a log2FC of 15 over B, its signal is 2^15 times higher, hence ≈32,000x.
> I might be guessing, but in this order probably by Optimization 3 you would reach already a high throughput that you wouldn't bother with manual simd nor Multithreading.
I agree with you though from my experience Memory Mapping is only useful if you need to jump through the file or read it multiple times (as is the case after the author added simd and a two pass step, the first to identify whitespaces and the second to parse the operation and the operants). If you just need to read the file once it's better to avoid memory mapping as it adds a little overhead.
On the other hand parsing directly from the input bytes avoiding the UTF-8 validation needed to have &str type is easy enough to do but still improves performance quite a bit. Even the rust csv crate, which does much more, is around 30% faster with this optimization. https://docs.rs/csv/latest/csv/tutorial/index.html#amortizin...
This is to say, my list for "easy optimizations, big gains", would be 1) Do not allocate a Vector — 2) Do not use peekable — 3) Avoid utf8 validation.
I'm still guessing, but I think memory mapping can be skipped, and might be worth it only if you plan on also implementing simd.
Can you set a restriction so that each user cannot change the email if it has already been changed during the last hour/day? In this way you won't need to ban IPs while still allowing legitimate users to change their emails or to create new accounts.
