UIHelper的两个自动递归获取节点的函数（返回Node *）

本文详细介绍了如何通过标签和内容进行高效的节点搜索算法，包括按标签和名称搜索的方法，以及广度优先搜索与递归消除算法的结合应用。

//by tag

Node* seekNodeByTag(Node* root, int tag){

if (!root)
{
return nullptr;
}
if (root->getTag() == tag)
{
return root;
}
const auto& arrayRootChildren = root->getChildren();
ssize_t length = arrayRootChildren.size();
for (ssize_t i=0;i<length;i++)
{
Node* child = dynamic_cast<Node*>(arrayRootChildren.at(i));
if (child)
{
Node* res = seekNodeByTag(child,tag);
if (res != nullptr)
{
return res;
}
}
}
return nullptr;

}

//by name

Node* seekNodeByName(Node* root, const std::string& name)
{
if (!root)
{
return nullptr;
}
if (root->getName() == name)
{
return root;
}
const auto& arrayRootChildren = root->getChildren();
for (auto& subWidget : arrayRootChildren)
{
Node* child = dynamic_cast<Node*>(subWidget);
if (child)
{
Node* res = seekNodeByName(child,name);
if (res != nullptr)
{
return res;
}
}
}
return nullptr;
}

//广度优先+递归消除算法：

Node * Helper::seekNodeByName_WF(Node *root,const std::string &name)
{
   if(!root || root->getName() == name)
      return root;

   auto vecChildren = &root->getChildren();
   std::vector<decltype(vecChildren)>vec;
   vec.push_back(vecChildren);
   size_t index = 0;
   do
   {
    vecChildren = vec[index];
    for(auto node : *vecChildren)
    {
        if(node->getName() == name)
            {
         return node;
            }
            vec.push_back(&node->getChildren());
        }
     ++index;
    } while (index != vec.size());

return nullptr;
}

Node * Helper::seekNodeByTag_WF(Node *root,int tag)
{
    if(!root || root->getTag() == tag)
        return root;

    auto vecChildren = &root->getChildren();
    std::vector<decltype(vecChildren)>vec;
    vec.push_back(vecChildren);
    size_t index = 0;
    do
    {
     vecChildren = vec[index];
        for(auto node : *vecChildren)
        {
            if(node->getTag() == tag)
            {
                return node;
            }
            vec.push_back(&node->getChildren());
        }
++index;
} while (index != vec.size());

return nullptr;
}