Timeline for My linked list implementation in C
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 2, 2017 at 4:14 | comment | added | StoryTeller - Unslander Monica | @Kaz - Um... did you read Linus' post carefully? He objects to a typedef that provides no abstration. I used it to create an opaque list handle. That's an abstraction. | |
| Oct 2, 2017 at 1:08 | comment | added | Frankg26 | @StoryTeller I added version 2! In case you are curious! | |
| Oct 1, 2017 at 22:28 | comment | added | Kaz |
Not everyone sees the value in the typedef, .e.g. Linus Torvalds.
|
|
| Oct 1, 2017 at 16:05 | comment | added | StoryTeller - Unslander Monica | @Frankg26 - Yes in regard to #5. As for #3. When you want to change something, you need to pass a pointer to it. Modifying the list may require modifying the handle. We want the caller to see that modification. | |
| Oct 1, 2017 at 16:04 | comment | added | Frankg26 | Thanks @StoryTeller for the reply! Regarding #5, the parameter "struct node* position" refers to the address of the node that will be deleted? Am I correct? Also I do not really understand what you mean with #3. | |
| Oct 1, 2017 at 7:35 | history | edited | StoryTeller - Unslander Monica | CC BY-SA 3.0 |
added 9 characters in body
|
| Oct 1, 2017 at 7:03 | history | edited | StoryTeller - Unslander Monica | CC BY-SA 3.0 |
edited body
|
| Oct 1, 2017 at 6:55 | history | edited | StoryTeller - Unslander Monica | CC BY-SA 3.0 |
added 402 characters in body
|
| Oct 1, 2017 at 6:49 | history | answered | StoryTeller - Unslander Monica | CC BY-SA 3.0 |