Method find

src/misc/alloc_tracker.cpp:77–88

    }

    size_t find(void *key) const {
        size_t mask = capacity - 1;
        size_t i = mix(key) & mask;
        size_t first_tomb = SIZE_MAX;
        while (true) {
            void *k = entries[i].key;
            if (k == nullptr) return (first_tomb != SIZE_MAX) ? first_tomb : i;
            if (k == key)     return i;
            if (k == kTombstone && first_tomb == SIZE_MAX) first_tomb = i;
            i = (i + 1) & mask;
        }
    }

    void rehash(size_t new_cap) {
        Entry *old_entries = entries;