tylerhou

9 ms·

61.
by tylerhou 2y ago
Is there source code / a GitHub link with more information?
62.
by tylerhou 2y ago
My guess is that without operating system support or equivalent, there is not an easy way to avoid extracting the zip file. (You could patch syscalls in the Python interpreter to read from the zip file for certain paths, but that might be h
63.
by tylerhou 2y ago
It’s not as difficult as you might think; take the recursive code and turn it into CPS style.
64.
by tylerhou 2y ago
Think they are aerobically fit but can't run a 5km in less than 20 minutes and can't run a 10km at all. Is this a typo / did you mean 30 minutes? 5k in 20 minutes is already maybe top 2% of people who compete in races. And ru
65.
by tylerhou 2y ago
It might have been https://research.swtch.com/nih ?
66.
by tylerhou 2y ago
In StarCraft II you can resume from replay (and maybe in previous games as well), but I don't know if this has ever actually been used due to bugs in the game engine during competitive play.
67.
by tylerhou 2y ago
You don't need to synchronize the server and the client. The point of determinism is to be able to reproduce game states deterministically, not to have people play the video game deterministically. Again, this is to "undo" bu
68.
by tylerhou 2y ago
You can still achieve determinism by treating the measured delta-time as an input, and resimulating the game with recorded delta-time. This may not be feasible on public servers, but is definitely feasible for professional play where determ
69.
by tylerhou 2y ago
gcc, msvc, and clang both produce code that exits with code 2: https://godbolt.org/z/WEYjns85Y
70.
by tylerhou 2y ago
React used to be licensed as BSD + recovable patents: https://engineering.fb.com/2017/08/18/open-source/explaining...
71.
by tylerhou 2y ago
You can also use difference of squares. 6*8 = (7-1)*(7+1) = 7^2-1 = 49-1 = 48.
72.
by tylerhou 2y ago
You may be interested in a paper which appeared at SIGMOD: https://dl.acm.org/doi/10.1145/3639257
73.
by tylerhou 2y ago
As of a few years ago (not sure about now) the backtrace frame info for anonymous functions were far worse than ones defined via the function keyword with a name.
74.
by tylerhou 2y ago
(As the article claims) even with computed goto register assignment of the most frequently used variables is fragile because the CFG of the function is so complicated. Register assignment is much less fragile when each function is small and
75.
by tylerhou 2y ago
There is also a difference between suggesting a price to an uninformed, individual participant vs. highly informed participants that control large segments of the market.
76.
by tylerhou 2y ago
Apparently temporary materialization also occurs when “when a prvalue appears as a discarded-value expression.” https://en.cppreference.com/w/cpp/language/implicit_conversi... So yes, storage for the (to-be d
77.
by tylerhou 2y ago
Re: the last paragraph, C++ has temporary materialization — space for temporary objects is not actually “allocated” until the object needs storage (commonly when it binds to a reference). The problem is that push_back takes by rvalue refere
78.
by tylerhou 2y ago
Generally no. They could refund their donations and ask their donators to donate to the new campaign. Or they could donate to a superpac.
79.
by tylerhou 2y ago
An engineer on the Search team at Google designed some novel way to serialize parts of the search index so that it could be updated more easily.
80.
by tylerhou 2y ago
As the problems become harder, you can’t just Google for solutions. Really great engineers often build things that nobody has ever built before — or at least not documented how they built it publicly. If you don’t have fluency in the fundam
81.
by tylerhou 2y ago
https://www.youtube.com/watch?v=zqmOSMAtadc Related video from Practical Engineering video on rail thermal expansion
82.
by tylerhou 2y ago
There is a big difference between one VCS handling 1,000 QPS and 1,000,000 VCS instances each handling 0.001 QPS. A system built for one is not necessarily suitable for the other.
83.
by tylerhou 2y ago
Data in Piper (actually, even in SrcFS…?) is stored forever. So the cost of a “small” amount of data like few gigabytes can add up over time (cost for storage, replication, transmission, etc.)
84.
by tylerhou 2y ago
According to the article, employees were allowed to take a “generous” severance package if they did not want to relocate.
85.
by tylerhou 2y ago
One benefit to defining the codomain of a random variable as a (real) number because it makes defining the expectation of a random variable easier to understand. (Of course, it is possible to define the expectation more abstractly, but peop
86.
by tylerhou 2y ago
wc2 is faster than wc, but unless I am missing something, I can't find an instance where the author benchmarked wc2 with the core state machine loop replaced with branches. wc2 and wc might be compiled with different flags / use a
87.
by tylerhou 2y ago
There are fewer branches but there is now a data dependency between loop iterations which makes each iteration slightly slower (maybe 1-2 cycles additional latency per iteration). Because newlines are relatively common and unpredictable a s
88.
by tylerhou 2y ago
Even if you get global approval it is still good to split CLs to avoid e.g. merge conflicts.
89.
by tylerhou 2y ago
Check out Koka, a “legit” language with an algebraic effect system. https://koka-lang.github.io/koka/doc/book.html#why-handlers
90.
by tylerhou 2y ago
Exceptions are less expensive in the unexceptional case. Consuming a Result value requires a branch to see whether it holds Error. That is not necessary if the function returns a value directly (and throws an exception on error).

More ›