Some days ago I've added a patch (id 3098068) with three new functions for the node-class which provide an pointer-based cut and paste-mechanism without the need of an internal copy-task if the user wants to put a child-tree to an other place. Especially if the child itself is the root of a very deep part-tree a copy-process may be very time-consuming and if this happens frequently it slows down the program. This new methods are modifications of already existing methods and the main difference is that the cut-method doesn't delete the moved sub-tree and the paste-methods don't create copies of it.
What are you thinking about ?
Log in to post a comment.