Blender Git Commit Log

Git Commits -> Revision dbbf0e7

Revision dbbf0e7 by Hans Goudey (master)
December 22, 2021, 14:52 (GMT)
Nodes: Improve node tree copy performance

When copying a full node tree, we can avoid an O(n^2) loop finding a
unique name for every node if we assume they already have unique names.
That is a reasonable assumption, since unique names are verified
elsewhere when adding a new node.

Copying a node tree with about 4000 nodes took 42 ms before,
now it takes 6 ms.

Differential Revision: https://developer.blender.org/D13644

Commit Details:

Full Hash: dbbf0e7f66524ac8c2d997e442d053f9f3c0590e
Parent Commit: fdc4a1a
Lines Changed: +4, -2

2 Modified Paths:

/source/blender/blenkernel/BKE_node.h (+2, -1) (Diff)
/source/blender/blenkernel/intern/node.cc (+2, -1) (Diff)
By: Miika HämäläinenLast update: Nov-07-2014 14:18MiikaHweb | 2003-2021