push()

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

bool MayaFlux::Memory::RingBuffer< T, StoragePolicy, ConcurrencyPolicy, AccessPattern >::push ( const T &  value )

inlinenoexcept

Push element into buffer.

Parameters

value

Element to insert

Returns

true if successful, false if buffer full

Behavior by AccessPattern:

• QueueAccess: Adds to back of queue (oldest at front)
• HistoryBufferAccess: Adds to front (becomes newest element)

Thread Safety:

• LockFreePolicy: Wait-free for single producer
• SingleThreadedPolicy: Not thread-safe

RingBuffer<double, ...> buffer;
if (!buffer.push(42.0)) {
    // Buffer full, oldest data still present
}

Definition at line 806 of file RingBuffer.hpp.

    {
        if constexpr (is_mpsc) {
            return push_mpsc(value);
        } else if constexpr (is_lock_free) {
            return push_lockfree(value);
        } else {
            return push_singlethread(value);
        }
    }

References MayaFlux::Memory::RingBuffer< T, StoragePolicy, ConcurrencyPolicy, AccessPattern >::is_lock_free, MayaFlux::Memory::RingBuffer< T, StoragePolicy, ConcurrencyPolicy, AccessPattern >::is_mpsc, MayaFlux::Memory::RingBuffer< T, StoragePolicy, ConcurrencyPolicy, AccessPattern >::push_lockfree(), MayaFlux::Memory::RingBuffer< T, StoragePolicy, ConcurrencyPolicy, AccessPattern >::push_mpsc(), MayaFlux::Memory::RingBuffer< T, StoragePolicy, ConcurrencyPolicy, AccessPattern >::push_singlethread(), and value.

Here is the call graph for this function: