import 'dart:math' as math; import 'package:flutter_test/flutter_test.dart'; import 'package:pipelines_app/features/graph/domain/graph_definition.dart'; import 'package:pipelines_app/features/graph/layout/layout_models.dart'; import 'package:pipelines_app/features/graph/layout/linear_graph_layout.dart'; import 'package:pipelines_app/features/graph/layout/linear_label_placement.dart'; import 'package:pipelines_app/features/graph/routing/route_models.dart'; GraphNodeBox _node(String key, double x, double y, double w, double h) => GraphNodeBox( key: key, terminal: false, stageIndex: 0, rank: 0, x: x, y: y, width: w, height: h, ); EdgeRoute _route(int id, String label, List<(double, double)> points) { final route = [for (final (x, y) in points) RoutePoint(x, y)]; return EdgeRoute( id: id, source: 'a', outcome: label, target: 'b', label: label, fallback: false, kind: RouteKind.forward, straight: route.length == 2, sourcePort: RoutePort(side: RoutePortSide.right, point: route.first), targetPort: RoutePort(side: RoutePortSide.left, point: route.last), points: route, ); } /// The gap between two boxes, 0 when they touch or overlap. double _gap(EdgeLabelBox label, double x, double y, double w, double h) { final dx = math.max(0.0, math.max(x - label.right, label.x - (x + w))); final dy = math.max(0.0, math.max(y - label.bottom, label.y - (y + h))); return math.max(dx, dy); } void _expectClear(List labels, List nodes) { for (final label in labels) { for (final node in nodes) { expect( _gap(label, node.x, node.y, node.width, node.height), greaterThanOrEqualTo(edgeLabelClearance), reason: 'label ${label.edgeId} is within clearance of ${node.key}', ); } for (final other in labels) { if (identical(other, label)) continue; expect( _gap(label, other.x, other.y, other.width, other.height), greaterThanOrEqualTo(edgeLabelClearance), reason: 'labels ${label.edgeId} and ${other.edgeId} collide', ); } } } /// The distance from a label box to the nearest point of its own route. double _distanceToRoute(EdgeLabelBox label, EdgeRoute route) { var best = double.infinity; for (var i = 1; i < route.points.length; i++) { final a = route.points[i - 1], b = route.points[i]; best = math.min( best, _gap( label, math.min(a.x, b.x), math.min(a.y, b.y), (a.x - b.x).abs(), (a.y - b.y).abs(), ), ); } return best; } void main() { test('a node just above the wire pushes the label below it', () { final nodes = [_node('crowd', 60, 20, 80, 28)]; final route = _route(1, 'success', [(0, 50), (200, 50)]); final placement = placeLinearLabels( routes: [route], extents: {1: LabelExtent(width: 50, height: 16)}, nodes: nodes, labelGap: 3, ); expect(placement.misfits, isEmpty); final label = placement.labels.single; _expectClear(placement.labels, nodes); expect(_distanceToRoute(label, route), lessThanOrEqualTo(3)); }); test('nodes on both sides of a run slide the label to a free stretch', () { final nodes = [ _node('above', 40, 10, 120, 36), _node('below', 40, 54, 120, 36), ]; final route = _route(1, 'retry', [(0, 50), (300, 50)]); final placement = placeLinearLabels( routes: [route], extents: {1: LabelExtent(width: 40, height: 16)}, nodes: nodes, labelGap: 3, ); expect(placement.misfits, isEmpty); _expectClear(placement.labels, nodes); expect(placement.labels.single.x, greaterThanOrEqualTo(164)); }); test('labels sharing a run never overlap each other', () { final routes = [ _route(1, 'success', [(0, 50), (240, 50)]), _route(2, 'error', [(0, 50), (240, 50)]), _route(3, 'blocked', [(0, 50), (240, 50)]), ]; final placement = placeLinearLabels( routes: routes, extents: { for (final route in routes) route.id: LabelExtent(width: 60, height: 16), }, nodes: const [], labelGap: 3, ); expect(placement.labels, hasLength(3)); expect(placement.misfits, isEmpty); _expectClear(placement.labels, const []); }); test('a label longer than every run still keeps clear of the nodes', () { final nodes = [ _node('left', 0, 0, 100, 40), _node('right', 130, 0, 100, 40), ]; final route = _route(1, 'implementer-with-an-unusually-long-outcome', [ (100, 20), (130, 20), ]); final placement = placeLinearLabels( routes: [route], extents: {1: LabelExtent(width: 260, height: 16)}, nodes: nodes, labelGap: 3, ); // No spot on a 30px run holds a 260px label between two boxes, so it is a // reported misfit on the shelf rather than a label covering a node. expect(placement.misfits, {1}); _expectClear(placement.labels, nodes); expect(placement.labels.single.y, greaterThan(40)); }); test('a tight corner between three nodes finds the open side', () { // An L route: down beside `left`, then along under `below`'s top edge. final nodes = [ _node('left', 0, 0, 96, 120), _node('top', 104, 0, 120, 40), _node('below', 160, 92, 100, 40), ]; final route = _route(1, 'error', [(100, 20), (100, 80), (300, 80)]); final placement = placeLinearLabels( routes: [route], extents: {1: LabelExtent(width: 36, height: 16)}, nodes: nodes, labelGap: 3, ); expect(placement.misfits, isEmpty); _expectClear(placement.labels, nodes); expect( _distanceToRoute(placement.labels.single, route), lessThanOrEqualTo(3), ); }); test('the linear layout widens its gaps instead of covering a node', () { GraphNode stage(String key, int index) => GraphNode(key: key, terminal: false, stageIndex: index); final nodes = [stage('plan', 0), stage('build', 1)]; GraphEdge edge(int id, String source, String outcome, String target) => GraphEdge( id: id, source: source, outcome: outcome, target: target, label: outcome, fallback: false, knownTarget: true, ); final edges = [ edge(0, 'plan', 'success', 'build'), edge(1, 'build', 'retry', 'build'), edge(2, 'build', 'rework', 'plan'), ]; final extents = { 'plan': NodeExtent(width: 60, height: 40), 'build': NodeExtent(width: 60, height: 40), }; // Back-edge labels far wider than the default column gaps. final labels = { 0: LabelExtent(width: 50, height: 16), 1: LabelExtent(width: 220, height: 16), 2: LabelExtent(width: 240, height: 16), }; final (layout, routing) = layoutLinearGraph( nodes: nodes, edges: edges, extents: extents, labelExtents: labels, ); expect(routing.labels, hasLength(3)); _expectClear(routing.labels, layout.nodes); for (final label in routing.labels) { expect(label.right, lessThanOrEqualTo(routing.width)); expect(label.bottom, lessThanOrEqualTo(routing.height)); expect( _distanceToRoute(label, routing.routeFor(label.edgeId)!), lessThanOrEqualTo(const LinearGraphMetrics().labelGap), reason: 'label ${label.edgeId} stays on its own route', ); } }); }