Timeline for Creating an insert at front function for a circular doubly linked list
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 4, 2015 at 19:40 | history | edited | rolfl |
edited tags
|
|
| Nov 15, 2014 at 11:16 | comment | added | JS1 |
I don't understand why add_to_list takes TCB_t **addQ as an argument instead of just TCB_t *addQ. You never modify the actual pointer passed in, so you are just adding a level of indirection for nothing. Also I personally like to use a local variable p which is set to *ptrBlock and then use p to do the list manipulation, then at the end set *ptrBlock = p. It gets rid of all the awkward (*ptrBlock)s.
|
|
| Nov 11, 2014 at 3:33 | history | edited | Jamal | CC BY-SA 3.0 |
added 6 characters in body
|
| Nov 11, 2014 at 2:49 | history | edited | Aaron | CC BY-SA 3.0 |
added more code for an explanation
|
| Nov 11, 2014 at 2:07 | answer | added | Edward | timeline score: 2 | |
| Nov 10, 2014 at 21:51 | history | edited | Aaron | CC BY-SA 3.0 |
added 155 characters in body
|
| Nov 10, 2014 at 21:47 | history | edited | Edward | CC BY-SA 3.0 |
edited title
|
| Nov 10, 2014 at 21:47 | comment | added | Edward |
Include the definition of struct TCB_t, and ideally, some complete but short test code, for better reviews.
|
|
| Nov 10, 2014 at 21:35 | history | asked | Aaron | CC BY-SA 3.0 |