Rev | Line | |
---|
[418] | 1 | /*
|
---|
| 2 | * $Source: /tmp_mnt/n/fs/grad1/jsp/src/jgraph/RCS/prio_list.h,v $
|
---|
| 3 | * $Revision: 8.3 $
|
---|
| 4 | * $Date: 92/11/30 11:42:34 $
|
---|
| 5 | * $Author: jsp $
|
---|
| 6 | */
|
---|
| 7 |
|
---|
| 8 | /* Priority lists are just like normal lists of list.h and list.c, except
|
---|
| 9 | * that their third field is a (int) prioriy. The routines of list.c should all
|
---|
| 10 | * be used except for insert, because it will always put an item at the
|
---|
| 11 | * end of a list. Instead, use prio_insert, which will put the item
|
---|
| 12 | * into its proper place in the list. The last argument of prio_insert should
|
---|
| 13 | * be TRUE if the list is to be kept in descending order; it should be FALSE
|
---|
| 14 | * for ascending order.
|
---|
| 15 |
|
---|
| 16 | * Priority list should be:
|
---|
| 17 |
|
---|
| 18 | struct prio_list {
|
---|
| 19 | struct prio_list *flink;
|
---|
| 20 | struct prio_list *blink;
|
---|
| 21 | int prio;
|
---|
| 22 | ...
|
---|
| 23 | }
|
---|
| 24 |
|
---|
| 25 | */
|
---|
| 26 |
|
---|
| 27 | /* void prio_insert(node, list, descending); */
|
---|
| 28 |
|
---|
Note:
See
TracBrowser
for help on using the repository browser.