Edytuj

Udostępnij za pośrednictwem


XNode.IsAfter(XNode) Method

Definition

Determines if the current node appears after a specified node in terms of document order.

public:
 bool IsAfter(System::Xml::Linq::XNode ^ node);
public bool IsAfter (System.Xml.Linq.XNode node);
public bool IsAfter (System.Xml.Linq.XNode? node);
member this.IsAfter : System.Xml.Linq.XNode -> bool
Public Function IsAfter (node As XNode) As Boolean

Parameters

node
XNode

The XNode to compare for document order.

Returns

true if this node appears after the specified node; otherwise false.

Examples

The following example uses this method.

XElement xmlTree = new XElement("Root",  
    new XText("Text content."),  
    new XElement("Child1", "child1 content"),  
    new XElement("Child2", "child2 content"),  
    new XElement("Child3", "child3 content"),  
    new XText("More text content."),  
    new XElement("Child4", "child4 content"),  
    new XElement("Child5", "child5 content")  
);  
XElement child3 = xmlTree.Element("Child3");  
XElement child5 = xmlTree.Element("Child5");  
if (child5.IsAfter(child3))  
    Console.WriteLine("Child5 is after Child3");  
else  
    Console.WriteLine("Child5 is not after Child3");  
Dim xmlTree As XElement = _   
        <Root>Text content.  
            <Child1>child1 content</Child1>  
            <Child2>child2 content</Child2>  
            <Child3>child3 content</Child3>More text content.  
            <Child4>child4 content</Child4>  
            <Child5>child5 content</Child5>  
        </Root>  

Dim child3 As XElement = xmlTree.<Child3>(0)  
Dim child5 As XElement = xmlTree.<Child5>(0)  
If (child5.IsAfter(child3)) Then  
    Console.WriteLine("Child5 is after Child3")  
Else  
    Console.WriteLine("Child5 is not after Child3")  
End If  

This example produces the following output:

Child5 is after Child3  

Remarks

The XContainer stores its child nodes as a singly-linked list of XNode objects. This means that the CompareDocumentOrder method must traverse the ancestors of the two nodes being compared until it finds the common parent. Then it must traverse the list of the common parent's child nodes to determine the order of the two nodes being compared. Therefore, using this method might affect your performance.

Applies to

See also