Timeline for Type-generic queue implementation using singly linked lists
Current License: CC BY-SA 4.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 7, 2022 at 1:09 | history | edited | Mode77 | CC BY-SA 4.0 |
Added link to the second revision
|
| Aug 4, 2022 at 13:39 | answer | added | Mode77 | timeline score: 3 | |
| Aug 4, 2022 at 11:56 | comment | added | CompuChip |
Just a minor tip that doesn't feel like it warrants a separate answer: I would suggest that dequeue returns the dequeued data. It allows for use cases like while( data = queue->dequeue() ) { /* do something with data */ ).
|
|
| Aug 3, 2022 at 18:53 | vote | accept | Mode77 | ||
| Aug 3, 2022 at 9:34 | history | became hot network question | |||
| Aug 3, 2022 at 9:00 | history | tweeted | twitter.com/StackCodeReview/status/1554753951295217664 | ||
| Aug 3, 2022 at 8:08 | answer | added | frozenca | timeline score: 9 | |
| Aug 3, 2022 at 4:34 | answer | added | vnp | timeline score: 11 | |
| Aug 3, 2022 at 4:14 | answer | added | Daniel Walker | timeline score: 6 | |
| Aug 2, 2022 at 19:52 | comment | added | Mode77 |
I've since realized that I'm not checking for malloc() returning NULL
|
|
| Aug 2, 2022 at 17:19 | history | edited | Mode77 | CC BY-SA 4.0 |
added 10 characters in body; deleted 1 character in body
|
| Aug 2, 2022 at 17:13 | history | asked | Mode77 | CC BY-SA 4.0 |