1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
|
// Copyright (C) 2017 Klaralvdalens Datakonsult AB (KDAB).
// SPDX-License-Identifier: LicenseRef-Qt-Commercial OR LGPL-3.0-only OR GPL-2.0-only OR GPL-3.0-only
#include "clipblendnodevisitor_p.h"
#include <Qt3DAnimation/private/managers_p.h>
#include <Qt3DAnimation/private/clipblendnode_p.h>
QT_BEGIN_NAMESPACE
namespace Qt3DAnimation {
namespace Animation {
/*!
\class ClipBlendNodeVisitor
\internal
Visits a blend tree in either pre- or post-order manner, optionally taking care
to only visit the nodes that are dependencies of evaluating the blend
tree.
*/
ClipBlendNodeVisitor::ClipBlendNodeVisitor(ClipBlendNodeManager *manager,
TraversalOrder order,
NodeFilter filter)
: m_manager(manager)
, m_order(order)
, m_filter(filter)
{
}
void ClipBlendNodeVisitor::traverse(Qt3DCore::QNodeId rootId,
const VisitFunction &visitFunction) const
{
ClipBlendNode *node = m_manager->lookupNode(rootId);
if (node != nullptr) {
switch (m_order) {
case PreOrder: {
switch (m_filter) {
case VisitAllNodes:
visitPreOrderAllNodes(node, visitFunction);
break;
case VisitOnlyDependencies:
visitPreOrderDependencyNodes(node, visitFunction);
break;
}
break;
}
case PostOrder: {
switch (m_filter) {
case VisitAllNodes:
visitPostOrderAllNodes(node, visitFunction);
break;
case VisitOnlyDependencies:
visitPostOrderDependencyNodes(node, visitFunction);
break;
}
break;
}
}
}
}
/*!
\internal
Leaf to root traversal (Pre-order traversal) visiting all nodes even if
they will not participate in current evaluation of the blend tree.
*/
void ClipBlendNodeVisitor::visitPreOrderAllNodes(ClipBlendNode *node,
const VisitFunction &visitFunction) const
{
visitFunction(node);
const Qt3DCore::QNodeIdVector childIds = node->allDependencyIds();
for (const Qt3DCore::QNodeId &childId: childIds) {
ClipBlendNode *childNode = m_manager->lookupNode(childId);
if (childNode != nullptr)
visitPreOrderAllNodes(childNode, visitFunction);
}
}
/*!
\internal
Leaf to root traversal (Post-order traversal) visiting all nodes even if
they will not participate in current evaluation of the blend tree.
*/
void ClipBlendNodeVisitor::visitPostOrderAllNodes(ClipBlendNode *node,
const VisitFunction &visitFunction) const
{
const Qt3DCore::QNodeIdVector childIds = node->allDependencyIds();
for (const Qt3DCore::QNodeId &childId: childIds) {
ClipBlendNode *childNode = m_manager->lookupNode(childId);
if (childNode != nullptr)
visitPostOrderAllNodes(childNode, visitFunction);
}
visitFunction(node);
}
/*!
\internal
Leaf to root traversal (Pre-order traversal) visiting only nodes required
to evaluate the blend tree given its current state.
*/
void ClipBlendNodeVisitor::visitPreOrderDependencyNodes(ClipBlendNode *node,
const VisitFunction &visitFunction) const
{
visitFunction(node);
const Qt3DCore::QNodeIdVector childIds = node->currentDependencyIds();
for (const Qt3DCore::QNodeId &childId: childIds) {
ClipBlendNode *childNode = m_manager->lookupNode(childId);
if (childNode != nullptr)
visitPreOrderDependencyNodes(childNode, visitFunction);
}
}
/*!
\internal
Leaf to root traversal (Post-order traversal) visiting only nodes required
to evaluate the blend tree given its current state.
*/
void ClipBlendNodeVisitor::visitPostOrderDependencyNodes(ClipBlendNode *node,
const VisitFunction &visitFunction) const
{
const Qt3DCore::QNodeIdVector childIds = node->currentDependencyIds();
for (const Qt3DCore::QNodeId &childId: childIds) {
ClipBlendNode *childNode = m_manager->lookupNode(childId);
if (childNode != nullptr)
visitPostOrderDependencyNodes(childNode, visitFunction);
}
visitFunction(node);
}
} // Animation
} // Qt3DAnimation
QT_END_NAMESPACE
|
