Join GitHub today
GitHub is home to over 40 million developers working together to host and review code, manage projects, and build software together.Sign up
add workaround for memory leaks in bag generators (fixes #5189) #5208
Every nested potential sub-task (lists and tuples starting with a callable) in a task (a value in the graph) is traversed during graph optimization and execution a couple times. While these traversals usually are negligible compared to the cost of the actual computation, they do still take time and memory. Flattening the task structure a bit can help speed up optimization passes and execution time as the scheduler has less to do.