2 * Copyright (c) 2023 Samsung Electronics Co., Ltd.
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at
8 * http://www.apache.org/licenses/LICENSE-2.0
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
19 #include <dali/internal/update/manager/scene-graph-traveler.h>
22 #include <dali/internal/update/nodes/node.h>
28 SceneGraphTraveler::SceneGraphTraveler(SceneGraph::Node& rootNode)
29 : mRootNode(rootNode),
33 mRootNode.AddObserver(*this);
37 SceneGraphTraveler::~SceneGraphTraveler()
41 mRootNode.RemoveObserver(*this);
45 SceneGraph::Node* SceneGraphTraveler::FindNode(uint32_t id)
47 SceneGraph::Node* node = nullptr;
49 // Find node in cached map
50 auto iter = mTravledNodeMap.find(id);
51 if(iter != mTravledNodeMap.end())
57 while(!FullSearched())
59 SceneGraph::Node& currentNode = GetCurrentNode();
62 // Cache traveled node and id pair.
63 mTravledNodeMap.insert({currentNode.mId, ¤tNode});
65 if(currentNode.mId == id)
76 void SceneGraphTraveler::Clear()
78 mTravledNodeMap.clear();
79 mTravledNodeMap.rehash(0u); ///< Note : We have to reduce capacity of hash map. Without this line, clear() API will be slow downed.
83 mNodeStack.emplace_back(&mRootNode, 0u);
87 bool SceneGraphTraveler::FullSearched() const
89 return mNodeStack.empty();
92 SceneGraph::Node& SceneGraphTraveler::GetCurrentNode()
94 DALI_ASSERT_DEBUG(!FullSearched());
96 return *(mNodeStack.back().first);
99 void SceneGraphTraveler::IterateNextNode()
101 while(!mNodeStack.empty())
103 auto& currentNode = *(mNodeStack.back().first);
104 uint32_t currentChildIndex = mNodeStack.back().second;
106 if(currentNode.GetChildren().Count() <= currentChildIndex)
108 mNodeStack.pop_back();
113 // Stack current child, and increase index
114 ++mNodeStack.back().second;
115 mNodeStack.emplace_back(currentNode.GetChildren()[currentChildIndex], 0u);
121 } // namespace Internal