Gets the ordinal position of a node within a list, counting from the tail of the list.
int32 GetNodePosFromTail(const List *l, const Node *n);
This function scans the supplied list backward looking for the supplied node, and returns the ordinal position of the node within the list. If the node doesn't appear in the list, the function returns -1.
The ordinal position of the node within the list counting from the tail of the list, or -1 if the node isn't in the list. The last node in the list has position 0, the second to last node has position 1, etc.
Convenience call implemented in clib.lib V24.
GIGO (garbage in, garbage out)
AddHead
(), AddTail(), InsertNodeFromHead(), InsertNodeFromTail(), RemHead(), RemNode(), RemTail()