doc: Doxygen-friendly CuckooCache comments #16986

 222 | @@ -226,7 +223,7 @@ class cache
 223 |       *  [0,1) and simply multiply it by the size.  Then we just shift the result down by
 224 |       *  32-bits to get our bucket number.  The result has non-uniformity the same as a
 225 |       *  mod, but it is much faster to compute. More about this technique can be found at
 226 | -     *  http://lemire.me/blog/2016/06/27/a-fast-alternative-to-the-modulo-reduction/
 227 | +     *  http://lemire.me/blog/2016/06/27/a-fast-alternative-to-the-modulo-reduction/.

---

 233 | @@ -237,8 +234,8 @@ class cache
 234 |       *  32*32->64 multiply, which means the operation is reasonably fast even on a
 235 |       *  typical 32-bit processor.
 236 |       *
 237 | -     * @param e the element whose hashes will be returned
 238 | -     * @returns std::array<uint32_t, 8> of deterministic hashes derived from e
 239 | +     * @param e The element whose hashes will be returned
 240 | +     * @returns Deterministic hashes derived from `e`

---

 457 | @@ -458,10 +458,10 @@ class cache
 458 |       * contains returns a bool set true if the element was found.
 459 |       *
 460 |       * @param e the element to check
 461 | -     * @param erase
 462 | +     * @param erase whether to consider setting the garbage collect flag

---