Exemplos de previousAncestorSiblingPostOrder em C++ (Cpp)

Exemplo n.º 1

Arquivo: NodeTraversal.cpp Projeto: Channely/know-your-chrome

Node* previousSkippingChildrenPostOrder(const Node* current, const Node* stayWithin)
{
    if (current == stayWithin)
        return 0;
    if (current->previousSibling())
        return current->previousSibling();
    return previousAncestorSiblingPostOrder(current, stayWithin);
}

Exemplo n.º 2

Arquivo: NodeTraversal.cpp Projeto: coinpayee/blink

Node* NodeTraversal::previousPostOrder(const Node& current, const Node* stayWithin)
{
    if (current.lastChild())
        return current.lastChild();
    if (current == stayWithin)
        return 0;
    if (current.previousSibling())
        return current.previousSibling();
    return previousAncestorSiblingPostOrder(current, stayWithin);
}

Exemplo n.º 3

Arquivo: FlatTreeTraversal.cpp Projeto: endlessm/chromium-browser

// TODO(yosin) We should consider introducing template class to share code
// between DOM tree traversal and flat tree tarversal.
Node* FlatTreeTraversal::previousPostOrder(const Node& current, const Node* stayWithin)
{
    assertPrecondition(current);
    if (stayWithin)
        assertPrecondition(*stayWithin);
    if (Node* lastChild = traverseLastChild(current)) {
        assertPostcondition(lastChild);
        return lastChild;
    }
    if (current == stayWithin)
        return nullptr;
    if (Node* previousSibling = traversePreviousSibling(current)) {
        assertPostcondition(previousSibling);
        return previousSibling;
    }
    return previousAncestorSiblingPostOrder(current, stayWithin);
}