Aspose::Words::Node::NextPreOrder method

Node::NextPreOrder method

Gets next node according to the pre-order tree traversal algorithm.

System::SharedPtr<Aspose::Words::Node> Aspose::Words::Node::NextPreOrder(const System::SharedPtr<Aspose::Words::Node> &rootNode)
ParameterTypeDescription
rootNodeconst System::SharedPtr<Aspose::Words::Node>&The top node (limit) of traversal.

ReturnValue

Next node in pre-order order. Null if reached the rootNode.

Examples

Shows how to traverse the document’s node tree using the pre-order traversal algorithm, and delete any encountered shape with an image.

auto doc = MakeObject<Document>(MyDir + u"Images.docx");

ASSERT_EQ(9,
          doc->GetChildNodes(NodeType::Shape, true)->LINQ_OfType<SharedPtr<Shape>>()->LINQ_Count([](SharedPtr<Shape> s) { return s->get_HasImage(); }));

SharedPtr<Node> curNode = doc;
while (curNode != nullptr)
{
    SharedPtr<Node> nextNode = curNode->NextPreOrder(doc);

    if (curNode->PreviousPreOrder(doc) != nullptr && nextNode != nullptr)
    {
        ASPOSE_ASSERT_EQ(curNode, nextNode->PreviousPreOrder(doc));
    }

    if (curNode->get_NodeType() == NodeType::Shape && (System::ExplicitCast<Shape>(curNode))->get_HasImage())
    {
        curNode->Remove();
    }

    curNode = nextNode;
}

ASSERT_EQ(0,
          doc->GetChildNodes(NodeType::Shape, true)->LINQ_OfType<SharedPtr<Shape>>()->LINQ_Count([](SharedPtr<Shape> s) { return s->get_HasImage(); }));

See Also

Aspose::Words::Node::IsAncestorNode method Aspose::Words::Node::PreviousPreOrder method