@corensystem/coren-ui 1.0.0-next.20260924.75108.887a9c2

package/dist/file-system/file-system.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"file-system.mjs","names":[],"sources":["../../src/file-system/file-system.tsx"],"sourcesContent":["import {FolderOpen, Search, X} from \"lucide-react\";\nimport {useCallback, useMemo, useState} from \"react\";\n\nimport {Button} from \"../button\";\nimport {Empty} from \"../empty\";\nimport {Input} from \"../input\";\nimport {ScrollArea} from \"../scroll-area\";\nimport {FileSystemProvider, type FileSystemContextValue} from \"./context\";\nimport {FileSystemDetails} from \"./file-system-details\";\nimport {\n\tFILE_SYSTEM_NO_FILTERS,\n\tFileSystemFilters,\n\tfileSystemFilterCount,\n\ttype FileSystemFilterValue,\n} from \"./file-system-filters\";\nimport {FileSystemNew} from \"./file-system-new\";\nimport {FileSystemProject} from \"./file-system-project\";\nimport {FileSystemTable} from \"./file-system-table\";\nimport {\n\tbuildFileSystemIndex,\n\tfsNode,\n\tfsNodeFromDraft,\n\tfsPath,\n\tfsQuery,\n\ttype FileSystemDraft,\n\ttype FileSystemFileType,\n\ttype FileSystemNode,\n} from \"./model\";\n\n// A file system over whatever a product already has.\n//\n// Two layouts and one details panel, driven by where the reader is:\n//\n//   All files — facets down the left, every project and file under the root on the right.\n//   A project — that project's own sections down the left, its folders and files on the right.\n//\n// Neither is a tree. On the flat listing a file's folder is printed under its name; in a project it is\n// the page you are on. Opening a project SWAPS the layout rather than filtering the list, because a\n// project is a place with more than a file list in it and a facet cannot take you somewhere that has\n// its own sections.\n//\n// Rows never navigate. A row selects, and the details panel answers \"what is this?\"; the underlined\n// NAME is the only thing that leaves. Selecting and leaving are different intentions, so they get\n// different targets — a row that navigated on click would make the first question impossible to ask\n// without losing your place to answer it.\n//\n// The widget owns no data. Nodes arrive as a prop and creation goes back out through `onCreate`, so a\n// host can keep them wherever the rest of its state lives.\n\nexport interface FileSystemProps {\n\t/** Every node, flat, each naming its parent. The widget derives its indexes from these. */\n\tnodes: FileSystemNode[];\n\t/** The node everything is listed under — an organization, a workspace, a tenant. */\n\trootId: string;\n\t/** The file types this product offers: their labels, marks, tints, and the app that owns each. */\n\tfileTypes: FileSystemFileType[];\n\t/**\n\t * Commit a new node. Return the node that was added — the surface selects it, because creating\n\t * something and leaving the reader to find it is a job half done. Return `undefined` to cancel.\n\t *\n\t * Omit to make the file system read-only: no New menu is rendered.\n\t */\n\tonCreate?: (draft: FileSystemDraft) => FileSystemNode | undefined;\n\t/**\n\t * Names the action that opens a file's record, e.g. \"Open in Pipelines\". Return `undefined` for a\n\t * node nothing opens, and no action is offered rather than one that apologises.\n\t */\n\topenLabel?: (node: FileSystemNode) => string | undefined;\n\tonOpenFile?: (node: FileSystemNode) => void;\n\t/** The open project, or `null` for the root listing. Controlled when both are passed. */\n\tprojectId?: string | null;\n\tonProjectChange?: (projectId: string | null) => void;\n\t/** Narrow the flat listing to one folder's subtree. Controlled when both are passed. */\n\tfolderId?: string | null;\n\tonFolderChange?: (folderId: string | null) => void;\n\t/** Placeholder for the search that spans the facets and the listing. */\n\tsearchPlaceholder?: string;\n}\n\nexport function FileSystem({\n\tnodes,\n\trootId,\n\tfileTypes,\n\tonCreate,\n\topenLabel,\n\tonOpenFile,\n\tprojectId,\n\tonProjectChange,\n\tfolderId,\n\tonFolderChange,\n\tsearchPlaceholder = \"Search files and folders...\",\n}: FileSystemProps) {\n\tconst [query, setQuery] = useState(\"\");\n\tconst [filters, setFilters] = useState<FileSystemFilterValue>(FILE_SYSTEM_NO_FILTERS);\n\tconst [selectedId, setSelectedId] = useState<string | null>(null);\n\t// Uncontrolled fallbacks, so the simplest use is `<FileSystem nodes rootId fileTypes />`.\n\tconst [ownProjectId, setOwnProjectId] = useState<string | null>(null);\n\tconst [ownFolderId, setOwnFolderId] = useState<string | null>(null);\n\n\tconst openProjectId = projectId !== undefined ? projectId : ownProjectId;\n\tconst setOpenProjectId = onProjectChange ?? setOwnProjectId;\n\tconst narrowedFolderId = folderId !== undefined ? folderId : ownFolderId;\n\tconst setNarrowedFolderId = onFolderChange ?? setOwnFolderId;\n\n\tconst index = useMemo(() => buildFileSystemIndex(nodes), [nodes]);\n\tconst context: FileSystemContextValue = useMemo(\n\t\t() => ({\n\t\t\tindex,\n\t\t\trootId,\n\t\t\tfileTypes,\n\t\t\tbyType: new Map(fileTypes.map((t) => [t.id, t])),\n\t\t\topenLabel,\n\t\t\tonOpenFile,\n\t\t}),\n\t\t[index, rootId, fileTypes, openLabel, onOpenFile],\n\t);\n\n\tconst folder = narrowedFolderId ? fsNode(index, narrowedFolderId) : undefined;\n\tconst selected = selectedId ? fsNode(index, selectedId) : undefined;\n\tconst facetCount = fileSystemFilterCount(filters);\n\n\tconst rows = useMemo(\n\t\t() =>\n\t\t\tfsQuery(index, {\n\t\t\t\trootId,\n\t\t\t\tfolderId: narrowedFolderId,\n\t\t\t\tquery,\n\t\t\t\ttypes: filters.types.length ? filters.types : undefined,\n\t\t\t\tprojectIds: filters.projectIds.length ? filters.projectIds : undefined,\n\t\t\t\ttags: filters.tags.length ? filters.tags : undefined,\n\t\t\t}),\n\t\t[index, rootId, narrowedFolderId, query, filters],\n\t);\n\n\tconst narrowed = Boolean(folder) || facetCount > 0 || query.trim() !== \"\";\n\n\t/** Ids are the widget's to mint when the host does not supply one, so a name twice cannot collide. */\n\tconst create = useCallback(\n\t\t(draft: FileSystemDraft) => {\n\t\t\tif (!onCreate) return undefined;\n\t\t\treturn onCreate(draft) ?? undefined;\n\t\t},\n\t\t[onCreate],\n\t);\n\n\t/** The underlined name: a project opens its page, a file opens whatever the host says it opens. */\n\tconst openName = useCallback(\n\t\t(node: FileSystemNode) => {\n\t\t\tif (node.kind === \"project\") {\n\t\t\t\tsetOpenProjectId(node.id);\n\t\t\t\tsetSelectedId(null);\n\t\t\t} else onOpenFile?.(node);\n\t\t},\n\t\t[setOpenProjectId, onOpenFile],\n\t);\n\n\tconst details = selected ? (\n\t\t<div className=\"wwc:hidden wwc:w-[300px] wwc:shrink-0 wwc:lg:block\">\n\t\t\t<FileSystemDetails\n\t\t\t\tnode={selected}\n\t\t\t\tonClose={() => setSelectedId(null)}\n\t\t\t\tonOpenProject={selected.kind === \"project\" ? openName : undefined}\n\t\t\t/>\n\t\t</div>\n\t) : null;\n\n\tif (openProjectId) {\n\t\treturn (\n\t\t\t<FileSystemProvider value={context}>\n\t\t\t\t<div className=\"wwc:flex wwc:min-h-0 wwc:flex-1\">\n\t\t\t\t\t<FileSystemProject\n\t\t\t\t\t\tprojectId={openProjectId}\n\t\t\t\t\t\tonBack={() => {\n\t\t\t\t\t\t\tsetOpenProjectId(null);\n\t\t\t\t\t\t\tsetSelectedId(null);\n\t\t\t\t\t\t}}\n\t\t\t\t\t\tselectedId={selectedId}\n\t\t\t\t\t\tonSelect={(node) => setSelectedId(node.id)}\n\t\t\t\t\t\tonOpenName={openName}\n\t\t\t\t\t\tonCreate={create}\n\t\t\t\t\t/>\n\t\t\t\t\t{details}\n\t\t\t\t</div>\n\t\t\t</FileSystemProvider>\n\t\t);\n\t}\n\n\treturn (\n\t\t<FileSystemProvider value={context}>\n\t\t\t<div className=\"wwc:flex wwc:min-h-0 wwc:flex-1 wwc:flex-col\">\n\t\t\t\t{/* The search band spans the facets AND the listing, because it governs both: a query\n\t\t\t\t    narrows the rows and the facet counts follow it. */}\n\t\t\t\t<div className=\"wwc:flex wwc:min-w-0 wwc:flex-shrink-0 wwc:flex-wrap wwc:items-center wwc:gap-2 wwc:border-b wwc:border-border wwc:px-4 wwc:py-2.5\">\n\t\t\t\t\t<div className=\"wwc:relative wwc:min-w-[240px] wwc:flex-1\">\n\t\t\t\t\t\t<Search className=\"wwc:pointer-events-none wwc:absolute wwc:left-2.5 wwc:top-1/2 wwc:h-3.5 wwc:w-3.5 wwc:-translate-y-1/2 wwc:text-muted-foreground\" />\n\t\t\t\t\t\t<Input\n\t\t\t\t\t\t\tvalue={query}\n\t\t\t\t\t\t\tonChange={(e) => setQuery(e.target.value)}\n\t\t\t\t\t\t\tplaceholder={searchPlaceholder}\n\t\t\t\t\t\t\tclassName=\"wwc:h-8 wwc:pl-8 wwc:text-[13px]\"\n\t\t\t\t\t\t/>\n\t\t\t\t\t</div>\n\t\t\t\t\t{/* A folder narrowing arrives from outside — a \"show in files\" link — so it needs a visible\n\t\t\t\t\t    way out; without it the listing just looks like a root with fewer files in it. */}\n\t\t\t\t\t{folder && (\n\t\t\t\t\t\t<Button\n\t\t\t\t\t\t\tvariant=\"secondary\"\n\t\t\t\t\t\t\tsize=\"sm\"\n\t\t\t\t\t\t\tclassName=\"wwc:h-8 wwc:gap-1.5 wwc:text-[12px]\"\n\t\t\t\t\t\t\tonClick={() => setNarrowedFolderId(null)}\n\t\t\t\t\t\t\taria-label={`Stop filtering by ${folder.name}`}\n\t\t\t\t\t\t>\n\t\t\t\t\t\t\t<span className=\"wwc:font-mono\">{fsPath(index, folder.id)}</span>\n\t\t\t\t\t\t\t<X className=\"wwc:h-3 wwc:w-3\" />\n\t\t\t\t\t\t</Button>\n\t\t\t\t\t)}\n\t\t\t\t\t{onCreate && (\n\t\t\t\t\t\t<FileSystemNew\n\t\t\t\t\t\t\tparentId={rootId}\n\t\t\t\t\t\t\tscope=\"root\"\n\t\t\t\t\t\t\tonCreate={create}\n\t\t\t\t\t\t\tonCreated={(node) => {\n\t\t\t\t\t\t\t\t// Land on the thing just made.\n\t\t\t\t\t\t\t\tsetQuery(\"\");\n\t\t\t\t\t\t\t\tsetFilters(FILE_SYSTEM_NO_FILTERS);\n\t\t\t\t\t\t\t\tsetSelectedId(node.id);\n\t\t\t\t\t\t\t}}\n\t\t\t\t\t\t/>\n\t\t\t\t\t)}\n\t\t\t\t</div>\n\n\t\t\t\t<div className=\"wwc:flex wwc:min-h-0 wwc:flex-1\">\n\t\t\t\t\t{/* Facets. Fixed width, and hidden below md, where the search band carries the burden. */}\n\t\t\t\t\t<div className=\"wwc:hidden wwc:w-[240px] wwc:shrink-0 wwc:border-r wwc:border-border wwc:md:block\">\n\t\t\t\t\t\t<FileSystemFilters value={filters} onChange={setFilters} />\n\t\t\t\t\t</div>\n\n\t\t\t\t\t<ScrollArea className=\"wwc:min-w-0 wwc:flex-1\">\n\t\t\t\t\t\t<div className=\"wwc:flex wwc:flex-col wwc:gap-3 wwc:p-4\">\n\t\t\t\t\t\t\t{rows.length === 0 ? (\n\t\t\t\t\t\t\t\t<Empty\n\t\t\t\t\t\t\t\t\ticon={<FolderOpen className=\"wwc:h-8 wwc:w-8\" />}\n\t\t\t\t\t\t\t\t\ttitle=\"No files match\"\n\t\t\t\t\t\t\t\t\tdescription={\n\t\t\t\t\t\t\t\t\t\tnarrowed\n\t\t\t\t\t\t\t\t\t\t\t? \"Nothing here matches the current search and filters.\"\n\t\t\t\t\t\t\t\t\t\t\t: \"Nothing has been filed here yet.\"\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t\taction={\n\t\t\t\t\t\t\t\t\t\tnarrowed ? (\n\t\t\t\t\t\t\t\t\t\t\t<Button\n\t\t\t\t\t\t\t\t\t\t\t\tvariant=\"outline\"\n\t\t\t\t\t\t\t\t\t\t\t\tsize=\"sm\"\n\t\t\t\t\t\t\t\t\t\t\t\tonClick={() => {\n\t\t\t\t\t\t\t\t\t\t\t\t\tsetQuery(\"\");\n\t\t\t\t\t\t\t\t\t\t\t\t\tsetFilters(FILE_SYSTEM_NO_FILTERS);\n\t\t\t\t\t\t\t\t\t\t\t\t\tsetNarrowedFolderId(null);\n\t\t\t\t\t\t\t\t\t\t\t\t}}\n\t\t\t\t\t\t\t\t\t\t\t>\n\t\t\t\t\t\t\t\t\t\t\t\tClear filters\n\t\t\t\t\t\t\t\t\t\t\t</Button>\n\t\t\t\t\t\t\t\t\t\t) : undefined\n\t\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\t/>\n\t\t\t\t\t\t\t) : (\n\t\t\t\t\t\t\t\t<FileSystemTable\n\t\t\t\t\t\t\t\t\trows={rows}\n\t\t\t\t\t\t\t\t\tselectedId={selectedId}\n\t\t\t\t\t\t\t\t\tonSelect={(node) => setSelectedId(node.id)}\n\t\t\t\t\t\t\t\t\tonOpenName={openName}\n\t\t\t\t\t\t\t\t/>\n\t\t\t\t\t\t\t)}\n\t\t\t\t\t\t</div>\n\t\t\t\t\t</ScrollArea>\n\n\t\t\t\t\t{details}\n\t\t\t\t</div>\n\t\t\t</div>\n\t\t</FileSystemProvider>\n\t);\n}\n\nexport {fsNodeFromDraft};\n"],"mappings":";;;;;;;;;;;;;;;AA+EA,SAAgB,WAAW,EAC1B,OACA,QACA,WACA,UACA,WACA,YACA,WACA,iBACA,UACA,gBACA,oBAAoB,iCACD;CACnB,MAAM,CAAC,OAAO,YAAY,SAAS,EAAE;CACrC,MAAM,CAAC,SAAS,cAAc,SAAgC,sBAAsB;CACpF,MAAM,CAAC,YAAY,iBAAiB,SAAwB,IAAI;CAEhE,MAAM,CAAC,cAAc,mBAAmB,SAAwB,IAAI;CACpE,MAAM,CAAC,aAAa,kBAAkB,SAAwB,IAAI;CAElE,MAAM,gBAAgB,cAAc,KAAA,IAAY,YAAY;CAC5D,MAAM,mBAAmB,mBAAmB;CAC5C,MAAM,mBAAmB,aAAa,KAAA,IAAY,WAAW;CAC7D,MAAM,sBAAsB,kBAAkB;CAE9C,MAAM,QAAQ,cAAc,qBAAqB,KAAK,GAAG,CAAC,KAAK,CAAC;CAChE,MAAM,UAAkC,eAChC;EACN;EACA;EACA;EACA,QAAQ,IAAI,IAAI,UAAU,KAAK,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;EAC/C;EACA;CACD,IACA;EAAC;EAAO;EAAQ;EAAW;EAAW;CAAU,CACjD;CAEA,MAAM,SAAS,mBAAmB,OAAO,OAAO,gBAAgB,IAAI,KAAA;CACpE,MAAM,WAAW,aAAa,OAAO,OAAO,UAAU,IAAI,KAAA;CAC1D,MAAM,aAAa,sBAAsB,OAAO;CAEhD,MAAM,OAAO,cAEX,QAAQ,OAAO;EACd;EACA,UAAU;EACV;EACA,OAAO,QAAQ,MAAM,SAAS,QAAQ,QAAQ,KAAA;EAC9C,YAAY,QAAQ,WAAW,SAAS,QAAQ,aAAa,KAAA;EAC7D,MAAM,QAAQ,KAAK,SAAS,QAAQ,OAAO,KAAA;CAC5C,CAAC,GACF;EAAC;EAAO;EAAQ;EAAkB;EAAO;CAAO,CACjD;CAEA,MAAM,WAAW,QAAQ,MAAM,KAAK,aAAa,KAAK,MAAM,KAAK,MAAM;;CAGvE,MAAM,SAAS,aACb,UAA2B;EAC3B,IAAI,CAAC,UAAU,OAAO,KAAA;EACtB,OAAO,SAAS,KAAK,KAAK,KAAA;CAC3B,GACA,CAAC,QAAQ,CACV;;CAGA,MAAM,WAAW,aACf,SAAyB;EACzB,IAAI,KAAK,SAAS,WAAW;GAC5B,iBAAiB,KAAK,EAAE;GACxB,cAAc,IAAI;EACnB,OAAO,aAAa,IAAI;CACzB,GACA,CAAC,kBAAkB,UAAU,CAC9B;CAEA,MAAM,UAAU,WACf,oBAAC,OAAD;EAAK,WAAU;EACd,UAAA,oBAAC,mBAAD;GACC,MAAM;GACN,eAAe,cAAc,IAAI;GACjC,eAAe,SAAS,SAAS,YAAY,WAAW,KAAA;EACxD,CAAA;CACG,CAAA,IACF;CAEJ,IAAI,eACH,OACC,oBAAC,oBAAD;EAAoB,OAAO;EAC1B,UAAA,qBAAC,OAAD;GAAK,WAAU;GAAf,UAAA,CACC,oBAAC,mBAAD;IACC,WAAW;IACX,cAAc;KACb,iBAAiB,IAAI;KACrB,cAAc,IAAI;IACnB;IACY;IACZ,WAAW,SAAS,cAAc,KAAK,EAAE;IACzC,YAAY;IACZ,UAAU;GACV,CAAA,GACA,OACG;;CACc,CAAA;CAItB,OACC,oBAAC,oBAAD;EAAoB,OAAO;EAC1B,UAAA,qBAAC,OAAD;GAAK,WAAU;GAAf,UAAA,CAGC,qBAAC,OAAD;IAAK,WAAU;IAAf,UAAA;KACC,qBAAC,OAAD;MAAK,WAAU;MAAf,UAAA,CACC,oBAAC,QAAD,EAAQ,WAAU,mIAAoI,CAAA,GACtJ,oBAAC,OAAD;OACC,OAAO;OACP,WAAW,MAAM,SAAS,EAAE,OAAO,KAAK;OACxC,aAAa;OACb,WAAU;MACV,CAAA,CACG;;KAGJ,UACA,qBAAC,QAAD;MACC,SAAQ;MACR,MAAK;MACL,WAAU;MACV,eAAe,oBAAoB,IAAI;MACvC,cAAY,qBAAqB,OAAO;MALzC,UAAA,CAOC,oBAAC,QAAD;OAAM,WAAU;OAAiB,UAAA,OAAO,OAAO,OAAO,EAAE;MAAQ,CAAA,GAChE,oBAAC,GAAD,EAAG,WAAU,kBAAmB,CAAA,CACzB;;KAER,YACA,oBAAC,eAAD;MACC,UAAU;MACV,OAAM;MACN,UAAU;MACV,YAAY,SAAS;OAEpB,SAAS,EAAE;OACX,WAAW,sBAAsB;OACjC,cAAc,KAAK,EAAE;MACtB;KACA,CAAA;IAEE;GAEL,CAAA,GAAA,qBAAC,OAAD;IAAK,WAAU;IAAf,UAAA;KAEC,oBAAC,OAAD;MAAK,WAAU;MACd,UAAA,oBAAC,mBAAD;OAAmB,OAAO;OAAS,UAAU;MAAa,CAAA;KACtD,CAAA;KAEL,oBAAC,YAAD;MAAY,WAAU;MACrB,UAAA,oBAAC,OAAD;OAAK,WAAU;OACb,UAAA,KAAK,WAAW,IAChB,oBAAC,OAAD;QACC,MAAM,oBAAC,YAAD,EAAY,WAAU,kBAAmB,CAAA;QAC/C,OAAM;QACN,aACC,WACG,yDACA;QAEJ,QACC,WACC,oBAAC,QAAD;SACC,SAAQ;SACR,MAAK;SACL,eAAe;UACd,SAAS,EAAE;UACX,WAAW,sBAAsB;UACjC,oBAAoB,IAAI;SACzB;SACA,UAAA;QAEO,CAAA,IACL,KAAA;OAEL,CAAA,IAED,oBAAC,iBAAD;QACO;QACM;QACZ,WAAW,SAAS,cAAc,KAAK,EAAE;QACzC,YAAY;OACZ,CAAA;MAEE,CAAA;KACM,CAAA;KAEX;IACG;GACD,CAAA,CAAA;;CACc,CAAA;AAEtB"}

package/dist/file-system/index.d.mts

@@ -0,0 +1,9 @@
+import { FileSystemDraft, FileSystemFileType, FileSystemIndex, FileSystemKind, FileSystemNode, buildFileSystemIndex, fsAncestors, fsChildren, fsDescendants, fsEffectiveTags, fsFindByRef, fsFolderListing, fsFolderPath, fsNode, fsNodeFromDraft, fsPath, fsProjectCounts, fsProjects, fsQuery, fsTagCounts, fsTrail, fsTypeCounts } from "./model.mjs";
+import { FileSystemDetails, FileSystemDetailsProps } from "./file-system-details.mjs";
+import { FILE_SYSTEM_NO_FILTERS, FileSystemFilterValue, FileSystemFilters, FileSystemFiltersProps, fileSystemFilterCount } from "./file-system-filters.mjs";
+import { FileSystemNew, FileSystemNewProps } from "./file-system-new.mjs";
+import { FileSystemPathText } from "./file-system-path.mjs";
+import { FileSystemProject, FileSystemProjectProps, FileSystemProjectSection } from "./file-system-project.mjs";
+import { FileSystemTable, FileSystemTableProps } from "./file-system-table.mjs";
+import { FileSystem, FileSystemProps } from "./file-system.mjs";
+export { FILE_SYSTEM_NO_FILTERS, FileSystem, FileSystemDetails, type FileSystemDetailsProps, type FileSystemDraft, type FileSystemFileType, type FileSystemFilterValue, FileSystemFilters, type FileSystemFiltersProps, type FileSystemIndex, type FileSystemKind, FileSystemNew, type FileSystemNewProps, type FileSystemNode, FileSystemPathText, FileSystemProject, type FileSystemProjectProps, type FileSystemProjectSection, type FileSystemProps, FileSystemTable, type FileSystemTableProps, buildFileSystemIndex, fileSystemFilterCount, fsAncestors, fsChildren, fsDescendants, fsEffectiveTags, fsFindByRef, fsFolderListing, fsFolderPath, fsNode, fsNodeFromDraft, fsPath, fsProjectCounts, fsProjects, fsQuery, fsTagCounts, fsTrail, fsTypeCounts };

package/dist/file-system/index.mjs

@@ -0,0 +1,9 @@
+import { FileSystemPathText } from "./file-system-path.mjs";
+import { buildFileSystemIndex, fsAncestors, fsChildren, fsDescendants, fsEffectiveTags, fsFindByRef, fsFolderListing, fsFolderPath, fsNode, fsNodeFromDraft, fsPath, fsProjectCounts, fsProjects, fsQuery, fsTagCounts, fsTrail, fsTypeCounts } from "./model.mjs";
+import { FileSystemDetails } from "./file-system-details.mjs";
+import { FILE_SYSTEM_NO_FILTERS, FileSystemFilters, fileSystemFilterCount } from "./file-system-filters.mjs";
+import { FileSystemNew } from "./file-system-new.mjs";
+import { FileSystemTable } from "./file-system-table.mjs";
+import { FileSystemProject } from "./file-system-project.mjs";
+import { FileSystem } from "./file-system.mjs";
+export { FILE_SYSTEM_NO_FILTERS, FileSystem, FileSystemDetails, FileSystemFilters, FileSystemNew, FileSystemPathText, FileSystemProject, FileSystemTable, buildFileSystemIndex, fileSystemFilterCount, fsAncestors, fsChildren, fsDescendants, fsEffectiveTags, fsFindByRef, fsFolderListing, fsFolderPath, fsNode, fsNodeFromDraft, fsPath, fsProjectCounts, fsProjects, fsQuery, fsTagCounts, fsTrail, fsTypeCounts };

package/dist/file-system/model.d.mts

@@ -0,0 +1,156 @@
+import { ComponentType } from "react";
+//#region src/file-system/model.d.ts
+/** What a node IS. Only `file` carries a `ref`; the other three are containers. */
+export type FileSystemKind = "root" | "project" | "folder" | "file";
+/**
+ * One file type the host offers — the label, mark and tint a node of that type is shown with, and
+ * optionally the app that owns its records.
+ */
+export type FileSystemFileType = {
+  id: string;
+  label: string;
+  icon: ComponentType<{
+    className?: string;
+  }>;
+  /**
+   * Background + foreground classes for the tinted square the icon sits in, so a kind is legible
+   * before its name is read. Omit for a neutral mark.
+   */
+  tone?: string;
+  /**
+   * The app that owns records of this type, named. When set, creating one is understood to create a
+   * record there and the create dialog says so; when not, the file is a place and nothing more.
+   */
+  app?: string;
+};
+export type FileSystemNode = {
+  id: string;
+  name: string;
+  kind: FileSystemKind;
+  /** `null` only for a root. */
+  parentId: string | null;
+  /** Display string, not a timestamp — the host formats dates the way the rest of its product does. */
+  updatedAt: string;
+  /** Sort key for the listing's Last modified column. Higher is newer; units are the host's own. */
+  updatedTs: number;
+  /** A file type id, from the host's `fileTypes`. */
+  fileType?: string;
+  description?: string;
+  tags?: string[];
+  /**
+   * Whatever the host needs to reopen the record this file addresses. Opaque here: the widget only
+   * ever hands it back, and asks the host — through `openLabel` — whether it leads anywhere.
+   */
+  ref?: unknown;
+  /** Retired: still resolvable by id, never listed. */
+  trashed?: boolean;
+};
+/**
+ * The derived lookups every surface reads. Built once per node array: two indexes down the hierarchy
+ * and one back up it, so "which folder is this record in?" is a map hit rather than a walk of the
+ * whole hierarchy on every listing row.
+ */
+export type FileSystemIndex = {
+  nodes: FileSystemNode[];
+  byId: Map<string, FileSystemNode>;
+  byParent: Map<string | null, FileSystemNode[]>;
+};
+export declare function buildFileSystemIndex(nodes: FileSystemNode[]): FileSystemIndex;
+export declare function fsNode(ix: FileSystemIndex, id: string): FileSystemNode | undefined;
+/** Direct children, already sorted. Returns a shared array — treat it as read-only. */
+export declare function fsChildren(ix: FileSystemIndex, id: string | null): FileSystemNode[];
+/**
+ * Every ancestor of `id`, root first, NOT including the node itself. The breadcrumb above a listing
+ * and the location under a row are both this list, formatted differently.
+ */
+export declare function fsAncestors(ix: FileSystemIndex, id: string): FileSystemNode[];
+/** The node and its ancestors, root first — the trail a breadcrumb renders. */
+export declare function fsTrail(ix: FileSystemIndex, id: string): FileSystemNode[];
+/** Every descendant of `id`, depth-first in listing order. */
+export declare function fsDescendants(ix: FileSystemIndex, id: string): FileSystemNode[];
+/**
+ * A node's address as a path string.
+ *
+ * The root is dropped by default: a shell that names the root elsewhere — in a switcher, say — would
+ * be repeating it on every row for no gain. Pass `{withRoot: true}` where it is not otherwise shown.
+ */
+export declare function fsPath(ix: FileSystemIndex, id: string, opts?: {
+  withRoot?: boolean;
+}): string;
+/** The path of a node's PARENT — what "where does this live?" means on a listing row. */
+export declare function fsFolderPath(ix: FileSystemIndex, id: string, opts?: {
+  withRoot?: boolean;
+}): string;
+/**
+ * A file's own tags PLUS every tag on the folders and project above it.
+ *
+ * Tags inherit because that is what the facet is asked to mean: a project tagged "riyadh" makes every
+ * file under it a file in Riyadh, and a facet answering "no files" for a tag visible on screen would
+ * be broken. Counts and matches come from this one function, so the rail can never offer a value that
+ * finds nothing.
+ */
+export declare function fsEffectiveTags(ix: FileSystemIndex, id: string): string[];
+/** The file node addressing a record, found by a predicate the host supplies. */
+export declare function fsFindByRef(ix: FileSystemIndex, matches: (ref: unknown) => boolean): FileSystemNode | undefined;
+/**
+ * What a listing shows: the projects and files live under `folderId` (or under the root), narrowed by
+ * the facets. Projects first, then files, each run newest first.
+ *
+ * PROJECTS and FILES, not plain folders. A project is a place you go — opening one changes the page —
+ * so it earns a row. A plain folder does not: the folder a file sits in is already printed under its
+ * name, and a folder row re-listing what is already visible would be a detour.
+ */
+export declare function fsQuery(ix: FileSystemIndex, opts: {
+  rootId: string;
+  /** Narrow to one folder's subtree. Omit for everything under the root. */
+  folderId?: string | null;
+  query?: string;
+  types?: string[];
+  projectIds?: string[];
+  tags?: string[];
+}): FileSystemNode[];
+/**
+ * One folder's DIRECT children — folders first, then files — for a surface that walks the hierarchy
+ * rather than flattening it.
+ *
+ * The all-files listing flattens on purpose: it answers "where is this?" with a path under every row.
+ * Inside a project the question is the opposite — "what is in here?" — and a folder you cannot open is
+ * a folder you cannot file anything into, so there the hierarchy is the point.
+ */
+export declare function fsFolderListing(ix: FileSystemIndex, parentId: string): FileSystemNode[];
+/** The projects under a root. */
+export declare function fsProjects(ix: FileSystemIndex, rootId: string): FileSystemNode[];
+/** Every project under `rootId`, with how many live files sit beneath it — the Projects facet. */
+export declare function fsProjectCounts(ix: FileSystemIndex, rootId: string): {
+  id: string;
+  label: string;
+  count: number;
+}[];
+/** Every file type present under `rootId`, with its count — the Types facet. */
+export declare function fsTypeCounts(ix: FileSystemIndex, rootId: string): {
+  type: string;
+  count: number;
+}[];
+/** Every tag matching at least one live file under `rootId`, most-used first — the Tags facet. */
+export declare function fsTagCounts(ix: FileSystemIndex, rootId: string): {
+  tag: string;
+  count: number;
+}[];
+export type FileSystemDraft = {
+  name: string;
+  kind: Extract<FileSystemKind, "project" | "folder" | "file">;
+  parentId: string;
+  fileType?: string;
+  description?: string;
+  tags?: string[];
+  ref?: unknown;
+};
+/**
+ * The node a draft becomes. Returned rather than appended, so the host decides where its node array
+ * lives — the widget never owns the data it renders.
+ *
+ * Ids are generated rather than derived from the name, so the same name twice cannot collide.
+ */
+export declare function fsNodeFromDraft(draft: FileSystemDraft, id: string): FileSystemNode;
+//#endregion
+//# sourceMappingURL=model.d.mts.map

package/dist/file-system/model.d.mts.map

@@ -0,0 +1 @@
+{"version":3,"file":"model.d.mts","names":[],"sources":["../../src/file-system/model.ts"],"mappings":";;;YAWY;;;;;YAMA;EACX;EACA;EACA,MAAM;IAAe;;;;;;EAKrB;;;;;EAKA;;YAGW;EACX;EACA;EACA,MAAM;;EAEN;;EAEA;;EAEA;;EAEA;EACA;EACA;;;;;EAKA;;EAEA;;;;;;;YAQW;EACX,OAAO;EACP,MAAM,YAAY;EAClB,UAAU,mBAAmB;;wBAWd,qBAAqB,OAAO,mBAAmB;wBAa/C,OAAO,IAAI,iBAAiB,aAAa;;wBAKzC,WAAW,IAAI,iBAAiB,oBAAoB;;;;;wBAQpD,YAAY,IAAI,iBAAiB,aAAa;;wBAgB9C,QAAQ,IAAI,iBAAiB,aAAa;;wBAM1C,cAAc,IAAI,iBAAiB,aAAa;;;;;;;wBAkBhD,OAAO,IAAI,iBAAiB,YAAY;EAAQ;;;wBAOhD,aAAa,IAAI,iBAAiB,YAAY;EAAQ;;;;;;;;;;wBAatD,gBAAgB,IAAI,iBAAiB;;wBASrC,YAAY,IAAI,iBAAiB,UAAU,2BAA2B;;;;;;;;;wBActE,QACf,IAAI,iBACJ;EACC;;EAEA;EACA;EACA;EACA;EACA;IAEC;;;;;;;;;wBAyCa,gBAAgB,IAAI,iBAAiB,mBAAmB;;wBAKxD,WAAW,IAAI,iBAAiB,iBAAiB;;wBAKjD,gBAAgB,IAAI,iBAAiB;EAAkB;EAAY;EAAe;;;wBASlF,aAAa,IAAI,iBAAiB;EAAkB;EAAc;;;wBAUlE,YAAY,IAAI,iBAAiB;EAAkB;EAAa;;YAapE;EACX;EACA,MAAM,QAAQ;EACd;EACA;EACA;EACA;EACA;;;;;;;;wBASe,gBAAgB,OAAO,iBAAiB,aAAa"}

package/dist/file-system/model.mjs

@@ -0,0 +1,200 @@
+//#region src/file-system/model.ts
+/** Folders first, then files; each run alphabetical, case- and accent-insensitive. */
+function compareNodes(a, b) {
+	const aLeaf = a.kind === "file" ? 1 : 0;
+	const bLeaf = b.kind === "file" ? 1 : 0;
+	if (aLeaf !== bLeaf) return aLeaf - bLeaf;
+	return a.name.localeCompare(b.name, void 0, { sensitivity: "base" });
+}
+function buildFileSystemIndex(nodes) {
+	const byId = new Map(nodes.map((n) => [n.id, n]));
+	const byParent = /* @__PURE__ */ new Map();
+	for (const n of nodes) {
+		const bucket = byParent.get(n.parentId);
+		if (bucket) bucket.push(n);
+		else byParent.set(n.parentId, [n]);
+	}
+	for (const bucket of byParent.values()) bucket.sort(compareNodes);
+	return {
+		nodes,
+		byId,
+		byParent
+	};
+}
+function fsNode(ix, id) {
+	return ix.byId.get(id);
+}
+/** Direct children, already sorted. Returns a shared array — treat it as read-only. */
+function fsChildren(ix, id) {
+	return ix.byParent.get(id) ?? [];
+}
+/**
+* Every ancestor of `id`, root first, NOT including the node itself. The breadcrumb above a listing
+* and the location under a row are both this list, formatted differently.
+*/
+function fsAncestors(ix, id) {
+	const out = [];
+	let cur = ix.byId.get(id)?.parentId ?? null;
+	const seen = /* @__PURE__ */ new Set();
+	while (cur && !seen.has(cur)) {
+		seen.add(cur);
+		const node = ix.byId.get(cur);
+		if (!node) break;
+		out.unshift(node);
+		cur = node.parentId;
+	}
+	return out;
+}
+/** The node and its ancestors, root first — the trail a breadcrumb renders. */
+function fsTrail(ix, id) {
+	const node = ix.byId.get(id);
+	return node ? [...fsAncestors(ix, id), node] : [];
+}
+/** Every descendant of `id`, depth-first in listing order. */
+function fsDescendants(ix, id) {
+	const out = [];
+	const walk = (parentId) => {
+		for (const child of fsChildren(ix, parentId)) {
+			out.push(child);
+			if (child.kind !== "file") walk(child.id);
+		}
+	};
+	walk(id);
+	return out;
+}
+/**
+* A node's address as a path string.
+*
+* The root is dropped by default: a shell that names the root elsewhere — in a switcher, say — would
+* be repeating it on every row for no gain. Pass `{withRoot: true}` where it is not otherwise shown.
+*/
+function fsPath(ix, id, opts) {
+	const trail = fsTrail(ix, id);
+	return `/${(opts?.withRoot ? trail : trail.filter((n) => n.kind !== "root")).map((n) => n.name).join("/")}`;
+}
+/** The path of a node's PARENT — what "where does this live?" means on a listing row. */
+function fsFolderPath(ix, id, opts) {
+	const ancestors = opts?.withRoot ? fsAncestors(ix, id) : fsAncestors(ix, id).filter((n) => n.kind !== "root");
+	return ancestors.length === 0 ? "/" : `/${ancestors.map((n) => n.name).join("/")}`;
+}
+/**
+* A file's own tags PLUS every tag on the folders and project above it.
+*
+* Tags inherit because that is what the facet is asked to mean: a project tagged "riyadh" makes every
+* file under it a file in Riyadh, and a facet answering "no files" for a tag visible on screen would
+* be broken. Counts and matches come from this one function, so the rail can never offer a value that
+* finds nothing.
+*/
+function fsEffectiveTags(ix, id) {
+	const node = ix.byId.get(id);
+	if (!node) return [];
+	const out = new Set(node.tags ?? []);
+	for (const ancestor of fsAncestors(ix, id)) for (const tag of ancestor.tags ?? []) out.add(tag);
+	return [...out];
+}
+/** The file node addressing a record, found by a predicate the host supplies. */
+function fsFindByRef(ix, matches) {
+	return ix.nodes.find((n) => n.ref !== void 0 && matches(n.ref));
+}
+/**
+* What a listing shows: the projects and files live under `folderId` (or under the root), narrowed by
+* the facets. Projects first, then files, each run newest first.
+*
+* PROJECTS and FILES, not plain folders. A project is a place you go — opening one changes the page —
+* so it earns a row. A plain folder does not: the folder a file sits in is already printed under its
+* name, and a folder row re-listing what is already visible would be a detour.
+*/
+function fsQuery(ix, opts) {
+	const { rootId, folderId, query, types, projectIds, tags } = opts;
+	const pool = fsDescendants(ix, folderId ?? rootId);
+	const q = query?.trim().toLowerCase() ?? "";
+	return [...pool.filter((n) => {
+		if (n.trashed) return false;
+		if (n.kind !== "file" && n.kind !== "project") return false;
+		if (types?.length && (n.kind !== "file" || !n.fileType || !types.includes(n.fileType))) return false;
+		if (tags?.length) {
+			const effective = fsEffectiveTags(ix, n.id);
+			if (!tags.some((t) => effective.includes(t))) return false;
+		}
+		if (projectIds?.length) {
+			const project = n.kind === "project" ? n : fsAncestors(ix, n.id).find((a) => a.kind === "project");
+			if (!project || !projectIds.includes(project.id)) return false;
+		}
+		if (q && !n.name.toLowerCase().includes(q) && !fsFolderPath(ix, n.id).toLowerCase().includes(q)) return false;
+		return true;
+	})].sort((a, b) => {
+		const rank = (n) => n.kind === "project" ? 0 : 1;
+		return rank(a) - rank(b) || b.updatedTs - a.updatedTs;
+	});
+}
+/**
+* One folder's DIRECT children — folders first, then files — for a surface that walks the hierarchy
+* rather than flattening it.
+*
+* The all-files listing flattens on purpose: it answers "where is this?" with a path under every row.
+* Inside a project the question is the opposite — "what is in here?" — and a folder you cannot open is
+* a folder you cannot file anything into, so there the hierarchy is the point.
+*/
+function fsFolderListing(ix, parentId) {
+	return fsChildren(ix, parentId).filter((n) => !n.trashed && n.kind !== "root" && n.kind !== "project");
+}
+/** The projects under a root. */
+function fsProjects(ix, rootId) {
+	return fsChildren(ix, rootId).filter((n) => n.kind === "project");
+}
+/** Every project under `rootId`, with how many live files sit beneath it — the Projects facet. */
+function fsProjectCounts(ix, rootId) {
+	return fsProjects(ix, rootId).map((project) => ({
+		id: project.id,
+		label: project.name,
+		count: fsDescendants(ix, project.id).filter((n) => n.kind === "file" && !n.trashed).length
+	}));
+}
+/** Every file type present under `rootId`, with its count — the Types facet. */
+function fsTypeCounts(ix, rootId) {
+	const counts = /* @__PURE__ */ new Map();
+	for (const n of fsDescendants(ix, rootId)) {
+		if (n.kind !== "file" || !n.fileType || n.trashed) continue;
+		counts.set(n.fileType, (counts.get(n.fileType) ?? 0) + 1);
+	}
+	return [...counts.entries()].map(([type, count]) => ({
+		type,
+		count
+	})).sort((a, b) => b.count - a.count);
+}
+/** Every tag matching at least one live file under `rootId`, most-used first — the Tags facet. */
+function fsTagCounts(ix, rootId) {
+	const counts = /* @__PURE__ */ new Map();
+	for (const n of fsDescendants(ix, rootId)) {
+		if (n.kind !== "file" || n.trashed) continue;
+		for (const tag of fsEffectiveTags(ix, n.id)) counts.set(tag, (counts.get(tag) ?? 0) + 1);
+	}
+	return [...counts.entries()].map(([tag, count]) => ({
+		tag,
+		count
+	})).sort((a, b) => b.count - a.count || a.tag.localeCompare(b.tag));
+}
+/**
+* The node a draft becomes. Returned rather than appended, so the host decides where its node array
+* lives — the widget never owns the data it renders.
+*
+* Ids are generated rather than derived from the name, so the same name twice cannot collide.
+*/
+function fsNodeFromDraft(draft, id) {
+	return {
+		id,
+		name: draft.name,
+		kind: draft.kind,
+		parentId: draft.parentId,
+		updatedAt: "Just now",
+		updatedTs: Number.MAX_SAFE_INTEGER - Math.floor(Math.random() * 1e3),
+		...draft.fileType ? { fileType: draft.fileType } : {},
+		...draft.description ? { description: draft.description } : {},
+		...draft.tags?.length ? { tags: draft.tags } : {},
+		...draft.ref !== void 0 ? { ref: draft.ref } : {}
+	};
+}
+//#endregion
+export { buildFileSystemIndex, fsAncestors, fsChildren, fsDescendants, fsEffectiveTags, fsFindByRef, fsFolderListing, fsFolderPath, fsNode, fsNodeFromDraft, fsPath, fsProjectCounts, fsProjects, fsQuery, fsTagCounts, fsTrail, fsTypeCounts };
+
+//# sourceMappingURL=model.mjs.map

package/dist/file-system/model.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"model.mjs","names":[],"sources":["../../src/file-system/model.ts"],"sourcesContent":["import type {ComponentType} from \"react\";\n\n// The file system's data model and every query over it — pure, and knowing nothing about any\n// particular product's records.\n//\n// A widget cannot own a fixture. So nodes arrive as a prop, an INDEX is derived from them once, and\n// every function here takes that index. What a \"file\" IS comes from the same direction: the host\n// declares its own file types, with their own labels, icons and tints, and a node names one by id.\n// Nothing in this file mentions a pipeline.\n\n/** What a node IS. Only `file` carries a `ref`; the other three are containers. */\nexport type FileSystemKind = \"root\" | \"project\" | \"folder\" | \"file\";\n\n/**\n * One file type the host offers — the label, mark and tint a node of that type is shown with, and\n * optionally the app that owns its records.\n */\nexport type FileSystemFileType = {\n\tid: string;\n\tlabel: string;\n\ticon: ComponentType<{className?: string}>;\n\t/**\n\t * Background + foreground classes for the tinted square the icon sits in, so a kind is legible\n\t * before its name is read. Omit for a neutral mark.\n\t */\n\ttone?: string;\n\t/**\n\t * The app that owns records of this type, named. When set, creating one is understood to create a\n\t * record there and the create dialog says so; when not, the file is a place and nothing more.\n\t */\n\tapp?: string;\n};\n\nexport type FileSystemNode = {\n\tid: string;\n\tname: string;\n\tkind: FileSystemKind;\n\t/** `null` only for a root. */\n\tparentId: string | null;\n\t/** Display string, not a timestamp — the host formats dates the way the rest of its product does. */\n\tupdatedAt: string;\n\t/** Sort key for the listing's Last modified column. Higher is newer; units are the host's own. */\n\tupdatedTs: number;\n\t/** A file type id, from the host's `fileTypes`. */\n\tfileType?: string;\n\tdescription?: string;\n\ttags?: string[];\n\t/**\n\t * Whatever the host needs to reopen the record this file addresses. Opaque here: the widget only\n\t * ever hands it back, and asks the host — through `openLabel` — whether it leads anywhere.\n\t */\n\tref?: unknown;\n\t/** Retired: still resolvable by id, never listed. */\n\ttrashed?: boolean;\n};\n\n/**\n * The derived lookups every surface reads. Built once per node array: two indexes down the hierarchy\n * and one back up it, so \"which folder is this record in?\" is a map hit rather than a walk of the\n * whole hierarchy on every listing row.\n */\nexport type FileSystemIndex = {\n\tnodes: FileSystemNode[];\n\tbyId: Map<string, FileSystemNode>;\n\tbyParent: Map<string | null, FileSystemNode[]>;\n};\n\n/** Folders first, then files; each run alphabetical, case- and accent-insensitive. */\nfunction compareNodes(a: FileSystemNode, b: FileSystemNode) {\n\tconst aLeaf = a.kind === \"file\" ? 1 : 0;\n\tconst bLeaf = b.kind === \"file\" ? 1 : 0;\n\tif (aLeaf !== bLeaf) return aLeaf - bLeaf;\n\treturn a.name.localeCompare(b.name, undefined, {sensitivity: \"base\"});\n}\n\nexport function buildFileSystemIndex(nodes: FileSystemNode[]): FileSystemIndex {\n\tconst byId = new Map(nodes.map((n) => [n.id, n]));\n\tconst byParent = new Map<string | null, FileSystemNode[]>();\n\tfor (const n of nodes) {\n\t\tconst bucket = byParent.get(n.parentId);\n\t\tif (bucket) bucket.push(n);\n\t\telse byParent.set(n.parentId, [n]);\n\t}\n\t// The order every file browser uses, applied once here so no caller has to remember it.\n\tfor (const bucket of byParent.values()) bucket.sort(compareNodes);\n\treturn {nodes, byId, byParent};\n}\n\nexport function fsNode(ix: FileSystemIndex, id: string): FileSystemNode | undefined {\n\treturn ix.byId.get(id);\n}\n\n/** Direct children, already sorted. Returns a shared array — treat it as read-only. */\nexport function fsChildren(ix: FileSystemIndex, id: string | null): FileSystemNode[] {\n\treturn ix.byParent.get(id) ?? [];\n}\n\n/**\n * Every ancestor of `id`, root first, NOT including the node itself. The breadcrumb above a listing\n * and the location under a row are both this list, formatted differently.\n */\nexport function fsAncestors(ix: FileSystemIndex, id: string): FileSystemNode[] {\n\tconst out: FileSystemNode[] = [];\n\tlet cur = ix.byId.get(id)?.parentId ?? null;\n\t// Guard against a malformed node array cycling forever rather than trusting the data blindly.\n\tconst seen = new Set<string>();\n\twhile (cur && !seen.has(cur)) {\n\t\tseen.add(cur);\n\t\tconst node = ix.byId.get(cur);\n\t\tif (!node) break;\n\t\tout.unshift(node);\n\t\tcur = node.parentId;\n\t}\n\treturn out;\n}\n\n/** The node and its ancestors, root first — the trail a breadcrumb renders. */\nexport function fsTrail(ix: FileSystemIndex, id: string): FileSystemNode[] {\n\tconst node = ix.byId.get(id);\n\treturn node ? [...fsAncestors(ix, id), node] : [];\n}\n\n/** Every descendant of `id`, depth-first in listing order. */\nexport function fsDescendants(ix: FileSystemIndex, id: string): FileSystemNode[] {\n\tconst out: FileSystemNode[] = [];\n\tconst walk = (parentId: string) => {\n\t\tfor (const child of fsChildren(ix, parentId)) {\n\t\t\tout.push(child);\n\t\t\tif (child.kind !== \"file\") walk(child.id);\n\t\t}\n\t};\n\twalk(id);\n\treturn out;\n}\n\n/**\n * A node's address as a path string.\n *\n * The root is dropped by default: a shell that names the root elsewhere — in a switcher, say — would\n * be repeating it on every row for no gain. Pass `{withRoot: true}` where it is not otherwise shown.\n */\nexport function fsPath(ix: FileSystemIndex, id: string, opts?: {withRoot?: boolean}): string {\n\tconst trail = fsTrail(ix, id);\n\tconst segments = opts?.withRoot ? trail : trail.filter((n) => n.kind !== \"root\");\n\treturn `/${segments.map((n) => n.name).join(\"/\")}`;\n}\n\n/** The path of a node's PARENT — what \"where does this live?\" means on a listing row. */\nexport function fsFolderPath(ix: FileSystemIndex, id: string, opts?: {withRoot?: boolean}): string {\n\tconst ancestors = opts?.withRoot ? fsAncestors(ix, id) : fsAncestors(ix, id).filter((n) => n.kind !== \"root\");\n\treturn ancestors.length === 0 ? \"/\" : `/${ancestors.map((n) => n.name).join(\"/\")}`;\n}\n\n/**\n * A file's own tags PLUS every tag on the folders and project above it.\n *\n * Tags inherit because that is what the facet is asked to mean: a project tagged \"riyadh\" makes every\n * file under it a file in Riyadh, and a facet answering \"no files\" for a tag visible on screen would\n * be broken. Counts and matches come from this one function, so the rail can never offer a value that\n * finds nothing.\n */\nexport function fsEffectiveTags(ix: FileSystemIndex, id: string): string[] {\n\tconst node = ix.byId.get(id);\n\tif (!node) return [];\n\tconst out = new Set(node.tags ?? []);\n\tfor (const ancestor of fsAncestors(ix, id)) for (const tag of ancestor.tags ?? []) out.add(tag);\n\treturn [...out];\n}\n\n/** The file node addressing a record, found by a predicate the host supplies. */\nexport function fsFindByRef(ix: FileSystemIndex, matches: (ref: unknown) => boolean): FileSystemNode | undefined {\n\treturn ix.nodes.find((n) => n.ref !== undefined && matches(n.ref));\n}\n\n// ─── Queries the surfaces run ────────────────────────────────────────────────\n\n/**\n * What a listing shows: the projects and files live under `folderId` (or under the root), narrowed by\n * the facets. Projects first, then files, each run newest first.\n *\n * PROJECTS and FILES, not plain folders. A project is a place you go — opening one changes the page —\n * so it earns a row. A plain folder does not: the folder a file sits in is already printed under its\n * name, and a folder row re-listing what is already visible would be a detour.\n */\nexport function fsQuery(\n\tix: FileSystemIndex,\n\topts: {\n\t\trootId: string;\n\t\t/** Narrow to one folder's subtree. Omit for everything under the root. */\n\t\tfolderId?: string | null;\n\t\tquery?: string;\n\t\ttypes?: string[];\n\t\tprojectIds?: string[];\n\t\ttags?: string[];\n\t},\n): FileSystemNode[] {\n\tconst {rootId, folderId, query, types, projectIds, tags} = opts;\n\tconst pool = fsDescendants(ix, folderId ?? rootId);\n\tconst q = query?.trim().toLowerCase() ?? \"\";\n\n\tconst rows = pool.filter((n) => {\n\t\tif (n.trashed) return false;\n\t\tif (n.kind !== \"file\" && n.kind !== \"project\") return false;\n\t\t// A type is a property of a file; a project has none, so it cannot survive that filter.\n\t\tif (types?.length && (n.kind !== \"file\" || !n.fileType || !types.includes(n.fileType))) return false;\n\t\tif (tags?.length) {\n\t\t\tconst effective = fsEffectiveTags(ix, n.id);\n\t\t\tif (!tags.some((t) => effective.includes(t))) return false;\n\t\t}\n\t\tif (projectIds?.length) {\n\t\t\t// A project row answers for itself; a file answers through the project above it.\n\t\t\tconst project = n.kind === \"project\" ? n : fsAncestors(ix, n.id).find((a) => a.kind === \"project\");\n\t\t\tif (!project || !projectIds.includes(project.id)) return false;\n\t\t}\n\t\t// A query matches the name OR the folder it sits in, so a folder's name finds everything filed\n\t\t// under it without the folder being a row.\n\t\tif (q && !n.name.toLowerCase().includes(q) && !fsFolderPath(ix, n.id).toLowerCase().includes(q)) return false;\n\t\treturn true;\n\t});\n\n\t// Projects lead: they are the way into the rest of the list, so burying them among the files they\n\t// contain would hide the entry points. Within each run, newest first.\n\treturn [...rows].sort((a, b) => {\n\t\tconst rank = (n: FileSystemNode) => (n.kind === \"project\" ? 0 : 1);\n\t\treturn rank(a) - rank(b) || b.updatedTs - a.updatedTs;\n\t});\n}\n\n/**\n * One folder's DIRECT children — folders first, then files — for a surface that walks the hierarchy\n * rather than flattening it.\n *\n * The all-files listing flattens on purpose: it answers \"where is this?\" with a path under every row.\n * Inside a project the question is the opposite — \"what is in here?\" — and a folder you cannot open is\n * a folder you cannot file anything into, so there the hierarchy is the point.\n */\nexport function fsFolderListing(ix: FileSystemIndex, parentId: string): FileSystemNode[] {\n\treturn fsChildren(ix, parentId).filter((n) => !n.trashed && n.kind !== \"root\" && n.kind !== \"project\");\n}\n\n/** The projects under a root. */\nexport function fsProjects(ix: FileSystemIndex, rootId: string): FileSystemNode[] {\n\treturn fsChildren(ix, rootId).filter((n) => n.kind === \"project\");\n}\n\n/** Every project under `rootId`, with how many live files sit beneath it — the Projects facet. */\nexport function fsProjectCounts(ix: FileSystemIndex, rootId: string): {id: string; label: string; count: number}[] {\n\treturn fsProjects(ix, rootId).map((project) => ({\n\t\tid: project.id,\n\t\tlabel: project.name,\n\t\tcount: fsDescendants(ix, project.id).filter((n) => n.kind === \"file\" && !n.trashed).length,\n\t}));\n}\n\n/** Every file type present under `rootId`, with its count — the Types facet. */\nexport function fsTypeCounts(ix: FileSystemIndex, rootId: string): {type: string; count: number}[] {\n\tconst counts = new Map<string, number>();\n\tfor (const n of fsDescendants(ix, rootId)) {\n\t\tif (n.kind !== \"file\" || !n.fileType || n.trashed) continue;\n\t\tcounts.set(n.fileType, (counts.get(n.fileType) ?? 0) + 1);\n\t}\n\treturn [...counts.entries()].map(([type, count]) => ({type, count})).sort((a, b) => b.count - a.count);\n}\n\n/** Every tag matching at least one live file under `rootId`, most-used first — the Tags facet. */\nexport function fsTagCounts(ix: FileSystemIndex, rootId: string): {tag: string; count: number}[] {\n\tconst counts = new Map<string, number>();\n\tfor (const n of fsDescendants(ix, rootId)) {\n\t\tif (n.kind !== \"file\" || n.trashed) continue;\n\t\tfor (const tag of fsEffectiveTags(ix, n.id)) counts.set(tag, (counts.get(tag) ?? 0) + 1);\n\t}\n\treturn [...counts.entries()]\n\t\t.map(([tag, count]) => ({tag, count}))\n\t\t.sort((a, b) => b.count - a.count || a.tag.localeCompare(b.tag));\n}\n\n// ─── Creating ────────────────────────────────────────────────────────────────\n\nexport type FileSystemDraft = {\n\tname: string;\n\tkind: Extract<FileSystemKind, \"project\" | \"folder\" | \"file\">;\n\tparentId: string;\n\tfileType?: string;\n\tdescription?: string;\n\ttags?: string[];\n\tref?: unknown;\n};\n\n/**\n * The node a draft becomes. Returned rather than appended, so the host decides where its node array\n * lives — the widget never owns the data it renders.\n *\n * Ids are generated rather than derived from the name, so the same name twice cannot collide.\n */\nexport function fsNodeFromDraft(draft: FileSystemDraft, id: string): FileSystemNode {\n\treturn {\n\t\tid,\n\t\tname: draft.name,\n\t\tkind: draft.kind,\n\t\tparentId: draft.parentId,\n\t\tupdatedAt: \"Just now\",\n\t\t// Above any seeded stamp, so a new node sorts to the top of a newest-first listing.\n\t\tupdatedTs: Number.MAX_SAFE_INTEGER - Math.floor(Math.random() * 1000),\n\t\t...(draft.fileType ? {fileType: draft.fileType} : {}),\n\t\t...(draft.description ? {description: draft.description} : {}),\n\t\t...(draft.tags?.length ? {tags: draft.tags} : {}),\n\t\t...(draft.ref !== undefined ? {ref: draft.ref} : {}),\n\t};\n}\n"],"mappings":";;AAoEA,SAAS,aAAa,GAAmB,GAAmB;CAC3D,MAAM,QAAQ,EAAE,SAAS,SAAS,IAAI;CACtC,MAAM,QAAQ,EAAE,SAAS,SAAS,IAAI;CACtC,IAAI,UAAU,OAAO,OAAO,QAAQ;CACpC,OAAO,EAAE,KAAK,cAAc,EAAE,MAAM,KAAA,GAAW,EAAC,aAAa,OAAM,CAAC;AACrE;AAEA,SAAgB,qBAAqB,OAA0C;CAC9E,MAAM,OAAO,IAAI,IAAI,MAAM,KAAK,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;CAChD,MAAM,2BAAW,IAAI,IAAqC;CAC1D,KAAK,MAAM,KAAK,OAAO;EACtB,MAAM,SAAS,SAAS,IAAI,EAAE,QAAQ;EACtC,IAAI,QAAQ,OAAO,KAAK,CAAC;OACpB,SAAS,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC;CAClC;CAEA,KAAK,MAAM,UAAU,SAAS,OAAO,GAAG,OAAO,KAAK,YAAY;CAChE,OAAO;EAAC;EAAO;EAAM;CAAQ;AAC9B;AAEA,SAAgB,OAAO,IAAqB,IAAwC;CACnF,OAAO,GAAG,KAAK,IAAI,EAAE;AACtB;;AAGA,SAAgB,WAAW,IAAqB,IAAqC;CACpF,OAAO,GAAG,SAAS,IAAI,EAAE,KAAK,CAAC;AAChC;;;;;AAMA,SAAgB,YAAY,IAAqB,IAA8B;CAC9E,MAAM,MAAwB,CAAC;CAC/B,IAAI,MAAM,GAAG,KAAK,IAAI,EAAE,CAAC,EAAE,YAAY;CAEvC,MAAM,uBAAO,IAAI,IAAY;CAC7B,OAAO,OAAO,CAAC,KAAK,IAAI,GAAG,GAAG;EAC7B,KAAK,IAAI,GAAG;EACZ,MAAM,OAAO,GAAG,KAAK,IAAI,GAAG;EAC5B,IAAI,CAAC,MAAM;EACX,IAAI,QAAQ,IAAI;EAChB,MAAM,KAAK;CACZ;CACA,OAAO;AACR;;AAGA,SAAgB,QAAQ,IAAqB,IAA8B;CAC1E,MAAM,OAAO,GAAG,KAAK,IAAI,EAAE;CAC3B,OAAO,OAAO,CAAC,GAAG,YAAY,IAAI,EAAE,GAAG,IAAI,IAAI,CAAC;AACjD;;AAGA,SAAgB,cAAc,IAAqB,IAA8B;CAChF,MAAM,MAAwB,CAAC;CAC/B,MAAM,QAAQ,aAAqB;EAClC,KAAK,MAAM,SAAS,WAAW,IAAI,QAAQ,GAAG;GAC7C,IAAI,KAAK,KAAK;GACd,IAAI,MAAM,SAAS,QAAQ,KAAK,MAAM,EAAE;EACzC;CACD;CACA,KAAK,EAAE;CACP,OAAO;AACR;;;;;;;AAQA,SAAgB,OAAO,IAAqB,IAAY,MAAqC;CAC5F,MAAM,QAAQ,QAAQ,IAAI,EAAE;CAE5B,OAAO,KADU,MAAM,WAAW,QAAQ,MAAM,QAAQ,MAAM,EAAE,SAAS,MAAM,EAAA,CAC3D,KAAK,MAAM,EAAE,IAAI,CAAC,CAAC,KAAK,GAAG;AAChD;;AAGA,SAAgB,aAAa,IAAqB,IAAY,MAAqC;CAClG,MAAM,YAAY,MAAM,WAAW,YAAY,IAAI,EAAE,IAAI,YAAY,IAAI,EAAE,CAAC,CAAC,QAAQ,MAAM,EAAE,SAAS,MAAM;CAC5G,OAAO,UAAU,WAAW,IAAI,MAAM,IAAI,UAAU,KAAK,MAAM,EAAE,IAAI,CAAC,CAAC,KAAK,GAAG;AAChF;;;;;;;;;AAUA,SAAgB,gBAAgB,IAAqB,IAAsB;CAC1E,MAAM,OAAO,GAAG,KAAK,IAAI,EAAE;CAC3B,IAAI,CAAC,MAAM,OAAO,CAAC;CACnB,MAAM,MAAM,IAAI,IAAI,KAAK,QAAQ,CAAC,CAAC;CACnC,KAAK,MAAM,YAAY,YAAY,IAAI,EAAE,GAAG,KAAK,MAAM,OAAO,SAAS,QAAQ,CAAC,GAAG,IAAI,IAAI,GAAG;CAC9F,OAAO,CAAC,GAAG,GAAG;AACf;;AAGA,SAAgB,YAAY,IAAqB,SAAgE;CAChH,OAAO,GAAG,MAAM,MAAM,MAAM,EAAE,QAAQ,KAAA,KAAa,QAAQ,EAAE,GAAG,CAAC;AAClE;;;;;;;;;AAYA,SAAgB,QACf,IACA,MASmB;CACnB,MAAM,EAAC,QAAQ,UAAU,OAAO,OAAO,YAAY,SAAQ;CAC3D,MAAM,OAAO,cAAc,IAAI,YAAY,MAAM;CACjD,MAAM,IAAI,OAAO,KAAK,CAAC,CAAC,YAAY,KAAK;CAwBzC,OAAO,CAAC,GAtBK,KAAK,QAAQ,MAAM;EAC/B,IAAI,EAAE,SAAS,OAAO;EACtB,IAAI,EAAE,SAAS,UAAU,EAAE,SAAS,WAAW,OAAO;EAEtD,IAAI,OAAO,WAAW,EAAE,SAAS,UAAU,CAAC,EAAE,YAAY,CAAC,MAAM,SAAS,EAAE,QAAQ,IAAI,OAAO;EAC/F,IAAI,MAAM,QAAQ;GACjB,MAAM,YAAY,gBAAgB,IAAI,EAAE,EAAE;GAC1C,IAAI,CAAC,KAAK,MAAM,MAAM,UAAU,SAAS,CAAC,CAAC,GAAG,OAAO;EACtD;EACA,IAAI,YAAY,QAAQ;GAEvB,MAAM,UAAU,EAAE,SAAS,YAAY,IAAI,YAAY,IAAI,EAAE,EAAE,CAAC,CAAC,MAAM,MAAM,EAAE,SAAS,SAAS;GACjG,IAAI,CAAC,WAAW,CAAC,WAAW,SAAS,QAAQ,EAAE,GAAG,OAAO;EAC1D;EAGA,IAAI,KAAK,CAAC,EAAE,KAAK,YAAY,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,aAAa,IAAI,EAAE,EAAE,CAAC,CAAC,YAAY,CAAC,CAAC,SAAS,CAAC,GAAG,OAAO;EACxG,OAAO;CACR,CAIc,CAAC,CAAC,CAAC,MAAM,GAAG,MAAM;EAC/B,MAAM,QAAQ,MAAuB,EAAE,SAAS,YAAY,IAAI;EAChE,OAAO,KAAK,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,YAAY,EAAE;CAC7C,CAAC;AACF;;;;;;;;;AAUA,SAAgB,gBAAgB,IAAqB,UAAoC;CACxF,OAAO,WAAW,IAAI,QAAQ,CAAC,CAAC,QAAQ,MAAM,CAAC,EAAE,WAAW,EAAE,SAAS,UAAU,EAAE,SAAS,SAAS;AACtG;;AAGA,SAAgB,WAAW,IAAqB,QAAkC;CACjF,OAAO,WAAW,IAAI,MAAM,CAAC,CAAC,QAAQ,MAAM,EAAE,SAAS,SAAS;AACjE;;AAGA,SAAgB,gBAAgB,IAAqB,QAA8D;CAClH,OAAO,WAAW,IAAI,MAAM,CAAC,CAAC,KAAK,aAAa;EAC/C,IAAI,QAAQ;EACZ,OAAO,QAAQ;EACf,OAAO,cAAc,IAAI,QAAQ,EAAE,CAAC,CAAC,QAAQ,MAAM,EAAE,SAAS,UAAU,CAAC,EAAE,OAAO,CAAC,CAAC;CACrF,EAAE;AACH;;AAGA,SAAgB,aAAa,IAAqB,QAAiD;CAClG,MAAM,yBAAS,IAAI,IAAoB;CACvC,KAAK,MAAM,KAAK,cAAc,IAAI,MAAM,GAAG;EAC1C,IAAI,EAAE,SAAS,UAAU,CAAC,EAAE,YAAY,EAAE,SAAS;EACnD,OAAO,IAAI,EAAE,WAAW,OAAO,IAAI,EAAE,QAAQ,KAAK,KAAK,CAAC;CACzD;CACA,OAAO,CAAC,GAAG,OAAO,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,YAAY;EAAC;EAAM;CAAK,EAAE,CAAC,CAAC,MAAM,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AACtG;;AAGA,SAAgB,YAAY,IAAqB,QAAgD;CAChG,MAAM,yBAAS,IAAI,IAAoB;CACvC,KAAK,MAAM,KAAK,cAAc,IAAI,MAAM,GAAG;EAC1C,IAAI,EAAE,SAAS,UAAU,EAAE,SAAS;EACpC,KAAK,MAAM,OAAO,gBAAgB,IAAI,EAAE,EAAE,GAAG,OAAO,IAAI,MAAM,OAAO,IAAI,GAAG,KAAK,KAAK,CAAC;CACxF;CACA,OAAO,CAAC,GAAG,OAAO,QAAQ,CAAC,CAAC,CAC1B,KAAK,CAAC,KAAK,YAAY;EAAC;EAAK;CAAK,EAAE,CAAC,CACrC,MAAM,GAAG,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,IAAI,cAAc,EAAE,GAAG,CAAC;AACjE;;;;;;;AAoBA,SAAgB,gBAAgB,OAAwB,IAA4B;CACnF,OAAO;EACN;EACA,MAAM,MAAM;EACZ,MAAM,MAAM;EACZ,UAAU,MAAM;EAChB,WAAW;EAEX,WAAW,OAAO,mBAAmB,KAAK,MAAM,KAAK,OAAO,IAAI,GAAI;EACpE,GAAI,MAAM,WAAW,EAAC,UAAU,MAAM,SAAQ,IAAI,CAAC;EACnD,GAAI,MAAM,cAAc,EAAC,aAAa,MAAM,YAAW,IAAI,CAAC;EAC5D,GAAI,MAAM,MAAM,SAAS,EAAC,MAAM,MAAM,KAAI,IAAI,CAAC;EAC/C,GAAI,MAAM,QAAQ,KAAA,IAAY,EAAC,KAAK,MAAM,IAAG,IAAI,CAAC;CACnD;AACD"}

package/dist/filter.d.mts

@@ -0,0 +1,92 @@
+import { PopoverContent } from "./popover.mjs";
+import * as React from "react";
+//#region src/filter.d.ts
+/** Applied filter state — keyed by category id. */
+export type FilterValue = Record<string, readonly string[]>;
+interface FilterContextValue {
+  open: boolean;
+  setOpen: (o: boolean) => void;
+  applied: FilterValue;
+  draft: FilterValue;
+  toggleDraft: (categoryId: string, optionValue: string) => void;
+  clearDraft: () => void;
+  /** Clear both draft and applied selections and commit immediately (no Apply needed). */
+  clearAll: () => void;
+  applyDraft: () => void;
+  /** Drop one applied (category, option) selection and commit immediately — what a chip's × does. */
+  removeApplied: (categoryId: string, optionValue: string) => void;
+  appliedCount: number;
+}
+declare function useFilter(): FilterContextValue;
+/**
+ * Filter context if there is one, otherwise null — for surfaces that render an applied-filter
+ * strip when wrapped in a <Filter> but must still work standalone (e.g. DataTable).
+ */
+declare function useOptionalFilter(): FilterContextValue | null;
+interface FilterProps {
+  /** Controlled applied value. */
+  value?: FilterValue;
+  /** Uncontrolled initial value. */
+  defaultValue?: FilterValue;
+  /** Fires when Apply commits the draft. */
+  onChange?: (next: FilterValue) => void;
+  children: React.ReactNode;
+}
+declare function Filter({ value, defaultValue, onChange, children }: FilterProps): import("react/jsx-runtime").JSX.Element;
+interface FilterTriggerProps extends React.ButtonHTMLAttributes<HTMLButtonElement> {
+  /** Override the default Filter icon. */
+  icon?: React.ReactNode;
+  /** Override the aria-label (defaults to "Filter" / "Filter (N active)"). */
+  "aria-label"?: string;
+  /** Hover/focus hint. Defaults to the aria-label; pass `null` to suppress it. */
+  tooltip?: React.ReactNode;
+}
+declare const FilterTrigger: React.ForwardRefExoticComponent<FilterTriggerProps & React.RefAttributes<HTMLButtonElement>>;
+interface FilterContentProps extends Omit<React.ComponentPropsWithoutRef<typeof PopoverContent>, "title"> {
+  /** Header heading (sticky). Default: "Filter". */
+  heading?: React.ReactNode;
+  /** Override footer. Default = Clear + Apply buttons wired to context. */
+  footer?: React.ReactNode;
+  /** Which category is open by default. If omitted, the first FilterCategory
+   *  child's `value` is used. Pass `null` to start with all collapsed. */
+  defaultOpenCategory?: string | null;
+  children: React.ReactNode;
+}
+declare const FilterContent: React.ForwardRefExoticComponent<FilterContentProps & React.RefAttributes<HTMLDivElement>>;
+interface FilterCategoryProps {
+  /** Category id — also used as the AccordionItem value and as the key into
+   *  `FilterValue` for selections in this category. */
+  value: string;
+  label: React.ReactNode;
+  children: React.ReactNode;
+  /** Hide the count badge in the trigger. */
+  hideCount?: boolean;
+  /**
+   * Options to show before the list starts scrolling in place. Long lists (trades, companies)
+   * would otherwise push Apply/Clear out of reach. Pass `false` to let the category grow.
+   */
+  maxVisibleOptions?: number | false;
+}
+declare function FilterCategory({ value, label, children, hideCount, maxVisibleOptions }: FilterCategoryProps): import("react/jsx-runtime").JSX.Element;
+interface FilterOptionProps {
+  value: string;
+  children: React.ReactNode;
+  disabled?: boolean;
+}
+declare function FilterOption({ value, children, disabled }: FilterOptionProps): import("react/jsx-runtime").JSX.Element;
+interface FilterChipsProps {
+  /** The applied filter value (same shape emitted by <Filter> onChange). */
+  value: FilterValue;
+  /** Remove a single (category, option) selection. */
+  onRemove: (categoryId: string, optionValue: string) => void;
+  /** When provided and more than one chip is shown, renders a "Clear all" affordance. */
+  onClear?: () => void;
+  /** Resolve a friendly label for a (categoryId, optionValue). Defaults to the raw option value. */
+  renderLabel?: (categoryId: string, optionValue: string) => React.ReactNode;
+  className?: string;
+}
+/** A wrap of removable chips for the currently-applied filter selections. Renders nothing when empty. */
+declare function FilterChips({ value, onRemove, onClear, renderLabel, className }: FilterChipsProps): import("react/jsx-runtime").JSX.Element | null;
+//#endregion
+export { Filter, FilterCategory, FilterChips, FilterContent, FilterOption, FilterTrigger, useFilter, useOptionalFilter };
+//# sourceMappingURL=filter.d.mts.map

package/dist/filter.d.mts.map

@@ -0,0 +1 @@
+{"version":3,"file":"filter.d.mts","names":[],"sources":["../src/filter.tsx"],"mappings":";;;;YA8CY,cAAc;UAEhB;EACT;EACA,UAAU;EACV,SAAS;EACT,OAAO;EACP,cAAc,oBAAoB;EAClC;;EAEA;EACA;;EAEA,gBAAgB,oBAAoB;EACpC;;iBAKQ,aAAS;;;;;iBAUT,qBAAiB;UAgBhB;;EAET,QAAQ;;EAER,eAAe;;EAEf,YAAY,MAAM;EAClB,UAAU,MAAM;;iBAGR,SAAQ,OAAO,cAAc,UAAU,YAAW,0CAAW,IAAA;UAyF5D,2BAA2B,MAAM,qBAAqB;;EAE/D,OAAO,MAAM;;EAEb;;EAEA,UAAU,MAAM;;cAGX,eAAa,MAAA,0BAAA,qBAAA,MAAA,cAAA;UA0CT,2BAA2B,KAAK,MAAM,gCAAgC;;EAE/E,UAAU,MAAM;;EAEhB,SAAS,MAAM;;;EAGf;EACA,UAAU,MAAM;;cAGX,eAAa,MAAA,0BAAA,qBAAA,MAAA,cAAA;UAwDT;;;EAGT;EACA,OAAO,MAAM;EACb,UAAU,MAAM;;EAEhB;;;;;EAKA;;iBAGQ,iBAAgB,OAAO,OAAO,UAAU,WAAW,qBAAwB,kDAAmB,IAAA;UAwC7F;EACT;EACA,UAAU,MAAM;EAChB;;iBAGQ,eAAc,OAAO,UAAU,YAAW,gDAAiB,IAAA;UAgC1D;;EAET,OAAO;;EAEP,WAAW,oBAAoB;;EAE/B;;EAEA,eAAe,oBAAoB,wBAAwB,MAAM;EACjE;;;iBAIQ,cAAa,OAAO,UAAU,SAAS,aAAa,aAAY,+CAAgB,IAAA"}