@reforma/components 0.0.0-stage → 0.1.0

package/dist/SortableList/SortableList.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"SortableList.js","sources":["../../src/SortableList/SortableList.tsx"],"sourcesContent":["import {\n    DragDropProvider,\n    DragOverlay,\n    PointerSensor,\n    useDroppable,\n    type DragEndEvent,\n} from '@dnd-kit/react';\nimport { isSortable, useSortable } from '@dnd-kit/react/sortable';\nimport { DotsDrag } from '@reforma/icons/14';\nimport { cn } from '@reforma/lib';\nimport { useCallback, useMemo, useRef } from 'react';\n\nimport { For } from '../For';\nimport styles from './SortableList.module.css';\nimport {\n    buildSortableTree,\n    findSortableTreeNode,\n    moveSortableTreeNodeToIndex,\n    restoreSortableTree,\n    type SortableTreeNode,\n} from './sortableTree';\n\nimport type { ReactElement, ReactNode } from 'react';\n\nexport type SortableListDragHandleAlignment = 'center' | 'top';\nexport type SortableListDragHandleEdgeOffset = 'none' | 'sm' | 'md';\nexport type SortableListDragHandleVariant = 'plain' | 'surface';\n\nexport interface SortableListDragHandleOptions {\n    alignment?: SortableListDragHandleAlignment;\n    edgeOffset?: SortableListDragHandleEdgeOffset;\n    variant?: SortableListDragHandleVariant;\n}\n\nexport interface SortableListItemContext<T> {\n    level: number;\n    parent: T | null;\n    index: number;\n    siblingCount: number;\n    isFirst: boolean;\n    isLast: boolean;\n    hasChildren: boolean;\n    canHaveChildren: boolean;\n}\n\nexport interface SortableListItemRenderProps<T> extends SortableListItemContext<T> {\n    nestedItems: ReactNode;\n    isDragging: boolean;\n    isDropTarget: boolean;\n}\n\nexport interface SortableListDropContext<T> {\n    items: readonly T[];\n    target: T | null;\n    sourceParent: T | null;\n    sourceLevel: number;\n    parent: T | null;\n    targetLevel: number;\n    dropPosition: 'on' | 'before' | 'after' | 'end';\n}\n\ninterface SortableListBaseProps<T> {\n    items: readonly T[];\n    getKey?: (item: T, path: readonly number[]) => string;\n    getTextValue: (item: T) => string;\n    onChange: (items: T[]) => void;\n    children: (item: T, props: SortableListItemRenderProps<T>) => ReactNode;\n    canDrop?: (context: SortableListDropContext<T>) => boolean;\n    getDragHandleOptions?: (\n        item: T,\n        context: SortableListItemContext<T>\n    ) => SortableListDragHandleOptions;\n    className?: string;\n    gap?: 'sm' | 'md';\n    nestedGap?: 'sm' | 'md';\n    'aria-label': string;\n}\n\ninterface FlatSortableListProps {\n    getChildren?: never;\n    setChildren?: never;\n    canHaveChildren?: never;\n}\n\ninterface NestedSortableListProps<T> {\n    getChildren: (item: T) => readonly T[];\n    setChildren: (item: T, children: T[]) => T;\n    canHaveChildren?: (item: T) => boolean;\n}\n\nexport type SortableListProps<T> = SortableListBaseProps<T>\n  & (FlatSortableListProps | NestedSortableListProps<T>);\n\ninterface SortableNodeData<T> {\n    kind: 'node';\n    node: SortableTreeNode<T>;\n}\n\ninterface SortableCollectionData<T> {\n    kind: 'collection';\n    parentNode: SortableTreeNode<T> | null;\n}\n\ninterface SortableCollectionProps<T> {\n    nodes: readonly SortableTreeNode<T>[];\n    rootNodes: readonly SortableTreeNode<T>[];\n    parentNode: SortableTreeNode<T> | null;\n    renderItem: (item: T, props: SortableListItemRenderProps<T>) => ReactNode;\n    canDrop?: (context: SortableListDropContext<T>) => boolean;\n    getDragHandleOptions?: (\n        item: T,\n        context: SortableListItemContext<T>\n    ) => SortableListDragHandleOptions;\n    className?: string;\n    gap: 'sm' | 'md';\n    nestedGap: 'sm' | 'md';\n    ariaLabel: string;\n}\n\ninterface SortableItemProps<T> extends Omit<SortableCollectionProps<T>, 'nodes' | 'className' | 'gap' | 'ariaLabel' | 'parentNode'> {\n    node: SortableTreeNode<T>;\n}\n\ninterface SortableDestination<T> {\n    parentNode: SortableTreeNode<T> | null;\n    index: number;\n    dropPosition: 'before' | 'after' | 'end';\n}\n\nconst ROOT_COLLECTION_ID = 'reforma-sortable:root';\nconst CHILD_COLLECTION_PREFIX = 'reforma-sortable:children:';\nconst SORTABLE_ITEM_TYPE = 'reforma-sortable:item';\nconst SORTABLE_COLLECTION_TYPE = 'reforma-sortable:collection';\nconst POINTER_SENSORS = [PointerSensor];\nconst PRIMITIVE_KEY_PREFIX = 'sortable:primitive:';\n\n/**\n * Sortable collection with a dedicated pointer handle and optional child groups.\n *\n * The rendered item is the complete draggable surface. Child collections can\n * accept moves when the caller's drop rules allow it.\n */\nexport function SortableList<T>({\n    items,\n    getKey: getItemKey,\n    getTextValue,\n    getChildren,\n    setChildren,\n    canHaveChildren,\n    onChange,\n    children,\n    canDrop,\n    getDragHandleOptions,\n    className,\n    gap = 'md',\n    nestedGap = gap,\n    'aria-label': ariaLabel,\n}: SortableListProps<T>) {\n    const keyState = useRef({\n        nextId: 0,\n        objectKeys: new WeakMap<object, string>(),\n    });\n    const getNodeKey = useCallback((item: T, path: readonly number[]) => {\n        const itemKey = getItemKey?.(item, path);\n\n        if (itemKey != null) {\n            return itemKey;\n        }\n\n        if (typeof item !== 'object' || item == null) {\n            return `${ PRIMITIVE_KEY_PREFIX }${ path.join('.') }`;\n        }\n\n        const existingKey = keyState.current.objectKeys.get(item);\n\n        if (existingKey) {\n            return existingKey;\n        }\n\n        const key = `sortable:item:${ keyState.current.nextId }`;\n\n        keyState.current.nextId += 1;\n        keyState.current.objectKeys.set(item, key);\n\n        return key;\n    }, [getItemKey]);\n    const nodes = useMemo(() => buildSortableTree(items, {\n        getKey: getNodeKey,\n        getTextValue,\n        getChildren,\n        canHaveChildren,\n    }), [canHaveChildren, getChildren, getNodeKey, getTextValue, items]);\n    const renderState = useRef({ items, revision: 0 });\n\n    if (renderState.current.items !== items) {\n        renderState.current = {\n            items,\n            revision: renderState.current.revision + 1,\n        };\n    }\n\n    function handleDragEnd(event: DragEndEvent) {\n        const { canceled, operation } = event;\n        const { source, target } = operation;\n\n        if (canceled || !source || !isSortable(source)) {\n            return;\n        }\n\n        const sourceNode = nodeData<T>(source)?.node;\n\n        if (!sourceNode) {\n            return;\n        }\n\n        const targetData = entityData<T>(target);\n        const targetNode = targetData?.kind === 'node' ? targetData.node : null;\n        let destination: SortableDestination<T> | null;\n\n        if (targetData?.kind === 'collection') {\n            destination = {\n                parentNode: targetData.parentNode,\n                index: targetData.parentNode?.children.length ?? nodes.length,\n                dropPosition: 'end' as const,\n            };\n        }\n        else if (targetNode\n          && target\n          && isSortable(target)) {\n            destination = destinationFromSortable(\n                nodes,\n                target.group,\n                source.index,\n                targetNode\n            );\n        }\n        else {\n            destination = null;\n        }\n\n        if (!destination) {\n            return;\n        }\n\n        const context = createDropContext(\n            sourceNode,\n            destination.parentNode,\n            targetNode,\n            destination.dropPosition\n        );\n\n        if (!canMoveToParent(sourceNode, destination.parentNode)\n          || (canDrop && !canDrop(context))) {\n            return;\n        }\n\n        const initialParentKey = parentKeyFromCollectionId(source.initialGroup);\n        const destinationParentKey = destination.parentNode?.id ?? null;\n        const isSamePosition = initialParentKey !== undefined\n          && initialParentKey === destinationParentKey\n          && source.initialIndex === destination.index;\n\n        if (isSamePosition) {\n            return;\n        }\n\n        const movedNodes = moveSortableTreeNodeToIndex(\n            nodes,\n            sourceNode.id,\n            destinationParentKey,\n            destination.index\n        );\n\n        onChange(restoreSortableTree(movedNodes, setChildren));\n    }\n\n    return (\n        <DragDropProvider\n            key={ renderState.current.revision }\n            sensors={ POINTER_SENSORS }\n            onDragEnd={ handleDragEnd }\n        >\n            <SortableCollection\n                nodes={ nodes }\n                rootNodes={ nodes }\n                parentNode={ null }\n                renderItem={ children }\n                canDrop={ canDrop }\n                getDragHandleOptions={ getDragHandleOptions }\n                className={ className }\n                gap={ gap }\n                nestedGap={ nestedGap }\n                ariaLabel={ ariaLabel }\n            />\n\n            <DragOverlay\n                className={ styles.dragOverlay }\n                dropAnimation={ {\n                    duration: 160,\n                    easing: 'cubic-bezier(0.25, 1, 0.5, 1)',\n                } }\n            >\n                { (source) => {\n                    const node = nodeData<T>(source)?.node;\n\n                    return node\n                        ? (\n                            <SortablePreview\n                                node={ node }\n                                renderItem={ children }\n                                nestedGap={ nestedGap }\n                            />\n                        )\n                        : null;\n                } }\n            </DragOverlay>\n        </DragDropProvider>\n    );\n}\n\nfunction SortableCollection<T>({\n    nodes,\n    rootNodes,\n    parentNode,\n    renderItem,\n    canDrop,\n    getDragHandleOptions,\n    className,\n    gap,\n    nestedGap,\n    ariaLabel,\n}: SortableCollectionProps<T>) {\n    const { ref, isDropTarget } = useDroppable<SortableCollectionData<T>>({\n        id: collectionId(parentNode),\n        type: SORTABLE_COLLECTION_TYPE,\n        data: { kind: 'collection', parentNode },\n        disabled: nodes.length > 0,\n        collisionPriority: 1,\n        accept: source => canAcceptDrop(\n            source,\n            parentNode,\n            null,\n            'end',\n            canDrop\n        ),\n    });\n\n    return (\n        <div\n            ref={ ref }\n            role=\"list\"\n            className={ cn(styles.list, className) }\n            data-gap={ gap }\n            data-drop-target={ isDropTarget || undefined }\n            aria-label={ ariaLabel }\n        >\n            <For each={ nodes }>\n                { node => (\n                    <SortableItem\n                        key={ node.id }\n                        node={ node }\n                        rootNodes={ rootNodes }\n                        renderItem={ renderItem }\n                        canDrop={ canDrop }\n                        getDragHandleOptions={ getDragHandleOptions }\n                        nestedGap={ nestedGap }\n                    />\n                ) }\n            </For>\n        </div>\n    );\n}\n\nfunction SortableItem<T>({\n    node,\n    rootNodes,\n    renderItem,\n    canDrop,\n    getDragHandleOptions,\n    nestedGap,\n}: SortableItemProps<T>) {\n    const context = itemContext(node);\n    const {\n        alignment = 'center',\n        edgeOffset = 'none',\n        variant = 'plain',\n    } = getDragHandleOptions?.(node.value, context) ?? {};\n    const {\n        handleRef,\n        ref,\n        targetRef,\n        isDragging,\n        isDropTarget,\n    } = useSortable<SortableNodeData<T>>({\n        id: node.id,\n        index: node.index,\n        group: collectionIdFromParentKey(nodeParentKey(rootNodes, node)),\n        type: SORTABLE_ITEM_TYPE,\n        data: { kind: 'node', node },\n        accept: source => canAcceptDrop(\n            source,\n            node.parent == null\n                ? null\n                : findParentNode(rootNodes, node),\n            node,\n            'before',\n            canDrop\n        ),\n    });\n    const nestedItems = node.canHaveChildren\n        ? (\n            <SortableCollection\n                nodes={ node.children }\n                rootNodes={ rootNodes }\n                parentNode={ node }\n                renderItem={ renderItem }\n                canDrop={ canDrop }\n                getDragHandleOptions={ getDragHandleOptions }\n                gap={ nestedGap }\n                nestedGap={ nestedGap }\n                ariaLabel={ `${ node.textValue } items` }\n            />\n        )\n        : null;\n\n    return (\n        <div\n            ref={ ref }\n            role=\"listitem\"\n            className={ styles.item }\n            data-level={ node.level }\n            data-dragging={ isDragging || undefined }\n            data-drop-target={ isDropTarget || undefined }\n        >\n            <div\n                ref={ targetRef }\n                className={ styles.dropTarget }\n                data-container={ node.canHaveChildren || undefined }\n                aria-hidden\n            />\n\n            <span\n                ref={ handleRef }\n                className={ styles.dragHandle }\n                data-alignment={ alignment }\n                data-edge-offset={ edgeOffset }\n                data-variant={ variant }\n                aria-hidden\n            >\n                <DotsDrag aria-hidden width={ 14 } height={ 14 } />\n            </span>\n\n            <div className={ styles.content }>\n                { renderItem(node.value, {\n                    ...context,\n                    nestedItems,\n                    isDragging,\n                    isDropTarget,\n                }) }\n            </div>\n        </div>\n    );\n}\n\nfunction SortablePreview<T>({\n    node,\n    renderItem,\n    nestedGap,\n}: {\n    node: SortableTreeNode<T>;\n    renderItem: (item: T, props: SortableListItemRenderProps<T>) => ReactNode;\n    nestedGap: 'sm' | 'md';\n}): ReactElement {\n    const nestedItems = node.canHaveChildren\n        ? (\n            <div className={ styles.previewList } data-gap={ nestedGap }>\n                <For each={ node.children }>\n                    { child => (\n                        <SortablePreview\n                            key={ child.id }\n                            node={ child }\n                            renderItem={ renderItem }\n                            nestedGap={ nestedGap }\n                        />\n                    ) }\n                </For>\n            </div>\n        )\n        : null;\n\n    return (\n        <div className={ styles.dragPreviewItem }>\n            { renderItem(node.value, {\n                ...itemContext(node),\n                nestedItems,\n                isDragging: false,\n                isDropTarget: false,\n            }) }\n        </div>\n    );\n}\n\nfunction itemContext<T>(node: SortableTreeNode<T>): SortableListItemContext<T> {\n    return {\n        level: node.level,\n        parent: node.parent,\n        index: node.index,\n        siblingCount: node.siblingCount,\n        isFirst: node.index === 0,\n        isLast: node.index === node.siblingCount - 1,\n        hasChildren: node.children.length > 0,\n        canHaveChildren: node.canHaveChildren,\n    };\n}\n\nfunction canAcceptDrop<T>(\n    source: { data: Record<string, unknown> },\n    parentNode: SortableTreeNode<T> | null,\n    targetNode: SortableTreeNode<T> | null,\n    dropPosition: SortableListDropContext<T>['dropPosition'],\n    canDrop?: (context: SortableListDropContext<T>) => boolean\n): boolean {\n    const sourceNode = nodeData<T>(source)?.node;\n\n    if (!sourceNode || !canMoveToParent(sourceNode, parentNode)) {\n        return false;\n    }\n\n    return canDrop?.(\n        createDropContext(sourceNode, parentNode, targetNode, dropPosition)\n    ) ?? true;\n}\n\nfunction createDropContext<T>(\n    sourceNode: SortableTreeNode<T>,\n    parentNode: SortableTreeNode<T> | null,\n    targetNode: SortableTreeNode<T> | null,\n    dropPosition: SortableListDropContext<T>['dropPosition']\n): SortableListDropContext<T> {\n    return {\n        items: [sourceNode.value],\n        target: targetNode?.value ?? null,\n        sourceParent: sourceNode.parent,\n        sourceLevel: sourceNode.level,\n        parent: parentNode?.value ?? null,\n        targetLevel: parentNode ? parentNode.level + 1 : 1,\n        dropPosition,\n    };\n}\n\nfunction canMoveToParent<T>(\n    sourceNode: SortableTreeNode<T>,\n    parentNode: SortableTreeNode<T> | null\n): boolean {\n    return parentNode == null\n      || (parentNode.id !== sourceNode.id\n        && findSortableTreeNode(sourceNode.children, parentNode.id) == null);\n}\n\nfunction destinationFromSortable<T>(\n    nodes: readonly SortableTreeNode<T>[],\n    group: string | number | undefined,\n    index: number,\n    targetNode: SortableTreeNode<T> | null\n): SortableDestination<T> | null {\n    const parentKey = parentKeyFromCollectionId(group);\n\n    if (parentKey === undefined) {\n        return null;\n    }\n\n    const parentNode = parentKey == null\n        ? null\n        : findSortableTreeNode(nodes, parentKey);\n\n    if (parentKey != null && !parentNode) {\n        return null;\n    }\n\n    const isAfterTarget = targetNode != null && index > targetNode.index;\n\n    return {\n        parentNode,\n        index,\n        dropPosition: isAfterTarget ? 'after' : 'before',\n    };\n}\n\nfunction collectionId<T>(parentNode: SortableTreeNode<T> | null): string {\n    return collectionIdFromParentKey(parentNode?.id ?? null);\n}\n\nfunction collectionIdFromParentKey(parentKey: string | null): string {\n    return parentKey == null\n        ? ROOT_COLLECTION_ID\n        : `${ CHILD_COLLECTION_PREFIX }${ parentKey }`;\n}\n\nfunction parentKeyFromCollectionId(\n    collectionId: string | number | undefined\n): string | null | undefined {\n    if (collectionId === ROOT_COLLECTION_ID) {\n        return null;\n    }\n\n    if (typeof collectionId === 'string'\n      && collectionId.startsWith(CHILD_COLLECTION_PREFIX)) {\n        return collectionId.slice(CHILD_COLLECTION_PREFIX.length);\n    }\n\n    return undefined;\n}\n\nfunction nodeParentKey<T>(\n    nodes: readonly SortableTreeNode<T>[],\n    target: SortableTreeNode<T>\n): string | null {\n    return findParentNode(nodes, target)?.id ?? null;\n}\n\nfunction findParentNode<T>(\n    nodes: readonly SortableTreeNode<T>[],\n    target: SortableTreeNode<T>\n): SortableTreeNode<T> | null {\n    for (const node of nodes) {\n        if (node.children.some(child => child.id === target.id)) {\n            return node;\n        }\n\n        const parent = findParentNode(node.children, target);\n\n        if (parent) {\n            return parent;\n        }\n    }\n\n    return null;\n}\n\nfunction entityData<T>(\n    entity: { data: Record<string, unknown> } | null\n): SortableNodeData<T> | SortableCollectionData<T> | null {\n    const data = entity?.data;\n\n    if (data?.kind === 'node' && 'node' in data) {\n        return {\n            kind: 'node',\n            node: data.node as SortableTreeNode<T>,\n        };\n    }\n\n    if (data?.kind === 'collection' && 'parentNode' in data) {\n        return {\n            kind: 'collection',\n            parentNode: data.parentNode as SortableTreeNode<T> | null,\n        };\n    }\n\n    return null;\n}\n\nfunction nodeData<T>(\n    entity: { data: Record<string, unknown> } | null\n): SortableNodeData<T> | null {\n    const data = entityData<T>(entity);\n\n    return data?.kind === 'node' ? data : null;\n}\n\nSortableList.displayName = 'SortableList';\n"],"names":["ROOT_COLLECTION_ID","CHILD_COLLECTION_PREFIX","SORTABLE_ITEM_TYPE","SORTABLE_COLLECTION_TYPE","POINTER_SENSORS","PointerSensor","PRIMITIVE_KEY_PREFIX","SortableList","items","getItemKey","getTextValue","getChildren","setChildren","canHaveChildren","onChange","children","canDrop","getDragHandleOptions","className","gap","nestedGap","ariaLabel","keyState","useRef","getNodeKey","useCallback","item","path","itemKey","existingKey","key","nodes","useMemo","buildSortableTree","renderState","handleDragEnd","event","canceled","operation","source","target","isSortable","sourceNode","nodeData","targetData","entityData","targetNode","destination","destinationFromSortable","context","createDropContext","canMoveToParent","initialParentKey","parentKeyFromCollectionId","destinationParentKey","movedNodes","moveSortableTreeNodeToIndex","restoreSortableTree","DragDropProvider","_jsx","SortableCollection","DragOverlay","styles","node","SortablePreview","rootNodes","parentNode","renderItem","ref","isDropTarget","useDroppable","collectionId","canAcceptDrop","cn","For","SortableItem","itemContext","alignment","edgeOffset","variant","handleRef","targetRef","isDragging","useSortable","collectionIdFromParentKey","nodeParentKey","findParentNode","nestedItems","DotsDrag","child","dropPosition","findSortableTreeNode","group","index","parentKey","isAfterTarget","parent","entity","data"],"mappings":";;;;;;;;;AASA,MAAMA,IAAqB,yBACrBC,IAA0B,8BAC1BC,KAAqB,yBACrBC,KAA2B,+BAC3BC,KAAkB,CAACC,CAAa,GAChCC,KAAuB;AAQtB,SAASC,GAAa;AAAA,EAC3B,OAAAC;AAAA,EACA,QAAQC;AAAA,EACR,cAAAC;AAAA,EACA,aAAAC;AAAA,EACA,aAAAC;AAAA,EACA,iBAAAC;AAAA,EACA,UAAAC;AAAA,EACA,UAAAC;AAAA,EACA,SAAAC;AAAA,EACA,sBAAAC;AAAA,EACA,WAAAC;AAAA,EACA,KAAAC,IAAM;AAAA,EACN,WAAAC,IAAYD;AAAA,EACZ,cAAcE;AAChB,GAAG;AACD,QAAMC,IAAWC,EAAO;AAAA,IACtB,QAAQ;AAAA,IACR,gCAAgB,QAAA;AAAA,EAAQ,CACzB,GACKC,IAAaC,GAAY,CAACC,GAAMC,MAAS;AAC7C,UAAMC,IAAUnB,IAAaiB,GAAMC,CAAI;AACvC,QAAIC,KAAW;AACb,aAAOA;AAET,QAAI,OAAOF,KAAS,YAAYA,KAAQ;AACtC,aAAO,GAAGpB,EAAoB,GAAGqB,EAAK,KAAK,GAAG,CAAC;AAEjD,UAAME,IAAcP,EAAS,QAAQ,WAAW,IAAII,CAAI;AACxD,QAAIG;AACF,aAAOA;AAET,UAAMC,IAAM,iBAAiBR,EAAS,QAAQ,MAAM;AACpD,WAAAA,EAAS,QAAQ,UAAU,GAC3BA,EAAS,QAAQ,WAAW,IAAII,GAAMI,CAAG,GAClCA;AAAA,EACT,GAAG,CAACrB,CAAU,CAAC,GACTsB,IAAQC,GAAQ,MAAMC,GAAkBzB,GAAO;AAAA,IACnD,QAAQgB;AAAA,IACR,cAAAd;AAAA,IACA,aAAAC;AAAA,IACA,iBAAAE;AAAA,EAAA,CACD,GAAG,CAACA,GAAiBF,GAAaa,GAAYd,GAAcF,CAAK,CAAC,GAC7D0B,IAAcX,EAAO;AAAA,IACzB,OAAAf;AAAA,IACA,UAAU;AAAA,EAAA,CACX;AACD,EAAI0B,EAAY,QAAQ,UAAU1B,MAChC0B,EAAY,UAAU;AAAA,IACpB,OAAA1B;AAAA,IACA,UAAU0B,EAAY,QAAQ,WAAW;AAAA,EAAA;AAG7C,WAASC,EAAcC,GAAO;AAC5B,UAAM;AAAA,MACJ,UAAAC;AAAA,MACA,WAAAC;AAAA,IAAA,IACEF,GACE;AAAA,MACJ,QAAAG;AAAA,MACA,QAAAC;AAAA,IAAA,IACEF;AACJ,QAAID,KAAY,CAACE,KAAU,CAACE,EAAWF,CAAM;AAC3C;AAEF,UAAMG,IAAaC,EAASJ,CAAM,GAAG;AACrC,QAAI,CAACG;AACH;AAEF,UAAME,IAAaC,EAAWL,CAAM,GAC9BM,IAAaF,GAAY,SAAS,SAASA,EAAW,OAAO;AACnE,QAAIG;AAYJ,QAXIH,GAAY,SAAS,eACvBG,IAAc;AAAA,MACZ,YAAYH,EAAW;AAAA,MACvB,OAAOA,EAAW,YAAY,SAAS,UAAUb,EAAM;AAAA,MACvD,cAAc;AAAA,IAAA,IAEPe,KAAcN,KAAUC,EAAWD,CAAM,IAClDO,IAAcC,GAAwBjB,GAAOS,EAAO,OAAOD,EAAO,OAAOO,CAAU,IAEnFC,IAAc,MAEZ,CAACA;AACH;AAEF,UAAME,IAAUC,EAAkBR,GAAYK,EAAY,YAAYD,GAAYC,EAAY,YAAY;AAC1G,QAAI,CAACI,EAAgBT,GAAYK,EAAY,UAAU,KAAK/B,KAAW,CAACA,EAAQiC,CAAO;AACrF;AAEF,UAAMG,IAAmBC,EAA0Bd,EAAO,YAAY,GAChEe,IAAuBP,EAAY,YAAY,MAAM;AAE3D,QADuBK,MAAqB,UAAaA,MAAqBE,KAAwBf,EAAO,iBAAiBQ,EAAY;AAExI;AAEF,UAAMQ,IAAaC,GAA4BzB,GAAOW,EAAW,IAAIY,GAAsBP,EAAY,KAAK;AAC5G,IAAAjC,EAAS2C,GAAoBF,GAAY3C,CAAW,CAAC;AAAA,EACvD;AACA,2BAA0B8C,GAAkB;AAAA,IAC1C,SAAStD;AAAA,IACT,WAAW+B;AAAA,IACX,UAAU,CAAcwB,gBAAAA,EAAKC,GAAoB;AAAA,MAC/C,OAAA7B;AAAA,MACA,WAAWA;AAAA,MACX,YAAY;AAAA,MACZ,YAAYhB;AAAA,MACZ,SAAAC;AAAA,MACA,sBAAAC;AAAA,MACA,WAAAC;AAAA,MACA,KAAAC;AAAA,MACA,WAAAC;AAAA,MACA,WAAAC;AAAA,IAAA,CACD,GAAgBsC,gBAAAA,EAAKE,IAAa;AAAA,MACjC,WAAWC,EAAO;AAAA,MAClB,eAAe;AAAA,QACb,UAAU;AAAA,QACV,QAAQ;AAAA,MAAA;AAAA,MAEV,UAAU,CAAAvB,MAAU;AAClB,cAAMwB,IAAOpB,EAASJ,CAAM,GAAG;AAC/B,eAAOwB,sBAAyBC,GAAiB;AAAA,UAC/C,MAAAD;AAAA,UACA,YAAYhD;AAAA,UACZ,WAAAK;AAAA,QAAA,CACD,IAAI;AAAA,MACP;AAAA,IAAA,CACD,CAAC;AAAA,EAAA,GACDc,EAAY,QAAQ,QAAQ;AACjC;AACA,SAAS0B,EAAmB;AAAA,EAC1B,OAAA7B;AAAA,EACA,WAAAkC;AAAA,EACA,YAAAC;AAAA,EACA,YAAAC;AAAA,EACA,SAAAnD;AAAA,EACA,sBAAAC;AAAA,EACA,WAAAC;AAAA,EACA,KAAAC;AAAA,EACA,WAAAC;AAAA,EACA,WAAAC;AACF,GAAG;AACD,QAAM;AAAA,IACJ,KAAA+C;AAAA,IACA,cAAAC;AAAA,EAAA,IACEC,GAAa;AAAA,IACf,IAAIC,GAAaL,CAAU;AAAA,IAC3B,MAAM/D;AAAA,IACN,MAAM;AAAA,MACJ,MAAM;AAAA,MACN,YAAA+D;AAAA,IAAA;AAAA,IAEF,UAAUnC,EAAM,SAAS;AAAA,IACzB,mBAAmB;AAAA,IACnB,QAAQ,CAAAQ,MAAUiC,EAAcjC,GAAQ2B,GAAY,MAAM,OAAOlD,CAAO;AAAA,EAAA,CACzE;AACD,2BAAyB,OAAO;AAAA,IAC9B,KAAAoD;AAAA,IACA,MAAM;AAAA,IACN,WAAWK,GAAGX,EAAO,MAAM5C,CAAS;AAAA,IACpC,YAAYC;AAAA,IACZ,oBAAoBkD,KAAgB;AAAA,IACpC,cAAchD;AAAA,IACd,4BAA4BqD,GAAK;AAAA,MAC/B,MAAM3C;AAAA,MACN,UAAU,CAAAgC,MAAqBJ,gBAAAA,EAAKgB,IAAc;AAAA,QAChD,MAAAZ;AAAA,QACA,WAAAE;AAAA,QACA,YAAAE;AAAA,QACA,SAAAnD;AAAA,QACA,sBAAAC;AAAA,QACA,WAAAG;AAAA,MAAA,GACC2C,EAAK,EAAE;AAAA,IAAA,CACX;AAAA,EAAA,CACF;AACH;AACA,SAASY,GAAa;AAAA,EACpB,MAAAZ;AAAA,EACA,WAAAE;AAAA,EACA,YAAAE;AAAA,EACA,SAAAnD;AAAA,EACA,sBAAAC;AAAA,EACA,WAAAG;AACF,GAAG;AACD,QAAM6B,IAAU2B,EAAYb,CAAI,GAC1B;AAAA,IACJ,WAAAc,IAAY;AAAA,IACZ,YAAAC,IAAa;AAAA,IACb,SAAAC,IAAU;AAAA,EAAA,IACR9D,IAAuB8C,EAAK,OAAOd,CAAO,KAAK,CAAA,GAC7C;AAAA,IACJ,WAAA+B;AAAA,IACA,KAAAZ;AAAA,IACA,WAAAa;AAAA,IACA,YAAAC;AAAA,IACA,cAAAb;AAAA,EAAA,IACEc,GAAY;AAAA,IACd,IAAIpB,EAAK;AAAA,IACT,OAAOA,EAAK;AAAA,IACZ,OAAOqB,EAA0BC,GAAcpB,GAAWF,CAAI,CAAC;AAAA,IAC/D,MAAM7D;AAAA,IACN,MAAM;AAAA,MACJ,MAAM;AAAA,MACN,MAAA6D;AAAA,IAAA;AAAA,IAEF,QAAQ,CAAAxB,MAAUiC,EAAcjC,GAAQwB,EAAK,UAAU,OAAO,OAAOuB,EAAerB,GAAWF,CAAI,GAAGA,GAAM,UAAU/C,CAAO;AAAA,EAAA,CAC9H,GACKuE,IAAcxB,EAAK,kBAA+BJ,gBAAAA,EAAKC,GAAoB;AAAA,IAC/E,OAAOG,EAAK;AAAA,IACZ,WAAAE;AAAA,IACA,YAAYF;AAAA,IACZ,YAAAI;AAAA,IACA,SAAAnD;AAAA,IACA,sBAAAC;AAAA,IACA,KAAKG;AAAA,IACL,WAAAA;AAAA,IACA,WAAW,GAAG2C,EAAK,SAAS;AAAA,EAAA,CAC7B,IAAI;AACL,2BAA0B,OAAO;AAAA,IAC/B,KAAAK;AAAA,IACA,MAAM;AAAA,IACN,WAAWN,EAAO;AAAA,IAClB,cAAcC,EAAK;AAAA,IACnB,iBAAiBmB,KAAc;AAAA,IAC/B,oBAAoBb,KAAgB;AAAA,IACpC,UAAU,CAAcV,gBAAAA,EAAK,OAAO;AAAA,MAClC,KAAKsB;AAAA,MACL,WAAWnB,EAAO;AAAA,MAClB,kBAAkBC,EAAK,mBAAmB;AAAA,MAC1C,eAAe;AAAA,IAAA,CAChB,GAAgBJ,gBAAAA,EAAK,QAAQ;AAAA,MAC5B,KAAKqB;AAAA,MACL,WAAWlB,EAAO;AAAA,MAClB,kBAAkBe;AAAA,MAClB,oBAAoBC;AAAA,MACpB,gBAAgBC;AAAA,MAChB,eAAe;AAAA,MACf,4BAA4BS,IAAU;AAAA,QACpC,eAAe;AAAA,QACf,OAAO;AAAA,QACP,QAAQ;AAAA,MAAA,CACT;AAAA,IAAA,CACF,GAAgB7B,gBAAAA,EAAK,OAAO;AAAA,MAC3B,WAAWG,EAAO;AAAA,MAClB,UAAUK,EAAWJ,EAAK,OAAO;AAAA,QAC/B,GAAGd;AAAA,QACH,aAAAsC;AAAA,QACA,YAAAL;AAAA,QACA,cAAAb;AAAA,MAAA,CACD;AAAA,IAAA,CACF,CAAC;AAAA,EAAA,CACH;AACH;AACA,SAASL,EAAgB;AAAA,EACvB,MAAAD;AAAA,EACA,YAAAI;AAAA,EACA,WAAA/C;AACF,GAAG;AACD,QAAMmE,IAAcxB,EAAK,kBAA+BJ,gBAAAA,EAAK,OAAO;AAAA,IAClE,WAAWG,EAAO;AAAA,IAClB,YAAY1C;AAAA,IACZ,4BAA4BsD,GAAK;AAAA,MAC/B,MAAMX,EAAK;AAAA,MACX,UAAU,CAAA0B,MAAsB9B,gBAAAA,EAAKK,GAAiB;AAAA,QACpD,MAAMyB;AAAA,QACN,YAAAtB;AAAA,QACA,WAAA/C;AAAA,MAAA,GACCqE,EAAM,EAAE;AAAA,IAAA,CACZ;AAAA,EAAA,CACF,IAAI;AACL,2BAAyB,OAAO;AAAA,IAC9B,WAAW3B,EAAO;AAAA,IAClB,UAAUK,EAAWJ,EAAK,OAAO;AAAA,MAC/B,GAAGa,EAAYb,CAAI;AAAA,MACnB,aAAAwB;AAAA,MACA,YAAY;AAAA,MACZ,cAAc;AAAA,IAAA,CACf;AAAA,EAAA,CACF;AACH;AACA,SAASX,EAAYb,GAAM;AACzB,SAAO;AAAA,IACL,OAAOA,EAAK;AAAA,IACZ,QAAQA,EAAK;AAAA,IACb,OAAOA,EAAK;AAAA,IACZ,cAAcA,EAAK;AAAA,IACnB,SAASA,EAAK,UAAU;AAAA,IACxB,QAAQA,EAAK,UAAUA,EAAK,eAAe;AAAA,IAC3C,aAAaA,EAAK,SAAS,SAAS;AAAA,IACpC,iBAAiBA,EAAK;AAAA,EAAA;AAE1B;AACA,SAASS,EAAcjC,GAAQ2B,GAAYpB,GAAY4C,GAAc1E,GAAS;AAC5E,QAAM0B,IAAaC,EAASJ,CAAM,GAAG;AACrC,SAAI,CAACG,KAAc,CAACS,EAAgBT,GAAYwB,CAAU,IACjD,KAEFlD,IAAUkC,EAAkBR,GAAYwB,GAAYpB,GAAY4C,CAAY,CAAC,KAAK;AAC3F;AACA,SAASxC,EAAkBR,GAAYwB,GAAYpB,GAAY4C,GAAc;AAC3E,SAAO;AAAA,IACL,OAAO,CAAChD,EAAW,KAAK;AAAA,IACxB,QAAQI,GAAY,SAAS;AAAA,IAC7B,cAAcJ,EAAW;AAAA,IACzB,aAAaA,EAAW;AAAA,IACxB,QAAQwB,GAAY,SAAS;AAAA,IAC7B,aAAaA,IAAaA,EAAW,QAAQ,IAAI;AAAA,IACjD,cAAAwB;AAAA,EAAA;AAEJ;AACA,SAASvC,EAAgBT,GAAYwB,GAAY;AAC/C,SAAOA,KAAc,QAAQA,EAAW,OAAOxB,EAAW,MAAMiD,EAAqBjD,EAAW,UAAUwB,EAAW,EAAE,KAAK;AAC9H;AACA,SAASlB,GAAwBjB,GAAO6D,GAAOC,GAAO/C,GAAY;AAChE,QAAMgD,IAAYzC,EAA0BuC,CAAK;AACjD,MAAIE,MAAc;AAChB,WAAO;AAET,QAAM5B,IAAa4B,KAAa,OAAO,OAAOH,EAAqB5D,GAAO+D,CAAS;AACnF,MAAIA,KAAa,QAAQ,CAAC5B;AACxB,WAAO;AAET,QAAM6B,IAAgBjD,KAAc,QAAQ+C,IAAQ/C,EAAW;AAC/D,SAAO;AAAA,IACL,YAAAoB;AAAA,IACA,OAAA2B;AAAA,IACA,cAAcE,IAAgB,UAAU;AAAA,EAAA;AAE5C;AACA,SAASxB,GAAaL,GAAY;AAChC,SAAOkB,EAA0BlB,GAAY,MAAM,IAAI;AACzD;AACA,SAASkB,EAA0BU,GAAW;AAC5C,SAAOA,KAAa,OAAO9F,IAAqB,GAAGC,CAAuB,GAAG6F,CAAS;AACxF;AACA,SAASzC,EAA0BkB,GAAc;AAC/C,MAAIA,MAAiBvE;AACnB,WAAO;AAET,MAAI,OAAOuE,KAAiB,YAAYA,EAAa,WAAWtE,CAAuB;AACrF,WAAOsE,EAAa,MAAMtE,EAAwB,MAAM;AAG5D;AACA,SAASoF,GAActD,GAAOS,GAAQ;AACpC,SAAO8C,EAAevD,GAAOS,CAAM,GAAG,MAAM;AAC9C;AACA,SAAS8C,EAAevD,GAAOS,GAAQ;AACrC,aAAWuB,KAAQhC,GAAO;AACxB,QAAIgC,EAAK,SAAS,KAAK,CAAA0B,MAASA,EAAM,OAAOjD,EAAO,EAAE;AACpD,aAAOuB;AAET,UAAMiC,IAASV,EAAevB,EAAK,UAAUvB,CAAM;AACnD,QAAIwD;AACF,aAAOA;AAAA,EAEX;AACA,SAAO;AACT;AACA,SAASnD,EAAWoD,GAAQ;AAC1B,QAAMC,IAAOD,GAAQ;AACrB,SAAIC,GAAM,SAAS,UAAU,UAAUA,IAC9B;AAAA,IACL,MAAM;AAAA,IACN,MAAMA,EAAK;AAAA,EAAA,IAGXA,GAAM,SAAS,gBAAgB,gBAAgBA,IAC1C;AAAA,IACL,MAAM;AAAA,IACN,YAAYA,EAAK;AAAA,EAAA,IAGd;AACT;AACA,SAASvD,EAASsD,GAAQ;AACxB,QAAMC,IAAOrD,EAAWoD,CAAM;AAC9B,SAAOC,GAAM,SAAS,SAASA,IAAO;AACxC;AACA3F,GAAa,cAAc;"}

package/dist/SortableList/SortableList.module.css

@@ -0,0 +1 @@
+@layer components{.SortableList_list_fwQgly,.SortableList_previewList_DykH9d{--reforma-sortable-list-gap: var(--spacing-md);display:flex;flex-direction:column;gap:var(--reforma-sortable-list-gap);width:100%;overflow:visible}.SortableList_list_fwQgly[data-gap=sm],.SortableList_previewList_DykH9d[data-gap=sm]{--reforma-sortable-list-gap: var(--spacing-sm)}.SortableList_item_c8Ma5L{position:relative;width:100%;overflow:visible}.SortableList_content_jHcacs{transition:opacity var(--transition-duration-fast);width:100%;min-width:0}.SortableList_dropTarget_qIV3F6{position:absolute;z-index:1;inset:0;pointer-events:none}.SortableList_dropTarget_qIV3F6[data-container]{bottom:auto;height:var(--spacing-40)}.SortableList_dragHandle_uckQ8s{display:grid;position:absolute;top:50%;left:calc(var(--spacing-xs) * -1);place-items:center;transform:translate(-100%,-50%);opacity:0;z-index:2;transition:color var(--transition-duration-fast),opacity var(--transition-duration-fast);cursor:grab;outline:none;border:0;border-radius:0;background:transparent;padding:0;width:var(--spacing-14);height:var(--spacing-14);touch-action:none;pointer-events:auto;color:var(--color-secondary-muted-text)}.SortableList_dragHandle_uckQ8s[data-variant=surface]{left:0;transform:translate(-50%,-50%);box-shadow:0 0 0 var(--spacing-xxs) var(--color-surface);background:var(--color-surface)}.SortableList_dragHandle_uckQ8s[data-variant=surface][data-edge-offset=sm]{left:calc(var(--spacing-sm) * -1)}.SortableList_dragHandle_uckQ8s[data-variant=surface][data-edge-offset=md]{left:calc(var(--spacing-md) * -1)}.SortableList_dragHandle_uckQ8s[data-alignment=top]{top:var(--spacing-20)}.SortableList_item_c8Ma5L:hover:not(:has(.SortableList_item_c8Ma5L:hover))>.SortableList_dragHandle_uckQ8s,.SortableList_item_c8Ma5L[data-dragging]>.SortableList_dragHandle_uckQ8s{opacity:1}.SortableList_dragHandle_uckQ8s:hover{color:var(--color-text)}.SortableList_dragHandle_uckQ8s:active{cursor:grabbing}.SortableList_item_c8Ma5L[data-dragging]>.SortableList_content_jHcacs{opacity:var(--opacity-inactive)}.SortableList_list_fwQgly[data-drop-target]:empty{min-height:var(--spacing-20)}.SortableList_dragOverlay_xyGlYl{position:fixed;top:0;left:0;pointer-events:none;-webkit-user-select:none;-moz-user-select:none;user-select:none}.SortableList_dragOverlay_xyGlYl:empty{display:none}.SortableList_dragPreviewItem_jH6Ipx{border-radius:calc(var(--radius-md) * var(--squircle-radius-factor));width:100%;overflow:hidden;corner-shape:superellipse(var(--squircle-value));box-shadow:var(--shadow-sm);background:var(--color-surface)}}

package/dist/SortableList/SortableList.module.css.js

@@ -0,0 +1,22 @@
+const t = "SortableList_list_fwQgly", e = "SortableList_previewList_DykH9d", r = "SortableList_item_c8Ma5L", a = "SortableList_content_jHcacs", s = "SortableList_dropTarget_qIV3F6", o = "SortableList_dragHandle_uckQ8s", i = "SortableList_dragOverlay_xyGlYl", l = "SortableList_dragPreviewItem_jH6Ipx", n = {
+  list: t,
+  previewList: e,
+  item: r,
+  content: a,
+  dropTarget: s,
+  dragHandle: o,
+  dragOverlay: i,
+  dragPreviewItem: l
+};
+export {
+  a as content,
+  n as default,
+  o as dragHandle,
+  i as dragOverlay,
+  l as dragPreviewItem,
+  s as dropTarget,
+  r as item,
+  t as list,
+  e as previewList
+};
+//# sourceMappingURL=SortableList.module.css.js.map

package/dist/SortableList/SortableList.module.css.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"SortableList.module.css.js","sources":[],"sourcesContent":[],"names":[],"mappings":";;;;;;;;;;"}

package/dist/SortableList/index.d.ts

@@ -0,0 +1,2 @@
+export * from './SortableList';
+//# sourceMappingURL=index.d.ts.map

package/dist/SortableList/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/SortableList/index.ts"],"names":[],"mappings":"AAAA,cAAc,gBAAgB,CAAC"}

package/dist/SortableList/index.js

@@ -0,0 +1,5 @@
+import { SortableList as t } from "./SortableList.js";
+export {
+  t as SortableList
+};
+//# sourceMappingURL=index.js.map

package/dist/SortableList/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/SortableList/sortableTree.d.ts

@@ -0,0 +1,30 @@
+import type { Key } from 'react-aria-components';
+export interface SortableTreeNode<T> {
+    id: string;
+    value: T;
+    textValue: string;
+    canHaveChildren: boolean;
+    children: SortableTreeNode<T>[];
+    parent: T | null;
+    index: number;
+    siblingCount: number;
+    level: number;
+}
+export interface SortableTreeTarget {
+    key: Key;
+    dropPosition: 'on' | 'before' | 'after';
+}
+interface BuildSortableTreeOptions<T> {
+    getTextValue: (item: T) => string;
+    getKey?: (item: T, path: readonly number[]) => string;
+    getChildren?: (item: T) => readonly T[];
+    canHaveChildren?: (item: T) => boolean;
+}
+export declare function buildSortableTree<T>(items: readonly T[], options: BuildSortableTreeOptions<T>, parent?: T | null, path?: readonly number[]): SortableTreeNode<T>[];
+export declare function restoreSortableTree<T>(nodes: readonly SortableTreeNode<T>[], setChildren?: (item: T, children: T[]) => T): T[];
+export declare function findSortableTreeNode<T>(nodes: readonly SortableTreeNode<T>[], key: Key): SortableTreeNode<T> | null;
+export declare function moveSortableTreeNodes<T>(nodes: readonly SortableTreeNode<T>[], keys: ReadonlySet<Key>, target: SortableTreeTarget): SortableTreeNode<T>[];
+export declare function moveSortableTreeNodesToCollection<T>(nodes: readonly SortableTreeNode<T>[], keys: ReadonlySet<Key>, parentKey: Key | null): SortableTreeNode<T>[];
+export declare function moveSortableTreeNodeToIndex<T>(nodes: readonly SortableTreeNode<T>[], key: Key, parentKey: Key | null, index: number): SortableTreeNode<T>[];
+export {};
+//# sourceMappingURL=sortableTree.d.ts.map

package/dist/SortableList/sortableTree.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sortableTree.d.ts","sourceRoot":"","sources":["../../src/SortableList/sortableTree.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,GAAG,EAAE,MAAM,uBAAuB,CAAC;AAEjD,MAAM,WAAW,gBAAgB,CAAC,CAAC;IAC/B,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,CAAC,CAAC;IACT,SAAS,EAAE,MAAM,CAAC;IAClB,eAAe,EAAE,OAAO,CAAC;IACzB,QAAQ,EAAE,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAAC;IAChC,MAAM,EAAE,CAAC,GAAG,IAAI,CAAC;IACjB,KAAK,EAAE,MAAM,CAAC;IACd,YAAY,EAAE,MAAM,CAAC;IACrB,KAAK,EAAE,MAAM,CAAC;CACjB;AAED,MAAM,WAAW,kBAAkB;IAC/B,GAAG,EAAE,GAAG,CAAC;IACT,YAAY,EAAE,IAAI,GAAG,QAAQ,GAAG,OAAO,CAAC;CAC3C;AAED,UAAU,wBAAwB,CAAC,CAAC;IAChC,YAAY,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,MAAM,CAAC;IAClC,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,SAAS,MAAM,EAAE,KAAK,MAAM,CAAC;IACtD,WAAW,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,SAAS,CAAC,EAAE,CAAC;IACxC,eAAe,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,OAAO,CAAC;CAC1C;AAED,wBAAgB,iBAAiB,CAAC,CAAC,EAC/B,KAAK,EAAE,SAAS,CAAC,EAAE,EACnB,OAAO,EAAE,wBAAwB,CAAC,CAAC,CAAC,EACpC,MAAM,GAAE,CAAC,GAAG,IAAW,EACvB,IAAI,GAAE,SAAS,MAAM,EAAO,GAC7B,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAiBvB;AAED,wBAAgB,mBAAmB,CAAC,CAAC,EACjC,KAAK,EAAE,SAAS,gBAAgB,CAAC,CAAC,CAAC,EAAE,EACrC,WAAW,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,KAAK,CAAC,GAC5C,CAAC,EAAE,CAQL;AAED,wBAAgB,oBAAoB,CAAC,CAAC,EAClC,KAAK,EAAE,SAAS,gBAAgB,CAAC,CAAC,CAAC,EAAE,EACrC,GAAG,EAAE,GAAG,GACT,gBAAgB,CAAC,CAAC,CAAC,GAAG,IAAI,CAc5B;AAED,wBAAgB,qBAAqB,CAAC,CAAC,EACnC,KAAK,EAAE,SAAS,gBAAgB,CAAC,CAAC,CAAC,EAAE,EACrC,IAAI,EAAE,WAAW,CAAC,GAAG,CAAC,EACtB,MAAM,EAAE,kBAAkB,GAC3B,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAkBvB;AAED,wBAAgB,iCAAiC,CAAC,CAAC,EAC/C,KAAK,EAAE,SAAS,gBAAgB,CAAC,CAAC,CAAC,EAAE,EACrC,IAAI,EAAE,WAAW,CAAC,GAAG,CAAC,EACtB,SAAS,EAAE,GAAG,GAAG,IAAI,GACtB,gBAAgB,CAAC,CAAC,CAAC,EAAE,CA+BvB;AAED,wBAAgB,2BAA2B,CAAC,CAAC,EACzC,KAAK,EAAE,SAAS,gBAAgB,CAAC,CAAC,CAAC,EAAE,EACrC,GAAG,EAAE,GAAG,EACR,SAAS,EAAE,GAAG,GAAG,IAAI,EACrB,KAAK,EAAE,MAAM,GACd,gBAAgB,CAAC,CAAC,CAAC,EAAE,CA+CvB"}

package/dist/SortableList/sortableTree.js

@@ -0,0 +1,102 @@
+function b(t, e, n = null, l = []) {
+  return t.map((r, u) => {
+    const i = e.getChildren?.(r) ?? [], c = [...l, u];
+    return {
+      id: e.getKey?.(r, c) ?? `sortable:${c.join(".")}`,
+      value: r,
+      textValue: e.getTextValue(r),
+      canHaveChildren: e.canHaveChildren?.(r) ?? i.length > 0,
+      children: b(i, e, r, c),
+      parent: n,
+      index: u,
+      siblingCount: t.length,
+      level: c.length
+    };
+  });
+}
+function v(t, e) {
+  return t.map((n) => !e || !n.canHaveChildren ? n.value : e(n.value, v(n.children, e)));
+}
+function s(t, e) {
+  for (const n of t) {
+    if (n.id === e)
+      return n;
+    const l = s(n.children, e);
+    if (l)
+      return l;
+  }
+  return null;
+}
+function S(t, e, n, l) {
+  const r = s(t, e), u = r != null && n != null && s(r.children, n) != null;
+  if (!r || n === e || u)
+    return [...t];
+  const i = [], c = d(t, /* @__PURE__ */ new Set([e]), i), f = i[0];
+  if (!f)
+    return [...t];
+  if (n == null) {
+    const o = [...c], a = Math.max(0, Math.min(l, o.length));
+    return o.splice(a, 0, {
+      ...f,
+      parent: null
+    }), h(o);
+  }
+  return s(c, n)?.canHaveChildren ? g(c, n, (o) => {
+    const a = [...o.children], x = Math.max(0, Math.min(l, a.length));
+    return a.splice(x, 0, {
+      ...f,
+      parent: o.value
+    }), {
+      ...o,
+      children: h(a)
+    };
+  }) ?? [...t] : [...t];
+}
+function d(t, e, n) {
+  const l = [];
+  for (const r of t) {
+    if (e.has(r.id)) {
+      n.push(r);
+      continue;
+    }
+    l.push({
+      ...r,
+      children: d(r.children, e, n)
+    });
+  }
+  return h(l);
+}
+function g(t, e, n) {
+  for (let l = 0; l < t.length; l += 1) {
+    const r = t[l];
+    if (!r)
+      continue;
+    if (r.id === e) {
+      const i = [...t];
+      return i[l] = n(r), h(i);
+    }
+    const u = g(r.children, e, n);
+    if (u) {
+      const i = [...t];
+      return i[l] = {
+        ...r,
+        children: u
+      }, h(i);
+    }
+  }
+  return null;
+}
+function h(t) {
+  return t.map((e, n) => ({
+    ...e,
+    index: n,
+    siblingCount: t.length
+  }));
+}
+export {
+  b as buildSortableTree,
+  s as findSortableTreeNode,
+  S as moveSortableTreeNodeToIndex,
+  v as restoreSortableTree
+};
+//# sourceMappingURL=sortableTree.js.map

package/dist/SortableList/sortableTree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sortableTree.js","sources":["../../src/SortableList/sortableTree.ts"],"sourcesContent":["import type { Key } from 'react-aria-components';\n\nexport interface SortableTreeNode<T> {\n    id: string;\n    value: T;\n    textValue: string;\n    canHaveChildren: boolean;\n    children: SortableTreeNode<T>[];\n    parent: T | null;\n    index: number;\n    siblingCount: number;\n    level: number;\n}\n\nexport interface SortableTreeTarget {\n    key: Key;\n    dropPosition: 'on' | 'before' | 'after';\n}\n\ninterface BuildSortableTreeOptions<T> {\n    getTextValue: (item: T) => string;\n    getKey?: (item: T, path: readonly number[]) => string;\n    getChildren?: (item: T) => readonly T[];\n    canHaveChildren?: (item: T) => boolean;\n}\n\nexport function buildSortableTree<T>(\n    items: readonly T[],\n    options: BuildSortableTreeOptions<T>,\n    parent: T | null = null,\n    path: readonly number[] = []\n): SortableTreeNode<T>[] {\n    return items.map((item, index) => {\n        const childItems = options.getChildren?.(item) ?? [];\n        const itemPath = [...path, index];\n\n        return {\n            id: options.getKey?.(item, itemPath) ?? `sortable:${ itemPath.join('.') }`,\n            value: item,\n            textValue: options.getTextValue(item),\n            canHaveChildren: options.canHaveChildren?.(item) ?? childItems.length > 0,\n            children: buildSortableTree(childItems, options, item, itemPath),\n            parent,\n            index,\n            siblingCount: items.length,\n            level: itemPath.length,\n        };\n    });\n}\n\nexport function restoreSortableTree<T>(\n    nodes: readonly SortableTreeNode<T>[],\n    setChildren?: (item: T, children: T[]) => T\n): T[] {\n    return nodes.map((node) => {\n        if (!setChildren || !node.canHaveChildren) {\n            return node.value;\n        }\n\n        return setChildren(node.value, restoreSortableTree(node.children, setChildren));\n    });\n}\n\nexport function findSortableTreeNode<T>(\n    nodes: readonly SortableTreeNode<T>[],\n    key: Key\n): SortableTreeNode<T> | null {\n    for (const node of nodes) {\n        if (node.id === key) {\n            return node;\n        }\n\n        const child = findSortableTreeNode(node.children, key);\n\n        if (child) {\n            return child;\n        }\n    }\n\n    return null;\n}\n\nexport function moveSortableTreeNodes<T>(\n    nodes: readonly SortableTreeNode<T>[],\n    keys: ReadonlySet<Key>,\n    target: SortableTreeTarget\n): SortableTreeNode<T>[] {\n    const movableKeys = removeDescendantKeys(nodes, keys);\n    const extracted: SortableTreeNode<T>[] = [];\n    const remaining = extractSortableTreeNodes(nodes, movableKeys, extracted);\n\n    if (extracted.length === 0) {\n        return [...nodes];\n    }\n\n    const targetNode = findSortableTreeNode(remaining, target.key);\n\n    if (!targetNode || (target.dropPosition === 'on' && !targetNode.canHaveChildren)) {\n        return [...nodes];\n    }\n\n    const inserted = insertSortableTreeNodes(remaining, target, extracted);\n\n    return inserted ?? [...nodes];\n}\n\nexport function moveSortableTreeNodesToCollection<T>(\n    nodes: readonly SortableTreeNode<T>[],\n    keys: ReadonlySet<Key>,\n    parentKey: Key | null\n): SortableTreeNode<T>[] {\n    const movableKeys = removeDescendantKeys(nodes, keys);\n    const extracted: SortableTreeNode<T>[] = [];\n    const remaining = extractSortableTreeNodes(nodes, movableKeys, extracted);\n\n    if (extracted.length === 0) {\n        return [...nodes];\n    }\n\n    if (parentKey == null) {\n        return refreshSortableTreeMetadata([\n            ...remaining,\n            ...extracted.map(node => ({ ...node, parent: null })),\n        ]);\n    }\n\n    const parent = findSortableTreeNode(remaining, parentKey);\n\n    if (!parent?.canHaveChildren) {\n        return [...nodes];\n    }\n\n    const inserted = mapSortableTreeNode(remaining, parentKey, node => ({\n        ...node,\n        children: refreshSortableTreeMetadata([\n            ...node.children,\n            ...extracted.map(item => ({ ...item, parent: node.value })),\n        ]),\n    }));\n\n    return inserted ?? [...nodes];\n}\n\nexport function moveSortableTreeNodeToIndex<T>(\n    nodes: readonly SortableTreeNode<T>[],\n    key: Key,\n    parentKey: Key | null,\n    index: number\n): SortableTreeNode<T>[] {\n    const source = findSortableTreeNode(nodes, key);\n\n    const movesIntoDescendant = source != null\n      && parentKey != null\n      && findSortableTreeNode(source.children, parentKey) != null;\n\n    if (!source || parentKey === key || movesIntoDescendant) {\n        return [...nodes];\n    }\n\n    const extracted: SortableTreeNode<T>[] = [];\n    const remaining = extractSortableTreeNodes(nodes, new Set([key]), extracted);\n    const item = extracted[0];\n\n    if (!item) {\n        return [...nodes];\n    }\n\n    if (parentKey == null) {\n        const nextNodes = [...remaining];\n        const insertionIndex = Math.max(0, Math.min(index, nextNodes.length));\n\n        nextNodes.splice(insertionIndex, 0, { ...item, parent: null });\n\n        return refreshSortableTreeMetadata(nextNodes);\n    }\n\n    const parent = findSortableTreeNode(remaining, parentKey);\n\n    if (!parent?.canHaveChildren) {\n        return [...nodes];\n    }\n\n    const inserted = mapSortableTreeNode(remaining, parentKey, (node) => {\n        const nextChildren = [...node.children];\n        const insertionIndex = Math.max(0, Math.min(index, nextChildren.length));\n\n        nextChildren.splice(insertionIndex, 0, { ...item, parent: node.value });\n\n        return {\n            ...node,\n            children: refreshSortableTreeMetadata(nextChildren),\n        };\n    });\n\n    return inserted ?? [...nodes];\n}\n\nfunction removeDescendantKeys<T>(\n    nodes: readonly SortableTreeNode<T>[],\n    keys: ReadonlySet<Key>,\n    ancestorSelected = false,\n    result = new Set<Key>()\n): Set<Key> {\n    for (const node of nodes) {\n        const selected = keys.has(node.id);\n\n        if (selected && !ancestorSelected) {\n            result.add(node.id);\n        }\n\n        removeDescendantKeys(node.children, keys, ancestorSelected || selected, result);\n    }\n\n    return result;\n}\n\nfunction extractSortableTreeNodes<T>(\n    nodes: readonly SortableTreeNode<T>[],\n    keys: ReadonlySet<Key>,\n    extracted: SortableTreeNode<T>[]\n): SortableTreeNode<T>[] {\n    const remaining: SortableTreeNode<T>[] = [];\n\n    for (const node of nodes) {\n        if (keys.has(node.id)) {\n            extracted.push(node);\n\n            continue;\n        }\n\n        remaining.push({\n            ...node,\n            children: extractSortableTreeNodes(node.children, keys, extracted),\n        });\n    }\n\n    return refreshSortableTreeMetadata(remaining);\n}\n\nfunction insertSortableTreeNodes<T>(\n    nodes: readonly SortableTreeNode<T>[],\n    target: SortableTreeTarget,\n    inserted: readonly SortableTreeNode<T>[]\n): SortableTreeNode<T>[] | null {\n    if (target.dropPosition === 'on') {\n        return mapSortableTreeNode(nodes, target.key, node => ({\n            ...node,\n            children: refreshSortableTreeMetadata([\n                ...node.children,\n                ...inserted.map(item => ({ ...item, parent: node.value })),\n            ]),\n        }));\n    }\n\n    for (let index = 0; index < nodes.length; index += 1) {\n        const node = nodes[index];\n\n        if (!node) {\n            continue;\n        }\n\n        if (node.id === target.key) {\n            const insertionIndex = target.dropPosition === 'before' ? index : index + 1;\n            const nextNodes = [...nodes];\n            const parent = node.parent;\n\n            nextNodes.splice(\n                insertionIndex,\n                0,\n                ...inserted.map(item => ({ ...item, parent }))\n            );\n\n            return refreshSortableTreeMetadata(nextNodes);\n        }\n\n        const nextChildren = insertSortableTreeNodes(node.children, target, inserted);\n\n        if (nextChildren) {\n            const nextNodes = [...nodes];\n\n            nextNodes[index] = { ...node, children: nextChildren };\n\n            return refreshSortableTreeMetadata(nextNodes);\n        }\n    }\n\n    return null;\n}\n\nfunction mapSortableTreeNode<T>(\n    nodes: readonly SortableTreeNode<T>[],\n    key: Key,\n    update: (node: SortableTreeNode<T>) => SortableTreeNode<T>\n): SortableTreeNode<T>[] | null {\n    for (let index = 0; index < nodes.length; index += 1) {\n        const node = nodes[index];\n\n        if (!node) {\n            continue;\n        }\n\n        if (node.id === key) {\n            const nextNodes = [...nodes];\n\n            nextNodes[index] = update(node);\n\n            return refreshSortableTreeMetadata(nextNodes);\n        }\n\n        const nextChildren = mapSortableTreeNode(node.children, key, update);\n\n        if (nextChildren) {\n            const nextNodes = [...nodes];\n\n            nextNodes[index] = { ...node, children: nextChildren };\n\n            return refreshSortableTreeMetadata(nextNodes);\n        }\n    }\n\n    return null;\n}\n\nfunction refreshSortableTreeMetadata<T>(\n    nodes: readonly SortableTreeNode<T>[]\n): SortableTreeNode<T>[] {\n    return nodes.map((node, index) => ({\n        ...node,\n        index,\n        siblingCount: nodes.length,\n    }));\n}\n"],"names":["buildSortableTree","items","options","parent","path","item","index","childItems","itemPath","restoreSortableTree","nodes","setChildren","node","findSortableTreeNode","key","child","moveSortableTreeNodeToIndex","parentKey","source","movesIntoDescendant","extracted","remaining","extractSortableTreeNodes","nextNodes","insertionIndex","refreshSortableTreeMetadata","mapSortableTreeNode","nextChildren","keys","update"],"mappings":"AAAO,SAASA,EAAkBC,GAAOC,GAASC,IAAS,MAAMC,IAAO,IAAI;AAC1E,SAAOH,EAAM,IAAI,CAACI,GAAMC,MAAU;AAChC,UAAMC,IAAaL,EAAQ,cAAcG,CAAI,KAAK,CAAA,GAC5CG,IAAW,CAAC,GAAGJ,GAAME,CAAK;AAChC,WAAO;AAAA,MACL,IAAIJ,EAAQ,SAASG,GAAMG,CAAQ,KAAK,YAAYA,EAAS,KAAK,GAAG,CAAC;AAAA,MACtE,OAAOH;AAAA,MACP,WAAWH,EAAQ,aAAaG,CAAI;AAAA,MACpC,iBAAiBH,EAAQ,kBAAkBG,CAAI,KAAKE,EAAW,SAAS;AAAA,MACxE,UAAUP,EAAkBO,GAAYL,GAASG,GAAMG,CAAQ;AAAA,MAC/D,QAAAL;AAAA,MACA,OAAAG;AAAA,MACA,cAAcL,EAAM;AAAA,MACpB,OAAOO,EAAS;AAAA,IAAA;AAAA,EAEpB,CAAC;AACH;AACO,SAASC,EAAoBC,GAAOC,GAAa;AACtD,SAAOD,EAAM,IAAI,CAAAE,MACX,CAACD,KAAe,CAACC,EAAK,kBACjBA,EAAK,QAEPD,EAAYC,EAAK,OAAOH,EAAoBG,EAAK,UAAUD,CAAW,CAAC,CAC/E;AACH;AACO,SAASE,EAAqBH,GAAOI,GAAK;AAC/C,aAAWF,KAAQF,GAAO;AACxB,QAAIE,EAAK,OAAOE;AACd,aAAOF;AAET,UAAMG,IAAQF,EAAqBD,EAAK,UAAUE,CAAG;AACrD,QAAIC;AACF,aAAOA;AAAA,EAEX;AACA,SAAO;AACT;AAyCO,SAASC,EAA4BN,GAAOI,GAAKG,GAAWX,GAAO;AACxE,QAAMY,IAASL,EAAqBH,GAAOI,CAAG,GACxCK,IAAsBD,KAAU,QAAQD,KAAa,QAAQJ,EAAqBK,EAAO,UAAUD,CAAS,KAAK;AACvH,MAAI,CAACC,KAAUD,MAAcH,KAAOK;AAClC,WAAO,CAAC,GAAGT,CAAK;AAElB,QAAMU,IAAY,CAAA,GACZC,IAAYC,EAAyBZ,GAAO,oBAAI,IAAI,CAACI,CAAG,CAAC,GAAGM,CAAS,GACrEf,IAAOe,EAAU,CAAC;AACxB,MAAI,CAACf;AACH,WAAO,CAAC,GAAGK,CAAK;AAElB,MAAIO,KAAa,MAAM;AACrB,UAAMM,IAAY,CAAC,GAAGF,CAAS,GACzBG,IAAiB,KAAK,IAAI,GAAG,KAAK,IAAIlB,GAAOiB,EAAU,MAAM,CAAC;AACpE,WAAAA,EAAU,OAAOC,GAAgB,GAAG;AAAA,MAClC,GAAGnB;AAAA,MACH,QAAQ;AAAA,IAAA,CACT,GACMoB,EAA4BF,CAAS;AAAA,EAC9C;AAEA,SADeV,EAAqBQ,GAAWJ,CAAS,GAC3C,kBAGIS,EAAoBL,GAAWJ,GAAW,CAAAL,MAAQ;AACjE,UAAMe,IAAe,CAAC,GAAGf,EAAK,QAAQ,GAChCY,IAAiB,KAAK,IAAI,GAAG,KAAK,IAAIlB,GAAOqB,EAAa,MAAM,CAAC;AACvE,WAAAA,EAAa,OAAOH,GAAgB,GAAG;AAAA,MACrC,GAAGnB;AAAA,MACH,QAAQO,EAAK;AAAA,IAAA,CACd,GACM;AAAA,MACL,GAAGA;AAAA,MACH,UAAUa,EAA4BE,CAAY;AAAA,IAAA;AAAA,EAEtD,CAAC,KACkB,CAAC,GAAGjB,CAAK,IAdnB,CAAC,GAAGA,CAAK;AAepB;AAWA,SAASY,EAAyBZ,GAAOkB,GAAMR,GAAW;AACxD,QAAMC,IAAY,CAAA;AAClB,aAAWT,KAAQF,GAAO;AACxB,QAAIkB,EAAK,IAAIhB,EAAK,EAAE,GAAG;AACrB,MAAAQ,EAAU,KAAKR,CAAI;AACnB;AAAA,IACF;AACA,IAAAS,EAAU,KAAK;AAAA,MACb,GAAGT;AAAA,MACH,UAAUU,EAAyBV,EAAK,UAAUgB,GAAMR,CAAS;AAAA,IAAA,CAClE;AAAA,EACH;AACA,SAAOK,EAA4BJ,CAAS;AAC9C;AAsCA,SAASK,EAAoBhB,GAAOI,GAAKe,GAAQ;AAC/C,WAASvB,IAAQ,GAAGA,IAAQI,EAAM,QAAQJ,KAAS,GAAG;AACpD,UAAMM,IAAOF,EAAMJ,CAAK;AACxB,QAAI,CAACM;AACH;AAEF,QAAIA,EAAK,OAAOE,GAAK;AACnB,YAAMS,IAAY,CAAC,GAAGb,CAAK;AAC3B,aAAAa,EAAUjB,CAAK,IAAIuB,EAAOjB,CAAI,GACvBa,EAA4BF,CAAS;AAAA,IAC9C;AACA,UAAMI,IAAeD,EAAoBd,EAAK,UAAUE,GAAKe,CAAM;AACnE,QAAIF,GAAc;AAChB,YAAMJ,IAAY,CAAC,GAAGb,CAAK;AAC3B,aAAAa,EAAUjB,CAAK,IAAI;AAAA,QACjB,GAAGM;AAAA,QACH,UAAUe;AAAA,MAAA,GAELF,EAA4BF,CAAS;AAAA,IAC9C;AAAA,EACF;AACA,SAAO;AACT;AACA,SAASE,EAA4Bf,GAAO;AAC1C,SAAOA,EAAM,IAAI,CAACE,GAAMN,OAAW;AAAA,IACjC,GAAGM;AAAA,IACH,OAAAN;AAAA,IACA,cAAcI,EAAM;AAAA,EAAA,EACpB;AACJ;"}

package/dist/Spinner/Spinner.d.ts

@@ -0,0 +1,12 @@
+import type { HTMLAttributes } from 'react';
+export type SpinnerSize = 'xxs' | 'xs' | 'sm' | 'md' | 'lg' | 'xl' | 'xxl' | 'inherit' | 'unset';
+export interface SpinnerProps extends HTMLAttributes<HTMLDivElement> {
+    size?: SpinnerSize;
+    className?: string;
+}
+export declare function SpinnerMark(): import("react").JSX.Element;
+export declare function Spinner({ size, className, ...props }: SpinnerProps): import("react").JSX.Element;
+export declare namespace Spinner {
+    var displayName: string;
+}
+//# sourceMappingURL=Spinner.d.ts.map

package/dist/Spinner/Spinner.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Spinner.d.ts","sourceRoot":"","sources":["../../src/Spinner/Spinner.tsx"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,OAAO,CAAC;AAE5C,MAAM,MAAM,WAAW,GAAG,KAAK,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,KAAK,GAAG,SAAS,GAAG,OAAO,CAAC;AAEjG,MAAM,WAAW,YAAa,SAAQ,cAAc,CAAC,cAAc,CAAC;IAChE,IAAI,CAAC,EAAE,WAAW,CAAC;IACnB,SAAS,CAAC,EAAE,MAAM,CAAC;CACtB;AAED,wBAAgB,WAAW,gCAO1B;AAED,wBAAgB,OAAO,CAAC,EAAE,IAAgB,EAAE,SAAS,EAAE,GAAG,KAAK,EAAE,EAAE,YAAY,+BAY9E;yBAZe,OAAO"}

package/dist/Spinner/Spinner.js

@@ -0,0 +1,42 @@
+import { cn as c } from "@reforma/lib";
+import r from "./Spinner.module.css.js";
+import { jsx as e, jsxs as s } from "react/jsx-runtime";
+function t() {
+  return /* @__PURE__ */ s("svg", {
+    className: r.spinner,
+    viewBox: "0 0 32 32",
+    fill: "none",
+    "aria-hidden": "true",
+    children: [/* @__PURE__ */ e("circle", {
+      className: r.track,
+      cx: "16",
+      cy: "16",
+      r: "14"
+    }), /* @__PURE__ */ e("circle", {
+      className: r.arc,
+      cx: "16",
+      cy: "16",
+      r: "14"
+    })]
+  });
+}
+function l({
+  size: i = "inherit",
+  className: a,
+  ...n
+}) {
+  return /* @__PURE__ */ e("div", {
+    role: "status",
+    "aria-label": "Loading",
+    className: c(r.root, a),
+    "data-size": i,
+    ...n,
+    children: /* @__PURE__ */ e(t, {})
+  });
+}
+l.displayName = "Spinner";
+export {
+  l as Spinner,
+  t as SpinnerMark
+};
+//# sourceMappingURL=Spinner.js.map

package/dist/Spinner/Spinner.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Spinner.js","sources":["../../src/Spinner/Spinner.tsx"],"sourcesContent":["import { cn } from '@reforma/lib';\n\nimport styles from './Spinner.module.css';\n\nimport type { HTMLAttributes } from 'react';\n\nexport type SpinnerSize = 'xxs' | 'xs' | 'sm' | 'md' | 'lg' | 'xl' | 'xxl' | 'inherit' | 'unset';\n\nexport interface SpinnerProps extends HTMLAttributes<HTMLDivElement> {\n    size?: SpinnerSize;\n    className?: string;\n}\n\nexport function SpinnerMark() {\n    return (\n        <svg className={ styles.spinner } viewBox=\"0 0 32 32\" fill=\"none\" aria-hidden=\"true\">\n            <circle className={ styles.track } cx=\"16\" cy=\"16\" r=\"14\" />\n            <circle className={ styles.arc } cx=\"16\" cy=\"16\" r=\"14\" />\n        </svg>\n    );\n}\n\nexport function Spinner({ size = 'inherit', className, ...props }: SpinnerProps) {\n    return (\n        <div\n            role=\"status\"\n            aria-label=\"Loading\"\n            className={ cn(styles.root, className) }\n            data-size={ size }\n            { ...props }\n        >\n            <SpinnerMark />\n        </div>\n    );\n}\n\nSpinner.displayName = 'Spinner';\n"],"names":["SpinnerMark","styles","_jsx","Spinner","size","className","props","cn"],"mappings":";;;AAGO,SAASA,IAAc;AAC5B,2BAA0B,OAAO;AAAA,IAC/B,WAAWC,EAAO;AAAA,IAClB,SAAS;AAAA,IACT,MAAM;AAAA,IACN,eAAe;AAAA,IACf,UAAU,CAAcC,gBAAAA,EAAK,UAAU;AAAA,MACrC,WAAWD,EAAO;AAAA,MAClB,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,GAAG;AAAA,IAAA,CACJ,GAAgBC,gBAAAA,EAAK,UAAU;AAAA,MAC9B,WAAWD,EAAO;AAAA,MAClB,IAAI;AAAA,MACJ,IAAI;AAAA,MACJ,GAAG;AAAA,IAAA,CACJ,CAAC;AAAA,EAAA,CACH;AACH;AACO,SAASE,EAAQ;AAAA,EACtB,MAAAC,IAAO;AAAA,EACP,WAAAC;AAAA,EACA,GAAGC;AACL,GAAG;AACD,2BAAyB,OAAO;AAAA,IAC9B,MAAM;AAAA,IACN,cAAc;AAAA,IACd,WAAWC,EAAGN,EAAO,MAAMI,CAAS;AAAA,IACpC,aAAaD;AAAA,IACb,GAAGE;AAAA,IACH,UAAuBJ,gBAAAA,EAAKF,GAAa,CAAA,CAAE;AAAA,EAAA,CAC5C;AACH;AACAG,EAAQ,cAAc;"}

package/dist/Spinner/Spinner.module.css

@@ -0,0 +1 @@
+@property --spinner-arc{syntax: "<number>"; inherits: false; initial-value: .28;}@property --spinner-travel{syntax: "<number>"; inherits: false; initial-value: 0;}@layer components{.Spinner_root_I5MEDQ{--spinner-foreground: var(--color-secondary-muted);--spinner-color: var(--color-primary);--spinner-size: 1em;--spinner-width: .15em;display:inline-flex;justify-content:center;align-items:center}.Spinner_labelRoot_VRvHHT{--spinner-foreground: var(--color-secondary-muted);--spinner-color: var(--color-primary);--spinner-size: 1em;--spinner-width: .15em;display:inline-flex;align-items:center;gap:1ex;color:var(--color-secondary-muted-text);font-weight:400;font-size:var(--text-sm);line-height:var(--leading-sm);font-family:Onest,sans-serif;letter-spacing:0}.Spinner_label_mHq84z{min-width:0}.Spinner_spinner_cshedd{flex-shrink:0;transform:rotate(-90deg);transform-origin:50% 50%;container-type:inline-size;width:var(--spinner-size);height:var(--spinner-size);overflow:visible}.Spinner_track_AeDhup,.Spinner_arc_CajCGX{vector-effect:non-scaling-stroke;fill:none;stroke-width:var(--spinner-width)}.Spinner_track_AeDhup{stroke:var(--spinner-foreground)}.Spinner_arc_CajCGX{--spinner-circ: calc(2 * 3.141592653589793 * 14 / 32 * 100cqi);--spinner-arc: .28;--spinner-travel: 0;animation:Spinner_spinner-length_7nz671 2s linear infinite,Spinner_spinner-travel_CbqQ2o 2s linear infinite;stroke:var(--spinner-color);stroke-dasharray:calc(var(--spinner-arc) * var(--spinner-circ)) calc((1 - var(--spinner-arc)) * var(--spinner-circ));stroke-dashoffset:calc(var(--spinner-travel) * var(--spinner-circ));stroke-linecap:round}.Spinner_root_I5MEDQ[data-size=xxs],.Spinner_labelRoot_VRvHHT[data-size=xxs]{--spinner-size: var(--spacing-12);--spinner-width: 1px}.Spinner_root_I5MEDQ[data-size=xs],.Spinner_labelRoot_VRvHHT[data-size=xs]{--spinner-size: var(--spacing-16);--spinner-width: 2px}.Spinner_root_I5MEDQ[data-size=sm],.Spinner_labelRoot_VRvHHT[data-size=sm]{--spinner-size: var(--spacing-20);--spinner-width: 3px}.Spinner_root_I5MEDQ[data-size=md],.Spinner_labelRoot_VRvHHT[data-size=md]{--spinner-size: var(--spacing-24);--spinner-width: 3px}.Spinner_root_I5MEDQ[data-size=lg],.Spinner_labelRoot_VRvHHT[data-size=lg]{--spinner-size: var(--spacing-28);--spinner-width: 3px}.Spinner_root_I5MEDQ[data-size=xl],.Spinner_labelRoot_VRvHHT[data-size=xl]{--spinner-size: var(--spacing-32);--spinner-width: 4px}.Spinner_root_I5MEDQ[data-size=xxl],.Spinner_labelRoot_VRvHHT[data-size=xxl]{--spinner-size: var(--spacing-36);--spinner-width: 4px}@media(prefers-reduced-motion:reduce){.Spinner_arc_CajCGX{animation:none;--spinner-arc: .25;--spinner-travel: 0}.Spinner_spinner_cshedd{transform:rotate(-90deg)}}}@keyframes Spinner_spinner-length_7nz671{0%,to{--spinner-arc: .28}50%{--spinner-arc: .56}}@keyframes Spinner_spinner-travel_CbqQ2o{to{--spinner-travel: -1}}

package/dist/Spinner/Spinner.module.css.js

@@ -0,0 +1,18 @@
+const n = "Spinner_root_I5MEDQ", e = "Spinner_labelRoot_VRvHHT", o = "Spinner_label_mHq84z", r = "Spinner_spinner_cshedd", t = "Spinner_track_AeDhup", a = "Spinner_arc_CajCGX", c = {
+  root: n,
+  labelRoot: e,
+  label: o,
+  spinner: r,
+  track: t,
+  arc: a
+};
+export {
+  a as arc,
+  c as default,
+  o as label,
+  e as labelRoot,
+  n as root,
+  r as spinner,
+  t as track
+};
+//# sourceMappingURL=Spinner.module.css.js.map

package/dist/Spinner/Spinner.module.css.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Spinner.module.css.js","sources":[],"sourcesContent":[],"names":[],"mappings":";;;;;;;;"}

package/dist/Spinner/SpinnerLabel.d.ts

@@ -0,0 +1,15 @@
+import type { HTMLAttributes, ReactNode } from 'react';
+import type { SpinnerSize } from './Spinner';
+export interface SpinnerLabelProps extends HTMLAttributes<HTMLSpanElement> {
+    children: ReactNode;
+    /** Spinner size; default `inherit` (≈1em of the label text). */
+    size?: SpinnerSize;
+}
+/**
+ * Inline loading row: spinner + label with the spacing from Spinner stories.
+ */
+export declare function SpinnerLabel({ children, size, className, ...props }: SpinnerLabelProps): import("react").JSX.Element;
+export declare namespace SpinnerLabel {
+    var displayName: string;
+}
+//# sourceMappingURL=SpinnerLabel.d.ts.map

package/dist/Spinner/SpinnerLabel.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"SpinnerLabel.d.ts","sourceRoot":"","sources":["../../src/Spinner/SpinnerLabel.tsx"],"names":[],"mappings":"AAKA,OAAO,KAAK,EAAE,cAAc,EAAE,SAAS,EAAE,MAAM,OAAO,CAAC;AACvD,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,WAAW,CAAC;AAE7C,MAAM,WAAW,iBAAkB,SAAQ,cAAc,CAAC,eAAe,CAAC;IACtE,QAAQ,EAAE,SAAS,CAAC;IACpB,gEAAgE;IAChE,IAAI,CAAC,EAAE,WAAW,CAAC;CACtB;AAED;;GAEG;AACH,wBAAgB,YAAY,CAAC,EACzB,QAAQ,EACR,IAAgB,EAChB,SAAS,EACT,GAAG,KAAK,EACX,EAAE,iBAAiB,+BAYnB;yBAjBe,YAAY"}

package/dist/Spinner/SpinnerLabel.js

@@ -0,0 +1,26 @@
+import { cn as o } from "@reforma/lib";
+import { SpinnerMark as t } from "./Spinner.js";
+import r from "./Spinner.module.css.js";
+import { jsxs as l, jsx as e } from "react/jsx-runtime";
+function m({
+  children: a,
+  size: s = "inherit",
+  className: n,
+  ...i
+}) {
+  return /* @__PURE__ */ l("span", {
+    role: "status",
+    "data-size": s,
+    className: o(r.labelRoot, n),
+    ...i,
+    children: [/* @__PURE__ */ e(t, {}), /* @__PURE__ */ e("span", {
+      className: r.label,
+      children: a
+    })]
+  });
+}
+m.displayName = "SpinnerLabel";
+export {
+  m as SpinnerLabel
+};
+//# sourceMappingURL=SpinnerLabel.js.map

package/dist/Spinner/SpinnerLabel.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"SpinnerLabel.js","sources":["../../src/Spinner/SpinnerLabel.tsx"],"sourcesContent":["import { cn } from '@reforma/lib';\n\nimport { SpinnerMark } from './Spinner';\nimport styles from './Spinner.module.css';\n\nimport type { HTMLAttributes, ReactNode } from 'react';\nimport type { SpinnerSize } from './Spinner';\n\nexport interface SpinnerLabelProps extends HTMLAttributes<HTMLSpanElement> {\n    children: ReactNode;\n    /** Spinner size; default `inherit` (≈1em of the label text). */\n    size?: SpinnerSize;\n}\n\n/**\n * Inline loading row: spinner + label with the spacing from Spinner stories.\n */\nexport function SpinnerLabel({\n    children,\n    size = 'inherit',\n    className,\n    ...props\n}: SpinnerLabelProps) {\n    return (\n        <span\n            role=\"status\"\n            data-size={ size }\n            className={ cn(styles.labelRoot, className) }\n            { ...props }\n        >\n            <SpinnerMark />\n            <span className={ styles.label }>{ children }</span>\n        </span>\n    );\n}\n\nSpinnerLabel.displayName = 'SpinnerLabel';\n"],"names":["SpinnerLabel","children","size","className","props","cn","styles","_jsx","SpinnerMark"],"mappings":";;;;AAOO,SAASA,EAAa;AAAA,EAC3B,UAAAC;AAAA,EACA,MAAAC,IAAO;AAAA,EACP,WAAAC;AAAA,EACA,GAAGC;AACL,GAAG;AACD,2BAA0B,QAAQ;AAAA,IAChC,MAAM;AAAA,IACN,aAAaF;AAAA,IACb,WAAWG,EAAGC,EAAO,WAAWH,CAAS;AAAA,IACzC,GAAGC;AAAA,IACH,UAAU,CAAcG,gBAAAA,EAAKC,GAAa,CAAA,CAAE,qBAAqB,QAAQ;AAAA,MACvE,WAAWF,EAAO;AAAA,MAClB,UAAAL;AAAA,IAAA,CACD,CAAC;AAAA,EAAA,CACH;AACH;AACAD,EAAa,cAAc;"}

package/dist/Spinner/index.d.ts

@@ -0,0 +1,3 @@
+export { Spinner, type SpinnerProps, type SpinnerSize } from './Spinner';
+export * from './SpinnerLabel';
+//# sourceMappingURL=index.d.ts.map

package/dist/Spinner/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/Spinner/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,KAAK,YAAY,EAAE,KAAK,WAAW,EAAE,MAAM,WAAW,CAAC;AACzE,cAAc,gBAAgB,CAAC"}

package/dist/Spinner/index.js

@@ -0,0 +1,7 @@
+import { Spinner as n } from "./Spinner.js";
+import { SpinnerLabel as p } from "./SpinnerLabel.js";
+export {
+  n as Spinner,
+  p as SpinnerLabel
+};
+//# sourceMappingURL=index.js.map

package/dist/Spinner/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":[],"sourcesContent":[],"names":[],"mappings":";;"}

package/dist/Swatch/Swatch.d.ts

@@ -0,0 +1,39 @@
+import type { HTMLAttributes, ReactNode, Ref } from 'react';
+import type { AriaColorSwatchProps } from 'react-aria';
+import type { Color } from 'react-stately';
+import type { ButtonProps } from '../Button';
+import type { InputSize } from '../Input';
+export type SwatchSize = InputSize;
+export interface SwatchProps extends HTMLAttributes<HTMLDivElement> {
+    ref?: Ref<HTMLDivElement | HTMLButtonElement | HTMLAnchorElement | null>;
+    size?: SwatchSize;
+    isDisabled?: boolean;
+    onPress?: ButtonProps['onPress'];
+    children?: ReactNode;
+}
+export interface ColorSwatchProps extends Omit<AriaColorSwatchProps, 'color'> {
+    ref?: Ref<HTMLDivElement | HTMLButtonElement | HTMLAnchorElement | null>;
+    slot?: string;
+    color?: string | Color | null;
+    size?: SwatchSize;
+    isDisabled?: boolean;
+    className?: string;
+    onPress?: ButtonProps['onPress'];
+}
+export interface ImageSwatchProps extends Omit<SwatchProps, 'children'> {
+    src?: string | null;
+    alt?: string;
+}
+export declare function Swatch({ ref, size, isDisabled, onPress, className, children, ...props }: SwatchProps): import("react").JSX.Element;
+export declare namespace Swatch {
+    var displayName: string;
+}
+export declare function ColorSwatch({ ref, color, size, isDisabled, className, slot: _slot, ...props }: ColorSwatchProps): import("react").JSX.Element;
+export declare namespace ColorSwatch {
+    var displayName: string;
+}
+export declare function ImageSwatch({ src, alt, ...props }: ImageSwatchProps): import("react").JSX.Element;
+export declare namespace ImageSwatch {
+    var displayName: string;
+}
+//# sourceMappingURL=Swatch.d.ts.map

package/dist/Swatch/Swatch.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Swatch.d.ts","sourceRoot":"","sources":["../../src/Swatch/Swatch.tsx"],"names":[],"mappings":"AAQA,OAAO,KAAK,EAAiB,cAAc,EAAE,SAAS,EAAE,GAAG,EAAE,MAAM,OAAO,CAAC;AAC3E,OAAO,KAAK,EAAE,oBAAoB,EAAE,MAAM,YAAY,CAAC;AACvD,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,eAAe,CAAC;AAC3C,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,WAAW,CAAC;AAC7C,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,UAAU,CAAC;AAE1C,MAAM,MAAM,UAAU,GAAG,SAAS,CAAC;AAEnC,MAAM,WAAW,WAAY,SAAQ,cAAc,CAAC,cAAc,CAAC;IAC/D,GAAG,CAAC,EAAE,GAAG,CAAC,cAAc,GAAG,iBAAiB,GAAG,iBAAiB,GAAG,IAAI,CAAC,CAAC;IACzE,IAAI,CAAC,EAAE,UAAU,CAAC;IAClB,UAAU,CAAC,EAAE,OAAO,CAAC;IACrB,OAAO,CAAC,EAAE,WAAW,CAAC,SAAS,CAAC,CAAC;IACjC,QAAQ,CAAC,EAAE,SAAS,CAAC;CACxB;AAED,MAAM,WAAW,gBAAiB,SAAQ,IAAI,CAAC,oBAAoB,EAAE,OAAO,CAAC;IACzE,GAAG,CAAC,EAAE,GAAG,CAAC,cAAc,GAAG,iBAAiB,GAAG,iBAAiB,GAAG,IAAI,CAAC,CAAC;IACzE,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,KAAK,CAAC,EAAE,MAAM,GAAG,KAAK,GAAG,IAAI,CAAC;IAC9B,IAAI,CAAC,EAAE,UAAU,CAAC;IAClB,UAAU,CAAC,EAAE,OAAO,CAAC;IACrB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,OAAO,CAAC,EAAE,WAAW,CAAC,SAAS,CAAC,CAAC;CACpC;AAED,MAAM,WAAW,gBAAiB,SAAQ,IAAI,CAAC,WAAW,EAAE,UAAU,CAAC;IACnE,GAAG,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACpB,GAAG,CAAC,EAAE,MAAM,CAAC;CAChB;AAED,wBAAgB,MAAM,CAAC,EACnB,GAAG,EACH,IAAW,EACX,UAAU,EACV,OAAO,EACP,SAAS,EACT,QAAQ,EACR,GAAG,KAAK,EACX,EAAE,WAAW,+BAiCb;yBAzCe,MAAM;;;AA2CtB,wBAAgB,WAAW,CAAC,EACxB,GAAG,EACH,KAAK,EACL,IAAW,EACX,UAAU,EACV,SAAS,EACT,IAAI,EAAE,KAAK,EACX,GAAG,KAAK,EACX,EAAE,gBAAgB,+BAyClB;yBAjDe,WAAW;;;AA6F3B,wBAAgB,WAAW,CAAC,EACxB,GAAG,EACH,GAAQ,EACR,GAAG,KAAK,EACX,EAAE,gBAAgB,+BAUlB;yBAde,WAAW"}