@skdx/vue 0.28.0 → 0.30.0

package/dist/tree-select/collection.cjs

@@ -1 +1 @@
-function b(e){const t=new Map,r=[],s=(l,n,o,c)=>{for(const a of l){const f=c||a.disabled===!0,i=a.children??[],h={node:a,parent:n,depth:o,childValues:i.map(u=>u.value),descendants:[],leaves:[],disabled:f};if(t.set(a.value,h),r.push(a.value),s(i,a.value,o+1,f),i.length===0)f||h.leaves.push(a.value);else for(const u of i){const d=t.get(u.value);d&&(h.descendants.push(u.value,...d.descendants),h.leaves.push(...d.leaves))}}};return s(e,null,1,!1),{index:t,order:r}}function p(e,t){const r=[];let s=t.get(e)?.parent??null;for(;s!==null;)r.push(s),s=t.get(s)?.parent??null;return r}function g(e){return e==="cascade"||e==="descendants"}function v(e){return e==="cascade"||e==="ancestors"}function C(e,t){return t==="leaf"?v(e)?"leaf":"all":t==="shallowest"?g(e)?"shallowest":"all":t}function V(e,t,r,s){if(s==="independent")return t.has(e);const l=r.get(e);if(!l||l.leaves.length===0)return t.has(e);let n=0;for(const o of l.leaves)t.has(o)&&n++;return n===l.leaves.length||t.has(e)?!0:n===0?!1:"mixed"}function S(e,t,r,s){const l=new Set;for(const n of e)t.has(n)&&l.add(n);if(s==="independent")return l;if(g(s))for(const n of[...l]){const o=t.get(n);if(o)for(const c of o.descendants)t.get(c)?.disabled||l.add(c)}if(v(s))for(const n of r){const o=t.get(n);o&&(o.leaves.length===0||o.childValues.length===0||(o.leaves.every(c=>l.has(c))?l.add(n):s==="cascade"&&l.delete(n)))}return l}function m(e,t,r,s){const l=r.filter(n=>e.has(n));return s==="all"?l:s==="leaf"?l.filter(n=>t.get(n)?.childValues.length===0):l.filter(n=>{const o=t.get(n)?.parent??null;return o===null||!e.has(o)})}function E(e,t,r,s,l){if(!l)return t.size===1&&t.has(e)?new Set:new Set([e]);const n=new Set(t),o=r.get(e);if(s==="independent"||!o)return n.has(e)?n.delete(e):n.add(e),n;const c=V(e,t,r,s)!==!0;for(const a of g(s)?[e,...o.descendants]:[e])r.get(a)?.disabled||(c?n.add(a):n.delete(a));if(v(s))for(const a of p(e,r)){const f=r.get(a);f&&(f.leaves.length>0&&f.leaves.every(i=>n.has(i))?n.add(a):n.delete(a))}return n}function O(e,t,r){const s=new Set,l=new Set;let n=0;for(const o of t){const c=e.get(o);if(c&&r(c.node)){n++,s.add(o);for(const a of p(o,e))s.add(a),l.add(a);for(const a of c.descendants)s.add(a)}}return{visible:s,autoExpanded:l,matchCount:n}}function z(e,t,r,s){const l=[],n=c=>r===null||r.has(c.value),o=(c,a)=>{const f=c.filter(n);f.forEach((i,h)=>{const u=t.get(i.value);if(!u)return;const d=(i.children??[]).filter(n),w=s.has(i.value);l.push({value:i.value,parent:a,depth:u.depth,disabled:u.disabled,hasChildren:d.length>0||i.hasChildren===!0,expanded:w,posinset:h+1,setsize:f.length}),d.length>0&&w&&o(d,i.value)})};return o(e,null),l}exports.ancestorsOf=p;exports.checkStateOf=V;exports.computeFilter=O;exports.effectiveValueStrategy=C;exports.flattenVisible=z;exports.indexCollection=b;exports.normalizeChecked=S;exports.projectValue=m;exports.toggleChecked=E;
+function C(e){const t=new Map,l=[],n=(s,o,r,c)=>{for(const a of s){const d=c||a.disabled===!0,i=a.children??[],h={node:a,parent:o,depth:r,childValues:i.map(f=>f.value),descendants:[],leaves:[],disabled:d};if(t.set(a.value,h),l.push(a.value),n(i,a.value,r+1,d),i.length===0)d||h.leaves.push(a.value);else for(const f of i){const u=t.get(f.value);u&&(h.descendants.push(f.value,...u.descendants),h.leaves.push(...u.leaves))}}};return n(e,null,1,!1),{index:t,order:l}}function p(e,t){const l=[];let n=t.get(e)?.parent??null;for(;n!==null;)l.push(n),n=t.get(n)?.parent??null;return l}function g(e){return e==="cascade"||e==="descendants"}function v(e){return e==="cascade"||e==="ancestors"}function V(e,t){return t==="leaf"?v(e)?"leaf":"all":t==="shallowest"?g(e)?"shallowest":"all":t}function b(e,t,l,n){if(n==="independent")return t.has(e);const s=l.get(e);if(!s||s.leaves.length===0)return t.has(e);let o=0;for(const r of s.leaves)t.has(r)&&o++;return o===s.leaves.length||t.has(e)?!0:o===0?!1:"mixed"}function S(e,t){for(const l of[...e]){const n=t.get(l);if(n)for(const s of n.descendants)t.get(s)?.disabled||e.add(s)}}function m(e,t,l,n){for(const s of l){const o=t.get(s);o&&(o.leaves.length===0||o.childValues.length===0||(o.leaves.every(r=>e.has(r))?e.add(s):n==="cascade"&&e.delete(s)))}}function E(e,t,l,n){const s=new Set;for(const o of e)t.has(o)&&s.add(o);return n==="independent"||(g(n)&&S(s,t),v(n)&&m(s,t,l,n)),s}function O(e,t,l,n){const s=l.filter(o=>e.has(o));return n==="all"?s:n==="leaf"?s.filter(o=>t.get(o)?.childValues.length===0):s.filter(o=>{const r=t.get(o)?.parent??null;return r===null||!e.has(r)})}function z(e,t,l,n,s){if(!s)return t.size===1&&t.has(e)?new Set:new Set([e]);const o=new Set(t),r=l.get(e);if(n==="independent"||!r)return o.has(e)?o.delete(e):o.add(e),o;const c=b(e,t,l,n)!==!0;return U(o,g(n)?[e,...r.descendants]:[e],{index:l,check:c}),v(n)&&j(o,e,l),o}function U(e,t,l){for(const n of t)l.index.get(n)?.disabled||(l.check?e.add(n):e.delete(n))}function j(e,t,l){for(const n of p(t,l)){const s=l.get(n);s&&(s.leaves.length>0&&s.leaves.every(o=>e.has(o))?e.add(n):e.delete(n))}}function k(e,t,l){const n=new Set,s=new Set;let o=0;for(const r of t){const c=e.get(r);if(c&&l(c.node)){o++,n.add(r);for(const a of p(r,e))n.add(a),s.add(a);for(const a of c.descendants)n.add(a)}}return{visible:n,autoExpanded:s,matchCount:o}}function D(e,t,l,n){const s=[],o=c=>l===null||l.has(c.value),r=(c,a)=>{const d=c.filter(o);d.forEach((i,h)=>{const f=t.get(i.value);if(!f)return;const u=(i.children??[]).filter(o),w=n.has(i.value);s.push({value:i.value,parent:a,depth:f.depth,disabled:f.disabled,hasChildren:u.length>0||i.hasChildren===!0,expanded:w,posinset:h+1,setsize:d.length}),u.length>0&&w&&r(u,i.value)})};return r(e,null),s}exports.ancestorsOf=p;exports.checkStateOf=b;exports.computeFilter=k;exports.effectiveValueStrategy=V;exports.flattenVisible=D;exports.indexCollection=C;exports.normalizeChecked=E;exports.projectValue=O;exports.toggleChecked=z;

package/dist/tree-select/collection.d.cts

@@ -1,10 +1,5 @@
 import type { TreeCheckedState } from '../tree/context.cjs';
 import type { TreeSelectCheckStrategy, TreeSelectNode, TreeSelectValueStrategy } from './context.cjs';
-/**
- * Tree-select core logic: cascading check state, valueStrategy projection,
- * and filter ancestor-preservation as plain functions so they work for
- * collapsed (non-DOM) branches. Matches React version.
- */
 /** @internal Everything derived once per collection about a single node. */
 export interface TreeSelectIndexEntry {
     node: TreeSelectNode;
@@ -32,10 +27,7 @@ export interface TreeSelectFlatNode {
     parent: string | null;
     depth: number;
     disabled: boolean;
-    /**
-     * Has ≥1 visible child or declares itself as branch via `hasChildren`
-     * (lazy-loading)—drives `aria-expanded`.
-     */
+    /** Has at least one visible child, or declares itself a branch via `hasChildren`; drives `aria-expanded`. */
     hasChildren: boolean;
     expanded: boolean;
     /** 1-based position among its visible siblings — `aria-posinset`. */
@@ -50,33 +42,17 @@ export declare function indexCollection(collection: readonly TreeSelectNode[]):
 };
 /** @internal A node's ancestors, nearest first. */
 export declare function ancestorsOf(value: string, index: TreeSelectIndex): string[];
-/**
- * @internal Value strategy that round-trips under `strategy`. `'leaf'` needs
- * upward propagation, `'shallowest'` needs downward; otherwise silently loses
- * selections, so fallback to `'all'`.
- */
+/** @internal The value strategy that round-trips under `strategy`, falling back to `'all'` otherwise. */
 export declare function effectiveValueStrategy(strategy: TreeSelectCheckStrategy, valueStrategy: TreeSelectValueStrategy): TreeSelectValueStrategy;
-/**
- * @internal Node tri-state: under `'independent'` plain membership; otherwise
- * `true` when all enabled leaves are checked or was checked directly,
- * `'mixed'` when some are.
- */
+/** @internal Node tri-state: plain membership under `'independent'`, otherwise derived from enabled leaves. */
 export declare function checkStateOf(value: string, checked: ReadonlySet<string>, index: TreeSelectIndex, strategy: TreeSelectCheckStrategy): TreeCheckedState;
-/**
- * @internal Inverse of projectValue: expands emitted values back into full
- * checked set. Must round-trip: `'shallowest'` parent for subtree, `'leaf'`
- * leaves for parent, both return same set.
- */
+/** @internal Inverse of projectValue: expands emitted values back into the full checked set. */
 export declare function normalizeChecked(values: readonly string[], index: TreeSelectIndex, order: readonly string[], strategy: TreeSelectCheckStrategy): Set<string>;
 /** @internal Reduces the full checked set to the values a consumer actually receives. */
 export declare function projectValue(checked: ReadonlySet<string>, index: TreeSelectIndex, order: readonly string[], strategy: TreeSelectValueStrategy): string[];
 /** @internal The checked set after activating one node. */
 export declare function toggleChecked(value: string, checked: ReadonlySet<string>, index: TreeSelectIndex, strategy: TreeSelectCheckStrategy, multiple: boolean): Set<string>;
-/**
- * @internal Nodes surviving filter and branches that auto-open. Matches drag
- * ancestor chain into visibility (fixes classic filtered-tree bug) and whole
- * subtree (lets branch exploration continue).
- */
+/** @internal Nodes surviving the filter, plus the ancestor chain and subtree that keep them reachable. */
 export declare function computeFilter(index: TreeSelectIndex, order: readonly string[], matches: (node: TreeSelectNode) => boolean): {
     visible: Set<string>;
     autoExpanded: Set<string>;

package/dist/tree-select/collection.d.ts

@@ -1,10 +1,5 @@
 import type { TreeCheckedState } from '../tree/context.js';
 import type { TreeSelectCheckStrategy, TreeSelectNode, TreeSelectValueStrategy } from './context.js';
-/**
- * Tree-select core logic: cascading check state, valueStrategy projection,
- * and filter ancestor-preservation as plain functions so they work for
- * collapsed (non-DOM) branches. Matches React version.
- */
 /** @internal Everything derived once per collection about a single node. */
 export interface TreeSelectIndexEntry {
     node: TreeSelectNode;
@@ -32,10 +27,7 @@ export interface TreeSelectFlatNode {
     parent: string | null;
     depth: number;
     disabled: boolean;
-    /**
-     * Has ≥1 visible child or declares itself as branch via `hasChildren`
-     * (lazy-loading)—drives `aria-expanded`.
-     */
+    /** Has at least one visible child, or declares itself a branch via `hasChildren`; drives `aria-expanded`. */
     hasChildren: boolean;
     expanded: boolean;
     /** 1-based position among its visible siblings — `aria-posinset`. */
@@ -50,33 +42,17 @@ export declare function indexCollection(collection: readonly TreeSelectNode[]):
 };
 /** @internal A node's ancestors, nearest first. */
 export declare function ancestorsOf(value: string, index: TreeSelectIndex): string[];
-/**
- * @internal Value strategy that round-trips under `strategy`. `'leaf'` needs
- * upward propagation, `'shallowest'` needs downward; otherwise silently loses
- * selections, so fallback to `'all'`.
- */
+/** @internal The value strategy that round-trips under `strategy`, falling back to `'all'` otherwise. */
 export declare function effectiveValueStrategy(strategy: TreeSelectCheckStrategy, valueStrategy: TreeSelectValueStrategy): TreeSelectValueStrategy;
-/**
- * @internal Node tri-state: under `'independent'` plain membership; otherwise
- * `true` when all enabled leaves are checked or was checked directly,
- * `'mixed'` when some are.
- */
+/** @internal Node tri-state: plain membership under `'independent'`, otherwise derived from enabled leaves. */
 export declare function checkStateOf(value: string, checked: ReadonlySet<string>, index: TreeSelectIndex, strategy: TreeSelectCheckStrategy): TreeCheckedState;
-/**
- * @internal Inverse of projectValue: expands emitted values back into full
- * checked set. Must round-trip: `'shallowest'` parent for subtree, `'leaf'`
- * leaves for parent, both return same set.
- */
+/** @internal Inverse of projectValue: expands emitted values back into the full checked set. */
 export declare function normalizeChecked(values: readonly string[], index: TreeSelectIndex, order: readonly string[], strategy: TreeSelectCheckStrategy): Set<string>;
 /** @internal Reduces the full checked set to the values a consumer actually receives. */
 export declare function projectValue(checked: ReadonlySet<string>, index: TreeSelectIndex, order: readonly string[], strategy: TreeSelectValueStrategy): string[];
 /** @internal The checked set after activating one node. */
 export declare function toggleChecked(value: string, checked: ReadonlySet<string>, index: TreeSelectIndex, strategy: TreeSelectCheckStrategy, multiple: boolean): Set<string>;
-/**
- * @internal Nodes surviving filter and branches that auto-open. Matches drag
- * ancestor chain into visibility (fixes classic filtered-tree bug) and whole
- * subtree (lets branch exploration continue).
- */
+/** @internal Nodes surviving the filter, plus the ancestor chain and subtree that keep them reachable. */
 export declare function computeFilter(index: TreeSelectIndex, order: readonly string[], matches: (node: TreeSelectNode) => boolean): {
     visible: Set<string>;
     autoExpanded: Set<string>;

package/dist/tree-select/collection.js

@@ -1 +1 @@
-function e(e){const t=/* @__PURE__ */new Map,n=[],s=(e,a,l,o)=>{for(const d of e){const e=o||!0===d.disabled,r=d.children??[],c={node:d,parent:a,depth:l,childValues:r.map(e=>e.value),descendants:[],leaves:[],disabled:e};if(t.set(d.value,c),n.push(d.value),s(r,d.value,l+1,e),0===r.length)e||c.leaves.push(d.value);else for(const e of r){const n=t.get(e.value);n&&(c.descendants.push(e.value,...n.descendants),c.leaves.push(...n.leaves))}}};return s(e,null,1,!1),{index:t,order:n}}function t(e,t){const n=[];let s=t.get(e)?.parent??null;for(;null!==s;)n.push(s),s=t.get(s)?.parent??null;return n}function n(e){return"cascade"===e||"descendants"===e}function s(e){return"cascade"===e||"ancestors"===e}function a(e,t){return"leaf"===t?s(e)?"leaf":"all":"shallowest"===t?n(e)?"shallowest":"all":t}function l(e,t,n,s){if("independent"===s)return t.has(e);const a=n.get(e);if(!a||0===a.leaves.length)return t.has(e);let l=0;for(const e of a.leaves)t.has(e)&&l++;return!(l!==a.leaves.length&&!t.has(e))||0!==l&&"mixed"}function o(e,t,a,l){const o=/* @__PURE__ */new Set;for(const n of e)t.has(n)&&o.add(n);if("independent"===l)return o;if(n(l))for(const e of[...o]){const n=t.get(e);if(n)for(const e of n.descendants)t.get(e)?.disabled||o.add(e)}if(s(l))for(const e of a){const n=t.get(e);n&&(0===n.leaves.length||0===n.childValues.length||(n.leaves.every(e=>o.has(e))?o.add(e):"cascade"===l&&o.delete(e)))}return o}function d(e,t,n,s){const a=n.filter(t=>e.has(t));return"all"===s?a:"leaf"===s?a.filter(e=>0===t.get(e)?.childValues.length):a.filter(n=>{const s=t.get(n)?.parent??null;return null===s||!e.has(s)})}function r(e,a,o,d,r){if(!r)return 1===a.size&&a.has(e)?/* @__PURE__ */new Set:/* @__PURE__ */new Set([e]);const c=new Set(a),u=o.get(e);if("independent"===d||!u)return c.has(e)?c.delete(e):c.add(e),c;const f=!0!==l(e,a,o,d);for(const t of n(d)?[e,...u.descendants]:[e])o.get(t)?.disabled||(f?c.add(t):c.delete(t));if(s(d))for(const n of t(e,o)){const e=o.get(n);e&&(e.leaves.length>0&&e.leaves.every(e=>c.has(e))?c.add(n):c.delete(n))}return c}function c(e,n,s){const a=/* @__PURE__ */new Set,l=/* @__PURE__ */new Set;let o=0;for(const d of n){const n=e.get(d);if(n&&s(n.node)){o++,a.add(d);for(const n of t(d,e))a.add(n),l.add(n);for(const e of n.descendants)a.add(e)}}return{visible:a,autoExpanded:l,matchCount:o}}function u(e,t,n,s){const a=[],l=e=>null===n||n.has(e.value),o=(e,n)=>{const d=e.filter(l);d.forEach((e,r)=>{const c=t.get(e.value);if(!c)return;const u=(e.children??[]).filter(l),f=s.has(e.value);a.push({value:e.value,parent:n,depth:c.depth,disabled:c.disabled,hasChildren:u.length>0||!0===e.hasChildren,expanded:f,posinset:r+1,setsize:d.length}),u.length>0&&f&&o(u,e.value)})};return o(e,null),a}export{t as ancestorsOf,l as checkStateOf,c as computeFilter,a as effectiveValueStrategy,u as flattenVisible,e as indexCollection,o as normalizeChecked,d as projectValue,r as toggleChecked};
+function e(e){const n=/* @__PURE__ */new Map,t=[],s=(e,a,l,o)=>{for(const d of e){const e=o||!0===d.disabled,c=d.children??[],r={node:d,parent:a,depth:l,childValues:c.map(e=>e.value),descendants:[],leaves:[],disabled:e};if(n.set(d.value,r),t.push(d.value),s(c,d.value,l+1,e),0===c.length)e||r.leaves.push(d.value);else for(const e of c){const t=n.get(e.value);t&&(r.descendants.push(e.value,...t.descendants),r.leaves.push(...t.leaves))}}};return s(e,null,1,!1),{index:n,order:t}}function n(e,n){const t=[];let s=n.get(e)?.parent??null;for(;null!==s;)t.push(s),s=n.get(s)?.parent??null;return t}function t(e){return"cascade"===e||"descendants"===e}function s(e){return"cascade"===e||"ancestors"===e}function a(e,n){return"leaf"===n?s(e)?"leaf":"all":"shallowest"===n?t(e)?"shallowest":"all":n}function l(e,n,t,s){if("independent"===s)return n.has(e);const a=t.get(e);if(!a||0===a.leaves.length)return n.has(e);let l=0;for(const e of a.leaves)n.has(e)&&l++;return!(l!==a.leaves.length&&!n.has(e))||0!==l&&"mixed"}function o(e,n,a,l){const o=/* @__PURE__ */new Set;for(const t of e)n.has(t)&&o.add(t);return"independent"===l||(t(l)&&function(e,n){for(const t of[...e]){const s=n.get(t);if(s)for(const t of s.descendants)n.get(t)?.disabled||e.add(t)}}(o,n),s(l)&&function(e,n,t,s){for(const a of t){const t=n.get(a);t&&(0===t.leaves.length||0===t.childValues.length||(t.leaves.every(n=>e.has(n))?e.add(a):"cascade"===s&&e.delete(a)))}}(o,n,a,l)),o}function d(e,n,t,s){const a=t.filter(n=>e.has(n));return"all"===s?a:"leaf"===s?a.filter(e=>0===n.get(e)?.childValues.length):a.filter(t=>{const s=n.get(t)?.parent??null;return null===s||!e.has(s)})}function c(e,a,o,d,c){if(!c)return 1===a.size&&a.has(e)?/* @__PURE__ */new Set:/* @__PURE__ */new Set([e]);const r=new Set(a),u=o.get(e);if("independent"===d||!u)return r.has(e)?r.delete(e):r.add(e),r;const f=!0!==l(e,a,o,d);return function(e,n,t){for(const s of n)t.index.get(s)?.disabled||(t.check?e.add(s):e.delete(s))}(r,t(d)?[e,...u.descendants]:[e],{index:o,check:f}),s(d)&&function(e,t,s){for(const a of n(t,s)){const n=s.get(a);n&&(n.leaves.length>0&&n.leaves.every(n=>e.has(n))?e.add(a):e.delete(a))}}(r,e,o),r}function r(e,t,s){const a=/* @__PURE__ */new Set,l=/* @__PURE__ */new Set;let o=0;for(const d of t){const t=e.get(d);if(t&&s(t.node)){o++,a.add(d);for(const t of n(d,e))a.add(t),l.add(t);for(const e of t.descendants)a.add(e)}}return{visible:a,autoExpanded:l,matchCount:o}}function u(e,n,t,s){const a=[],l=e=>null===t||t.has(e.value),o=(e,t)=>{const d=e.filter(l);d.forEach((e,c)=>{const r=n.get(e.value);if(!r)return;const u=(e.children??[]).filter(l),f=s.has(e.value);a.push({value:e.value,parent:t,depth:r.depth,disabled:r.disabled,hasChildren:u.length>0||!0===e.hasChildren,expanded:f,posinset:c+1,setsize:d.length}),u.length>0&&f&&o(u,e.value)})};return o(e,null),a}export{n as ancestorsOf,l as checkStateOf,r as computeFilter,a as effectiveValueStrategy,u as flattenVisible,e as indexCollection,o as normalizeChecked,d as projectValue,c as toggleChecked};

package/dist/tree-select/context.d.cts

@@ -1,5 +1,6 @@
 import type { InjectionKey, Ref, VNodeChild } from 'vue';
 import type { TreeCheckedState } from '../tree/context.cjs';
+import type { TreeColumn } from '../utils/tree-columns.cjs';
 import type { TreeSelectFlatNode, TreeSelectIndex } from './collection.cjs';
 /**
  * Node data (not elements), so cascading/filtering see collapsed branches.
@@ -8,7 +9,7 @@ export interface TreeSelectNode {
     /** Unique identifier across the collection; what lands in `value`. */
     value: string;
     /**
-     * Node label (display, filter). @default undefined → value
+     * Node label used for display and filtering. @default undefined → value
      */
     label?: string;
     /**
@@ -16,16 +17,16 @@ export interface TreeSelectNode {
      */
     disabled?: boolean;
     /**
-     * Child nodes (none = leaf). @default undefined
+     * Child nodes; a node with none is a leaf. @default undefined
      */
     children?: TreeSelectNode[];
     /**
-     * Branch with unloaded children (lazy-loading). @default undefined
+     * Marks a branch whose children have not loaded yet. @default undefined
      */
     hasChildren?: boolean;
 }
 /**
- * How checking a node propagates through the hierarchy. Only meaningful while `multiple` is set.
+ * How checking a node propagates through the hierarchy, only meaningful while `multiple` is set.
  *
  * - `'cascade'` — both directions; a partly-checked parent reports `aria-checked="mixed"`.
  * - `'descendants'` — downwards only: checking a parent checks its subtree.
@@ -39,8 +40,6 @@ export type TreeSelectCheckStrategy = 'cascade' | 'descendants' | 'ancestors' |
  * - `'all'` — every checked node, parents and descendants alike.
  * - `'leaf'` — only checked leaves; branches are dropped.
  * - `'shallowest'` — only the topmost fully-checked node of each branch.
- *
- * Falls back to `'all'` wherever `check-strategy="independent"` would otherwise silently drop a selection.
  */
 export type TreeSelectValueStrategy = 'all' | 'leaf' | 'shallowest';
 /** Predicate deciding whether a node matches the current filter text. */
@@ -83,6 +82,14 @@ export interface TreeSelectContext {
     /** Node's treeitem DOM id (aria-activedescendant). */
     itemId(value: string): string;
     treeId: string;
+    /** The layout actually drawn; a filter narrows a `'columns'` popup back to `'tree'`. */
+    layout: Readonly<Ref<'tree' | 'columns'>>;
+    /** Showing columns left to right, empty in the tree layout. */
+    columns: Readonly<Ref<readonly TreeColumn[]>>;
+    /** Column tree's DOM id; the root column keeps `treeId`. */
+    columnTreeId(index: number): string;
+    /** Tree id the anchor's `aria-controls` names (the active node's column). */
+    activeTreeId: Readonly<Ref<string>>;
     triggerRef: Ref<HTMLElement | null>;
     contentRef: Ref<HTMLElement | null>;
     inputRef: Ref<HTMLInputElement | null>;
@@ -98,12 +105,7 @@ export interface TreeSelectContext {
         typeahead: boolean;
         selectOnSpace: boolean;
     }): void;
-    /**
-     * Node values `SkdxTreeSelectTree` actually renders when its `rows` prop
-     * windows below `flat`; `null` when unrestricted. Navigation and the
-     * initial active node draw from this so `aria-activedescendant` never
-     * names a node with no rendered `treeitem`.
-     */
+    /** Node values `SkdxTreeSelectTree` actually renders when `rows` windows below `flat`; `null` when unrestricted. */
     visibleRowValues: Readonly<Ref<ReadonlySet<string> | null>>;
     /** Reported by `SkdxTreeSelectTree` whenever its `rows` prop changes. */
     setVisibleRowValues(values: ReadonlySet<string> | null): void;
@@ -124,11 +126,7 @@ export interface TreeSelectItemContext {
 export declare const TREE_SELECT_ITEM_CONTEXT: InjectionKey<TreeSelectItemContext>;
 /** @internal Generates the id prefix a TreeSelect keys its `treeitem` DOM ids off. */
 export declare function nextTreeSelectId(suffix: string): string;
-/**
- * Default `filter`: case-insensitive substring match on `label ?? value`.
- * Lives here, not in `TreeSelect.vue`, because `withDefaults(defineProps())`
- * is hoisted out of `setup()` and can only reference an imported binding.
- */
+/** Default `filter`: case-insensitive substring match on `label ?? value`. */
 export declare function defaultTreeSelectFilter(node: TreeSelectNode, inputValue: string): boolean;
 /** Default `getMatchCountLabel`: `"1 match available"` / `"3 matches available"`. */
 export declare function defaultGetMatchCountLabel(count: number): string;

package/dist/tree-select/context.d.ts

@@ -1,5 +1,6 @@
 import type { InjectionKey, Ref, VNodeChild } from 'vue';
 import type { TreeCheckedState } from '../tree/context.js';
+import type { TreeColumn } from '../utils/tree-columns.js';
 import type { TreeSelectFlatNode, TreeSelectIndex } from './collection.js';
 /**
  * Node data (not elements), so cascading/filtering see collapsed branches.
@@ -8,7 +9,7 @@ export interface TreeSelectNode {
     /** Unique identifier across the collection; what lands in `value`. */
     value: string;
     /**
-     * Node label (display, filter). @default undefined → value
+     * Node label used for display and filtering. @default undefined → value
      */
     label?: string;
     /**
@@ -16,16 +17,16 @@ export interface TreeSelectNode {
      */
     disabled?: boolean;
     /**
-     * Child nodes (none = leaf). @default undefined
+     * Child nodes; a node with none is a leaf. @default undefined
      */
     children?: TreeSelectNode[];
     /**
-     * Branch with unloaded children (lazy-loading). @default undefined
+     * Marks a branch whose children have not loaded yet. @default undefined
      */
     hasChildren?: boolean;
 }
 /**
- * How checking a node propagates through the hierarchy. Only meaningful while `multiple` is set.
+ * How checking a node propagates through the hierarchy, only meaningful while `multiple` is set.
  *
  * - `'cascade'` — both directions; a partly-checked parent reports `aria-checked="mixed"`.
  * - `'descendants'` — downwards only: checking a parent checks its subtree.
@@ -39,8 +40,6 @@ export type TreeSelectCheckStrategy = 'cascade' | 'descendants' | 'ancestors' |
  * - `'all'` — every checked node, parents and descendants alike.
  * - `'leaf'` — only checked leaves; branches are dropped.
  * - `'shallowest'` — only the topmost fully-checked node of each branch.
- *
- * Falls back to `'all'` wherever `check-strategy="independent"` would otherwise silently drop a selection.
  */
 export type TreeSelectValueStrategy = 'all' | 'leaf' | 'shallowest';
 /** Predicate deciding whether a node matches the current filter text. */
@@ -83,6 +82,14 @@ export interface TreeSelectContext {
     /** Node's treeitem DOM id (aria-activedescendant). */
     itemId(value: string): string;
     treeId: string;
+    /** The layout actually drawn; a filter narrows a `'columns'` popup back to `'tree'`. */
+    layout: Readonly<Ref<'tree' | 'columns'>>;
+    /** Showing columns left to right, empty in the tree layout. */
+    columns: Readonly<Ref<readonly TreeColumn[]>>;
+    /** Column tree's DOM id; the root column keeps `treeId`. */
+    columnTreeId(index: number): string;
+    /** Tree id the anchor's `aria-controls` names (the active node's column). */
+    activeTreeId: Readonly<Ref<string>>;
     triggerRef: Ref<HTMLElement | null>;
     contentRef: Ref<HTMLElement | null>;
     inputRef: Ref<HTMLInputElement | null>;
@@ -98,12 +105,7 @@ export interface TreeSelectContext {
         typeahead: boolean;
         selectOnSpace: boolean;
     }): void;
-    /**
-     * Node values `SkdxTreeSelectTree` actually renders when its `rows` prop
-     * windows below `flat`; `null` when unrestricted. Navigation and the
-     * initial active node draw from this so `aria-activedescendant` never
-     * names a node with no rendered `treeitem`.
-     */
+    /** Node values `SkdxTreeSelectTree` actually renders when `rows` windows below `flat`; `null` when unrestricted. */
     visibleRowValues: Readonly<Ref<ReadonlySet<string> | null>>;
     /** Reported by `SkdxTreeSelectTree` whenever its `rows` prop changes. */
     setVisibleRowValues(values: ReadonlySet<string> | null): void;
@@ -124,11 +126,7 @@ export interface TreeSelectItemContext {
 export declare const TREE_SELECT_ITEM_CONTEXT: InjectionKey<TreeSelectItemContext>;
 /** @internal Generates the id prefix a TreeSelect keys its `treeitem` DOM ids off. */
 export declare function nextTreeSelectId(suffix: string): string;
-/**
- * Default `filter`: case-insensitive substring match on `label ?? value`.
- * Lives here, not in `TreeSelect.vue`, because `withDefaults(defineProps())`
- * is hoisted out of `setup()` and can only reference an imported binding.
- */
+/** Default `filter`: case-insensitive substring match on `label ?? value`. */
 export declare function defaultTreeSelectFilter(node: TreeSelectNode, inputValue: string): boolean;
 /** Default `getMatchCountLabel`: `"1 match available"` / `"3 matches available"`. */
 export declare function defaultGetMatchCountLabel(count: number): string;

package/dist/tree-select/nodes.cjs

@@ -1 +1 @@
-const a=require("../tree/TreeGroup.vue.cjs"),d=require("./context.cjs"),c=require("./TreeSelectItem.vue.cjs");let r=require("vue");var o=(0,r.defineComponent)({name:"SkdxTreeSelectNodes",inheritAttrs:!1,props:{nodes:{type:Array,required:!0},renderLabel:{type:Function,default:void 0}},setup(t){const l=(0,r.inject)(d.TREE_SELECT_CONTEXT);if(!l)throw new Error("SkdxTreeSelectTree must be used within SkdxTreeSelect.");const u=n=>n.filter(e=>l.isVisible(e.value)).map(e=>{const i=(e.children??[]).filter(s=>l.isVisible(s.value));return(0,r.h)(c.default,{node:e,key:e.value},()=>[t.renderLabel?t.renderLabel(e):e.label??e.value,i.length>0?(0,r.h)(a.default,null,()=>u(i)):null])});return()=>u(t.nodes)}});exports.default=o;
+const s=require("../utils/injectRequired.cjs"),a=require("../tree/TreeGroup.vue.cjs"),c=require("./context.cjs"),o=require("./TreeSelectItem.vue.cjs");let t=require("vue");var q=(0,t.defineComponent)({name:"SkdxTreeSelectNodes",inheritAttrs:!1,props:{nodes:{type:Array,required:!0},renderLabel:{type:Function,default:void 0}},setup(r){const u=s.injectRequired(c.TREE_SELECT_CONTEXT,"SkdxTreeSelectTree must be used within SkdxTreeSelect."),i=n=>n.filter(e=>u.isVisible(e.value)).map(e=>{const l=(e.children??[]).filter(d=>u.isVisible(d.value));return(0,t.h)(o.default,{node:e,key:e.value},()=>[r.renderLabel?r.renderLabel(e):e.label??e.value,l.length>0?(0,t.h)(a.default,null,()=>i(l)):null])});return()=>i(r.nodes)}});exports.default=q;

package/dist/tree-select/nodes.d.cts

@@ -1,9 +1,6 @@
 import { type PropType, type VNodeChild } from 'vue';
 import { type TreeSelectNode, type TreeSelectRenderLabel } from './context.cjs';
-/**
- * @internal Renders one item per visible node, nesting children in `SkdxTreeGroup`.
- * A render function because recursion requires self-reference.
- */
+/** @internal Renders one item per visible node, nesting children in `SkdxTreeGroup`. */
 declare const _default: import("vue").DefineComponent<import("vue").ExtractPropTypes<{
     /** The sibling nodes to render at this level, before filtering. */
     nodes: {
@@ -12,7 +9,7 @@ declare const _default: import("vue").DefineComponent<import("vue").ExtractPropT
     };
     /** Renders a node's content; defaults to its `label ?? value` as plain text. */
     renderLabel: {
-        type: PropType<TreeSelectRenderLabel>;
+        type: PropType<TreeSelectRenderLabel | undefined>;
         default: undefined;
     };
 }>, () => VNodeChild, {}, {}, {}, import("vue").ComponentOptionsMixin, import("vue").ComponentOptionsMixin, {}, string, import("vue").PublicProps, Readonly<import("vue").ExtractPropTypes<{
@@ -23,10 +20,10 @@ declare const _default: import("vue").DefineComponent<import("vue").ExtractPropT
     };
     /** Renders a node's content; defaults to its `label ?? value` as plain text. */
     renderLabel: {
-        type: PropType<TreeSelectRenderLabel>;
+        type: PropType<TreeSelectRenderLabel | undefined>;
         default: undefined;
     };
 }>> & Readonly<{}>, {
-    renderLabel: TreeSelectRenderLabel;
+    renderLabel: TreeSelectRenderLabel | undefined;
 }, {}, {}, {}, string, import("vue").ComponentProvideOptions, true, {}, any>;
 export default _default;

package/dist/tree-select/nodes.d.ts

@@ -1,9 +1,6 @@
 import { type PropType, type VNodeChild } from 'vue';
 import { type TreeSelectNode, type TreeSelectRenderLabel } from './context.js';
-/**
- * @internal Renders one item per visible node, nesting children in `SkdxTreeGroup`.
- * A render function because recursion requires self-reference.
- */
+/** @internal Renders one item per visible node, nesting children in `SkdxTreeGroup`. */
 declare const _default: import("vue").DefineComponent<import("vue").ExtractPropTypes<{
     /** The sibling nodes to render at this level, before filtering. */
     nodes: {
@@ -12,7 +9,7 @@ declare const _default: import("vue").DefineComponent<import("vue").ExtractPropT
     };
     /** Renders a node's content; defaults to its `label ?? value` as plain text. */
     renderLabel: {
-        type: PropType<TreeSelectRenderLabel>;
+        type: PropType<TreeSelectRenderLabel | undefined>;
         default: undefined;
     };
 }>, () => VNodeChild, {}, {}, {}, import("vue").ComponentOptionsMixin, import("vue").ComponentOptionsMixin, {}, string, import("vue").PublicProps, Readonly<import("vue").ExtractPropTypes<{
@@ -23,10 +20,10 @@ declare const _default: import("vue").DefineComponent<import("vue").ExtractPropT
     };
     /** Renders a node's content; defaults to its `label ?? value` as plain text. */
     renderLabel: {
-        type: PropType<TreeSelectRenderLabel>;
+        type: PropType<TreeSelectRenderLabel | undefined>;
         default: undefined;
     };
 }>> & Readonly<{}>, {
-    renderLabel: TreeSelectRenderLabel;
+    renderLabel: TreeSelectRenderLabel | undefined;
 }, {}, {}, {}, string, import("vue").ComponentProvideOptions, true, {}, any>;
 export default _default;

package/dist/tree-select/nodes.js

@@ -1 +1 @@
-import e from"../tree/TreeGroup.vue.js";import{TREE_SELECT_CONTEXT as r}from"./context.js";import t from"./TreeSelectItem.vue.js";import{defineComponent as n,h as l,inject as o}from"vue";var i=n({name:"SkdxTreeSelectNodes",inheritAttrs:!1,props:{nodes:{type:Array,required:!0},renderLabel:{type:Function,default:void 0}},setup(n){const i=o(r);if(!i)throw new Error("SkdxTreeSelectTree must be used within SkdxTreeSelect.");const s=r=>r.filter(e=>i.isVisible(e.value)).map(r=>{const o=(r.children??[]).filter(e=>i.isVisible(e.value));return l(t,{node:r,key:r.value},()=>[n.renderLabel?n.renderLabel(r):r.label??r.value,o.length>0?l(e,null,()=>s(o)):null])});return()=>s(n.nodes)}});export{i as default};
+import{injectRequired as e}from"../utils/injectRequired.js";import r from"../tree/TreeGroup.vue.js";import{TREE_SELECT_CONTEXT as t}from"./context.js";import i from"./TreeSelectItem.vue.js";import{defineComponent as l,h as n}from"vue";var o=l({name:"SkdxTreeSelectNodes",inheritAttrs:!1,props:{nodes:{type:Array,required:!0},renderLabel:{type:Function,default:void 0}},setup(l){const o=e(t,"SkdxTreeSelectTree must be used within SkdxTreeSelect."),s=e=>e.filter(e=>o.isVisible(e.value)).map(e=>{const t=(e.children??[]).filter(e=>o.isVisible(e.value));return n(i,{node:e,key:e.value},()=>[l.renderLabel?l.renderLabel(e):e.label??e.value,t.length>0?n(r,null,()=>s(t)):null])});return()=>s(l.nodes)}});export{o as default};

package/dist/tree-select/primitives.cjs

@@ -1 +1 @@
-Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./TreeSelectContent.vue.cjs"),r=require("./TreeSelectEmpty.vue.cjs"),t=require("./TreeSelectInput.vue.cjs"),l=require("./TreeSelectItemIndicator.vue.cjs"),u=require("./TreeSelectPortal.vue.cjs"),c=require("./TreeSelectItem.vue.cjs"),S=require("./TreeSelectTree.vue.cjs"),i=require("./TreeSelectTrigger.vue.cjs"),T=require("./TreeSelectValue.vue.cjs"),d=require("./TreeSelect.vue.cjs");exports.SkdxTreeSelect=d.default;exports.SkdxTreeSelectContent=e.default;exports.SkdxTreeSelectEmpty=r.default;exports.SkdxTreeSelectInput=t.default;exports.SkdxTreeSelectItem=c.default;exports.SkdxTreeSelectItemIndicator=l.default;exports.SkdxTreeSelectPortal=u.default;exports.SkdxTreeSelectTree=S.default;exports.SkdxTreeSelectTrigger=i.default;exports.SkdxTreeSelectValue=T.default;
+Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("./TreeSelectColumns.vue.cjs"),r=require("./TreeSelectContent.vue.cjs"),t=require("./TreeSelectEmpty.vue.cjs"),l=require("./TreeSelectInput.vue.cjs"),u=require("./TreeSelectItemIndicator.vue.cjs"),c=require("./TreeSelectPortal.vue.cjs"),S=require("./TreeSelectItem.vue.cjs"),i=require("./TreeSelectTree.vue.cjs"),T=require("./TreeSelectTrigger.vue.cjs"),d=require("./TreeSelectValue.vue.cjs"),n=require("./TreeSelect.vue.cjs");exports.SkdxTreeSelect=n.default;exports.SkdxTreeSelectColumns=e.default;exports.SkdxTreeSelectContent=r.default;exports.SkdxTreeSelectEmpty=t.default;exports.SkdxTreeSelectInput=l.default;exports.SkdxTreeSelectItem=S.default;exports.SkdxTreeSelectItemIndicator=u.default;exports.SkdxTreeSelectPortal=c.default;exports.SkdxTreeSelectTree=i.default;exports.SkdxTreeSelectTrigger=T.default;exports.SkdxTreeSelectValue=d.default;

package/dist/tree-select/primitives.d.cts

@@ -1,6 +1,5 @@
 /**
- * Primitives for `SkdxTreeSelect` — composable building blocks.
- * Use these when you need a custom layout beyond the derived recipe.
+ * Composable primitives for `SkdxTreeSelect`, for a custom layout beyond the derived recipe.
  *
  * @example
  * ```vue
@@ -23,6 +22,7 @@
  * ```
  */
 export { default as SkdxTreeSelect } from './TreeSelect.vue.cjs';
+export { default as SkdxTreeSelectColumns } from './TreeSelectColumns.vue.cjs';
 export { default as SkdxTreeSelectContent } from './TreeSelectContent.vue.cjs';
 export { default as SkdxTreeSelectEmpty } from './TreeSelectEmpty.vue.cjs';
 export { default as SkdxTreeSelectInput } from './TreeSelectInput.vue.cjs';

package/dist/tree-select/primitives.d.ts

@@ -1,6 +1,5 @@
 /**
- * Primitives for `SkdxTreeSelect` — composable building blocks.
- * Use these when you need a custom layout beyond the derived recipe.
+ * Composable primitives for `SkdxTreeSelect`, for a custom layout beyond the derived recipe.
  *
  * @example
  * ```vue
@@ -23,6 +22,7 @@
  * ```
  */
 export { default as SkdxTreeSelect } from './TreeSelect.vue.js';
+export { default as SkdxTreeSelectColumns } from './TreeSelectColumns.vue.js';
 export { default as SkdxTreeSelectContent } from './TreeSelectContent.vue.js';
 export { default as SkdxTreeSelectEmpty } from './TreeSelectEmpty.vue.js';
 export { default as SkdxTreeSelectInput } from './TreeSelectInput.vue.js';

package/dist/tree-select/primitives.js

@@ -1 +1 @@
-import e from"./TreeSelectContent.vue.js";import r from"./TreeSelectEmpty.vue.js";import t from"./TreeSelectInput.vue.js";import S from"./TreeSelectItemIndicator.vue.js";import o from"./TreeSelectPortal.vue.js";import m from"./TreeSelectItem.vue.js";import l from"./TreeSelectTree.vue.js";import T from"./TreeSelectTrigger.vue.js";import c from"./TreeSelectValue.vue.js";import s from"./TreeSelect.vue.js";export{s as SkdxTreeSelect,e as SkdxTreeSelectContent,r as SkdxTreeSelectEmpty,t as SkdxTreeSelectInput,m as SkdxTreeSelectItem,S as SkdxTreeSelectItemIndicator,o as SkdxTreeSelectPortal,l as SkdxTreeSelectTree,T as SkdxTreeSelectTrigger,c as SkdxTreeSelectValue};
+import e from"./TreeSelectColumns.vue.js";import r from"./TreeSelectContent.vue.js";import t from"./TreeSelectEmpty.vue.js";import S from"./TreeSelectInput.vue.js";import o from"./TreeSelectItemIndicator.vue.js";import m from"./TreeSelectPortal.vue.js";import l from"./TreeSelectItem.vue.js";import T from"./TreeSelectTree.vue.js";import c from"./TreeSelectTrigger.vue.js";import s from"./TreeSelectValue.vue.js";import a from"./TreeSelect.vue.js";export{a as SkdxTreeSelect,e as SkdxTreeSelectColumns,r as SkdxTreeSelectContent,t as SkdxTreeSelectEmpty,S as SkdxTreeSelectInput,l as SkdxTreeSelectItem,o as SkdxTreeSelectItemIndicator,m as SkdxTreeSelectPortal,T as SkdxTreeSelectTree,c as SkdxTreeSelectTrigger,s as SkdxTreeSelectValue};

package/dist/tree-select/rows.cjs

@@ -1 +1 @@
-const l=require("./context.cjs"),a=require("./TreeSelectItem.vue.cjs");let t=require("vue");var d=(0,t.defineComponent)({name:"SkdxTreeSelectRows",inheritAttrs:!1,props:{rows:{type:Array,required:!0},renderLabel:{type:Function,default:void 0}},setup(r){const n=(0,t.inject)(l.TREE_SELECT_CONTEXT);if(!n)throw new Error("SkdxTreeSelectTree must be used within SkdxTreeSelect.");return()=>r.rows.map(u=>{const e=n.index.value.get(u.value)?.node;return e?(0,t.h)(a.default,{node:e,key:u.value},()=>[r.renderLabel?r.renderLabel(e):e.label??e.value]):null})}});exports.default=d;
+const l=require("../utils/injectRequired.cjs"),i=require("./context.cjs"),d=require("./TreeSelectItem.vue.cjs");let u=require("vue");var a=(0,u.defineComponent)({name:"SkdxTreeSelectRows",inheritAttrs:!1,props:{rows:{type:Array,required:!0},renderLabel:{type:Function,default:void 0}},setup(r){const n=l.injectRequired(i.TREE_SELECT_CONTEXT,"SkdxTreeSelectTree must be used within SkdxTreeSelect.");return()=>r.rows.map(t=>{const e=n.index.value.get(t.value)?.node;return e?(0,u.h)(d.default,{node:e,key:t.value,"aria-level":t.depth},()=>[r.renderLabel?r.renderLabel(e):e.label??e.value]):null})}});exports.default=a;

package/dist/tree-select/rows.d.cts

@@ -1,11 +1,8 @@
 import { type PropType, type VNodeChild } from 'vue';
 import { type TreeSelectRenderLabel } from './context.cjs';
-/**
- * @internal Renders rows flat — one `SkdxTreeSelectItem` per row, no nesting —
- * for the windowed path. Aria attributes derive from the unwindowed root index.
- */
+/** @internal Renders rows flat, one `SkdxTreeSelectItem` per row with no nesting, for the windowed path. */
 declare const _default: import("vue").DefineComponent<import("vue").ExtractPropTypes<{
-    /** The row values to render, in the order they should appear. `depth` is unused here — Vue's item derives `aria-level` from the root's own index. */
+    /** The row values to render, in the order they should appear. */
     rows: {
         type: PropType<readonly {
             value: string;
@@ -15,11 +12,11 @@ declare const _default: import("vue").DefineComponent<import("vue").ExtractPropT
     };
     /** Renders a node's content; defaults to its `label ?? value` as plain text. */
     renderLabel: {
-        type: PropType<TreeSelectRenderLabel>;
+        type: PropType<TreeSelectRenderLabel | undefined>;
         default: undefined;
     };
 }>, () => VNodeChild, {}, {}, {}, import("vue").ComponentOptionsMixin, import("vue").ComponentOptionsMixin, {}, string, import("vue").PublicProps, Readonly<import("vue").ExtractPropTypes<{
-    /** The row values to render, in the order they should appear. `depth` is unused here — Vue's item derives `aria-level` from the root's own index. */
+    /** The row values to render, in the order they should appear. */
     rows: {
         type: PropType<readonly {
             value: string;
@@ -29,10 +26,10 @@ declare const _default: import("vue").DefineComponent<import("vue").ExtractPropT
     };
     /** Renders a node's content; defaults to its `label ?? value` as plain text. */
     renderLabel: {
-        type: PropType<TreeSelectRenderLabel>;
+        type: PropType<TreeSelectRenderLabel | undefined>;
         default: undefined;
     };
 }>> & Readonly<{}>, {
-    renderLabel: TreeSelectRenderLabel;
+    renderLabel: TreeSelectRenderLabel | undefined;
 }, {}, {}, {}, string, import("vue").ComponentProvideOptions, true, {}, any>;
 export default _default;

package/dist/tree-select/rows.d.ts

@@ -1,11 +1,8 @@
 import { type PropType, type VNodeChild } from 'vue';
 import { type TreeSelectRenderLabel } from './context.js';
-/**
- * @internal Renders rows flat — one `SkdxTreeSelectItem` per row, no nesting —
- * for the windowed path. Aria attributes derive from the unwindowed root index.
- */
+/** @internal Renders rows flat, one `SkdxTreeSelectItem` per row with no nesting, for the windowed path. */
 declare const _default: import("vue").DefineComponent<import("vue").ExtractPropTypes<{
-    /** The row values to render, in the order they should appear. `depth` is unused here — Vue's item derives `aria-level` from the root's own index. */
+    /** The row values to render, in the order they should appear. */
     rows: {
         type: PropType<readonly {
             value: string;
@@ -15,11 +12,11 @@ declare const _default: import("vue").DefineComponent<import("vue").ExtractPropT
     };
     /** Renders a node's content; defaults to its `label ?? value` as plain text. */
     renderLabel: {
-        type: PropType<TreeSelectRenderLabel>;
+        type: PropType<TreeSelectRenderLabel | undefined>;
         default: undefined;
     };
 }>, () => VNodeChild, {}, {}, {}, import("vue").ComponentOptionsMixin, import("vue").ComponentOptionsMixin, {}, string, import("vue").PublicProps, Readonly<import("vue").ExtractPropTypes<{
-    /** The row values to render, in the order they should appear. `depth` is unused here — Vue's item derives `aria-level` from the root's own index. */
+    /** The row values to render, in the order they should appear. */
     rows: {
         type: PropType<readonly {
             value: string;
@@ -29,10 +26,10 @@ declare const _default: import("vue").DefineComponent<import("vue").ExtractPropT
     };
     /** Renders a node's content; defaults to its `label ?? value` as plain text. */
     renderLabel: {
-        type: PropType<TreeSelectRenderLabel>;
+        type: PropType<TreeSelectRenderLabel | undefined>;
         default: undefined;
     };
 }>> & Readonly<{}>, {
-    renderLabel: TreeSelectRenderLabel;
+    renderLabel: TreeSelectRenderLabel | undefined;
 }, {}, {}, {}, string, import("vue").ComponentProvideOptions, true, {}, any>;
 export default _default;

package/dist/tree-select/rows.js

@@ -1 +1 @@
-import{TREE_SELECT_CONTEXT as e}from"./context.js";import r from"./TreeSelectItem.vue.js";import{defineComponent as t,h as n,inject as o}from"vue";var a=t({name:"SkdxTreeSelectRows",inheritAttrs:!1,props:{rows:{type:Array,required:!0},renderLabel:{type:Function,default:void 0}},setup(t){const a=o(e);if(!a)throw new Error("SkdxTreeSelectTree must be used within SkdxTreeSelect.");return()=>t.rows.map(e=>{const o=a.index.value.get(e.value)?.node;return o?n(r,{node:o,key:e.value},()=>[t.renderLabel?t.renderLabel(o):o.label??o.value]):null})}});export{a as default};
+import{injectRequired as e}from"../utils/injectRequired.js";import{TREE_SELECT_CONTEXT as r}from"./context.js";import t from"./TreeSelectItem.vue.js";import{defineComponent as n,h as o}from"vue";var a=n({name:"SkdxTreeSelectRows",inheritAttrs:!1,props:{rows:{type:Array,required:!0},renderLabel:{type:Function,default:void 0}},setup(n){const a=e(r,"SkdxTreeSelectTree must be used within SkdxTreeSelect.");return()=>n.rows.map(e=>{const r=a.index.value.get(e.value)?.node;return r?o(t,{node:r,key:e.value,"aria-level":e.depth},()=>[n.renderLabel?n.renderLabel(r):r.label??r.value]):null})}});export{a as default};

package/dist/utils/Glyph.vue.cjs

@@ -0,0 +1 @@
+const e=require("./Glyph.vue_vue_type_script_setup_true_lang.cjs");var u=e.default;exports.default=u;

package/dist/utils/Glyph.vue.d.cts

@@ -0,0 +1,7 @@
+import { type GlyphName } from './glyph-data.cjs';
+/** @internal A built-in decorative glyph: 1em, aria-hidden, painted with currentColor. */
+type __VLS_Props = {
+    name: GlyphName;
+};
+declare const _default: import("vue").DefineComponent<__VLS_Props, {}, {}, {}, {}, import("vue").ComponentOptionsMixin, import("vue").ComponentOptionsMixin, {}, string, import("vue").PublicProps, Readonly<__VLS_Props> & Readonly<{}>, {}, {}, {}, {}, string, import("vue").ComponentProvideOptions, false, {}, any>;
+export default _default;

package/dist/utils/Glyph.vue.d.ts

@@ -0,0 +1,7 @@
+import { type GlyphName } from './glyph-data.js';
+/** @internal A built-in decorative glyph: 1em, aria-hidden, painted with currentColor. */
+type __VLS_Props = {
+    name: GlyphName;
+};
+declare const _default: import("vue").DefineComponent<__VLS_Props, {}, {}, {}, {}, import("vue").ComponentOptionsMixin, import("vue").ComponentOptionsMixin, {}, string, import("vue").PublicProps, Readonly<__VLS_Props> & Readonly<{}>, {}, {}, {}, {}, string, import("vue").ComponentProvideOptions, false, {}, any>;
+export default _default;

package/dist/utils/Glyph.vue.js

@@ -0,0 +1 @@
+import e from"./Glyph.vue_vue_type_script_setup_true_lang.js";var t=e;export{t as default};

package/dist/utils/Glyph.vue_vue_type_script_setup_true_lang.cjs

@@ -0,0 +1 @@
+const t=require("./glyph-data.cjs");let e=require("vue");var n=["viewBox","fill"],a=["d"],u=["d","stroke-width"],i=(0,e.defineComponent)({__name:"Glyph",props:{name:{}},setup(o){const r=o,l=(0,e.computed)(()=>t.GLYPHS[r.name]);return(_,c)=>((0,e.openBlock)(),(0,e.createElementBlock)("svg",{viewBox:l.value.viewBox,width:"1em",height:"1em",fill:l.value.fill?"currentColor":"none","aria-hidden":"true",focusable:"false"},[l.value.fill?((0,e.openBlock)(),(0,e.createElementBlock)("path",{key:0,d:l.value.d},null,8,a)):((0,e.openBlock)(),(0,e.createElementBlock)("path",{key:1,d:l.value.d,stroke:"currentColor","stroke-width":(0,e.unref)(t.GLYPH_STROKE_WIDTH),"stroke-linecap":"round","stroke-linejoin":"round"},null,8,u))],8,n))}});exports.default=i;

package/dist/utils/Glyph.vue_vue_type_script_setup_true_lang.js

@@ -0,0 +1 @@
+import{GLYPHS as e,GLYPH_STROKE_WIDTH as o}from"./glyph-data.js";import{computed as l,createElementBlock as a,defineComponent as r,openBlock as t,unref as n}from"vue";var s=["viewBox","fill"],i=["d"],u=["d","stroke-width"],d=/* @__PURE__ */r({__name:"Glyph",props:{name:{}},setup(r){const d=r,p=l(()=>e[d.name]);return(e,l)=>(t(),a("svg",{viewBox:p.value.viewBox,width:"1em",height:"1em",fill:p.value.fill?"currentColor":"none","aria-hidden":"true",focusable:"false"},[p.value.fill?(t(),a("path",{key:0,d:p.value.d},null,8,i)):(t(),a("path",{key:1,d:p.value.d,stroke:"currentColor","stroke-width":n(o),"stroke-linecap":"round","stroke-linejoin":"round"},null,8,u))],8,s))}});export{d as default};