librnr/include/rnr/dlistvoid.h
static inline DListVoidNode_T *DListVoidQueue(DListVoid_T *pHead,
                                             void *pData)
{
  return DListVoidAppend(pHead, pData);
}
/*!
 * \brief Attach user data to a new node and queue on dlist queue.
 *
 * The dlist can serve as a FIFO queue (first in, first out) by using the 
 * queue and dequeue operators.
 *
 * \par Name:
 * DList\<\ref DLIST_DNAME\>Queue()
 *
 * \param pHead   Pointer to dlist (head).
 * \param pData   Pointer to user (allocated) data.
 *
 * \return Returns pointer to new node on success, NULL on failure.
 */
\brief Attach user data to a new node and queue on dlist queue.
The dlist can serve as a FIFO queue (first in, first out) by using the
queue and dequeue operators.



\param pHead   Pointer to dlist (head).
\param pData   Pointer to user (allocated) data.

\return Returns pointer to new node on success, NULL on failure.
\ brief Attach user data to a new node and queue on dlist queue . The dlist can serve as a FIFO queue ( first in first out ) by using the queue and dequeue operators . \ param pHead Pointer to dlist ( head ) . \ param pData Pointer to user ( allocated ) data . \ return Returns pointer to new node on success NULL on failure .
static inline DListVoidNode_T *DListVoidQueue(DListVoid_T *pHead,
                                             void *pData)
{
  return DListVoidAppend(pHead, pData);
}
static inline DListVoidNode_T * DListVoidQueue ( DListVoid_T * pHead , void * pData ) { return DListVoidAppend ( pHead , pData ) ; }
\brief Attach user data to a new node and queue on dlist queue.
\ brief Attach user data to a new node and queue on dlist queue .