@tuprolog/arg2p-ui 0.0.0-stage → 0.1.0

package/dist/graph/layout.js

@@ -0,0 +1,167 @@
+// A compact layered drawing of an argument graph: every argument on the row of its level (facts at the bottom), each
+// close to the arguments it is linked to, and never closer than `spacing` to its neighbours on the row.
+//
+// `levels` maps every id to its row, `links` are the supports (from a sub-argument to the argument built on it) and
+// `attacks` the attacks. Supports decide the rows and pull hardest; attacks pull too, more lightly, so that attackers
+// sit near what they attack.
+const SWEEPS = 4;
+const ATTACK_WEIGHT = 0.4;
+const STAGGER_SQUEEZE = 0.55;
+const STAGGER_DROP = 0.4;
+const MAX_STRETCH = 2.4;
+// the free room above and below a row, for the edges
+const ROW_GAP = 40;
+/** The position of every argument of [levels] */
+export function layeredLayout(levels, links, options = {}) {
+    const { spacing = 110, levelSeparation = 110, attacks = [], aspect = null, staggerFrom = 8, sizes = null, gap = 18 } = options;
+    const size = (id) => sizes?.get(id) ?? { width: 0, height: 0 };
+    const metrics = { spacing, levelSeparation, staggerFrom, size, sized: sizes !== null, gap };
+    // The separate parts of the graph are laid out on their own and then put side by side, largest first, so that
+    // none of them drifts away from the others
+    const positions = new Map();
+    let offset = 0;
+    components(levels, [...links, ...attacks]).forEach(ids => {
+        const part = layoutComponent(ids, levels, links, attacks, metrics);
+        const left = Math.min(...ids.map(id => part.get(id).x - size(id).width / 2));
+        const right = Math.max(...ids.map(id => part.get(id).x + size(id).width / 2));
+        part.forEach((point, id) => positions.set(id, { x: point.x - left + offset, y: point.y }));
+        offset += right - left + (sizes ? gap * 2 : spacing);
+    });
+    if (aspect !== null && positions.size > 1)
+        stretchRows(positions, aspect);
+    return positions;
+}
+function layoutComponent(ids, levels, links, attacks, metrics) {
+    const { spacing, levelSeparation, staggerFrom, size, sized, gap } = metrics;
+    const inside = new Set(ids);
+    const rows = [];
+    ids.forEach(id => {
+        const level = levels.get(id);
+        (rows[level] = rows[level] ?? []).push(id);
+    });
+    for (let i = 0; i < rows.length; i++)
+        rows[i] = (rows[i] ?? []).sort(byNumber);
+    const staggered = rows.map(row => row.length > staggerFrom);
+    // The least distance between the centres of two neighbours on a row: by their widths when known. On a zig-zag
+    // row, next neighbours sit at different heights and may come closer; the ones after them may not.
+    const apart = (a, b) => (sized ? (size(a).width + size(b).width) / 2 + gap : spacing);
+    const rowDistances = rows.map((_, level) => staggered[level] ? { next: (a, b) => apart(a, b) * STAGGER_SQUEEZE, second: apart } : { next: apart, second: null });
+    const own = (list) => list.filter(it => inside.has(it.from) && inside.has(it.to));
+    const supportsBelow = neighbours(own(links), 'to', 'from');
+    const supportsAbove = neighbours(own(links), 'from', 'to');
+    // attacks pull both ways, whatever row their ends are on
+    const attacked = new Map();
+    [...neighbours(own(attacks), 'from', 'to'), ...neighbours(own(attacks), 'to', 'from')].forEach(([id, list]) => attacked.set(id, [...(attacked.get(id) ?? []), ...list]));
+    // Evenly spaced rows to start with, then every row placed by the one below (its sub-arguments) and by the one
+    // above (what it supports), in turn
+    const x = new Map();
+    rows.forEach(row => row.forEach((id, i) => x.set(id, i * spacing)));
+    for (let sweep = 0; sweep < SWEEPS; sweep++) {
+        for (let level = 1; level < rows.length; level++)
+            placeRow(rows[level], supportsBelow, attacked, x, rowDistances[level]);
+        for (let level = rows.length - 2; level >= 0; level--)
+            placeRow(rows[level], supportsAbove, attacked, x, rowDistances[level]);
+    }
+    for (let level = 1; level < rows.length; level++)
+        placeRow(rows[level], supportsBelow, attacked, x, rowDistances[level]);
+    // The rows from the bottom up: a zig-zag row drops every other node by enough for the two halves not to overlap,
+    // and rows are kept apart by their heights (and at least levelSeparation)
+    const tallest = (row) => Math.max(0, ...row.map(id => size(id).height));
+    const drops = rows.map((row, level) => staggered[level] ? Math.max(levelSeparation * STAGGER_DROP, sized ? tallest(row) + gap / 2 : 0) : 0);
+    const positions = new Map();
+    let y = 0;
+    rows.forEach((row, level) => {
+        if (level > 0) {
+            const below = tallest(rows[level - 1]) / 2 + drops[level - 1];
+            const above = tallest(row) / 2;
+            y -= Math.max(levelSeparation, below + above + (sized ? ROW_GAP : 0) + drops[level]);
+        }
+        row
+            .slice()
+            .sort((a, b) => x.get(a) - x.get(b))
+            .forEach((id, i) => positions.set(id, { x: x.get(id), y: y + (staggered[level] && i % 2 === 1 ? drops[level] : 0) }));
+    });
+    return positions;
+}
+// The rows moved apart (never closer) until the drawing has the proportions of the area it is shown in, up to
+// MAX_STRETCH times the normal separation
+function stretchRows(positions, aspect) {
+    const xs = [...positions.values()].map(it => it.x);
+    const ys = [...positions.values()].map(it => it.y);
+    const width = Math.max(...xs) - Math.min(...xs);
+    const height = Math.max(...ys) - Math.min(...ys);
+    if (height === 0 || width === 0)
+        return;
+    const stretch = Math.min(MAX_STRETCH, Math.max(1, (aspect * width) / height));
+    positions.forEach(point => {
+        point.y *= stretch;
+    });
+}
+// The connected parts of the graph, largest first (ties: the lowest argument first)
+function components(levels, edges) {
+    const parent = new Map([...levels.keys()].map(id => [id, id]));
+    const find = (id) => {
+        const up = parent.get(id);
+        if (up === id)
+            return id;
+        const root = find(up);
+        parent.set(id, root);
+        return root;
+    };
+    edges.forEach(it => {
+        if (parent.has(it.from) && parent.has(it.to))
+            parent.set(find(it.from), find(it.to));
+    });
+    const groups = new Map();
+    [...levels.keys()].sort(byNumber).forEach(id => {
+        const root = find(id);
+        if (!groups.has(root))
+            groups.set(root, []);
+        groups.get(root).push(id);
+    });
+    return [...groups.values()].sort((a, b) => b.length - a.length || byNumber(a[0], b[0]));
+}
+function neighbours(links, key, value) {
+    const map = new Map();
+    links.forEach(link => {
+        if (!map.has(link[key]))
+            map.set(link[key], []);
+        map.get(link[key]).push(link[value]);
+    });
+    return map;
+}
+// A row ordered by where its nodes would like to be (the weighted mean x of the nodes they are linked to, or where
+// they are when they have none), then placed left to right no closer than [distances] allow, and shifted back so that,
+// on average, the nodes are where they wanted to be
+function placeRow(row, supports, attacks, x, distances) {
+    if (row.length === 0)
+        return;
+    const wanted = new Map(row.map(id => {
+        const pulls = [
+            ...(supports.get(id) ?? []).filter(it => x.has(it)).map((it) => [x.get(it), 1]),
+            ...(attacks.get(id) ?? []).filter(it => x.has(it)).map((it) => [x.get(it), ATTACK_WEIGHT]),
+        ];
+        const weight = pulls.reduce((sum, [, w]) => sum + w, 0);
+        return [id, weight > 0 ? pulls.reduce((sum, [at, w]) => sum + at * w, 0) / weight : x.get(id)];
+    }));
+    row.sort((a, b) => wanted.get(a) - wanted.get(b) || byNumber(a, b));
+    const placed = [];
+    row.forEach((id, i) => {
+        let at = wanted.get(id);
+        if (i > 0)
+            at = Math.max(at, placed[i - 1] + distances.next(row[i - 1], id));
+        if (i > 1 && distances.second)
+            at = Math.max(at, placed[i - 2] + distances.second(row[i - 2], id));
+        placed.push(at);
+    });
+    const shift = mean(row.map((id, i) => wanted.get(id) - placed[i]));
+    row.forEach((id, i) => x.set(id, placed[i] + shift));
+}
+function mean(values) {
+    return values.reduce((sum, it) => sum + it, 0) / values.length;
+}
+// A2 before A10
+function byNumber(a, b) {
+    return parseInt(a.substring(1)) - parseInt(b.substring(1)) || a.localeCompare(b);
+}
+//# sourceMappingURL=layout.js.map

package/dist/graph/layout.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"layout.js","sourceRoot":"","sources":["../../src/graph/layout.ts"],"names":[],"mappings":"AAAA,qHAAqH;AACrH,wGAAwG;AACxG,EAAE;AACF,oHAAoH;AACpH,sHAAsH;AACtH,6BAA6B;AAgC7B,MAAM,MAAM,GAAG,CAAC,CAAC;AACjB,MAAM,aAAa,GAAG,GAAG,CAAC;AAC1B,MAAM,eAAe,GAAG,IAAI,CAAC;AAC7B,MAAM,YAAY,GAAG,GAAG,CAAC;AACzB,MAAM,WAAW,GAAG,GAAG,CAAC;AACxB,qDAAqD;AACrD,MAAM,OAAO,GAAG,EAAE,CAAC;AAgBnB,iDAAiD;AACjD,MAAM,UAAU,aAAa,CAAC,MAAmC,EAAE,KAAsB,EAAE,OAAO,GAAkB,EAAE;IAClH,MAAM,EAAE,OAAO,GAAG,GAAG,EAAE,eAAe,GAAG,GAAG,EAAE,OAAO,GAAG,EAAE,EAAE,MAAM,GAAG,IAAI,EAAE,WAAW,GAAG,CAAC,EAAE,KAAK,GAAG,IAAI,EAAE,GAAG,GAAG,EAAE,EAAE,GAAG,OAAO,CAAC;IAC/H,MAAM,IAAI,GAAG,CAAC,EAAU,EAAQ,EAAE,CAAC,KAAK,EAAE,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;IAC7E,MAAM,OAAO,GAAY,EAAE,OAAO,EAAE,eAAe,EAAE,WAAW,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,KAAK,IAAI,EAAE,GAAG,EAAE,CAAC;IAErG,8GAA8G;IAC9G,2CAA2C;IAC3C,MAAM,SAAS,GAAG,IAAI,GAAG,EAAiB,CAAC;IAC3C,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,UAAU,CAAC,MAAM,EAAE,CAAC,GAAG,KAAK,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE;QACrD,MAAM,IAAI,GAAG,eAAe,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;QACnE,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;QAC9E,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;QAC/E,IAAI,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,IAAI,GAAG,MAAM,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC3F,MAAM,IAAI,KAAK,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;IAEH,IAAI,MAAM,KAAK,IAAI,IAAI,SAAS,CAAC,IAAI,GAAG,CAAC;QAAE,WAAW,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;IAC1E,OAAO,SAAS,CAAC;AACrB,CAAC;AAED,SAAS,eAAe,CAAC,GAAa,EAAE,MAAmC,EAAE,KAAsB,EAAE,OAAwB,EAAE,OAAgB;IAC3I,MAAM,EAAE,OAAO,EAAE,eAAe,EAAE,WAAW,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,OAAO,CAAC;IAC5E,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC;IAC5B,MAAM,IAAI,GAAe,EAAE,CAAC;IAC5B,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE;QACb,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;QAC9B,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IACH,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE;QAAE,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC/E,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,MAAM,GAAG,WAAW,CAAC,CAAC;IAC5D,8GAA8G;IAC9G,kGAAkG;IAClG,MAAM,KAAK,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;IACtG,MAAM,YAAY,GAAgB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,CACpD,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,eAAe,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,CACtH,CAAC;IAEF,MAAM,GAAG,GAAG,CAAC,IAAqB,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACnG,MAAM,aAAa,GAAG,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;IAC3D,MAAM,aAAa,GAAG,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;IAC3D,yDAAyD;IACzD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC7C,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,GAAG,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,CAC1G,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,GAAG,IAAI,CAAC,CAAC,CAC3D,CAAC;IAEF,8GAA8G;IAC9G,oCAAoC;IACpC,MAAM,CAAC,GAAG,IAAI,GAAG,EAAkB,CAAC;IACpC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;IACpE,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC;QAC1C,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE;YAAE,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,aAAa,EAAE,QAAQ,EAAE,CAAC,EAAE,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC;QACzH,KAAK,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,KAAK,EAAE;YAAE,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,aAAa,EAAE,QAAQ,EAAE,CAAC,EAAE,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC;IAClI,CAAC;IACD,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE;QAAE,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,aAAa,EAAE,QAAQ,EAAE,CAAC,EAAE,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC;IAEzH,iHAAiH;IACjH,0EAA0E;IAC1E,MAAM,OAAO,GAAG,CAAC,GAAa,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;IAClF,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAClC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,eAAe,GAAG,YAAY,EAAE,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CACtG,CAAC;IACF,MAAM,SAAS,GAAG,IAAI,GAAG,EAAiB,CAAC;IAC3C,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE;QACxB,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;YACZ,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;YAC9D,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAC/B,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,eAAe,EAAE,KAAK,GAAG,KAAK,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;QACzF,CAAC;QACD,GAAG;aACE,KAAK,EAAE;aACP,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC;aACrC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAE,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC/H,CAAC,CAAC,CAAC;IACH,OAAO,SAAS,CAAC;AACrB,CAAC;AAED,8GAA8G;AAC9G,0CAA0C;AAC1C,SAAS,WAAW,CAAC,SAA6B,EAAE,MAAc;IAC9D,MAAM,EAAE,GAAG,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACnD,MAAM,EAAE,GAAG,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACnD,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC;IAChD,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC;IACjD,IAAI,MAAM,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC;QAAE,OAAO;IACxC,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,MAAM,GAAG,KAAK,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;IAC9E,SAAS,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;QACtB,KAAK,CAAC,CAAC,IAAI,OAAO,CAAC;IACvB,CAAC,CAAC,CAAC;AACP,CAAC;AAED,oFAAoF;AACpF,SAAS,UAAU,CAAC,MAAmC,EAAE,KAAsB;IAC3E,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IAC/D,MAAM,IAAI,GAAG,CAAC,EAAU,EAAU,EAAE;QAChC,MAAM,EAAE,GAAG,MAAM,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;QAC3B,IAAI,EAAE,KAAK,EAAE;YAAE,OAAO,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC;QACtB,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QACrB,OAAO,IAAI,CAAC;IAChB,CAAC,CAAC;IACF,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE;QACf,IAAI,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YAAE,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACzF,CAAC,CAAC,CAAC;IACH,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC3C,CAAC,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE;QAC3C,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC;QACtB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QAC5C,MAAM,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;IACH,OAAO,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC5F,CAAC;AAED,SAAS,UAAU,CAAC,KAAsB,EAAE,GAAkB,EAAE,KAAoB;IAChF,MAAM,GAAG,GAAG,IAAI,GAAG,EAAoB,CAAC;IACxC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;QACjB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAAE,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC;QAChD,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;IACH,OAAO,GAAG,CAAC;AACf,CAAC;AAED,mHAAmH;AACnH,uHAAuH;AACvH,oDAAoD;AACpD,SAAS,QAAQ,CAAC,GAAa,EAAE,QAA+B,EAAE,OAA8B,EAAE,CAAsB,EAAE,SAAoB;IAC1I,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO;IAC7B,MAAM,MAAM,GAAG,IAAI,GAAG,CAClB,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QACT,MAAM,KAAK,GAAuB;YAC9B,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAoB,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAE,EAAE,CAAC,CAAC,CAAC;YAClG,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAoB,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAE,EAAE,aAAa,CAAC,CAAC;SAChH,CAAC;QACF,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QACxD,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC,CAAC;IACpG,CAAC,CAAC,CACL,CAAC;IACF,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAE,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAE,IAAI,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACtE,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE;QAClB,IAAI,EAAE,GAAG,MAAM,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;QACzB,IAAI,CAAC,GAAG,CAAC;YAAE,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAC7E,IAAI,CAAC,GAAG,CAAC,IAAI,SAAS,CAAC,MAAM;YAAE,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACnG,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACpB,CAAC,CAAC,CAAC;IACH,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACpE,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;AACzD,CAAC;AAED,SAAS,IAAI,CAAC,MAAgB;IAC1B,OAAO,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,GAAG,GAAG,EAAE,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;AACnE,CAAC;AAED,gBAAgB;AAChB,SAAS,QAAQ,CAAC,CAAS,EAAE,CAAS;IAClC,OAAO,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;AACrF,CAAC"}

package/dist/graph/levels.d.ts

@@ -0,0 +1,6 @@
+import type { ArgumentData } from '../engine.js';
+import type { Link } from './layout.js';
+/** The supports between the arguments of a graph: every argument from each of those it is built on */
+export declare function supportsOf(argumentList: readonly ArgumentData[]): Link[];
+/** The row of every argument in a layered drawing: facts on row 0, an argument one row above the highest it is built on */
+export declare function levelsOf(argumentList: readonly ArgumentData[]): Map<string, number>;

package/dist/graph/levels.js

@@ -0,0 +1,25 @@
+/** The supports between the arguments of a graph: every argument from each of those it is built on */
+export function supportsOf(argumentList) {
+    const ids = new Set(argumentList.map(it => it.id));
+    return argumentList.flatMap(it => it.supports.filter(sub => ids.has(sub)).map(sub => ({ from: sub, to: it.id })));
+}
+/** The row of every argument in a layered drawing: facts on row 0, an argument one row above the highest it is built on */
+export function levelsOf(argumentList) {
+    const supports = new Map(argumentList.map(it => [it.id, it.supports]));
+    const levels = new Map();
+    const levelOf = (id, visiting) => {
+        if (levels.has(id))
+            return levels.get(id);
+        // sub-arguments missing from the graph, or (defensively) a cycle, do not raise the level
+        if (!supports.has(id) || visiting.has(id))
+            return -1;
+        visiting.add(id);
+        const level = 1 + Math.max(-1, ...supports.get(id).map(sub => levelOf(sub, visiting)));
+        visiting.delete(id);
+        levels.set(id, level);
+        return level;
+    };
+    argumentList.forEach(it => levelOf(it.id, new Set()));
+    return levels;
+}
+//# sourceMappingURL=levels.js.map

package/dist/graph/levels.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"levels.js","sourceRoot":"","sources":["../../src/graph/levels.ts"],"names":[],"mappings":"AAGA,sGAAsG;AACtG,MAAM,UAAU,UAAU,CAAC,YAAqC;IAC5D,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACnD,OAAO,YAAY,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;AACtH,CAAC;AAED,2HAA2H;AAC3H,MAAM,UAAU,QAAQ,CAAC,YAAqC;IAC1D,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IACvE,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,MAAM,OAAO,GAAG,CAAC,EAAU,EAAE,QAAqB,EAAU,EAAE;QAC1D,IAAI,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,OAAO,MAAM,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;QAC3C,yFAAyF;QACzF,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,OAAO,CAAC,CAAC,CAAC;QACrD,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACjB,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC;QACxF,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACpB,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QACtB,OAAO,KAAK,CAAC;IACjB,CAAC,CAAC;IACF,YAAY,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC;IACtD,OAAO,MAAM,CAAC;AAClB,CAAC"}

package/dist/graph/positions.d.ts

@@ -0,0 +1,24 @@
+import type { Core, NodeSingular } from 'cytoscape';
+/** Where each argument is, by its name */
+export type Positions = Readonly<Record<string, {
+    readonly x: number;
+    readonly y: number;
+}>>;
+/**
+ * The nodes of [cy] placed where [positions] has them (by [nameOf]), the others laid out around them by forces (all of
+ * them anew when none is known). Whether any had to be laid out.
+ */
+export declare function placeByName(cy: Core, nameOf: (node: NodeSingular) => string, positions: Positions | null): boolean;
+/** Where the nodes of [cy] are, by [nameOf] */
+export declare function positionsOf(cy: Core, nameOf: (node: NodeSingular) => string): Positions;
+/** The edges of [cy] whose reverse is there too, as mutual attacks: they bend apart, so that both show */
+export declare function markMutual(cy: Core): void;
+/** The style of mutual attacks: each bends to its own side, so that they do not overlap */
+export declare const MUTUAL_STYLE: {
+    readonly selector: 'edge.mutual';
+    readonly style: {
+        readonly 'curve-style': 'unbundled-bezier';
+        readonly 'control-point-distances': 32;
+        readonly 'control-point-weights': 0.5;
+    };
+};

package/dist/graph/positions.js

@@ -0,0 +1,43 @@
+/**
+ * The nodes of [cy] placed where [positions] has them (by [nameOf]), the others laid out around them by forces (all of
+ * them anew when none is known). Whether any had to be laid out.
+ */
+export function placeByName(cy, nameOf, positions) {
+    const nodes = cy.nodes();
+    const known = nodes.filter(it => positions?.[nameOf(it)] !== undefined);
+    const unknown = nodes.not(known);
+    cy.batch(() => known.forEach(it => void it.position({ ...positions[nameOf(it)] })));
+    if (unknown.empty())
+        return false;
+    if (known.empty()) {
+        cy.layout({ name: 'cose', animate: false, randomize: true, fit: false }).run();
+        return true;
+    }
+    // the new ones start next to the arguments they are linked to, and only they move
+    unknown.forEach(node => {
+        const around = node.neighborhood('node').intersection(known);
+        const centre = around.nonempty() ? around.boundingBox() : known.boundingBox();
+        node.position({ x: (centre.x1 + centre.x2) / 2 + (Math.random() - 0.5) * 60, y: (centre.y1 + centre.y2) / 2 + (Math.random() - 0.5) * 60 });
+    });
+    known.lock();
+    cy.layout({ name: 'cose', animate: false, randomize: false, fit: false }).run();
+    known.unlock();
+    return true;
+}
+/** Where the nodes of [cy] are, by [nameOf] */
+export function positionsOf(cy, nameOf) {
+    return Object.fromEntries(cy.nodes().map(it => [nameOf(it), { ...it.position() }]));
+}
+/** The edges of [cy] whose reverse is there too, as mutual attacks: they bend apart, so that both show */
+export function markMutual(cy) {
+    cy.batch(() => cy.edges().forEach(edge => {
+        const reverse = cy.getElementById(`${edge.data('target')}->${edge.data('source')}`);
+        edge.toggleClass('mutual', reverse.nonempty() && !edge.hasClass('support'));
+    }));
+}
+/** The style of mutual attacks: each bends to its own side, so that they do not overlap */
+export const MUTUAL_STYLE = {
+    selector: 'edge.mutual',
+    style: { 'curve-style': 'unbundled-bezier', 'control-point-distances': 32, 'control-point-weights': 0.5 },
+};
+//# sourceMappingURL=positions.js.map

package/dist/graph/positions.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"positions.js","sourceRoot":"","sources":["../../src/graph/positions.ts"],"names":[],"mappings":"AAQA;;;GAGG;AACH,MAAM,UAAU,WAAW,CAAC,EAAQ,EAAE,MAAsC,EAAE,SAA2B;IACrG,MAAM,KAAK,GAAG,EAAE,CAAC,KAAK,EAAE,CAAC;IACzB,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC;IACxE,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACjC,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,QAAQ,CAAC,EAAE,GAAG,SAAU,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACrF,IAAI,OAAO,CAAC,KAAK,EAAE;QAAE,OAAO,KAAK,CAAC;IAClC,IAAI,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;QAChB,EAAE,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC;QAC/E,OAAO,IAAI,CAAC;IAChB,CAAC;IACD,kFAAkF;IAClF,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;QACnB,MAAM,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;QAC7D,MAAM,MAAM,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC;QAC9E,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC,MAAM,CAAC,EAAE,GAAG,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,CAAC,EAAE,GAAG,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;IAChJ,CAAC,CAAC,CAAC;IACH,KAAK,CAAC,IAAI,EAAE,CAAC;IACb,EAAE,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC;IAChF,KAAK,CAAC,MAAM,EAAE,CAAC;IACf,OAAO,IAAI,CAAC;AAChB,CAAC;AAED,+CAA+C;AAC/C,MAAM,UAAU,WAAW,CAAC,EAAQ,EAAE,MAAsC;IACxE,OAAO,MAAM,CAAC,WAAW,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;AACxF,CAAC;AAED,0GAA0G;AAC1G,MAAM,UAAU,UAAU,CAAC,EAAQ;IAC/B,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,CACV,EAAE,CAAC,KAAK,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;QACtB,MAAM,OAAO,GAAG,EAAE,CAAC,cAAc,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QACpF,IAAI,CAAC,WAAW,CAAC,QAAQ,EAAE,OAAO,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC;IAChF,CAAC,CAAC,CACL,CAAC;AACN,CAAC;AAED,2FAA2F;AAC3F,MAAM,CAAC,MAAM,YAAY,GAAG;IACxB,QAAQ,EAAE,aAAa;IACvB,KAAK,EAAE,EAAE,aAAa,EAAE,kBAAkB,EAAE,yBAAyB,EAAE,EAAE,EAAE,uBAAuB,EAAE,GAAG,EAAE;CACnG,CAAC"}

package/dist/index.d.ts

@@ -0,0 +1,8 @@
+export * from './data.js';
+export { tokens, labelColor } from './theme.js';
+export { Arg2pGraph, type Stages } from './components/arg2p-graph.js';
+export { Arg2pFramework } from './components/arg2p-framework.js';
+export { Arg2pSolutions, listItems } from './components/arg2p-solutions.js';
+export { Arg2pEditor, rangeOf, type EditorKind } from './components/arg2p-editor.js';
+export { Arg2pFlags, type Source } from './components/arg2p-flags.js';
+export { arg2p, arg2pLanguage } from './editor/language.js';

package/dist/index.js

@@ -0,0 +1,11 @@
+// The components of Arg2P, defined as they are imported, and what they are built on (also apart, with no component:
+// @tuprolog/arg2p-ui/data). The engine of the browser is apart (@tuprolog/arg2p-ui/js), as it brings the solver with it.
+export * from './data.js';
+export { tokens, labelColor } from './theme.js';
+export { Arg2pGraph } from './components/arg2p-graph.js';
+export { Arg2pFramework } from './components/arg2p-framework.js';
+export { Arg2pSolutions, listItems } from './components/arg2p-solutions.js';
+export { Arg2pEditor, rangeOf } from './components/arg2p-editor.js';
+export { Arg2pFlags } from './components/arg2p-flags.js';
+export { arg2p, arg2pLanguage } from './editor/language.js';
+//# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,oHAAoH;AACpH,yHAAyH;AACzH,cAAc,WAAW,CAAC;AAC1B,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,YAAY,CAAC;AAChD,OAAO,EAAE,UAAU,EAAe,MAAM,6BAA6B,CAAC;AACtE,OAAO,EAAE,cAAc,EAAE,MAAM,iCAAiC,CAAC;AACjE,OAAO,EAAE,cAAc,EAAE,SAAS,EAAE,MAAM,iCAAiC,CAAC;AAC5E,OAAO,EAAE,WAAW,EAAE,OAAO,EAAmB,MAAM,8BAA8B,CAAC;AACrF,OAAO,EAAE,UAAU,EAAe,MAAM,6BAA6B,CAAC;AACtE,OAAO,EAAE,KAAK,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAC"}

package/dist/js/engine.d.ts

@@ -0,0 +1,35 @@
+import type { Engine, Run, SolveRequest, SyntaxProblem } from '../engine.js';
+import type { Settings } from '../flags/schema.js';
+import type { Answer, Request } from './host.js';
+/** What [JsEngine] runs the solver on: a Worker, or anything that answers as one (a host of the same thread, for tests) */
+export interface Channel {
+    postMessage(request: Request): void;
+    onmessage: ((event: {
+        data: Answer;
+    }) => void) | null;
+    terminate(): void;
+}
+/**
+ * The engine of the browser: the solver of @tuprolog/arg2p in a worker (see host for the messages), so that the page
+ * stays responsive while it works. Stopping an evaluation ends the worker (the only way to interrupt it) and starts a
+ * fresh one, which warms itself up in the background.
+ */
+export declare class JsEngine implements Engine {
+    private readonly spawn;
+    private channel;
+    private sequence;
+    private readonly pending;
+    private readonly outputs;
+    constructor(spawn?: () => Channel);
+    /** Starts the worker, and its warm-up, ahead of the first evaluation */
+    start(): void;
+    solve(request: SolveRequest, output?: (text: string) => void): Promise<Run>;
+    check(text: string, kind: 'theory' | 'query'): Promise<SyntaxProblem | null>;
+    settings(theory: string, flags: string): Promise<Settings>;
+    stop(): void;
+    private open;
+    private restart;
+    private receive;
+    private request;
+    private failAll;
+}

package/dist/js/engine.js

@@ -0,0 +1,110 @@
+// The worker of this module, as bundlers (Vite, webpack) find it
+const spawnWorker = () => new Worker(new URL('./worker.js', import.meta.url), { type: 'module' });
+/**
+ * The engine of the browser: the solver of @tuprolog/arg2p in a worker (see host for the messages), so that the page
+ * stays responsive while it works. Stopping an evaluation ends the worker (the only way to interrupt it) and starts a
+ * fresh one, which warms itself up in the background.
+ */
+export class JsEngine {
+    constructor(spawn = spawnWorker) {
+        this.spawn = spawn;
+        this.channel = null;
+        this.sequence = 0;
+        // the answers waited for, by kind and id
+        this.pending = new Map();
+        // where the output of each query goes
+        this.outputs = new Map();
+    }
+    /** Starts the worker, and its warm-up, ahead of the first evaluation */
+    start() {
+        if (this.channel === null)
+            this.open();
+    }
+    solve(request, output = () => { }) {
+        const id = ++this.sequence;
+        this.outputs.clear();
+        this.outputs.set(id, output);
+        return this.request({ type: 'solve', id, ...request }, `start:${id}`).then(started => {
+            // every query has a first answer: yes, no or an error
+            let hasNext = true;
+            return {
+                query: started.query,
+                hasNext: () => hasNext,
+                next: () => this.request({ type: 'next', id }, `next:${id}`).then(answer => {
+                    const solution = answer;
+                    hasNext = solution.hasNext;
+                    return solution.solution;
+                }),
+                graphAt: (branch) => {
+                    const reqId = ++this.sequence;
+                    return this.request({ type: 'graphAt', id, branch, reqId }, `graph:${reqId}`).then(answer => answer.graph);
+                },
+            };
+        });
+    }
+    check(text, kind) {
+        const reqId = ++this.sequence;
+        return this.request({ type: 'check', reqId, text, kind }, `check:${reqId}`).then(answer => answer.problem);
+    }
+    settings(theory, flags) {
+        const reqId = ++this.sequence;
+        return this.request({ type: 'settings', reqId, theory, flags }, `settings:${reqId}`).then(answer => answer.settings);
+    }
+    stop() {
+        this.failAll({ name: 'Stopped', message: 'The query was stopped.', syntax: null, stopped: true });
+        this.restart();
+    }
+    open() {
+        const channel = this.spawn();
+        channel.onmessage = event => this.receive(event.data);
+        if ('onerror' in channel) {
+            channel.onerror = event => {
+                event.preventDefault();
+                this.failAll({ name: 'Solver error', message: event.message || 'The solver stopped working.', syntax: null });
+                this.restart();
+            };
+        }
+        this.channel = channel;
+        channel.postMessage({ type: 'warmUp' });
+    }
+    restart() {
+        this.channel?.terminate();
+        this.channel = null;
+        this.open();
+    }
+    receive(answer) {
+        if (answer.type === 'output') {
+            this.outputs.get(answer.id)?.(answer.text);
+            return;
+        }
+        const key = answer.type === 'graph' ? `graph:${answer.reqId}`
+            : answer.type === 'checked' ? `check:${answer.reqId}`
+                : answer.type === 'settings' ? `settings:${answer.reqId}`
+                    : answer.type === 'solution' ? `next:${answer.id}`
+                        : answer.type === 'started' ? `start:${answer.id}`
+                            : answer.type === 'failed' ? [`start:${answer.id}`, `next:${answer.id}`].find(it => this.pending.has(it))
+                                : undefined;
+        const waiting = key === undefined ? undefined : this.pending.get(key);
+        if (key === undefined || waiting === undefined)
+            return;
+        this.pending.delete(key);
+        if (answer.type === 'failed')
+            waiting.reject(answer.error);
+        else
+            waiting.resolve(answer);
+    }
+    request(request, key) {
+        if (this.channel === null)
+            this.open();
+        return new Promise((resolve, reject) => {
+            this.pending.set(key, { resolve, reject });
+            this.channel.postMessage(request);
+        });
+    }
+    failAll(error) {
+        const waiting = [...this.pending.values()];
+        this.pending.clear();
+        waiting.forEach(it => it.reject(error));
+    }
+}
+//# sourceMappingURL=engine.js.map

package/dist/js/engine.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"engine.js","sourceRoot":"","sources":["../../src/js/engine.ts"],"names":[],"mappings":"AAWA,iEAAiE;AACjE,MAAM,WAAW,GAAG,GAAY,EAAE,CAC9B,IAAI,MAAM,CAAC,IAAI,GAAG,CAAC,aAAa,EAAE,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAuB,CAAC;AAElG;;;;GAIG;AACH,MAAM,OAAO,QAAQ;IAQjB,YAA6B,KAAK,GAAkB,WAAW;QAAlC,UAAK,GAAL,KAAK,CAA6B;QAPvD,YAAO,GAAmB,IAAI,CAAC;QAC/B,aAAQ,GAAG,CAAC,CAAC;QACrB,yCAAyC;QACxB,YAAO,GAAG,IAAI,GAAG,EAA+E,CAAC;QAClH,sCAAsC;QACrB,YAAO,GAAG,IAAI,GAAG,EAAkC,CAAC;IAEH,CAAC;IAEnE,wEAAwE;IACxE,KAAK;QACD,IAAI,IAAI,CAAC,OAAO,KAAK,IAAI;YAAE,IAAI,CAAC,IAAI,EAAE,CAAC;IAC3C,CAAC;IAED,KAAK,CAAC,OAAqB,EAAE,MAAM,GAA2B,GAAG,EAAE,GAAE,CAAC;QAClE,MAAM,EAAE,GAAG,EAAE,IAAI,CAAC,QAAQ,CAAC;QAC3B,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;QACrB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;QAC7B,OAAO,IAAI,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,EAAE,EAAE,GAAG,OAAO,EAAE,EAAE,SAAS,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE;YACjF,sDAAsD;YACtD,IAAI,OAAO,GAAG,IAAI,CAAC;YACnB,OAAO;gBACH,KAAK,EAAG,OAAgD,CAAC,KAAK;gBAC9D,OAAO,EAAE,GAAG,EAAE,CAAC,OAAO;gBACtB,IAAI,EAAE,GAA0B,EAAE,CAC9B,IAAI,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE;oBAC3D,MAAM,QAAQ,GAAG,MAA+C,CAAC;oBACjE,OAAO,GAAG,QAAQ,CAAC,OAAO,CAAC;oBAC3B,OAAO,QAAQ,CAAC,QAAQ,CAAC;gBAC7B,CAAC,CAAC;gBACN,OAAO,EAAE,CAAC,MAAc,EAAsB,EAAE;oBAC5C,MAAM,KAAK,GAAG,EAAE,IAAI,CAAC,QAAQ,CAAC;oBAC9B,OAAO,IAAI,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,SAAS,KAAK,EAAE,CAAC,CAAC,IAAI,CAC9E,MAAM,CAAC,EAAE,CAAE,MAA6C,CAAC,KAAK,CACjE,CAAC;gBACN,CAAC;aACJ,CAAC;QACN,CAAC,CAAC,CAAC;IACP,CAAC;IAED,KAAK,CAAC,IAAY,EAAE,IAAwB;QACxC,MAAM,KAAK,GAAG,EAAE,IAAI,CAAC,QAAQ,CAAC;QAC9B,OAAO,IAAI,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,SAAS,KAAK,EAAE,CAAC,CAAC,IAAI,CAC5E,MAAM,CAAC,EAAE,CAAE,MAA+C,CAAC,OAAO,CACrE,CAAC;IACN,CAAC;IAED,QAAQ,CAAC,MAAc,EAAE,KAAa;QAClC,MAAM,KAAK,GAAG,EAAE,IAAI,CAAC,QAAQ,CAAC;QAC9B,OAAO,IAAI,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,YAAY,KAAK,EAAE,CAAC,CAAC,IAAI,CACrF,MAAM,CAAC,EAAE,CAAE,MAAgD,CAAC,QAAQ,CACvE,CAAC;IACN,CAAC;IAED,IAAI;QACA,IAAI,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,wBAAwB,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC;QAClG,IAAI,CAAC,OAAO,EAAE,CAAC;IACnB,CAAC;IAEO,IAAI;QACR,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;QAC7B,OAAO,CAAC,SAAS,GAAG,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACtD,IAAI,SAAS,IAAI,OAAO,EAAE,CAAC;YACtB,OAA6B,CAAC,OAAO,GAAG,KAAK,CAAC,EAAE;gBAC7C,KAAK,CAAC,cAAc,EAAE,CAAC;gBACvB,IAAI,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,cAAc,EAAE,OAAO,EAAE,KAAK,CAAC,OAAO,IAAI,6BAA6B,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC;gBAC9G,IAAI,CAAC,OAAO,EAAE,CAAC;YACnB,CAAC,CAAC;QACN,CAAC;QACD,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,OAAO,CAAC,WAAW,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC;IAC5C,CAAC;IAEO,OAAO;QACX,IAAI,CAAC,OAAO,EAAE,SAAS,EAAE,CAAC;QAC1B,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC;QACpB,IAAI,CAAC,IAAI,EAAE,CAAC;IAChB,CAAC;IAEO,OAAO,CAAC,MAAc;QAC1B,IAAI,MAAM,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YAC3B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAC3C,OAAO;QACX,CAAC;QACD,MAAM,GAAG,GACL,MAAM,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,SAAS,MAAM,CAAC,KAAK,EAAE;YACjD,CAAC,CAAC,MAAM,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,MAAM,CAAC,KAAK,EAAE;gBACrD,CAAC,CAAC,MAAM,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,YAAY,MAAM,CAAC,KAAK,EAAE;oBACzD,CAAC,CAAC,MAAM,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,QAAQ,MAAM,CAAC,EAAE,EAAE;wBAClD,CAAC,CAAC,MAAM,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,MAAM,CAAC,EAAE,EAAE;4BAClD,CAAC,CAAC,MAAM,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,SAAS,MAAM,CAAC,EAAE,EAAE,EAAE,QAAQ,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gCACzG,CAAC,CAAC,SAAS,CAAC;QAChB,MAAM,OAAO,GAAG,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACtE,IAAI,GAAG,KAAK,SAAS,IAAI,OAAO,KAAK,SAAS;YAAE,OAAO;QACvD,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACzB,IAAI,MAAM,CAAC,IAAI,KAAK,QAAQ;YAAE,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;;YACtD,OAAO,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IACjC,CAAC;IAEO,OAAO,CAAC,OAAgB,EAAE,GAAW;QACzC,IAAI,IAAI,CAAC,OAAO,KAAK,IAAI;YAAE,IAAI,CAAC,IAAI,EAAE,CAAC;QACvC,OAAO,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;YACnC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC;YAC3C,IAAI,CAAC,OAAQ,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;QACvC,CAAC,CAAC,CAAC;IACP,CAAC;IAEO,OAAO,CAAC,KAAkB;QAC9B,MAAM,OAAO,GAAG,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;QAC3C,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;QACrB,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;IAC5C,CAAC;CACJ"}

package/dist/js/host.d.ts

@@ -0,0 +1,75 @@
+import { type Graph } from '@tuprolog/arg2p';
+import { type EngineError, type GraphData, type SolutionData, type SyntaxProblem } from '../engine.js';
+import { type Settings } from '../flags/schema.js';
+export type Request = {
+    type: 'warmUp';
+} | {
+    type: 'solve';
+    id: number;
+    theory: string;
+    query: string;
+    flags: string;
+} | {
+    type: 'next';
+    id: number;
+} | {
+    type: 'graphAt';
+    id: number;
+    branch: number;
+    reqId: number;
+} | {
+    type: 'check';
+    reqId: number;
+    text: string;
+    kind: 'theory' | 'query';
+} | {
+    type: 'settings';
+    reqId: number;
+    theory: string;
+    flags: string;
+};
+export type Answer = {
+    type: 'warm';
+} | {
+    type: 'started';
+    id: number;
+    query: string;
+} | {
+    type: 'failed';
+    id: number;
+    error: EngineError;
+} | {
+    type: 'output';
+    id: number;
+    text: string;
+} | {
+    type: 'solution';
+    id: number;
+    solution: SolutionData;
+    hasNext: boolean;
+} | {
+    type: 'graph';
+    reqId: number;
+    graph: GraphData;
+} | {
+    type: 'checked';
+    reqId: number;
+    problem: SyntaxProblem | null;
+} | {
+    type: 'settings';
+    reqId: number;
+    settings: Settings;
+};
+export declare function createHost(post: (answer: Answer) => void): {
+    handle(request: Request): void;
+};
+/** A graph of the API as plain data, read in [profile] */
+export declare function graphData(graph: Graph, profile?: string): GraphData;
+/** Where [text], a theory (or flags) or a query, does not parse; null if it does */
+export declare function check(text: string, kind: 'theory' | 'query'): SyntaxProblem | null;
+/**
+ * The values of the flags in effect for [theory] solved with [flags], as the solver checks them (setting/1 for a
+ * switch, setting/2 for the values of a flag): the flags alone when the theory does not parse, none when they do not
+ * (until the API gives them)
+ */
+export declare function settings(theory: string, flags: string): Settings;