using System;
using System.Collections.Generic;
using System.ComponentModel;
using System.Linq;
using Avalonia;
using NewLife.XCoder.Tools.Folder;
namespace XCoder.App.Tests;
/// <summary>树图布局测试</summary>
public class TreemapLayoutTests
{
[Fact]
[DisplayName("面积与权重成正比且铺满容器")]
public void Arrange_Proportional()
{
var items = new[]
{
new TreemapItem("a", 1),
new TreemapItem("b", 2),
new TreemapItem("c", 3),
};
var tiles = TreemapLayout.Arrange(items, new Rect(0, 0, 600, 400), gap: 0, minRatio: 0, maxTiles: 100);
Assert.Equal(3, tiles.Count);
Assert.Equal(240000, tiles.Sum(e => e.Bounds.Width * e.Bounds.Height), 6);
foreach (var tile in tiles)
{
var expected = tile.Weight / 6 * 240000;
Assert.Equal(expected, tile.Bounds.Width * tile.Bounds.Height, 6);
}
}
[Fact]
[DisplayName("方块互不重叠")]
public void Arrange_NoOverlap()
{
var items = Enumerable.Range(0, 20).Select(e => new TreemapItem("k" + e, e + 1)).ToList();
var tiles = TreemapLayout.Arrange(items, new Rect(0, 0, 800, 500), gap: 0, minRatio: 0, maxTiles: 100);
for (var i = 0; i < tiles.Count; i++)
{
for (var j = i + 1; j < tiles.Count; j++)
{
var overlap = tiles[i].Bounds.Intersect(tiles[j].Bounds);
var area = Math.Max(0, overlap.Width) * Math.Max(0, overlap.Height);
Assert.True(area < 1e-6, $"{tiles[i].Key} 与 {tiles[j].Key} 重叠 {area}");
}
}
}
[Fact]
[DisplayName("过小项目聚合为“其他”")]
public void Arrange_AggregatesSmallItems()
{
var items = new List<TreemapItem> { new("big", 1000) };
for (var i = 0; i < 200; i++)
{
items.Add(new TreemapItem("small" + i, 1));
}
var tiles = TreemapLayout.Arrange(items, new Rect(0, 0, 400, 400), gap: 0, minRatio: 0.01, maxTiles: 100);
Assert.Equal(2, tiles.Count);
var other = tiles.Single(e => e.IsOther);
Assert.Equal(200, other.Count);
Assert.Equal(200, other.Weight);
}
[Fact]
[DisplayName("全部低于占比阈值时仍保留前若干个方块")]
public void Arrange_AllSmall_KeepsTopItems()
{
var items = Enumerable.Range(0, 200).Select(e => new TreemapItem("k" + e, 1)).ToList();
var tiles = TreemapLayout.Arrange(items, new Rect(0, 0, 400, 400), gap: 0, minRatio: 0.01, maxTiles: 10);
Assert.Equal(11, tiles.Count);
var other = tiles.Single(e => e.IsOther);
Assert.Equal(190, other.Count);
}
[Fact]
[DisplayName("方块数量受 maxTiles 限制")]
public void Arrange_MaxTiles()
{
var items = Enumerable.Range(0, 200).Select(e => new TreemapItem("k" + e, 1)).ToList();
var tiles = TreemapLayout.Arrange(items, new Rect(0, 0, 400, 400), gap: 0, minRatio: 0, maxTiles: 10);
Assert.Equal(11, tiles.Count);
Assert.Single(tiles.Where(e => e.IsOther));
Assert.Equal(190, tiles.Single(e => e.IsOther).Count);
}
[Fact]
[DisplayName("单项铺满容器")]
public void Arrange_SingleItem()
{
var tiles = TreemapLayout.Arrange([new TreemapItem("only", 42)], new Rect(10, 20, 300, 200), gap: 0);
var tile = Assert.Single(tiles);
Assert.Equal(10, tile.Bounds.X, 6);
Assert.Equal(20, tile.Bounds.Y, 6);
Assert.Equal(300, tile.Bounds.Width, 6);
Assert.Equal(200, tile.Bounds.Height, 6);
}
[Fact]
[DisplayName("空集合、零权重与过小容器返回空")]
public void Arrange_Degenerate_ReturnsEmpty()
{
Assert.Empty(TreemapLayout.Arrange([], new Rect(0, 0, 100, 100)));
Assert.Empty(TreemapLayout.Arrange([new TreemapItem("a", 0)], new Rect(0, 0, 100, 100)));
Assert.Empty(TreemapLayout.Arrange([new TreemapItem("a", -1)], new Rect(0, 0, 100, 100)));
Assert.Empty(TreemapLayout.Arrange([new TreemapItem("a", 1)], new Rect(0, 0, 1, 1)));
}
}
|