@fengwk/kchart 0.0.0-stage → 0.1.1
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/CHANGELOG.md +17 -0
- package/LICENSE +21 -0
- package/NOTICE.md +11 -0
- package/README.md +68 -2
- package/README.zh-CN.md +69 -0
- package/dist/LICENSE +21 -0
- package/dist/NOTICE.md +11 -0
- package/dist/assets/ICONS-LICENSE.txt +53 -0
- package/dist/assets/maps/LICENSE.md +75 -0
- package/dist/assets/maps/METADATA.md +9 -0
- package/dist/assets/maps/REGIONS.md +28 -0
- package/dist/assets/maps/us-states.geojson +1 -0
- package/dist/assets/maps/world.geojson +1 -0
- package/dist/esm/_virtual/_kchart-families.js +48 -0
- package/dist/esm/_virtual/_rolldown/runtime.js +12 -0
- package/dist/esm/assets/icons.js +11 -0
- package/dist/esm/assets/maps/us-states.js +3 -0
- package/dist/esm/assets/maps/world.js +3 -0
- package/dist/esm/assets/themes/claude.js +69 -0
- package/dist/esm/assets/themes/cloudmusic.js +62 -0
- package/dist/esm/assets/themes/kanagawa.js +67 -0
- package/dist/esm/assets/themes/obsidian.js +67 -0
- package/dist/esm/assets/themes/paper.js +61 -0
- package/dist/esm/assets/themes/terminal.js +60 -0
- package/dist/esm/assets/themes/tokyo.js +62 -0
- package/dist/esm/chart/basic.js +1313 -0
- package/dist/esm/chart/catalog.js +476 -0
- package/dist/esm/chart/composition.js +844 -0
- package/dist/esm/chart/context.js +189 -0
- package/dist/esm/chart/distribution.js +442 -0
- package/dist/esm/chart/fields.js +67 -0
- package/dist/esm/chart/maps.js +563 -0
- package/dist/esm/chart/mindmap.js +629 -0
- package/dist/esm/chart/multivariate.js +1229 -0
- package/dist/esm/chart/registry.js +108 -0
- package/dist/esm/chart/relations.js +949 -0
- package/dist/esm/chart/spec.js +1415 -0
- package/dist/esm/chart/stat-compare.js +302 -0
- package/dist/esm/chart/stat-trend.js +181 -0
- package/dist/esm/chart/statistics.js +1007 -0
- package/dist/esm/chart/unit-variants.js +645 -0
- package/dist/esm/chart/variants.js +552 -0
- package/dist/esm/core/color.js +197 -0
- package/dist/esm/core/context.js +256 -0
- package/dist/esm/core/diagnostics.js +23 -0
- package/dist/esm/core/format.js +167 -0
- package/dist/esm/core/geometry.js +130 -0
- package/dist/esm/core/icon-data.js +5 -0
- package/dist/esm/core/icons.js +173 -0
- package/dist/esm/core/scale.js +112 -0
- package/dist/esm/core/scene.js +234 -0
- package/dist/esm/core/svg.js +89 -0
- package/dist/esm/core/text.js +184 -0
- package/dist/esm/core/theme.js +318 -0
- package/dist/esm/diagram/agentflow.js +596 -0
- package/dist/esm/diagram/architecture.js +729 -0
- package/dist/esm/diagram/block.js +988 -0
- package/dist/esm/diagram/blocks.js +687 -0
- package/dist/esm/diagram/c4.js +1002 -0
- package/dist/esm/diagram/class.js +1158 -0
- package/dist/esm/diagram/cynefin.js +749 -0
- package/dist/esm/diagram/emphasis.js +7 -0
- package/dist/esm/diagram/er.js +657 -0
- package/dist/esm/diagram/eventmodeling.js +948 -0
- package/dist/esm/diagram/gantt-date.js +323 -0
- package/dist/esm/diagram/gantt.js +661 -0
- package/dist/esm/diagram/gitgraph.js +472 -0
- package/dist/esm/diagram/graph-layout.js +4046 -0
- package/dist/esm/diagram/graph-parse.js +1366 -0
- package/dist/esm/diagram/graph-route.js +490 -0
- package/dist/esm/diagram/graph.js +553 -0
- package/dist/esm/diagram/ishikawa.js +496 -0
- package/dist/esm/diagram/journey.js +512 -0
- package/dist/esm/diagram/kanban.js +280 -0
- package/dist/esm/diagram/label.js +56 -0
- package/dist/esm/diagram/layers.js +385 -0
- package/dist/esm/diagram/map-label.js +44 -0
- package/dist/esm/diagram/mindmap.js +277 -0
- package/dist/esm/diagram/numeric-composition.js +78 -0
- package/dist/esm/diagram/numeric-model.js +86 -0
- package/dist/esm/diagram/numeric-parse.js +205 -0
- package/dist/esm/diagram/numeric-radar.js +355 -0
- package/dist/esm/diagram/numeric-sankey.js +201 -0
- package/dist/esm/diagram/numeric-xy.js +422 -0
- package/dist/esm/diagram/packet.js +175 -0
- package/dist/esm/diagram/presentation.js +252 -0
- package/dist/esm/diagram/quadrant.js +297 -0
- package/dist/esm/diagram/railroad-parse.js +465 -0
- package/dist/esm/diagram/railroad.js +294 -0
- package/dist/esm/diagram/registry.js +296 -0
- package/dist/esm/diagram/relations.js +966 -0
- package/dist/esm/diagram/requirement.js +341 -0
- package/dist/esm/diagram/sequence.js +1228 -0
- package/dist/esm/diagram/shapes.js +366 -0
- package/dist/esm/diagram/source.js +538 -0
- package/dist/esm/diagram/support.js +153 -0
- package/dist/esm/diagram/swimlane-mermaid.js +140 -0
- package/dist/esm/diagram/swimlane.js +1186 -0
- package/dist/esm/diagram/time.js +748 -0
- package/dist/esm/diagram/timeline.js +376 -0
- package/dist/esm/diagram/tree-family-icon.js +22 -0
- package/dist/esm/diagram/treeview.js +293 -0
- package/dist/esm/diagram/usecase.js +852 -0
- package/dist/esm/diagram/venn.js +1038 -0
- package/dist/esm/diagram/wardley.js +838 -0
- package/dist/esm/index.d.ts +133 -0
- package/dist/esm/index.js +92 -0
- package/dist/esm/interaction.js +561 -0
- package/dist/esm/mermaid.d.ts +28 -0
- package/dist/esm/mermaid.js +70 -0
- package/dist/esm/node.d.ts +68 -0
- package/dist/esm/node.js +373 -0
- package/dist/esm/package.json +1 -0
- package/dist/esm/page-api.js +65 -0
- package/dist/esm/runtime.js +352 -0
- package/dist/esm/src/families.js +209 -0
- package/dist/page-api.js +1 -0
- package/dist/units/chart/basic.js +1 -0
- package/dist/units/chart/catalog.js +1 -0
- package/dist/units/chart/composition.js +1 -0
- package/dist/units/chart/context.js +1 -0
- package/dist/units/chart/distribution.js +1 -0
- package/dist/units/chart/fields.js +1 -0
- package/dist/units/chart/maps.js +1 -0
- package/dist/units/chart/mindmap.js +1 -0
- package/dist/units/chart/multivariate.js +1 -0
- package/dist/units/chart/registry.js +1 -0
- package/dist/units/chart/relations.js +1 -0
- package/dist/units/chart/spec.js +3 -0
- package/dist/units/chart/stat-compare.js +1 -0
- package/dist/units/chart/stat-trend.js +1 -0
- package/dist/units/chart/statistics.js +1 -0
- package/dist/units/chart/unit-variants.js +1 -0
- package/dist/units/chart/variants.js +1 -0
- package/dist/units/core/color.js +1 -0
- package/dist/units/core/context.js +1 -0
- package/dist/units/core/diagnostics.js +1 -0
- package/dist/units/core/format.js +1 -0
- package/dist/units/core/geometry.js +1 -0
- package/dist/units/core/icon-data.js +1 -0
- package/dist/units/core/icons.js +1 -0
- package/dist/units/core/scale.js +1 -0
- package/dist/units/core/scene.js +1 -0
- package/dist/units/core/svg.js +1 -0
- package/dist/units/core/text.js +2 -0
- package/dist/units/core/theme.js +1 -0
- package/dist/units/diagram/agentflow.js +12 -0
- package/dist/units/diagram/architecture.js +4 -0
- package/dist/units/diagram/block.js +2 -0
- package/dist/units/diagram/blocks.js +2 -0
- package/dist/units/diagram/c4.js +6 -0
- package/dist/units/diagram/class.js +5 -0
- package/dist/units/diagram/cynefin.js +4 -0
- package/dist/units/diagram/emphasis.js +1 -0
- package/dist/units/diagram/er.js +9 -0
- package/dist/units/diagram/eventmodeling.js +5 -0
- package/dist/units/diagram/gantt-date.js +1 -0
- package/dist/units/diagram/gantt.js +3 -0
- package/dist/units/diagram/gitgraph.js +2 -0
- package/dist/units/diagram/graph-layout.js +4 -0
- package/dist/units/diagram/graph-parse.js +9 -0
- package/dist/units/diagram/graph-route.js +1 -0
- package/dist/units/diagram/graph.js +1 -0
- package/dist/units/diagram/ishikawa.js +2 -0
- package/dist/units/diagram/journey.js +5 -0
- package/dist/units/diagram/kanban.js +2 -0
- package/dist/units/diagram/label.js +4 -0
- package/dist/units/diagram/layers.js +1 -0
- package/dist/units/diagram/map-label.js +1 -0
- package/dist/units/diagram/mindmap.js +2 -0
- package/dist/units/diagram/numeric-composition.js +1 -0
- package/dist/units/diagram/numeric-model.js +1 -0
- package/dist/units/diagram/numeric-parse.js +2 -0
- package/dist/units/diagram/numeric-radar.js +3 -0
- package/dist/units/diagram/numeric-sankey.js +2 -0
- package/dist/units/diagram/numeric-xy.js +2 -0
- package/dist/units/diagram/packet.js +2 -0
- package/dist/units/diagram/presentation.js +2 -0
- package/dist/units/diagram/quadrant.js +2 -0
- package/dist/units/diagram/railroad-parse.js +4 -0
- package/dist/units/diagram/railroad.js +1 -0
- package/dist/units/diagram/registry.js +2 -0
- package/dist/units/diagram/relations.js +3 -0
- package/dist/units/diagram/requirement.js +3 -0
- package/dist/units/diagram/sequence.js +2 -0
- package/dist/units/diagram/shapes.js +60 -0
- package/dist/units/diagram/source.js +20 -0
- package/dist/units/diagram/support.js +3 -0
- package/dist/units/diagram/swimlane-mermaid.js +3 -0
- package/dist/units/diagram/swimlane.js +2 -0
- package/dist/units/diagram/time.js +3 -0
- package/dist/units/diagram/timeline.js +2 -0
- package/dist/units/diagram/tree-family-icon.js +1 -0
- package/dist/units/diagram/treeview.js +2 -0
- package/dist/units/diagram/usecase.js +3 -0
- package/dist/units/diagram/venn.js +2 -0
- package/dist/units/diagram/wardley.js +4 -0
- package/dist/units/interaction.js +1 -0
- package/dist/units/runtime.js +1 -0
- package/dist/units.json +712 -0
- package/package.json +30 -4
|
@@ -0,0 +1,490 @@
|
|
|
1
|
+
import { __exportAll } from "../_virtual/_rolldown/runtime.js";
|
|
2
|
+
import { flowOutlineName, outlinePort, shapeGlyphBox, shapeOutline } from "./shapes.js";
|
|
3
|
+
// src/diagram/graph-route.js
|
|
4
|
+
var graph_route_exports = /* @__PURE__ */ __exportAll({
|
|
5
|
+
TRACK_CLEAR: () => 8,
|
|
6
|
+
TRACK_GAP: () => 12,
|
|
7
|
+
placeGraphLabels: () => placeGraphLabels,
|
|
8
|
+
repairRoutes: () => repairRoutes
|
|
9
|
+
});
|
|
10
|
+
var TRACK_GAP = 12;
|
|
11
|
+
var TRACK_CLEAR = 8;
|
|
12
|
+
var EDGE_CLEAR = 4;
|
|
13
|
+
var sides = [
|
|
14
|
+
"top",
|
|
15
|
+
"right",
|
|
16
|
+
"bottom",
|
|
17
|
+
"left"
|
|
18
|
+
];
|
|
19
|
+
var vertical = (side) => side === "top" || side === "bottom";
|
|
20
|
+
var distance = (a, b) => Math.abs(a.x - b.x) + Math.abs(a.y - b.y);
|
|
21
|
+
var expand = ({ x, y, w, h }, d) => ({
|
|
22
|
+
x: x - d,
|
|
23
|
+
y: y - d,
|
|
24
|
+
w: w + d * 2,
|
|
25
|
+
h: h + d * 2
|
|
26
|
+
});
|
|
27
|
+
var overlaps = (a, b) => a.x < b.x + b.w && b.x < a.x + a.w && a.y < b.y + b.h && b.y < a.y + a.h;
|
|
28
|
+
function hits(a, b, rect) {
|
|
29
|
+
let lo = 0, hi = 1;
|
|
30
|
+
const dx = b.x - a.x;
|
|
31
|
+
if (Math.abs(dx) < 1e-8) {
|
|
32
|
+
if (a.x <= rect.x || a.x >= rect.x + rect.w) return false;
|
|
33
|
+
} else {
|
|
34
|
+
const p = (rect.x - a.x) / dx, q = (rect.x + rect.w - a.x) / dx;
|
|
35
|
+
lo = Math.max(lo, Math.min(p, q));
|
|
36
|
+
hi = Math.min(hi, Math.max(p, q));
|
|
37
|
+
if (lo >= hi) return false;
|
|
38
|
+
}
|
|
39
|
+
const dy = b.y - a.y;
|
|
40
|
+
if (Math.abs(dy) < 1e-8) {
|
|
41
|
+
if (a.y <= rect.y || a.y >= rect.y + rect.h) return false;
|
|
42
|
+
} else {
|
|
43
|
+
const p = (rect.y - a.y) / dy, q = (rect.y + rect.h - a.y) / dy;
|
|
44
|
+
lo = Math.max(lo, Math.min(p, q));
|
|
45
|
+
hi = Math.min(hi, Math.max(p, q));
|
|
46
|
+
if (lo >= hi) return false;
|
|
47
|
+
}
|
|
48
|
+
return lo < hi;
|
|
49
|
+
}
|
|
50
|
+
function attachment(node, side, type, offset = 0) {
|
|
51
|
+
const v = vertical(side), sign = side === "top" || side === "left" ? -1 : 1;
|
|
52
|
+
const shape = !node.frame && (type === "flowchart" ? flowOutlineName(node.shape) : node.kind === "choice" ? "diam" : node.kind === "start" || node.kind === "end" ? "circle" : node.kind === "state" ? "rounded" : node.kind === "note" ? "note" : null);
|
|
53
|
+
const plain = v ? {
|
|
54
|
+
x: node.w / 2,
|
|
55
|
+
y: sign < 0 ? 0 : node.h
|
|
56
|
+
} : {
|
|
57
|
+
x: sign < 0 ? 0 : node.w,
|
|
58
|
+
y: node.h / 2
|
|
59
|
+
};
|
|
60
|
+
if (v) plain.x += node.w * offset;
|
|
61
|
+
else plain.y += node.h * offset;
|
|
62
|
+
const local = shape ? outlinePort(shapeOutline(shape, node.w, node.h, node.direction), side, v ? plain.x : plain.y) : plain;
|
|
63
|
+
const port = {
|
|
64
|
+
x: node.x + local.x,
|
|
65
|
+
y: node.y + local.y
|
|
66
|
+
};
|
|
67
|
+
return {
|
|
68
|
+
port,
|
|
69
|
+
stub: v ? {
|
|
70
|
+
x: port.x,
|
|
71
|
+
y: node.y + (sign < 0 ? -10 : node.h + 10)
|
|
72
|
+
} : {
|
|
73
|
+
x: node.x + (sign < 0 ? -10 : node.w + 10),
|
|
74
|
+
y: port.y
|
|
75
|
+
}
|
|
76
|
+
};
|
|
77
|
+
}
|
|
78
|
+
function straight(a, b) {
|
|
79
|
+
return {
|
|
80
|
+
p0: a,
|
|
81
|
+
c1: a,
|
|
82
|
+
c2: b,
|
|
83
|
+
p1: b
|
|
84
|
+
};
|
|
85
|
+
}
|
|
86
|
+
function sharesRun(a, b, p, q, gap = 1, span = 4) {
|
|
87
|
+
const same = (a, b) => Math.abs(a - b) < .01;
|
|
88
|
+
const axis = same(a.x, b.x) && same(p.x, q.x) && Math.abs(a.x - p.x) < gap - .001 ? "y" : same(a.y, b.y) && same(p.y, q.y) && Math.abs(a.y - p.y) < gap - .001 ? "x" : null;
|
|
89
|
+
return axis && Math.min(Math.max(a[axis], b[axis]), Math.max(p[axis], q[axis])) - Math.max(Math.min(a[axis], b[axis]), Math.min(p[axis], q[axis])) > span;
|
|
90
|
+
}
|
|
91
|
+
function crosses(a, b) {
|
|
92
|
+
const side = (p, q, r) => (q.x - p.x) * (r.y - p.y) - (q.y - p.y) * (r.x - p.x);
|
|
93
|
+
return side(a.p0, a.p1, b.p0) * side(a.p0, a.p1, b.p1) < -1e-6 && side(b.p0, b.p1, a.p0) * side(b.p0, b.p1, a.p1) < -1e-6;
|
|
94
|
+
}
|
|
95
|
+
function shortest(from, to, obstacles, occupied, type, bounds, label, original, back, frameSides, arrivals, clearOf = [], lanes = {
|
|
96
|
+
x: [],
|
|
97
|
+
y: []
|
|
98
|
+
}) {
|
|
99
|
+
let best = null, score = Infinity;
|
|
100
|
+
const fixed = {};
|
|
101
|
+
for (const [key, span] of [["x", "w"], ["y", "h"]]) {
|
|
102
|
+
const frameTracks = frameSides.filter(({ p0, p1 }) => p0[key] === p1[key]).flatMap(({ p0 }) => [p0[key] - 8, p0[key] + 8]);
|
|
103
|
+
const tracks = back ? occupied.filter(({ p0, p1 }) => Math.abs(p0[key] - p1[key]) < .01).flatMap(({ p0 }) => [p0[key] - 12, p0[key] + 12]) : [];
|
|
104
|
+
fixed[key] = [.../* @__PURE__ */ new Set([
|
|
105
|
+
6,
|
|
106
|
+
bounds[span] - 6,
|
|
107
|
+
...tracks,
|
|
108
|
+
...frameTracks,
|
|
109
|
+
...obstacles.flatMap((r) => [r[key] - 1, r[key] + r[span] + 1])
|
|
110
|
+
])].filter((x) => x >= 4 && x <= bounds[span] - 4);
|
|
111
|
+
}
|
|
112
|
+
const sorted = /* @__PURE__ */ new Map();
|
|
113
|
+
const candidates = (a, b, key, span) => {
|
|
114
|
+
const midpoint = (a[key] + b[key]) / 2;
|
|
115
|
+
if (!sorted.has(key + midpoint)) {
|
|
116
|
+
const coords = midpoint >= 4 && midpoint <= bounds[span] - 4 && !fixed[key].includes(midpoint) ? [midpoint, ...fixed[key]] : fixed[key].slice();
|
|
117
|
+
sorted.set(key + midpoint, coords.sort((x, y) => Math.abs(x - midpoint) - Math.abs(y - midpoint) || x - y).slice(0, 28));
|
|
118
|
+
}
|
|
119
|
+
return sorted.get(key + midpoint);
|
|
120
|
+
};
|
|
121
|
+
const clear = (a, b) => !obstacles.some((r) => hits(a, b, r));
|
|
122
|
+
const fromBox = expand(from, 4), toBox = expand(to, 4);
|
|
123
|
+
const search = (source, target, startOffset, endOffset, detour) => {
|
|
124
|
+
const { port: fromPort, stub: a } = attachment(from, source, type, startOffset);
|
|
125
|
+
const { port: toPort, stub: b } = attachment(to, target, type, endOffset);
|
|
126
|
+
if (!clear(fromPort, a) || !clear(b, toPort)) return;
|
|
127
|
+
if (arrivals.some((edge) => distance(edge.end, toPort) < 8)) return;
|
|
128
|
+
if (distance(fromPort, a) + distance(a, b) + distance(b, toPort) >= score) return;
|
|
129
|
+
const validate = (mids) => {
|
|
130
|
+
const points = [
|
|
131
|
+
fromPort,
|
|
132
|
+
a,
|
|
133
|
+
...mids,
|
|
134
|
+
b,
|
|
135
|
+
toPort
|
|
136
|
+
].filter((p, i, all) => !i || distance(p, all[i - 1]) > .001);
|
|
137
|
+
let length = 0;
|
|
138
|
+
for (let i = 1; i < points.length; i++) {
|
|
139
|
+
const prev = points[i - 2], a = points[i - 1], b = points[i];
|
|
140
|
+
if (prev && (prev.x === a.x && a.x === b.x || prev.y === a.y && a.y === b.y) && distance(prev, a) + distance(a, b) > distance(prev, b) + .001) return;
|
|
141
|
+
length += distance(a, b);
|
|
142
|
+
}
|
|
143
|
+
const compact = points.filter((p, i) => !i || i === points.length - 1 || Math.abs(distance(points[i - 1], p) + distance(p, points[i + 1]) - distance(points[i - 1], points[i + 1])) > .001 || points[i - 1].x !== points[i + 1].x && points[i - 1].y !== points[i + 1].y);
|
|
144
|
+
const cost = length + (compact.length - 2) * 16;
|
|
145
|
+
if (cost >= score) return;
|
|
146
|
+
for (let i = 2; i < points.length - 1; i++) {
|
|
147
|
+
if (hits(points[i - 1], points[i], fromBox) || hits(points[i - 1], points[i], toBox)) return;
|
|
148
|
+
if (!clear(points[i - 1], points[i])) return;
|
|
149
|
+
}
|
|
150
|
+
const segments = compact.slice(1).map((p, i) => straight(compact[i], p));
|
|
151
|
+
if (segments.some(({ p0, p1 }) => occupied.some((seg) => sharesRun(p0, p1, seg.p0, seg.p1, back ? 12 : 1, back ? 8 : 4)) || clearOf.some((seg) => sharesRun(p0, p1, seg.p0, seg.p1, EDGE_CLEAR, 4)) || frameSides.some((seg) => sharesRun(p0, p1, seg.p0, seg.p1, 8, 12)) || arrivals.some((edge) => edge.segments.some((seg) => crosses({
|
|
152
|
+
p0,
|
|
153
|
+
p1
|
|
154
|
+
}, seg) || sharesRun(p0, p1, seg.p0, seg.p1, 8, 8))))) return;
|
|
155
|
+
let labelRect = label;
|
|
156
|
+
if (label) {
|
|
157
|
+
const box = (p) => ({
|
|
158
|
+
...label,
|
|
159
|
+
x: p.x - label.w / 2,
|
|
160
|
+
y: p.y - label.h / 2
|
|
161
|
+
});
|
|
162
|
+
const allowed = (box) => ![
|
|
163
|
+
from,
|
|
164
|
+
to,
|
|
165
|
+
...obstacles
|
|
166
|
+
].some((r) => overlaps(box, r));
|
|
167
|
+
const legs = compact.slice(1).map((p, i) => [compact[i], p]).sort(([p, q], [r, s]) => distance(r, s) - distance(p, q));
|
|
168
|
+
labelRect = null;
|
|
169
|
+
for (const [p, q] of legs) {
|
|
170
|
+
for (const f of [
|
|
171
|
+
.5,
|
|
172
|
+
.35,
|
|
173
|
+
.65
|
|
174
|
+
]) {
|
|
175
|
+
const candidate = box({
|
|
176
|
+
x: p.x + (q.x - p.x) * f,
|
|
177
|
+
y: p.y + (q.y - p.y) * f
|
|
178
|
+
});
|
|
179
|
+
if (allowed(candidate)) {
|
|
180
|
+
labelRect = candidate;
|
|
181
|
+
break;
|
|
182
|
+
}
|
|
183
|
+
}
|
|
184
|
+
if (labelRect) break;
|
|
185
|
+
}
|
|
186
|
+
if (!labelRect && original && allowed(label)) labelRect = label;
|
|
187
|
+
if (!labelRect) return;
|
|
188
|
+
}
|
|
189
|
+
best = {
|
|
190
|
+
start: fromPort,
|
|
191
|
+
end: toPort,
|
|
192
|
+
labelRect,
|
|
193
|
+
segments
|
|
194
|
+
};
|
|
195
|
+
score = cost;
|
|
196
|
+
};
|
|
197
|
+
if (a.x === b.x || a.y === b.y) validate([]);
|
|
198
|
+
validate([{
|
|
199
|
+
x: a.x,
|
|
200
|
+
y: b.y
|
|
201
|
+
}]);
|
|
202
|
+
validate([{
|
|
203
|
+
x: b.x,
|
|
204
|
+
y: a.y
|
|
205
|
+
}]);
|
|
206
|
+
const ends = distance(fromPort, a) + distance(b, toPort) - .01;
|
|
207
|
+
const xs = candidates(a, b, "x", "w"), ys = candidates(a, b, "y", "h");
|
|
208
|
+
for (const x of xs) if (ends + Math.abs(a.x - x) + Math.abs(a.y - b.y) + Math.abs(x - b.x) < score) validate([{
|
|
209
|
+
x,
|
|
210
|
+
y: a.y
|
|
211
|
+
}, {
|
|
212
|
+
x,
|
|
213
|
+
y: b.y
|
|
214
|
+
}]);
|
|
215
|
+
for (const y of ys) if (ends + Math.abs(a.y - y) + Math.abs(a.x - b.x) + Math.abs(y - b.y) < score) validate([{
|
|
216
|
+
x: a.x,
|
|
217
|
+
y
|
|
218
|
+
}, {
|
|
219
|
+
x: b.x,
|
|
220
|
+
y
|
|
221
|
+
}]);
|
|
222
|
+
if (detour && !best) {
|
|
223
|
+
const near = (p, key, span) => candidates(p, p, key, span).slice(0, 7);
|
|
224
|
+
const aX = near(a, "x", "w"), bX = near(b, "x", "w");
|
|
225
|
+
const aY = near(a, "y", "h"), bY = near(b, "y", "h");
|
|
226
|
+
const gapTracks = (list, key, span) => [.../* @__PURE__ */ new Set([...lanes[key].filter((v) => v >= 4 && v <= bounds[span] - 4), ...list.slice(0, 8)])];
|
|
227
|
+
for (const y of gapTracks(ys, "y", "h")) for (const x1 of aX) for (const x2 of bX) {
|
|
228
|
+
if (ends + Math.abs(a.x - x1) + Math.abs(a.y - y) + Math.abs(x1 - x2) + Math.abs(y - b.y) + Math.abs(x2 - b.x) >= score) continue;
|
|
229
|
+
validate([
|
|
230
|
+
{
|
|
231
|
+
x: x1,
|
|
232
|
+
y: a.y
|
|
233
|
+
},
|
|
234
|
+
{
|
|
235
|
+
x: x1,
|
|
236
|
+
y
|
|
237
|
+
},
|
|
238
|
+
{
|
|
239
|
+
x: x2,
|
|
240
|
+
y
|
|
241
|
+
},
|
|
242
|
+
{
|
|
243
|
+
x: x2,
|
|
244
|
+
y: b.y
|
|
245
|
+
}
|
|
246
|
+
]);
|
|
247
|
+
}
|
|
248
|
+
for (const x of gapTracks(xs, "x", "w")) for (const y1 of aY) for (const y2 of bY) {
|
|
249
|
+
if (ends + Math.abs(a.y - y1) + Math.abs(a.x - x) + Math.abs(y1 - y2) + Math.abs(x - b.x) + Math.abs(y2 - b.y) >= score) continue;
|
|
250
|
+
validate([
|
|
251
|
+
{
|
|
252
|
+
x: a.x,
|
|
253
|
+
y: y1
|
|
254
|
+
},
|
|
255
|
+
{
|
|
256
|
+
x,
|
|
257
|
+
y: y1
|
|
258
|
+
},
|
|
259
|
+
{
|
|
260
|
+
x,
|
|
261
|
+
y: y2
|
|
262
|
+
},
|
|
263
|
+
{
|
|
264
|
+
x: b.x,
|
|
265
|
+
y: y2
|
|
266
|
+
}
|
|
267
|
+
]);
|
|
268
|
+
}
|
|
269
|
+
}
|
|
270
|
+
};
|
|
271
|
+
for (const source of sides) for (const target of sides) search(source, target, 0, 0, false);
|
|
272
|
+
for (const offset of [
|
|
273
|
+
-.2,
|
|
274
|
+
.2,
|
|
275
|
+
-.35,
|
|
276
|
+
.35
|
|
277
|
+
]) {
|
|
278
|
+
if (best) break;
|
|
279
|
+
for (const source of sides) for (const target of sides) for (const [u, v] of [
|
|
280
|
+
[offset, 0],
|
|
281
|
+
[0, offset],
|
|
282
|
+
[offset, offset]
|
|
283
|
+
]) search(source, target, u, v, false);
|
|
284
|
+
}
|
|
285
|
+
for (const offset of [
|
|
286
|
+
0,
|
|
287
|
+
-.2,
|
|
288
|
+
.2
|
|
289
|
+
]) {
|
|
290
|
+
if (best) break;
|
|
291
|
+
for (const source of sides) for (const target of sides) search(source, target, offset, offset, true);
|
|
292
|
+
}
|
|
293
|
+
return best;
|
|
294
|
+
}
|
|
295
|
+
var curvePoint = ({ p0, c1, c2, p1 }, t) => {
|
|
296
|
+
const u = 1 - t, at = (k) => u ** 3 * p0[k] + 3 * u * u * t * c1[k] + 3 * u * t * t * c2[k] + t ** 3 * p1[k];
|
|
297
|
+
return {
|
|
298
|
+
x: at("x"),
|
|
299
|
+
y: at("y")
|
|
300
|
+
};
|
|
301
|
+
};
|
|
302
|
+
function borders({ x, y, w, h }) {
|
|
303
|
+
const a = {
|
|
304
|
+
x,
|
|
305
|
+
y
|
|
306
|
+
}, b = {
|
|
307
|
+
x: x + w,
|
|
308
|
+
y
|
|
309
|
+
}, c = {
|
|
310
|
+
x: x + w,
|
|
311
|
+
y: y + h
|
|
312
|
+
}, d = {
|
|
313
|
+
x,
|
|
314
|
+
y: y + h
|
|
315
|
+
};
|
|
316
|
+
return [
|
|
317
|
+
straight(a, b),
|
|
318
|
+
straight(b, c),
|
|
319
|
+
straight(c, d),
|
|
320
|
+
straight(d, a)
|
|
321
|
+
];
|
|
322
|
+
}
|
|
323
|
+
function repairRoutes(geometry, redirects = /* @__PURE__ */ new Map()) {
|
|
324
|
+
const nodes = new Map(geometry.nodes.map((node) => [node.id, node]));
|
|
325
|
+
const frames = new Map(geometry.frames.map((frame) => [frame.id, {
|
|
326
|
+
...frame,
|
|
327
|
+
frame: true
|
|
328
|
+
}]));
|
|
329
|
+
const endpoint = (id) => nodes.get(id) ?? frames.get(id);
|
|
330
|
+
const ancestors = (node) => {
|
|
331
|
+
const result = /* @__PURE__ */ new Set([node.id]);
|
|
332
|
+
for (let id = node.parent; id; id = frames.get(id)?.parent) result.add(id);
|
|
333
|
+
return result;
|
|
334
|
+
};
|
|
335
|
+
const checkTracks = nodes.size > 30;
|
|
336
|
+
const pending = new Set(redirects.keys());
|
|
337
|
+
const settled = [];
|
|
338
|
+
const direction = geometry.direction;
|
|
339
|
+
const coordinate = (p) => direction === "LR" ? p.x : direction === "RL" ? -p.x : direction === "BT" ? -p.y : p.y;
|
|
340
|
+
const back = (e) => e.reversed || e.start && e.end && coordinate(e.start) > coordinate(e.end) + 1;
|
|
341
|
+
const ordered = [...geometry.edges].sort((a, b) => Number(!!back(a)) - Number(!!back(b)));
|
|
342
|
+
const frameSides = [...frames.values()].flatMap(borders);
|
|
343
|
+
const nodeBorders = new Map([...nodes.values()].map((node) => [node.id, borders(node)]));
|
|
344
|
+
for (const edge of ordered) {
|
|
345
|
+
if (edge.style === "invisible" || edge.self || !edge.segments?.length) continue;
|
|
346
|
+
const redirect = redirects.get(edge.id);
|
|
347
|
+
const from = endpoint(redirect?.from ?? edge.from), to = endpoint(redirect?.to ?? edge.to);
|
|
348
|
+
if (!from || !to || from === to) continue;
|
|
349
|
+
const exempt = /* @__PURE__ */ new Set([...ancestors(from), ...ancestors(to)]);
|
|
350
|
+
const boxes = [...nodes.values(), ...frames.values()].filter((box) => !exempt.has(box.id));
|
|
351
|
+
const isBack = !!back(edge);
|
|
352
|
+
const obstacles = boxes.map((box) => expand(box, box.frame ? 5 : 8));
|
|
353
|
+
const titles = [...frames.values()].flatMap((f) => f.titleRect && f.titleRect.w && f.titleRect.h ? [expand(f.titleRect, 5)] : []);
|
|
354
|
+
const tight = [...boxes.map((r) => expand(r, 1.5)), ...titles];
|
|
355
|
+
const occupiedOf = () => geometry.edges.filter((other) => other !== edge && other.style !== "invisible" && !pending.has(other.id)).flatMap((other) => other.segments);
|
|
356
|
+
const occupied = isBack ? occupiedOf() : null;
|
|
357
|
+
const arrivals = to.kind === "end" ? geometry.edges.filter((other) => other !== edge && other.to === to.id && other.end && (distance(other.start, other.end) > distance(edge.start, edge.end) || distance(other.start, other.end) === distance(edge.start, edge.end) && other.id < edge.id)) : [];
|
|
358
|
+
const hugs = (seg, box) => nodeBorders.get(box.id)?.some((side) => sharesRun(seg.p0, seg.p1, side.p0, side.p1, 8, 8));
|
|
359
|
+
let collision = !!redirect || edge.segments.some((seg) => boxes.some((box) => !box.frame && hugs(seg, box)) || occupied?.some((other) => sharesRun(seg.p0, seg.p1, other.p0, other.p1, 12, 8)) || frameSides.some((side) => sharesRun(seg.p0, seg.p1, side.p0, side.p1, 8, 12)) || arrivals.some((other) => other.segments.some((run) => crosses(seg, run) || sharesRun(seg.p0, seg.p1, run.p0, run.p1, 8, 8))));
|
|
360
|
+
if (!collision) for (const seg of edge.segments) {
|
|
361
|
+
let prev = seg.p0;
|
|
362
|
+
for (let i = 1; i <= 5; i++) {
|
|
363
|
+
const next = curvePoint(seg, i / 5);
|
|
364
|
+
if (tight.some((r) => hits(prev, next, r))) {
|
|
365
|
+
collision = true;
|
|
366
|
+
break;
|
|
367
|
+
}
|
|
368
|
+
prev = next;
|
|
369
|
+
}
|
|
370
|
+
if (collision) break;
|
|
371
|
+
}
|
|
372
|
+
if (!collision && checkTracks) {
|
|
373
|
+
const avoid = [
|
|
374
|
+
...borders(from),
|
|
375
|
+
...borders(to),
|
|
376
|
+
...settled
|
|
377
|
+
];
|
|
378
|
+
collision = edge.segments.some((seg) => avoid.some((other) => sharesRun(seg.p0, seg.p1, other.p0, other.p1)));
|
|
379
|
+
}
|
|
380
|
+
if (!collision) {
|
|
381
|
+
if (checkTracks) settled.push(...edge.segments);
|
|
382
|
+
continue;
|
|
383
|
+
}
|
|
384
|
+
const labelObstacles = geometry.edges.filter((other) => other !== edge && other.labelRect).map((other) => expand(other.labelRect, 2));
|
|
385
|
+
const forwardRuns = isBack ? [] : geometry.edges.filter((other) => other !== edge && other.style !== "invisible" && !pending.has(other.id) && !back(other)).flatMap((other) => other.segments);
|
|
386
|
+
const lanes = {
|
|
387
|
+
x: [],
|
|
388
|
+
y: []
|
|
389
|
+
};
|
|
390
|
+
for (const { p0, p1 } of edge.segments) {
|
|
391
|
+
if (Math.abs(p0.x - p1.x) < .01) lanes.x.push(p0.x);
|
|
392
|
+
if (Math.abs(p0.y - p1.y) < .01) lanes.y.push(p0.y);
|
|
393
|
+
}
|
|
394
|
+
const route = (clearOf) => shortest(from, to, [
|
|
395
|
+
...obstacles,
|
|
396
|
+
...titles,
|
|
397
|
+
...labelObstacles
|
|
398
|
+
], occupied ?? occupiedOf(), geometry.type, {
|
|
399
|
+
w: geometry.width,
|
|
400
|
+
h: geometry.height
|
|
401
|
+
}, edge.labelRect, !redirect, isBack, frameSides, arrivals, clearOf, lanes);
|
|
402
|
+
const replacement = forwardRuns.length && route(forwardRuns) || route([]);
|
|
403
|
+
if (replacement) {
|
|
404
|
+
pending.delete(edge.id);
|
|
405
|
+
Object.assign(edge, replacement, {
|
|
406
|
+
from: from.id,
|
|
407
|
+
to: to.id,
|
|
408
|
+
fromFrame: from.frame === true,
|
|
409
|
+
toFrame: to.frame === true
|
|
410
|
+
});
|
|
411
|
+
}
|
|
412
|
+
if (checkTracks) settled.push(...edge.segments);
|
|
413
|
+
}
|
|
414
|
+
return geometry;
|
|
415
|
+
}
|
|
416
|
+
function placeGraphLabels(geometry, measure) {
|
|
417
|
+
const { nodes, frames, edges, width, height } = geometry;
|
|
418
|
+
const titles = frames.map((f) => f.titleRect).filter((r) => r?.w && r.h);
|
|
419
|
+
const paths = edges.map((edge) => edge.style === "invisible" ? [] : edge.segments.flatMap((seg) => {
|
|
420
|
+
if (["x", "y"].some((key) => [
|
|
421
|
+
seg.c1,
|
|
422
|
+
seg.c2,
|
|
423
|
+
seg.p1
|
|
424
|
+
].every((p) => Math.abs(p[key] - seg.p0[key]) < 1e-8))) return [seg];
|
|
425
|
+
return Array.from({ length: 12 }, (_, i) => straight(curvePoint(seg, i / 12), curvePoint(seg, (i + 1) / 12)));
|
|
426
|
+
}));
|
|
427
|
+
const pathHits = (path, box) => path.some((seg) => hits(seg.p0, seg.p1, box));
|
|
428
|
+
const fits = (box) => box.x >= 0 && box.y >= 0 && box.x + box.w <= width && box.y + box.h <= height;
|
|
429
|
+
edges.forEach((edge, index) => {
|
|
430
|
+
const r = edge.labelRect;
|
|
431
|
+
if (!r || !paths[index].length) return;
|
|
432
|
+
const center = {
|
|
433
|
+
x: r.x + r.w / 2,
|
|
434
|
+
y: r.y + r.h / 2
|
|
435
|
+
};
|
|
436
|
+
const blockers = [
|
|
437
|
+
...nodes,
|
|
438
|
+
...titles,
|
|
439
|
+
...edges.flatMap((e) => e !== edge && e.labelRect ? [e.labelRect] : [])
|
|
440
|
+
];
|
|
441
|
+
let best = null, score = Infinity;
|
|
442
|
+
for (const { p0, p1 } of paths[index]) {
|
|
443
|
+
const dx = p1.x - p0.x, dy = p1.y - p0.y;
|
|
444
|
+
const len = Math.hypot(dx, dy);
|
|
445
|
+
if (!len) continue;
|
|
446
|
+
const t = Math.min(1, Math.max(0, ((center.x - p0.x) * dx + (center.y - p0.y) * dy) / (len * len)));
|
|
447
|
+
const steps = Math.min(128, Math.ceil(len / 5));
|
|
448
|
+
for (const at of [t, ...Array.from({ length: steps }, (_, i) => (i + .5) / steps)]) {
|
|
449
|
+
const p = {
|
|
450
|
+
x: p0.x + dx * at,
|
|
451
|
+
y: p0.y + dy * at
|
|
452
|
+
};
|
|
453
|
+
const cost = Math.hypot(p.x - center.x, p.y - center.y);
|
|
454
|
+
if (cost >= score) continue;
|
|
455
|
+
const box = {
|
|
456
|
+
...r,
|
|
457
|
+
x: p.x - r.w / 2,
|
|
458
|
+
y: p.y - r.h / 2
|
|
459
|
+
};
|
|
460
|
+
if (!fits(box) || blockers.some((b) => overlaps(box, b)) || paths.some((path, j) => j !== index && pathHits(path, box))) continue;
|
|
461
|
+
best = box;
|
|
462
|
+
score = cost;
|
|
463
|
+
}
|
|
464
|
+
}
|
|
465
|
+
if (best) {
|
|
466
|
+
edge.labelRect = best;
|
|
467
|
+
const label = geometry.labels.find((label) => label.edge === edge.id);
|
|
468
|
+
if (label) Object.assign(label, best);
|
|
469
|
+
}
|
|
470
|
+
});
|
|
471
|
+
if (geometry.type !== "flowchart") return;
|
|
472
|
+
for (const n of nodes) {
|
|
473
|
+
const glyph = shapeGlyphBox(flowOutlineName(n.shape), n.w, n.h, n.direction);
|
|
474
|
+
if (!glyph || !n.lines.length) continue;
|
|
475
|
+
const w = Math.max(...n.lines.map((value) => measure(value, {
|
|
476
|
+
size: 14,
|
|
477
|
+
weight: 600
|
|
478
|
+
})));
|
|
479
|
+
const h = n.lines.length * 19;
|
|
480
|
+
const rect = (x) => ({
|
|
481
|
+
x,
|
|
482
|
+
y: n.y + (n.h - h) / 2,
|
|
483
|
+
w,
|
|
484
|
+
h
|
|
485
|
+
});
|
|
486
|
+
const blocked = (box) => !fits(box) || paths.some((path) => pathHits(path, expand(box, 2))) || nodes.some((other) => other !== n && overlaps(box, other)) || edges.some((e) => e.labelRect && overlaps(box, e.labelRect));
|
|
487
|
+
n.glyphLabelLeft = blocked(rect(n.x + glyph.x + glyph.w + 8)) && !blocked(rect(n.x + glyph.x - 8 - w));
|
|
488
|
+
}
|
|
489
|
+
}
|
|
490
|
+
export { TRACK_CLEAR, TRACK_GAP, graph_route_exports, placeGraphLabels, repairRoutes };
|