molecularman

6 ms·

1. 1.▲
   by molecularman 2mo ago

   I mean, I myself have poorer reading comprehension than me x years ago.
2. 2.▲
   by molecularman 2mo ago

   Thanks! Good question, I don't think such a tool exists. Such a tool would require a mathematical proof of an invariant that all the accesses are in bounds. The closest thing is the compiler's own bounds-check elimination proof en
3. 3.▲
   by molecularman 2mo ago

   Thank you. I've added your comment to the essay.
4. 4.▲
   Notes from Optimizing CPU-Bound Go Hot Paths(blog.andr2i.com)

   1 points by molecularman 5mo ago|0 comments