(C) 1998 AROS - The Amiga Research OS


NAME

void Enqueue (list , node)

LOCATION
In SysBase at offset 45

SYNOPSIS
struct List * list
struct Node * node

FUNCTION
Sort a node into a list. The sort-key is the field node->ln_Pri.

INPUTS
list
Insert into this list. The list has to be in descending order in respect to the field ln_Pri of all nodes.
node
This node is to be inserted. Note that this has to be a complete node and not a MinNode !

RESULT
The new node will be inserted before nodes with the same or lower priority.

EXAMPLE
struct List * list;
struct Node * node;

node->ln_Pri = 5;

// Sort the node at the correct place into the list
Enqueue (list, node);
SEE ALSO

NOTES
The list has to be in descending order in respect to the field ln_Pri of all nodes.

BUGS

INTERNALS

HISTORY