# FindNodeFromHead

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

### Synopsis

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

### Description

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.

### Arguments

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

position
  The node position to look for.

### Return Value

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

### Implementation

Convenience call implemented in clib.lib V24.

### Associated Files

list.h
  ANSI C Prototype

clib.lib
  ARM Link Library

### Caveats

GIGO (\Qgarbage in, garbage out)

### See Also

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

#