chrchang523

6 ms·

1.
by chrchang523 4mo ago
and you CAN use static_cast to convert from void*; this silently keeps working if you refactor the void* into a matching-type pointer later, while raising a compilation error if you refactor to a different-type pointer.
2.
by chrchang523 5mo ago
Other things worth noting about denormal numbers: - It’s not just ‘old’ FPUs that handle them verrry slowly. Benchmark this aspect of your target processors if this detail matters. - Most modern processors provide a “flush to zero” denorma
3.
by chrchang523 1y ago
Note that BGZF solves gzip’s speed problem (libdeflate + parallel compression/decompression) without breaking compatibility, and usually the hit to compression ratio is tolerable.
4.
by chrchang523 1y ago
Yes, though I think tooling could be better; if I had more spare time I'd write a linter which flagged defers in loops that didn't come with an accompanying comment.
5.
by chrchang523 2y ago
The problem with cgo is the high function-call overhead; you only want to use it for fairly big chunks of work. Calling an assembly function from Go is a lot cheaper. https://pkg.go.dev/github.com/grailbio/base&#x
6.
by chrchang523 2y ago
I found it useful to walk through evaluation of a few elementary instances of this class using simpler methods, to put the main result in perspective. Specifically, replace the initial 3 exponent with 0 or 1. If the exponent is 0, then you
7.
by chrchang523 2y ago
Two-bit values are common in bioinformatics, and I’ve found the ability to efficiently convert between packed arrays of 1- and 2-bit values to be valuable in that domain.
8.
by chrchang523 2y ago
One question: it is possible for the XOR of two consecutive floating-point numbers to have 32-63 leading zeros; the numbers 32-63 do not fit in 5 bits. I imagine this is treated by Gorilla like 31 leading zeros?
9.
by chrchang523 3y ago
(2008)
10.
by chrchang523 3y ago
The mod 1000 is actually a consequence of the test format: all answers are integers in [0, 999], you fill in 3 digit-bubbles.
11.
by chrchang523 3y ago
Suppose the value of a network to an individual user is proportional to the number of users. Then the total value of the network, summed across all its users, is proportional to the square of the number of users. See also https:/&#x2
12.
by chrchang523 3y ago
Yup, and that's why I'd consider this a "101" essay. The larger exponential-growth trends (e.g. Moore's Law) practically always have a microstructure with many sigmoid curves. After you've encountered your fi
13.
by chrchang523 3y ago
The slave-owners were slave-owners because they had military control over the slaves. (Most of the time, anyway; some slave revolts were successful.) It is not clear how long humans will retain control over AIs.
14.
by chrchang523 3y ago
Yup. This 24-year-old game was so culturally significant in the Eastern Bloc that there was a piano concert in Warsaw dedicated to it last month: https://gmfest.com/2023/06/19/paul-anthony-romero-heroes-pia..
15.
by chrchang523 3y ago
No, the idea is that you manually make some allocations downward from the top and some allocations upward from the bottom. The bumping code is as simple as in the unidirectional case. The tricky part is choosing in a way that puts you noti
16.
by chrchang523 3y ago
Incidentally, you can choose to bump in both directions. It's more complicated (you need to keep track of which end you allocated each data structure on), but in exchange, the allocator becomes sufficient for many more use cases. Give
17.
by chrchang523 3y ago
I recently started running HOMM3 HD on my Mac with Porting Kit, which has been working great: https://www.portingkit.com/game/236 .
18.
by chrchang523 3y ago
Sure, but there isn't even an offhand remark about how hacky this kind of polling is. It's presented as if it's a completely normal way to do things in reliable software.
19.
by chrchang523 3y ago
Agree, I'm shocked at how ugly the recommended alternative is. This does not make MS look good.
20.
by chrchang523 3y ago
Raymond Chen has been providing an inside perspective on this for decades: https://devblogs.microsoft.com/oldnewthing/
21.
by chrchang523 3y ago
(2015)
22.
by chrchang523 3y ago
The possibilities you mention are definitely worth keeping in mind. However, they are not an exhaustive list; there are positive scenarios that are better than "trying to squeeze a few more dollars by telling the tale". The hard
23.
by chrchang523 3y ago
Do you? I don’t like it, but the government is allowed to pay off the debt with inflated dollars.
24.
by chrchang523 3y ago
Rare virtue, but I wouldn’t say it was unprecedented: https://en.m.wikipedia.org/wiki/Lucius_Quinctius_Cincinnatus
25.
by chrchang523 3y ago
There are games where the final score is primarily based on taking as little time as possible (e.g. the Heroes of Might and Magic series, which had its debut around the same time as Diablo); this tends to keep exponential leveling mechanics
26.
by chrchang523 3y ago
An important catch here is that he was eight years too early, not two. See https://news.ycombinator.com/item?id=33538742 .
27.
by chrchang523 3y ago
I don’t know how long this will last, but I started doing this recently with Vanguard’s VUSXX (short-term Treasury) fund when I realized it had significantly higher after-tax yield than high-interest savings accounts without the hassle of m
28.
by chrchang523 4y ago
This does depend a bit on the calculator. embedded_hiker's anecdote has made me update in the direction of exposing my daughter to Wolfram Alpha before Python...
29.
by chrchang523 4y ago
+1. I recently gave an internal presentation encouraging everyone on my (rather heterogeneous) team to look at that.
30.
by chrchang523 4y ago
Nit: struct padding and arithmetic promotion don't support this point. In practice, C compilers provide struct-packing extensions that cover the uncommon cases where default padding wouldn't yield the layout you want. And they&#

More ›