Returns a pointer to a node appearing at a given ordinal position from the head of the list.

Node *FindNodeFromHead(const List *l, uint32 position);

This function scans the supplied list and returns a pointer to the node appearing in the list at the given ordinal position. NULL is returned if the list doesn't contain that many items.

• l A pointer to the list to scan for the node.

• position The node position to look for.

A pointer to the node found, or NULL if the list doesn't contain enough nodes.

Convenience call implemented in clib.lib V24.

• list.h ANSI C Prototype

• clib.lib ARM Link Library

GIGO (\Qgarbage in, garbage out)

AddHead(), AddTail(), InsertNodeFromHead(), InsertNodeFromTail(), RemHead(), RemNode(), RemTail()