Files
test/source/blender/blenlib
Jacques Lucke 7b61dcf6bc Geometry Nodes: deduplicate anonymous attribute analysis algorithm
Previously, there were two independent algorithms for analysing how anonymous
attributes are used in a node tree: One that just computed the `aal::RelationsInNode`
for an entire node tree and one that performed a more in depth analysis to
determine how far anonymous attributes should be propagated.

As it turns out, both operations can also be done at the same time and the result
can be cached on the node tree. This reduces the amount of code and allows for
better code reuse.

This simplification is likely only an intermediate step as things will probably have
to be refactored further to support e.g. serial loops (#108896).
2023-06-14 14:04:22 +02:00
..
2023-06-13 09:18:12 +02:00
2023-06-09 10:33:29 +02:00
2023-06-09 11:40:50 +10:00
2023-06-09 10:33:29 +02:00
2023-06-13 09:18:12 +02:00
2023-06-09 11:40:50 +10:00