@theia/scm 1.71.0-next.72 → 1.71.0

package/lib/browser/scm-history-graph-lanes.spec.js

@@ -0,0 +1,554 @@
+"use strict";
+// *****************************************************************************
+// Copyright (C) 2026 EclipseSource GmbH and others.
+//
+// This program and the accompanying materials are made available under the
+// terms of the Eclipse Public License v. 2.0 which is available at
+// http://www.eclipse.org/legal/epl-2.0.
+//
+// This Source Code may also be made available under the following Secondary
+// Licenses when the conditions for such availability set forth in the Eclipse
+// Public License v. 2.0 are satisfied: GNU General Public License, version 2
+// with the GNU Classpath Exception which is available at
+// https://www.gnu.org/software/classpath/license.html.
+//
+// SPDX-License-Identifier: EPL-2.0 OR GPL-2.0-only WITH Classpath-exception-2.0
+// *****************************************************************************
+Object.defineProperty(exports, "__esModule", { value: true });
+const chai_1 = require("chai");
+const scm_history_graph_lanes_1 = require("./scm-history-graph-lanes");
+describe('computeGraphRows', () => {
+    function lanes(commits) {
+        return (0, scm_history_graph_lanes_1.computeGraphRows)(commits).map(r => r.lane);
+    }
+    // -------------------------------------------------------------------------
+    // Linear history
+    // -------------------------------------------------------------------------
+    describe('linear history', () => {
+        const commits = [
+            { id: 'C', parentIds: ['B'] },
+            { id: 'B', parentIds: ['A'] },
+            { id: 'A', parentIds: [] },
+        ];
+        it('all commits stay in lane 0', () => {
+            (0, chai_1.expect)(lanes(commits)).to.deep.equal([0, 0, 0]);
+        });
+        it('colors are all 0', () => {
+            const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
+            (0, chai_1.expect)(rows.map(r => r.color)).to.deep.equal([0, 0, 0]);
+        });
+        it('first parent same-lane continuation emits no separate edge (handled by commit line)', () => {
+            const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
+            // Row 0 (C): first parent B is in the same lane — no edge emitted
+            // Only pass-through edges from other lanes (none here) are emitted
+            const edgesC = rows[0].edges.filter(e => e.fromLane === 0 && e.toLane === 0);
+            (0, chai_1.expect)(edgesC.length).to.equal(0);
+        });
+        it('root commit (A) emits no edges', () => {
+            const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
+            (0, chai_1.expect)(rows[2].edges).to.be.empty;
+        });
+    });
+    // -------------------------------------------------------------------------
+    // Single branch + merge
+    // -------------------------------------------------------------------------
+    describe('branch and merge', () => {
+        //   M  ← merge commit (parents: D, E)
+        //   |\
+        //   D  E  ← two parallel commits
+        //   |  |
+        //   B  B  (same B — E's parent is B too)
+        //    \ |
+        //     B
+        //     |
+        //     A
+        //
+        // Topological order (newest first): M, D, E, B, A
+        const commits = [
+            { id: 'M', parentIds: ['D', 'E'] },
+            { id: 'D', parentIds: ['B'] },
+            { id: 'E', parentIds: ['B'] },
+            { id: 'B', parentIds: ['A'] },
+            { id: 'A', parentIds: [] },
+        ];
+        it('merge commit M is in lane 0', () => {
+            (0, chai_1.expect)(lanes(commits)[0]).to.equal(0);
+        });
+        it('D (first parent) stays in lane 0', () => {
+            (0, chai_1.expect)(lanes(commits)[1]).to.equal(0);
+        });
+        it('E (second parent) is in a different lane', () => {
+            (0, chai_1.expect)(lanes(commits)[2]).to.not.equal(0);
+        });
+        it('B and A eventually converge back to lane 0', () => {
+            const ls = lanes(commits);
+            // B must be in lane 0 (first parent chain)
+            (0, chai_1.expect)(ls[3]).to.equal(0);
+            // A also stays in lane 0
+            (0, chai_1.expect)(ls[4]).to.equal(0);
+        });
+        it('M emits a branch-out edge for second parent E', () => {
+            const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
+            const mEdges = rows[0].edges;
+            // Branch-out: from commit lane 0 to E's new lane
+            const branchOut = mEdges.filter(e => e.type === 'branch-out' && e.fromLane === 0);
+            (0, chai_1.expect)(branchOut.length).to.be.greaterThan(0);
+        });
+        it('M does not emit a merge-in edge (no existing lane converges into M)', () => {
+            const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
+            const mEdges = rows[0].edges;
+            const mergeIn = mEdges.filter(e => e.type === 'merge-in');
+            (0, chai_1.expect)(mergeIn.length).to.equal(0);
+        });
+        it('E emits a merge-in edge (E parent B is already in lane 0)', () => {
+            const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
+            // E is at index 2, in lane 1; its parent B is already in lane 0.
+            // merge-in edge: fromLane=0 (B's lane), toLane=1 (E's commit lane)
+            const eRow = rows[2];
+            const eEdges = eRow.edges;
+            const mergeIn = eEdges.filter(e => e.type === 'merge-in' && e.fromLane === 0 && e.toLane === eRow.lane);
+            (0, chai_1.expect)(mergeIn.length).to.be.greaterThan(0);
+        });
+    });
+    // -------------------------------------------------------------------------
+    // Parallel independent branches
+    // -------------------------------------------------------------------------
+    describe('parallel independent branches', () => {
+        // Two completely independent branches interleaved in the list.
+        // Newest first: A2, B2, A1, B1
+        // A2 and A1 are on one branch, B2 and B1 on another.
+        const commits = [
+            { id: 'A2', parentIds: ['A1'] },
+            { id: 'B2', parentIds: ['B1'] },
+            { id: 'A1', parentIds: [] },
+            { id: 'B1', parentIds: [] },
+        ];
+        it('A2 is in lane 0', () => {
+            (0, chai_1.expect)(lanes(commits)[0]).to.equal(0);
+        });
+        it('B2 is in a different lane from A2', () => {
+            const ls = lanes(commits);
+            (0, chai_1.expect)(ls[1]).to.not.equal(ls[0]);
+        });
+        it('A1 is in lane 0 (continues A2 branch)', () => {
+            (0, chai_1.expect)(lanes(commits)[2]).to.equal(0);
+        });
+        it('B1 continues in the same lane as B2', () => {
+            const ls = lanes(commits);
+            (0, chai_1.expect)(ls[3]).to.equal(ls[1]);
+        });
+    });
+    // -------------------------------------------------------------------------
+    // Octopus merge (3 parents)
+    // -------------------------------------------------------------------------
+    describe('octopus merge', () => {
+        // O merges P1, P2, P3
+        // O, P1, P2, P3
+        const commits = [
+            { id: 'O', parentIds: ['P1', 'P2', 'P3'] },
+            { id: 'P1', parentIds: [] },
+            { id: 'P2', parentIds: [] },
+            { id: 'P3', parentIds: [] },
+        ];
+        it('O is in lane 0', () => {
+            (0, chai_1.expect)(lanes(commits)[0]).to.equal(0);
+        });
+        it('P1 is in lane 0 (first parent)', () => {
+            (0, chai_1.expect)(lanes(commits)[1]).to.equal(0);
+        });
+        it('P2 is in a distinct lane', () => {
+            const ls = lanes(commits);
+            (0, chai_1.expect)(ls[2]).to.not.equal(0);
+        });
+        it('P3 is in a distinct lane different from P2', () => {
+            const ls = lanes(commits);
+            (0, chai_1.expect)(ls[3]).to.not.equal(ls[2]);
+        });
+        it('O emits 2 branch-out edges (for P2 and P3; P1 same-lane has no edge)', () => {
+            const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
+            const oEdges = rows[0].edges.filter(e => e.type === 'branch-out');
+            (0, chai_1.expect)(oEdges.length).to.equal(2);
+        });
+        it('O emits no merge-in edges (no existing lanes converge into O)', () => {
+            const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
+            const mergeIn = rows[0].edges.filter(e => e.type === 'merge-in');
+            (0, chai_1.expect)(mergeIn.length).to.equal(0);
+        });
+        it('lane colors are correct modulo 8', () => {
+            const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
+            rows.forEach(r => (0, chai_1.expect)(r.color).to.equal(r.lane % 8));
+        });
+    });
+    // -------------------------------------------------------------------------
+    // Root commit with no parents
+    // -------------------------------------------------------------------------
+    describe('single root commit', () => {
+        const commits = [{ id: 'R', parentIds: [] }];
+        it('is placed in lane 0', () => {
+            (0, chai_1.expect)(lanes(commits)).to.deep.equal([0]);
+        });
+        it('emits no edges', () => {
+            const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
+            (0, chai_1.expect)(rows[0].edges).to.be.empty;
+        });
+    });
+    // -------------------------------------------------------------------------
+    // Empty input
+    // -------------------------------------------------------------------------
+    describe('empty input', () => {
+        it('returns an empty array', () => {
+            (0, chai_1.expect)((0, scm_history_graph_lanes_1.computeGraphRows)([])).to.deep.equal([]);
+        });
+    });
+    // -------------------------------------------------------------------------
+    // hasContinuation and hasTopLine
+    // -------------------------------------------------------------------------
+    describe('hasContinuation and hasTopLine', () => {
+        describe('linear history', () => {
+            const commits = [
+                { id: 'C', parentIds: ['B'] },
+                { id: 'B', parentIds: ['A'] },
+                { id: 'A', parentIds: [] },
+            ];
+            it('first (newest/HEAD) commit has hasContinuation:true, hasTopLine:false', () => {
+                const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
+                (0, chai_1.expect)(rows[0].hasContinuation).to.equal(true);
+                (0, chai_1.expect)(rows[0].hasTopLine).to.equal(false);
+            });
+            it('middle commit has hasContinuation:true, hasTopLine:true', () => {
+                const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
+                (0, chai_1.expect)(rows[1].hasContinuation).to.equal(true);
+                (0, chai_1.expect)(rows[1].hasTopLine).to.equal(true);
+            });
+            it('root (oldest) commit has hasContinuation:false, hasTopLine:true', () => {
+                const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
+                (0, chai_1.expect)(rows[2].hasContinuation).to.equal(false);
+                (0, chai_1.expect)(rows[2].hasTopLine).to.equal(true);
+            });
+        });
+        describe('branch-and-merge', () => {
+            // Topology: E (lane 1, parent B already in lane 0) — the merge
+            // convergence commit whose lane is freed after it is rendered.
+            //
+            //   M  (lane 0, parents: D, E)
+            //   |\
+            //   D  E  (D lane 0, E lane 1)
+            //   | /
+            //   B  (lane 0)
+            //   |
+            //   A  (lane 0)
+            const commits = [
+                { id: 'M', parentIds: ['D', 'E'] },
+                { id: 'D', parentIds: ['B'] },
+                { id: 'E', parentIds: ['B'] },
+                { id: 'B', parentIds: ['A'] },
+                { id: 'A', parentIds: [] },
+            ];
+            it('merge commit E (whose parent B is already in lane 0) has hasContinuation:false, hasTopLine:true', () => {
+                const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
+                // E is at index 2; its first parent B is already in lane 0,
+                // so its own lane is freed — hasContinuation must be false.
+                // E was reserved as a parent by M, so hasTopLine must be true.
+                (0, chai_1.expect)(rows[2].hasContinuation).to.equal(false);
+                (0, chai_1.expect)(rows[2].hasTopLine).to.equal(true);
+            });
+        });
+        describe('single root commit (no parents)', () => {
+            it('has hasContinuation:false, hasTopLine:false', () => {
+                const rows = (0, scm_history_graph_lanes_1.computeGraphRows)([{ id: 'R', parentIds: [] }]);
+                (0, chai_1.expect)(rows[0].hasContinuation).to.equal(false);
+                (0, chai_1.expect)(rows[0].hasTopLine).to.equal(false);
+            });
+        });
+    });
+    // -------------------------------------------------------------------------
+    // Lane freeing on merge convergence
+    // -------------------------------------------------------------------------
+    describe('lane freeing on merge convergence', () => {
+        // Topology: M→D,E → B → A
+        //
+        //   M  (lane 0, parents: D, E)
+        //   |\
+        //   D  E  (D in lane 0, E in lane 1)
+        //   | /
+        //   B  (lane 0 — E's parent B is already tracked in lane 0)
+        //   |
+        //   A  (lane 0)
+        //
+        // After rendering E (lane 1, parent B already in lane 0), lane 1 must
+        // be freed so that subsequent commits can reuse it.
+        const commits = [
+            { id: 'M', parentIds: ['D', 'E'] },
+            { id: 'D', parentIds: ['B'] },
+            { id: 'E', parentIds: ['B'] },
+            { id: 'B', parentIds: ['A'] },
+            { id: 'A', parentIds: [] },
+        ];
+        it('E is placed in lane 1', () => {
+            const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
+            (0, chai_1.expect)(rows[2].lane).to.equal(1); // E
+        });
+        it('B is in lane 0 (converges back after E)', () => {
+            const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
+            (0, chai_1.expect)(rows[3].lane).to.equal(0); // B
+        });
+        it('A is in lane 0', () => {
+            const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
+            (0, chai_1.expect)(rows[4].lane).to.equal(0); // A
+        });
+        it('lane 1 is freed after E — B row has no pass-through edge for lane 1', () => {
+            const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
+            // Row for B (index 3): there should be no pass-through edge that
+            // goes from lane 1 to lane 1, because E has already been rendered
+            // and its lane should have been freed.
+            const bRow = rows[3];
+            const spuriousEdge = bRow.edges.find(e => e.fromLane === 1 && e.toLane === 1);
+            (0, chai_1.expect)(spuriousEdge).to.be.undefined;
+        });
+        it('lane 1 is reusable after E — new branch between B and A uses lane 1', () => {
+            // Insert an independent branch X→Y between B and A so that at the
+            // point X is processed, lane 0 is still occupied by 'A' (B's
+            // parent).  Lane 1 must have been freed after E, so X should
+            // occupy lane 1 rather than opening a new lane 2.
+            const commitsWithExtra = [
+                { id: 'M', parentIds: ['D', 'E'] },
+                { id: 'D', parentIds: ['B'] },
+                { id: 'E', parentIds: ['B'] },
+                { id: 'B', parentIds: ['A'] },
+                // X is an independent commit whose parent Y hasn't appeared
+                // yet.  At this point lane 0 holds 'A', lane 1 was freed after
+                // E — so X should claim lane 1.
+                { id: 'X', parentIds: ['Y'] },
+                { id: 'A', parentIds: [] },
+                { id: 'Y', parentIds: [] },
+            ];
+            const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commitsWithExtra);
+            // X (index 4) should reuse the freed lane 1 rather than lane 2.
+            (0, chai_1.expect)(rows[4].lane).to.equal(1);
+        });
+        it('E emits a merge-in edge from lane 0 into E\'s commit lane (B already in lane 0)', () => {
+            const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
+            // E is at index 2, in lane 1; B is in lane 0.
+            // merge-in edge: fromLane=0 (B's existing lane), toLane=1 (E's commit lane)
+            const eRow = rows[2];
+            const eEdges = eRow.edges;
+            const mergeIn = eEdges.filter(e => e.type === 'merge-in' && e.fromLane === 0 && e.toLane === eRow.lane);
+            (0, chai_1.expect)(mergeIn.length).to.equal(1);
+        });
+    });
+    // -------------------------------------------------------------------------
+    // Lane color wraps at 8
+    // -------------------------------------------------------------------------
+    describe('color wrapping', () => {
+        it('lane color is always lane % 8', () => {
+            // 4 parallel chains so we have lanes 0, 1, 2, 3 occupied at once.
+            // Chain structure: X0→X1→X2, Y0→Y1→Y2, etc., interleaved.
+            const commits = [
+                { id: 'X0', parentIds: ['X1'] },
+                { id: 'Y0', parentIds: ['Y1'] },
+                { id: 'Z0', parentIds: ['Z1'] },
+                { id: 'W0', parentIds: ['W1'] },
+                { id: 'X1', parentIds: [] },
+                { id: 'Y1', parentIds: [] },
+                { id: 'Z1', parentIds: [] },
+                { id: 'W1', parentIds: [] },
+            ];
+            const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
+            // Every row's color must equal lane % 8
+            rows.forEach(r => (0, chai_1.expect)(r.color).to.equal(r.lane % 8));
+        });
+        it('assigns distinct lanes to 8 simultaneous branches', () => {
+            // 8 independent commits whose parents haven't been seen yet
+            const commits = [
+                { id: 'A', parentIds: ['a'] },
+                { id: 'B', parentIds: ['b'] },
+                { id: 'C', parentIds: ['c'] },
+                { id: 'D', parentIds: ['d'] },
+                { id: 'E', parentIds: ['e'] },
+                { id: 'F', parentIds: ['f'] },
+                { id: 'G', parentIds: ['g'] },
+                { id: 'H', parentIds: ['h'] },
+            ];
+            const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
+            const laneSet = new Set(rows.map(r => r.lane));
+            (0, chai_1.expect)(laneSet.size).to.equal(8); // all distinct lanes
+            // Color of lane 7 is 7, lane 0 is 0
+            const lane7 = rows.find(r => r.lane === 7);
+            (0, chai_1.expect)(lane7).to.not.be.undefined;
+            (0, chai_1.expect)(lane7.color).to.equal(7);
+        });
+    });
+    // -------------------------------------------------------------------------
+    // Edge type correctness
+    // -------------------------------------------------------------------------
+    describe('edge types', () => {
+        it('pass-through edges have fromLane === toLane', () => {
+            const commits = [
+                { id: 'A', parentIds: ['a'] },
+                { id: 'B', parentIds: ['b'] },
+                { id: 'C', parentIds: ['c'] },
+            ];
+            const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
+            // Row for B (index 1): A's lane (0) passes through as pass-through
+            const bPassThrough = rows[1].edges.filter(e => e.type === 'pass-through');
+            bPassThrough.forEach(e => (0, chai_1.expect)(e.fromLane).to.equal(e.toLane));
+        });
+        it('branch-out edges have fromLane equal to commit lane', () => {
+            const commits = [
+                { id: 'M', parentIds: ['D', 'E'] },
+                { id: 'D', parentIds: [] },
+                { id: 'E', parentIds: [] },
+            ];
+            const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
+            const mRow = rows[0];
+            const branchOut = mRow.edges.filter(e => e.type === 'branch-out');
+            branchOut.forEach(e => (0, chai_1.expect)(e.fromLane).to.equal(mRow.lane));
+        });
+        it('merge-in edges have toLane equal to commit lane', () => {
+            // M (lane 0) parents: D (lane 0, new), E (lane 1, new)
+            // E (lane 1) parent: B (already in lane 0 from D)
+            const commits2 = [
+                { id: 'M', parentIds: ['D', 'E'] },
+                { id: 'D', parentIds: ['B'] },
+                { id: 'E', parentIds: ['B'] }, // B already in lane 0
+                { id: 'B', parentIds: [] },
+            ];
+            const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits2);
+            const eRow = rows[2]; // E
+            const mergeIn = eRow.edges.filter(e => e.type === 'merge-in');
+            // toLane of merge-in must equal the commit's own lane
+            mergeIn.forEach(e => (0, chai_1.expect)(e.toLane).to.equal(eRow.lane));
+        });
+    });
+    // -------------------------------------------------------------------------
+    // Sibling branches (branch tips sharing the same parent)
+    // -------------------------------------------------------------------------
+    describe('sibling branches sharing the same parent', () => {
+        // Two branch tips that were NOT pre-reserved, both pointing at the same
+        // parent P.  This mirrors the real-world case where two refs (e.g. HEAD
+        // and origin/HEAD) diverge from a common ancestor:
+        //
+        //   A  (lane 0, parent P)   ← branch tip, not pre-reserved
+        //   B  (lane 1, parent P)   ← sibling branch tip, not pre-reserved
+        //   P  (lane 0, parent Q)   ← common parent
+        //   Q  (lane 0)             ← root
+        const commits = [
+            { id: 'A', parentIds: ['P'] },
+            { id: 'B', parentIds: ['P'] },
+            { id: 'P', parentIds: ['Q'] },
+            { id: 'Q', parentIds: [] },
+        ];
+        it('A is placed in lane 0', () => {
+            (0, chai_1.expect)((0, scm_history_graph_lanes_1.computeGraphRows)(commits)[0].lane).to.equal(0);
+        });
+        it('B is placed in lane 1 (sibling gets new lane)', () => {
+            (0, chai_1.expect)((0, scm_history_graph_lanes_1.computeGraphRows)(commits)[1].lane).to.equal(1);
+        });
+        it('P converges back to lane 0', () => {
+            (0, chai_1.expect)((0, scm_history_graph_lanes_1.computeGraphRows)(commits)[2].lane).to.equal(0);
+        });
+        it('A row (row 0) emits NO branch-out edges (siblings are not connected to each other)', () => {
+            const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
+            const aEdges = rows[0].edges;
+            const branchOut = aEdges.filter(e => e.type === 'branch-out');
+            (0, chai_1.expect)(branchOut.length).to.equal(0);
+        });
+        it('B row (row 1) has hasTopLine:false (lane starts fresh, no connection from above)', () => {
+            const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
+            (0, chai_1.expect)(rows[1].hasTopLine).to.equal(false);
+        });
+        it('B row (row 1) has hasContinuation:true (lane continues as pass-through to parent P at row 2)', () => {
+            const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
+            (0, chai_1.expect)(rows[1].hasContinuation).to.equal(true);
+        });
+        it('B row (row 1) does NOT emit a merge-in edge', () => {
+            // A merge-in on B\'s row would mean "a top-of-row line curves into B\'s
+            // circle", which is wrong since B was not pre-reserved.
+            const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
+            const mergeIn = rows[1].edges.filter(e => e.type === 'merge-in');
+            (0, chai_1.expect)(mergeIn.length).to.equal(0);
+        });
+        it('A row (row 0) has hasTopLine:false (A was not pre-reserved)', () => {
+            const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
+            (0, chai_1.expect)(rows[0].hasTopLine).to.equal(false);
+        });
+        it('P row (row 2) has hasTopLine:true (continuing from A\'s lane)', () => {
+            const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
+            (0, chai_1.expect)(rows[2].hasTopLine).to.equal(true);
+        });
+        it('B row (row 1) has a pass-through edge for lane 0', () => {
+            // Lane 0 (pointing at P) continues as a pass-through through B\'s row.
+            const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
+            const passThrough = rows[1].edges.find(e => e.type === 'pass-through' && e.fromLane === 0 && e.toLane === 0);
+            (0, chai_1.expect)(passThrough).to.not.be.undefined;
+        });
+        it('P row (row 2) has a merge-in edge from lane 1', () => {
+            // Lane 1 (kept alive through B) converges into P\'s lane 0 with a merge-in.
+            const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
+            const mergeIn = rows[2].edges.find(e => e.type === 'merge-in' && e.fromLane === 1 && e.toLane === 0);
+            (0, chai_1.expect)(mergeIn).to.not.be.undefined;
+        });
+        it('P row (row 2) has no pass-through for lane 1 (lane 1 is freed at P)', () => {
+            const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
+            const spurious = rows[2].edges.find(e => e.fromLane === 1 && e.toLane === 1 && e.type === 'pass-through');
+            (0, chai_1.expect)(spurious).to.be.undefined;
+        });
+    });
+    // -------------------------------------------------------------------------
+    // Three sibling branches sharing the same parent
+    // -------------------------------------------------------------------------
+    describe('three sibling branches sharing the same parent', () => {
+        // A, B, C all have parent P and none were pre-reserved.
+        // Rows: A(lane0), B(lane1), C(lane2), P(lane0), ...
+        const commits = [
+            { id: 'A', parentIds: ['P'] },
+            { id: 'B', parentIds: ['P'] },
+            { id: 'C', parentIds: ['P'] },
+            { id: 'P', parentIds: [] },
+        ];
+        it('A is lane 0', () => {
+            const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
+            (0, chai_1.expect)(rows[0].lane).to.equal(0);
+        });
+        it('B is lane 1', () => {
+            const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
+            (0, chai_1.expect)(rows[1].lane).to.equal(1);
+        });
+        it('C is in a lane other than lane 0', () => {
+            // C is a sibling tip; its lane is re-assigned from freed lanes
+            const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
+            (0, chai_1.expect)(rows[2].lane).to.not.equal(0);
+        });
+        it('A row emits NO branch-out edges (siblings are not connected to each other)', () => {
+            const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
+            const branchOuts = rows[0].edges.filter(e => e.type === 'branch-out');
+            (0, chai_1.expect)(branchOuts.length).to.equal(0);
+        });
+        it('B row emits NO branch-out edges', () => {
+            const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
+            const branchOuts = rows[1].edges.filter(e => e.type === 'branch-out');
+            (0, chai_1.expect)(branchOuts.length).to.equal(0);
+        });
+        it('B and C rows both have hasTopLine:false (lanes start fresh, no connection from above)', () => {
+            const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
+            (0, chai_1.expect)(rows[1].hasTopLine).to.equal(false);
+            (0, chai_1.expect)(rows[2].hasTopLine).to.equal(false);
+        });
+        it('B and C rows have no merge-in edges', () => {
+            const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
+            (0, chai_1.expect)(rows[1].edges.filter(e => e.type === 'merge-in').length).to.equal(0);
+            (0, chai_1.expect)(rows[2].edges.filter(e => e.type === 'merge-in').length).to.equal(0);
+        });
+        it('P row has merge-in edges from both B\'s lane and C\'s lane', () => {
+            const rows = (0, scm_history_graph_lanes_1.computeGraphRows)(commits);
+            // P is at index 3, in lane 0.  Both lane 1 (B) and lane 2 (C) must
+            // converge into P with merge-in edges.
+            const pRow = rows[3];
+            const mergeInFromLane1 = pRow.edges.find(e => e.type === 'merge-in' && e.fromLane === rows[1].lane && e.toLane === pRow.lane);
+            const mergeInFromLane2 = pRow.edges.find(e => e.type === 'merge-in' && e.fromLane === rows[2].lane && e.toLane === pRow.lane);
+            (0, chai_1.expect)(mergeInFromLane1).to.not.be.undefined;
+            (0, chai_1.expect)(mergeInFromLane2).to.not.be.undefined;
+        });
+    });
+});
+//# sourceMappingURL=scm-history-graph-lanes.spec.js.map

package/lib/browser/scm-history-graph-lanes.spec.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"scm-history-graph-lanes.spec.js","sourceRoot":"","sources":["../../src/browser/scm-history-graph-lanes.spec.ts"],"names":[],"mappings":";AAAA,gFAAgF;AAChF,oDAAoD;AACpD,EAAE;AACF,2EAA2E;AAC3E,mEAAmE;AACnE,wCAAwC;AACxC,EAAE;AACF,4EAA4E;AAC5E,8EAA8E;AAC9E,6EAA6E;AAC7E,yDAAyD;AACzD,uDAAuD;AACvD,EAAE;AACF,gFAAgF;AAChF,gFAAgF;;AAEhF,+BAA8B;AAC9B,uEAA6D;AAE7D,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;IAE9B,SAAS,KAAK,CAAC,OAA+C;QAC1D,OAAO,IAAA,0CAAgB,EAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACtD,CAAC;IAED,4EAA4E;IAC5E,iBAAiB;IACjB,4EAA4E;IAC5E,QAAQ,CAAC,gBAAgB,EAAE,GAAG,EAAE;QAC5B,MAAM,OAAO,GAAG;YACZ,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,EAAE;YAC7B,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,EAAE;YAC7B,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,EAAE,EAAE;SAC7B,CAAC;QAEF,EAAE,CAAC,4BAA4B,EAAE,GAAG,EAAE;YAClC,IAAA,aAAM,EAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACpD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,kBAAkB,EAAE,GAAG,EAAE;YACxB,MAAM,IAAI,GAAG,IAAA,0CAAgB,EAAC,OAAO,CAAC,CAAC;YACvC,IAAA,aAAM,EAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC5D,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,qFAAqF,EAAE,GAAG,EAAE;YAC3F,MAAM,IAAI,GAAG,IAAA,0CAAgB,EAAC,OAAO,CAAC,CAAC;YACvC,kEAAkE;YAClE,mEAAmE;YACnE,MAAM,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC;YAC7E,IAAA,aAAM,EAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACtC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,gCAAgC,EAAE,GAAG,EAAE;YACtC,MAAM,IAAI,GAAG,IAAA,0CAAgB,EAAC,OAAO,CAAC,CAAC;YACvC,IAAA,aAAM,EAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;QACtC,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,4EAA4E;IAC5E,wBAAwB;IACxB,4EAA4E;IAC5E,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;QAC9B,sCAAsC;QACtC,OAAO;QACP,iCAAiC;QACjC,SAAS;QACT,yCAAyC;QACzC,SAAS;QACT,QAAQ;QACR,QAAQ;QACR,QAAQ;QACR,EAAE;QACF,kDAAkD;QAClD,MAAM,OAAO,GAAG;YACZ,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE;YAClC,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,EAAE;YAC7B,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,EAAE;YAC7B,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,EAAE;YAC7B,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,EAAE,EAAE;SAC7B,CAAC;QAEF,EAAE,CAAC,6BAA6B,EAAE,GAAG,EAAE;YACnC,IAAA,aAAM,EAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC1C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,kCAAkC,EAAE,GAAG,EAAE;YACxC,IAAA,aAAM,EAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC1C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,0CAA0C,EAAE,GAAG,EAAE;YAChD,IAAA,aAAM,EAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC9C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,4CAA4C,EAAE,GAAG,EAAE;YAClD,MAAM,EAAE,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC;YAC1B,2CAA2C;YAC3C,IAAA,aAAM,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC1B,yBAAyB;YACzB,IAAA,aAAM,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC9B,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,+CAA+C,EAAE,GAAG,EAAE;YACrD,MAAM,IAAI,GAAG,IAAA,0CAAgB,EAAC,OAAO,CAAC,CAAC;YACvC,MAAM,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;YAC7B,iDAAiD;YACjD,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,YAAY,IAAI,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,CAAC;YAClF,IAAA,aAAM,EAAC,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QAClD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,qEAAqE,EAAE,GAAG,EAAE;YAC3E,MAAM,IAAI,GAAG,IAAA,0CAAgB,EAAC,OAAO,CAAC,CAAC;YACvC,MAAM,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;YAC7B,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC;YAC1D,IAAA,aAAM,EAAC,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACvC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,2DAA2D,EAAE,GAAG,EAAE;YACjE,MAAM,IAAI,GAAG,IAAA,0CAAgB,EAAC,OAAO,CAAC,CAAC;YACvC,iEAAiE;YACjE,mEAAmE;YACnE,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACrB,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC;YAC1B,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,UAAU,IAAI,CAAC,CAAC,QAAQ,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC;YACxG,IAAA,aAAM,EAAC,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QAChD,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,4EAA4E;IAC5E,gCAAgC;IAChC,4EAA4E;IAC5E,QAAQ,CAAC,+BAA+B,EAAE,GAAG,EAAE;QAC3C,+DAA+D;QAC/D,+BAA+B;QAC/B,qDAAqD;QACrD,MAAM,OAAO,GAAG;YACZ,EAAE,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,IAAI,CAAC,EAAE;YAC/B,EAAE,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,IAAI,CAAC,EAAE;YAC/B,EAAE,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,EAAE;YAC3B,EAAE,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,EAAE;SAC9B,CAAC;QAEF,EAAE,CAAC,iBAAiB,EAAE,GAAG,EAAE;YACvB,IAAA,aAAM,EAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC1C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,mCAAmC,EAAE,GAAG,EAAE;YACzC,MAAM,EAAE,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC;YAC1B,IAAA,aAAM,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACtC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,uCAAuC,EAAE,GAAG,EAAE;YAC7C,IAAA,aAAM,EAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC1C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,qCAAqC,EAAE,GAAG,EAAE;YAC3C,MAAM,EAAE,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC;YAC1B,IAAA,aAAM,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAClC,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,4EAA4E;IAC5E,4BAA4B;IAC5B,4EAA4E;IAC5E,QAAQ,CAAC,eAAe,EAAE,GAAG,EAAE;QAC3B,sBAAsB;QACtB,gBAAgB;QAChB,MAAM,OAAO,GAAG;YACZ,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE;YAC1C,EAAE,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,EAAE;YAC3B,EAAE,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,EAAE;YAC3B,EAAE,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,EAAE;SAC9B,CAAC;QAEF,EAAE,CAAC,gBAAgB,EAAE,GAAG,EAAE;YACtB,IAAA,aAAM,EAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC1C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,gCAAgC,EAAE,GAAG,EAAE;YACtC,IAAA,aAAM,EAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC1C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,0BAA0B,EAAE,GAAG,EAAE;YAChC,MAAM,EAAE,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC;YAC1B,IAAA,aAAM,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAClC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,4CAA4C,EAAE,GAAG,EAAE;YAClD,MAAM,EAAE,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC;YAC1B,IAAA,aAAM,EAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACtC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,sEAAsE,EAAE,GAAG,EAAE;YAC5E,MAAM,IAAI,GAAG,IAAA,0CAAgB,EAAC,OAAO,CAAC,CAAC;YACvC,MAAM,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,YAAY,CAAC,CAAC;YAClE,IAAA,aAAM,EAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACtC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,+DAA+D,EAAE,GAAG,EAAE;YACrE,MAAM,IAAI,GAAG,IAAA,0CAAgB,EAAC,OAAO,CAAC,CAAC;YACvC,MAAM,OAAO,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC;YACjE,IAAA,aAAM,EAAC,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACvC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,kCAAkC,EAAE,GAAG,EAAE;YACxC,MAAM,IAAI,GAAG,IAAA,0CAAgB,EAAC,OAAO,CAAC,CAAC;YACvC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,IAAA,aAAM,EAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;QAC5D,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,4EAA4E;IAC5E,8BAA8B;IAC9B,4EAA4E;IAC5E,QAAQ,CAAC,oBAAoB,EAAE,GAAG,EAAE;QAChC,MAAM,OAAO,GAAG,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC,CAAC;QAE7C,EAAE,CAAC,qBAAqB,EAAE,GAAG,EAAE;YAC3B,IAAA,aAAM,EAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,gBAAgB,EAAE,GAAG,EAAE;YACtB,MAAM,IAAI,GAAG,IAAA,0CAAgB,EAAC,OAAO,CAAC,CAAC;YACvC,IAAA,aAAM,EAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC;QACtC,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,4EAA4E;IAC5E,cAAc;IACd,4EAA4E;IAC5E,QAAQ,CAAC,aAAa,EAAE,GAAG,EAAE;QACzB,EAAE,CAAC,wBAAwB,EAAE,GAAG,EAAE;YAC9B,IAAA,aAAM,EAAC,IAAA,0CAAgB,EAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QACnD,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,4EAA4E;IAC5E,iCAAiC;IACjC,4EAA4E;IAC5E,QAAQ,CAAC,gCAAgC,EAAE,GAAG,EAAE;QAE5C,QAAQ,CAAC,gBAAgB,EAAE,GAAG,EAAE;YAC5B,MAAM,OAAO,GAAG;gBACZ,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,EAAE;gBAC7B,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,EAAE;gBAC7B,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,EAAE,EAAE;aAC7B,CAAC;YAEF,EAAE,CAAC,uEAAuE,EAAE,GAAG,EAAE;gBAC7E,MAAM,IAAI,GAAG,IAAA,0CAAgB,EAAC,OAAO,CAAC,CAAC;gBACvC,IAAA,aAAM,EAAC,IAAI,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBAC/C,IAAA,aAAM,EAAC,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YAC/C,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,yDAAyD,EAAE,GAAG,EAAE;gBAC/D,MAAM,IAAI,GAAG,IAAA,0CAAgB,EAAC,OAAO,CAAC,CAAC;gBACvC,IAAA,aAAM,EAAC,IAAI,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBAC/C,IAAA,aAAM,EAAC,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YAC9C,CAAC,CAAC,CAAC;YAEH,EAAE,CAAC,iEAAiE,EAAE,GAAG,EAAE;gBACvE,MAAM,IAAI,GAAG,IAAA,0CAAgB,EAAC,OAAO,CAAC,CAAC;gBACvC,IAAA,aAAM,EAAC,IAAI,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;gBAChD,IAAA,aAAM,EAAC,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YAC9C,CAAC,CAAC,CAAC;QACP,CAAC,CAAC,CAAC;QAEH,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;YAC9B,+DAA+D;YAC/D,+DAA+D;YAC/D,EAAE;YACF,+BAA+B;YAC/B,OAAO;YACP,+BAA+B;YAC/B,QAAQ;YACR,gBAAgB;YAChB,MAAM;YACN,gBAAgB;YAChB,MAAM,OAAO,GAAG;gBACZ,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE;gBAClC,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,EAAE;gBAC7B,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,EAAE;gBAC7B,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,EAAE;gBAC7B,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,EAAE,EAAE;aAC7B,CAAC;YAEF,EAAE,CAAC,iGAAiG,EAAE,GAAG,EAAE;gBACvG,MAAM,IAAI,GAAG,IAAA,0CAAgB,EAAC,OAAO,CAAC,CAAC;gBACvC,4DAA4D;gBAC5D,4DAA4D;gBAC5D,+DAA+D;gBAC/D,IAAA,aAAM,EAAC,IAAI,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;gBAChD,IAAA,aAAM,EAAC,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YAC9C,CAAC,CAAC,CAAC;QACP,CAAC,CAAC,CAAC;QAEH,QAAQ,CAAC,iCAAiC,EAAE,GAAG,EAAE;YAC7C,EAAE,CAAC,6CAA6C,EAAE,GAAG,EAAE;gBACnD,MAAM,IAAI,GAAG,IAAA,0CAAgB,EAAC,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;gBAC5D,IAAA,aAAM,EAAC,IAAI,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;gBAChD,IAAA,aAAM,EAAC,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YAC/C,CAAC,CAAC,CAAC;QACP,CAAC,CAAC,CAAC;IAEP,CAAC,CAAC,CAAC;IAEH,4EAA4E;IAC5E,oCAAoC;IACpC,4EAA4E;IAC5E,QAAQ,CAAC,mCAAmC,EAAE,GAAG,EAAE;QAC/C,0BAA0B;QAC1B,EAAE;QACF,+BAA+B;QAC/B,OAAO;QACP,qCAAqC;QACrC,QAAQ;QACR,4DAA4D;QAC5D,MAAM;QACN,gBAAgB;QAChB,EAAE;QACF,sEAAsE;QACtE,oDAAoD;QACpD,MAAM,OAAO,GAAG;YACZ,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE;YAClC,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,EAAE;YAC7B,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,EAAE;YAC7B,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,EAAE;YAC7B,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,EAAE,EAAE;SAC7B,CAAC;QAEF,EAAE,CAAC,uBAAuB,EAAE,GAAG,EAAE;YAC7B,MAAM,IAAI,GAAG,IAAA,0CAAgB,EAAC,OAAO,CAAC,CAAC;YACvC,IAAA,aAAM,EAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI;QAC1C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,yCAAyC,EAAE,GAAG,EAAE;YAC/C,MAAM,IAAI,GAAG,IAAA,0CAAgB,EAAC,OAAO,CAAC,CAAC;YACvC,IAAA,aAAM,EAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI;QAC1C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,gBAAgB,EAAE,GAAG,EAAE;YACtB,MAAM,IAAI,GAAG,IAAA,0CAAgB,EAAC,OAAO,CAAC,CAAC;YACvC,IAAA,aAAM,EAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI;QAC1C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,qEAAqE,EAAE,GAAG,EAAE;YAC3E,MAAM,IAAI,GAAG,IAAA,0CAAgB,EAAC,OAAO,CAAC,CAAC;YACvC,iEAAiE;YACjE,kEAAkE;YAClE,uCAAuC;YACvC,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACrB,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAChC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAC1C,CAAC;YACF,IAAA,aAAM,EAAC,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;QACzC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,qEAAqE,EAAE,GAAG,EAAE;YAC3E,kEAAkE;YAClE,6DAA6D;YAC7D,6DAA6D;YAC7D,kDAAkD;YAClD,MAAM,gBAAgB,GAAG;gBACrB,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE;gBAClC,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,EAAE;gBAC7B,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,EAAE;gBAC7B,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,EAAE;gBAC7B,4DAA4D;gBAC5D,+DAA+D;gBAC/D,gCAAgC;gBAChC,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,EAAE;gBAC7B,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,EAAE,EAAE;gBAC1B,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,EAAE,EAAE;aAC7B,CAAC;YACF,MAAM,IAAI,GAAG,IAAA,0CAAgB,EAAC,gBAAgB,CAAC,CAAC;YAChD,gEAAgE;YAChE,IAAA,aAAM,EAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACrC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,iFAAiF,EAAE,GAAG,EAAE;YACvF,MAAM,IAAI,GAAG,IAAA,0CAAgB,EAAC,OAAO,CAAC,CAAC;YACvC,8CAA8C;YAC9C,4EAA4E;YAC5E,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACrB,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC;YAC1B,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,UAAU,IAAI,CAAC,CAAC,QAAQ,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC;YACxG,IAAA,aAAM,EAAC,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACvC,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,4EAA4E;IAC5E,wBAAwB;IACxB,4EAA4E;IAC5E,QAAQ,CAAC,gBAAgB,EAAE,GAAG,EAAE;QAC5B,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;YACrC,kEAAkE;YAClE,0DAA0D;YAC1D,MAAM,OAAO,GAAG;gBACZ,EAAE,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,IAAI,CAAC,EAAE;gBAC/B,EAAE,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,IAAI,CAAC,EAAE;gBAC/B,EAAE,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,IAAI,CAAC,EAAE;gBAC/B,EAAE,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,IAAI,CAAC,EAAE;gBAC/B,EAAE,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,EAAE;gBAC3B,EAAE,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,EAAE;gBAC3B,EAAE,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,EAAE;gBAC3B,EAAE,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,EAAE;aAC9B,CAAC;YACF,MAAM,IAAI,GAAG,IAAA,0CAAgB,EAAC,OAAO,CAAC,CAAC;YACvC,wCAAwC;YACxC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,IAAA,aAAM,EAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;QAC5D,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,mDAAmD,EAAE,GAAG,EAAE;YACzD,4DAA4D;YAC5D,MAAM,OAAO,GAAG;gBACZ,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,EAAE;gBAC7B,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,EAAE;gBAC7B,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,EAAE;gBAC7B,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,EAAE;gBAC7B,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,EAAE;gBAC7B,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,EAAE;gBAC7B,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,EAAE;gBAC7B,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,EAAE;aAChC,CAAC;YACF,MAAM,IAAI,GAAG,IAAA,0CAAgB,EAAC,OAAO,CAAC,CAAC;YACvC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YAC/C,IAAA,aAAM,EAAC,OAAO,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,qBAAqB;YACvD,oCAAoC;YACpC,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC;YAC3C,IAAA,aAAM,EAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC;YAClC,IAAA,aAAM,EAAC,KAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACrC,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,4EAA4E;IAC5E,wBAAwB;IACxB,4EAA4E;IAC5E,QAAQ,CAAC,YAAY,EAAE,GAAG,EAAE;QACxB,EAAE,CAAC,6CAA6C,EAAE,GAAG,EAAE;YACnD,MAAM,OAAO,GAAG;gBACZ,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,EAAE;gBAC7B,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,EAAE;gBAC7B,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,EAAE;aAChC,CAAC;YACF,MAAM,IAAI,GAAG,IAAA,0CAAgB,EAAC,OAAO,CAAC,CAAC;YACvC,mEAAmE;YACnE,MAAM,YAAY,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,cAAc,CAAC,CAAC;YAC1E,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,IAAA,aAAM,EAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;QACrE,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,qDAAqD,EAAE,GAAG,EAAE;YAC3D,MAAM,OAAO,GAAG;gBACZ,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE;gBAClC,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,EAAE,EAAE;gBAC1B,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,EAAE,EAAE;aAC7B,CAAC;YACF,MAAM,IAAI,GAAG,IAAA,0CAAgB,EAAC,OAAO,CAAC,CAAC;YACvC,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACrB,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,YAAY,CAAC,CAAC;YAClE,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,IAAA,aAAM,EAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QACnE,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,iDAAiD,EAAE,GAAG,EAAE;YACvD,uDAAuD;YACvD,kDAAkD;YAClD,MAAM,QAAQ,GAAG;gBACb,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE;gBAClC,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,EAAE;gBAC7B,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,EAAE,EAAG,sBAAsB;gBACtD,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,EAAE,EAAE;aAC7B,CAAC;YACF,MAAM,IAAI,GAAG,IAAA,0CAAgB,EAAC,QAAQ,CAAC,CAAC;YACxC,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI;YAC1B,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC;YAC9D,sDAAsD;YACtD,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,IAAA,aAAM,EAAC,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAC/D,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,4EAA4E;IAC5E,yDAAyD;IACzD,4EAA4E;IAC5E,QAAQ,CAAC,0CAA0C,EAAE,GAAG,EAAE;QACtD,wEAAwE;QACxE,wEAAwE;QACxE,mDAAmD;QACnD,EAAE;QACF,2DAA2D;QAC3D,mEAAmE;QACnE,4CAA4C;QAC5C,mCAAmC;QACnC,MAAM,OAAO,GAAG;YACZ,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,EAAE;YAC7B,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,EAAE;YAC7B,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,EAAE;YAC7B,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,EAAE,EAAE;SAC7B,CAAC;QAEF,EAAE,CAAC,uBAAuB,EAAE,GAAG,EAAE;YAC7B,IAAA,aAAM,EAAC,IAAA,0CAAgB,EAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC1D,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,+CAA+C,EAAE,GAAG,EAAE;YACrD,IAAA,aAAM,EAAC,IAAA,0CAAgB,EAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC1D,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,4BAA4B,EAAE,GAAG,EAAE;YAClC,IAAA,aAAM,EAAC,IAAA,0CAAgB,EAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC1D,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,oFAAoF,EAAE,GAAG,EAAE;YAC1F,MAAM,IAAI,GAAG,IAAA,0CAAgB,EAAC,OAAO,CAAC,CAAC;YACvC,MAAM,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;YAC7B,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,YAAY,CAAC,CAAC;YAC9D,IAAA,aAAM,EAAC,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACzC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,kFAAkF,EAAE,GAAG,EAAE;YACxF,MAAM,IAAI,GAAG,IAAA,0CAAgB,EAAC,OAAO,CAAC,CAAC;YACvC,IAAA,aAAM,EAAC,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAC/C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,8FAA8F,EAAE,GAAG,EAAE;YACpG,MAAM,IAAI,GAAG,IAAA,0CAAgB,EAAC,OAAO,CAAC,CAAC;YACvC,IAAA,aAAM,EAAC,IAAI,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACnD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,6CAA6C,EAAE,GAAG,EAAE;YACnD,wEAAwE;YACxE,wDAAwD;YACxD,MAAM,IAAI,GAAG,IAAA,0CAAgB,EAAC,OAAO,CAAC,CAAC;YACvC,MAAM,OAAO,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC;YACjE,IAAA,aAAM,EAAC,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACvC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,6DAA6D,EAAE,GAAG,EAAE;YACnE,MAAM,IAAI,GAAG,IAAA,0CAAgB,EAAC,OAAO,CAAC,CAAC;YACvC,IAAA,aAAM,EAAC,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAC/C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,+DAA+D,EAAE,GAAG,EAAE;YACrE,MAAM,IAAI,GAAG,IAAA,0CAAgB,EAAC,OAAO,CAAC,CAAC;YACvC,IAAA,aAAM,EAAC,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QAC9C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,kDAAkD,EAAE,GAAG,EAAE;YACxD,uEAAuE;YACvE,MAAM,IAAI,GAAG,IAAA,0CAAgB,EAAC,OAAO,CAAC,CAAC;YACvC,MAAM,WAAW,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,cAAc,IAAI,CAAC,CAAC,QAAQ,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC;YAC7G,IAAA,aAAM,EAAC,WAAW,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC;QAC5C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,+CAA+C,EAAE,GAAG,EAAE;YACrD,4EAA4E;YAC5E,MAAM,IAAI,GAAG,IAAA,0CAAgB,EAAC,OAAO,CAAC,CAAC;YACvC,MAAM,OAAO,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,UAAU,IAAI,CAAC,CAAC,QAAQ,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC;YACrG,IAAA,aAAM,EAAC,OAAO,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC;QACxC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,qEAAqE,EAAE,GAAG,EAAE;YAC3E,MAAM,IAAI,GAAG,IAAA,0CAAgB,EAAC,OAAO,CAAC,CAAC;YACvC,MAAM,QAAQ,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,cAAc,CAAC,CAAC;YAC1G,IAAA,aAAM,EAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;QACrC,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,4EAA4E;IAC5E,iDAAiD;IACjD,4EAA4E;IAC5E,QAAQ,CAAC,gDAAgD,EAAE,GAAG,EAAE;QAC5D,wDAAwD;QACxD,oDAAoD;QACpD,MAAM,OAAO,GAAG;YACZ,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,EAAE;YAC7B,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,EAAE;YAC7B,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,CAAC,GAAG,CAAC,EAAE;YAC7B,EAAE,EAAE,EAAE,GAAG,EAAE,SAAS,EAAE,EAAE,EAAE;SAC7B,CAAC;QAEF,EAAE,CAAC,aAAa,EAAE,GAAG,EAAE;YACnB,MAAM,IAAI,GAAG,IAAA,0CAAgB,EAAC,OAAO,CAAC,CAAC;YACvC,IAAA,aAAM,EAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACrC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,aAAa,EAAE,GAAG,EAAE;YACnB,MAAM,IAAI,GAAG,IAAA,0CAAgB,EAAC,OAAO,CAAC,CAAC;YACvC,IAAA,aAAM,EAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACrC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,kCAAkC,EAAE,GAAG,EAAE;YACxC,+DAA+D;YAC/D,MAAM,IAAI,GAAG,IAAA,0CAAgB,EAAC,OAAO,CAAC,CAAC;YACvC,IAAA,aAAM,EAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACzC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,4EAA4E,EAAE,GAAG,EAAE;YAClF,MAAM,IAAI,GAAG,IAAA,0CAAgB,EAAC,OAAO,CAAC,CAAC;YACvC,MAAM,UAAU,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,YAAY,CAAC,CAAC;YACtE,IAAA,aAAM,EAAC,UAAU,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC1C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,iCAAiC,EAAE,GAAG,EAAE;YACvC,MAAM,IAAI,GAAG,IAAA,0CAAgB,EAAC,OAAO,CAAC,CAAC;YACvC,MAAM,UAAU,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,YAAY,CAAC,CAAC;YACtE,IAAA,aAAM,EAAC,UAAU,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC1C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,uFAAuF,EAAE,GAAG,EAAE;YAC7F,MAAM,IAAI,GAAG,IAAA,0CAAgB,EAAC,OAAO,CAAC,CAAC;YACvC,IAAA,aAAM,EAAC,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YAC3C,IAAA,aAAM,EAAC,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAC/C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,qCAAqC,EAAE,GAAG,EAAE;YAC3C,MAAM,IAAI,GAAG,IAAA,0CAAgB,EAAC,OAAO,CAAC,CAAC;YACvC,IAAA,aAAM,EAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC5E,IAAA,aAAM,EAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAChF,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,4DAA4D,EAAE,GAAG,EAAE;YAClE,MAAM,IAAI,GAAG,IAAA,0CAAgB,EAAC,OAAO,CAAC,CAAC;YACvC,mEAAmE;YACnE,uCAAuC;YACvC,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACrB,MAAM,gBAAgB,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CACpC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,UAAU,IAAI,CAAC,CAAC,QAAQ,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,MAAM,KAAK,IAAI,CAAC,IAAI,CACtF,CAAC;YACF,MAAM,gBAAgB,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CACpC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,UAAU,IAAI,CAAC,CAAC,QAAQ,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,MAAM,KAAK,IAAI,CAAC,IAAI,CACtF,CAAC;YACF,IAAA,aAAM,EAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC;YAC7C,IAAA,aAAM,EAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC;QACjD,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;AAEP,CAAC,CAAC,CAAC"}

package/lib/browser/scm-history-graph-model.d.ts

@@ -0,0 +1,46 @@
+import { DisposableCollection } from '@theia/core/lib/common/disposable';
+import { Emitter } from '@theia/core/lib/common/event';
+import { CancellationTokenSource } from '@theia/core/lib/common/cancellation';
+import { ScmService } from './scm-service';
+import { ScmHistoryItem, ScmHistoryProvider } from './scm-provider';
+import { GraphRow } from './scm-history-graph-lanes';
+export declare const PAGE_SIZE = 50;
+export interface HistoryGraphEntry {
+    readonly item: ScmHistoryItem;
+    readonly graphRow: GraphRow;
+}
+export declare class ScmHistoryGraphModel {
+    protected readonly scmService: ScmService;
+    protected readonly toDispose: DisposableCollection;
+    protected readonly toDisposeOnProviderChange: DisposableCollection;
+    protected _entries: HistoryGraphEntry[];
+    protected _hasMore: boolean;
+    protected _loading: boolean;
+    protected _hasAttemptedLoad: boolean;
+    protected _provider: ScmHistoryProvider | undefined;
+    protected readonly onDidChangeEmitter: Emitter<void>;
+    readonly onDidChange: import("@theia/core/lib/common/event").Event<void>;
+    protected cancelSource: CancellationTokenSource;
+    protected init(): void;
+    dispose(): void;
+    get provider(): ScmHistoryProvider | undefined;
+    get entries(): readonly HistoryGraphEntry[];
+    get hasMore(): boolean;
+    get loading(): boolean;
+    /**
+     * Returns true once the model has completed at least one load attempt
+     * (regardless of whether history items were found). This is used by
+     * the widget to distinguish "still initializing" from "no history".
+     */
+    get hasAttemptedLoad(): boolean;
+    refresh(): void;
+    loadMore(): Promise<void>;
+    protected loadPage(): Promise<void>;
+    /**
+     * Returns the revisions of the current branch ref, its remote tracking ref,
+     * and the merge-base ref to pass to `provideHistoryItems`. Providers walk
+     * history starting from these revisions.
+     */
+    protected getCurrentHistoryItemRefs(): string[];
+}
+//# sourceMappingURL=scm-history-graph-model.d.ts.map