SyntaxEditor.InsertAfter Method
Definition
Overloads
InsertAfter(SyntaxNode, SyntaxNode) |
Insert the new node after the specified node already existing in the tree. |
InsertAfter(SyntaxNode, IEnumerable<SyntaxNode>) |
Insert the new nodes after the specified node already existing in the tree. |
InsertAfter(SyntaxNode, SyntaxNode)
Insert the new node after the specified node already existing in the tree.
public:
void InsertAfter(Microsoft::CodeAnalysis::SyntaxNode ^ node, Microsoft::CodeAnalysis::SyntaxNode ^ newNode);
public void InsertAfter (Microsoft.CodeAnalysis.SyntaxNode node, Microsoft.CodeAnalysis.SyntaxNode newNode);
member this.InsertAfter : Microsoft.CodeAnalysis.SyntaxNode * Microsoft.CodeAnalysis.SyntaxNode -> unit
Public Sub InsertAfter (node As SyntaxNode, newNode As SyntaxNode)
Parameters
- node
- SyntaxNode
The node already existing in the tree that the new nodes will be placed after. This must be a node this is contained within a syntax list.
- newNode
- SyntaxNode
The node to place after the existing node. This node must be of a compatible type to be placed in the same list containing the existing node.
Applies to
InsertAfter(SyntaxNode, IEnumerable<SyntaxNode>)
Insert the new nodes after the specified node already existing in the tree.
public:
void InsertAfter(Microsoft::CodeAnalysis::SyntaxNode ^ node, System::Collections::Generic::IEnumerable<Microsoft::CodeAnalysis::SyntaxNode ^> ^ newNodes);
public void InsertAfter (Microsoft.CodeAnalysis.SyntaxNode node, System.Collections.Generic.IEnumerable<Microsoft.CodeAnalysis.SyntaxNode> newNodes);
member this.InsertAfter : Microsoft.CodeAnalysis.SyntaxNode * seq<Microsoft.CodeAnalysis.SyntaxNode> -> unit
Public Sub InsertAfter (node As SyntaxNode, newNodes As IEnumerable(Of SyntaxNode))
Parameters
- node
- SyntaxNode
The node already existing in the tree that the new nodes will be placed after. This must be a node this is contained within a syntax list.
- newNodes
- IEnumerable<SyntaxNode>
The nodes to place after the existing node. These nodes must be of a compatible type to be placed in the same list containing the existing node.