UE::IoStore::TThreadSafeIntrusiveQueue< T > Class Template Reference

#include <ThreadSafeIntrusiveQueue.h>

Public Member Functions
void	Enqueue (T *Request)
void	EnqueueByPriority (T *Request)
T *	Dequeue (int32 NumToRemove=MAX_int32)
void	Reprioritize (T *Request, int32 NewPriority)
int32	Num () const

Detailed Description

template<typename T>
class UE::IoStore::TThreadSafeIntrusiveQueue< T >

Note that the type used requires the following members: NextRequest: A pointer to the same type, this is used to maintain the list. Priority: An int32 value used to store the priority of the value

Member Function Documentation

Dequeue()

template<typename T >

T * UE::IoStore::TThreadSafeIntrusiveQueue< T >::Dequeue ( int32  NumToRemove = MAX_int32 )

inline

Enqueue()

template<typename T >

void UE::IoStore::TThreadSafeIntrusiveQueue< T >::Enqueue ( T *  Request )

inline

EnqueueByPriority()

template<typename T >

void UE::IoStore::TThreadSafeIntrusiveQueue< T >::EnqueueByPriority ( T *  Request )

inline

Num()

template<typename T >

int32 UE::IoStore::TThreadSafeIntrusiveQueue< T >::Num ( ) const

inline

Reprioritize()

template<typename T >

void UE::IoStore::TThreadSafeIntrusiveQueue< T >::Reprioritize ( T *  Request, int32  NewPriority  )

inline

---

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

• Engine/Source/Runtime/Experimental/IoStore/OnDemand/Private/ThreadSafeIntrusiveQueue.h