Method rehashPowerOfTwo

test-app/runtime/src/main/cpp/robin_hood.h:2216–2249

reserves space for at least the specified number of elements. only works if numBuckets if power of two True on success, false otherwise

        // only works if numBuckets if power of two
        // True on success, false otherwise
        void rehashPowerOfTwo(size_t numBuckets, bool forceFree) {
            ROBIN_HOOD_TRACE(this)

            Node* const oldKeyVals = mKeyVals;
            uint8_t const* const oldInfo = mInfo;

            const size_t oldMaxElementsWithBuffer = calcNumElementsWithBuffer(mMask + 1);

            // resize operation: move stuff
            initData(numBuckets);
            if (oldMaxElementsWithBuffer > 1) {
                for (size_t i = 0; i < oldMaxElementsWithBuffer; ++i) {
                    if (oldInfo[i] != 0) {
                        // might throw an exception, which is really bad since we are in the middle of
                        // moving stuff.
                        insert_move(std::move(oldKeyVals[i]));
                        // destroy the node but DON'T destroy the data.
                        oldKeyVals[i].~Node();
                    }
                }

                // this check is not necessary as it's guarded by the previous if, but it helps
                // silence g++'s overeager "attempt to free a non-heap object 'map'
                // [-Werror=free-nonheap-object]" warning.
                if (oldKeyVals != reinterpret_cast_no_cast_align_warning<Node*>(&mMask)) {
                    // don't destroy old data: put it into the pool instead
                    if (forceFree) {
                        std::free(oldKeyVals);
                    } else {
                        DataPool::addOrFree(oldKeyVals, calcNumBytesTotal(oldMaxElementsWithBuffer));
                    }
                }
            }
        }

        ROBIN_HOOD(NOINLINE) void throwOverflowError() const {
#if ROBIN_HOOD(HAS_EXCEPTIONS)