The following table gives a brief description of the list and queue
functions.  Follow the links for details about each call.
   _____________________________________________________________
  |                                                             |
  |      Function   Description                                 |
  |=============================================================|
  |       NewList - Initialize a list structure for use.        |
  |        Insert - Insert a node into any position of a list.  |
  |        Remove - Remove a node from a list.                  |
  |       AddHead - Insert a node at the head of a list.        |
  |       AddTail - Append a node to the tail of a list.        |
  |      RemHead& - Remove the head node from a list.           |
  |      RemTail& - Remove the tail node from a list.           |
  |       Enqueue - Insert or append a node to a queue.         |
  |-------------------------------------------------------------|
  |     FindName& - Find a node with a given name in a list.    |
  |  IsListEmpty& - Test if list is empty.                      |
  |-------------------------------------------------------------|
  |      GetHead& - Get the head node of a list.                |
  |      GetTail& - Get the tail node of a list.                |
  |      GetSucc& - Get the successor of a node.                |
  |      GetPred& - Get the predecessor of a node.              |
  |_____________________________________________________________|

                 Table 2: List and Queue Functions

                                                      Back to List Overview
                                                      Back to RSI-Docs