ambrosio

7 ms·

1. 1.▲
   by ambrosio 9mo ago

   Memory and disk corruption definitely were a problem in the early days. See https://news.ycombinator.com/item?id=14206811 for example. I also recall an anecdote about how the search index basically became unbuildable beyo
2. 2.▲
   by ambrosio 9mo ago

   > But what happens if there was a cosmic bit flip in a dynamic library? I think there were more basic reasons we didn't ship shared libraries to production. 1. They wouldn't have been "shared", because every program
3. 3.▲
   Logical Rules for Speaking Figuratively(en.wikipedia.org)

   2 points by ambrosio 4y ago|0 comments
4. 4.▲
   by ambrosio 4y ago

   You might want to measure yourself, because the table of results there doesn't make a lot of sense to me. 4-5 of those methods should be dominated by context switch latency and thus clustered together tightly. I looked at the sources.
5. 5.▲
   by ambrosio 5y ago

   > On (1), all objects in Java are references, being a pointer to a pointer effectively. This indirection has a cost but has been incredibly useful historically because it enables moving allocation around the address space because none of
6. 6.▲
   by ambrosio 11y ago

   That seem abysmally slow for grep. On my machine, with a 1.1G file made of 1200 copies of /usr/share/dict/words, GNU grep 2.16 takes about 1.5 seconds. Try with LC_ALL=C?
7. 7.▲
   by ambrosio 12y ago

   http://www.ncbi.nlm.nih.gov/pubmed/8157392