DEFINITION - FUNCTION
    node& = GetPred&(node&)
                 -- return the predecessor (Min)ListNode& of a given node

OPERATION
    Get the previous (Min)ListNode& in the linked chain of nodes, and return
    a pointer to it.  To get the last (tail) node, this function may be
    called with a list pointer, though this can be better accomplished with
    the FUNCTION GetTail&.  If the list is empty or the linked chain its
    head end is reached, return zero.

ARGUMENTS
    node& -- pointer to a (Min)ListNode& or a (Min)ListHeader&

RESULT
    node& -- pointer to the predecessor (Min)ListNode& or zero when the
             list is empty or the list chain's end is reached

NOTES
    The source for the operation (the node& argument) may also be a list&.

SEE ALSO
    Scanning a List

                                                 Back to Function Reference