|
5 | 5 | using System.Collections.Generic;
|
6 | 6 | using System.Collections.Immutable;
|
7 | 7 | using System.Diagnostics.CodeAnalysis;
|
8 |
| -using System.IO; |
9 | 8 | using System.Linq;
|
10 |
| -using System.Text; |
11 | 9 | using System.Threading;
|
12 | 10 | using System.Threading.Tasks;
|
13 |
| -using ICSharpCode.Decompiler.CSharp.Syntax; |
14 | 11 | using Microsoft.AspNetCore.Razor.Language;
|
15 |
| -using Microsoft.AspNetCore.Razor.Language.Components; |
16 |
| -using Microsoft.AspNetCore.Razor.Language.Extensions; |
17 |
| -using Microsoft.AspNetCore.Razor.Language.Intermediate; |
18 |
| -using Microsoft.AspNetCore.Razor.Language.Legacy; |
19 | 12 | using Microsoft.AspNetCore.Razor.Language.Syntax;
|
20 | 13 | using Microsoft.AspNetCore.Razor.LanguageServer.CodeActions.Models;
|
21 |
| -using Microsoft.AspNetCore.Razor.PooledObjects; |
22 | 14 | using Microsoft.AspNetCore.Razor.Threading;
|
23 |
| -using Microsoft.AspNetCore.Razor.Utilities; |
24 |
| -using Microsoft.CodeAnalysis.CSharp.Syntax; |
25 |
| -using Microsoft.CodeAnalysis.Razor; |
26 | 15 | using Microsoft.CodeAnalysis.Razor.Logging;
|
27 |
| -using Microsoft.CodeAnalysis.Razor.Workspaces; |
28 | 16 | using Microsoft.CodeAnalysis.Text;
|
29 | 17 | using Microsoft.VisualStudio.LanguageServer.Protocol;
|
30 | 18 |
|
@@ -74,7 +62,7 @@ public Task<ImmutableArray<RazorVSInternalCodeAction>> ProvideAsync(RazorCodeAct
|
74 | 62 | return SpecializedTasks.EmptyImmutableArray<RazorVSInternalCodeAction>();
|
75 | 63 | }
|
76 | 64 |
|
77 |
| - var actionParams = CreateInitialActionParams(context, startElementNode, @namespace); |
| 65 | + var actionParams = CreateInitialActionParams(context, startElementNode, @namespace); |
78 | 66 |
|
79 | 67 | ProcessSelection(startElementNode, endElementNode, actionParams);
|
80 | 68 |
|
@@ -209,7 +197,7 @@ private static void ProcessSelection(MarkupElementSyntax startElementNode, Marku
|
209 | 197 | // </span>|}|}
|
210 | 198 | // </div>
|
211 | 199 | // In this case, we need to find the smallest set of complete elements that covers the entire selection.
|
212 |
| - |
| 200 | + |
213 | 201 | // Find the closest containing sibling pair that encompasses both the start and end elements
|
214 | 202 | var (extractStart, extractEnd) = FindContainingSiblingPair(startElementNode, endElementNode);
|
215 | 203 |
|
@@ -324,7 +312,7 @@ private static void AddUsingFromTagHelperInfo(TagHelperInfo tagHelperInfo, HashS
|
324 | 312 |
|
325 | 313 | // This is a bit inefficient because at most 'k' string operations are performed (k = parts in the namespace),
|
326 | 314 | // for each potential using directive.
|
327 |
| - |
| 315 | + |
328 | 316 | var parts = typeNamespace.Split('.');
|
329 | 317 | for (var i = 0; i < parts.Length; i++)
|
330 | 318 | {
|
|
0 commit comments