2021-04-29 05:05:55 -07:00
|
|
|
|
using System;
|
|
|
|
|
using System.Collections.Generic;
|
|
|
|
|
using System.Linq;
|
|
|
|
|
using System.Windows;
|
|
|
|
|
using System.Windows.Media;
|
|
|
|
|
|
|
|
|
|
namespace SourceGit.Views.Controls {
|
|
|
|
|
|
|
|
|
|
/// <summary>
|
|
|
|
|
/// 提交线路图
|
|
|
|
|
/// </summary>
|
|
|
|
|
public class CommitGraph : FrameworkElement {
|
2021-05-17 20:02:13 -07:00
|
|
|
|
public static readonly Pen[] PENS = new Pen[] {
|
|
|
|
|
new Pen(Brushes.Orange, 2),
|
|
|
|
|
new Pen(Brushes.ForestGreen, 2),
|
|
|
|
|
new Pen(Brushes.Gold, 2),
|
|
|
|
|
new Pen(Brushes.Magenta, 2),
|
|
|
|
|
new Pen(Brushes.Red, 2),
|
|
|
|
|
new Pen(Brushes.Gray, 2),
|
|
|
|
|
new Pen(Brushes.Turquoise, 2),
|
|
|
|
|
new Pen(Brushes.Olive, 2),
|
2021-04-29 05:05:55 -07:00
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
public static readonly double UNIT_WIDTH = 12;
|
|
|
|
|
public static readonly double HALF_WIDTH = 6;
|
|
|
|
|
public static readonly double UNIT_HEIGHT = 24;
|
|
|
|
|
public static readonly double HALF_HEIGHT = 12;
|
|
|
|
|
|
|
|
|
|
public class Line {
|
|
|
|
|
public List<Point> Points = new List<Point>();
|
|
|
|
|
public int Color = 0;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
public class LineHelper {
|
|
|
|
|
public string Next;
|
|
|
|
|
public bool IsMerged;
|
|
|
|
|
public double LastX;
|
|
|
|
|
public double LastY;
|
|
|
|
|
public Line Line;
|
|
|
|
|
|
|
|
|
|
public LineHelper(string next, bool isMerged, int color, Point start) {
|
|
|
|
|
Next = next;
|
|
|
|
|
IsMerged = isMerged;
|
|
|
|
|
LastX = start.X;
|
|
|
|
|
LastY = start.Y;
|
|
|
|
|
|
|
|
|
|
Line = new Line();
|
2021-05-17 20:02:13 -07:00
|
|
|
|
Line.Color = color % PENS.Length;
|
2021-04-29 05:05:55 -07:00
|
|
|
|
Line.Points.Add(start);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
public void Add(double x, double y, bool isEnd = false) {
|
|
|
|
|
if (x > LastX) {
|
|
|
|
|
Line.Points.Add(new Point(LastX, LastY));
|
|
|
|
|
Line.Points.Add(new Point(x, y - HALF_HEIGHT));
|
|
|
|
|
} else if (x < LastX) {
|
|
|
|
|
Line.Points.Add(new Point(LastX, LastY + HALF_HEIGHT));
|
|
|
|
|
Line.Points.Add(new Point(x, y));
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
LastX = x;
|
|
|
|
|
LastY = y;
|
|
|
|
|
|
|
|
|
|
if (isEnd) {
|
|
|
|
|
var last = Line.Points.Last();
|
|
|
|
|
if (LastX != last.X || LastY != last.Y) Line.Points.Add(new Point(LastX, LastY));
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
public class Link {
|
|
|
|
|
public Point Start;
|
|
|
|
|
public Point Control;
|
|
|
|
|
public Point End;
|
|
|
|
|
public int Color;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
public class Dot {
|
|
|
|
|
public Point Center;
|
|
|
|
|
public int Color;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
public class Data {
|
|
|
|
|
public List<Line> Lines = new List<Line>();
|
|
|
|
|
public List<Link> Links = new List<Link>();
|
|
|
|
|
public List<Dot> Dots = new List<Dot>();
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
private Data data = null;
|
|
|
|
|
private double startY = 0;
|
|
|
|
|
|
|
|
|
|
public CommitGraph() {
|
|
|
|
|
IsHitTestVisible = false;
|
|
|
|
|
ClipToBounds = true;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
public void SetOffset(double offset) {
|
|
|
|
|
startY = offset;
|
|
|
|
|
InvalidateVisual();
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
public void SetData(List<Models.Commit> commits, bool isSearchResult = false) {
|
|
|
|
|
if (isSearchResult) {
|
|
|
|
|
foreach (var c in commits) c.Margin = new Thickness(0);
|
|
|
|
|
data = null;
|
|
|
|
|
return;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
var temp = new Data();
|
|
|
|
|
var unsolved = new List<LineHelper>();
|
|
|
|
|
var mapUnsolved = new Dictionary<string, LineHelper>();
|
|
|
|
|
var ended = new List<LineHelper>();
|
|
|
|
|
var offsetY = -HALF_HEIGHT;
|
|
|
|
|
var colorIdx = 0;
|
|
|
|
|
|
|
|
|
|
foreach (var commit in commits) {
|
|
|
|
|
var major = null as LineHelper;
|
|
|
|
|
var isMerged = commit.IsMerged;
|
|
|
|
|
var oldCount = unsolved.Count;
|
|
|
|
|
|
|
|
|
|
// 更新Y坐标
|
|
|
|
|
offsetY += UNIT_HEIGHT;
|
|
|
|
|
|
|
|
|
|
// 找到第一个依赖于本提交的树,将其他依赖于本提交的树标记为终止,并对已存在的线路调整(防止线重合)
|
|
|
|
|
double offsetX = -HALF_WIDTH;
|
|
|
|
|
foreach (var l in unsolved) {
|
|
|
|
|
if (l.Next == commit.SHA) {
|
|
|
|
|
if (major == null) {
|
|
|
|
|
offsetX += UNIT_WIDTH;
|
|
|
|
|
major = l;
|
|
|
|
|
|
|
|
|
|
if (commit.Parents.Count > 0) {
|
|
|
|
|
major.Next = commit.Parents[0];
|
|
|
|
|
if (!mapUnsolved.ContainsKey(major.Next)) mapUnsolved.Add(major.Next, major);
|
|
|
|
|
} else {
|
|
|
|
|
major.Next = "ENDED";
|
|
|
|
|
ended.Add(l);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
major.Add(offsetX, offsetY);
|
|
|
|
|
} else {
|
|
|
|
|
ended.Add(l);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
isMerged = isMerged || l.IsMerged;
|
|
|
|
|
} else {
|
|
|
|
|
if (!mapUnsolved.ContainsKey(l.Next)) mapUnsolved.Add(l.Next, l);
|
|
|
|
|
offsetX += UNIT_WIDTH;
|
|
|
|
|
l.Add(offsetX, offsetY);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// 处理本提交为非当前分支HEAD的情况(创建新依赖线路)
|
|
|
|
|
if (major == null && commit.Parents.Count > 0) {
|
|
|
|
|
offsetX += UNIT_WIDTH;
|
|
|
|
|
major = new LineHelper(commit.Parents[0], isMerged, colorIdx, new Point(offsetX, offsetY));
|
|
|
|
|
unsolved.Add(major);
|
|
|
|
|
colorIdx++;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// 确定本提交的点的位置
|
|
|
|
|
Point position = new Point(offsetX, offsetY);
|
|
|
|
|
if (major != null) {
|
|
|
|
|
major.IsMerged = isMerged;
|
|
|
|
|
position.X = major.LastX;
|
|
|
|
|
position.Y = offsetY;
|
|
|
|
|
temp.Dots.Add(new Dot() { Center = position, Color = major.Line.Color });
|
|
|
|
|
} else {
|
|
|
|
|
temp.Dots.Add(new Dot() { Center = position, Color = 0 });
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// 处理本提交的其他依赖
|
|
|
|
|
for (int j = 1; j < commit.Parents.Count; j++) {
|
|
|
|
|
var parent = commit.Parents[j];
|
|
|
|
|
if (mapUnsolved.ContainsKey(parent)) {
|
|
|
|
|
var l = mapUnsolved[parent];
|
|
|
|
|
var link = new Link();
|
|
|
|
|
|
|
|
|
|
link.Start = position;
|
|
|
|
|
link.End = new Point(l.LastX, offsetY + HALF_HEIGHT);
|
|
|
|
|
link.Control = new Point(link.End.X, link.Start.Y);
|
|
|
|
|
link.Color = l.Line.Color;
|
|
|
|
|
temp.Links.Add(link);
|
|
|
|
|
} else {
|
|
|
|
|
offsetX += UNIT_WIDTH;
|
|
|
|
|
unsolved.Add(new LineHelper(commit.Parents[j], isMerged, colorIdx, position));
|
|
|
|
|
colorIdx++;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// 处理已终止的线
|
|
|
|
|
foreach (var l in ended) {
|
|
|
|
|
l.Add(position.X, position.Y, true);
|
|
|
|
|
temp.Lines.Add(l.Line);
|
|
|
|
|
unsolved.Remove(l);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// 加入本次提交
|
|
|
|
|
commit.IsMerged = isMerged;
|
|
|
|
|
commit.Margin = new Thickness(Math.Max(offsetX + HALF_WIDTH, oldCount * UNIT_WIDTH), 0, 0, 0);
|
|
|
|
|
|
|
|
|
|
// 清理
|
|
|
|
|
ended.Clear();
|
|
|
|
|
mapUnsolved.Clear();
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// 处理尚未终结的线
|
|
|
|
|
for (int i = 0; i < unsolved.Count; i++) {
|
|
|
|
|
var path = unsolved[i];
|
|
|
|
|
var endY = (commits.Count - 0.5) * UNIT_HEIGHT;
|
|
|
|
|
|
|
|
|
|
if (path.Line.Points.Count == 1 && path.Line.Points[0].Y == endY) continue;
|
|
|
|
|
|
|
|
|
|
path.Add((i + 0.5) * UNIT_WIDTH, endY, true);
|
|
|
|
|
temp.Lines.Add(path.Line);
|
|
|
|
|
}
|
|
|
|
|
unsolved.Clear();
|
|
|
|
|
|
|
|
|
|
// 排序
|
|
|
|
|
temp.Lines.Sort((l, h) => l.Points[0].Y.CompareTo(h.Points[0].Y));
|
|
|
|
|
|
|
|
|
|
Dispatcher.Invoke(() => {
|
|
|
|
|
data = temp;
|
|
|
|
|
InvalidateVisual();
|
|
|
|
|
});
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
protected override void OnRender(DrawingContext dc) {
|
|
|
|
|
if (data == null) return;
|
|
|
|
|
|
|
|
|
|
var top = startY;
|
|
|
|
|
var bottom = startY + ActualHeight;
|
|
|
|
|
|
|
|
|
|
dc.PushTransform(new TranslateTransform(0, -startY));
|
|
|
|
|
|
|
|
|
|
// 绘制曲线
|
|
|
|
|
foreach (var line in data.Lines) {
|
|
|
|
|
var last = line.Points[0];
|
|
|
|
|
var size = line.Points.Count;
|
|
|
|
|
|
|
|
|
|
if (line.Points[size - 1].Y < top) continue;
|
|
|
|
|
if (last.Y > bottom) continue;
|
|
|
|
|
|
|
|
|
|
var geo = new StreamGeometry();
|
2021-05-17 20:02:13 -07:00
|
|
|
|
var pen = PENS[line.Color];
|
2021-04-29 05:05:55 -07:00
|
|
|
|
using (var ctx = geo.Open()) {
|
|
|
|
|
ctx.BeginFigure(last, false, false);
|
|
|
|
|
|
|
|
|
|
var ended = false;
|
|
|
|
|
for (int i = 1; i < size; i++) {
|
|
|
|
|
var cur = line.Points[i];
|
|
|
|
|
if (cur.Y > bottom) {
|
|
|
|
|
cur.Y = bottom;
|
|
|
|
|
ended = true;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (cur.X > last.X) {
|
|
|
|
|
ctx.QuadraticBezierTo(new Point(cur.X, last.Y), cur, true, false);
|
|
|
|
|
} else if (cur.X < last.X) {
|
|
|
|
|
if (i < size - 1) {
|
|
|
|
|
cur.Y += HALF_HEIGHT;
|
|
|
|
|
|
|
|
|
|
var midY = (last.Y + cur.Y) / 2;
|
|
|
|
|
var midX = (last.X + cur.X) / 2;
|
|
|
|
|
ctx.PolyQuadraticBezierTo(new Point[] {
|
|
|
|
|
new Point(last.X, midY),
|
|
|
|
|
new Point(midX, midY),
|
|
|
|
|
new Point(cur.X, midY),
|
|
|
|
|
cur}, true, false);
|
|
|
|
|
} else {
|
|
|
|
|
ctx.QuadraticBezierTo(new Point(last.X, cur.Y), cur, true, false);
|
|
|
|
|
}
|
2021-05-18 06:31:09 -07:00
|
|
|
|
} else if (cur.Y != last.Y) {
|
2021-04-29 05:05:55 -07:00
|
|
|
|
ctx.LineTo(cur, true, false);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (ended) break;
|
|
|
|
|
last = cur;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
geo.Freeze();
|
|
|
|
|
dc.DrawGeometry(null, pen, geo);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// 绘制合并线
|
|
|
|
|
foreach (var link in data.Links) {
|
|
|
|
|
if (link.End.Y < top) continue;
|
|
|
|
|
if (link.Start.Y > bottom) break;
|
|
|
|
|
|
|
|
|
|
var geo = new StreamGeometry();
|
|
|
|
|
using (var ctx = geo.Open()) {
|
|
|
|
|
ctx.BeginFigure(link.Start, false, false);
|
|
|
|
|
ctx.QuadraticBezierTo(link.Control, link.End, true, false);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
geo.Freeze();
|
2021-05-17 20:02:13 -07:00
|
|
|
|
dc.DrawGeometry(null, PENS[link.Color], geo);
|
2021-04-29 05:05:55 -07:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
// 绘制点
|
2021-05-17 20:02:13 -07:00
|
|
|
|
var dotFill = FindResource("Brush.Contents") as Brush;
|
2021-04-29 05:05:55 -07:00
|
|
|
|
foreach (var dot in data.Dots) {
|
|
|
|
|
if (dot.Center.Y < top) continue;
|
|
|
|
|
if (dot.Center.Y > bottom) break;
|
|
|
|
|
|
2021-05-17 20:02:13 -07:00
|
|
|
|
dc.DrawEllipse(dotFill, PENS[dot.Color], dot.Center, 3, 3);
|
2021-04-29 05:05:55 -07:00
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|