当前位置: 首页>>代码示例>>C++>>正文


C++ ProfileNode::firstChild方法代码示例

本文整理汇总了C++中ProfileNode::firstChild方法的典型用法代码示例。如果您正苦于以下问题:C++ ProfileNode::firstChild方法的具体用法?C++ ProfileNode::firstChild怎么用?C++ ProfileNode::firstChild使用的例子?那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在ProfileNode的用法示例。


在下文中一共展示了ProfileNode::firstChild方法的4个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的C++代码示例。

示例1: traverseNextNodePostOrder

ProfileNode* ProfileNode::traverseNextNodePostOrder() const
{
    ProfileNode* next = m_nextSibling;
    if (!next)
        return m_parent;
    while (ProfileNode* firstChild = next->firstChild())
        next = firstChild;
    return next;
}
开发者ID:WebKitNix,项目名称:webkitnix,代码行数:9,代码来源:ProfileNode.cpp

示例2: removeProfileStart

// The console.profile that started this ProfileGenerator will be the first child.
void ProfileGenerator::removeProfileStart()
{
    ProfileNode* currentNode = nullptr;
    for (ProfileNode* next = m_rootNode.get(); next; next = next->firstChild())
        currentNode = next;

    if (currentNode->callIdentifier().functionName() != "profile")
        return;

    currentNode->parent()->removeChild(currentNode);
}
开发者ID:houzhenggang,项目名称:webkit,代码行数:12,代码来源:ProfileGenerator.cpp

示例3: removeProfileStart

// The console.ProfileGenerator that started this ProfileGenerator will be the first child.
void ProfileGenerator::removeProfileStart()
{
    ProfileNode* currentNode = 0;
    for (ProfileNode* next = m_head.get(); next; next = next->firstChild())
        currentNode = next;

    if (currentNode->callIdentifier().m_name != "profile")
        return;

    // Attribute the time of the node aobut to be removed to the self time of its parent
    currentNode->parent()->setSelfTime(currentNode->parent()->selfTime() + currentNode->totalTime());
    currentNode->parent()->removeChild(currentNode);
}
开发者ID:0omega,项目名称:platform_external_webkit,代码行数:14,代码来源:ProfileGenerator.cpp

示例4: forEach

void Profile::forEach(void (ProfileNode::*function)())
{
    ProfileNode* currentNode = m_head->firstChild();
    for (ProfileNode* nextNode = currentNode; nextNode; nextNode = nextNode->firstChild())
        currentNode = nextNode;

    if (!currentNode)
        currentNode = m_head.get();

    ProfileNode* endNode = m_head->traverseNextNodePostOrder();
    while (currentNode && currentNode != endNode) {
        (currentNode->*function)();
        currentNode = currentNode->traverseNextNodePostOrder();
    } 
}
开发者ID:Katarzynasrom,项目名称:patch-hosting-for-android-x86-support,代码行数:15,代码来源:Profile.cpp


注:本文中的ProfileNode::firstChild方法示例由纯净天空整理自Github/MSDocs等开源代码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。