bdlcc::MultipriorityQueue_Node< TYPE > Class Template Reference

#include <bdlcc_multipriorityqueue.h>

Public Member Functions
	BSLMF_NESTED_TRAIT_DECLARATION (MultipriorityQueue_Node, bslma::UsesBslmaAllocator)
	MultipriorityQueue_Node (const TYPE &item, bslma::Allocator *basicAllocator)
	MultipriorityQueue_Node (bslmf::MovableRef< TYPE > item, bslma::Allocator *basicAllocator)
	~MultipriorityQueue_Node ()
TYPE &	item ()
	Return a reference to the non-modifiable item stored in this node.
MultipriorityQueue_Node *&	nextPtr ()
const MultipriorityQueue_Node *	nextPtr () const

Detailed Description

template<class TYPE>
class bdlcc::MultipriorityQueue_Node< TYPE >

This class handles storage of one item of parameterized TYPE as a node in a linked list of items stored in a multipriority queue for a given priority. This class is not to be used from outside this component.

See bdlcc_multipriorityqueue

Constructor & Destructor Documentation

MultipriorityQueue_Node() [1/2]

template<class TYPE >

bdlcc::MultipriorityQueue_Node< TYPE >::MultipriorityQueue_Node ( const TYPE &  item, bslma::Allocator *  basicAllocator  )

inline

Create a node containing a copy of the specified item and having the specified next pointer. Use the specified basicAllocator to supply memory. The behavior is undefined unless basicAllocator is non-null. Note that item must be copyable and assignable.

MultipriorityQueue_Node() [2/2]

template<class TYPE >

bdlcc::MultipriorityQueue_Node< TYPE >::MultipriorityQueue_Node ( bslmf::MovableRef< TYPE >  item, bslma::Allocator *  basicAllocator  )

inline

Create a node containing the value of the specified item and having the specified next pointer. item is left in a valid but unspecified state. Use the specified basicAllocator to supply memory. The behavior is undefined unless basicAllocator is non-null.

~MultipriorityQueue_Node()

template<class TYPE >

bdlcc::MultipriorityQueue_Node< TYPE >::~MultipriorityQueue_Node ( )

inline

Destroy this node and free all memory that was allocated on its behalf, if any.

Member Function Documentation

BSLMF_NESTED_TRAIT_DECLARATION()

template<class TYPE >

bdlcc::MultipriorityQueue_Node< TYPE >::BSLMF_NESTED_TRAIT_DECLARATION	(	MultipriorityQueue_Node< TYPE >	,
		bslma::UsesBslmaAllocator
	)

item()

template<class TYPE >

TYPE & bdlcc::MultipriorityQueue_Node< TYPE >::item ( )

inline

nextPtr() [1/2]

template<class TYPE >

MultipriorityQueue_Node< TYPE > *& bdlcc::MultipriorityQueue_Node< TYPE >::nextPtr ( )

inline

Return a reference to the modifiable pointer to the node following this node on the linked list.

nextPtr() [2/2]

template<class TYPE >

const MultipriorityQueue_Node< TYPE > * bdlcc::MultipriorityQueue_Node< TYPE >::nextPtr ( ) const

inline

Return a pointer to the non-modifiable node following this node on the linked list, or 0 if this node has no successor.

---

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

• bdlcc_multipriorityqueue.h