nowne

5 ms·

1. 1.▲
   by nowne 10y ago

   This is an amazing tool, I use it almost daily. Whenever I want to test an idea, or see what is going on in the assembly, I go straight to godbolt.
2. 2.▲
   by nowne 10y ago

   It will likely link, since both clang and gcc will perform RVO on bar(), so the copy constructor won't be called.
3. 3.▲
   by nowne 12y ago

   Linear probing works by initially hashing the value, call it h(x), then if there is a collision, it checks h(x)+1, h(x)+2, ..., h(x) + k, until it finds a open slot. Lookup works in the same way, and deletion is a bit more complicated. Thi
4. 4.▲
   by nowne 12y ago

   The problem with that method is that it doesn't have data access locality, while linear probing does. Linear probing ends up being more efficient because it is easy on the cache.
5. 5.▲
   by nowne 12y ago

   There are countably infinite number of functions. A simple proof is that each function can be represented as a string, and there are countably infinite number of strings for a finite alphabet. You could also argue that functions are equiv
6. 6.▲
   by nowne 12y ago

   That wouldn't solve much, if anything at all, see Kerckhoffs's Principle[1]. The standard encryption algorithms perform perfectly well to the best of our knowledge, why make your own encryption algorithm and risk getting it wrong