The copyobject implementation currently has problems with LinkedLists and
similar data structures. The recursive traversal of such objects can cause
stack overflows if the linked lists are long enough (generally a few thousand
elements will cause this problem).
This issue proposes an enhancement to fix this behavior by moving to a
non-recursive worklist algorithm for traversing all object graphs.