WPILibC++ 2023.4.3
wpi::ConcurrentQueue< T > Class Template Reference

#include <wpi/ConcurrentQueue.h>

Public Member Functions

bool empty () const
 
std::queue< T >::size_type size () const
 
pop ()
 
void pop (T &item)
 
void push (const T &item)
 
void push (T &&item)
 
template<typename... Args>
void emplace (Args &&... args)
 
 ConcurrentQueue ()=default
 
 ConcurrentQueue (const ConcurrentQueue &)=delete
 
ConcurrentQueueoperator= (const ConcurrentQueue &)=delete
 

Constructor & Destructor Documentation

◆ ConcurrentQueue() [1/2]

template<typename T >
wpi::ConcurrentQueue< T >::ConcurrentQueue ( )
default

◆ ConcurrentQueue() [2/2]

template<typename T >
wpi::ConcurrentQueue< T >::ConcurrentQueue ( const ConcurrentQueue< T > &  )
delete

Member Function Documentation

◆ emplace()

template<typename T >
template<typename... Args>
void wpi::ConcurrentQueue< T >::emplace ( Args &&...  args)
inline

◆ empty()

template<typename T >
bool wpi::ConcurrentQueue< T >::empty ( ) const
inline

◆ operator=()

template<typename T >
ConcurrentQueue & wpi::ConcurrentQueue< T >::operator= ( const ConcurrentQueue< T > &  )
delete

◆ pop() [1/2]

template<typename T >
T wpi::ConcurrentQueue< T >::pop ( )
inline

◆ pop() [2/2]

template<typename T >
void wpi::ConcurrentQueue< T >::pop ( T &  item)
inline

◆ push() [1/2]

template<typename T >
void wpi::ConcurrentQueue< T >::push ( const T &  item)
inline

◆ push() [2/2]

template<typename T >
void wpi::ConcurrentQueue< T >::push ( T &&  item)
inline

◆ size()

template<typename T >
std::queue< T >::size_type wpi::ConcurrentQueue< T >::size ( ) const
inline

The documentation for this class was generated from the following file: