Timeline for Recursive binary search tree
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 8, 2015 at 18:34 | comment | added | lightning_missile | Um, I can't make it work when I remove std::move() from my returns. I should've experimented with it more before writing this tree. I'll fix it and maybe post a followup :) | |
| Jan 8, 2015 at 17:35 | history | edited | Jamal | CC BY-SA 3.0 |
added 1179 characters in body
|
| Jan 8, 2015 at 16:33 | vote | accept | lightning_missile | ||
| Jan 8, 2015 at 16:30 | comment | added | Jamal |
@morbidCode: I think your use of smart pointers here is okay. They clean themselves up, which I suppose is why there's no destructor. I'm not entirely sure about std::move, though. But there are more rules pertaining to having one returned, as mentioned here. Perhaps this type of return wouldn't be needed.
|
|
| Jan 8, 2015 at 16:20 | comment | added | lightning_missile | Thanks. How about my std::unique_ptr() and std::move()s? I think I move nodes a lot here. Is it fine doing that? | |
| Jan 7, 2015 at 19:47 | history | answered | Jamal | CC BY-SA 3.0 |