Sergei G / LinkedList

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

Diff: LinkedList.h

Revision:
3:c14e7a918e21
Parent:
2:704e1c9057c1
Child:
7:4ed66162aaa8
--- a/LinkedList.h	Fri Apr 05 23:44:10 2013 +0000
+++ b/LinkedList.h	Mon Apr 08 22:23:25 2013 +0000
@@ -52,7 +52,7 @@
  *      list.push((char*)"One\n");
  *      list.append((char*)"Five\n");
  *      
- *      for(int i=0; i<list.length(); i++)
+ *      for(int i=1; i<=list.length(); i++)
  *      {
  *          tmp = list.pop(i);
  *          printf("%s", (char *)tmp->data);