61 lines
2.9 KiB
TypeScript
61 lines
2.9 KiB
TypeScript
import { CanvasNodeType, type CanvasNodeData, type Position } from "@/types/canvas";
|
|
|
|
type Size = {
|
|
width: number;
|
|
height: number;
|
|
};
|
|
|
|
const BATCH_CHILD_OFFSET_X = 120;
|
|
const BATCH_CHILD_GAP = 36;
|
|
const NODE_CLEARANCE = 36;
|
|
|
|
export function canGenerateImageInPlace(sourceNode: CanvasNodeData | undefined) {
|
|
return sourceNode?.type === CanvasNodeType.Image && !sourceNode.metadata?.content;
|
|
}
|
|
|
|
export function imageGenerationGroupSize(rootSize: Size, imageSize: Size, childCount: number): Size {
|
|
if (childCount <= 0) return rootSize;
|
|
const columns = Math.min(childCount, 2);
|
|
const rows = Math.ceil(childCount / 2);
|
|
return {
|
|
width: rootSize.width + BATCH_CHILD_OFFSET_X + columns * imageSize.width + (columns - 1) * BATCH_CHILD_GAP,
|
|
height: Math.max(rootSize.height, rows * imageSize.height + (rows - 1) * BATCH_CHILD_GAP),
|
|
};
|
|
}
|
|
|
|
export function imageGenerationChildPosition(rootPosition: Position, rootWidth: number, imageSize: Size, index: number): Position {
|
|
return {
|
|
x: rootPosition.x + rootWidth + BATCH_CHILD_OFFSET_X + (index % 2) * (imageSize.width + BATCH_CHILD_GAP),
|
|
y: rootPosition.y + Math.floor(index / 2) * (imageSize.height + BATCH_CHILD_GAP),
|
|
};
|
|
}
|
|
|
|
export function findAvailableGenerationGroupPosition(nodes: CanvasNodeData[], preferred: Position, groupSize: Size): Position {
|
|
const down = resolveCollisions(nodes, preferred, groupSize, "down");
|
|
const right = resolveCollisions(nodes, preferred, groupSize, "right");
|
|
const downDistance = down.y - preferred.y;
|
|
const rightDistance = right.x - preferred.x;
|
|
return downDistance <= rightDistance ? down : right;
|
|
}
|
|
|
|
// 分别沿下方和右侧求出最近空位，再选择移动距离更短的方向，避免生成组覆盖已有节点。
|
|
function resolveCollisions(nodes: CanvasNodeData[], preferred: Position, groupSize: Size, direction: "down" | "right"): Position {
|
|
const candidate = { ...preferred };
|
|
for (let attempt = 0; attempt <= nodes.length; attempt += 1) {
|
|
const collisions = nodes.filter((node) => rectanglesOverlap(candidate, groupSize, node.position, node));
|
|
if (!collisions.length) return candidate;
|
|
if (direction === "down") candidate.y = Math.max(...collisions.map((node) => node.position.y + node.height + NODE_CLEARANCE));
|
|
else candidate.x = Math.max(...collisions.map((node) => node.position.x + node.width + NODE_CLEARANCE));
|
|
}
|
|
return candidate;
|
|
}
|
|
|
|
function rectanglesOverlap(firstPosition: Position, firstSize: Size, secondPosition: Position, secondSize: Size) {
|
|
return !(
|
|
firstPosition.x + firstSize.width + NODE_CLEARANCE <= secondPosition.x ||
|
|
firstPosition.x >= secondPosition.x + secondSize.width + NODE_CLEARANCE ||
|
|
firstPosition.y + firstSize.height + NODE_CLEARANCE <= secondPosition.y ||
|
|
firstPosition.y >= secondPosition.y + secondSize.height + NODE_CLEARANCE
|
|
);
|
|
}
|