Retrieves, but does not remove, the tail (last element) of this set.

Retrieves, but does not remove, the tail (last element) of this set.Retrieving the tail of a hash set has a time complexity of O(N), with N being the capacity of the set.

Retrieving the tail of a tree set has a time complexity of O(Log N), with N being the size of the set.

**Parameters:****set**- The set to use**Returns:**- void * retptr != NULL: The last element of this set.

void * retptr == NULL: An error, see pbl_errno:

PBL_ERROR_OUT_OF_BOUNDS - this set is empty.

This page was generated with the help of DOC++.