ccurtsinger

6 ms·

1.
by ccurtsinger 1y ago
Resubmitting after original was flagged for no reason.
2.
Riker: Always-Correct and Fast Incremental Builds from Simple Specifications(github.com)
4 points by ccurtsinger 4y ago|0 comments
3.
by ccurtsinger 10y ago
Not really. Calling a C++ template-generated function is no different than calling a C function. If you have a lot of tiny template-generated functions then sure, it would be slow. But no slower than a C program with a bunch of tiny functio
4.
by ccurtsinger 11y ago
Minnesota does a significant amount of research on road surface materials. There is a section of I94 northwest of the Twin Cities that has three segments of highway, and traffic can be diverted onto one of the segments to test new road surf
5.
by ccurtsinger 11y ago
I grew up in MN and always loved Honeycrisp, but after relocating I was surprised to hear people describe them as tasteless or mealy. It turns out they vary a lot depending on growing region. Cold hardy apples produce very different fruit i
6.
by ccurtsinger 11y ago
I just closed my account. Unfortunately, this requires sending an email to support@uber.com. It's inconvenient, but gives you a place to explain that you will not use the service until they comply with the ADA.
7.
by ccurtsinger 11y ago
The "six distinct features of a functional language" are misleading/inaccurate: 1. Laziness: Not required. See Lisp, Scheme, ML, OCaml, etc. 2. Functions as first-class citizens: This is probably the only hard and fast requir
8.
by ccurtsinger 12y ago
There are quite a few extra issues that come up when you implement a usable allocator. I'm surprised the article didn't mention them. Here are just a few: Alignment: different systems have different minimum alignment requirements.
9.
by ccurtsinger 12y ago
There is no "killer input" for randomized quicksort. I'm surprised libc doesn't select pivots randomly already.
10.
by ccurtsinger 12y ago
It's not just a shuffled heap, it's also sparse. Section 4.1 covers heap overflow attacks, with an attacker using overflows from one object to overwrite entries in a nearby object's vtable. Because the objects could be anywhe
11.
by ccurtsinger 12y ago
You could do better with a probabilistically secure allocator instead: http://people.cs.umass.edu/~emery/pubs/ccs03-novark.pdf Randomized allocation makes it nearly impossible to forge pointers, locate sensitive d
12.
by ccurtsinger 12y ago
Daniel claims that volatility is actually lower with HFT when you look at implied volatility, a predictive measure of volatility. Lewis uses actual historical volatility in his argument. You shouldn't use a predictive measure when anal
13.
by ccurtsinger 12y ago
Why? I see no problem with a position of "this is bad." And since this is a discussion about a book, it's worth pointing out that the book is focused around an alternative proposal for market design.
14.
by ccurtsinger 13y ago
Little's law certainly applies here. The article's author does have a good point though: if there is no queue and requests are processed one by one, your only option is good old serial program optimization. Still, I think most lar
15.
by ccurtsinger 13y ago
The Mall of America, from the same developers as the West Edmonton Mall, is another good exception. The mall is massive, but the interior spaces feel like the outdoors. This is partly because of the live plants and bright sunlight filling t
16.
by ccurtsinger 13y ago
No. The clocks use the local Date object, but the rotation calculations for hour hand were copied over from a 12 hour clock. One downside of 24 hour clocks: a broken one is only right once a day.
17.
by ccurtsinger 13y ago
Looks nice, but the hour hand is wrong on all the 24 hour clocks.