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.
Fork of LinkedList by
Diff: LinkedList.h
- Revision:
- 7:4ed66162aaa8
- Parent:
- 3:c14e7a918e21
- Child:
- 8:918b196b0ac4
--- a/LinkedList.h Tue May 14 23:06:11 2013 +0000 +++ b/LinkedList.h Sun Feb 23 14:09:48 2014 +0000 @@ -24,6 +24,7 @@ #define LINKEDLIST_H_ #include <stdint.h> +#include "mbed.h" /** * @struct node