#develop (short for SharpDevelop) is a free IDE for .NET programming languages.
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
 
 
 
 

98 lines
3.5 KiB

//
// SortUsingsAction.cs
//
// Author:
// Lopatkin Ilja
//
// Copyright (c) 2012 Lopatkin Ilja
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
// THE SOFTWARE.
using System;
using System.Collections.Generic;
using System.Linq;
using ICSharpCode.NRefactory.Semantics;
using ICSharpCode.NRefactory.TypeSystem;
using ICSharpCode.NRefactory.TypeSystem.Implementation;
namespace ICSharpCode.NRefactory.CSharp.Refactoring
{
[ContextAction("Sort usings", Description = "Sorts usings by their origin and then alphabetically.")]
public class SortUsingsAction: ICodeActionProvider
{
public IEnumerable<CodeAction> GetActions(RefactoringContext context)
{
var usingNode = FindUsingNodeAtCursor(context);
if (usingNode == null)
yield break;
yield return new CodeAction(context.TranslateString("Sort usings"), script =>
{
var blocks = EnumerateUsingBlocks(context.RootNode);
foreach (var block in blocks)
{
var originalNodes = block.ToArray();
var sortedNodes = UsingHelper.SortUsingBlock(originalNodes, context).ToArray();
for (var i = 0; i < originalNodes.Length; ++i)
script.Replace(originalNodes[i], sortedNodes[i].Clone());
}
}, usingNode);
}
private static AstNode FindUsingNodeAtCursor(RefactoringContext context)
{
// If cursor is inside using declaration
var locationAsIs = context.Location;
// If cursor is at end of line with using declaration
var locationLeft = new TextLocation(locationAsIs.Line, locationAsIs.Column - 1);
var possibleNodes = new[] { locationAsIs, locationLeft }
.Select(_ => context.RootNode.GetNodeAt(_, IsUsingDeclaration));
var usingNode = possibleNodes.Where(_ => _ != null).Distinct().SingleOrDefault();
return usingNode;
}
private static bool IsUsingDeclaration(AstNode node)
{
return node is UsingDeclaration || node is UsingAliasDeclaration;
}
private static IEnumerable<IEnumerable<AstNode>> EnumerateUsingBlocks(AstNode root)
{
var alreadyAddedNodes = new HashSet<AstNode>();
foreach (var child in root.Descendants)
if (IsUsingDeclaration(child) && !alreadyAddedNodes.Contains(child)) {
var blockNodes = EnumerateUsingBlockNodes(child);
alreadyAddedNodes.UnionWith(blockNodes);
yield return blockNodes;
}
}
private static IEnumerable<AstNode> EnumerateUsingBlockNodes(AstNode firstNode)
{
for (var node = firstNode; IsUsingDeclaration(node); node = node.GetNextSibling (n => n.Role != Roles.NewLine))
yield return node;
}
}
}