@yuneta/gobj-ui 7.23.156 → 7.23.158

package/src/treedb_elbow.test.js

@@ -7,10 +7,8 @@
  ***********************************************************************/
 import { describe, test, expect } from "vitest";
 import {
-    elbow_lane, elbow_points, elbow_route, elbow_path_hits, elbow_rank, elbow_combs,
-    curve_hits, rounded_path, ELBOW_STEP, ELBOW_CLEAR,
+    elbow_lane, elbow_points, elbow_route, elbow_path_hits, ELBOW_STEP, ELBOW_CLEAR,
 } from "./treedb_elbow.js";
-import { layout_compact } from "./treedb_layout.js";
 
 /*  Two cards 100x40: A on top, B one row below it.  */
 const A = {x1: 0, y1: 0, x2: 100, y2: 40};
@@ -167,239 +165,6 @@ describe("the route round the other cards", () => {
     });
 });
 
-describe("edges sharing an end are staggered", () => {
-    test("the rank is farthest first, a tie to the edge made first", () => {
-        let items = [{id: "e-3", span: 10}, {id: "e-1", span: 300}, {id: "e-2", span: 10}];
-        expect(elbow_rank(items, "e-1")).toEqual({rank: 0, count: 3});
-        expect(elbow_rank(items, "e-2")).toEqual({rank: 1, count: 3});
-        expect(elbow_rank(items, "e-3")).toEqual({rank: 2, count: 3});
-    });
-
-    /*  One parent on top (port at x 50, bottom at 40) and a row of
-     *  children below (tops at 130).  */
-    const P = {x1: 0, y1: 0, x2: 100, y2: 40};
-    const PORT = [50, 40];
-    const KIDS = [50, 160, 290, 420, -120].map((x, i) => ({
-        id: `e-${i + 1}`, x: x, box: {x1: x - 50, y1: 130, x2: x + 50, y2: 170},
-    }));
-    const channel_of = (kid) => {
-        let items = KIDS.map((k) => ({id: k.id, span: Math.abs(k.x - PORT[0])}));
-        let dep = elbow_rank(items, kid.id);
-        return elbow_points(PORT, [kid.x, 130], P, kid.box, 0, true, {dep: dep})[0][1];
-    };
-
-    test("the children of one port turn each at its own height, inside the channel", () => {
-        let ys = KIDS.map(channel_of);
-        expect(new Set(ys).size).toBe(KIDS.length);
-        for(let y of ys) {
-            expect(y).toBeGreaterThan(40);
-            expect(y).toBeLessThan(130);
-        }
-    });
-
-    test("the farthest turns highest, and the lines of one port do not cross", () => {
-        let y = Object.fromEntries(KIDS.map((k) => [k.id, channel_of(k)]));
-        expect(y["e-4"]).toBeLessThan(y["e-2"]);        /*  420 is farther than 160  */
-        /*  A crossing: one edge's drop (at its child's x, from its turn
-         *  down to the row) cut by another's run (from the port to its
-         *  child, at its own turn).  */
-        for(let a of KIDS) {
-            for(let b of KIDS) {
-                if(a === b) {
-                    continue;
-                }
-                let lo = Math.min(PORT[0], b.x);
-                let hi = Math.max(PORT[0], b.x);
-                let cuts = a.x > lo && a.x < hi && y[b.id] > y[a.id] && y[b.id] < 130;
-                expect(cuts).toBe(false);
-            }
-        }
-    });
-
-    test("the parents of one card: the farthest turns lowest, and they do not cross", () => {
-        /*  Parents on top at these x (port at the middle of each bottom),
-         *  one child below at x 200 whose fkeys all enter at its top.  */
-        const C = {x1: 150, y1: 130, x2: 250, y2: 170};
-        const T0 = [200, 130];
-        const PARENTS = [0, 120, 330, 560].map((x, i) => ({id: `p-${i + 1}`, x: x}));
-        let items = PARENTS.map((p) => ({id: p.id, span: Math.abs(p.x - T0[0])}));
-        let y = {};
-        for(let p of PARENTS) {
-            let box = {x1: p.x - 50, y1: 0, x2: p.x + 50, y2: 40};
-            let arr = elbow_rank(items, p.id);
-            y[p.id] = elbow_points([p.x, 40], T0, box, C, 0, true, {arr: arr})[0][1];
-        }
-        expect(new Set(Object.values(y)).size).toBe(PARENTS.length);
-        expect(y["p-4"]).toBeGreaterThan(y["p-2"]);     /*  560 is farther than 120  */
-        /*  A crossing: one parent's drop (at its x, from its row down to
-         *  its turn) cut by another's run (from its x to the child).  */
-        for(let a of PARENTS) {
-            for(let b of PARENTS) {
-                if(a === b) {
-                    continue;
-                }
-                let lo = Math.min(b.x, T0[0]);
-                let hi = Math.max(b.x, T0[0]);
-                let cuts = a.x > lo && a.x < hi && y[b.id] > 40 && y[b.id] < y[a.id];
-                expect(cuts).toBe(false);
-            }
-        }
-    });
-
-    test("a routed edge leaves and reaches its ports sideways, sharing only the stub", () => {
-        /*  A same-row edge from A to C, with D standing between them:
-         *  it is routed. It must not run down the column over C's
-         *  port, which is where a forward edge into C drops.  */
-        const A2 = {x1: 0, y1: 200, x2: 100, y2: 240};
-        const D2 = {x1: 150, y1: 180, x2: 250, y2: 260};
-        const C2 = {x1: 300, y1: 200, x2: 400, y2: 240};
-        let s = [50, 240];
-        let t = [350, 200];
-        let boxes = [A2, D2, C2];
-        let route = elbow_route(s, t, A2, C2, 0, true, boxes);
-        expect(route.length).toBeGreaterThan(2);
-        expect(elbow_path_hits([s, ...route, t], boxes, A2, C2)).toBe(false);
-        let a = route[0];
-        let z = route[route.length - 1];
-        expect(route[1][1]).toBe(a[1]);                     /*  leaves a sideways  */
-        expect(route[route.length - 2][1]).toBe(z[1]);      /*  reaches z sideways  */
-        expect(t[1] - z[1]).toBeLessThan(20);               /*  the stub is short  */
-    });
-
-    test("an end shared by nobody keeps the middle", () => {
-        let one = {rank: 0, count: 1};
-        expect(elbow_points(PORT, [160, 130], P, KIDS[1].box, 0, true, {dep: one, arr: one}))
-            .toEqual(elbow_points(PORT, [160, 130], P, KIDS[1].box, 0, true));
-    });
-});
-
-describe("the comb of a stack", () => {
-    /*  A parent over eight leaves, laid out by the compact tree (a
-     *  stack: four rows of two). Boxes as the graph measures them,
-     *  with 14px ports sticking 7px out of the top and bottom.  */
-    const P = {id: "p", w: 172, h: 96};
-    const LEAVES = [0, 1, 2, 3, 4, 5, 6, 7].map((i) => ({id: `l${i}`, w: 116, h: 40}));
-    const pos = layout_compact([P, ...LEAVES], LEAVES.map((l) => ({source: "p", target: l.id})),
-                               {nodesep: 18, ranksep: 90});
-    const box = (n) => {
-        let c = pos.get(n.id);
-        return {x1: c.x - n.w / 2, y1: c.y - n.h / 2 - 7, x2: c.x + n.w / 2, y2: c.y + n.h / 2 + 7};
-    };
-    const BOX_P = box(P);
-    const PORT = [pos.get("p").x, pos.get("p").y + 48];
-    const targets = LEAVES.map((l, i) => ({id: `e-${i + 1}`, box: box(l), leaf: l}));
-    const combs = elbow_combs(targets.map((t) => ({id: t.id, box: t.box})), true);
-    const paths = targets.map((t) => {
-        let comb = combs.get(t.id) || null;
-        let items = targets.map((u) => {
-            let c = combs.get(u.id);
-            let far = c? c.lane : pos.get(u.leaf.id).x;
-            return {id: u.id, span: Math.abs(far - PORT[0])};
-        });
-        let end = [pos.get(t.leaf.id).x, t.box.y1 + 7];
-        let pts = elbow_points(PORT, end, BOX_P, t.box, 0, true,
-                               {dep: elbow_rank(items, t.id), comb: comb});
-        return {id: t.id, box: t.box, full: [PORT, ...pts, end]};
-    });
-
-    test("only the cards under another card get a comb", () => {
-        expect(combs.size).toBe(6);
-        expect(combs.has("e-1")).toBe(false);
-        expect(combs.has("e-2")).toBe(false);
-    });
-
-    test("no line crosses a card", () => {
-        let all = [BOX_P, ...targets.map((t) => t.box)];
-        for(let p of paths) {
-            expect(elbow_path_hits(p.full, all, BOX_P, p.box)).toBe(false);
-        }
-    });
-
-    test("no two lines lie on each other past the stub of the port", () => {
-        /*  Two axis-aligned segments overlap when they are on one line
-         *  and share more than a point of it.  */
-        let overlap = (a, b, c, d) => {
-            let va = a[0] === b[0];
-            let vc = c[0] === d[0];
-            let ha = a[1] === b[1];
-            let hc = c[1] === d[1];
-            if(va && vc && Math.abs(a[0] - c[0]) < 0.5) {
-                return Math.min(Math.max(a[1], b[1]), Math.max(c[1], d[1])) -
-                       Math.max(Math.min(a[1], b[1]), Math.min(c[1], d[1])) > 0.5;
-            }
-            if(ha && hc && Math.abs(a[1] - c[1]) < 0.5) {
-                return Math.min(Math.max(a[0], b[0]), Math.max(c[0], d[0])) -
-                       Math.max(Math.min(a[0], b[0]), Math.min(c[0], d[0])) > 0.5;
-            }
-            return false;
-        };
-        for(let i = 0; i < paths.length; i++) {
-            for(let j = i + 1; j < paths.length; j++) {
-                let A = paths[i].full;
-                let B = paths[j].full;
-                for(let m = 1; m + 1 < A.length; m++) {
-                    for(let n = 1; n + 1 < B.length; n++) {
-                        expect(overlap(A[m], A[m + 1], B[n], B[n + 1])).toBe(false);
-                    }
-                }
-            }
-        }
-    });
-
-    test("a comb is drawn as laid out, not routed", () => {
-        let t = targets[6];
-        let c = combs.get(t.id);
-        let end = [pos.get(t.leaf.id).x, t.box.y1 + 7];
-        let st = {comb: c};
-        expect(elbow_route(PORT, end, BOX_P, t.box, 0, true, [BOX_P, ...targets.map((u) => u.box)], st))
-            .toEqual(elbow_points(PORT, end, BOX_P, t.box, 0, true, st));
-    });
-});
-
-describe("a curve that would cross a card", () => {
-    /*  Whole-node boxes (ports 7px out of top and bottom).  */
-    const PB = {x1: 0, y1: -7, x2: 172, y2: 103};         /*  a parent  */
-    const R0 = {x1: 0, y1: 183, x2: 116, y2: 237};        /*  row 0 of a stack  */
-    const R1 = {x1: 0, y1: 277, x2: 116, y2: 331};        /*  row 1, under it  */
-    const SIB = {x1: 200, y1: -7, x2: 372, y2: 103};      /*  the parent's sibling  */
-    const S = [86, 96];
-
-    /*  The cubic G6 draws between two vertical ports: tangents along
-     *  the line, as its default curveOffset gives.  */
-    const cubic = (s, t) => [["M", s[0], s[1]],
-                             ["C", s[0], (s[1] + t[1]) / 2, t[0], (s[1] + t[1]) / 2, t[0], t[1]]];
-
-    test("a curve into a card of the next row crosses nothing", () => {
-        expect(curve_hits(cubic(S, [58, 190]), [PB, R0, R1, SIB], PB, R0)).toBe(false);
-    });
-
-    test("a curve into a lower row of a stack crosses the card above it", () => {
-        expect(curve_hits(cubic(S, [58, 284]), [PB, R0, R1, SIB], PB, R1)).toBe(true);
-    });
-
-    test("a curve that passes NEAR a card, beside its ports, does not count", () => {
-        /*  N0 in the target row with its port poking 7px up, beside
-         *  where the curve lands; the rectangle round the curve took it.  */
-        const T0 = {x1: 250, y1: 183, x2: 366, y2: 237};
-        const N0 = {x1: 120, y1: 183, x2: 236, y2: 237};
-        expect(curve_hits(cubic(S, [308, 190]), [PB, SIB, T0, N0], PB, T0)).toBe(false);
-    });
-
-    test("the rounded path: a straight line is one run", () => {
-        expect(rounded_path([[0, 0], [0, 100]], 24)).toEqual([["M", 0, 0], ["L", 0, 100]]);
-    });
-
-    test("the rounded path: each corner a quadratic, never past half a short run", () => {
-        let path = rounded_path([[0, 0], [0, 60], [100, 60], [100, 70]], 24);
-        expect(path[0]).toEqual(["M", 0, 0]);
-        expect(path[1]).toEqual(["L", 0, 36]);                  /*  24 before the corner  */
-        expect(path[2]).toEqual(["Q", 0, 60, 24, 60]);
-        expect(path[3]).toEqual(["L", 95, 60]);                 /*  the last run is 10: r = 5  */
-        expect(path[4]).toEqual(["Q", 100, 60, 100, 65]);
-        expect(path[5]).toEqual(["L", 100, 70]);
-    });
-});
-
 describe("the ports are obstacles too", () => {
     /*  Whole-node boxes: a port of 14px sticks 7px out of the bottom
      *  and the top of each card.  */