resize()

template<typename T , typename StoragePolicy , typename ConcurrencyPolicy = SingleThreadedPolicy, typename AccessPattern = QueueAccess>

void MayaFlux::Memory::RingBuffer< T, StoragePolicy, ConcurrencyPolicy, AccessPattern >::resize ( size_t  new_capacity )

inline

Resize buffer capacity (DynamicStorage only)

Parameters

new_capacity

New maximum element count

Preserves existing data ordered by AccessPattern. Not Real-time Safe: May trigger heap allocation.

Definition at line 986 of file RingBuffer.hpp.

    {
        if (new_capacity == m_storage.capacity())
            return;
 
        auto current_data = snapshot();
 
        m_storage.resize(new_capacity);
        m_linearized.resize(new_capacity);
 
        m_state.write_index = 0;
        m_state.read_index = 0;
 
        size_t to_copy = std::min(current_data.size(), new_capacity);
        for (size_t i = 0; i < to_copy; ++i) {
            m_storage.buffer[i] = current_data[i];
        }
 
        if constexpr (AccessPattern::push_front) {
            m_state.write_index = (to_copy > 0) ? to_copy - 1 : 0;
        } else {
            m_state.write_index = to_copy;
        }
    }

References MayaFlux::Memory::RingBuffer< T, StoragePolicy, ConcurrencyPolicy, AccessPattern >::m_linearized, MayaFlux::Memory::RingBuffer< T, StoragePolicy, ConcurrencyPolicy, AccessPattern >::m_state, MayaFlux::Memory::RingBuffer< T, StoragePolicy, ConcurrencyPolicy, AccessPattern >::m_storage, and MayaFlux::Memory::RingBuffer< T, StoragePolicy, ConcurrencyPolicy, AccessPattern >::snapshot().

Here is the call graph for this function: