compact()

template<typename Key, typename Value, typename Equal = fl::SmallMapEqualTo<Key>>

void fl::unordered_map_small< Key, Value, Equal >::compact ( )

inline

Definition at line 390 of file unordered_map_small.h.

                                {
        size_type write = 0;
        for (size_type read = 0; read < mData.size(); ++read) {
            if (mOccupied.test(read)) {
                if (write != read) {
                    mData[write] = fl::move(mData[read]);
                }
                ++write;
            }
        }
        // Trim vector to alive count
        while (mData.size() > write) mData.pop_back();
        // Rebuild bitmap — all slots occupied
        mOccupied = bitset_dynamic(write);
        for (size_type i = 0; i < write; ++i) {
            mOccupied.set(i);
        }
    }

References fl::FL_NO_EXCEPT, mData, mOccupied, fl::adl_barrier::move(), and fl::read().

Here is the call graph for this function: