Timeline for Generic Stack Data Structure Using Linked Lists
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 10, 2020 at 13:24 | history | edited | CommunityBot |
Commonmark migration
|
|
| Jun 25, 2018 at 7:12 | comment | added | Julien Vernay | @hoffmale It was edited, I put std::move() for each unique_ptr assignment | |
| Jun 25, 2018 at 7:11 | history | edited | Julien Vernay | CC BY-SA 4.0 |
Edited with hoffmale's comment
|
| Jun 24, 2018 at 22:22 | comment | added | hoffmale |
1) pops implementation should be top = std::move(top->next); as std::unique_ptr isn't copyable. 2) You actually want a loop in the destructor, as you otherwise may overflow the stack with recursion if the linked list has too many elements.
|
|
| Jun 24, 2018 at 22:14 | history | answered | Julien Vernay | CC BY-SA 4.0 |