apd_
In this example the second $ won't trigger the first $:
let a = 1;
let b = 1;
$: if (a > 0) { b += 1 }
$: if (b > 0) { a += 1 }
With React's useEffect one can easily falls into the trap of an infinite re-rendering: let a = 1;
let b = 1;
useEffect(() => {
b += 1;
}, [a]);
useEffect(() => {
a += 1;
}, [b]);
Great framework are supposed to prevent this kind of loophole. Location: Indonesia
Remote: Yes
Willing to relocate: Yes
Technologies: JavaScript, TypeScript, React, Svelte, Rust, Python, Pandas, PostgreSQL, Docker
Résumé/CV: Available upon request
Email: hiagusputradana at gmail
I’m the creator of Rust Explorer[1], a fast Rust playground that supports the top 10k crates.I’d like to join an early stage startup.
I usually work at night between 11.00 - 19.00 UTC. I also consider relocating depending on the offer.
Show HN: Rust Playground with the top 10k Crates
[1] https://web.archive.org/web/20220604230938/https://willfenne...
Five YouTubers. Five games. $10k
HN is a tech community, which means there're many programmers here. Some people may use X and also contribute to X, or at least want to dig into the source code.
For example, since I'm a Rust programmer and not an R programmer, I'm more interested in "A fast query engine written in Rust" than "A fast query engine written in R". There're benefits of using a program written in a language you're familiar with. One of them is when you find a bug you can dig into the source code, post an issue which point out which code might cause the bug, better yet post a PR. Instead of "Please help, X failed to do Y."
Not true. If we'd rank them by second run Julia would be:
- On simple query: 1st, 1st, 4th, 1st, 5th (down 1).
- On advanced query: 3rd, 6th, 6th, 4th (up 1), - (out of memory).
> The databases (and spark) will have to read from disk. They have no chance of competing with anything that's reading from ram, no matter how slow it is.
Not true. Upon quick peek on the bench code, ClickHouse and Spark use in-memory table. I assume other engines too.