It is not required to call it. Functions changing current node pointer to the new node. Especially intended for implementation of Queue's and Stacks. The following four functions are essentially the same as the preceding four. The data is however not passed by value but by reference.
Current node is set to found node.
First checked node is current node. FindFirst and FindNext may be needed. These functions change the current node pointer and return 1 when there was a change. A return of 0 indicates trying to move past the begin or the end of the list, or an empty list. The return value is intended for iteration purposes.