Microsoft.CodeAnalysis.CSharp.Workspaces
Determine the classification type for a given token.
The token.
The correct syntactic classification for the token.
Worker is an utility class that can classify a list of tokens or a tree within a
requested span The implementation is generic and can produce any kind of classification
artifacts T T is normally either ClassificationSpan or a Tuple (for testing purposes)
and constructed via provided factory.
A strongly-typed resource class, for looking up localized strings, etc.
Returns the cached ResourceManager instance used by this class.
Overrides the current thread's CurrentUICulture property for all
resource lookups using this strongly typed resource class.
Looks up a localized string similar to Cannot retrieve the Span of a null syntax reference..
Looks up a localized string similar to Expected string or char literal.
Looks up a localized string similar to Implement Interface.
Looks up a localized string similar to Namespace can not be added in this destination..
Looks up a localized string similar to No available location found to add statements to..
Looks up a localized string similar to Node does not descend from root..
Looks up a localized string similar to Node not in parent's child list.
Looks up a localized string similar to Only attributes, constructor initializers, expressions or statements can be made explicit.
Looks up a localized string similar to Trivia is not associated with token.
Returns the parameter to which this argument is passed. If
is true, the last parameter will be returned if it is params parameter and the index of
the specified argument is greater than the number of parameters.
Given a syntax token determines a text span delimited by the closest applicable sequence points
encompassing the token.
If the span exists it is possible to place a breakpoint at the given position.
There are a few places where we allow breakpoints on expressions.
1) When the expression is the body of a lambda/method/operator/property/indexer.
2) The expression is a breakable expression inside a query expression.
3) The expression is in a for statement initializer, condition or incrementor.
4) The expression is a foreach initializer.
Adds to if it does not contain an anonymous
type and binds to the same type at the given .
Checks if the SyntaxNode is a name of a namespace declaration. To be a namespace name, the syntax
must be parented by an namespace declaration and the node itself must be equal to the declaration's Name
property.
Returns True if enclosingTypeParametersInsideOut contains a symbol with the same name as the candidateSymbol
thereby saying that there exists a symbol which hides the candidate Symbol
Tells if the Member access is the starting part of a Dynamic Invocation
Return true, if the member access is the starting point of a Dynamic Invocation
Returns the predefined keyword kind for a given specialtype.
The specialtype of this type.
The keyword kind for a given special type, or SyntaxKind.None if the type name is not a predefined type.
Decomposes a name or member access expression into its component parts.
The name or member access expression.
The qualifier (or left-hand-side) of the name expression. This may be null if there is no qualifier.
The name of the expression.
The number of generic type parameters.
Given an argument node, tries to generate an appropriate name that can be used for that
argument.
Given an expression node, tries to generate an appropriate name that can be used for
that expression.
Operator precedence classes from section 7.3.1 of the C# language specification.
Determine if the given array contains the given kind.
Array to search
Sought value
True if contains the value.
PERF: Not using Array.IndexOf here because it results in a call to IndexOf on the
default EqualityComparer for SyntaxKind.The default comparer for SyntaxKind is the
ObjectEqualityComparer which results in boxing allocations.
Returns the list of using directives that affect . The list will be returned in
top down order.
Returns all of the trivia to the left of this token up to the previous token (concatenates
the previous token's trailing trivia and this token's leading trivia).
Returns true if the passed in node contains an interleaved pp directive.
i.e. The following returns false:
void Foo() {
#if true
#endif
}
#if true
void Foo() {
}
#endif
but these return true:
#if true
void Foo() {
#endif
}
void Foo() {
#if true
}
#endif
#if true
void Foo() {
#else
}
#endif
i.e. the method returns true if it contains a PP directive that belongs to a grouping
constructs (like #if/#endif or #region/#endregion), but the grouping construct isn't
entirely contained within the span of the node.
Breaks up the list of provided nodes, based on how they are interspersed with pp
directives, into groups. Within these groups nodes can be moved around safely, without
breaking any pp constructs.
Look inside a trivia list for a skipped token that contains the given position.
Look inside a trivia list for a skipped token that contains the given position.
return only skipped tokens
If the position is inside of token, return that token; otherwise, return the token to the right.
If the position is inside of token, return that token; otherwise, return the token to the left.
Returns child node or token that contains given position.
This is a copy of that also returns the index of the child node.
Determines whether the given SyntaxToken is the first token on a line in the specified SourceText.
Retrieves all trivia after this token, including it's trailing trivia and
the leading trivia of the next token.
Lexically, find the last token that looks like it's part of this generic name.
The "name" of the generic identifier, last token before
the "&"
The last token in the name
This is related to the code in
If the position is inside of token, return that token; otherwise, return the token to the right.
If the position is inside of token, return that token; otherwise, return the token to the left.
Determines whether the specified TypeSyntax is actually 'var'.
Placed in the Zeroth column of the text editor
Placed at one less indent to the current context
Placed at the same indent as the current context
Single Spacing
Ignore Formatting
Remove Spacing
this holds onto changes made by formatting engine.
trivia factory.
it will cache some commonly used trivia to reduce memory footprint and heap allocation
represents a general trivia between two tokens. slightly more expensive than others since it
needs to calculate stuff unlike other cases
Represents a syntax reference that doesn't actually hold onto the
referenced node. Instead, enough data is held onto so that the node
can be recovered and returned if necessary.
Represents a syntax reference that was passed a null
reference to a node. In this case, we just hold onto the
weak tree reference and throw if any invalid properties
are accessed.
Represents a syntax reference that doesn't actually hold onto the
referenced node. Instead, enough data is held onto so that the node
can be recovered and returned if necessary.
Represents a syntax tree that only has a weak reference to its
underlying data. This way it can be passed around without forcing
the underlying full tree to stay alive. Think of it more as a
key that can be used to identify a tree rather than the tree itself.
Gets the top most enclosing statement or CrefSyntax as target to call MakeExplicit on.
It's either the enclosing statement, or if this statement is inside of a lambda expression, the enclosing
statement of this lambda.
The token to get the complexification target for.
Gets the semantic model for the given node.
If the node belongs to the syntax tree of the original semantic model, then returns originalSemanticModel.
Otherwise, returns a speculative model.
The assumption for the later case is that span start position of the given node in it's syntax tree is same as
the span start of the original node in the original syntax tree.
Computes a list of nodes and tokens that need to be reduced in the given syntax root.
this help finding a range of tokens to format based on given ending token
Helper class to analyze the semantic effects of a speculated syntax node replacement on the parenting nodes.
Given an expression node from a syntax tree and a new expression from a different syntax tree,
it replaces the expression with the new expression to create a speculated syntax tree.
It uses the original tree's semantic model to create a speculative semantic model and verifies that
the syntax replacement doesn't break the semantics of any parenting nodes of the original expression.
Creates a semantic analyzer for speculative syntax replacement.
Original expression to be replaced.
New expression to replace the original expression.
Semantic model of node's syntax tree.
Cancellation token.
True if semantic analysis should be skipped for the replaced node and performed starting from parent of the original and replaced nodes.
This could be the case when custom verifications are required to be done by the caller or
semantics of the replaced expression are different from the original expression.
True if semantic analysis should fail when any of the invocation expression ancestors of in original code has overload resolution failures.
Determines whether performing the syntax replacement in one of the sibling nodes of the given lambda expressions will change the lambda binding semantics.
This is done by first determining the lambda parameters whose type differs in the replaced lambda node.
For each of these parameters, we find the descendant identifier name nodes in the lambda body and check if semantics of any of the parenting nodes of these
identifier nodes have changed in the replaced lambda.