DEFINITION - SUB
    Enqueue list&, node& -- insert or append a ListNode& to a queue

OPERATION
    Insert or append a ListNode& into a queue.  The insert is performed
    based on the priority given in the node's ln_Pri& field, it will keep
    the list properly sorted.  New nodes will be inserted in front of the
    first node with a lower priority.  Hence a FIFO (or pipe) queue for
    nodes of equal priority.

ARGUMENTS
    list& -- pointer to the queue's (Min)ListHeader&
    node& -- pointer to the node to enqueue, this must be a full featured
             ListNode& with type, priority and name fields

SEE ALSO
    Prioritized Insertion

                                                 Back to Function Reference