{"push_id":644360631,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"52cb4bf01bb93bda2c892cecc0db60a40a5cc694","before":"f161a95dab301f69de9eb6cec9ae97d181f2792f","commits":[{"sha":"52cb4bf01bb93bda2c892cecc0db60a40a5cc694","author":{"email":"4b4df3e83fa3e8ead7500da695eb55153db6f140@gmail.com","name":"Louis Jenkins"},"message":"Revised the Linked  List header file. This is makes things 100x easier,\nand honestly I don't see the need to have a single linked list when a\ndouble linked list has only slightly more overhead (of course I know\nthat single linked lists are more efficient in some cases, but if I want\nto make one, I'll do it at a later date).\n\nChanging the whole idea of the Data Structures project too. While I plan\non having all data structures derive from Linked List (as in they will\nuse and build on top of it), I can't make it generic enough that\nliterally any type of data structure can work on it. For instance, while\nI can make a normally single-linked list implementation like a stack\nwork with double linked list, a *tree will not work at all, hence I will\nhave to create a tree list some time in the future... or maybe expand on\nthis and end up with what I was originally aiming for, except with a\nstable data structure to base it on. Regardless, I'm taking it easy this\ntime.\n\nThe Linked List will, when stable, be able to do all of the following:\n\n1) Add and Delete items from the linked list.\n1A) Have parameters which will tailor this for you. For instance, there\nare already macro definitions which will do certain things based on what\nparameters you pass. Like adding DELETE to Linked_List_Remove will\ndelete the item as well as remove the pointer from the list, by calling\nthe delete callback (either default or user provided) on it before\nfinishing up it's operation.\n2) Obtain items from the list based on either an iterator or by\nsupplying the index.\n2A) There will be index checking, so if the index given is bogus, it\nwill either return NULL, or return the first or last (maybe both if\nthere's only one item) in the list. Haven't decided which yet.\n2B) Iterator will be able to also add and remove items from the linked\nlist, except with more ease than normally accessing the Linked List. It\nalso has parameter-passing.\n3) Ability to sort the linked list based on a comparator passed.\n3A) If no comparator passed, it will NOP and return immediately.\n3B) Have parameters to either be in descending or ascending order.\n\nAnd that's all she wrote folks. Hopefully will be able to finish this\nwithin a week or two, but with finals coming up, probably not until\nafter summer begins. Then it'll be V. 1.0.","distinct":true,"url":"https://api.github.com/repos/theif519/C_Utils/commits/52cb4bf01bb93bda2c892cecc0db60a40a5cc694"}]}