Crash landing of the fix for bug #472883: BSD curses.h allready declares LL.

shared/LL.h

@@ -7,7 +7,7 @@
 
   To create a list, do the following:
 
-    LL *list;
+    LinkedList *list;
     list = LL_new();
     if(!list) handle_an_error();
 
@@ -120,81 +120,81 @@ typedef struct LL_node {
 	void *data;
 } LL_node;
 
-typedef struct LL {
+typedef struct LinkedList {
 	LL_node head, tail;
 	LL_node *current;
-} LL;
+} LinkedList;
 
 // Creates a new list...
-LL *LL_new ();
+LinkedList *LL_new ();
 // Destroying lists...
-int LL_Destroy (LL * list);
+int LL_Destroy (LinkedList * list);
 int LL_node_Destroy (LL_node * node);
 int LL_node_Unlink (LL_node * node);
 int LL_node_DestroyData (LL_node * node);
 
 // Returns to the beginning of the list...
-int LL_Rewind (LL * list);
+int LL_Rewind (LinkedList * list);
 // Goes to the end of the list...
-int LL_End (LL * list);
+int LL_End (LinkedList * list);
 // Go to the next node
-int LL_Next (LL * list);
+int LL_Next (LinkedList * list);
 // Go to the previous node
-int LL_Prev (LL * list);
+int LL_Prev (LinkedList * list);
 
 // Data manipulation
-void *LL_Get (LL * list);
-int LL_Put (LL * list, void *data);
+void *LL_Get (LinkedList * list);
+int LL_Put (LinkedList * list, void *data);
 // Don't use these next two unless you really know what you're doing.
-LL_node *LL_GetNode (LL * list);
-int LL_PutNode (LL * list, LL_node * node);
+LL_node *LL_GetNode (LinkedList * list);
+int LL_PutNode (LinkedList * list, LL_node * node);
 
-void *LL_GetFirst (LL * list);  // gets data from first node
-void *LL_GetNext (LL * list);	  //            ... next node
-void *LL_GetPrev (LL * list);	  //            ... prev node
-void *LL_GetLast (LL * list);	  //            ... last node
+void *LL_GetFirst (LinkedList * list);  // gets data from first node
+void *LL_GetNext (LinkedList * list);	  //            ... next node
+void *LL_GetPrev (LinkedList * list);	  //            ... prev node
+void *LL_GetLast (LinkedList * list);	  //            ... last node
 
-int LL_AddNode (LL * list, void *add);	// Adds node AFTER current one
-int LL_InsertNode (LL * list, void *add);	// Adds node BEFORE current one
+int LL_AddNode (LinkedList * list, void *add);	// Adds node AFTER current one
+int LL_InsertNode (LinkedList * list, void *add);	// Adds node BEFORE current one
 // Removes a node from the link; returns the data from the node
-void *LL_DeleteNode (LL * list);
+void *LL_DeleteNode (LinkedList * list);
 // Removes a specific node...
-void *LL_Remove (LL * list, void *data);
+void *LL_Remove (LinkedList * list, void *data);
 
 // Stack operations
-int LL_Push (LL * list, void *add);	// Add node to end of list
-void *LL_Pop (LL * list);		  // Remove node from end of list
-void *LL_Top (LL * list);		  // Peek at end node
-void *LL_Shift (LL * list);	  // Remove node from start of list
-void *LL_Look (LL * list);		  // Peek at first node
-int LL_Unshift (LL * list, void *add);	// Add node to beginning of list
+int LL_Push (LinkedList * list, void *add);	// Add node to end of list
+void *LL_Pop (LinkedList * list);		  // Remove node from end of list
+void *LL_Top (LinkedList * list);		  // Peek at end node
+void *LL_Shift (LinkedList * list);	  // Remove node from start of list
+void *LL_Look (LinkedList * list);		  // Peek at first node
+int LL_Unshift (LinkedList * list, void *add);	// Add node to beginning of list
 
-int LL_Roll (LL * list);		  // Make first node last
-int LL_UnRoll (LL * list);		  // Roll the other way...
+int LL_Roll (LinkedList * list);		  // Make first node last
+int LL_UnRoll (LinkedList * list);		  // Roll the other way...
 
 // Queue operations...
-//int LL_Enqueue(LL *list, void *add);
-//void * LL_Dequeue(LL *list);
+//int LL_Enqueue(LinkedList *list, void *add);
+//void * LL_Dequeue(LinkedList *list);
 //////////////////////////////////////////////////////////////////////
 // Queue operations...
 #define LL_Enqueue(list,add) LL_Push(list,add)
 
 #define LL_Dequeue(list) LL_Shift(list)
 
-int LL_PriorityEnqueue (LL * list, void *add, int compare (void *, void *));
+int LL_PriorityEnqueue (LinkedList * list, void *add, int compare (void *, void *));
 
 int LL_SwapNodes (LL_node * one, LL_node * two);	// Switch two nodes positions...
 int LL_nSwapNodes (int one, int two);	// Switch two nodes positions...
 
-int LL_Length (LL * list);		  // Returns # of nodes in entire list
+int LL_Length (LinkedList * list);		  // Returns # of nodes in entire list
 
 // Searching...
-void *LL_Find (LL * list, int compare (void *, void *), void *value);
+void *LL_Find (LinkedList * list, int compare (void *, void *), void *value);
 
 // Sorts the list...
-int LL_Sort (LL * list, int compare (void *, void *));
+int LL_Sort (LinkedList * list, int compare (void *, void *));
 
 // Debugging...
-void LL_dprint (LL * list);
+void LL_dprint (LinkedList * list);
 
 #endif