Diff
checker
文本
文本
圖像
文檔
Excel
文件夾
Legal
Enterprise
桌面版
定價
登入
下載 Diffchecker 桌面版
比較文本
尋找兩個文字檔案之間的差異
工具
歷史
即時編輯器
隱藏空白變更
摺疊未變更行
關閉換行
檢視
拆分
統一
比對精度
智能
單詞
字符
文字樣式
變更外觀
語法突出顯示
選擇語法
忽略
文字轉換
前往第一個差異
編輯輸入
Diffchecker Desktop
執行Diffchecker最安全的方式。取得Diffchecker桌面應用程式:您的差異永遠不會離開您的電腦!
取得桌面版
autocomplete vs manual
建立於
去年
差異永不過期
清除
匯出
分享
解釋
13 刪除
行
總計
刪除
字符
總計
刪除
要繼續使用此功能,請升級到
Diff
checker
Pro
查看價格
39 行
全部複製
63 新增
行
總計
新增
字符
總計
新增
要繼續使用此功能,請升級到
Diff
checker
Pro
查看價格
87 行
全部複製
複製
已複製
複製
已複製
internal static List<GraphLayout.Graph> DoGraphAutoLayout
(this WorkspaceModel workspace
)
/// <summary>
/// This function wraps a few methods on the workspace model layer
/// to set up and run the graph layout algorithm.
/// </summary>
/// <param name="workspace">Workspace on which graph layout will be performed.</param>
/// <param name="originalNodeGUID"></param>
/// <param name="newNodes"></param>
/// <param name="misplacedNodes"></param>
/// <param name="portType"></param>
internal static List<GraphLayout.Graph> DoGraphAutoLayout
Autocomplete
(this WorkspaceModel workspace
,
Guid originalNodeGUID,
IEnumerable<NodeModel> newNodes,
IEnumerable<NodeModel> misplacedNodes, PortType portType)
{
{
if (workspace.Nodes.Count() < 2) return null;
if (workspace.Nodes.Count() < 2) return null;
複製
已複製
複製
已複製
var selection = DynamoSelection.Instance.Selection;
const bool isGroupLayout = false;
// Check if all the selected models are groups
bool isGroupLayout = selection.Count > 0 &&
selection.All(x => x is AnnotationModel ||
selection.OfType<AnnotationModel>().Any(g => g.Nodes.Contains(x)));
List<GraphLayout.Graph> layoutSubgraphs;
List<GraphLayout.Graph> layoutSubgraphs;
List<List<GraphLayout.Node>> subgraphClusters;
List<List<GraphLayout.Node>> subgraphClusters;
GenerateCombinedGraph(workspace, isGroupLayout, out layoutSubgraphs, out subgraphClusters);
GenerateCombinedGraph(workspace, isGroupLayout, out layoutSubgraphs, out subgraphClusters);
複製
已複製
複製
已複製
//only record graph layout undo when it is not node autocomplete
var misplacedGuidSet = misplacedNodes.Select(x => x.GUID).ToHashSet();
RecordUndoGraphLayout(workspace, isGroupLayout, false);
foreach (var node in layoutSubgraphs.First().Nodes)
{
//this is a virtual IsSelected - it doesnt change the workspace node models but marks it as touchable to the algorithm
node.IsSelected = node.Id == originalNodeGUID || misplacedGuidSet.Contains(node.Id);
}
// Generate subgraphs separately for each cluster
// Generate subgraphs separately for each cluster
subgraphClusters.ForEach(
subgraphClusters.ForEach(
x => GenerateSeparateSubgraphs(new HashSet<GraphLayout.Node>(x), layoutSubgraphs));
x => GenerateSeparateSubgraphs(new HashSet<GraphLayout.Node>(x), layoutSubgraphs));
// Deselect all nodes
// Deselect all nodes
subgraphClusters.ForEach(c => c.ForEach(x => x.IsSelected = false));
subgraphClusters.ForEach(c => c.ForEach(x => x.IsSelected = false));
var activeComponents = layoutSubgraphs.Skip(1).ToList();
var activeComponents = layoutSubgraphs.Skip(1).ToList();
複製
已複製
複製
已複製
var targetSubgraph = activeComponents.FirstOrDefault(x => x.Nodes.Any(x => x.Id == originalNodeGUID));
var targetNode = targetSubgraph.Nodes.First(x => x.Id == originalNodeGUID);
// Run layout algorithm for each subgraph
// Run layout algorithm for each subgraph
activeComponents.ForEach(g => RunLayoutSubgraph(g, isGroupLayout));
activeComponents.ForEach(g => RunLayoutSubgraph(g, isGroupLayout));
複製
已複製
複製
已複製
AvoidSubgraphOverlap(layoutSubgraphs);
//original node shouldn't move: move others around
var diffX = targetNode.X - targetNode.InitialX;
var diffY = targetNode.Y - targetNode.InitialY;
foreach (var relatedNode in targetSubgraph.Nodes)
{
relatedNode.X -= diffX;
relatedNode.Y -= diffY;
}
複製
已複製
複製
已複製
SaveLayoutGraph(workspace, layoutSubgraphs);
if (portType == PortType.Output)
{
double minX = double.MaxValue;
foreach (var relatedNode in targetSubgraph.Nodes)
{
if (newNodes.Any(x => x.GUID == relatedNode.Id))
{
minX = Math.Min(minX, relatedNode.X);
}
}
double targetMinX = targetNode.X + targetNode.Width + GraphLayout.Graph.HorizontalNodeDistance;
var displacement = minX == double.MaxValue ? 0 : targetMinX - minX;
複製
已複製
複製
已複製
// Restore the workspace model selection information
foreach (var relatedNode in targetSubgraph.Nodes)
selection.ToList().ForEach(x => x.Select());
{
if (newNodes.Any(x => x.GUID == relatedNode.Id))
{
relatedNode.X += displacement;
}
}
}
// right now cluster nodes only work on outputs, single nodes dont need to be relayouted as above
AvoidSubgraphOverlap(layoutSubgraphs, originalNodeGUID);
var maybeUpdateSet = workspace.Nodes.Any(x => x.IsTransient) ?
workspace.Nodes.Where(x => x.GUID == originalNodeGUID || misplacedGuidSet.Contains(x.GUID)) :
workspace.Nodes;
SaveLayoutGraphForNodeAutoComplete(workspace, maybeUpdateSet.ToList(), layoutSubgraphs, originalNodeGUID);
return layoutSubgraphs;
return layoutSubgraphs;
}
}
已保存差異
原始文本
開啟檔案
internal static List<GraphLayout.Graph> DoGraphAutoLayout(this WorkspaceModel workspace) { if (workspace.Nodes.Count() < 2) return null; var selection = DynamoSelection.Instance.Selection; // Check if all the selected models are groups bool isGroupLayout = selection.Count > 0 && selection.All(x => x is AnnotationModel || selection.OfType<AnnotationModel>().Any(g => g.Nodes.Contains(x))); List<GraphLayout.Graph> layoutSubgraphs; List<List<GraphLayout.Node>> subgraphClusters; GenerateCombinedGraph(workspace, isGroupLayout, out layoutSubgraphs, out subgraphClusters); //only record graph layout undo when it is not node autocomplete RecordUndoGraphLayout(workspace, isGroupLayout, false); // Generate subgraphs separately for each cluster subgraphClusters.ForEach( x => GenerateSeparateSubgraphs(new HashSet<GraphLayout.Node>(x), layoutSubgraphs)); // Deselect all nodes subgraphClusters.ForEach(c => c.ForEach(x => x.IsSelected = false)); var activeComponents = layoutSubgraphs.Skip(1).ToList(); // Run layout algorithm for each subgraph activeComponents.ForEach(g => RunLayoutSubgraph(g, isGroupLayout)); AvoidSubgraphOverlap(layoutSubgraphs); SaveLayoutGraph(workspace, layoutSubgraphs); // Restore the workspace model selection information selection.ToList().ForEach(x => x.Select()); return layoutSubgraphs; }
更改後文本
開啟檔案
/// <summary> /// This function wraps a few methods on the workspace model layer /// to set up and run the graph layout algorithm. /// </summary> /// <param name="workspace">Workspace on which graph layout will be performed.</param> /// <param name="originalNodeGUID"></param> /// <param name="newNodes"></param> /// <param name="misplacedNodes"></param> /// <param name="portType"></param> internal static List<GraphLayout.Graph> DoGraphAutoLayoutAutocomplete(this WorkspaceModel workspace, Guid originalNodeGUID, IEnumerable<NodeModel> newNodes, IEnumerable<NodeModel> misplacedNodes, PortType portType) { if (workspace.Nodes.Count() < 2) return null; const bool isGroupLayout = false; List<GraphLayout.Graph> layoutSubgraphs; List<List<GraphLayout.Node>> subgraphClusters; GenerateCombinedGraph(workspace, isGroupLayout, out layoutSubgraphs, out subgraphClusters); var misplacedGuidSet = misplacedNodes.Select(x => x.GUID).ToHashSet(); foreach (var node in layoutSubgraphs.First().Nodes) { //this is a virtual IsSelected - it doesnt change the workspace node models but marks it as touchable to the algorithm node.IsSelected = node.Id == originalNodeGUID || misplacedGuidSet.Contains(node.Id); } // Generate subgraphs separately for each cluster subgraphClusters.ForEach( x => GenerateSeparateSubgraphs(new HashSet<GraphLayout.Node>(x), layoutSubgraphs)); // Deselect all nodes subgraphClusters.ForEach(c => c.ForEach(x => x.IsSelected = false)); var activeComponents = layoutSubgraphs.Skip(1).ToList(); var targetSubgraph = activeComponents.FirstOrDefault(x => x.Nodes.Any(x => x.Id == originalNodeGUID)); var targetNode = targetSubgraph.Nodes.First(x => x.Id == originalNodeGUID); // Run layout algorithm for each subgraph activeComponents.ForEach(g => RunLayoutSubgraph(g, isGroupLayout)); //original node shouldn't move: move others around var diffX = targetNode.X - targetNode.InitialX; var diffY = targetNode.Y - targetNode.InitialY; foreach (var relatedNode in targetSubgraph.Nodes) { relatedNode.X -= diffX; relatedNode.Y -= diffY; } if (portType == PortType.Output) { double minX = double.MaxValue; foreach (var relatedNode in targetSubgraph.Nodes) { if (newNodes.Any(x => x.GUID == relatedNode.Id)) { minX = Math.Min(minX, relatedNode.X); } } double targetMinX = targetNode.X + targetNode.Width + GraphLayout.Graph.HorizontalNodeDistance; var displacement = minX == double.MaxValue ? 0 : targetMinX - minX; foreach (var relatedNode in targetSubgraph.Nodes) { if (newNodes.Any(x => x.GUID == relatedNode.Id)) { relatedNode.X += displacement; } } } // right now cluster nodes only work on outputs, single nodes dont need to be relayouted as above AvoidSubgraphOverlap(layoutSubgraphs, originalNodeGUID); var maybeUpdateSet = workspace.Nodes.Any(x => x.IsTransient) ? workspace.Nodes.Where(x => x.GUID == originalNodeGUID || misplacedGuidSet.Contains(x.GUID)) : workspace.Nodes; SaveLayoutGraphForNodeAutoComplete(workspace, maybeUpdateSet.ToList(), layoutSubgraphs, originalNodeGUID); return layoutSubgraphs; }
尋找差異