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
Auto generated API documentation and code listings for LinkedList
LinkedList< T > | Returns true if data1 shall be inserted before data 2 |
node< T > | The Linked List structure |
Code
LinkedList.h [code] | Core Utility - Templated Linked List class |