本文整理汇总了C++中NODE::GetParent方法的典型用法代码示例。如果您正苦于以下问题：C++ NODE::GetParent方法的具体用法？C++ NODE::GetParent怎么用？C++ NODE::GetParent使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类NODE的用法示例。
在下文中一共展示了NODE::GetParent方法的1个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: if
FCDSceneNodeIteratorT<NODE>::FCDSceneNodeIteratorT(NODE* root, SearchType searchType, bool pureChildOnly)
{
queue.reserve(8);
if (searchType == BREADTH_FIRST)
{
queue.push_back(root);
// Fill in the queue completely,
// in case the user using this iterator wants to modify stuff.
for (size_t index = 0; index < queue.size(); ++index)
{
NODE* it = queue[index];
size_t childCount = it->GetChildrenCount();
for (size_t c = 0; c < childCount; ++c)
{
NODE* node = it->GetChild(c);
if (!pureChildOnly || node->GetParent(0) == it) queue.push_back(node);
}
if (!pureChildOnly)
{
size_t instanceCount = it->GetInstanceCount();
for (size_t i = 0; i < instanceCount; ++i)
{
const FCDEntity* entity = it->GetInstance(i)->GetEntity();
if (entity != NULL && entity->HasType(FCDSceneNode::GetClassType())) queue.push_back((NODE*) entity);
}
}
}
}
else // depth first
{
// In depth-first mode, we need a breadth-first processing queue and a depth-first iteration queue.
typedef fm::pair<NODE*,size_t> Child;
fm::vector<Child> processQueue;
processQueue.reserve(8);
processQueue.push_back(Child(root, 0));
if (searchType == DEPTH_FIRST_PREORDER) queue.push_back(root);
while (!processQueue.empty())
{
Child& it = processQueue.back();
size_t nodeChildCount = it.first->GetChildrenCount();
size_t nodeInstanceCount = it.first->GetInstanceCount();
if (it.second < nodeChildCount)
{
NODE* add = it.first->GetChild(it.second++);
if (pureChildOnly && add->GetParent(0) != it.first) continue;
if (searchType == DEPTH_FIRST_PREORDER) queue.push_back(add);
if (add->GetChildrenCount() == 0 && add->GetInstanceCount() == 0)
{
// Don't bother processing this node.
if (searchType == DEPTH_FIRST_POSTORDER) queue.push_back(add);
}
else
{
processQueue.push_back(Child(add, 0));
}
}
else if (it.second < nodeChildCount + nodeInstanceCount && !pureChildOnly)
{
for (; it.second < nodeChildCount + nodeInstanceCount; ++it.second)
{
size_t instanceIndex = it.second - nodeChildCount;
const FCDEntity* entity = it.first->GetInstance(instanceIndex)->GetEntity();
if (entity != NULL && entity->HasType(FCDSceneNode::GetClassType()))
{
NODE* add = (NODE*) entity;
if (add->GetChildrenCount() == 0 && add->GetInstanceCount() == 0)
{
// Don't bother processing this node.
queue.push_back(add);
}
else
{
processQueue.push_back(Child(add, 0));
++(it.second);
break;
}
}
}
}
else
{
if (searchType == DEPTH_FIRST_POSTORDER) queue.push_back(it.first);
processQueue.pop_back();
}
}
}
iterator = 0;
}