Changeset 420 for trunk/Jgraph/prio_list.h

Timestamp:

02/27/08 07:13:31 (16 years ago)

Author:

Nicholas Riley

Message:

Jgraph: my changes - ANSIfication, few minor bug fixes; works on OS X 10.5 now

File:

• trunk/Jgraph/prio_list.h (modified) (1 diff)

trunk/Jgraph/prio_list.h

@@ -6 +6 @@
  */
 
-/* Priority lists are just like normal lists of list.h and list.c, except
- * that their third field is a (int) prioriy.  The routines of list.c should all
- * be used except for insert, because it will always put an item at the 
- * end of a list.  Instead, use prio_insert, which will put the item
- * into its proper place in the list.  The last argument of prio_insert should
- * be TRUE if the list is to be kept in descending order; it should be FALSE
- * for ascending order.
+/* Priority lists are just like normal lists of list.h and list.c,
+ * except that their third field is a (int) priority.  The routines of
+ * list.c should all be used except for insert, because it will always
+ * put an item at the end of a list.  Instead, use prio_insert, which
+ * will put the item into its proper place in the list.  The last
+ * argument of prio_insert should be TRUE if the list is to be kept in
+ * descending order; it should be FALSE for ascending order.
+ */
 
- * Priority list should be:
-
-struct prio_list {
+/* A priority list is any list with the first three fields being flink, 
+ * blink and prio.  Use the routines of list.c to do everything except
+ * insertion */
+ 
+typedef struct prio_list {
   struct prio_list *flink;
   struct prio_list *blink;
   int prio;
-  ...
-  }
+  /* ... */
+} *Prio_list;
 
-*/
+typedef int Boolean;
 
-/* void prio_insert(node, list, descending); */
+void prio_insert(void *node, void *list, Boolean descending);