Sergei G
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 
Sam Grove
Revision 15:f715e3067fa8, committed 2017-07-14
- Comitter:
- sgnezdov
- Date:
- Fri Jul 14 17:02:05 2017 +0000
- Parent:
- 14:7fd12867824f
- Commit message:
- minor debugging changes
Changed in this revision
| LinkedList.h | Show annotated file Show diff for this revision Revisions of this file |
--- a/LinkedList.h Thu Jul 13 23:59:55 2017 +0000
+++ b/LinkedList.h Fri Jul 14 17:02:05 2017 +0000
@@ -29,7 +29,8 @@
#define DBG_LLIST 0
#if DBG_LLIST
-#define DBG(...) do{debug("[%s:%d]", __PRETTY_FUNCTION__,__LINE__);debug(__VA_ARGS__);} while(0);
+// #define DBG(...) do{debug("[%s:%d]", __PRETTY_FUNCTION__,__LINE__);debug(__VA_ARGS__);} while(0);
+#define DBG(...) do{debug("[DBG ][ll ]");debug(__VA_ARGS__);} while(0);
#else
#define DBG(...) while(0);
#endif