Timeline for How to implement deep copy?
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 14, 2012 at 13:33 | comment | added | jmad | @qznc: Sure there are but you know you have to be careful with them. (For example, the in-place version of quicksort is with an array. But in Ocaml you prefer the not in-place version). This was just to say it was not necessary.* | |
| Jun 14, 2012 at 12:14 | comment | added | qznc | I never really used Ocaml, but I assume it is capable of mutable data. Otherwise it would be impossible to implement algorithms like Quicksort, which works in-place. In Java you would specialize the deep copy for immutable objects to simply return the identical object. | |
| Jun 14, 2012 at 11:03 | history | answered | jmad | CC BY-SA 3.0 |