Method defragment

OgreMain/src/Math/Array/OgreArrayMemoryManager.cpp:258–307

-----------------------------------------------------------------------------------

    }
    //-----------------------------------------------------------------------------------
    void ArrayMemoryManager::defragment()
    {
        // Sort, last values first. This may improve performance in some
        // scenarios by reducing the amount of data to be shifted
        std::sort( mAvailableSlots.begin(), mAvailableSlots.end(), std::greater<size_t>() );
        SlotsVec::const_iterator itor = mAvailableSlots.begin();
        SlotsVec::const_iterator endt = mAvailableSlots.end();

        while( itor != endt )
        {
            // First see if we have a continuous range of unused slots
            size_t lastRange = 1;
            SlotsVec::const_iterator it = itor + 1;
            while( it != endt && ( *itor - lastRange ) == *it )
            {
                ++lastRange;
                ++it;
            }

            size_t i = 0;
            const size_t newEnd = *itor + 1;
            MemoryPoolVec::iterator itPools = mMemoryPools.begin();
            MemoryPoolVec::iterator enPools = mMemoryPools.end();

            // Shift everything N slots (N = lastRange)
            while( itPools != enPools )
            {
                char *dstPtr = *itPools + ( newEnd - lastRange ) * mElementsMemSizes[i];
                size_t indexDst = ( newEnd - lastRange ) % ARRAY_PACKED_REALS;
                char *srcPtr = *itPools + newEnd * mElementsMemSizes[i];
                size_t indexSrc = newEnd % ARRAY_PACKED_REALS;
                size_t numSlots = ( mUsedMemory - newEnd );
                size_t numFreeSlots = lastRange;
                mCleanupRoutines[i]( dstPtr, indexDst, srcPtr, indexSrc, numSlots, numFreeSlots,
                                     mElementsMemSizes[i] );
                ++i;
                ++itPools;
            }

            mUsedMemory -= lastRange;
            initializeEmptySlots( mUsedMemory );

            mRebaseListener->performCleanup( mLevel, mMemoryPools, mElementsMemSizes,
                                             ( newEnd - lastRange ), lastRange );

            itor += static_cast<ptrdiff_t>( lastRange );
        }

        mAvailableSlots.clear();
    }
    //-----------------------------------------------------------------------------------
    void ArrayMemoryManager::shrinkToFit()
    {