shm_queue_node< T > Class Template Reference

A queue node contains references to the previous and next queue cells, along with the data reference for the node. More...

#include <shm_queue.h>

List of all members.

Public Member Functions
void *	operator new (size_t s, shm_allocator &a)
void	operator delete (void *p, shm_allocator &a)
Public Attributes
shm_ptr< T >	data
shm_ptr< shm_queue_node >	prev
shm_ptr< shm_queue_node >	next

---

Detailed Description

template<typename T>
class shm_queue_node< T >

A queue node contains references to the previous and next queue cells, along with the data reference for the node.

Definition at line 31 of file shm_queue.h.

---

Member Function Documentation

template<typename T>

void* shm_queue_node< T >::operator new	(	size_t	s,
		shm_allocator &	a
	)			[inline]

Definition at line 34 of file shm_queue.h.

References shm_allocator::alloc().

Here is the call graph for this function:

template<typename T>

void shm_queue_node< T >::operator delete	(	void *	p,
		shm_allocator &	a
	)			[inline]

Definition at line 38 of file shm_queue.h.

References shm_allocator::free().

Here is the call graph for this function:

---

Member Data Documentation

template<typename T>

shm_ptr<T> shm_queue_node< T >::data

Definition at line 42 of file shm_queue.h.

Referenced by shm_queue< T >::pop(), and shm_queue< T >::push().

template<typename T>

shm_ptr<shm_queue_node> shm_queue_node< T >::prev

Definition at line 43 of file shm_queue.h.

Referenced by shm_queue< T >::pop(), and shm_queue< T >::push().

template<typename T>

shm_ptr<shm_queue_node> shm_queue_node< T >::next

Definition at line 44 of file shm_queue.h.

Referenced by shm_queue< T >::push().

---

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

• shm_queue.h

---