pop()

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

std::optional< T > MayaFlux::Memory::RingBuffer< T, StoragePolicy, ConcurrencyPolicy, AccessPattern >::pop ( )

inlinenoexcept

Pop element from buffer.

Returns

Element if available, nullopt if empty

Behavior by AccessPattern:

• QueueAccess: Removes from front (oldest element)
• HistoryBufferAccess: Not typically used (use peek_oldest instead)

Thread Safety:

• LockFreePolicy: Lock-free for single consumer
• SingleThreadedPolicy: Not thread-safe

while (auto value = buffer.pop()) {
    process(*value);  // Process oldest data first
}

Definition at line 835 of file RingBuffer.hpp.

    {
        if constexpr (is_mpsc) {
            return pop_mpsc();
        } else if constexpr (is_lock_free) {
            return pop_lockfree();
        } else {
            return pop_singlethread();
        }
    }

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 >::pop_lockfree(), MayaFlux::Memory::RingBuffer< T, StoragePolicy, ConcurrencyPolicy, AccessPattern >::pop_mpsc(), and MayaFlux::Memory::RingBuffer< T, StoragePolicy, ConcurrencyPolicy, AccessPattern >::pop_singlethread().

Here is the call graph for this function: