@chenzy-design/core 0.1.0

package/dist/toast.test.js

@@ -0,0 +1,127 @@
+import { describe, expect, it, vi, beforeEach, afterEach } from 'vitest';
+import { createToastStore } from './toast.js';
+describe('createToastStore', () => {
+    beforeEach(() => vi.useFakeTimers());
+    afterEach(() => vi.useRealTimers());
+    it('adds a toast and returns its id', () => {
+        const s = createToastStore();
+        const id = s.add({ content: 'hi' });
+        expect(typeof id).toBe('string');
+        expect(s.getToasts().map((t) => t.content)).toEqual(['hi']);
+        s.destroy();
+    });
+    it('auto-dismisses after duration', () => {
+        const s = createToastStore();
+        s.add({ content: 'bye', duration: 2 });
+        expect(s.getToasts().length).toBe(1);
+        vi.advanceTimersByTime(1999);
+        expect(s.getToasts().length).toBe(1);
+        vi.advanceTimersByTime(1);
+        expect(s.getToasts().length).toBe(0);
+        s.destroy();
+    });
+    it('duration 0 persists (no auto-dismiss)', () => {
+        const s = createToastStore();
+        s.add({ content: 'stay', duration: 0 });
+        vi.advanceTimersByTime(100000);
+        expect(s.getToasts().length).toBe(1);
+        s.destroy();
+    });
+    it('loading defaults to persist', () => {
+        const s = createToastStore();
+        s.add({ content: 'loading…', type: 'loading' });
+        vi.advanceTimersByTime(100000);
+        expect(s.getToasts().length).toBe(1);
+        s.destroy();
+    });
+    it('id dedup updates in place and restarts timer', () => {
+        const s = createToastStore();
+        const id = s.add({ content: 'v1', duration: 3 });
+        vi.advanceTimersByTime(2000);
+        s.add({ id, content: 'v2', duration: 3 }); // update, restart 3s
+        expect(s.getToasts().map((t) => t.content)).toEqual(['v2']);
+        expect(s.getToasts().length).toBe(1);
+        vi.advanceTimersByTime(2000); // only 2s since update
+        expect(s.getToasts().length).toBe(1);
+        vi.advanceTimersByTime(1000);
+        expect(s.getToasts().length).toBe(0);
+        s.destroy();
+    });
+    it('maxCount evicts the oldest (FIFO)', () => {
+        const s = createToastStore({ maxCount: 2 });
+        s.add({ content: 'a', duration: 0 });
+        s.add({ content: 'b', duration: 0 });
+        s.add({ content: 'c', duration: 0 });
+        expect(s.getToasts().map((t) => t.content)).toEqual(['b', 'c']);
+        s.destroy();
+    });
+    it('manual remove and removeAll', () => {
+        const s = createToastStore();
+        const a = s.add({ content: 'a', duration: 0 });
+        s.add({ content: 'b', duration: 0 });
+        s.remove(a);
+        expect(s.getToasts().map((t) => t.content)).toEqual(['b']);
+        s.removeAll();
+        expect(s.getToasts().length).toBe(0);
+        s.destroy();
+    });
+    it('pause/resume preserves remaining time', () => {
+        const s = createToastStore();
+        const id = s.add({ content: 'x', duration: 4 });
+        vi.advanceTimersByTime(1000); // 3s left
+        s.pause(id);
+        vi.advanceTimersByTime(10000); // paused, no dismiss
+        expect(s.getToasts().length).toBe(1);
+        s.resume(id);
+        vi.advanceTimersByTime(2999);
+        expect(s.getToasts().length).toBe(1);
+        vi.advanceTimersByTime(1);
+        expect(s.getToasts().length).toBe(0);
+        s.destroy();
+    });
+    it('onClose fires with the right reason', () => {
+        const s = createToastStore();
+        const reasons = [];
+        const id = s.add({ content: 'x', duration: 0, onClose: (_i, r) => reasons.push(r) });
+        s.remove(id);
+        expect(reasons).toEqual(['manual']);
+        s.destroy();
+    });
+    it('subscribers are notified on changes', () => {
+        const s = createToastStore();
+        const counts = [];
+        s.subscribe((t) => counts.push(t.length));
+        const id = s.add({ content: 'a', duration: 0 });
+        s.remove(id);
+        expect(counts).toEqual([1, 0]);
+        s.destroy();
+    });
+    it('defaults position to top and theme to light', () => {
+        const s = createToastStore();
+        s.add({ content: 'x', duration: 0 });
+        const [t] = s.getToasts();
+        expect(t.position).toBe('top');
+        expect(t.theme).toBe('light');
+        s.destroy();
+    });
+    it('supports 6 positions and carries theme through', () => {
+        const s = createToastStore();
+        s.add({ content: 'a', duration: 0, position: 'bottomRight', theme: 'dark' });
+        const [t] = s.getToasts();
+        expect(t.position).toBe('bottomRight');
+        expect(t.theme).toBe('dark');
+        s.destroy();
+    });
+    it('maxCount evicts FIFO per position independently', () => {
+        const s = createToastStore({ maxCount: 1 });
+        s.add({ content: 'top1', duration: 0, position: 'top' });
+        s.add({ content: 'bottom1', duration: 0, position: 'bottom' });
+        // different positions: neither evicts the other
+        expect(s.getToasts().map((t) => t.content)).toEqual(['top1', 'bottom1']);
+        // adding a second top evicts only the older top
+        s.add({ content: 'top2', duration: 0, position: 'top' });
+        expect(s.getToasts().map((t) => t.content)).toEqual(['bottom1', 'top2']);
+        s.destroy();
+    });
+});
+//# sourceMappingURL=toast.test.js.map

package/dist/toast.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"toast.test.js","sourceRoot":"","sources":["../src/toast.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,EAAE,EAAE,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,QAAQ,CAAC;AACzE,OAAO,EAAE,gBAAgB,EAAE,MAAM,YAAY,CAAC;AAE9C,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;IAChC,UAAU,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,aAAa,EAAE,CAAC,CAAC;IACrC,SAAS,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,aAAa,EAAE,CAAC,CAAC;IAEpC,EAAE,CAAC,iCAAiC,EAAE,GAAG,EAAE;QACzC,MAAM,CAAC,GAAG,gBAAgB,EAAE,CAAC;QAC7B,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC;QACpC,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACjC,MAAM,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QAC5D,CAAC,CAAC,OAAO,EAAE,CAAC;IACd,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;QACvC,MAAM,CAAC,GAAG,gBAAgB,EAAE,CAAC;QAC7B,CAAC,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC;QACvC,MAAM,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrC,EAAE,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC;QAC7B,MAAM,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrC,EAAE,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC;QAC1B,MAAM,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrC,CAAC,CAAC,OAAO,EAAE,CAAC;IACd,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,MAAM,CAAC,GAAG,gBAAgB,EAAE,CAAC;QAC7B,CAAC,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC;QACxC,EAAE,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC;QAC/B,MAAM,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrC,CAAC,CAAC,OAAO,EAAE,CAAC;IACd,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6BAA6B,EAAE,GAAG,EAAE;QACrC,MAAM,CAAC,GAAG,gBAAgB,EAAE,CAAC;QAC7B,CAAC,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,CAAC;QAChD,EAAE,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAC;QAC/B,MAAM,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrC,CAAC,CAAC,OAAO,EAAE,CAAC;IACd,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,8CAA8C,EAAE,GAAG,EAAE;QACtD,MAAM,CAAC,GAAG,gBAAgB,EAAE,CAAC;QAC7B,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC;QACjD,EAAE,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC;QAC7B,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,qBAAqB;QAChE,MAAM,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QAC5D,MAAM,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrC,EAAE,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC,CAAC,uBAAuB;QACrD,MAAM,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrC,EAAE,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC;QAC7B,MAAM,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrC,CAAC,CAAC,OAAO,EAAE,CAAC;IACd,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,mCAAmC,EAAE,GAAG,EAAE;QAC3C,MAAM,CAAC,GAAG,gBAAgB,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC;QAC5C,CAAC,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC;QACrC,CAAC,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC;QACrC,CAAC,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC;QACrC,MAAM,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QAChE,CAAC,CAAC,OAAO,EAAE,CAAC;IACd,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6BAA6B,EAAE,GAAG,EAAE;QACrC,MAAM,CAAC,GAAG,gBAAgB,EAAE,CAAC;QAC7B,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/C,CAAC,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC;QACrC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACZ,MAAM,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC3D,CAAC,CAAC,SAAS,EAAE,CAAC;QACd,MAAM,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrC,CAAC,CAAC,OAAO,EAAE,CAAC;IACd,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,MAAM,CAAC,GAAG,gBAAgB,EAAE,CAAC;QAC7B,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC;QAChD,EAAE,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC,CAAC,UAAU;QACxC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QACZ,EAAE,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC,CAAC,qBAAqB;QACpD,MAAM,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACb,EAAE,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC;QAC7B,MAAM,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrC,EAAE,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC;QAC1B,MAAM,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrC,CAAC,CAAC,OAAO,EAAE,CAAC;IACd,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qCAAqC,EAAE,GAAG,EAAE;QAC7C,MAAM,CAAC,GAAG,gBAAgB,EAAE,CAAC;QAC7B,MAAM,OAAO,GAAa,EAAE,CAAC;QAC7B,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,QAAQ,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACrF,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACb,MAAM,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;QACpC,CAAC,CAAC,OAAO,EAAE,CAAC;IACd,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qCAAqC,EAAE,GAAG,EAAE;QAC7C,MAAM,CAAC,GAAG,gBAAgB,EAAE,CAAC;QAC7B,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;QAC1C,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC;QAChD,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACb,MAAM,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC/B,CAAC,CAAC,OAAO,EAAE,CAAC;IACd,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,CAAC,GAAG,gBAAgB,EAAE,CAAC;QAC7B,CAAC,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC;QACrC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,CAAC;QAC1B,MAAM,CAAC,CAAE,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAChC,MAAM,CAAC,CAAE,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC/B,CAAC,CAAC,OAAO,EAAE,CAAC;IACd,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,MAAM,CAAC,GAAG,gBAAgB,EAAE,CAAC;QAC7B,CAAC,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,aAAa,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC;QAC7E,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,SAAS,EAAE,CAAC;QAC1B,MAAM,CAAC,CAAE,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QACxC,MAAM,CAAC,CAAE,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC9B,CAAC,CAAC,OAAO,EAAE,CAAC;IACd,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,iDAAiD,EAAE,GAAG,EAAE;QACzD,MAAM,CAAC,GAAG,gBAAgB,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC;QAC5C,CAAC,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC;QACzD,CAAC,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC,CAAC;QAC/D,gDAAgD;QAChD,MAAM,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC,CAAC;QACzE,gDAAgD;QAChD,CAAC,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC;QACzD,MAAM,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC,CAAC;QACzE,CAAC,CAAC,OAAO,EAAE,CAAC;IACd,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/tree.d.ts

@@ -0,0 +1,129 @@
+/**
+ * createTree — framework-agnostic tree algorithms for Tree.svelte.
+ * Pure functions only: flatten visible nodes, check-conduction (父子联动),
+ * search filtering with ancestor expansion. No DOM, no framework deps,
+ * no internal mutable state — the render layer owns selection/expansion state
+ * (runes in svelte) and calls these helpers. See specs/components/show/Tree.spec.md §3.
+ */
+export type TreeKey = string | number;
+export interface TreeNodeData {
+    key: TreeKey;
+    label: string;
+    disabled?: boolean;
+    checkable?: boolean;
+    selectable?: boolean;
+    isLeaf?: boolean;
+    children?: TreeNodeData[];
+}
+/** A node flattened into the visible, ordered list (only expanded subtrees). */
+export interface FlatNode {
+    node: TreeNodeData;
+    /** depth from root, starting at 0 */
+    level: number;
+    /** parent key, or null for roots */
+    parentKey: TreeKey | null;
+    /** has at least one child */
+    hasChildren: boolean;
+    /** 1-based index among siblings (aria-posinset) */
+    posInSet: number;
+    /** sibling count (aria-setsize) */
+    setSize: number;
+    /** is this node the last among its siblings (for tree guide lines) */
+    isLast: boolean;
+    /** per-ancestor-level: was that ancestor the last of its siblings?
+     *  length === level; index 0 is the root-level ancestor. Used to decide
+     *  whether a vertical guide line continues through each indent column. */
+    ancestorIsLast: boolean[];
+}
+export type CheckState = 'checked' | 'half' | 'unchecked';
+/**
+ * Flatten the tree into an ordered list of visible nodes.
+ * A node's children are included only when its key is in `expandedKeys`.
+ */
+export declare function flattenVisible(data: TreeNodeData[], expandedKeys: ReadonlySet<TreeKey>): FlatNode[];
+/** Recursively find a node by key. */
+export declare function findNode(data: TreeNodeData[], key: TreeKey): TreeNodeData | undefined;
+/** Collect keys of every node that has children (for defaultExpandAll). */
+export declare function collectExpandable(data: TreeNodeData[]): TreeKey[];
+/** Collect keys of nodes up to (and including) the given depth that have children. */
+export declare function collectExpandableToDepth(data: TreeNodeData[], depth: number): TreeKey[];
+/**
+ * Conduction (related mode): given a base set of explicitly-checked keys,
+ * derive the full checked set + half-checked (indeterminate) set with
+ * bottom-up + top-down parent/child propagation.
+ * Disabled nodes are excluded from auto-check.
+ */
+export declare function conduct(data: TreeNodeData[], checkedInput: ReadonlySet<TreeKey>): {
+    checked: Set<TreeKey>;
+    half: Set<TreeKey>;
+};
+/**
+ * Normalize a checked set to leaf-level: any non-leaf (parent) key is expanded
+ * to its leaf descendants. This makes a base set resilient to being fed the
+ * output of `conduct` (which contains parent keys) — feeding a polluted base
+ * back through `toggleCheck` would otherwise re-check children on every toggle.
+ */
+export declare function normalizeToLeaves(data: TreeNodeData[], checked: ReadonlySet<TreeKey>): Set<TreeKey>;
+/**
+ * Toggle a node's check in related mode: returns the next *base* checked set
+ * (leaf-level) after toggling `key`. The input base is normalized to leaves
+ * first, so passing `conduct`-output (with parent keys) round-trips correctly.
+ * Feed the result through `conduct` to render.
+ */
+export declare function toggleCheck(data: TreeNodeData[], currentChecked: ReadonlySet<TreeKey>, key: TreeKey): Set<TreeKey>;
+/**
+ * Search filtering: returns the set of node keys to expand so that every node
+ * matching `match` is visible (its ancestor chain). The matched keys themselves
+ * are returned separately for highlighting.
+ */
+export declare function computeFilteredKeys(data: TreeNodeData[], match: (node: TreeNodeData) => boolean): {
+    matched: Set<TreeKey>;
+    expand: Set<TreeKey>;
+};
+/**
+ * Return the keys of `key`'s siblings (nodes sharing the same direct parent),
+ * excluding `key` itself. Roots are siblings of each other. Returns an empty
+ * array if the key is not found. Pure function — used by accordion mode to
+ * collapse same-level siblings when a node expands.
+ */
+export declare function siblingKeys(data: TreeNodeData[], key: TreeKey): TreeKey[];
+/**
+ * Accordion expand: compute the next expanded set when `key` is expanded under
+ * accordion mode — at most one node per level stays expanded, so all of `key`'s
+ * siblings are collapsed. Returns a new Set containing the current expanded keys
+ * plus `key`, minus `key`'s siblings. Pure function (no DOM, no mutation of
+ * inputs); the render layer derives the resulting expansion from it.
+ */
+export declare function accordionExpand(data: TreeNodeData[], expandedKeys: ReadonlySet<TreeKey>, key: TreeKey): Set<TreeKey>;
+export type DropPosition = 'before' | 'inside' | 'after';
+/**
+ * Drag & drop: given the pointer's vertical offset within a target row, decide
+ * the drop position. The row is split into three zones — top → `before`,
+ * middle → `inside` (become a child), bottom → `after`. When `allowInside` is
+ * false (e.g. a leaf target that should not gain children) the middle zone is
+ * folded into the nearer edge, yielding only `before`/`after`.
+ * Pure function (no DOM) so it is unit-testable; the render layer passes the
+ * measured offsetY/rowHeight.
+ */
+export declare function computeDropPosition(offsetY: number, rowHeight: number, allowInside?: boolean): DropPosition;
+/**
+ * Whether `maybeAncestorKey` is the same as, or an ancestor of, `key`.
+ * Used to reject dropping a dragged node onto itself or into its own subtree.
+ */
+export declare function isAncestorOrSelf(data: TreeNodeData[], maybeAncestorKey: TreeKey, key: TreeKey): boolean;
+/** Strategy for converging a fully-checked set into a回填/Tag value set. */
+export type CheckedStrategy = 'all' | 'parent' | 'child';
+/**
+ * Collapse a fully-checked set (the `checked` output of {@link conduct}, which
+ * contains every node — parents and children — that is completely checked) into
+ * the value set to surface as回填 value / Tags, per `showCheckedStrategy`:
+ *
+ * - `'all'`    → every checked node (input unchanged, in document order).
+ * - `'parent'` → only the top-most fully-checked nodes; a checked node whose
+ *                parent is also checked is dropped (parent represents subtree).
+ * - `'child'`  → only checked leaf nodes (no parents).
+ *
+ * Pure: derives solely from `data` + `checked`, document-ordered, no mutation.
+ */
+export declare function collectCheckedByStrategy(data: TreeNodeData[], checked: ReadonlySet<TreeKey>, strategy: CheckedStrategy): TreeKey[];
+//# sourceMappingURL=tree.d.ts.map

package/dist/tree.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree.d.ts","sourceRoot":"","sources":["../src/tree.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,MAAM,MAAM,OAAO,GAAG,MAAM,GAAG,MAAM,CAAC;AAEtC,MAAM,WAAW,YAAY;IAC3B,GAAG,EAAE,OAAO,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,CAAC,EAAE,OAAO,CAAC;IACnB,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB,UAAU,CAAC,EAAE,OAAO,CAAC;IACrB,MAAM,CAAC,EAAE,OAAO,CAAC;IACjB,QAAQ,CAAC,EAAE,YAAY,EAAE,CAAC;CAC3B;AAED,gFAAgF;AAChF,MAAM,WAAW,QAAQ;IACvB,IAAI,EAAE,YAAY,CAAC;IACnB,qCAAqC;IACrC,KAAK,EAAE,MAAM,CAAC;IACd,oCAAoC;IACpC,SAAS,EAAE,OAAO,GAAG,IAAI,CAAC;IAC1B,6BAA6B;IAC7B,WAAW,EAAE,OAAO,CAAC;IACrB,mDAAmD;IACnD,QAAQ,EAAE,MAAM,CAAC;IACjB,mCAAmC;IACnC,OAAO,EAAE,MAAM,CAAC;IAChB,sEAAsE;IACtE,MAAM,EAAE,OAAO,CAAC;IAChB;;8EAE0E;IAC1E,cAAc,EAAE,OAAO,EAAE,CAAC;CAC3B;AAED,MAAM,MAAM,UAAU,GAAG,SAAS,GAAG,MAAM,GAAG,WAAW,CAAC;AAM1D;;;GAGG;AACH,wBAAgB,cAAc,CAC5B,IAAI,EAAE,YAAY,EAAE,EACpB,YAAY,EAAE,WAAW,CAAC,OAAO,CAAC,GACjC,QAAQ,EAAE,CA6BZ;AAED,sCAAsC;AACtC,wBAAgB,QAAQ,CAAC,IAAI,EAAE,YAAY,EAAE,EAAE,GAAG,EAAE,OAAO,GAAG,YAAY,GAAG,SAAS,CASrF;AAED,2EAA2E;AAC3E,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,YAAY,EAAE,GAAG,OAAO,EAAE,CAYjE;AAED,sFAAsF;AACtF,wBAAgB,wBAAwB,CAAC,IAAI,EAAE,YAAY,EAAE,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO,EAAE,CAavF;AAyCD;;;;;GAKG;AACH,wBAAgB,OAAO,CACrB,IAAI,EAAE,YAAY,EAAE,EACpB,YAAY,EAAE,WAAW,CAAC,OAAO,CAAC,GACjC;IAAE,OAAO,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC;IAAC,IAAI,EAAE,GAAG,CAAC,OAAO,CAAC,CAAA;CAAE,CAsC/C;AAED;;;;;GAKG;AACH,wBAAgB,iBAAiB,CAC/B,IAAI,EAAE,YAAY,EAAE,EACpB,OAAO,EAAE,WAAW,CAAC,OAAO,CAAC,GAC5B,GAAG,CAAC,OAAO,CAAC,CAUd;AAED;;;;;GAKG;AACH,wBAAgB,WAAW,CACzB,IAAI,EAAE,YAAY,EAAE,EACpB,cAAc,EAAE,WAAW,CAAC,OAAO,CAAC,EACpC,GAAG,EAAE,OAAO,GACX,GAAG,CAAC,OAAO,CAAC,CAkBd;AAED;;;;GAIG;AACH,wBAAgB,mBAAmB,CACjC,IAAI,EAAE,YAAY,EAAE,EACpB,KAAK,EAAE,CAAC,IAAI,EAAE,YAAY,KAAK,OAAO,GACrC;IAAE,OAAO,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC;IAAC,MAAM,EAAE,GAAG,CAAC,OAAO,CAAC,CAAA;CAAE,CAwBjD;AAED;;;;;GAKG;AACH,wBAAgB,WAAW,CAAC,IAAI,EAAE,YAAY,EAAE,EAAE,GAAG,EAAE,OAAO,GAAG,OAAO,EAAE,CAczE;AAED;;;;;;GAMG;AACH,wBAAgB,eAAe,CAC7B,IAAI,EAAE,YAAY,EAAE,EACpB,YAAY,EAAE,WAAW,CAAC,OAAO,CAAC,EAClC,GAAG,EAAE,OAAO,GACX,GAAG,CAAC,OAAO,CAAC,CAKd;AAED,MAAM,MAAM,YAAY,GAAG,QAAQ,GAAG,QAAQ,GAAG,OAAO,CAAC;AAEzD;;;;;;;;GAQG;AACH,wBAAgB,mBAAmB,CACjC,OAAO,EAAE,MAAM,EACf,SAAS,EAAE,MAAM,EACjB,WAAW,UAAO,GACjB,YAAY,CAUd;AAED;;;GAGG;AACH,wBAAgB,gBAAgB,CAC9B,IAAI,EAAE,YAAY,EAAE,EACpB,gBAAgB,EAAE,OAAO,EACzB,GAAG,EAAE,OAAO,GACX,OAAO,CAKT;AAED,0EAA0E;AAC1E,MAAM,MAAM,eAAe,GAAG,KAAK,GAAG,QAAQ,GAAG,OAAO,CAAC;AAEzD;;;;;;;;;;;GAWG;AACH,wBAAgB,wBAAwB,CACtC,IAAI,EAAE,YAAY,EAAE,EACpB,OAAO,EAAE,WAAW,CAAC,OAAO,CAAC,EAC7B,QAAQ,EAAE,eAAe,GACxB,OAAO,EAAE,CAsBX"}

package/dist/tree.js

@@ -0,0 +1,351 @@
+/**
+ * createTree — framework-agnostic tree algorithms for Tree.svelte.
+ * Pure functions only: flatten visible nodes, check-conduction (父子联动),
+ * search filtering with ancestor expansion. No DOM, no framework deps,
+ * no internal mutable state — the render layer owns selection/expansion state
+ * (runes in svelte) and calls these helpers. See specs/components/show/Tree.spec.md §3.
+ */
+function hasKids(node) {
+    return !!node.children && node.children.length > 0;
+}
+/**
+ * Flatten the tree into an ordered list of visible nodes.
+ * A node's children are included only when its key is in `expandedKeys`.
+ */
+export function flattenVisible(data, expandedKeys) {
+    const out = [];
+    function walk(nodes, level, parentKey, ancestorIsLast) {
+        const setSize = nodes.length;
+        nodes.forEach((node, i) => {
+            const kids = hasKids(node);
+            const isLast = i === setSize - 1;
+            out.push({
+                node,
+                level,
+                parentKey,
+                hasChildren: kids,
+                posInSet: i + 1,
+                setSize,
+                isLast,
+                ancestorIsLast,
+            });
+            if (kids && expandedKeys.has(node.key)) {
+                walk(node.children, level + 1, node.key, [...ancestorIsLast, isLast]);
+            }
+        });
+    }
+    walk(data, 0, null, []);
+    return out;
+}
+/** Recursively find a node by key. */
+export function findNode(data, key) {
+    for (const node of data) {
+        if (node.key === key)
+            return node;
+        if (node.children) {
+            const found = findNode(node.children, key);
+            if (found)
+                return found;
+        }
+    }
+    return undefined;
+}
+/** Collect keys of every node that has children (for defaultExpandAll). */
+export function collectExpandable(data) {
+    const acc = [];
+    function walk(nodes) {
+        for (const node of nodes) {
+            if (hasKids(node)) {
+                acc.push(node.key);
+                walk(node.children);
+            }
+        }
+    }
+    walk(data);
+    return acc;
+}
+/** Collect keys of nodes up to (and including) the given depth that have children. */
+export function collectExpandableToDepth(data, depth) {
+    const acc = [];
+    function walk(nodes, level) {
+        if (level >= depth)
+            return;
+        for (const node of nodes) {
+            if (hasKids(node)) {
+                acc.push(node.key);
+                walk(node.children, level + 1);
+            }
+        }
+    }
+    walk(data, 0);
+    return acc;
+}
+function buildMeta(data) {
+    const parent = new Map();
+    const leaves = new Map();
+    const childrenOf = new Map();
+    const allKeys = [];
+    function walk(node, parentKey) {
+        parent.set(node.key, parentKey);
+        allKeys.push(node.key);
+        if (!hasKids(node)) {
+            leaves.set(node.key, [node.key]);
+            childrenOf.set(node.key, []);
+            return [node.key];
+        }
+        const kids = node.children;
+        childrenOf.set(node.key, kids.map((k) => k.key));
+        const collected = [];
+        for (const child of kids)
+            collected.push(...walk(child, node.key));
+        leaves.set(node.key, collected);
+        return collected;
+    }
+    for (const root of data)
+        walk(root, null);
+    return { parent, leaves, childrenOf, allKeys };
+}
+/**
+ * Conduction (related mode): given a base set of explicitly-checked keys,
+ * derive the full checked set + half-checked (indeterminate) set with
+ * bottom-up + top-down parent/child propagation.
+ * Disabled nodes are excluded from auto-check.
+ */
+export function conduct(data, checkedInput) {
+    const meta = buildMeta(data);
+    const disabled = new Set();
+    (function markDisabled(nodes, parentDisabled) {
+        for (const node of nodes) {
+            const d = parentDisabled || !!node.disabled;
+            if (d)
+                disabled.add(node.key);
+            if (node.children)
+                markDisabled(node.children, d);
+        }
+    })(data, false);
+    // Top-down: a checked parent checks all enabled leaf descendants.
+    const leafChecked = new Set();
+    for (const key of checkedInput) {
+        const ls = meta.leaves.get(key);
+        if (!ls)
+            continue;
+        for (const leaf of ls) {
+            if (!disabled.has(leaf))
+                leafChecked.add(leaf);
+        }
+    }
+    const checked = new Set();
+    const half = new Set();
+    // Bottom-up: derive each node's state from its leaf descendants.
+    // Process in reverse document order so children resolve before parents.
+    for (let i = meta.allKeys.length - 1; i >= 0; i--) {
+        const key = meta.allKeys[i];
+        const leaves = meta.leaves.get(key);
+        const enabledLeaves = leaves.filter((l) => !disabled.has(l));
+        if (enabledLeaves.length === 0)
+            continue;
+        const checkedCount = enabledLeaves.filter((l) => leafChecked.has(l)).length;
+        if (checkedCount === 0)
+            continue;
+        if (checkedCount === enabledLeaves.length)
+            checked.add(key);
+        else
+            half.add(key);
+    }
+    return { checked, half };
+}
+/**
+ * Normalize a checked set to leaf-level: any non-leaf (parent) key is expanded
+ * to its leaf descendants. This makes a base set resilient to being fed the
+ * output of `conduct` (which contains parent keys) — feeding a polluted base
+ * back through `toggleCheck` would otherwise re-check children on every toggle.
+ */
+export function normalizeToLeaves(data, checked) {
+    const meta = buildMeta(data);
+    const out = new Set();
+    for (const key of checked) {
+        const leaves = meta.leaves.get(key);
+        if (!leaves)
+            continue; // unknown key — drop it
+        if (leaves.length === 1 && leaves[0] === key)
+            out.add(key); // it's a leaf
+        else
+            for (const l of leaves)
+                out.add(l); // parent → its leaves
+    }
+    return out;
+}
+/**
+ * Toggle a node's check in related mode: returns the next *base* checked set
+ * (leaf-level) after toggling `key`. The input base is normalized to leaves
+ * first, so passing `conduct`-output (with parent keys) round-trips correctly.
+ * Feed the result through `conduct` to render.
+ */
+export function toggleCheck(data, currentChecked, key) {
+    const meta = buildMeta(data);
+    const disabled = new Set();
+    (function mark(nodes, pd) {
+        for (const node of nodes) {
+            const d = pd || !!node.disabled;
+            if (d)
+                disabled.add(node.key);
+            if (node.children)
+                mark(node.children, d);
+        }
+    })(data, false);
+    const base = normalizeToLeaves(data, currentChecked);
+    const leaves = (meta.leaves.get(key) ?? []).filter((l) => !disabled.has(l));
+    const allChecked = leaves.every((l) => base.has(l));
+    const next = new Set(base);
+    if (allChecked)
+        for (const l of leaves)
+            next.delete(l);
+    else
+        for (const l of leaves)
+            next.add(l);
+    return next;
+}
+/**
+ * Search filtering: returns the set of node keys to expand so that every node
+ * matching `match` is visible (its ancestor chain). The matched keys themselves
+ * are returned separately for highlighting.
+ */
+export function computeFilteredKeys(data, match) {
+    const matched = new Set();
+    const expand = new Set();
+    function walk(node, ancestors) {
+        let childHit = false;
+        if (node.children) {
+            for (const child of node.children) {
+                if (walk(child, [...ancestors, node.key]))
+                    childHit = true;
+            }
+        }
+        const selfHit = match(node);
+        if (selfHit)
+            matched.add(node.key);
+        if (selfHit || childHit) {
+            // expand all ancestors so this node is reachable
+            for (const a of ancestors)
+                expand.add(a);
+            if (childHit)
+                expand.add(node.key);
+            return true;
+        }
+        return false;
+    }
+    for (const root of data)
+        walk(root, []);
+    return { matched, expand };
+}
+/**
+ * Return the keys of `key`'s siblings (nodes sharing the same direct parent),
+ * excluding `key` itself. Roots are siblings of each other. Returns an empty
+ * array if the key is not found. Pure function — used by accordion mode to
+ * collapse same-level siblings when a node expands.
+ */
+export function siblingKeys(data, key) {
+    function findSiblings(nodes) {
+        if (nodes.some((n) => n.key === key)) {
+            return nodes.filter((n) => n.key !== key).map((n) => n.key);
+        }
+        for (const n of nodes) {
+            if (n.children) {
+                const found = findSiblings(n.children);
+                if (found)
+                    return found;
+            }
+        }
+        return null;
+    }
+    return findSiblings(data) ?? [];
+}
+/**
+ * Accordion expand: compute the next expanded set when `key` is expanded under
+ * accordion mode — at most one node per level stays expanded, so all of `key`'s
+ * siblings are collapsed. Returns a new Set containing the current expanded keys
+ * plus `key`, minus `key`'s siblings. Pure function (no DOM, no mutation of
+ * inputs); the render layer derives the resulting expansion from it.
+ */
+export function accordionExpand(data, expandedKeys, key) {
+    const next = new Set(expandedKeys);
+    next.add(key);
+    for (const s of siblingKeys(data, key))
+        next.delete(s);
+    return next;
+}
+/**
+ * Drag & drop: given the pointer's vertical offset within a target row, decide
+ * the drop position. The row is split into three zones — top → `before`,
+ * middle → `inside` (become a child), bottom → `after`. When `allowInside` is
+ * false (e.g. a leaf target that should not gain children) the middle zone is
+ * folded into the nearer edge, yielding only `before`/`after`.
+ * Pure function (no DOM) so it is unit-testable; the render layer passes the
+ * measured offsetY/rowHeight.
+ */
+export function computeDropPosition(offsetY, rowHeight, allowInside = true) {
+    if (rowHeight <= 0)
+        return 'after';
+    const y = offsetY < 0 ? 0 : offsetY > rowHeight ? rowHeight : offsetY;
+    if (!allowInside) {
+        return y < rowHeight / 2 ? 'before' : 'after';
+    }
+    // 三分区：上 1/4 before、中段 inside、下 1/4 after。
+    if (y < rowHeight / 4)
+        return 'before';
+    if (y > (rowHeight * 3) / 4)
+        return 'after';
+    return 'inside';
+}
+/**
+ * Whether `maybeAncestorKey` is the same as, or an ancestor of, `key`.
+ * Used to reject dropping a dragged node onto itself or into its own subtree.
+ */
+export function isAncestorOrSelf(data, maybeAncestorKey, key) {
+    if (maybeAncestorKey === key)
+        return true;
+    const ancestor = findNode(data, maybeAncestorKey);
+    if (!ancestor || !ancestor.children)
+        return false;
+    return !!findNode(ancestor.children, key);
+}
+/**
+ * Collapse a fully-checked set (the `checked` output of {@link conduct}, which
+ * contains every node — parents and children — that is completely checked) into
+ * the value set to surface as回填 value / Tags, per `showCheckedStrategy`:
+ *
+ * - `'all'`    → every checked node (input unchanged, in document order).
+ * - `'parent'` → only the top-most fully-checked nodes; a checked node whose
+ *                parent is also checked is dropped (parent represents subtree).
+ * - `'child'`  → only checked leaf nodes (no parents).
+ *
+ * Pure: derives solely from `data` + `checked`, document-ordered, no mutation.
+ */
+export function collectCheckedByStrategy(data, checked, strategy) {
+    const out = [];
+    const walk = (nodes, parentChecked) => {
+        for (const node of nodes) {
+            const isChecked = checked.has(node.key);
+            const kids = node.children;
+            const isLeaf = !kids || kids.length === 0;
+            if (isChecked) {
+                if (strategy === 'all')
+                    out.push(node.key);
+                else if (strategy === 'parent' && !parentChecked)
+                    out.push(node.key);
+                else if (strategy === 'child' && isLeaf)
+                    out.push(node.key);
+            }
+            if (kids && kids.length > 0) {
+                // For 'parent', once a checked ancestor is emitted we stop descending
+                // (its subtree is fully represented); otherwise keep walking.
+                if (strategy === 'parent' && isChecked)
+                    continue;
+                walk(kids, isChecked);
+            }
+        }
+    };
+    walk(data, false);
+    return out;
+}
+//# sourceMappingURL=tree.js.map

package/dist/tree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tree.js","sourceRoot":"","sources":["../src/tree.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAqCH,SAAS,OAAO,CAAC,IAAkB;IACjC,OAAO,CAAC,CAAC,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;AACrD,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,cAAc,CAC5B,IAAoB,EACpB,YAAkC;IAElC,MAAM,GAAG,GAAe,EAAE,CAAC;IAC3B,SAAS,IAAI,CACX,KAAqB,EACrB,KAAa,EACb,SAAyB,EACzB,cAAyB;QAEzB,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC;QAC7B,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;YACxB,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;YAC3B,MAAM,MAAM,GAAG,CAAC,KAAK,OAAO,GAAG,CAAC,CAAC;YACjC,GAAG,CAAC,IAAI,CAAC;gBACP,IAAI;gBACJ,KAAK;gBACL,SAAS;gBACT,WAAW,EAAE,IAAI;gBACjB,QAAQ,EAAE,CAAC,GAAG,CAAC;gBACf,OAAO;gBACP,MAAM;gBACN,cAAc;aACf,CAAC,CAAC;YACH,IAAI,IAAI,IAAI,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;gBACvC,IAAI,CAAC,IAAI,CAAC,QAA0B,EAAE,KAAK,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC,GAAG,cAAc,EAAE,MAAM,CAAC,CAAC,CAAC;YAC1F,CAAC;QACH,CAAC,CAAC,CAAC;IACL,CAAC;IACD,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC;IACxB,OAAO,GAAG,CAAC;AACb,CAAC;AAED,sCAAsC;AACtC,MAAM,UAAU,QAAQ,CAAC,IAAoB,EAAE,GAAY;IACzD,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;QACxB,IAAI,IAAI,CAAC,GAAG,KAAK,GAAG;YAAE,OAAO,IAAI,CAAC;QAClC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClB,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;YAC3C,IAAI,KAAK;gBAAE,OAAO,KAAK,CAAC;QAC1B,CAAC;IACH,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,2EAA2E;AAC3E,MAAM,UAAU,iBAAiB,CAAC,IAAoB;IACpD,MAAM,GAAG,GAAc,EAAE,CAAC;IAC1B,SAAS,IAAI,CAAC,KAAqB;QACjC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;gBAClB,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBACnB,IAAI,CAAC,IAAI,CAAC,QAA0B,CAAC,CAAC;YACxC,CAAC;QACH,CAAC;IACH,CAAC;IACD,IAAI,CAAC,IAAI,CAAC,CAAC;IACX,OAAO,GAAG,CAAC;AACb,CAAC;AAED,sFAAsF;AACtF,MAAM,UAAU,wBAAwB,CAAC,IAAoB,EAAE,KAAa;IAC1E,MAAM,GAAG,GAAc,EAAE,CAAC;IAC1B,SAAS,IAAI,CAAC,KAAqB,EAAE,KAAa;QAChD,IAAI,KAAK,IAAI,KAAK;YAAE,OAAO;QAC3B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;gBAClB,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBACnB,IAAI,CAAC,IAAI,CAAC,QAA0B,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;YACnD,CAAC;QACH,CAAC;IACH,CAAC;IACD,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IACd,OAAO,GAAG,CAAC;AACb,CAAC;AAYD,SAAS,SAAS,CAAC,IAAoB;IACrC,MAAM,MAAM,GAAG,IAAI,GAAG,EAA2B,CAAC;IAClD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAsB,CAAC;IAC7C,MAAM,UAAU,GAAG,IAAI,GAAG,EAAsB,CAAC;IACjD,MAAM,OAAO,GAAc,EAAE,CAAC;IAE9B,SAAS,IAAI,CAAC,IAAkB,EAAE,SAAyB;QACzD,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;QAChC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACvB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YACnB,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YACjC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;YAC7B,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACpB,CAAC;QACD,MAAM,IAAI,GAAG,IAAI,CAAC,QAA0B,CAAC;QAC7C,UAAU,CAAC,GAAG,CACZ,IAAI,CAAC,GAAG,EACR,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CACvB,CAAC;QACF,MAAM,SAAS,GAAc,EAAE,CAAC;QAChC,KAAK,MAAM,KAAK,IAAI,IAAI;YAAE,SAAS,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;QACnE,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,SAAS,CAAC,CAAC;QAChC,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,IAAI;QAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IAC1C,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC;AACjD,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,OAAO,CACrB,IAAoB,EACpB,YAAkC;IAElC,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;IAC7B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAW,CAAC;IACpC,CAAC,SAAS,YAAY,CAAC,KAAqB,EAAE,cAAuB;QACnE,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,CAAC,GAAG,cAAc,IAAI,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC;YAC5C,IAAI,CAAC;gBAAE,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC9B,IAAI,IAAI,CAAC,QAAQ;gBAAE,YAAY,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QACpD,CAAC;IACH,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IAEhB,kEAAkE;IAClE,MAAM,WAAW,GAAG,IAAI,GAAG,EAAW,CAAC;IACvC,KAAK,MAAM,GAAG,IAAI,YAAY,EAAE,CAAC;QAC/B,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAChC,IAAI,CAAC,EAAE;YAAE,SAAS;QAClB,KAAK,MAAM,IAAI,IAAI,EAAE,EAAE,CAAC;YACtB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACjD,CAAC;IACH,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,GAAG,EAAW,CAAC;IACnC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAW,CAAC;IAEhC,iEAAiE;IACjE,wEAAwE;IACxE,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAClD,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAY,CAAC;QACvC,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAc,CAAC;QACjD,MAAM,aAAa,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7D,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QACzC,MAAM,YAAY,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;QAC5E,IAAI,YAAY,KAAK,CAAC;YAAE,SAAS;QACjC,IAAI,YAAY,KAAK,aAAa,CAAC,MAAM;YAAE,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;;YACvD,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACrB,CAAC;IAED,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;AAC3B,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,iBAAiB,CAC/B,IAAoB,EACpB,OAA6B;IAE7B,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;IAC7B,MAAM,GAAG,GAAG,IAAI,GAAG,EAAW,CAAC;IAC/B,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;QAC1B,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACpC,IAAI,CAAC,MAAM;YAAE,SAAS,CAAC,wBAAwB;QAC/C,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,KAAK,GAAG;YAAE,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,cAAc;;YACrE,KAAK,MAAM,CAAC,IAAI,MAAM;gBAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,sBAAsB;IACjE,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,WAAW,CACzB,IAAoB,EACpB,cAAoC,EACpC,GAAY;IAEZ,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;IAC7B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAW,CAAC;IACpC,CAAC,SAAS,IAAI,CAAC,KAAqB,EAAE,EAAW;QAC/C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC;YAChC,IAAI,CAAC;gBAAE,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC9B,IAAI,IAAI,CAAC,QAAQ;gBAAE,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QAC5C,CAAC;IACH,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IAEhB,MAAM,IAAI,GAAG,iBAAiB,CAAC,IAAI,EAAE,cAAc,CAAC,CAAC;IACrD,MAAM,MAAM,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5E,MAAM,UAAU,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACpD,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC;IAC3B,IAAI,UAAU;QAAE,KAAK,MAAM,CAAC,IAAI,MAAM;YAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;;QAClD,KAAK,MAAM,CAAC,IAAI,MAAM;YAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACzC,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,mBAAmB,CACjC,IAAoB,EACpB,KAAsC;IAEtC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAW,CAAC;IACnC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAW,CAAC;IAElC,SAAS,IAAI,CAAC,IAAkB,EAAE,SAAoB;QACpD,IAAI,QAAQ,GAAG,KAAK,CAAC;QACrB,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAClC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC,GAAG,SAAS,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;oBAAE,QAAQ,GAAG,IAAI,CAAC;YAC7D,CAAC;QACH,CAAC;QACD,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;QAC5B,IAAI,OAAO;YAAE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACnC,IAAI,OAAO,IAAI,QAAQ,EAAE,CAAC;YACxB,iDAAiD;YACjD,KAAK,MAAM,CAAC,IAAI,SAAS;gBAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACzC,IAAI,QAAQ;gBAAE,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACnC,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,IAAI;QAAE,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;IACxC,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC;AAC7B,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,WAAW,CAAC,IAAoB,EAAE,GAAY;IAC5D,SAAS,YAAY,CAAC,KAAqB;QACzC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,EAAE,CAAC;YACrC,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAC9D,CAAC;QACD,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,IAAI,CAAC,CAAC,QAAQ,EAAE,CAAC;gBACf,MAAM,KAAK,GAAG,YAAY,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;gBACvC,IAAI,KAAK;oBAAE,OAAO,KAAK,CAAC;YAC1B,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD,OAAO,YAAY,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;AAClC,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,eAAe,CAC7B,IAAoB,EACpB,YAAkC,EAClC,GAAY;IAEZ,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC,CAAC;IACnC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,CAAC,IAAI,WAAW,CAAC,IAAI,EAAE,GAAG,CAAC;QAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IACvD,OAAO,IAAI,CAAC;AACd,CAAC;AAID;;;;;;;;GAQG;AACH,MAAM,UAAU,mBAAmB,CACjC,OAAe,EACf,SAAiB,EACjB,WAAW,GAAG,IAAI;IAElB,IAAI,SAAS,IAAI,CAAC;QAAE,OAAO,OAAO,CAAC;IACnC,MAAM,CAAC,GAAG,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,GAAG,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC;IACtE,IAAI,CAAC,WAAW,EAAE,CAAC;QACjB,OAAO,CAAC,GAAG,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC;IAChD,CAAC;IACD,0CAA0C;IAC1C,IAAI,CAAC,GAAG,SAAS,GAAG,CAAC;QAAE,OAAO,QAAQ,CAAC;IACvC,IAAI,CAAC,GAAG,CAAC,SAAS,GAAG,CAAC,CAAC,GAAG,CAAC;QAAE,OAAO,OAAO,CAAC;IAC5C,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,gBAAgB,CAC9B,IAAoB,EACpB,gBAAyB,EACzB,GAAY;IAEZ,IAAI,gBAAgB,KAAK,GAAG;QAAE,OAAO,IAAI,CAAC;IAC1C,MAAM,QAAQ,GAAG,QAAQ,CAAC,IAAI,EAAE,gBAAgB,CAAC,CAAC;IAClD,IAAI,CAAC,QAAQ,IAAI,CAAC,QAAQ,CAAC,QAAQ;QAAE,OAAO,KAAK,CAAC;IAClD,OAAO,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;AAC5C,CAAC;AAKD;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,wBAAwB,CACtC,IAAoB,EACpB,OAA6B,EAC7B,QAAyB;IAEzB,MAAM,GAAG,GAAc,EAAE,CAAC;IAC1B,MAAM,IAAI,GAAG,CAAC,KAAqB,EAAE,aAAsB,EAAQ,EAAE;QACnE,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,SAAS,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACxC,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC;YAC3B,MAAM,MAAM,GAAG,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC;YAC1C,IAAI,SAAS,EAAE,CAAC;gBACd,IAAI,QAAQ,KAAK,KAAK;oBAAE,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;qBACtC,IAAI,QAAQ,KAAK,QAAQ,IAAI,CAAC,aAAa;oBAAE,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;qBAChE,IAAI,QAAQ,KAAK,OAAO,IAAI,MAAM;oBAAE,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC9D,CAAC;YACD,IAAI,IAAI,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC5B,sEAAsE;gBACtE,8DAA8D;gBAC9D,IAAI,QAAQ,KAAK,QAAQ,IAAI,SAAS;oBAAE,SAAS;gBACjD,IAAI,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;YACxB,CAAC;QACH,CAAC;IACH,CAAC,CAAC;IACF,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IAClB,OAAO,GAAG,CAAC;AACb,CAAC"}

package/dist/tree.test.d.ts

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

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

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