@chenzy-design/core 0.1.0

package/dist/tree.test.js

@@ -0,0 +1,291 @@
+import { describe, expect, it } from 'vitest';
+import { flattenVisible, findNode, collectExpandable, collectExpandableToDepth, conduct, toggleCheck, normalizeToLeaves, computeFilteredKeys, computeDropPosition, isAncestorOrSelf, collectCheckedByStrategy, siblingKeys, accordionExpand, } from './tree.js';
+const data = [
+    {
+        key: '1',
+        label: 'Root 1',
+        children: [
+            { key: '1-1', label: 'Child 1-1' },
+            {
+                key: '1-2',
+                label: 'Child 1-2',
+                children: [
+                    { key: '1-2-1', label: 'Leaf 1-2-1' },
+                    { key: '1-2-2', label: 'Leaf 1-2-2' },
+                ],
+            },
+        ],
+    },
+    { key: '2', label: 'Root 2' },
+];
+describe('flattenVisible', () => {
+    it('shows only roots when nothing expanded', () => {
+        const flat = flattenVisible(data, new Set());
+        expect(flat.map((f) => f.node.key)).toEqual(['1', '2']);
+        expect(flat[0]?.hasChildren).toBe(true);
+        expect(flat[1]?.hasChildren).toBe(false);
+    });
+    it('reveals children of expanded nodes in document order', () => {
+        const flat = flattenVisible(data, new Set(['1', '1-2']));
+        expect(flat.map((f) => f.node.key)).toEqual([
+            '1',
+            '1-1',
+            '1-2',
+            '1-2-1',
+            '1-2-2',
+            '2',
+        ]);
+    });
+    it('reports level, posInSet and setSize', () => {
+        const flat = flattenVisible(data, new Set(['1']));
+        const child = flat.find((f) => f.node.key === '1-2');
+        expect(child?.level).toBe(1);
+        expect(child?.posInSet).toBe(2);
+        expect(child?.setSize).toBe(2);
+        expect(child?.parentKey).toBe('1');
+    });
+    it('reports isLast and ancestorIsLast for tree guide lines', () => {
+        const flat = flattenVisible(data, new Set(['1', '1-2']));
+        const byKey = (k) => flat.find((f) => f.node.key === k);
+        // root '1' has sibling '2' after it → not last; root level has no ancestors
+        expect(byKey('1')?.isLast).toBe(false);
+        expect(byKey('1')?.ancestorIsLast).toEqual([]);
+        // '1-2' is the last child of '1'; its ancestor '1' was NOT last
+        expect(byKey('1-2')?.isLast).toBe(true);
+        expect(byKey('1-2')?.ancestorIsLast).toEqual([false]);
+        // '1-2-1' ancestors: '1'(false) then '1-2'(true)
+        expect(byKey('1-2-1')?.ancestorIsLast).toEqual([false, true]);
+        expect(byKey('1-2-1')?.isLast).toBe(false);
+        // last root '2'
+        expect(byKey('2')?.isLast).toBe(true);
+    });
+});
+describe('findNode / collectExpandable', () => {
+    it('finds a deep node', () => {
+        expect(findNode(data, '1-2-1')?.label).toBe('Leaf 1-2-1');
+        expect(findNode(data, 'nope')).toBeUndefined();
+    });
+    it('collects every parent key', () => {
+        expect(collectExpandable(data).sort()).toEqual(['1', '1-2']);
+    });
+    it('collects parents up to a depth', () => {
+        expect(collectExpandableToDepth(data, 1)).toEqual(['1']);
+        expect(collectExpandableToDepth(data, 2).sort()).toEqual(['1', '1-2']);
+    });
+    it('depth 0 (or below) expands nothing', () => {
+        expect(collectExpandableToDepth(data, 0)).toEqual([]);
+        expect(collectExpandableToDepth(data, -1)).toEqual([]);
+    });
+    it('depth beyond tree height is clamped to every parent', () => {
+        expect(collectExpandableToDepth(data, 99).sort()).toEqual(collectExpandable(data).sort());
+    });
+});
+describe('conduct (related mode)', () => {
+    it('checking a parent fully checks it; leaves drive parent state', () => {
+        // base = the two leaves of 1-2
+        const { checked, half } = conduct(data, new Set(['1-2-1', '1-2-2']));
+        expect(checked.has('1-2')).toBe(true); // all children checked → parent checked
+        expect(half.has('1')).toBe(true); // 1 has 1-1 unchecked → half
+        expect(checked.has('1')).toBe(false);
+    });
+    it('partial children → parent half-checked', () => {
+        const { checked, half } = conduct(data, new Set(['1-2-1']));
+        expect(half.has('1-2')).toBe(true);
+        expect(half.has('1')).toBe(true);
+        expect(checked.has('1-2')).toBe(false);
+    });
+    it('all leaves checked → root checked, no half', () => {
+        const { checked, half } = conduct(data, new Set(['1-1', '1-2-1', '1-2-2']));
+        expect(checked.has('1')).toBe(true);
+        expect(half.size).toBe(0);
+    });
+    it('disabled leaves are excluded from the count', () => {
+        const d = [
+            {
+                key: 'p',
+                label: 'P',
+                children: [
+                    { key: 'a', label: 'A' },
+                    { key: 'b', label: 'B', disabled: true },
+                ],
+            },
+        ];
+        // only enabled leaf 'a' checked → parent fully checked (b ignored)
+        const { checked, half } = conduct(d, new Set(['a']));
+        expect(checked.has('p')).toBe(true);
+        expect(half.has('p')).toBe(false);
+    });
+});
+describe('toggleCheck', () => {
+    it('toggles a leaf on and off', () => {
+        const on = toggleCheck(data, new Set(), '1-1');
+        expect(on.has('1-1')).toBe(true);
+        const off = toggleCheck(data, on, '1-1');
+        expect(off.has('1-1')).toBe(false);
+    });
+    it('toggling a parent toggles all its leaves', () => {
+        const on = toggleCheck(data, new Set(), '1-2');
+        expect(on.has('1-2-1')).toBe(true);
+        expect(on.has('1-2-2')).toBe(true);
+        const off = toggleCheck(data, on, '1-2');
+        expect(off.has('1-2-1')).toBe(false);
+        expect(off.has('1-2-2')).toBe(false);
+    });
+    it('round-trips conduct output: unchecking a leaf after conduct removes it', () => {
+        // simulate the controlled flow: check a parent, run conduct (adds parent keys),
+        // feed that polluted set back, then uncheck a single leaf.
+        const base = toggleCheck(data, new Set(), '1'); // check whole subtree under root 1
+        const { checked } = conduct(data, base); // checked now contains parent keys '1','1-2'
+        expect(checked.has('1')).toBe(true);
+        // feed conduct output (with parent keys) back and uncheck a deep leaf
+        const next = toggleCheck(data, checked, '1-2-1');
+        expect(next.has('1-2-1')).toBe(false); // the leaf is actually removed
+        expect(next.has('1-1')).toBe(true); // siblings stay
+        const re = conduct(data, next);
+        expect(re.checked.has('1')).toBe(false); // root no longer fully checked
+        expect(re.half.has('1')).toBe(true); // root half-checked
+    });
+});
+describe('normalizeToLeaves', () => {
+    it('expands parent keys to their leaves and keeps leaves as-is', () => {
+        const norm = normalizeToLeaves(data, new Set(['1-2', '1-1']));
+        expect([...norm].sort()).toEqual(['1-1', '1-2-1', '1-2-2']);
+    });
+    it('drops unknown keys', () => {
+        expect(normalizeToLeaves(data, new Set(['ghost'])).size).toBe(0);
+    });
+});
+describe('computeFilteredKeys', () => {
+    it('expands ancestor chain of a match', () => {
+        const { matched, expand } = computeFilteredKeys(data, (n) => n.label.includes('1-2-1'));
+        expect(matched.has('1-2-1')).toBe(true);
+        expect(expand.has('1')).toBe(true);
+        expect(expand.has('1-2')).toBe(true);
+        expect(expand.has('2')).toBe(false);
+    });
+    it('returns empty sets when nothing matches', () => {
+        const { matched, expand } = computeFilteredKeys(data, () => false);
+        expect(matched.size).toBe(0);
+        expect(expand.size).toBe(0);
+    });
+    it('works with an arbitrary custom predicate (filterTreeNode 谓词)', () => {
+        // a predicate keying off something other than label substring
+        const { matched, expand } = computeFilteredKeys(data, (n) => String(n.key).endsWith('-1'));
+        expect(matched.has('1-1')).toBe(true);
+        expect(matched.has('1-2-1')).toBe(true);
+        // ancestor chain of every match is expanded
+        expect(expand.has('1')).toBe(true);
+        expect(expand.has('1-2')).toBe(true);
+    });
+});
+describe('computeDropPosition', () => {
+    it('splits a 32px row into before / inside / after thirds', () => {
+        expect(computeDropPosition(4, 32)).toBe('before'); // < 8 (1/4)
+        expect(computeDropPosition(16, 32)).toBe('inside'); // middle
+        expect(computeDropPosition(28, 32)).toBe('after'); // > 24 (3/4)
+    });
+    it('boundaries: edges fold to inside', () => {
+        expect(computeDropPosition(8, 32)).toBe('inside'); // not < 8
+        expect(computeDropPosition(24, 32)).toBe('inside'); // not > 24
+    });
+    it('clamps out-of-range offsets', () => {
+        expect(computeDropPosition(-10, 32)).toBe('before');
+        expect(computeDropPosition(999, 32)).toBe('after');
+    });
+    it('only before/after when inside not allowed (leaf target)', () => {
+        expect(computeDropPosition(10, 32, false)).toBe('before');
+        expect(computeDropPosition(20, 32, false)).toBe('after');
+        expect(computeDropPosition(16, 32, false)).toBe('after'); // exactly half → after
+    });
+    it('degenerate row height returns after', () => {
+        expect(computeDropPosition(0, 0)).toBe('after');
+    });
+});
+describe('isAncestorOrSelf', () => {
+    it('is true for the same key', () => {
+        expect(isAncestorOrSelf(data, '1', '1')).toBe(true);
+    });
+    it('is true for a descendant', () => {
+        expect(isAncestorOrSelf(data, '1', '1-1')).toBe(true);
+        expect(isAncestorOrSelf(data, '1', '1-2-1')).toBe(true);
+    });
+    it('is false for unrelated nodes', () => {
+        expect(isAncestorOrSelf(data, '1-1', '1')).toBe(false);
+        expect(isAncestorOrSelf(data, '2', '1-1')).toBe(false);
+    });
+});
+describe('siblingKeys', () => {
+    it('returns root siblings excluding self', () => {
+        expect(siblingKeys(data, '1')).toEqual(['2']);
+        expect(siblingKeys(data, '2')).toEqual(['1']);
+    });
+    it('returns same-parent siblings excluding self', () => {
+        expect(siblingKeys(data, '1-1')).toEqual(['1-2']);
+        expect(siblingKeys(data, '1-2')).toEqual(['1-1']);
+    });
+    it('returns deeper-level siblings', () => {
+        expect(siblingKeys(data, '1-2-1')).toEqual(['1-2-2']);
+    });
+    it('returns empty for unknown key', () => {
+        expect(siblingKeys(data, 'nope')).toEqual([]);
+    });
+});
+describe('accordionExpand', () => {
+    it('adds key and removes its siblings', () => {
+        // expand 1-2 while 1-1 already expanded → 1-1 collapses
+        const next = accordionExpand(data, new Set(['1', '1-1']), '1-2');
+        expect([...next].sort()).toEqual(['1', '1-2']);
+    });
+    it('keeps non-sibling expanded nodes (different level not mutually exclusive)', () => {
+        // 1 (root) expanded, expand 1-2-1 deep child → root 1 untouched
+        const next = accordionExpand(data, new Set(['1', '1-2']), '1-2-1');
+        expect([...next].sort()).toEqual(['1', '1-2', '1-2-1']);
+    });
+    it('collapses other root when expanding a root', () => {
+        const next = accordionExpand(data, new Set(['2']), '1');
+        expect([...next]).toEqual(['1']);
+    });
+    it('does not mutate the input set', () => {
+        const input = new Set(['1', '1-1']);
+        accordionExpand(data, input, '1-2');
+        expect([...input].sort()).toEqual(['1', '1-1']);
+    });
+});
+describe('collectCheckedByStrategy', () => {
+    // Fully check the whole tree: conduct returns every node as checked.
+    const allChecked = conduct(data, new Set(['1', '2'])).checked;
+    it("'all' returns every checked node in document order", () => {
+        expect(collectCheckedByStrategy(data, allChecked, 'all')).toEqual([
+            '1',
+            '1-1',
+            '1-2',
+            '1-2-1',
+            '1-2-2',
+            '2',
+        ]);
+    });
+    it("'parent' collapses fully-checked subtrees to top-most parents", () => {
+        expect(collectCheckedByStrategy(data, allChecked, 'parent')).toEqual(['1', '2']);
+    });
+    it("'child' keeps only checked leaves", () => {
+        expect(collectCheckedByStrategy(data, allChecked, 'child')).toEqual([
+            '1-1',
+            '1-2-1',
+            '1-2-2',
+            '2',
+        ]);
+    });
+    it('partial check: parent keeps deepest fully-checked node, not half parent', () => {
+        const partial = conduct(data, new Set(['1-2'])).checked; // 1-2 + its leaves
+        expect(collectCheckedByStrategy(data, partial, 'parent')).toEqual(['1-2']);
+        expect(collectCheckedByStrategy(data, partial, 'child')).toEqual(['1-2-1', '1-2-2']);
+        expect(collectCheckedByStrategy(data, partial, 'all')).toEqual(['1-2', '1-2-1', '1-2-2']);
+    });
+    it('empty checked set yields empty for all strategies', () => {
+        const empty = new Set();
+        expect(collectCheckedByStrategy(data, empty, 'all')).toEqual([]);
+        expect(collectCheckedByStrategy(data, empty, 'parent')).toEqual([]);
+        expect(collectCheckedByStrategy(data, empty, 'child')).toEqual([]);
+    });
+});
+//# sourceMappingURL=tree.test.js.map

package/dist/tree.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree.test.js","sourceRoot":"","sources":["../src/tree.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,QAAQ,CAAC;AAC9C,OAAO,EACL,cAAc,EACd,QAAQ,EACR,iBAAiB,EACjB,wBAAwB,EACxB,OAAO,EACP,WAAW,EACX,iBAAiB,EACjB,mBAAmB,EACnB,mBAAmB,EACnB,gBAAgB,EAChB,wBAAwB,EACxB,WAAW,EACX,eAAe,GAEhB,MAAM,WAAW,CAAC;AAEnB,MAAM,IAAI,GAAmB;IAC3B;QACE,GAAG,EAAE,GAAG;QACR,KAAK,EAAE,QAAQ;QACf,QAAQ,EAAE;YACR,EAAE,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,WAAW,EAAE;YAClC;gBACE,GAAG,EAAE,KAAK;gBACV,KAAK,EAAE,WAAW;gBAClB,QAAQ,EAAE;oBACR,EAAE,GAAG,EAAE,OAAO,EAAE,KAAK,EAAE,YAAY,EAAE;oBACrC,EAAE,GAAG,EAAE,OAAO,EAAE,KAAK,EAAE,YAAY,EAAE;iBACtC;aACF;SACF;KACF;IACD,EAAE,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,QAAQ,EAAE;CAC9B,CAAC;AAEF,QAAQ,CAAC,gBAAgB,EAAE,GAAG,EAAE;IAC9B,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;QAChD,MAAM,IAAI,GAAG,cAAc,CAAC,IAAI,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QAC7C,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QACxD,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,MAAM,IAAI,GAAG,cAAc,CAAC,IAAI,EAAE,IAAI,GAAG,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QACzD,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC;YAC1C,GAAG;YACH,KAAK;YACL,KAAK;YACL,OAAO;YACP,OAAO;YACP,GAAG;SACJ,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qCAAqC,EAAE,GAAG,EAAE;QAC7C,MAAM,IAAI,GAAG,cAAc,CAAC,IAAI,EAAE,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAClD,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,KAAK,KAAK,CAAC,CAAC;QACrD,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAChC,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC/B,MAAM,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,wDAAwD,EAAE,GAAG,EAAE;QAChE,MAAM,IAAI,GAAG,cAAc,CAAC,IAAI,EAAE,IAAI,GAAG,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QACzD,MAAM,KAAK,GAAG,CAAC,CAAS,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;QAChE,4EAA4E;QAC5E,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACvC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,cAAc,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QAC/C,gEAAgE;QAChE,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,cAAc,CAAC,CAAC,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QACtD,iDAAiD;QACjD,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,cAAc,CAAC,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;QAC9D,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC3C,gBAAgB;QAChB,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,8BAA8B,EAAE,GAAG,EAAE;IAC5C,EAAE,CAAC,mBAAmB,EAAE,GAAG,EAAE;QAC3B,MAAM,CAAC,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE,KAAK,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QAC1D,MAAM,CAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,aAAa,EAAE,CAAC;IACjD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,2BAA2B,EAAE,GAAG,EAAE;QACnC,MAAM,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC;IAC/D,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gCAAgC,EAAE,GAAG,EAAE;QACxC,MAAM,CAAC,wBAAwB,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACzD,MAAM,CAAC,wBAAwB,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC;IACzE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;QAC5C,MAAM,CAAC,wBAAwB,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACtD,MAAM,CAAC,wBAAwB,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qDAAqD,EAAE,GAAG,EAAE;QAC7D,MAAM,CAAC,wBAAwB,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;IAC5F,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,wBAAwB,EAAE,GAAG,EAAE;IACtC,EAAE,CAAC,8DAA8D,EAAE,GAAG,EAAE;QACtE,+BAA+B;QAC/B,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,GAAG,OAAO,CAAC,IAAI,EAAE,IAAI,GAAG,CAAC,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;QACrE,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,wCAAwC;QAC/E,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,6BAA6B;QAC/D,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;QAChD,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,GAAG,OAAO,CAAC,IAAI,EAAE,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAC5D,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,GAAG,OAAO,CAAC,IAAI,EAAE,IAAI,GAAG,CAAC,CAAC,KAAK,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;QAC5E,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,CAAC,GAAmB;YACxB;gBACE,GAAG,EAAE,GAAG;gBACR,KAAK,EAAE,GAAG;gBACV,QAAQ,EAAE;oBACR,EAAE,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE;oBACxB,EAAE,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,QAAQ,EAAE,IAAI,EAAE;iBACzC;aACF;SACF,CAAC;QACF,mEAAmE;QACnE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,GAAG,OAAO,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACrD,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,aAAa,EAAE,GAAG,EAAE;IAC3B,EAAE,CAAC,2BAA2B,EAAE,GAAG,EAAE;QACnC,MAAM,EAAE,GAAG,WAAW,CAAC,IAAI,EAAE,IAAI,GAAG,EAAE,EAAE,KAAK,CAAC,CAAC;QAC/C,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjC,MAAM,GAAG,GAAG,WAAW,CAAC,IAAI,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC;QACzC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,0CAA0C,EAAE,GAAG,EAAE;QAClD,MAAM,EAAE,GAAG,WAAW,CAAC,IAAI,EAAE,IAAI,GAAG,EAAE,EAAE,KAAK,CAAC,CAAC;QAC/C,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,MAAM,GAAG,GAAG,WAAW,CAAC,IAAI,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC;QACzC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACrC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,wEAAwE,EAAE,GAAG,EAAE;QAChF,gFAAgF;QAChF,2DAA2D;QAC3D,MAAM,IAAI,GAAG,WAAW,CAAC,IAAI,EAAE,IAAI,GAAG,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC,mCAAmC;QACnF,MAAM,EAAE,OAAO,EAAE,GAAG,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,6CAA6C;QACtF,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpC,sEAAsE;QACtE,MAAM,IAAI,GAAG,WAAW,CAAC,IAAI,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;QACjD,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,+BAA+B;QACtE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,gBAAgB;QACpD,MAAM,EAAE,GAAG,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAC/B,MAAM,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,+BAA+B;QACxE,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,oBAAoB;IAC3D,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,mBAAmB,EAAE,GAAG,EAAE;IACjC,EAAE,CAAC,4DAA4D,EAAE,GAAG,EAAE;QACpE,MAAM,IAAI,GAAG,iBAAiB,CAAC,IAAI,EAAE,IAAI,GAAG,CAAC,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QAC9D,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC;IAC9D,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,oBAAoB,EAAE,GAAG,EAAE;QAC5B,MAAM,CAAC,iBAAiB,CAAC,IAAI,EAAE,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACnE,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,qBAAqB,EAAE,GAAG,EAAE;IACnC,EAAE,CAAC,mCAAmC,EAAE,GAAG,EAAE;QAC3C,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,mBAAmB,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,CAC1D,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,CAC1B,CAAC;QACF,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yCAAyC,EAAE,GAAG,EAAE;QACjD,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,mBAAmB,CAAC,IAAI,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC;QACnE,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7B,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9B,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,8DAA8D,EAAE,GAAG,EAAE;QACtE,8DAA8D;QAC9D,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,mBAAmB,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;QAC3F,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxC,4CAA4C;QAC5C,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,qBAAqB,EAAE,GAAG,EAAE;IACnC,EAAE,CAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,MAAM,CAAC,mBAAmB,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,YAAY;QAC/D,MAAM,CAAC,mBAAmB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS;QAC7D,MAAM,CAAC,mBAAmB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,aAAa;IAClE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,kCAAkC,EAAE,GAAG,EAAE;QAC1C,MAAM,CAAC,mBAAmB,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,UAAU;QAC7D,MAAM,CAAC,mBAAmB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,WAAW;IACjE,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6BAA6B,EAAE,GAAG,EAAE;QACrC,MAAM,CAAC,mBAAmB,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACpD,MAAM,CAAC,mBAAmB,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACrD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yDAAyD,EAAE,GAAG,EAAE;QACjE,MAAM,CAAC,mBAAmB,CAAC,EAAE,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC1D,MAAM,CAAC,mBAAmB,CAAC,EAAE,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACzD,MAAM,CAAC,mBAAmB,CAAC,EAAE,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,uBAAuB;IACnF,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qCAAqC,EAAE,GAAG,EAAE;QAC7C,MAAM,CAAC,mBAAmB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;IAChC,EAAE,CAAC,0BAA0B,EAAE,GAAG,EAAE;QAClC,MAAM,CAAC,gBAAgB,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,0BAA0B,EAAE,GAAG,EAAE;QAClC,MAAM,CAAC,gBAAgB,CAAC,IAAI,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtD,MAAM,CAAC,gBAAgB,CAAC,IAAI,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1D,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,8BAA8B,EAAE,GAAG,EAAE;QACtC,MAAM,CAAC,gBAAgB,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACvD,MAAM,CAAC,gBAAgB,CAAC,IAAI,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,aAAa,EAAE,GAAG,EAAE;IAC3B,EAAE,CAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,MAAM,CAAC,WAAW,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC9C,MAAM,CAAC,WAAW,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;IACH,EAAE,CAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,CAAC,WAAW,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAClD,MAAM,CAAC,WAAW,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IACpD,CAAC,CAAC,CAAC;IACH,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;QACvC,MAAM,CAAC,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC;IACxD,CAAC,CAAC,CAAC;IACH,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;QACvC,MAAM,CAAC,WAAW,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,iBAAiB,EAAE,GAAG,EAAE;IAC/B,EAAE,CAAC,mCAAmC,EAAE,GAAG,EAAE;QAC3C,wDAAwD;QACxD,MAAM,IAAI,GAAG,eAAe,CAAC,IAAI,EAAE,IAAI,GAAG,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QACjE,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC;IACjD,CAAC,CAAC,CAAC;IACH,EAAE,CAAC,2EAA2E,EAAE,GAAG,EAAE;QACnF,gEAAgE;QAChE,MAAM,IAAI,GAAG,eAAe,CAAC,IAAI,EAAE,IAAI,GAAG,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;QACnE,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC;IAC1D,CAAC,CAAC,CAAC;IACH,EAAE,CAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,MAAM,IAAI,GAAG,eAAe,CAAC,IAAI,EAAE,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QACxD,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IACH,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;QACvC,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC;QACpC,eAAe,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;QACpC,MAAM,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,0BAA0B,EAAE,GAAG,EAAE;IACxC,qEAAqE;IACrE,MAAM,UAAU,GAAG,OAAO,CAAC,IAAI,EAAE,IAAI,GAAG,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC;IAE9D,EAAE,CAAC,oDAAoD,EAAE,GAAG,EAAE;QAC5D,MAAM,CAAC,wBAAwB,CAAC,IAAI,EAAE,UAAU,EAAE,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC;YAChE,GAAG;YACH,KAAK;YACL,KAAK;YACL,OAAO;YACP,OAAO;YACP,GAAG;SACJ,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,+DAA+D,EAAE,GAAG,EAAE;QACvE,MAAM,CAAC,wBAAwB,CAAC,IAAI,EAAE,UAAU,EAAE,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IACnF,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mCAAmC,EAAE,GAAG,EAAE;QAC3C,MAAM,CAAC,wBAAwB,CAAC,IAAI,EAAE,UAAU,EAAE,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC;YAClE,KAAK;YACL,OAAO;YACP,OAAO;YACP,GAAG;SACJ,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,yEAAyE,EAAE,GAAG,EAAE;QACjF,MAAM,OAAO,GAAG,OAAO,CAAC,IAAI,EAAE,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,mBAAmB;QAC5E,MAAM,CAAC,wBAAwB,CAAC,IAAI,EAAE,OAAO,EAAE,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;QAC3E,MAAM,CAAC,wBAAwB,CAAC,IAAI,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC;QACrF,MAAM,CAAC,wBAAwB,CAAC,IAAI,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC;IAC5F,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mDAAmD,EAAE,GAAG,EAAE;QAC3D,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;QAChC,MAAM,CAAC,wBAAwB,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACjE,MAAM,CAAC,wBAAwB,CAAC,IAAI,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACpE,MAAM,CAAC,wBAAwB,CAAC,IAAI,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IACrE,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/upload.d.ts

@@ -0,0 +1,62 @@
+/**
+ * upload — framework-agnostic helpers for file upload progress/state.
+ * Pure functions; the render layer owns the XHR. See specs/components/input/Upload.spec.md.
+ */
+/**
+ * Percent complete (0–100, integer) from loaded/total bytes. Clamps to [0,100];
+ * returns 0 when total is 0/unknown (避免除零得到 NaN/Infinity)。
+ */
+export declare function computeUploadPercent(loaded: number, total: number): number;
+/** Whether an HTTP status code counts as a successful upload (2xx). */
+export declare function isUploadOk(status: number): boolean;
+/** A unit of work the queue can run; resolves when the upload settles. */
+export type UploadTask = () => void | Promise<void>;
+export interface UploadQueue {
+    /** Enqueue a task; runs immediately if a slot is free, else waits in FIFO order. */
+    add: (task: UploadTask) => void;
+    /** Number of tasks currently running. */
+    readonly active: number;
+    /** Number of tasks waiting for a free slot. */
+    readonly pending: number;
+}
+/**
+ * Concurrency-limited FIFO scheduler. At most `limit` tasks run at once;
+ * when one settles, the next queued task starts (complete-one-refill-one).
+ *
+ * `limit <= 0` means unlimited — every task starts immediately, preserving
+ * the no-throttle behaviour. Pure of any DOM: the render layer wraps each
+ * XHR in a task whose promise settles on load/error/abort.
+ */
+export declare function createUploadQueue(limit?: number): UploadQueue;
+/** Why a file failed size validation (or `null` when it passes). */
+export type UploadSizeError = 'min' | 'max' | null;
+/**
+ * Validate one file's size against optional bounds (both in KB, matching the
+ * `maxSize` / `minSize` props). Pure: the render layer maps the result onto
+ * item status + an i18n message.
+ *
+ * - `max` when `maxSize` is set and `size > maxSize * 1024`.
+ * - `min` when `minSize` is set and `size < minSize * 1024`.
+ * - `null` otherwise (no bound set, or within range).
+ *
+ * `max` is checked first so a single offending file reports the upper bound
+ * when both are somehow violated (cannot happen for a coherent min ≤ max).
+ */
+export declare function validateFileSize(bytes: number, opts?: {
+    minSize?: number | undefined;
+    maxSize?: number | undefined;
+}): UploadSizeError;
+/**
+ * Normalise a `beforeUpload` result into an action for one file.
+ * - `false` → skip the file (treat as rejected/removed).
+ * - `true` / `undefined` → upload the original file.
+ * - a `File` → upload this (possibly transformed) file instead.
+ */
+export type BeforeUploadResult = boolean | File | void;
+export interface BeforeUploadDecision {
+    upload: boolean;
+    /** The file to upload when `upload` is true (original or replacement). */
+    file?: File;
+}
+export declare function resolveBeforeUpload(original: File, result: BeforeUploadResult): BeforeUploadDecision;
+//# sourceMappingURL=upload.d.ts.map

package/dist/upload.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"upload.d.ts","sourceRoot":"","sources":["../src/upload.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;;GAGG;AACH,wBAAgB,oBAAoB,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,MAAM,CAI1E;AAED,uEAAuE;AACvE,wBAAgB,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAElD;AAED,0EAA0E;AAC1E,MAAM,MAAM,UAAU,GAAG,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;AAEpD,MAAM,WAAW,WAAW;IAC1B,oFAAoF;IACpF,GAAG,EAAE,CAAC,IAAI,EAAE,UAAU,KAAK,IAAI,CAAC;IAChC,yCAAyC;IACzC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,+CAA+C;IAC/C,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;CAC1B;AAED;;;;;;;GAOG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,SAAI,GAAG,WAAW,CAgCxD;AAED,oEAAoE;AACpE,MAAM,MAAM,eAAe,GAAG,KAAK,GAAG,KAAK,GAAG,IAAI,CAAC;AAEnD;;;;;;;;;;;GAWG;AACH,wBAAgB,gBAAgB,CAC9B,KAAK,EAAE,MAAM,EACb,IAAI,GAAE;IAAE,OAAO,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAAC,OAAO,CAAC,EAAE,MAAM,GAAG,SAAS,CAAA;CAAO,GACxE,eAAe,CAKjB;AAED;;;;;GAKG;AACH,MAAM,MAAM,kBAAkB,GAAG,OAAO,GAAG,IAAI,GAAG,IAAI,CAAC;AAEvD,MAAM,WAAW,oBAAoB;IACnC,MAAM,EAAE,OAAO,CAAC;IAChB,0EAA0E;IAC1E,IAAI,CAAC,EAAE,IAAI,CAAC;CACb;AAED,wBAAgB,mBAAmB,CACjC,QAAQ,EAAE,IAAI,EACd,MAAM,EAAE,kBAAkB,GACzB,oBAAoB,CAItB"}

package/dist/upload.js

@@ -0,0 +1,85 @@
+/**
+ * upload — framework-agnostic helpers for file upload progress/state.
+ * Pure functions; the render layer owns the XHR. See specs/components/input/Upload.spec.md.
+ */
+/**
+ * Percent complete (0–100, integer) from loaded/total bytes. Clamps to [0,100];
+ * returns 0 when total is 0/unknown (避免除零得到 NaN/Infinity)。
+ */
+export function computeUploadPercent(loaded, total) {
+    if (total <= 0)
+        return 0;
+    const pct = Math.round((loaded / total) * 100);
+    return Math.min(100, Math.max(0, pct));
+}
+/** Whether an HTTP status code counts as a successful upload (2xx). */
+export function isUploadOk(status) {
+    return status >= 200 && status < 300;
+}
+/**
+ * Concurrency-limited FIFO scheduler. At most `limit` tasks run at once;
+ * when one settles, the next queued task starts (complete-one-refill-one).
+ *
+ * `limit <= 0` means unlimited — every task starts immediately, preserving
+ * the no-throttle behaviour. Pure of any DOM: the render layer wraps each
+ * XHR in a task whose promise settles on load/error/abort.
+ */
+export function createUploadQueue(limit = 0) {
+    const waiting = [];
+    let active = 0;
+    const unlimited = limit <= 0;
+    function runNext() {
+        while ((unlimited || active < limit) && waiting.length > 0) {
+            const task = waiting.shift();
+            active++;
+            // Normalise sync/async/throwing tasks into a single settle path.
+            Promise.resolve()
+                .then(task)
+                .catch(() => { })
+                .finally(() => {
+                active--;
+                runNext();
+            });
+        }
+    }
+    return {
+        add(task) {
+            waiting.push(task);
+            runNext();
+        },
+        get active() {
+            return active;
+        },
+        get pending() {
+            return waiting.length;
+        },
+    };
+}
+/**
+ * Validate one file's size against optional bounds (both in KB, matching the
+ * `maxSize` / `minSize` props). Pure: the render layer maps the result onto
+ * item status + an i18n message.
+ *
+ * - `max` when `maxSize` is set and `size > maxSize * 1024`.
+ * - `min` when `minSize` is set and `size < minSize * 1024`.
+ * - `null` otherwise (no bound set, or within range).
+ *
+ * `max` is checked first so a single offending file reports the upper bound
+ * when both are somehow violated (cannot happen for a coherent min ≤ max).
+ */
+export function validateFileSize(bytes, opts = {}) {
+    const { minSize, maxSize } = opts;
+    if (maxSize !== undefined && bytes > maxSize * 1024)
+        return 'max';
+    if (minSize !== undefined && bytes < minSize * 1024)
+        return 'min';
+    return null;
+}
+export function resolveBeforeUpload(original, result) {
+    if (result === false)
+        return { upload: false };
+    if (result instanceof File)
+        return { upload: true, file: result };
+    return { upload: true, file: original };
+}
+//# sourceMappingURL=upload.js.map

package/dist/upload.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"upload.js","sourceRoot":"","sources":["../src/upload.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;;GAGG;AACH,MAAM,UAAU,oBAAoB,CAAC,MAAc,EAAE,KAAa;IAChE,IAAI,KAAK,IAAI,CAAC;QAAE,OAAO,CAAC,CAAC;IACzB,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,GAAG,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC;IAC/C,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;AACzC,CAAC;AAED,uEAAuE;AACvE,MAAM,UAAU,UAAU,CAAC,MAAc;IACvC,OAAO,MAAM,IAAI,GAAG,IAAI,MAAM,GAAG,GAAG,CAAC;AACvC,CAAC;AAcD;;;;;;;GAOG;AACH,MAAM,UAAU,iBAAiB,CAAC,KAAK,GAAG,CAAC;IACzC,MAAM,OAAO,GAAiB,EAAE,CAAC;IACjC,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,MAAM,SAAS,GAAG,KAAK,IAAI,CAAC,CAAC;IAE7B,SAAS,OAAO;QACd,OAAO,CAAC,SAAS,IAAI,MAAM,GAAG,KAAK,CAAC,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3D,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,EAAG,CAAC;YAC9B,MAAM,EAAE,CAAC;YACT,iEAAiE;YACjE,OAAO,CAAC,OAAO,EAAE;iBACd,IAAI,CAAC,IAAI,CAAC;iBACV,KAAK,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC;iBACf,OAAO,CAAC,GAAG,EAAE;gBACZ,MAAM,EAAE,CAAC;gBACT,OAAO,EAAE,CAAC;YACZ,CAAC,CAAC,CAAC;QACP,CAAC;IACH,CAAC;IAED,OAAO;QACL,GAAG,CAAC,IAAgB;YAClB,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACnB,OAAO,EAAE,CAAC;QACZ,CAAC;QACD,IAAI,MAAM;YACR,OAAO,MAAM,CAAC;QAChB,CAAC;QACD,IAAI,OAAO;YACT,OAAO,OAAO,CAAC,MAAM,CAAC;QACxB,CAAC;KACF,CAAC;AACJ,CAAC;AAKD;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,gBAAgB,CAC9B,KAAa,EACb,OAAuE,EAAE;IAEzE,MAAM,EAAE,OAAO,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC;IAClC,IAAI,OAAO,KAAK,SAAS,IAAI,KAAK,GAAG,OAAO,GAAG,IAAI;QAAE,OAAO,KAAK,CAAC;IAClE,IAAI,OAAO,KAAK,SAAS,IAAI,KAAK,GAAG,OAAO,GAAG,IAAI;QAAE,OAAO,KAAK,CAAC;IAClE,OAAO,IAAI,CAAC;AACd,CAAC;AAgBD,MAAM,UAAU,mBAAmB,CACjC,QAAc,EACd,MAA0B;IAE1B,IAAI,MAAM,KAAK,KAAK;QAAE,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC;IAC/C,IAAI,MAAM,YAAY,IAAI;QAAE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;IAClE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC;AAC1C,CAAC"}

package/dist/upload.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=upload.test.d.ts.map

package/dist/upload.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"upload.test.d.ts","sourceRoot":"","sources":["../src/upload.test.ts"],"names":[],"mappings":""}

package/dist/upload.test.js

@@ -0,0 +1,169 @@
+import { describe, expect, it } from 'vitest';
+import { computeUploadPercent, isUploadOk, createUploadQueue, resolveBeforeUpload, validateFileSize, } from './upload.js';
+/** A deferred whose promise resolves only when `resolve()` is called. */
+function defer() {
+    let resolve;
+    const promise = new Promise((r) => {
+        resolve = r;
+    });
+    return { promise, resolve };
+}
+describe('computeUploadPercent', () => {
+    it('computes integer percent from loaded/total', () => {
+        expect(computeUploadPercent(50, 200)).toBe(25);
+        expect(computeUploadPercent(200, 200)).toBe(100);
+        expect(computeUploadPercent(0, 200)).toBe(0);
+    });
+    it('rounds to the nearest integer', () => {
+        expect(computeUploadPercent(1, 3)).toBe(33);
+        expect(computeUploadPercent(2, 3)).toBe(67);
+    });
+    it('clamps into [0,100]', () => {
+        expect(computeUploadPercent(300, 200)).toBe(100);
+        expect(computeUploadPercent(-10, 200)).toBe(0);
+    });
+    it('returns 0 when total is 0 or negative (avoid divide-by-zero)', () => {
+        expect(computeUploadPercent(10, 0)).toBe(0);
+        expect(computeUploadPercent(10, -5)).toBe(0);
+    });
+});
+describe('isUploadOk', () => {
+    it('treats 2xx as success', () => {
+        expect(isUploadOk(200)).toBe(true);
+        expect(isUploadOk(201)).toBe(true);
+        expect(isUploadOk(299)).toBe(true);
+    });
+    it('treats non-2xx as failure', () => {
+        expect(isUploadOk(199)).toBe(false);
+        expect(isUploadOk(300)).toBe(false);
+        expect(isUploadOk(404)).toBe(false);
+        expect(isUploadOk(500)).toBe(false);
+    });
+});
+describe('createUploadQueue', () => {
+    it('never runs more than `limit` tasks at once', async () => {
+        const q = createUploadQueue(2);
+        const defers = [defer(), defer(), defer(), defer()];
+        const started = [];
+        defers.forEach((d, i) => {
+            q.add(() => {
+                started.push(i);
+                return d.promise;
+            });
+        });
+        // Synchronously, only the first 2 may start; the rest queue.
+        await Promise.resolve();
+        expect(started).toEqual([0, 1]);
+        expect(q.active).toBe(2);
+        expect(q.pending).toBe(2);
+    });
+    it('refills a freed slot when a task completes (FIFO order)', async () => {
+        const q = createUploadQueue(2);
+        const defers = [defer(), defer(), defer(), defer()];
+        const started = [];
+        defers.forEach((d, i) => {
+            q.add(() => {
+                started.push(i);
+                return d.promise;
+            });
+        });
+        await Promise.resolve();
+        expect(started).toEqual([0, 1]);
+        // Finish task 0 → task 2 should start.
+        defers[0].resolve();
+        await new Promise((r) => setTimeout(r, 0));
+        expect(started).toEqual([0, 1, 2]);
+        // Finish task 1 → task 3 should start.
+        defers[1].resolve();
+        await new Promise((r) => setTimeout(r, 0));
+        expect(started).toEqual([0, 1, 2, 3]);
+        expect(q.pending).toBe(0);
+    });
+    it('runs everything immediately when limit <= 0 (unlimited)', async () => {
+        const q = createUploadQueue(0);
+        const defers = [defer(), defer(), defer()];
+        const started = [];
+        defers.forEach((d, i) => {
+            q.add(() => {
+                started.push(i);
+                return d.promise;
+            });
+        });
+        await Promise.resolve();
+        expect(started).toEqual([0, 1, 2]);
+        expect(q.active).toBe(3);
+        expect(q.pending).toBe(0);
+    });
+    it('keeps draining even if a task rejects', async () => {
+        const q = createUploadQueue(1);
+        const started = [];
+        q.add(() => {
+            started.push(0);
+            return Promise.reject(new Error('boom'));
+        });
+        q.add(() => {
+            started.push(1);
+        });
+        // Let the rejected task settle and the next one run.
+        await new Promise((r) => setTimeout(r, 0));
+        expect(started).toEqual([0, 1]);
+        expect(q.active).toBe(0);
+        expect(q.pending).toBe(0);
+    });
+    it('handles synchronous tasks', async () => {
+        const q = createUploadQueue(2);
+        const ran = [];
+        for (let i = 0; i < 5; i++)
+            q.add(() => void ran.push(i));
+        await new Promise((r) => setTimeout(r, 0));
+        expect(ran).toEqual([0, 1, 2, 3, 4]);
+        expect(q.active).toBe(0);
+    });
+});
+describe('validateFileSize', () => {
+    it('passes when no bounds are set', () => {
+        expect(validateFileSize(0)).toBeNull();
+        expect(validateFileSize(10 * 1024 * 1024, {})).toBeNull();
+    });
+    it('reports "max" when over maxSize (KB)', () => {
+        // maxSize 100KB → boundary is 102400 bytes.
+        expect(validateFileSize(102_401, { maxSize: 100 })).toBe('max');
+        expect(validateFileSize(102_400, { maxSize: 100 })).toBeNull();
+        expect(validateFileSize(50_000, { maxSize: 100 })).toBeNull();
+    });
+    it('reports "min" when under minSize (KB)', () => {
+        // minSize 10KB → boundary is 10240 bytes.
+        expect(validateFileSize(10_239, { minSize: 10 })).toBe('min');
+        expect(validateFileSize(10_240, { minSize: 10 })).toBeNull();
+        expect(validateFileSize(50_000, { minSize: 10 })).toBeNull();
+    });
+    it('passes within [minSize, maxSize]', () => {
+        expect(validateFileSize(50_000, { minSize: 10, maxSize: 100 })).toBeNull();
+    });
+    it('checks max before min', () => {
+        // size below min AND above max is impossible for min<=max; verify max wins
+        // when both technically match a degenerate inverted range.
+        expect(validateFileSize(200_000, { minSize: 300, maxSize: 100 })).toBe('max');
+    });
+    it('treats 0-byte files as under any minSize', () => {
+        expect(validateFileSize(0, { minSize: 1 })).toBe('min');
+    });
+});
+describe('resolveBeforeUpload', () => {
+    const original = new File(['a'], 'a.txt');
+    it('uploads the original on true / undefined', () => {
+        expect(resolveBeforeUpload(original, true)).toEqual({ upload: true, file: original });
+        expect(resolveBeforeUpload(original, undefined)).toEqual({ upload: true, file: original });
+    });
+    it('skips the file on false', () => {
+        expect(resolveBeforeUpload(original, false)).toEqual({ upload: false });
+    });
+    it('replaces with a returned File', () => {
+        const replacement = new File(['bb'], 'b.txt');
+        expect(resolveBeforeUpload(original, replacement)).toEqual({
+            upload: true,
+            file: replacement,
+        });
+    });
+});
+//# sourceMappingURL=upload.test.js.map