diff options
| author | Joshua Leung <aligorith@gmail.com> | 2018-08-22 16:24:48 +0300 |
|---|---|---|
| committer | Joshua Leung <aligorith@gmail.com> | 2018-08-23 08:07:37 +0300 |
| commit | be77eeae46e17c1b6ffb0e4d4834a1bd28aedf64 (patch) | |
| tree | b9792ffd5d95879635f6ce03352a73f8263cf4f2 /source/blender/depsgraph/intern/depsgraph_query.cc | |
| parent | 9e4770908968903537eff32df8d7a2f6b6641a8e (diff) | |
Depsgraph: First draft of graph filtering API implementation
When this works correctly, we should be able to feed in an existing
depsgraph instance, and get out a "filtered" copy of it that contains
only the subset of nodes needed to evaluate what we're interested in.
The current implementation only filters on ID blocks/nodes,
and starts by building a full new depsgraph instance first.
I'd originally intended to do it per operation instead, copying
over individual nodes as appropriate to have the smallest and least
memory intensive graph possible. However, I ended up running into
into problems with function binding + COW arguments, hence the
current slow solution.
Diffstat (limited to 'source/blender/depsgraph/intern/depsgraph_query.cc')
| -rw-r--r-- | source/blender/depsgraph/intern/depsgraph_query.cc | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/source/blender/depsgraph/intern/depsgraph_query.cc b/source/blender/depsgraph/intern/depsgraph_query.cc index a6c930196ef..631669babb2 100644 --- a/source/blender/depsgraph/intern/depsgraph_query.cc +++ b/source/blender/depsgraph/intern/depsgraph_query.cc @@ -27,7 +27,7 @@ /** \file blender/depsgraph/intern/depsgraph_query.cc * \ingroup depsgraph * - * Implementation of Querying and Filtering API's + * Implementation of Querying API */ #include "MEM_guardedalloc.h" |