The best way to control Claude Code, Codex and more from any computer or phone
Mirrored from https://github.com/Camo67/t3code.git
Synced Nov 21, 04:45 UTC
| 1 | import { EnvironmentId, type PeerLinkSummary } from "@t3tools/contracts"; |
| 2 | import * as DateTime from "effect/DateTime"; |
| 3 | import { describe, expect, it } from "vite-plus/test"; |
| 4 | |
| 5 | import { |
| 6 | anchorFleetView, |
| 7 | buildFleetGraph, |
| 8 | FLEET_FIT_LEGIBLE_SCALE, |
| 9 | fitFleetLayout, |
| 10 | fleetCanvasHeight, |
| 11 | fleetStackPartial, |
| 12 | FLEET_CLIENT_NODE_ID, |
| 13 | fleetEnvironmentNodeId, |
| 14 | FLEET_FOLD_ENVIRONMENTS_OVER, |
| 15 | FLEET_LANE_PITCH, |
| 16 | FLEET_ROUTE_PITCH, |
| 17 | FLEET_STACK_SHOWN_MAX, |
| 18 | fleetFocusRects, |
| 19 | fleetDrawnLinkId, |
| 20 | fleetLinkAction, |
| 21 | fleetLinkBackOffered, |
| 22 | fleetLinkOffer, |
| 23 | fleetMoreNodeId, |
| 24 | fleetNeighborhood, |
| 25 | fleetNodesInBox, |
| 26 | fleetSearch, |
| 27 | fleetShapeKey, |
| 28 | fleetStacks, |
| 29 | fleetSummary, |
| 30 | fleetTwoWayLinks, |
| 31 | isLinkEdge, |
| 32 | isRouteEdge, |
| 33 | layoutFleetGraph, |
| 34 | nextFleetNode, |
| 35 | zoomFleetView, |
| 36 | type FleetConnectMachineInput, |
| 37 | type FleetEnvironmentInput, |
| 38 | type FleetLayout, |
| 39 | type FleetRect, |
| 40 | } from "./environmentsMap.logic"; |
| 41 | |
| 42 | const now = DateTime.makeUnsafe("2026-11-19T12:00:00.000Z"); |
| 43 | const id = (value: string) => EnvironmentId.make(value); |
| 44 | const node = (value: string) => fleetEnvironmentNodeId(id(value)); |
| 45 | |
| 46 | const link = (target: string, overrides: Partial<PeerLinkSummary> = {}): PeerLinkSummary => ({ |
| 47 | environmentId: id(target), |
| 48 | label: target, |
| 49 | urls: [`https://${target}.example.ts.net`], |
| 50 | access: "approval-required", |
| 51 | linkedAt: DateTime.makeUnsafe("2026-11-01T00:00:00.000Z"), |
| 52 | expiresAt: DateTime.makeUnsafe("2027-01-01T00:00:00.000Z"), |
| 53 | lastReachedAt: null, |
| 54 | lastError: null, |
| 55 | status: "reachable", |
| 56 | ...overrides, |
| 57 | }); |
| 58 | |
| 59 | const environment = ( |
| 60 | name: string, |
| 61 | links: ReadonlyArray<PeerLinkSummary> | FleetEnvironmentInput["outgoing"]["state"] = [], |
| 62 | overrides: Partial<FleetEnvironmentInput> = {}, |
| 63 | ): FleetEnvironmentInput => ({ |
| 64 | environmentId: id(name), |
| 65 | label: name, |
| 66 | machine: "server", |
| 67 | phase: "connected", |
| 68 | enabled: true, |
| 69 | routes: [{ id: "tailnet", kind: "tailnet" }], |
| 70 | activeRouteId: "tailnet", |
| 71 | refusedRouteIds: [], |
| 72 | offersLinks: true, |
| 73 | canWriteAccess: true, |
| 74 | hasLinkAddress: true, |
| 75 | outgoing: |
| 76 | typeof links !== "string" |
| 77 | ? { state: "loaded", links } |
| 78 | : links === "error" |
| 79 | ? { state: "error", message: "boom" } |
| 80 | : links === "loaded" |
| 81 | ? { state: "loaded", links: [] } |
| 82 | : { state: links }, |
| 83 | ...overrides, |
| 84 | }); |
| 85 | |
| 86 | const connectMachine = (name: string): FleetConnectMachineInput => ({ |
| 87 | environmentId: id(name), |
| 88 | label: name, |
| 89 | machine: "server", |
| 90 | availability: "online", |
| 91 | }); |
| 92 | |
| 93 | const build = ( |
| 94 | environments: ReadonlyArray<FleetEnvironmentInput>, |
| 95 | connectMachines: ReadonlyArray<FleetConnectMachineInput> = [], |
| 96 | ) => buildFleetGraph({ clientLabel: "This browser", environments, connectMachines, now }); |
| 97 | |
| 98 | const vms = (count: number, prefix = "vm", overrides: Partial<PeerLinkSummary> = {}) => |
| 99 | Array.from({ length: count }, (_, index) => link(`${prefix}-${index + 1}`, overrides)); |
| 100 | |
| 101 | const routeStates = (graph: ReturnType<typeof build>, name: string) => |
| 102 | Object.fromEntries( |
| 103 | graph.edges |
| 104 | .filter(isRouteEdge) |
| 105 | .filter((edge) => edge.to === node(name)) |
| 106 | .map((edge) => [edge.routeId, edge.state]), |
| 107 | ); |
| 108 | |
| 109 | /** Six environments in every state, 45 link targets, 40 of them under one host. */ |
| 110 | const largeSetup = () => |
| 111 | build( |
| 112 | [ |
| 113 | environment( |
| 114 | "nucbox", |
| 115 | [...vms(40, "fs", { access: "full-access" }), link("ci"), link("cups", { access: "auto" })], |
| 116 | { |
| 117 | routes: [ |
| 118 | { id: "tailnet", kind: "tailnet" }, |
| 119 | { id: "lan", kind: "lan" }, |
| 120 | { id: "relay", kind: "relay" }, |
| 121 | ], |
| 122 | }, |
| 123 | ), |
| 124 | environment("cups", [link("nucbox"), link("staging", { access: "read-only" }), link("ci")]), |
| 125 | environment("mbp", "unknown", { phase: "offline" }), |
| 126 | environment("win", "unknown", { phase: "error" }), |
| 127 | environment("vps", [ |
| 128 | link("db-1"), |
| 129 | link("db-2"), |
| 130 | link("db-3"), |
| 131 | link("ci", { access: "read-only" }), |
| 132 | link("staging", { access: "auto" }), |
| 133 | link("cups", { access: "full-access" }), |
| 134 | ]), |
| 135 | environment("old", "unknown", { enabled: false, phase: "available" }), |
| 136 | ], |
| 137 | [connectMachine("gpu")], |
| 138 | ); |
| 139 | |
| 140 | /** The brief's setup: two hosts share three machines, one has three more and links to the other. */ |
| 141 | const sharedSetup = () => |
| 142 | build([ |
| 143 | environment("nucbox", [ |
| 144 | link("fs-1", { access: "full-access" }), |
| 145 | link("fs-2", { access: "auto" }), |
| 146 | link("fs-3", { access: "read-only" }), |
| 147 | ]), |
| 148 | environment("mbp", "unknown", { phase: "reconnecting" }), |
| 149 | environment("cups", [ |
| 150 | link("fs-1", { access: "full-access" }), |
| 151 | link("fs-2", { access: "full-access" }), |
| 152 | link("fs-3", { access: "auto" }), |
| 153 | link("fs-4", { access: "auto-accept-edits" }), |
| 154 | link("fs-5"), |
| 155 | link("fs-6", { access: "read-only" }), |
| 156 | link("nucbox", { access: "auto" }), |
| 157 | ]), |
| 158 | ]); |
| 159 | |
| 160 | /** Twenty environments, five of them folding by state, and 1000 machines two hosts both link to. */ |
| 161 | const hugeSetup = () => |
| 162 | build([ |
| 163 | environment("nucbox", [...vms(1000, "vm", { access: "full-access" }), link("cups")]), |
| 164 | environment("cups", vms(1000, "vm", { access: "full-access" })), |
| 165 | environment("mbp", [link("nucbox", { access: "auto" })]), |
| 166 | ...Array.from({ length: 5 }, (_, index) => environment(`gpu-${index + 1}`)), |
| 167 | ...Array.from({ length: 6 }, (_, index) => |
| 168 | environment(`lab-${index + 1}`, "unknown", { phase: "offline" }), |
| 169 | ), |
| 170 | ...Array.from({ length: 4 }, (_, index) => |
| 171 | environment(`old-${index + 1}`, "unknown", { enabled: false, phase: "available" }), |
| 172 | ), |
| 173 | ...Array.from({ length: 2 }, (_, index) => |
| 174 | environment(`legacy-${index + 1}`, "unknown", { phase: "unsupported" }), |
| 175 | ), |
| 176 | ]); |
| 177 | |
| 178 | /** Points along a path the layout wrote: absolute M, H, V, Q and C only. */ |
| 179 | function samplePath(d: string): Array<{ x: number; y: number }> { |
| 180 | const points: Array<{ x: number; y: number }> = []; |
| 181 | let x = 0; |
| 182 | let y = 0; |
| 183 | const curve = (controls: ReadonlyArray<number>) => { |
| 184 | const xs = [x, ...controls.filter((_, index) => index % 2 === 0)]; |
| 185 | const ys = [y, ...controls.filter((_, index) => index % 2 === 1)]; |
| 186 | const at = (values: ReadonlyArray<number>, t: number): number => |
| 187 | values.length === 1 |
| 188 | ? values[0]! |
| 189 | : at( |
| 190 | values.slice(1).map((value, index) => values[index]! * (1 - t) + value * t), |
| 191 | t, |
| 192 | ); |
| 193 | for (let step = 1; step <= 24; step += 1) { |
| 194 | points.push({ x: at(xs, step / 24), y: at(ys, step / 24) }); |
| 195 | } |
| 196 | x = xs.at(-1)!; |
| 197 | y = ys.at(-1)!; |
| 198 | }; |
| 199 | for (const [, command, rest] of d.matchAll(/([MHVQC])([^MHVQC]*)/g)) { |
| 200 | const values = rest!.trim().split(/[ ,]+/).map(Number); |
| 201 | if (command === "M") points.push({ x: (x = values[0]!), y: (y = values[1]!) }); |
| 202 | else if (command === "H") curve([values[0]!, y]); |
| 203 | else if (command === "V") curve([x, values[0]!]); |
| 204 | else curve(values); |
| 205 | } |
| 206 | return points; |
| 207 | } |
| 208 | |
| 209 | const overlaps = (a: FleetRect, b: FleetRect) => |
| 210 | a.x < b.x + b.width && b.x < a.x + a.width && a.y < b.y + b.height && b.y < a.y + a.height; |
| 211 | |
| 212 | /** Every box the layout draws that must not sit on another. */ |
| 213 | const solidRects = (layout: FleetLayout) => [ |
| 214 | ...[...layout.nodes].map(([key, rect]) => ({ key, rect, within: null as string | null })), |
| 215 | ...[...layout.routes].map(([key, geometry]) => ({ key, rect: geometry.pill, within: null })), |
| 216 | ...[...layout.stacks].map(([key, geometry]) => ({ key, rect: geometry.rect, within: key })), |
| 217 | ]; |
| 218 | |
| 219 | function expectNoOverlap(layout: FleetLayout, members: ReadonlyMap<string, string>) { |
| 220 | const rects = solidRects(layout); |
| 221 | for (const [index, left] of rects.entries()) { |
| 222 | for (const right of rects.slice(index + 1)) { |
| 223 | // An open stack's frame holds its own machines. |
| 224 | if (members.get(left.key) === right.within || members.get(right.key) === left.within) { |
| 225 | if (left.within !== null || right.within !== null) continue; |
| 226 | } |
| 227 | expect(overlaps(left.rect, right.rect), `${left.key} overlaps ${right.key}`).toBe(false); |
| 228 | } |
| 229 | expect(left.rect.x).toBeGreaterThanOrEqual(0); |
| 230 | expect(left.rect.y).toBeGreaterThanOrEqual(0); |
| 231 | expect(left.rect.x + left.rect.width).toBeLessThanOrEqual(layout.width); |
| 232 | expect(left.rect.y + left.rect.height).toBeLessThanOrEqual(layout.height); |
| 233 | } |
| 234 | } |
| 235 | |
| 236 | describe("buildFleetGraph", () => { |
| 237 | it("draws each saved route as its own edge and reads its state from what the client knows", () => { |
| 238 | const routes = [ |
| 239 | { id: "tailnet", kind: "tailnet" as const }, |
| 240 | { id: "lan", kind: "lan" as const }, |
| 241 | { id: "relay", kind: "relay" as const }, |
| 242 | ]; |
| 243 | const graph = build([ |
| 244 | environment("up", [], { routes, activeRouteId: "lan", refusedRouteIds: ["relay"] }), |
| 245 | environment("dialling", "unknown", { routes, phase: "connecting", activeRouteId: null }), |
| 246 | environment("gone", "unknown", { routes, phase: "error", activeRouteId: null }), |
| 247 | environment("off", "unknown", { routes, enabled: false, phase: "available" }), |
| 248 | environment("old", "unknown", { routes, phase: "unsupported" }), |
| 249 | ]); |
| 250 | expect(routeStates(graph, "up")).toEqual({ |
| 251 | tailnet: "standby", |
| 252 | lan: "in-use", |
| 253 | relay: "refused", |
| 254 | }); |
| 255 | expect(routeStates(graph, "dialling")).toEqual({ |
| 256 | tailnet: "trying", |
| 257 | lan: "trying", |
| 258 | relay: "trying", |
| 259 | }); |
| 260 | expect(routeStates(graph, "gone")).toEqual({ tailnet: "down", lan: "down", relay: "down" }); |
| 261 | expect(routeStates(graph, "off")).toEqual({ tailnet: "idle", lan: "idle", relay: "idle" }); |
| 262 | expect(routeStates(graph, "old")).toEqual({ tailnet: "idle", lan: "idle", relay: "idle" }); |
| 263 | }); |
| 264 | |
| 265 | it("adds T3 Connect machines the client has not saved, and only those", () => { |
| 266 | const graph = build([environment("cups")], [connectMachine("cups"), connectMachine("gpu")]); |
| 267 | expect(graph.nodes.map((entry) => `${entry.kind}:${entry.label}`)).toEqual([ |
| 268 | "client:This browser", |
| 269 | "environment:cups", |
| 270 | "connect:gpu", |
| 271 | ]); |
| 272 | expect(routeStates(graph, "gpu")).toEqual({ offer: "offered" }); |
| 273 | }); |
| 274 | |
| 275 | it("keeps one node per machine and one edge per link, whatever names it twice", () => { |
| 276 | const graph = build( |
| 277 | [ |
| 278 | environment("cups", [link("vps"), link("vps"), link("cups"), link("gpu"), link("nucbox")]), |
| 279 | environment("cups", [link("other")]), |
| 280 | environment("nucbox"), |
| 281 | ], |
| 282 | [connectMachine("gpu")], |
| 283 | ); |
| 284 | expect(graph.nodes.map((entry) => `${entry.kind}:${entry.label}`)).toEqual([ |
| 285 | "client:This browser", |
| 286 | "environment:cups", |
| 287 | "environment:nucbox", |
| 288 | "connect:gpu", |
| 289 | "target:vps", |
| 290 | ]); |
| 291 | expect(graph.edges.filter((edge) => edge.kind === "link").map((edge) => edge.id)).toEqual([ |
| 292 | `link:${node("cups")}>${node("vps")}`, |
| 293 | `link:${node("cups")}>${node("gpu")}`, |
| 294 | `link:${node("cups")}>${node("nucbox")}`, |
| 295 | ]); |
| 296 | }); |
| 297 | |
| 298 | it("keeps unknown, off, loading and failed link lists apart from an empty one", () => { |
| 299 | const graph = build([ |
| 300 | environment("a", "loaded"), |
| 301 | environment("b", "loading"), |
| 302 | environment("c", "error"), |
| 303 | environment("d", "off", { offersLinks: false }), |
| 304 | environment("e", "unknown", { phase: "offline" }), |
| 305 | environment("f", [], { canWriteAccess: false }), |
| 306 | ]); |
| 307 | const states = graph.nodes.flatMap((entry) => |
| 308 | entry.kind === "environment" |
| 309 | ? [[entry.label, entry.outgoing, entry.linking, entry.outgoingError]] |
| 310 | : [], |
| 311 | ); |
| 312 | expect(states).toEqual([ |
| 313 | ["a", "loaded", "ready", null], |
| 314 | ["b", "loading", "ready", null], |
| 315 | ["c", "error", "ready", "boom"], |
| 316 | ["d", "off", "off", null], |
| 317 | ["e", "unknown", "disconnected", null], |
| 318 | ["f", "loaded", "forbidden", null], |
| 319 | ]); |
| 320 | }); |
| 321 | |
| 322 | it("reads a link's health at the given time", () => { |
| 323 | const graph = build([ |
| 324 | environment("cups", [ |
| 325 | link("soon", { expiresAt: DateTime.makeUnsafe("2026-11-21T12:00:00.000Z") }), |
| 326 | link("gone", { status: "expired" }), |
| 327 | ]), |
| 328 | ]); |
| 329 | expect(graph.edges.flatMap((edge) => (edge.kind === "link" ? [edge.health] : []))).toEqual([ |
| 330 | { kind: "reachable", expiresInDays: 2 }, |
| 331 | { kind: "expired" }, |
| 332 | ]); |
| 333 | }); |
| 334 | }); |
| 335 | |
| 336 | describe("fleetSummary", () => { |
| 337 | it("counts links only when every connected environment's list was read", () => { |
| 338 | const summary = (...environments: FleetEnvironmentInput[]) => fleetSummary(build(environments)); |
| 339 | expect(summary(environment("a", [link("x")]), environment("b"))).toEqual({ |
| 340 | machines: 3, |
| 341 | links: 1, |
| 342 | loading: false, |
| 343 | }); |
| 344 | expect(summary(environment("a"), environment("b"))).toMatchObject({ links: 0 }); |
| 345 | // One failed list among several leaves the total unknown, not zero. |
| 346 | expect(summary(environment("a"), environment("b", "error"))).toMatchObject({ links: null }); |
| 347 | expect(summary(environment("a", "unknown"))).toMatchObject({ links: null }); |
| 348 | expect(summary(environment("a"), environment("b", "loading"))).toMatchObject({ |
| 349 | links: null, |
| 350 | loading: true, |
| 351 | }); |
| 352 | // A machine that is not connected says nothing either way. |
| 353 | expect( |
| 354 | summary(environment("a", [link("x")]), environment("b", "unknown", { phase: "offline" })), |
| 355 | ).toMatchObject({ links: 1 }); |
| 356 | }); |
| 357 | }); |
| 358 | |
| 359 | describe("fleetStacks", () => { |
| 360 | it("collapses many machines under one host and one access level, and nothing smaller", () => { |
| 361 | const graph = build([ |
| 362 | environment("nucbox", [ |
| 363 | ...vms(40, "fs", { access: "full-access" }), |
| 364 | ...vms(4, "few"), |
| 365 | link("fs-41", { access: "full-access", status: "unreachable" }), |
| 366 | ]), |
| 367 | ]); |
| 368 | const stacks = fleetStacks(graph, new Set()); |
| 369 | expect( |
| 370 | stacks.map((stack) => [ |
| 371 | stack.id, |
| 372 | stack.memberIds.length, |
| 373 | stack.reachable, |
| 374 | stack.firstLabel, |
| 375 | stack.lastLabel, |
| 376 | stack.expanded, |
| 377 | ]), |
| 378 | ).toEqual([[`stack:${node("nucbox")}:full-access`, 41, 40, "fs-1", "fs-41", false]]); |
| 379 | const [open] = fleetStacks(graph, new Set([stacks[0]!.id])); |
| 380 | expect(open!.expanded).toBe(true); |
| 381 | // An open stack draws its first machines; the rest stay in the details. |
| 382 | expect(open!.shownIds).toEqual(open!.memberIds.slice(0, FLEET_STACK_SHOWN_MAX)); |
| 383 | }); |
| 384 | |
| 385 | it("folds machines that share the exact set of links in, and keeps other sets apart", () => { |
| 386 | const graph = build([ |
| 387 | environment("nucbox", [ |
| 388 | ...vms(8, "vm", { access: "full-access" }), |
| 389 | ...vms(6, "ro", { access: "read-only" }), |
| 390 | ...vms(5, "solo"), |
| 391 | ]), |
| 392 | environment("cups", [ |
| 393 | link("vm-1", { access: "full-access", status: "unreachable" }), |
| 394 | ...vms(8, "vm", { access: "full-access" }).slice(1), |
| 395 | // The same two hosts, but one at another access level: a set of its own. |
| 396 | ...vms(6, "ro", { access: "full-access" }), |
| 397 | ]), |
| 398 | ]); |
| 399 | const stacks = fleetStacks(graph, new Set()); |
| 400 | expect( |
| 401 | stacks.map((stack) => [ |
| 402 | stack.sources.map((source) => `${source.sourceId}:${source.access}`), |
| 403 | stack.memberIds.length, |
| 404 | stack.edgeIds.length, |
| 405 | stack.reachable, |
| 406 | ]), |
| 407 | ).toEqual([ |
| 408 | [[`${node("nucbox")}:full-access`, `${node("cups")}:full-access`], 8, 16, 7], |
| 409 | [[`${node("nucbox")}:read-only`, `${node("cups")}:full-access`], 6, 12, 6], |
| 410 | [[`${node("nucbox")}:approval-required`], 5, 5, 5], |
| 411 | ]); |
| 412 | }); |
| 413 | |
| 414 | it("folds unlinked environments by state once there are many, and never a linked or connected one", () => { |
| 415 | const few = build( |
| 416 | Array.from({ length: FLEET_FOLD_ENVIRONMENTS_OVER }, (_, index) => |
| 417 | environment(`lab-${index}`, "unknown", { phase: "offline" }), |
| 418 | ), |
| 419 | ); |
| 420 | expect(fleetStacks(few, new Set())).toEqual([]); |
| 421 | const graph = build( |
| 422 | [ |
| 423 | environment("nucbox", [link("linked-offline")]), |
| 424 | environment("linked-offline", "unknown", { phase: "offline" }), |
| 425 | environment("idle"), |
| 426 | environment("dialling", "unknown", { phase: "connecting" }), |
| 427 | ...Array.from({ length: 4 }, (_, index) => |
| 428 | environment(`lab-${index + 1}`, "unknown", { phase: index === 0 ? "error" : "offline" }), |
| 429 | ), |
| 430 | ...Array.from({ length: 3 }, (_, index) => |
| 431 | environment(`old-${index + 1}`, "unknown", { enabled: false, phase: "available" }), |
| 432 | ), |
| 433 | // Two is too few to be worth a stack. |
| 434 | environment("legacy-1", "unknown", { phase: "unsupported" }), |
| 435 | environment("legacy-2", "unknown", { phase: "unsupported" }), |
| 436 | ], |
| 437 | ["gpu-1", "gpu-2", "gpu-3"].map(connectMachine), |
| 438 | ); |
| 439 | expect( |
| 440 | fleetStacks(graph, new Set()).map((stack) => [stack.kind, stack.group, stack.memberIds]), |
| 441 | ).toEqual([ |
| 442 | ["environments", "offline", ["lab-1", "lab-2", "lab-3", "lab-4"].map(node)], |
| 443 | ["environments", "off", ["old-1", "old-2", "old-3"].map(node)], |
| 444 | ["environments", "not-added", ["gpu-1", "gpu-2", "gpu-3"].map(node)], |
| 445 | ]); |
| 446 | }); |
| 447 | |
| 448 | it("leaves out a machine a second host links to, and a machine the client knows", () => { |
| 449 | const graph = build([ |
| 450 | environment("nucbox", [...vms(6, "fs"), link("cups")]), |
| 451 | environment("cups", [link("fs-1")]), |
| 452 | ]); |
| 453 | const [stack] = fleetStacks(graph, new Set()); |
| 454 | expect(stack!.memberIds).toEqual(["fs-2", "fs-3", "fs-4", "fs-5", "fs-6"].map(node)); |
| 455 | }); |
| 456 | }); |
| 457 | |
| 458 | describe("fleetLinkOffer", () => { |
| 459 | const graph = build( |
| 460 | [ |
| 461 | environment("cups", [link("vm"), link("old", { status: "expired" }), link("nucbox")]), |
| 462 | environment("nucbox"), |
| 463 | environment("guest", [], { canWriteAccess: false }), |
| 464 | environment("nolabs", "off", { offersLinks: false }), |
| 465 | environment("ssh-only", [], { hasLinkAddress: false }), |
| 466 | environment("asleep", "unknown", { phase: "offline" }), |
| 467 | ], |
| 468 | [connectMachine("gpu")], |
| 469 | ); |
| 470 | const offer = (source: string, target: string) => |
| 471 | fleetLinkOffer(graph, node(source), target === "client" ? FLEET_CLIENT_NODE_ID : node(target)); |
| 472 | |
| 473 | it("links without a code only where the client can mint one on the target", () => { |
| 474 | expect(offer("nucbox", "cups")).toEqual({ |
| 475 | kind: "link", |
| 476 | sourceEnvironmentId: id("nucbox"), |
| 477 | path: "code-less", |
| 478 | renews: false, |
| 479 | target: { kind: "machine", environmentId: id("cups") }, |
| 480 | }); |
| 481 | expect(offer("cups", "nucbox")).toMatchObject({ path: "code-less", renews: true }); |
| 482 | for (const target of ["guest", "ssh-only", "asleep", "gpu"]) { |
| 483 | expect(offer("cups", target), target).toMatchObject({ |
| 484 | path: "pairing-code", |
| 485 | target: { kind: "machine", environmentId: id(target) }, |
| 486 | }); |
| 487 | } |
| 488 | }); |
| 489 | |
| 490 | it("links to a machine known only through a link by its address, with a code", () => { |
| 491 | expect(offer("nucbox", "vm")).toMatchObject({ |
| 492 | path: "pairing-code", |
| 493 | renews: false, |
| 494 | target: { kind: "address", address: "https://vm.example.ts.net" }, |
| 495 | }); |
| 496 | expect(offer("cups", "vm")).toMatchObject({ renews: true }); |
| 497 | expect(offer("cups", "old")).toMatchObject({ renews: false }); |
| 498 | }); |
| 499 | |
| 500 | it("offers nothing from a machine that cannot link, or to itself or the client", () => { |
| 501 | const reason = (source: string, target: string) => { |
| 502 | const result = offer(source, target); |
| 503 | return result.kind === "unavailable" ? result.reason : result.kind; |
| 504 | }; |
| 505 | expect(reason("cups", "cups")).toBe("same-machine"); |
| 506 | expect(reason("cups", "client")).toBe("not-an-environment"); |
| 507 | expect(reason("gpu", "cups")).toBe("not-an-environment"); |
| 508 | expect(reason("vm", "cups")).toBe("not-an-environment"); |
| 509 | expect(reason("asleep", "cups")).toBe("source-disconnected"); |
| 510 | expect(reason("nolabs", "cups")).toBe("source-off"); |
| 511 | expect(reason("guest", "cups")).toBe("source-forbidden"); |
| 512 | }); |
| 513 | }); |
| 514 | |
| 515 | describe("fleetLinkAction", () => { |
| 516 | const graph = build([ |
| 517 | environment("nucbox", [...vms(6, "fs")]), |
| 518 | environment("cups"), |
| 519 | environment("mbp", "unknown", { phase: "offline" }), |
| 520 | environment("vps", [], { canWriteAccess: false }), |
| 521 | ]); |
| 522 | const stacks = fleetStacks(graph, new Set()); |
| 523 | const batch = (environmentIds: ReadonlyArray<string>) => ({ |
| 524 | kind: "batch", |
| 525 | sourceEnvironmentId: id("nucbox"), |
| 526 | environmentIds: environmentIds.map(id), |
| 527 | }); |
| 528 | |
| 529 | it("links to the selection when the drop lands on it, or the handle is pressed with one", () => { |
| 530 | const selected = new Set([node("cups"), node("mbp"), node("nucbox"), FLEET_CLIENT_NODE_ID]); |
| 531 | // The source and the client are never among the machines to link. |
| 532 | expect(fleetLinkAction(graph, stacks, selected, node("nucbox"), node("cups"))).toEqual( |
| 533 | batch(["cups", "mbp"]), |
| 534 | ); |
| 535 | expect(fleetLinkAction(graph, stacks, selected, node("nucbox"), null)).toEqual( |
| 536 | batch(["cups", "mbp"]), |
| 537 | ); |
| 538 | }); |
| 539 | |
| 540 | it("links one machine when the drop lands outside the selection, or nothing is selected", () => { |
| 541 | const selected = new Set([node("mbp")]); |
| 542 | expect(fleetLinkAction(graph, stacks, selected, node("nucbox"), node("cups"))).toMatchObject({ |
| 543 | kind: "single", |
| 544 | offer: { path: "code-less", target: { environmentId: id("cups") } }, |
| 545 | }); |
| 546 | expect(fleetLinkAction(graph, stacks, new Set(), node("nucbox"), null)).toEqual({ |
| 547 | kind: "single", |
| 548 | sourceEnvironmentId: id("nucbox"), |
| 549 | offer: null, |
| 550 | }); |
| 551 | // A selection of only the source is no batch. |
| 552 | expect( |
| 553 | fleetLinkAction(graph, stacks, new Set([node("nucbox")]), node("nucbox"), null), |
| 554 | ).toMatchObject({ kind: "single" }); |
| 555 | }); |
| 556 | |
| 557 | it("opens no batch for machines the client has no session on, and offers nothing from a host that cannot link", () => { |
| 558 | const members = ["fs-1", "fs-2", "fs-3", "fs-4", "fs-5", "fs-6"].map(node); |
| 559 | // A stack of machines known only through links: each needs a code, so no batch can link one. |
| 560 | expect(fleetLinkAction(graph, stacks, new Set(), node("cups"), stacks[0]!.id)).toEqual({ |
| 561 | kind: "code-only", |
| 562 | sourceId: node("cups"), |
| 563 | sourceEnvironmentId: id("cups"), |
| 564 | machineIds: members, |
| 565 | }); |
| 566 | // One such machine alone, ticked and dropped on, is asked for its code like any other. |
| 567 | expect( |
| 568 | fleetLinkAction(graph, stacks, new Set([node("fs-1")]), node("cups"), node("fs-1")), |
| 569 | ).toMatchObject({ |
| 570 | kind: "single", |
| 571 | sourceEnvironmentId: id("cups"), |
| 572 | offer: { path: "pairing-code", target: { kind: "address" } }, |
| 573 | }); |
| 574 | // One the client is connected to among them makes it a batch, which says why for the rest. |
| 575 | const mixed = new Set([node("fs-1"), node("fs-2"), node("mbp")]); |
| 576 | expect(fleetLinkAction(graph, stacks, mixed, node("cups"), node("mbp"))).toEqual({ |
| 577 | ...batch(["fs-1", "fs-2", "mbp"]), |
| 578 | sourceEnvironmentId: id("cups"), |
| 579 | }); |
| 580 | for (const source of ["mbp", "vps"]) { |
| 581 | expect(fleetLinkAction(graph, stacks, new Set(), node(source), stacks[0]!.id)).toBeNull(); |
| 582 | expect(fleetLinkAction(graph, stacks, new Set(), node(source), null)).toBeNull(); |
| 583 | } |
| 584 | expect(fleetLinkAction(graph, stacks, new Set(), node("nucbox"), node("nucbox"))).toBeNull(); |
| 585 | }); |
| 586 | }); |
| 587 | |
| 588 | describe("fleetTwoWayLinks", () => { |
| 589 | const graph = build([ |
| 590 | environment("a", [link("b"), link("c", { access: "full-access" }), link("d")]), |
| 591 | environment("b", [link("a", { status: "unreachable" })]), |
| 592 | environment("c", [link("a", { access: "auto" })]), |
| 593 | environment("d"), |
| 594 | ]); |
| 595 | const pairs = fleetTwoWayLinks(graph); |
| 596 | const edge = (from: string, to: string) => `link:${node(from)}>${node(to)}`; |
| 597 | |
| 598 | it("merges two links between the same machines only at the same access", () => { |
| 599 | expect([...pairs.keys()].toSorted()).toEqual([edge("a", "b"), edge("b", "a")]); |
| 600 | // Both links select the one line, drawn as the link from the machine listed first. |
| 601 | expect(fleetDrawnLinkId(pairs, edge("b", "a"))).toBe(edge("a", "b")); |
| 602 | expect(fleetDrawnLinkId(pairs, edge("a", "b"))).toBe(edge("a", "b")); |
| 603 | // Different access says two different things, and a one-way link has no other half. |
| 604 | expect(fleetDrawnLinkId(pairs, edge("c", "a"))).toBe(edge("c", "a")); |
| 605 | expect(fleetDrawnLinkId(pairs, edge("a", "d"))).toBe(edge("a", "d")); |
| 606 | }); |
| 607 | |
| 608 | it("keeps each direction's own health, and counts both links", () => { |
| 609 | const pair = pairs.get(edge("a", "b"))!; |
| 610 | expect(pair.forward.health.kind).toBe("reachable"); |
| 611 | expect(pair.back.health.kind).toBe("unreachable"); |
| 612 | expect(fleetSummary(graph).links).toBe(5); |
| 613 | }); |
| 614 | |
| 615 | it("lights both links and both machines' routes from either one", () => { |
| 616 | const lit = fleetNeighborhood(graph, [], { kind: "edge", id: edge("a", "b") }); |
| 617 | expect(lit.edges.has(edge("a", "b")) && lit.edges.has(edge("b", "a"))).toBe(true); |
| 618 | expect(lit.edges.has(`route:${node("a")}:tailnet`)).toBe(true); |
| 619 | expect(lit.edges.has(`route:${node("b")}:tailnet`)).toBe(true); |
| 620 | expect(lit.edges.has(edge("a", "d"))).toBe(false); |
| 621 | }); |
| 622 | |
| 623 | it("offers the link back on a one-way link only where the client can make it", () => { |
| 624 | const linkEdge = (from: ReturnType<typeof build>, source: string, target: string) => |
| 625 | from.edges.filter(isLinkEdge).find((entry) => entry.id === edge(source, target))!; |
| 626 | expect(fleetLinkBackOffered(graph, linkEdge(graph, "a", "d"))).toBe(true); |
| 627 | // Already linked back, at whatever access. |
| 628 | expect(fleetLinkBackOffered(graph, linkEdge(graph, "a", "c"))).toBe(false); |
| 629 | for (const target of [ |
| 630 | environment("d", "unknown", { phase: "offline" }), |
| 631 | environment("d", "off", { offersLinks: false }), |
| 632 | environment("d", [], { canWriteAccess: false }), |
| 633 | environment("d", "loading"), |
| 634 | ]) { |
| 635 | const other = build([environment("a", [link("d")]), target]); |
| 636 | expect(fleetLinkBackOffered(other, linkEdge(other, "a", "d"))).toBe(false); |
| 637 | } |
| 638 | for (const source of [{ canWriteAccess: false }, { hasLinkAddress: false }]) { |
| 639 | const other = build([environment("a", [link("d")], source), environment("d")]); |
| 640 | expect(fleetLinkBackOffered(other, linkEdge(other, "a", "d"))).toBe(false); |
| 641 | } |
| 642 | // A machine known only through the link is not one the client can link from. |
| 643 | const unknown = build([environment("a", [link("x")])]); |
| 644 | expect(fleetLinkBackOffered(unknown, linkEdge(unknown, "a", "x"))).toBe(false); |
| 645 | }); |
| 646 | }); |
| 647 | |
| 648 | describe("selecting and finding machines", () => { |
| 649 | it("selects the machines a box touches, and never the client or a stack", () => { |
| 650 | const graph = largeSetup(); |
| 651 | const layout = layoutFleetGraph(graph, fleetStacks(graph, new Set())); |
| 652 | const everything = { x: 0, y: 0, width: layout.width, height: layout.height }; |
| 653 | expect(fleetNodesInBox(layout, everything).toSorted()).toEqual( |
| 654 | [...layout.nodes.keys()].filter((key) => key !== FLEET_CLIENT_NODE_ID).toSorted(), |
| 655 | ); |
| 656 | const cups = layout.nodes.get(node("cups"))!; |
| 657 | expect(fleetNodesInBox(layout, { x: cups.x + 4, y: cups.y + 4, width: 2, height: 2 })).toEqual([ |
| 658 | node("cups"), |
| 659 | ]); |
| 660 | }); |
| 661 | |
| 662 | it("finds machines by name wherever they are drawn, in name order", () => { |
| 663 | const graph = largeSetup(); |
| 664 | expect(fleetSearch(graph, " FS-1 ").slice(0, 3)).toEqual(["fs-1", "fs-10", "fs-11"].map(node)); |
| 665 | expect(fleetSearch(graph, "")).toEqual([]); |
| 666 | expect(fleetSearch(graph, "this browser")).toEqual([]); |
| 667 | }); |
| 668 | }); |
| 669 | |
| 670 | describe("fleetNeighborhood", () => { |
| 671 | const graph = build([ |
| 672 | environment("a", [link("b"), ...vms(5)]), |
| 673 | environment("b", [link("c")]), |
| 674 | environment("c"), |
| 675 | ]); |
| 676 | const stacks = fleetStacks(graph, new Set()); |
| 677 | |
| 678 | it("lights one hop from a machine and its routes, and does not follow a link through", () => { |
| 679 | const lit = fleetNeighborhood(graph, stacks, { kind: "node", id: node("b") }); |
| 680 | expect([...lit.nodes].toSorted()).toEqual( |
| 681 | [FLEET_CLIENT_NODE_ID, node("a"), node("b"), node("c")].toSorted(), |
| 682 | ); |
| 683 | expect(lit.edges.has(`link:${node("a")}>${node("vm-1")}`)).toBe(false); |
| 684 | expect(lit.edges.has(`route:${node("b")}:tailnet`)).toBe(true); |
| 685 | expect(lit.edges.has(`route:${node("a")}:tailnet`)).toBe(true); |
| 686 | expect(lit.edges.has(`route:${node("c")}:tailnet`)).toBe(false); |
| 687 | }); |
| 688 | |
| 689 | it("lights a stack's machines, their host and the route to it", () => { |
| 690 | const lit = fleetNeighborhood(graph, stacks, { kind: "stack", id: stacks[0]!.id }); |
| 691 | expect(lit.nodes.has(node("vm-3"))).toBe(true); |
| 692 | expect(lit.nodes.has(node("b"))).toBe(false); |
| 693 | expect(lit.edges.has(`route:${node("a")}:tailnet`)).toBe(true); |
| 694 | }); |
| 695 | }); |
| 696 | |
| 697 | describe("layoutFleetGraph", () => { |
| 698 | const membersOf = (stacks: ReturnType<typeof fleetStacks>) => |
| 699 | new Map(stacks.flatMap((stack) => stack.memberIds.map((member) => [member, stack.id]))); |
| 700 | |
| 701 | it("places one environment, and a large setup, with nothing overlapping or out of bounds", () => { |
| 702 | const one = build([environment("cups")]); |
| 703 | expectNoOverlap(layoutFleetGraph(one), new Map()); |
| 704 | const large = largeSetup(); |
| 705 | const closed = fleetStacks(large, new Set()); |
| 706 | const layout = layoutFleetGraph(large, closed); |
| 707 | expectNoOverlap(layout, membersOf(closed)); |
| 708 | // Forty machines cost one node: 6 environments, the client, the Connect machine, 5 targets. |
| 709 | expect(layout.nodes.size).toBe(13); |
| 710 | expect(layout.stacks.size).toBe(1); |
| 711 | expect(layout.routes.size).toBe(9); |
| 712 | expect(layout.columns.map((column) => column.id)).toEqual([ |
| 713 | "client", |
| 714 | "environments", |
| 715 | "targets", |
| 716 | ]); |
| 717 | }); |
| 718 | |
| 719 | it("opens a stack where its card is, each machine in the tray below it", () => { |
| 720 | const large = largeSetup(); |
| 721 | const closed = fleetStacks(large, new Set()); |
| 722 | const stackId = closed[0]!.id; |
| 723 | const open = fleetStacks(large, new Set([stackId])); |
| 724 | for (const width of [undefined, 560, 900, 1400]) { |
| 725 | const before = layoutFleetGraph(large, closed, width); |
| 726 | const layout = layoutFleetGraph(large, open, width); |
| 727 | expectNoOverlap(layout, membersOf(open)); |
| 728 | // Forty machines open to the first 24 and one card for the other 16, never forty cards. |
| 729 | expect(layout.nodes.size).toBe(13 + FLEET_STACK_SHOWN_MAX); |
| 730 | const { face, tray } = layout.stacks.get(stackId)!; |
| 731 | const more = fleetFocusRects(layout).get(fleetMoreNodeId(stackId))!; |
| 732 | expect(layout.nodes.has(open[0]!.memberIds[FLEET_STACK_SHOWN_MAX]!)).toBe(false); |
| 733 | for (const rect of [more, ...open[0]!.shownIds.map((member) => layout.nodes.get(member)!)]) { |
| 734 | expect(rect.x).toBeGreaterThanOrEqual(tray!.x); |
| 735 | expect(rect.y).toBeGreaterThanOrEqual(tray!.y); |
| 736 | expect(rect.x + rect.width).toBeLessThanOrEqual(tray!.x + tray!.width); |
| 737 | expect(rect.y + rect.height).toBeLessThanOrEqual(tray!.y + tray!.height); |
| 738 | } |
| 739 | // The card, its lines, every route and every column stay put: the width's measures are |
| 740 | // those of the closed map, so opening never closes the columns up. |
| 741 | expect(face).toEqual(before.stacks.get(stackId)!.face); |
| 742 | expect(layout.stacks.get(stackId)!.lines.map((line) => line.arrow)).toEqual( |
| 743 | before.stacks.get(stackId)!.lines.map((line) => line.arrow), |
| 744 | ); |
| 745 | expect(layout.routes).toEqual(before.routes); |
| 746 | expect(layout.columns).toEqual(before.columns); |
| 747 | expect(tray!.y).toBeGreaterThanOrEqual(face.y + face.height); |
| 748 | // Only machines the tray would cover move, and only down. |
| 749 | for (const [nodeId, rect] of before.nodes) { |
| 750 | const now = layout.nodes.get(nodeId)!; |
| 751 | if (rect.x === face.x && rect.y > face.y) { |
| 752 | expect(now.y, nodeId).toBeGreaterThanOrEqual(tray!.y + tray!.height); |
| 753 | expect({ ...now, y: rect.y }, nodeId).toEqual(rect); |
| 754 | } else { |
| 755 | expect(now, nodeId).toEqual(rect); |
| 756 | } |
| 757 | } |
| 758 | } |
| 759 | }); |
| 760 | |
| 761 | it("opens a group of environments where its card is, moving only the cards below it", () => { |
| 762 | const graph = hugeSetup(); |
| 763 | const closed = fleetStacks(graph, new Set()); |
| 764 | const fold = closed.find((stack) => stack.kind === "environments")!; |
| 765 | const open = fleetStacks(graph, new Set([fold.id])); |
| 766 | for (const width of [560, 1400]) { |
| 767 | const before = layoutFleetGraph(graph, closed, width); |
| 768 | const layout = layoutFleetGraph(graph, open, width); |
| 769 | expectNoOverlap(layout, membersOf(open)); |
| 770 | const { face } = layout.stacks.get(fold.id)!; |
| 771 | expect(face).toEqual(before.stacks.get(fold.id)!.face); |
| 772 | for (const [nodeId, rect] of before.nodes) { |
| 773 | const now = layout.nodes.get(nodeId)!; |
| 774 | if (rect.y < face.y) expect(now, nodeId).toEqual(rect); |
| 775 | else expect({ ...now, y: rect.y }, nodeId).toEqual(rect); |
| 776 | } |
| 777 | } |
| 778 | }); |
| 779 | |
| 780 | it("draws the same map whatever order links arrive in", () => { |
| 781 | const forward = build([environment("a", [...vms(7), link("x"), link("y")])]); |
| 782 | const backward = build([environment("a", [link("y"), link("x"), ...vms(7).toReversed()])]); |
| 783 | const lay = (graph: ReturnType<typeof build>) => { |
| 784 | const layout = layoutFleetGraph(graph, fleetStacks(graph, new Set())); |
| 785 | return [...layout.nodes].toSorted(([left], [right]) => (left < right ? -1 : 1)); |
| 786 | }; |
| 787 | expect(lay(backward)).toEqual(lay(forward)); |
| 788 | }); |
| 789 | |
| 790 | it("names the access of links between environments on their own lane, clear of everything", () => { |
| 791 | const graph = build([ |
| 792 | environment("a", [link("b"), link("c"), link("x")]), |
| 793 | // At another access than the links back, so each of the four is its own line. |
| 794 | environment("b", [link("a", { access: "auto" }), link("x")]), |
| 795 | environment("c", [link("a", { access: "auto" })]), |
| 796 | ]); |
| 797 | const layout = layoutFleetGraph(graph); |
| 798 | const geometry = (from: string, to: string) => |
| 799 | layout.links.get(`link:${node(from)}>${node(to)}`)!; |
| 800 | expect(geometry("a", "x").badge).toBeNull(); |
| 801 | expect(geometry("b", "x").badge).toBeNull(); |
| 802 | const badges = [ |
| 803 | ["a", "b"], |
| 804 | ["a", "c"], |
| 805 | ["b", "a"], |
| 806 | ["c", "a"], |
| 807 | ].map(([from, to]) => { |
| 808 | const { badge, d } = geometry(from!, to!); |
| 809 | // On the link's own vertical run, between the two machines it joins. |
| 810 | const run = samplePath(d).filter( |
| 811 | (point) => point.y > badge!.y && point.y < badge!.y + badge!.height, |
| 812 | ); |
| 813 | expect(run.length).toBeGreaterThan(0); |
| 814 | for (const point of run) { |
| 815 | expect(point.x).toBeGreaterThan(badge!.x); |
| 816 | expect(point.x).toBeLessThan(badge!.x + badge!.width); |
| 817 | } |
| 818 | const ends = [layout.nodes.get(node(from!))!, layout.nodes.get(node(to!))!]; |
| 819 | expect(badge!.y).toBeGreaterThan(Math.min(...ends.map((rect) => rect.y))); |
| 820 | expect(badge!.y).toBeLessThan(Math.max(...ends.map((rect) => rect.y + rect.height))); |
| 821 | expect(badge!.x).toBeGreaterThanOrEqual(0); |
| 822 | expect(badge!.x + badge!.width).toBeLessThanOrEqual(layout.width); |
| 823 | return badge!; |
| 824 | }); |
| 825 | const boxes = [...badges, ...solidRects(layout).map((box) => box.rect)]; |
| 826 | for (const [index, badge] of badges.entries()) { |
| 827 | for (const other of boxes) { |
| 828 | if (other !== badge && boxes.indexOf(other) > index) { |
| 829 | expect(overlaps(badge, other)).toBe(false); |
| 830 | } |
| 831 | } |
| 832 | } |
| 833 | }); |
| 834 | |
| 835 | it("runs links between environments left of them and links to other machines right", () => { |
| 836 | const graph = largeSetup(); |
| 837 | const layout = layoutFleetGraph(graph, fleetStacks(graph, new Set())); |
| 838 | const card = layout.nodes.get(node("nucbox"))!; |
| 839 | for (const edge of graph.edges) { |
| 840 | const geometry = edge.kind === "link" ? layout.links.get(edge.id) : undefined; |
| 841 | if (geometry === undefined) continue; |
| 842 | const between = layout.nodes.get(edge.to)!.x === card.x; |
| 843 | for (const point of samplePath(geometry.d)) { |
| 844 | if (between) expect(point.x, edge.id).toBeLessThanOrEqual(card.x); |
| 845 | else expect(point.x, edge.id).toBeGreaterThanOrEqual(card.x + card.width); |
| 846 | } |
| 847 | } |
| 848 | }); |
| 849 | |
| 850 | it("keeps two hosts' links into one machine apart, and every link clear of other boxes", () => { |
| 851 | for (const graph of [sharedSetup(), largeSetup(), hugeSetup()]) { |
| 852 | for (const expanded of [false, true]) { |
| 853 | const closed = fleetStacks(graph, new Set()); |
| 854 | const stacks = expanded |
| 855 | ? fleetStacks(graph, new Set(closed.map((stack) => stack.id))) |
| 856 | : closed; |
| 857 | const layout = layoutFleetGraph(graph, stacks); |
| 858 | expectNoOverlap(layout, membersOf(stacks)); |
| 859 | const boxes = solidRects(layout); |
| 860 | const drawn = [ |
| 861 | ...[...layout.links].map(([key, geometry]) => ({ key, d: geometry.d })), |
| 862 | ...[...layout.stacks].flatMap(([key, geometry]) => |
| 863 | geometry.lines.map((line) => ({ key, d: line.d })), |
| 864 | ), |
| 865 | ]; |
| 866 | for (const { key, d } of drawn) { |
| 867 | for (const point of samplePath(d)) { |
| 868 | const hit = boxes.find( |
| 869 | ({ rect }) => |
| 870 | point.x > rect.x + 0.5 && |
| 871 | point.x < rect.x + rect.width - 0.5 && |
| 872 | point.y > rect.y + 0.5 && |
| 873 | point.y < rect.y + rect.height - 0.5, |
| 874 | ); |
| 875 | expect(hit?.key, `${key} passes through ${hit?.key}`).toBeUndefined(); |
| 876 | } |
| 877 | } |
| 878 | // The last stretch into a machine is level, so two that differ in height never share it. |
| 879 | const arrivals = new Map<string, number[]>(); |
| 880 | for (const edge of graph.edges) { |
| 881 | const geometry = edge.kind === "link" ? layout.links.get(edge.id) : undefined; |
| 882 | if (geometry === undefined) continue; |
| 883 | const [before, last] = samplePath(geometry.d).slice(-2); |
| 884 | // A machine an open stack pushed far down is reached by a steeper curve. |
| 885 | expect(Math.abs(before!.y - geometry.arrow.y)).toBeLessThan(1); |
| 886 | expect(last!.y).toBe(geometry.arrow.y); |
| 887 | arrivals.set(edge.to, [...(arrivals.get(edge.to) ?? []), geometry.arrow.y]); |
| 888 | } |
| 889 | // A stack several hosts link to takes one line from each, each with its own entry. |
| 890 | for (const [stackId, geometry] of layout.stacks) { |
| 891 | for (const line of geometry.lines) { |
| 892 | if (line.arrow === null) continue; |
| 893 | if (geometry.lines.length > 1) { |
| 894 | expect(samplePath(line.d).at(-2)!.y).toBeCloseTo(line.arrow.y, 0); |
| 895 | } |
| 896 | arrivals.set(stackId, [...(arrivals.get(stackId) ?? []), line.arrow.y]); |
| 897 | } |
| 898 | } |
| 899 | for (const [target, heights] of arrivals) { |
| 900 | const sorted = heights.toSorted((left, right) => left - right); |
| 901 | for (const [index, height] of sorted.entries()) { |
| 902 | if (index > 0) { |
| 903 | expect(height - sorted[index - 1]!, `into ${target}`).toBeGreaterThanOrEqual(6); |
| 904 | } |
| 905 | } |
| 906 | } |
| 907 | } |
| 908 | } |
| 909 | }); |
| 910 | |
| 911 | it("draws 1000 shared machines and 20 environments as a few stacks, open or closed", () => { |
| 912 | const graph = hugeSetup(); |
| 913 | const closed = fleetStacks(graph, new Set()); |
| 914 | expect(closed.map((stack) => [stack.kind, stack.memberIds.length])).toEqual([ |
| 915 | ["targets", 1000], |
| 916 | ["environments", 6], |
| 917 | ["environments", 4], |
| 918 | ]); |
| 919 | const layout = layoutFleetGraph(graph, closed); |
| 920 | expectNoOverlap(layout, membersOf(closed)); |
| 921 | // The client and the ten environments that stay cards: nothing per folded machine. |
| 922 | expect(layout.nodes.size).toBe(11); |
| 923 | expect(layout.links.size).toBe(2); |
| 924 | expect(layout.routes.size).toBe(10); |
| 925 | expect(layout.stacks.get(closed[0]!.id)!.lines.map((line) => line.sourceId)).toEqual([ |
| 926 | node("nucbox"), |
| 927 | node("cups"), |
| 928 | ]); |
| 929 | const open = fleetStacks(graph, new Set(closed.map((stack) => stack.id))); |
| 930 | const opened = layoutFleetGraph(graph, open); |
| 931 | expectNoOverlap(opened, membersOf(open)); |
| 932 | expect(opened.nodes.size).toBe(11 + FLEET_STACK_SHOWN_MAX + 6 + 4); |
| 933 | expect(layoutFleetGraph(graph, open)).toEqual(opened); |
| 934 | }); |
| 935 | |
| 936 | it("sizes a card by its name alone, whatever routes and links attach to it", () => { |
| 937 | const routes = (count: number) => |
| 938 | Array.from({ length: count }, (_, index) => ({ id: `r${index}`, kind: "tailnet" as const })); |
| 939 | const names = ["a", "b", "c", "d", "e"]; |
| 940 | const mesh = build( |
| 941 | names.map((name, index) => |
| 942 | environment( |
| 943 | name, |
| 944 | names.filter((other) => other !== name).map((other) => link(other)), |
| 945 | { routes: routes(index * 2 + 1) }, |
| 946 | ), |
| 947 | ), |
| 948 | ); |
| 949 | const layout = layoutFleetGraph(mesh); |
| 950 | expectNoOverlap(layout, new Map()); |
| 951 | const plain = layoutFleetGraph(build([environment("a")])).nodes.get(node("a"))!; |
| 952 | const cards = names.map((name) => layout.nodes.get(node(name))!); |
| 953 | // Nine routes and eight links leave a card the size of one with a single route. |
| 954 | expect(cards.map((card) => card.height)).toEqual(names.map(() => plain.height)); |
| 955 | expect(plain.height).toBeLessThanOrEqual(64); |
| 956 | const long = layoutFleetGraph(build([environment("Julius's MacBook Pro")])); |
| 957 | const wrapped = long.nodes.get(node("Julius's MacBook Pro"))!.height; |
| 958 | expect(wrapped).toBeGreaterThan(plain.height); |
| 959 | expect(wrapped).toBeLessThanOrEqual(72); |
| 960 | for (const [index, name] of names.entries()) { |
| 961 | const card = cards[index]!; |
| 962 | const pills = mesh.edges |
| 963 | .filter(isRouteEdge) |
| 964 | .filter((edge) => edge.to === node(name)) |
| 965 | .map((edge) => layout.routes.get(edge.id)!); |
| 966 | const centers = pills.map(({ pill }) => pill.y + pill.height / 2); |
| 967 | // The route names keep their own pitch, centred on the card, and may reach past it. |
| 968 | expect((centers[0]! + centers.at(-1)!) / 2).toBeCloseTo(card.y + card.height / 2, 5); |
| 969 | for (const [at, center] of centers.entries()) { |
| 970 | if (at > 0) expect(center - centers[at - 1]!).toBe(FLEET_ROUTE_PITCH); |
| 971 | } |
| 972 | // Their wires close up and enter the card as one bundle, each at its own height. |
| 973 | const entries = pills.map(({ d }) => samplePath(d).at(-1)!.y); |
| 974 | expect(new Set(entries).size).toBe(entries.length); |
| 975 | expect(Math.max(...entries) - Math.min(...entries)).toBeLessThanOrEqual(10); |
| 976 | for (const entry of entries) { |
| 977 | expect(entry).toBeGreaterThan(card.y); |
| 978 | expect(entry).toBeLessThan(card.y + card.height); |
| 979 | } |
| 980 | } |
| 981 | // The gap between two cards grows only by what the taller column of route names needs. |
| 982 | const gap = (upper: number) => cards[upper + 1]!.y - cards[upper]!.y - cards[upper]!.height; |
| 983 | const two = layoutFleetGraph(build([environment("a"), environment("b")])); |
| 984 | expect(gap(0)).toBe(two.nodes.get(node("b"))!.y - plain.y - plain.height); |
| 985 | expect(gap(3)).toBeGreaterThan(gap(0)); |
| 986 | }); |
| 987 | |
| 988 | it("gives every link into a card its own arrowhead on the edge the card already has", () => { |
| 989 | const fan = build([ |
| 990 | ...["a", "b", "c", "d"].map((name) => environment(name, [link("e")])), |
| 991 | environment("e"), |
| 992 | ]); |
| 993 | const pair = build([ |
| 994 | environment("a", [link("b"), link("c")]), |
| 995 | environment("b"), |
| 996 | environment("c", [link("b")]), |
| 997 | ]); |
| 998 | const names = ["a", "b", "c", "d", "e"]; |
| 999 | const mesh = build( |
| 1000 | names.map((name) => |
| 1001 | environment( |
| 1002 | name, |
| 1003 | names.filter((other) => other !== name).map((other) => link(other)), |
| 1004 | ), |
| 1005 | ), |
| 1006 | ); |
| 1007 | for (const [graph, roomy] of [ |
| 1008 | [pair, true], |
| 1009 | [fan, false], |
| 1010 | [mesh, false], |
| 1011 | ] as const) { |
| 1012 | const layout = layoutFleetGraph(graph); |
| 1013 | expectNoOverlap(layout, new Map()); |
| 1014 | const arrivals = new Map<string, number[]>(); |
| 1015 | for (const edge of graph.edges) { |
| 1016 | const geometry = edge.kind === "link" ? layout.links.get(edge.id) : undefined; |
| 1017 | if (edge.kind !== "link" || geometry === undefined) continue; |
| 1018 | const from = layout.nodes.get(edge.from)!; |
| 1019 | const leaves = samplePath(geometry.d)[0]!.y; |
| 1020 | expect(leaves).toBeGreaterThan(from.y); |
| 1021 | expect(leaves).toBeLessThan(from.y + from.height); |
| 1022 | arrivals.set(edge.to, [...(arrivals.get(edge.to) ?? []), geometry.arrow.y]); |
| 1023 | if (geometry.twoWay !== null) { |
| 1024 | const into = arrivals.get(edge.from) ?? []; |
| 1025 | arrivals.set(edge.from, [...into, geometry.twoWay.backArrow.y]); |
| 1026 | } |
| 1027 | } |
| 1028 | for (const [id, heights] of arrivals) { |
| 1029 | const card = layout.nodes.get(id)!; |
| 1030 | const sorted = heights.toSorted((left, right) => left - right); |
| 1031 | expect(sorted[0]!).toBeGreaterThan(card.y); |
| 1032 | expect(sorted.at(-1)!).toBeLessThan(card.y + card.height); |
| 1033 | for (const [index, height] of sorted.entries()) { |
| 1034 | if (index === 0) continue; |
| 1035 | // With room they are a full lane apart; a crowded edge closes them up, never onto |
| 1036 | // one another. |
| 1037 | expect(height - sorted[index - 1]!, `at ${id}`).toBeGreaterThanOrEqual( |
| 1038 | roomy ? FLEET_LANE_PITCH : 3, |
| 1039 | ); |
| 1040 | } |
| 1041 | } |
| 1042 | } |
| 1043 | }); |
| 1044 | |
| 1045 | it("draws a two-way link once, on one lane, with an arrowhead into each card", () => { |
| 1046 | const setup = (back: Partial<PeerLinkSummary>) => |
| 1047 | build([environment("a", [link("b")]), environment("b", [link("a", back)])]); |
| 1048 | const merged = setup({}); |
| 1049 | const apart = setup({ access: "auto" }); |
| 1050 | const forward = `link:${node("a")}>${node("b")}`; |
| 1051 | const reverse = `link:${node("b")}>${node("a")}`; |
| 1052 | const layout = layoutFleetGraph(merged); |
| 1053 | const two = layoutFleetGraph(apart); |
| 1054 | expect([...layout.links.keys()]).toEqual([forward]); |
| 1055 | expect([...two.links.keys()].toSorted()).toEqual([forward, reverse]); |
| 1056 | // Two lines need two lanes left of the cards; the merged one needs a single lane. |
| 1057 | expect(two.nodes.get(node("a"))!.x - layout.nodes.get(node("a"))!.x).toBeGreaterThan(0); |
| 1058 | expect(two.links.get(forward)!.twoWay).toBeNull(); |
| 1059 | const geometry = layout.links.get(forward)!; |
| 1060 | const { twoWay } = geometry; |
| 1061 | expect(twoWay).not.toBeNull(); |
| 1062 | for (const [arrow, cardId] of [ |
| 1063 | [geometry.arrow, "b"], |
| 1064 | [twoWay!.backArrow, "a"], |
| 1065 | ] as const) { |
| 1066 | const card = layout.nodes.get(node(cardId))!; |
| 1067 | expect(arrow.x).toBe(card.x); |
| 1068 | expect(arrow.y).toBeGreaterThan(card.y); |
| 1069 | expect(arrow.y).toBeLessThan(card.y + card.height); |
| 1070 | } |
| 1071 | // Each half ends at its own arrowhead and the two meet, so one direction's state shows at |
| 1072 | // its end without a gap in the line. |
| 1073 | const forwardHalf = samplePath(twoWay!.forward); |
| 1074 | const backHalf = samplePath(twoWay!.back); |
| 1075 | expect(forwardHalf.at(-1)!.y).toBe(geometry.arrow.y); |
| 1076 | expect(backHalf[0]!.y).toBe(twoWay!.backArrow.y); |
| 1077 | expect(backHalf.at(-1)).toEqual(forwardHalf[0]); |
| 1078 | expect(geometry.badge?.onDemand).toBe(false); |
| 1079 | // Health is no part of the shape: one direction failing redraws nothing. |
| 1080 | expect(fleetShapeKey(setup({ status: "unreachable" }), [])).toBe(fleetShapeKey(merged, [])); |
| 1081 | }); |
| 1082 | |
| 1083 | it("shows a link's name only on demand where it has no clear place", () => { |
| 1084 | const names = ["a", "b", "c", "d", "e"]; |
| 1085 | const graph = build( |
| 1086 | names.map((name) => |
| 1087 | environment( |
| 1088 | name, |
| 1089 | names.filter((other) => other !== name).map((other) => link(other)), |
| 1090 | ), |
| 1091 | ), |
| 1092 | ); |
| 1093 | const layout = layoutFleetGraph(graph); |
| 1094 | const between = [...layout.links.values()]; |
| 1095 | const always = between.flatMap(({ badge }) => (badge && !badge.onDemand ? [badge] : [])); |
| 1096 | // Every link keeps a name; the ones always drawn sit on no other link's lane and no other name. |
| 1097 | expect(between.every(({ badge }) => badge !== null)).toBe(true); |
| 1098 | expect(always.length).toBeGreaterThan(0); |
| 1099 | expect(always.length).toBeLessThan(between.length); |
| 1100 | for (const [index, badge] of always.entries()) { |
| 1101 | for (const other of always.slice(index + 1)) expect(overlaps(badge, other)).toBe(false); |
| 1102 | const crossing = between.filter(({ badge: own, d }) => { |
| 1103 | if (own === badge) return false; |
| 1104 | return samplePath(d).some( |
| 1105 | (point) => |
| 1106 | point.x > badge.x + 0.5 && |
| 1107 | point.x < badge.x + badge.width - 0.5 && |
| 1108 | point.y > badge.y + 0.5 && |
| 1109 | point.y < badge.y + badge.height - 0.5, |
| 1110 | ); |
| 1111 | }); |
| 1112 | expect(crossing).toEqual([]); |
| 1113 | } |
| 1114 | }); |
| 1115 | |
| 1116 | it("puts a machine several hosts link to between them, and one host's machines beside it", () => { |
| 1117 | const layout = layoutFleetGraph(sharedSetup()); |
| 1118 | const center = (name: string) => { |
| 1119 | const rect = layout.nodes.get(node(name))!; |
| 1120 | return rect.y + rect.height / 2; |
| 1121 | }; |
| 1122 | for (const name of ["fs-1", "fs-2", "fs-3"]) { |
| 1123 | expect(center(name)).toBeGreaterThan(center("nucbox")); |
| 1124 | expect(center(name)).toBeLessThan(center("cups")); |
| 1125 | } |
| 1126 | expect(center("fs-5")).toBe(center("cups")); |
| 1127 | // The upper host's link arrives above the lower host's. |
| 1128 | const arrival = (from: string) => layout.links.get(`link:${node(from)}>${node("fs-2")}`)!.arrow; |
| 1129 | expect(arrival("nucbox").y).toBeLessThan(arrival("cups").y); |
| 1130 | }); |
| 1131 | |
| 1132 | it("gives up gutters before scale: a real setup stays legible from 560 to 1400 wide", () => { |
| 1133 | const routes = (...kinds: ReadonlyArray<"lan" | "tailnet" | "relay">) => |
| 1134 | kinds.map((kind, index) => ({ id: `${kind}-${index}`, kind })); |
| 1135 | const graph = build([ |
| 1136 | environment("cups", "unknown", { |
| 1137 | phase: "offline", |
| 1138 | routes: routes("tailnet", "tailnet", "relay"), |
| 1139 | }), |
| 1140 | environment( |
| 1141 | "nucbox-1", |
| 1142 | [ |
| 1143 | link("Julius's MacBook Pro", { access: "full-access" }), |
| 1144 | ...vms(7, "fs", { access: "full-access" }), |
| 1145 | ...vms(37, "gs", { access: "full-access", status: "unreachable" }), |
| 1146 | ], |
| 1147 | { routes: routes("lan", "tailnet", "tailnet", "relay"), activeRouteId: "lan-0" }, |
| 1148 | ), |
| 1149 | environment("Julius's MacBook Pro"), |
| 1150 | ]); |
| 1151 | const stacks = fleetStacks(graph, new Set()); |
| 1152 | expect(stacks.map((stack) => [stack.memberIds.length, stack.reachable])).toEqual([[44, 7]]); |
| 1153 | const regular = layoutFleetGraph(graph, stacks); |
| 1154 | const widths = [560, 900, 1400].map((width) => { |
| 1155 | const layout = layoutFleetGraph(graph, stacks, width); |
| 1156 | expectNoOverlap(layout, membersOf(stacks)); |
| 1157 | const height = fleetCanvasHeight(layout, width, { min: 0, max: 840 }); |
| 1158 | expect(fitFleetLayout(layout, { width, height }).scale, `at ${width}`).toBeGreaterThanOrEqual( |
| 1159 | FLEET_FIT_LEGIBLE_SCALE, |
| 1160 | ); |
| 1161 | // Only the columns move: every height, and so every lane and entry, is the regular one. |
| 1162 | expect(layout.height).toBe(regular.height); |
| 1163 | // Each route enters its machine at its own height, and a link's arrowhead stands clear |
| 1164 | // of all of them. |
| 1165 | const arrivals = new Map<string, { routes: number[]; links: number[] }>(); |
| 1166 | const into = (id: string) => |
| 1167 | arrivals.get(id) ?? arrivals.set(id, { routes: [], links: [] }).get(id)!; |
| 1168 | for (const edge of graph.edges) { |
| 1169 | if (edge.kind === "route") { |
| 1170 | into(edge.to).routes.push(samplePath(layout.routes.get(edge.id)!.d).at(-1)!.y); |
| 1171 | } else if (layout.links.has(edge.id)) { |
| 1172 | into(edge.to).links.push(layout.links.get(edge.id)!.arrow.y); |
| 1173 | } |
| 1174 | } |
| 1175 | for (const [id, { routes: entries, links: arrows }] of arrivals) { |
| 1176 | expect(new Set(entries).size, `into ${id}`).toBe(entries.length); |
| 1177 | for (const arrow of arrows) { |
| 1178 | for (const entry of entries) { |
| 1179 | expect(Math.abs(arrow - entry), `into ${id}`).toBeGreaterThanOrEqual(8); |
| 1180 | } |
| 1181 | } |
| 1182 | } |
| 1183 | // Every wire and link still ends level, however short its run became. |
| 1184 | for (const { d } of [...layout.routes.values(), ...layout.links.values()]) { |
| 1185 | const [before, last] = samplePath(d).slice(-2); |
| 1186 | expect(before!.y).toBe(last!.y); |
| 1187 | } |
| 1188 | return layout.width; |
| 1189 | }); |
| 1190 | expect(widths[0]).toBeLessThan(regular.width); |
| 1191 | expect(widths[2]).toBeGreaterThan(regular.width); |
| 1192 | }); |
| 1193 | |
| 1194 | it("gives a stack room to say how many machines answer only when some do not", () => { |
| 1195 | const face = (links: ReadonlyArray<PeerLinkSummary>) => { |
| 1196 | const graph = build([environment("host", links)]); |
| 1197 | const stacks = fleetStacks(graph, new Set()); |
| 1198 | expect(fleetStackPartial(stacks[0]!)).toBe( |
| 1199 | links.some((entry) => entry.status !== "reachable"), |
| 1200 | ); |
| 1201 | return { |
| 1202 | key: fleetShapeKey(graph, stacks), |
| 1203 | height: layoutFleetGraph(graph, stacks).stacks.get(stacks[0]!.id)!.face.height, |
| 1204 | }; |
| 1205 | }; |
| 1206 | const whole = face(vms(6)); |
| 1207 | const partial = face([...vms(5), link("vm-6", { status: "unreachable" })]); |
| 1208 | expect(partial.height).toBeGreaterThan(whole.height); |
| 1209 | // The card changes size, so the layout has to be made again. |
| 1210 | expect(partial.key).not.toBe(whole.key); |
| 1211 | }); |
| 1212 | |
| 1213 | it("keeps the shape key when only health, route state or status changes", () => { |
| 1214 | const key = (graph: ReturnType<typeof build>) => |
| 1215 | fleetShapeKey(graph, fleetStacks(graph, new Set())); |
| 1216 | // One machine already not answering: how many more go quiet does not resize the card. |
| 1217 | const before = build([environment("a", [...vms(5), link("vm-6", { status: "unreachable" })])]); |
| 1218 | const after = build([ |
| 1219 | environment("a", [...vms(6, "vm", { status: "unreachable" })], { |
| 1220 | activeRouteId: null, |
| 1221 | phase: "connected", |
| 1222 | }), |
| 1223 | ]); |
| 1224 | expect(key(after)).toBe(key(before)); |
| 1225 | const moved = build([environment("a", [...vms(6, "vm", { access: "read-only" })])]); |
| 1226 | expect(key(moved)).not.toBe(key(before)); |
| 1227 | const stacks = fleetStacks(before, new Set()); |
| 1228 | expect(fleetShapeKey(before, fleetStacks(before, new Set([stacks[0]!.id])))).not.toBe( |
| 1229 | key(before), |
| 1230 | ); |
| 1231 | // An environment that comes back leaves its folded group, with the group's id unchanged. |
| 1232 | const labs = (firstPhase: FleetEnvironmentInput["phase"]) => |
| 1233 | build( |
| 1234 | Array.from({ length: 14 }, (_, index) => |
| 1235 | environment(`lab-${index}`, "unknown", { phase: index === 0 ? firstPhase : "offline" }), |
| 1236 | ), |
| 1237 | ); |
| 1238 | expect(key(labs("connecting"))).not.toBe(key(labs("offline"))); |
| 1239 | }); |
| 1240 | }); |
| 1241 | |
| 1242 | describe("nextFleetNode", () => { |
| 1243 | it("steps between columns and down a column, stacks included", () => { |
| 1244 | const graph = build([ |
| 1245 | environment("a", [...vms(5), link("x", { access: "read-only" })]), |
| 1246 | environment("b"), |
| 1247 | ]); |
| 1248 | const stacks = fleetStacks(graph, new Set()); |
| 1249 | const rects = fleetFocusRects(layoutFleetGraph(graph, stacks)); |
| 1250 | expect(nextFleetNode(rects, FLEET_CLIENT_NODE_ID, "right")).toBe(node("a")); |
| 1251 | expect(nextFleetNode(rects, node("a"), "down")).toBe(node("b")); |
| 1252 | expect(nextFleetNode(rects, node("a"), "right")).toBe(stacks[0]!.id); |
| 1253 | expect(nextFleetNode(rects, stacks[0]!.id, "down")).toBe(node("x")); |
| 1254 | expect(nextFleetNode(rects, FLEET_CLIENT_NODE_ID, "left")).toBeNull(); |
| 1255 | }); |
| 1256 | }); |
| 1257 | |
| 1258 | describe("fitting the view", () => { |
| 1259 | it("fills the canvas but caps the zoom for a small map", () => { |
| 1260 | const view = fitFleetLayout({ width: 300, height: 60 }, { width: 900, height: 400 }); |
| 1261 | expect(view.scale).toBe(1.15); |
| 1262 | expect(view.x).toBeCloseTo((900 - 300 * 1.15) / 2); |
| 1263 | }); |
| 1264 | |
| 1265 | it("fits a map taller than the manual minimum allows, and zooming out does not jump back", () => { |
| 1266 | const view = fitFleetLayout({ width: 700, height: 1572 }, { width: 800, height: 360 }); |
| 1267 | expect(view.scale).toBeLessThan(0.3); |
| 1268 | expect(1572 * view.scale).toBeLessThanOrEqual(360); |
| 1269 | expect(zoomFleetView(view, 0.8, { x: 0, y: 0 }).scale).toBe(view.scale); |
| 1270 | const closer = zoomFleetView(view, 1.25, { x: 0, y: 0 }, view.scale); |
| 1271 | expect(closer.scale).toBeGreaterThan(view.scale); |
| 1272 | expect(zoomFleetView(closer, 0.8, { x: 0, y: 0 }, view.scale).scale).toBeCloseTo(view.scale); |
| 1273 | }); |
| 1274 | |
| 1275 | it("sizes the canvas to the fitted map within its bounds", () => { |
| 1276 | const bounds = { min: 240, max: 640 }; |
| 1277 | expect(fleetCanvasHeight({ width: 400, height: 60 }, 900, bounds)).toBe(240); |
| 1278 | expect(fleetCanvasHeight({ width: 800, height: 2000 }, 900, bounds)).toBe(640); |
| 1279 | expect(fleetCanvasHeight({ width: 800, height: 300 }, 900, bounds)).toBe( |
| 1280 | Math.ceil(300 * ((900 - 56) / 800) + 56), |
| 1281 | ); |
| 1282 | }); |
| 1283 | |
| 1284 | it("keeps a stack where it is on screen when it opens, and returns when it closes", () => { |
| 1285 | const graph = largeSetup(); |
| 1286 | const closed = fleetStacks(graph, new Set()); |
| 1287 | const stackId = closed[0]!.id; |
| 1288 | const open = fleetStacks(graph, new Set([stackId])); |
| 1289 | const bounds = { min: 180, max: 840 }; |
| 1290 | const onScreen = (view: { x: number; y: number; scale: number }, rect: FleetRect) => ({ |
| 1291 | x: rect.x * view.scale + view.x, |
| 1292 | y: rect.y * view.scale + view.y, |
| 1293 | }); |
| 1294 | for (const width of [560, 640, 1400]) { |
| 1295 | const before = layoutFleetGraph(graph, closed, width); |
| 1296 | const after = layoutFleetGraph(graph, open, width); |
| 1297 | const size = { width, height: fleetCanvasHeight(before, width, bounds) }; |
| 1298 | const fit = fitFleetLayout(before, size); |
| 1299 | const face = before.stacks.get(stackId)!.face; |
| 1300 | const opened = anchorFleetView({ |
| 1301 | key: "open", |
| 1302 | from: { key: "closed", held: null, view: fit, size, face }, |
| 1303 | stack: after.stacks.get(stackId)!, |
| 1304 | layout: after, |
| 1305 | bounds, |
| 1306 | }); |
| 1307 | expect(opened.key).toBe("open"); |
| 1308 | expect(opened.glide).toBe(true); |
| 1309 | // The canvas only grows, to show what opened, and never past its bound. |
| 1310 | expect(opened.height).toBeGreaterThanOrEqual(size.height); |
| 1311 | expect(opened.height).toBeLessThanOrEqual(bounds.max); |
| 1312 | // The scale holds, and the card and every machine beside it stay where they were. |
| 1313 | expect(opened.view).toEqual(fit); |
| 1314 | expect(onScreen(opened.view, after.nodes.get(node("nucbox"))!)).toEqual( |
| 1315 | onScreen(fit, before.nodes.get(node("nucbox"))!), |
| 1316 | ); |
| 1317 | const tray = after.stacks.get(stackId)!.rect; |
| 1318 | expect(onScreen(opened.view, tray).x + tray.width * opened.view.scale).toBeLessThanOrEqual( |
| 1319 | width, |
| 1320 | ); |
| 1321 | |
| 1322 | // Zoomed in until the stack is wider than the canvas, the view shrinks to its width, once. |
| 1323 | const close = { x: fit.x - 600, y: fit.y, scale: 6 }; |
| 1324 | const shrunk = anchorFleetView({ |
| 1325 | key: "open", |
| 1326 | from: { key: "closed", held: null, view: close, size, face }, |
| 1327 | stack: after.stacks.get(stackId)!, |
| 1328 | layout: after, |
| 1329 | bounds, |
| 1330 | }); |
| 1331 | expect(shrunk.view.scale).toBeLessThan(6); |
| 1332 | expect(onScreen(shrunk.view, tray).x).toBeGreaterThanOrEqual(0); |
| 1333 | expect(onScreen(shrunk.view, tray).x + tray.width * shrunk.view.scale).toBeLessThanOrEqual( |
| 1334 | width, |
| 1335 | ); |
| 1336 | expect(onScreen(shrunk.view, face).y).toBeCloseTo(onScreen(close, face).y); |
| 1337 | |
| 1338 | // Closing it again goes back to the fit it came from. |
| 1339 | const back = anchorFleetView({ |
| 1340 | key: "closed", |
| 1341 | from: { key: "open", held: opened, view: opened.view, size, face }, |
| 1342 | stack: before.stacks.get(stackId)!, |
| 1343 | layout: before, |
| 1344 | bounds, |
| 1345 | }); |
| 1346 | expect(back.key).toBe(""); |
| 1347 | expect(back.glide).toBe(true); |
| 1348 | |
| 1349 | // After a pan the view is the user's: closing keeps the card under the pointer instead. |
| 1350 | const panned = { ...opened, view: { ...opened.view, x: opened.view.x - 40 }, undo: null }; |
| 1351 | const closedAgain = anchorFleetView({ |
| 1352 | key: "closed", |
| 1353 | from: { key: "open", held: panned, view: panned.view, size, face }, |
| 1354 | stack: before.stacks.get(stackId)!, |
| 1355 | layout: before, |
| 1356 | bounds, |
| 1357 | }); |
| 1358 | expect(closedAgain.key).toBe("closed"); |
| 1359 | expect(closedAgain.view.scale).toBe(panned.view.scale); |
| 1360 | expect(onScreen(closedAgain.view, face)).toEqual(onScreen(panned.view, face)); |
| 1361 | expect(closedAgain.height).toBeLessThanOrEqual(size.height); |
| 1362 | // The canvas that grew for the tray gives that room back, not just the pre-open size. |
| 1363 | const grown = { width, height: opened.height }; |
| 1364 | const givenBack = anchorFleetView({ |
| 1365 | key: "closed", |
| 1366 | from: { key: "open", held: panned, view: panned.view, size: grown, face }, |
| 1367 | stack: before.stacks.get(stackId)!, |
| 1368 | layout: before, |
| 1369 | bounds, |
| 1370 | }); |
| 1371 | expect(givenBack.height).toBeLessThan(opened.height); |
| 1372 | } |
| 1373 | }); |
| 1374 | |
| 1375 | it("returns to a view set by hand before the stack opened", () => { |
| 1376 | const graph = largeSetup(); |
| 1377 | const closed = fleetStacks(graph, new Set()); |
| 1378 | const stackId = closed[0]!.id; |
| 1379 | const before = layoutFleetGraph(graph, closed, 1400); |
| 1380 | const after = layoutFleetGraph(graph, fleetStacks(graph, new Set([stackId])), 1400); |
| 1381 | const bounds = { min: 180, max: 840 }; |
| 1382 | const size = { width: 1400, height: 500 }; |
| 1383 | const held = { |
| 1384 | key: "closed", |
| 1385 | view: { x: -120, y: 30, scale: 1.4 }, |
| 1386 | height: 500, |
| 1387 | glide: false, |
| 1388 | undo: null, |
| 1389 | }; |
| 1390 | const face = before.stacks.get(stackId)!.face; |
| 1391 | const opened = anchorFleetView({ |
| 1392 | key: "open", |
| 1393 | from: { key: "closed", held, view: held.view, size, face }, |
| 1394 | stack: after.stacks.get(stackId)!, |
| 1395 | layout: after, |
| 1396 | bounds, |
| 1397 | }); |
| 1398 | expect(opened.view.scale).toBe(1.4); |
| 1399 | const back = anchorFleetView({ |
| 1400 | key: "closed", |
| 1401 | from: { key: "open", held: opened, view: opened.view, size, face }, |
| 1402 | stack: before.stacks.get(stackId)!, |
| 1403 | layout: before, |
| 1404 | bounds, |
| 1405 | }); |
| 1406 | expect(back).toEqual({ ...held, glide: true }); |
| 1407 | }); |
| 1408 | |
| 1409 | it("zooms around the anchor", () => { |
| 1410 | const view = zoomFleetView({ x: 10, y: 20, scale: 1 }, 2, { x: 100, y: 100 }); |
| 1411 | expect(view).toEqual({ scale: 2, x: -80, y: -60 }); |
| 1412 | }); |
| 1413 | }); |