Managing Linked Lists
This chapter explains how to manage linked lists. For details about the functions described here, see
Kernel Folio Calls
, in the
3DO System Programmer's Reference
.
This chapter contains the following topics:
About Linked Lists
Creating and Initializing a List
Adding a Node to a List
Changing the Priority of a Node
Removing a Node From a List
Finding out If a List Is Empty
Traversing a List
Finding a Node by Name
Finding a Node by Its Ordinal Position
Determining the Ordinal Position of a Node
Counting the Number of Nodes in a List
Example
Primary Data Structures
Function Calls