Added ability to maintain ordered linked list based on "insertAsc" function. The function takes a comparator function that allows for specific order behavior. If values collide, then FIFO or LIFO order can be maintained based on comparator function implementation.

Dependents:   JobScheduler

Fork of LinkedList by Sam Grove

Revision:
10:cb2e50ed6945
Parent:
9:b173aed98988
Child:
11:4336cd18cce9
--- a/LinkedList.h	Fri Jul 07 23:34:33 2017 +0000
+++ b/LinkedList.h	Fri Jul 07 23:36:03 2017 +0000
@@ -69,6 +69,7 @@
  */
  
  /** Example using new insertAsc function:
+ * @code
  
  #include "mbed.h"
 #include "LinkedList.h"
@@ -161,8 +162,7 @@
     exit(0);
 }
 
-
- 
+ * @endcode
  */
 
 /**