SyntaxFactory.AreEquivalent Method

Definition

Namespace:

Microsoft.CodeAnalysis.VisualBasic

Assembly:

Microsoft.CodeAnalysis.VisualBasic.dll

Package:

Microsoft.CodeAnalysis.VisualBasic v4.9.2

Overloads

AreEquivalent(SyntaxTree, SyntaxTree, Boolean)	Determines if two trees are the same, disregarding trivia differences.
AreEquivalent(SyntaxNode, SyntaxNode, Func<SyntaxKind,Boolean>)	Determines if two syntax nodes are the same, disregarding trivia differences.
AreEquivalent(SyntaxToken, SyntaxToken)	Determines if two syntax tokens are the same, disregarding trivia differences.
AreEquivalent(SyntaxTokenList, SyntaxTokenList)	Determines if two lists of tokens are the same, disregarding trivia differences.
AreEquivalent(SyntaxNode, SyntaxNode, Boolean)	Determines if two syntax nodes are the same, disregarding trivia differences.
AreEquivalent<TNode>(SeparatedSyntaxList<TNode>, SeparatedSyntaxList<TNode>, Func<SyntaxKind,Boolean>)	Determines if two lists of syntax nodes are the same, disregarding trivia differences.
AreEquivalent<TNode>(SyntaxList<TNode>, SyntaxList<TNode>, Func<SyntaxKind,Boolean>)	Determines if two lists of syntax nodes are the same, disregarding trivia differences.

AreEquivalent(SyntaxTree, SyntaxTree, Boolean)

Source:

SyntaxFactory.vb

Determines if two trees are the same, disregarding trivia differences.

public:
 static bool AreEquivalent(Microsoft::CodeAnalysis::SyntaxTree ^ oldTree, Microsoft::CodeAnalysis::SyntaxTree ^ newTree, bool topLevel);

public static bool AreEquivalent (Microsoft.CodeAnalysis.SyntaxTree oldTree, Microsoft.CodeAnalysis.SyntaxTree newTree, bool topLevel);

static member AreEquivalent : Microsoft.CodeAnalysis.SyntaxTree * Microsoft.CodeAnalysis.SyntaxTree * bool -> bool

Public Shared Function AreEquivalent (oldTree As SyntaxTree, newTree As SyntaxTree, topLevel As Boolean) As Boolean

Parameters

oldTree

SyntaxTree

The original tree.

newTree

SyntaxTree

The new tree.

topLevel

Boolean

True to ignore any differences of nodes inside bodies of methods, operators, constructors and accessors, and field and auto-property initializers, otherwise all nodes and tokens must be equivalent.

Returns

Boolean

AreEquivalent(SyntaxNode, SyntaxNode, Func<SyntaxKind,Boolean>)

Source:

SyntaxFactory.vb

Determines if two syntax nodes are the same, disregarding trivia differences.

public static bool AreEquivalent (Microsoft.CodeAnalysis.SyntaxNode oldNode, Microsoft.CodeAnalysis.SyntaxNode newNode, Func<Microsoft.CodeAnalysis.VisualBasic.SyntaxKind,bool> ignoreChildNode = default);

static member AreEquivalent : Microsoft.CodeAnalysis.SyntaxNode * Microsoft.CodeAnalysis.SyntaxNode * Func<Microsoft.CodeAnalysis.VisualBasic.SyntaxKind, bool> -> bool

Public Shared Function AreEquivalent (oldNode As SyntaxNode, newNode As SyntaxNode, Optional ignoreChildNode As Func(Of SyntaxKind, Boolean) = Nothing) As Boolean

Parameters

oldNode

SyntaxNode

The old node.

newNode

SyntaxNode

The new node.

ignoreChildNode

Func<SyntaxKind,Boolean>

If specified called for every child syntax node (not token) that is visited during the comparison. It it returns true the child is recursively visited, otherwise the child and its subtree is disregarded.

Returns

Boolean

AreEquivalent(SyntaxToken, SyntaxToken)

Source:

SyntaxFactory.vb

Determines if two syntax tokens are the same, disregarding trivia differences.

public:
 static bool AreEquivalent(Microsoft::CodeAnalysis::SyntaxToken oldToken, Microsoft::CodeAnalysis::SyntaxToken newToken);

public static bool AreEquivalent (Microsoft.CodeAnalysis.SyntaxToken oldToken, Microsoft.CodeAnalysis.SyntaxToken newToken);

static member AreEquivalent : Microsoft.CodeAnalysis.SyntaxToken * Microsoft.CodeAnalysis.SyntaxToken -> bool

Public Shared Function AreEquivalent (oldToken As SyntaxToken, newToken As SyntaxToken) As Boolean

Parameters

oldToken

SyntaxToken

The old token.

newToken

SyntaxToken

The new token.

Returns

Boolean

AreEquivalent(SyntaxTokenList, SyntaxTokenList)

Source:

SyntaxFactory.vb

Determines if two lists of tokens are the same, disregarding trivia differences.

public:
 static bool AreEquivalent(Microsoft::CodeAnalysis::SyntaxTokenList oldList, Microsoft::CodeAnalysis::SyntaxTokenList newList);

public static bool AreEquivalent (Microsoft.CodeAnalysis.SyntaxTokenList oldList, Microsoft.CodeAnalysis.SyntaxTokenList newList);

static member AreEquivalent : Microsoft.CodeAnalysis.SyntaxTokenList * Microsoft.CodeAnalysis.SyntaxTokenList -> bool

Public Shared Function AreEquivalent (oldList As SyntaxTokenList, newList As SyntaxTokenList) As Boolean

Parameters

oldList

SyntaxTokenList

The old token list.

newList

SyntaxTokenList

The new token list.

Returns

Boolean

AreEquivalent(SyntaxNode, SyntaxNode, Boolean)

Source:

SyntaxFactory.vb

Determines if two syntax nodes are the same, disregarding trivia differences.

public:
 static bool AreEquivalent(Microsoft::CodeAnalysis::SyntaxNode ^ oldNode, Microsoft::CodeAnalysis::SyntaxNode ^ newNode, bool topLevel);

public static bool AreEquivalent (Microsoft.CodeAnalysis.SyntaxNode oldNode, Microsoft.CodeAnalysis.SyntaxNode newNode, bool topLevel);

static member AreEquivalent : Microsoft.CodeAnalysis.SyntaxNode * Microsoft.CodeAnalysis.SyntaxNode * bool -> bool

Public Shared Function AreEquivalent (oldNode As SyntaxNode, newNode As SyntaxNode, topLevel As Boolean) As Boolean

Parameters

oldNode

SyntaxNode

The old node.

newNode

SyntaxNode

The new node.

topLevel

Boolean

True to ignore any differences of nodes inside bodies of methods, operators, constructors and accessors, and field and auto-property initializers, otherwise all nodes and tokens must be equivalent.

Returns

Boolean

AreEquivalent<TNode>(SeparatedSyntaxList<TNode>, SeparatedSyntaxList<TNode>, Func<SyntaxKind,Boolean>)

Source:

SyntaxFactory.vb

Determines if two lists of syntax nodes are the same, disregarding trivia differences.

public static bool AreEquivalent<TNode> (Microsoft.CodeAnalysis.SeparatedSyntaxList<TNode> oldList, Microsoft.CodeAnalysis.SeparatedSyntaxList<TNode> newList, Func<Microsoft.CodeAnalysis.VisualBasic.SyntaxKind,bool> ignoreChildNode = default) where TNode : Microsoft.CodeAnalysis.SyntaxNode;

static member AreEquivalent : Microsoft.CodeAnalysis.SeparatedSyntaxList<'Node (requires 'Node :> Microsoft.CodeAnalysis.SyntaxNode)> * Microsoft.CodeAnalysis.SeparatedSyntaxList<'Node (requires 'Node :> Microsoft.CodeAnalysis.SyntaxNode)> * Func<Microsoft.CodeAnalysis.VisualBasic.SyntaxKind, bool> -> bool (requires 'Node :> Microsoft.CodeAnalysis.SyntaxNode)

Public Shared Function AreEquivalent(Of TNode As SyntaxNode) (oldList As SeparatedSyntaxList(Of TNode), newList As SeparatedSyntaxList(Of TNode), Optional ignoreChildNode As Func(Of SyntaxKind, Boolean) = Nothing) As Boolean

Type Parameters

TNode

Parameters

oldList

SeparatedSyntaxList<TNode>

The old list.

newList

SeparatedSyntaxList<TNode>

The new list.

ignoreChildNode

Func<SyntaxKind,Boolean>

If specified called for every child syntax node (not token) that is visited during the comparison. It returns true the child is recursively visited, otherwise the child and its subtree is disregarded.

Returns

Boolean

AreEquivalent<TNode>(SyntaxList<TNode>, SyntaxList<TNode>, Func<SyntaxKind,Boolean>)

Source:

SyntaxFactory.vb

Determines if two lists of syntax nodes are the same, disregarding trivia differences.

public static bool AreEquivalent<TNode> (Microsoft.CodeAnalysis.SyntaxList<TNode> oldList, Microsoft.CodeAnalysis.SyntaxList<TNode> newList, Func<Microsoft.CodeAnalysis.VisualBasic.SyntaxKind,bool> ignoreChildNode = default) where TNode : Microsoft.CodeAnalysis.SyntaxNode;

static member AreEquivalent : Microsoft.CodeAnalysis.SyntaxList<'Node (requires 'Node :> Microsoft.CodeAnalysis.SyntaxNode)> * Microsoft.CodeAnalysis.SyntaxList<'Node (requires 'Node :> Microsoft.CodeAnalysis.SyntaxNode)> * Func<Microsoft.CodeAnalysis.VisualBasic.SyntaxKind, bool> -> bool (requires 'Node :> Microsoft.CodeAnalysis.SyntaxNode)

Public Shared Function AreEquivalent(Of TNode As SyntaxNode) (oldList As SyntaxList(Of TNode), newList As SyntaxList(Of TNode), Optional ignoreChildNode As Func(Of SyntaxKind, Boolean) = Nothing) As Boolean

Type Parameters

TNode

Parameters

oldList

SyntaxList<TNode>

The old list.

newList

SyntaxList<TNode>

The new list.

ignoreChildNode

Func<SyntaxKind,Boolean>

If specified called for every child syntax node (not token) that is visited during the comparison. It returns true the child is recursively visited, otherwise the child and its subtree is disregarded.

Returns

Boolean