librnr/dlistvoid.c
void DListVoidDeleteNodeAt(DListVoid_T *pHead, int iIndex)
{
  DListVoidNode_T  *pNode;

  LOGDIAG4CALL(_TPTR(pHead), _TINT(iIndex));

  CHKPTR(pHead);

  // get node to delete
  if( (pNode = DListVoidGetNodeAt(pHead, iIndex)) != NULL )
  {
    DListVoidDeleteNode(pHead, pNode);
  }
}
/*!
 * \brief Unlink the node from the dlist at the given index and delete it and
 * it's attached user data.
 *
 * User data are deleted with a callback to the user-supplied data delete
 * function, if any.
 *
 * \param pHead  Pointer to dlist (head).
 * \param iIndex Index to dlist entry to delete.
 */
\brief Unlink the node from the dlist at the given index and delete it and
it's attached user data.

User data are deleted with a callback to the user-supplied data delete
function, if any.

\param pHead  Pointer to dlist (head).
\param iIndex Index to dlist entry to delete.
\ brief Unlink the node from the dlist at the given index and delete it and it ' s attached user data . User data are deleted with a callback to the user - supplied data delete function if any . \ param pHead Pointer to dlist ( head ) . \ param iIndex Index to dlist entry to delete .
void DListVoidDeleteNodeAt(DListVoid_T *pHead, int iIndex)
{
  DListVoidNode_T  *pNode;
  LOGDIAG4CALL(_TPTR(pHead), _TINT(iIndex));
  CHKPTR(pHead);
  if( (pNode = DListVoidGetNodeAt(pHead, iIndex)) != NULL )
  {
    DListVoidDeleteNode(pHead, pNode);
  }
}
void DListVoidDeleteNodeAt ( DListVoid_T * pHead , int iIndex ) { DListVoidNode_T * pNode ; LOGDIAG4CALL ( _TPTR ( pHead ) , _TINT ( iIndex ) ) ; CHKPTR ( pHead ) ; if ( ( pNode = DListVoidGetNodeAt ( pHead , iIndex ) ) != NULL ) { DListVoidDeleteNode ( pHead , pNode ) ; } }
\brief Unlink the node from the dlist at the given index and delete it and
 it's attached user data.
\ brief Unlink the node from the dlist at the given index and delete it and it ' s attached user data .
// get node to delete