library/src/datastructures/BP-LinkedList.cc
// free's chunks and deletes link elements.  Can be used with
// chunks that may not be in the list (makes implementations easier)
free's chunks and deletes link elements.  Can be used with
chunks that may not be in the list (makes implementations easier)
free ' s chunks and deletes link elements . Can be used with chunks that may not be in the list ( makes implementations easier )
void   tq_free   (P_BP_LINKL head, void * addr)
{
	if(!addr)
		return;
	if(!head)
	{
		printf("\n [+] Error: Cannot free a list element without an accompanying head.");
		return;
	}
	P_BP_LINKL_DATA item = (P_BP_LINKL_DATA) BP_ForwardLookupDataItemFromPointer(head, addr);
	BP_DestroyLinkLItem(head, item);
}
void tq_free ( P_BP_LINKL head , void * addr ) { if ( ! addr ) return ; if ( ! head ) { printf ( " \n " ) ; return ; } P_BP_LINKL_DATA item = ( P_BP_LINKL_DATA ) BP_ForwardLookupDataItemFromPointer ( head , addr ) ; BP_DestroyLinkLItem ( head , item ) ; }
free's chunks and deletes link elements.
free ' s chunks and deletes link elements .
// look for item (returns null if it doesn't exist) // destroy the individual link item