BSL_LIST_AddElement BSL_LIST_Concat BSL_LIST_Copy BSL_LIST_Curr BSL_LIST_DeleteAll BSL_LIST_DeleteAllAfterSort BSL_LIST_DeleteCurrent BSL_LIST_DeleteNode BSL_LIST_DetachCurrent BSL_LIST_DetachNode BSL_LIST_First BSL_LIST_FirstNode BSL_LIST_FREE BSL_LIST_FREE_AFTER_SORT BSL_LIST_FreeWithoutData BSL_LIST_GetData BSL_LIST_GetElmtIndex BSL_LIST_GetIndexNode BSL_LIST_GetMaxElements BSL_LIST_GetMaxQsortCount BSL_LIST_GetNextNode BSL_LIST_GetPrevNode BSL_LIST_Last BSL_LIST_New BSL_LIST_Next BSL_LIST_PFUNC_CMP BSL_LIST_PFUNC_DUP BSL_LIST_PFUNC_FREE BSL_LIST_Prev BSL_LIST_RevList BSL_LIST_Search BSL_LIST_SetMaxElements BSL_LIST_SetMaxQsortCount BSL_LIST_Sort BslList BslListNode BslListPosition

BSL_LIST_DetachCurrent() void BSL_LIST_DetachCurrent ( BslList *  pList ) This function detaches the current element from the list, the current node will be freed, but the data contained in the current node will not be freed.Also the pList->first, pList->curr and pList->last will be appropriately updated. If the current node is the last node, then pList->curr will point to its previous node after detachment, else it will point to its next node. 参数 pList [IN] The list