@cratis/scene.blueprint.default 4.35.0 → 4.37.0

package/dist/esm/foundation/orgModel.js

@@ -0,0 +1,99 @@
+// Copyright (c) Cratis. All rights reserved.
+// Licensed under the MIT license. See LICENSE file in the project root for full license information.
+/** A person or unit in an organization, with who they report to. */ /** Reads nodes out of a property value, dropping entries without an id and keeping the first of a repeated id. */ function readOrgNodes(value) {
+    if (!Array.isArray(value)) return [];
+    const seen = new Set();
+    return value.flatMap((entry)=>{
+        if (typeof entry !== 'object' || entry === null || Array.isArray(entry)) return [];
+        const { id, label, title, parentId } = entry;
+        if (typeof id !== 'string' || id.length === 0 || seen.has(id)) return [];
+        seen.add(id);
+        return [
+            {
+                id,
+                label: typeof label === 'string' && label.length > 0 ? label : id,
+                ...typeof title === 'string' ? {
+                    title
+                } : {},
+                ...typeof parentId === 'string' && parentId.length > 0 ? {
+                    parentId
+                } : {}
+            }
+        ];
+    });
+}
+/**
+ * Builds the tree from the flat rows a query returns.
+ *
+ * Someone whose manager is not in the data becomes a root rather than vanishing, and a reporting cycle is broken at the node that closes it
+ * - which becomes a root - so malformed data draws something and never loops. Siblings keep the order of the rows.
+ */ function buildOrgTree(nodes) {
+    const known = new Set(nodes.map((node)=>node.id));
+    const parentOf = new Map(nodes.map((node)=>[
+            node.id,
+            node.parentId !== undefined && known.has(node.parentId) && node.parentId !== node.id ? node.parentId : undefined
+        ]));
+    for (const node of nodes){
+        const path = new Set([
+            node.id
+        ]);
+        for(let current = parentOf.get(node.id); current !== undefined; current = parentOf.get(current)){
+            if (path.has(current)) {
+                parentOf.set(node.id, undefined);
+                break;
+            }
+            path.add(current);
+        }
+    }
+    const placed = new Map(nodes.map((node)=>[
+            node.id,
+            {
+                ...node,
+                children: [],
+                depth: 0
+            }
+        ]));
+    const roots = [];
+    for (const node of nodes){
+        const parent = parentOf.get(node.id);
+        if (parent === undefined) roots.push(placed.get(node.id));
+        else placed.get(parent).children.push(placed.get(node.id));
+    }
+    const assignDepth = (level, depth)=>level.forEach((node)=>{
+            node.depth = depth;
+            assignDepth(node.children, depth + 1);
+        });
+    assignDepth(roots, 1);
+    return roots;
+}
+/** The nodes that can be reached from the roots with the given expansion, in the order they are drawn. */ function visibleNodes(roots, expanded) {
+    return roots.flatMap((node)=>[
+            node,
+            ...expanded.has(node.id) ? visibleNodes(node.children, expanded) : []
+        ]);
+}
+/** The ids of every node down to a depth: what is expanded when the tree first opens. */ function expandedToDepth(roots, depth) {
+    const result = new Set();
+    const walk = (level)=>level.forEach((node)=>{
+            if (node.depth < depth && node.children.length > 0) result.add(node.id);
+            walk(node.children);
+        });
+    walk(roots);
+    return result;
+}
+/** The number of people below a node, at any depth. */ const descendantCount = (node)=>node.children.reduce((sum, child)=>sum + 1 + descendantCount(child), 0);
+/** For each node, the nodes that share its parent (itself included, in order) and its parent: what a tree needs for its set size and position, and for Left to go up. */ function placements(roots) {
+    const result = new Map();
+    const walk = (level, parent)=>level.forEach((node)=>{
+            result.set(node.id, {
+                siblings: level,
+                parent
+            });
+            walk(node.children, node);
+        });
+    walk(roots);
+    return result;
+}
+
+export { buildOrgTree, descendantCount, expandedToDepth, placements, readOrgNodes, visibleNodes };
+//# sourceMappingURL=orgModel.js.map

package/dist/esm/foundation/orgModel.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"orgModel.js","sources":["../../../foundation/orgModel.ts"],"sourcesContent":["// Copyright (c) Cratis. All rights reserved.\n// Licensed under the MIT license. See LICENSE file in the project root for full license information.\n\n/** A person or unit in an organization, with who they report to. */\nexport interface OrgNode {\n    id: string;\n    label: string;\n    title?: string;\n    parentId?: string;\n}\n\n/** A node placed in the tree. */\nexport interface OrgTreeNode extends OrgNode {\n    children: OrgTreeNode[];\n    depth: number;\n}\n\n/** Reads nodes out of a property value, dropping entries without an id and keeping the first of a repeated id. */\nexport function readOrgNodes(value: unknown): OrgNode[] {\n    if (!Array.isArray(value)) return [];\n\n    const seen = new Set<string>();\n    return value.flatMap((entry): OrgNode[] => {\n        if (typeof entry !== 'object' || entry === null || Array.isArray(entry)) return [];\n        const { id, label, title, parentId } = entry as Record<string, unknown>;\n        if (typeof id !== 'string' || id.length === 0 || seen.has(id)) return [];\n        seen.add(id);\n        return [{ id, label: typeof label === 'string' && label.length > 0 ? label : id, ...(typeof title === 'string' ? { title } : {}), ...(typeof parentId === 'string' && parentId.length > 0 ? { parentId } : {}) }];\n    });\n}\n\n/**\n * Builds the tree from the flat rows a query returns.\n *\n * Someone whose manager is not in the data becomes a root rather than vanishing, and a reporting cycle is broken at the node that closes it\n * - which becomes a root - so malformed data draws something and never loops. Siblings keep the order of the rows.\n */\nexport function buildOrgTree(nodes: OrgNode[]): OrgTreeNode[] {\n    const known = new Set(nodes.map(node => node.id));\n    const parentOf = new Map<string, string | undefined>(nodes.map(node => [node.id, node.parentId !== undefined && known.has(node.parentId) && node.parentId !== node.id ? node.parentId : undefined]));\n\n    for (const node of nodes) {\n        const path = new Set<string>([node.id]);\n        for (let current = parentOf.get(node.id); current !== undefined; current = parentOf.get(current)) {\n            if (path.has(current)) { parentOf.set(node.id, undefined); break; }\n            path.add(current);\n        }\n    }\n\n    const placed = new Map<string, OrgTreeNode>(nodes.map(node => [node.id, { ...node, children: [], depth: 0 }]));\n    const roots: OrgTreeNode[] = [];\n    for (const node of nodes) {\n        const parent = parentOf.get(node.id);\n        if (parent === undefined) roots.push(placed.get(node.id)!);\n        else placed.get(parent)!.children.push(placed.get(node.id)!);\n    }\n\n    const assignDepth = (level: OrgTreeNode[], depth: number) => level.forEach(node => { node.depth = depth; assignDepth(node.children, depth + 1); });\n    assignDepth(roots, 1);\n    return roots;\n}\n\n/** The nodes that can be reached from the roots with the given expansion, in the order they are drawn. */\nexport function visibleNodes(roots: OrgTreeNode[], expanded: ReadonlySet<string>): OrgTreeNode[] {\n    return roots.flatMap(node => [node, ...(expanded.has(node.id) ? visibleNodes(node.children, expanded) : [])]);\n}\n\n/** The ids of every node down to a depth: what is expanded when the tree first opens. */\nexport function expandedToDepth(roots: OrgTreeNode[], depth: number): Set<string> {\n    const result = new Set<string>();\n    const walk = (level: OrgTreeNode[]) => level.forEach(node => { if (node.depth < depth && node.children.length > 0) result.add(node.id); walk(node.children); });\n    walk(roots);\n    return result;\n}\n\n/** The number of people below a node, at any depth. */\nexport const descendantCount = (node: OrgTreeNode): number => node.children.reduce((sum, child) => sum + 1 + descendantCount(child), 0);\n\n/** For each node, the nodes that share its parent (itself included, in order) and its parent: what a tree needs for its set size and position, and for Left to go up. */\nexport function placements(roots: OrgTreeNode[]): Map<string, { siblings: OrgTreeNode[]; parent?: OrgTreeNode }> {\n    const result = new Map<string, { siblings: OrgTreeNode[]; parent?: OrgTreeNode }>();\n    const walk = (level: OrgTreeNode[], parent?: OrgTreeNode) => level.forEach(node => { result.set(node.id, { siblings: level, parent }); walk(node.children, node); });\n    walk(roots);\n    return result;\n}\n"],"names":["readOrgNodes","value","Array","isArray","seen","Set","flatMap","entry","id","label","title","parentId","length","has","add","buildOrgTree","nodes","known","map","node","parentOf","Map","undefined","path","current","get","set","placed","children","depth","roots","parent","push","assignDepth","level","forEach","visibleNodes","expanded","expandedToDepth","result","walk","descendantCount","reduce","sum","child","placements","siblings"],"mappings":"AAAA;AACA;AAEA,wLAeO,SAASA,aAAaC,KAAc,EAAA;AACvC,IAAA,IAAI,CAACC,KAAAA,CAAMC,OAAO,CAACF,KAAAA,CAAAA,EAAQ,OAAO,EAAE;AAEpC,IAAA,MAAMG,OAAO,IAAIC,GAAAA,EAAAA;IACjB,OAAOJ,KAAAA,CAAMK,OAAO,CAAC,CAACC,KAAAA,GAAAA;QAClB,IAAI,OAAOA,KAAAA,KAAU,QAAA,IAAYA,KAAAA,KAAU,IAAA,IAAQL,MAAMC,OAAO,CAACI,KAAAA,CAAAA,EAAQ,OAAO,EAAE;QAClF,MAAM,EAAEC,EAAE,EAAEC,KAAK,EAAEC,KAAK,EAAEC,QAAQ,EAAE,GAAGJ,KAAAA;AACvC,QAAA,IAAI,OAAOC,EAAAA,KAAO,QAAA,IAAYA,EAAAA,CAAGI,MAAM,KAAK,CAAA,IAAKR,IAAAA,CAAKS,GAAG,CAACL,EAAAA,CAAAA,EAAK,OAAO,EAAE;AACxEJ,QAAAA,IAAAA,CAAKU,GAAG,CAACN,EAAAA,CAAAA;QACT,OAAO;AAAC,YAAA;AAAEA,gBAAAA,EAAAA;AAAIC,gBAAAA,KAAAA,EAAO,OAAOA,KAAAA,KAAU,QAAA,IAAYA,MAAMG,MAAM,GAAG,IAAIH,KAAAA,GAAQD,EAAAA;gBAAI,GAAI,OAAOE,UAAU,QAAA,GAAW;AAAEA,oBAAAA;AAAM,iBAAA,GAAI,EAAE;AAAG,gBAAA,GAAI,OAAOC,QAAAA,KAAa,QAAA,IAAYA,QAAAA,CAASC,MAAM,GAAG,CAAA,GAAI;AAAED,oBAAAA;AAAS,iBAAA,GAAI;AAAI;AAAE,SAAA;AACrN,IAAA,CAAA,CAAA;AACJ;AAEA;;;;;IAMO,SAASI,YAAAA,CAAaC,KAAgB,EAAA;IACzC,MAAMC,KAAAA,GAAQ,IAAIZ,GAAAA,CAAIW,KAAAA,CAAME,GAAG,CAACC,CAAAA,IAAAA,GAAQA,IAAAA,CAAKX,EAAE,CAAA,CAAA;AAC/C,IAAA,MAAMY,WAAW,IAAIC,GAAAA,CAAgCL,MAAME,GAAG,CAACC,CAAAA,IAAAA,GAAQ;AAACA,YAAAA,IAAAA,CAAKX,EAAE;AAAEW,YAAAA,IAAAA,CAAKR,QAAQ,KAAKW,SAAAA,IAAaL,KAAAA,CAAMJ,GAAG,CAACM,IAAAA,CAAKR,QAAQ,CAAA,IAAKQ,IAAAA,CAAKR,QAAQ,KAAKQ,IAAAA,CAAKX,EAAE,GAAGW,IAAAA,CAAKR,QAAQ,GAAGW;AAAU,SAAA,CAAA,CAAA;IAElM,KAAK,MAAMH,QAAQH,KAAAA,CAAO;QACtB,MAAMO,IAAAA,GAAO,IAAIlB,GAAAA,CAAY;AAACc,YAAAA,IAAAA,CAAKX;AAAG,SAAA,CAAA;AACtC,QAAA,IAAK,IAAIgB,OAAAA,GAAUJ,QAAAA,CAASK,GAAG,CAACN,IAAAA,CAAKX,EAAE,CAAA,EAAGgB,OAAAA,KAAYF,SAAAA,EAAWE,OAAAA,GAAUJ,QAAAA,CAASK,GAAG,CAACD,OAAAA,CAAAA,CAAU;YAC9F,IAAID,IAAAA,CAAKV,GAAG,CAACW,OAAAA,CAAAA,EAAU;AAAEJ,gBAAAA,QAAAA,CAASM,GAAG,CAACP,IAAAA,CAAKX,EAAE,EAAEc,SAAAA,CAAAA;AAAY,gBAAA;AAAO,YAAA;AAClEC,YAAAA,IAAAA,CAAKT,GAAG,CAACU,OAAAA,CAAAA;AACb,QAAA;AACJ,IAAA;AAEA,IAAA,MAAMG,SAAS,IAAIN,GAAAA,CAAyBL,MAAME,GAAG,CAACC,CAAAA,IAAAA,GAAQ;AAACA,YAAAA,IAAAA,CAAKX,EAAE;AAAE,YAAA;AAAE,gBAAA,GAAGW,IAAI;AAAES,gBAAAA,QAAAA,EAAU,EAAE;gBAAEC,KAAAA,EAAO;AAAE;AAAE,SAAA,CAAA,CAAA;AAC5G,IAAA,MAAMC,QAAuB,EAAE;IAC/B,KAAK,MAAMX,QAAQH,KAAAA,CAAO;AACtB,QAAA,MAAMe,MAAAA,GAASX,QAAAA,CAASK,GAAG,CAACN,KAAKX,EAAE,CAAA;QACnC,IAAIuB,MAAAA,KAAWT,WAAWQ,KAAAA,CAAME,IAAI,CAACL,MAAAA,CAAOF,GAAG,CAACN,IAAAA,CAAKX,EAAE,CAAA,CAAA;aAClDmB,MAAAA,CAAOF,GAAG,CAACM,MAAAA,CAAAA,CAASH,QAAQ,CAACI,IAAI,CAACL,MAAAA,CAAOF,GAAG,CAACN,IAAAA,CAAKX,EAAE,CAAA,CAAA;AAC7D,IAAA;AAEA,IAAA,MAAMyB,cAAc,CAACC,KAAAA,EAAsBL,QAAkBK,KAAAA,CAAMC,OAAO,CAAChB,CAAAA,IAAAA,GAAAA;AAAUA,YAAAA,IAAAA,CAAKU,KAAK,GAAGA,KAAAA;YAAOI,WAAAA,CAAYd,IAAAA,CAAKS,QAAQ,EAAEC,KAAAA,GAAQ,CAAA,CAAA;AAAI,QAAA,CAAA,CAAA;AAChJI,IAAAA,WAAAA,CAAYH,KAAAA,EAAO,CAAA,CAAA;IACnB,OAAOA,KAAAA;AACX;AAEA,2GACO,SAASM,YAAAA,CAAaN,KAAoB,EAAEO,QAA6B,EAAA;AAC5E,IAAA,OAAOP,KAAAA,CAAMxB,OAAO,CAACa,CAAAA,IAAAA,GAAQ;AAACA,YAAAA,IAAAA;eAAUkB,QAAAA,CAASxB,GAAG,CAACM,IAAAA,CAAKX,EAAE,CAAA,GAAI4B,aAAajB,IAAAA,CAAKS,QAAQ,EAAES,QAAAA,CAAAA,GAAY;AAAI,SAAA,CAAA;AAChH;AAEA,0FACO,SAASC,eAAAA,CAAgBR,KAAoB,EAAED,KAAa,EAAA;AAC/D,IAAA,MAAMU,SAAS,IAAIlC,GAAAA,EAAAA;AACnB,IAAA,MAAMmC,OAAO,CAACN,KAAAA,GAAyBA,KAAAA,CAAMC,OAAO,CAAChB,CAAAA,IAAAA,GAAAA;AAAU,YAAA,IAAIA,IAAAA,CAAKU,KAAK,GAAGA,KAAAA,IAASV,KAAKS,QAAQ,CAAChB,MAAM,GAAG,CAAA,EAAG2B,MAAAA,CAAOzB,GAAG,CAACK,KAAKX,EAAE,CAAA;AAAGgC,YAAAA,IAAAA,CAAKrB,KAAKS,QAAQ,CAAA;AAAG,QAAA,CAAA,CAAA;IAC7JY,IAAAA,CAAKV,KAAAA,CAAAA;IACL,OAAOS,MAAAA;AACX;AAEA,wDACO,MAAME,kBAAkB,CAACtB,IAAAA,GAA8BA,KAAKS,QAAQ,CAACc,MAAM,CAAC,CAACC,GAAAA,EAAKC,KAAAA,GAAUD,MAAM,CAAA,GAAIF,eAAAA,CAAgBG,QAAQ,CAAA;AAErI,0KACO,SAASC,UAAAA,CAAWf,KAAoB,EAAA;AAC3C,IAAA,MAAMS,SAAS,IAAIlB,GAAAA,EAAAA;AACnB,IAAA,MAAMmB,OAAO,CAACN,KAAAA,EAAsBH,SAAyBG,KAAAA,CAAMC,OAAO,CAAChB,CAAAA,IAAAA,GAAAA;AAAUoB,YAAAA,MAAAA,CAAOb,GAAG,CAACP,IAAAA,CAAKX,EAAE,EAAE;gBAAEsC,QAAAA,EAAUZ,KAAAA;AAAOH,gBAAAA;AAAO,aAAA,CAAA;YAAIS,IAAAA,CAAKrB,IAAAA,CAAKS,QAAQ,EAAET,IAAAA,CAAAA;AAAO,QAAA,CAAA,CAAA;IAClKqB,IAAAA,CAAKV,KAAAA,CAAAA;IACL,OAAOS,MAAAA;AACX;;"}

package/dist/esm/foundation/permissionModel.d.ts

@@ -0,0 +1,24 @@
+export interface MatrixRole {
+    id: string;
+    label: string;
+}
+export interface MatrixPermission {
+    id: string;
+    label: string;
+    group?: string;
+}
+export interface MatrixGrant {
+    role: string;
+    permission: string;
+}
+export interface MatrixSection {
+    group?: string;
+    permissions: MatrixPermission[];
+}
+export declare function readRoles(value: unknown): MatrixRole[];
+export declare function readPermissions(value: unknown): MatrixPermission[];
+export declare function readGrants(value: unknown, roles: MatrixRole[], permissions: MatrixPermission[]): MatrixGrant[];
+export declare const isGranted: (grants: MatrixGrant[], role: string, permission: string) => boolean;
+export declare const setGrant: (grants: MatrixGrant[], role: string, permission: string, granted: boolean) => MatrixGrant[];
+export declare function sectionsOf(permissions: MatrixPermission[]): MatrixSection[];
+//# sourceMappingURL=permissionModel.d.ts.map

package/dist/esm/foundation/permissionModel.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"permissionModel.d.ts","sourceRoot":"","sources":["../../../foundation/permissionModel.ts"],"names":[],"mappings":"AAIA,MAAM,WAAW,UAAU;IACvB,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;CACjB;AAGD,MAAM,WAAW,gBAAgB;IAC7B,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,CAAC,EAAE,MAAM,CAAC;CAClB;AAGD,MAAM,WAAW,WAAW;IACxB,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,EAAE,MAAM,CAAC;CACtB;AAGD,MAAM,WAAW,aAAa;IAC1B,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,WAAW,EAAE,gBAAgB,EAAE,CAAC;CACnC;AAMD,wBAAgB,SAAS,CAAC,KAAK,EAAE,OAAO,GAAG,UAAU,EAAE,CAOtD;AAGD,wBAAgB,eAAe,CAAC,KAAK,EAAE,OAAO,GAAG,gBAAgB,EAAE,CAOlE;AAGD,wBAAgB,UAAU,CAAC,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,EAAE,WAAW,EAAE,gBAAgB,EAAE,GAAG,WAAW,EAAE,CAa9G;AAGD,eAAO,MAAM,SAAS,WAAY,WAAW,EAAE,QAAQ,MAAM,cAAc,MAAM,KAAG,OAAuF,CAAC;AAG5K,eAAO,MAAM,QAAQ,WAAY,WAAW,EAAE,QAAQ,MAAM,cAAc,MAAM,WAAW,OAAO,KAAG,WAAW,EACoE,CAAC;AAGrL,wBAAgB,UAAU,CAAC,WAAW,EAAE,gBAAgB,EAAE,GAAG,aAAa,EAAE,CAS3E"}

package/dist/esm/foundation/permissionModel.js

@@ -0,0 +1,77 @@
+// Copyright (c) Cratis. All rights reserved.
+// Licensed under the MIT license. See LICENSE file in the project root for full license information.
+/** A role: a column of the matrix. */ const records = (value)=>Array.isArray(value) ? value.filter((entry)=>typeof entry === 'object' && entry !== null && !Array.isArray(entry)) : [];
+/** Reads roles, dropping those without an id and repeated ids. */ function readRoles(value) {
+    const seen = new Set();
+    return records(value).flatMap((entry)=>{
+        if (typeof entry.id !== 'string' || entry.id.length === 0 || seen.has(entry.id)) return [];
+        seen.add(entry.id);
+        return [
+            {
+                id: entry.id,
+                label: typeof entry.label === 'string' && entry.label.length > 0 ? entry.label : entry.id
+            }
+        ];
+    });
+}
+/** Reads permissions, dropping those without an id and repeated ids. */ function readPermissions(value) {
+    const seen = new Set();
+    return records(value).flatMap((entry)=>{
+        if (typeof entry.id !== 'string' || entry.id.length === 0 || seen.has(entry.id)) return [];
+        seen.add(entry.id);
+        return [
+            {
+                id: entry.id,
+                label: typeof entry.label === 'string' && entry.label.length > 0 ? entry.label : entry.id,
+                ...typeof entry.group === 'string' && entry.group.length > 0 ? {
+                    group: entry.group
+                } : {}
+            }
+        ];
+    });
+}
+/** Reads grants, keeping each pair once and only for a role and a permission that exist: a grant of something that was deleted is not shown as held. */ function readGrants(value, roles, permissions) {
+    const roleIds = new Set(roles.map((role)=>role.id));
+    const permissionIds = new Set(permissions.map((permission)=>permission.id));
+    const seen = new Set();
+    return records(value).flatMap((entry)=>{
+        const { role, permission } = entry;
+        if (typeof role !== 'string' || typeof permission !== 'string' || !roleIds.has(role) || !permissionIds.has(permission)) return [];
+        const key = `${role}\u0000${permission}`;
+        if (seen.has(key)) return [];
+        seen.add(key);
+        return [
+            {
+                role,
+                permission
+            }
+        ];
+    });
+}
+/** Whether a role holds a permission. */ const isGranted = (grants, role, permission)=>grants.some((grant)=>grant.role === role && grant.permission === permission);
+/** Grants a permission to a role, or takes it away, leaving every other grant as it was. */ const setGrant = (grants, role, permission, granted)=>granted ? isGranted(grants, role, permission) ? grants : [
+        ...grants,
+        {
+            role,
+            permission
+        }
+    ] : grants.filter((grant)=>!(grant.role === role && grant.permission === permission));
+/** Groups the permissions into runs by their group, in the order first seen, with the ungrouped ones in a run of their own. */ function sectionsOf(permissions) {
+    const sections = [];
+    for (const permission of permissions){
+        const section = sections.find((candidate)=>candidate.group === permission.group);
+        if (section) section.permissions.push(permission);
+        else sections.push({
+            ...permission.group === undefined ? {} : {
+                group: permission.group
+            },
+            permissions: [
+                permission
+            ]
+        });
+    }
+    return sections;
+}
+
+export { isGranted, readGrants, readPermissions, readRoles, sectionsOf, setGrant };
+//# sourceMappingURL=permissionModel.js.map

package/dist/esm/foundation/permissionModel.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"permissionModel.js","sources":["../../../foundation/permissionModel.ts"],"sourcesContent":["// Copyright (c) Cratis. All rights reserved.\n// Licensed under the MIT license. See LICENSE file in the project root for full license information.\n\n/** A role: a column of the matrix. */\nexport interface MatrixRole {\n    id: string;\n    label: string;\n}\n\n/** A permission: a row of the matrix, optionally in a named group. */\nexport interface MatrixPermission {\n    id: string;\n    label: string;\n    group?: string;\n}\n\n/** One role holding one permission. */\nexport interface MatrixGrant {\n    role: string;\n    permission: string;\n}\n\n/** A named run of permissions, for the group heading rows. */\nexport interface MatrixSection {\n    group?: string;\n    permissions: MatrixPermission[];\n}\n\nconst records = (value: unknown): Record<string, unknown>[] =>\n    Array.isArray(value) ? value.filter((entry): entry is Record<string, unknown> => typeof entry === 'object' && entry !== null && !Array.isArray(entry)) : [];\n\n/** Reads roles, dropping those without an id and repeated ids. */\nexport function readRoles(value: unknown): MatrixRole[] {\n    const seen = new Set<string>();\n    return records(value).flatMap(entry => {\n        if (typeof entry.id !== 'string' || entry.id.length === 0 || seen.has(entry.id)) return [];\n        seen.add(entry.id);\n        return [{ id: entry.id, label: typeof entry.label === 'string' && entry.label.length > 0 ? entry.label : entry.id }];\n    });\n}\n\n/** Reads permissions, dropping those without an id and repeated ids. */\nexport function readPermissions(value: unknown): MatrixPermission[] {\n    const seen = new Set<string>();\n    return records(value).flatMap(entry => {\n        if (typeof entry.id !== 'string' || entry.id.length === 0 || seen.has(entry.id)) return [];\n        seen.add(entry.id);\n        return [{ id: entry.id, label: typeof entry.label === 'string' && entry.label.length > 0 ? entry.label : entry.id, ...(typeof entry.group === 'string' && entry.group.length > 0 ? { group: entry.group } : {}) }];\n    });\n}\n\n/** Reads grants, keeping each pair once and only for a role and a permission that exist: a grant of something that was deleted is not shown as held. */\nexport function readGrants(value: unknown, roles: MatrixRole[], permissions: MatrixPermission[]): MatrixGrant[] {\n    const roleIds = new Set(roles.map(role => role.id));\n    const permissionIds = new Set(permissions.map(permission => permission.id));\n    const seen = new Set<string>();\n\n    return records(value).flatMap(entry => {\n        const { role, permission } = entry;\n        if (typeof role !== 'string' || typeof permission !== 'string' || !roleIds.has(role) || !permissionIds.has(permission)) return [];\n        const key = `${role}\\u0000${permission}`;\n        if (seen.has(key)) return [];\n        seen.add(key);\n        return [{ role, permission }];\n    });\n}\n\n/** Whether a role holds a permission. */\nexport const isGranted = (grants: MatrixGrant[], role: string, permission: string): boolean => grants.some(grant => grant.role === role && grant.permission === permission);\n\n/** Grants a permission to a role, or takes it away, leaving every other grant as it was. */\nexport const setGrant = (grants: MatrixGrant[], role: string, permission: string, granted: boolean): MatrixGrant[] =>\n    granted ? (isGranted(grants, role, permission) ? grants : [...grants, { role, permission }]) : grants.filter(grant => !(grant.role === role && grant.permission === permission));\n\n/** Groups the permissions into runs by their group, in the order first seen, with the ungrouped ones in a run of their own. */\nexport function sectionsOf(permissions: MatrixPermission[]): MatrixSection[] {\n    const sections: MatrixSection[] = [];\n    for (const permission of permissions) {\n        const section = sections.find(candidate => candidate.group === permission.group);\n        if (section) section.permissions.push(permission);\n        else sections.push({ ...(permission.group === undefined ? {} : { group: permission.group }), permissions: [permission] });\n    }\n\n    return sections;\n}\n"],"names":["records","value","Array","isArray","filter","entry","readRoles","seen","Set","flatMap","id","length","has","add","label","readPermissions","group","readGrants","roles","permissions","roleIds","map","role","permissionIds","permission","key","isGranted","grants","some","grant","setGrant","granted","sectionsOf","sections","section","find","candidate","push","undefined"],"mappings":"AAAA;AACA;AAEA,uCAyBA,MAAMA,OAAAA,GAAU,CAACC,KAAAA,GACbC,MAAMC,OAAO,CAACF,KAAAA,CAAAA,GAASA,KAAAA,CAAMG,MAAM,CAAC,CAACC,KAAAA,GAA4C,OAAOA,KAAAA,KAAU,QAAA,IAAYA,KAAAA,KAAU,IAAA,IAAQ,CAACH,KAAAA,CAAMC,OAAO,CAACE,KAAAA,CAAAA,CAAAA,GAAU,EAAE;AAE/J,mEACO,SAASC,SAAAA,CAAUL,KAAc,EAAA;AACpC,IAAA,MAAMM,OAAO,IAAIC,GAAAA,EAAAA;AACjB,IAAA,OAAOR,OAAAA,CAAQC,KAAAA,CAAAA,CAAOQ,OAAO,CAACJ,CAAAA,KAAAA,GAAAA;AAC1B,QAAA,IAAI,OAAOA,KAAAA,CAAMK,EAAE,KAAK,QAAA,IAAYL,KAAAA,CAAMK,EAAE,CAACC,MAAM,KAAK,CAAA,IAAKJ,KAAKK,GAAG,CAACP,MAAMK,EAAE,CAAA,EAAG,OAAO,EAAE;QAC1FH,IAAAA,CAAKM,GAAG,CAACR,KAAAA,CAAMK,EAAE,CAAA;QACjB,OAAO;AAAC,YAAA;AAAEA,gBAAAA,EAAAA,EAAIL,MAAMK,EAAE;AAAEI,gBAAAA,KAAAA,EAAO,OAAOT,KAAAA,CAAMS,KAAK,KAAK,YAAYT,KAAAA,CAAMS,KAAK,CAACH,MAAM,GAAG,CAAA,GAAIN,KAAAA,CAAMS,KAAK,GAAGT,MAAMK;AAAG;AAAE,SAAA;AACxH,IAAA,CAAA,CAAA;AACJ;AAEA,yEACO,SAASK,eAAAA,CAAgBd,KAAc,EAAA;AAC1C,IAAA,MAAMM,OAAO,IAAIC,GAAAA,EAAAA;AACjB,IAAA,OAAOR,OAAAA,CAAQC,KAAAA,CAAAA,CAAOQ,OAAO,CAACJ,CAAAA,KAAAA,GAAAA;AAC1B,QAAA,IAAI,OAAOA,KAAAA,CAAMK,EAAE,KAAK,QAAA,IAAYL,KAAAA,CAAMK,EAAE,CAACC,MAAM,KAAK,CAAA,IAAKJ,KAAKK,GAAG,CAACP,MAAMK,EAAE,CAAA,EAAG,OAAO,EAAE;QAC1FH,IAAAA,CAAKM,GAAG,CAACR,KAAAA,CAAMK,EAAE,CAAA;QACjB,OAAO;AAAC,YAAA;AAAEA,gBAAAA,EAAAA,EAAIL,MAAMK,EAAE;AAAEI,gBAAAA,KAAAA,EAAO,OAAOT,KAAAA,CAAMS,KAAK,KAAK,YAAYT,KAAAA,CAAMS,KAAK,CAACH,MAAM,GAAG,CAAA,GAAIN,KAAAA,CAAMS,KAAK,GAAGT,MAAMK,EAAE;gBAAE,GAAI,OAAOL,KAAAA,CAAMW,KAAK,KAAK,QAAA,IAAYX,MAAMW,KAAK,CAACL,MAAM,GAAG,CAAA,GAAI;AAAEK,oBAAAA,KAAAA,EAAOX,MAAMW;AAAM,iBAAA,GAAI;AAAI;AAAE,SAAA;AACtN,IAAA,CAAA,CAAA;AACJ;AAEA,yJACO,SAASC,UAAAA,CAAWhB,KAAc,EAAEiB,KAAmB,EAAEC,WAA+B,EAAA;IAC3F,MAAMC,OAAAA,GAAU,IAAIZ,GAAAA,CAAIU,KAAAA,CAAMG,GAAG,CAACC,CAAAA,IAAAA,GAAQA,IAAAA,CAAKZ,EAAE,CAAA,CAAA;IACjD,MAAMa,aAAAA,GAAgB,IAAIf,GAAAA,CAAIW,WAAAA,CAAYE,GAAG,CAACG,CAAAA,UAAAA,GAAcA,UAAAA,CAAWd,EAAE,CAAA,CAAA;AACzE,IAAA,MAAMH,OAAO,IAAIC,GAAAA,EAAAA;AAEjB,IAAA,OAAOR,OAAAA,CAAQC,KAAAA,CAAAA,CAAOQ,OAAO,CAACJ,CAAAA,KAAAA,GAAAA;AAC1B,QAAA,MAAM,EAAEiB,IAAI,EAAEE,UAAU,EAAE,GAAGnB,KAAAA;AAC7B,QAAA,IAAI,OAAOiB,IAAAA,KAAS,QAAA,IAAY,OAAOE,UAAAA,KAAe,YAAY,CAACJ,OAAAA,CAAQR,GAAG,CAACU,SAAS,CAACC,aAAAA,CAAcX,GAAG,CAACY,UAAAA,CAAAA,EAAa,OAAO,EAAE;AACjI,QAAA,MAAMC,GAAAA,GAAM,CAAA,EAAGH,IAAAA,CAAK,MAAM,EAAEE,UAAAA,CAAAA,CAAY;AACxC,QAAA,IAAIjB,IAAAA,CAAKK,GAAG,CAACa,GAAAA,CAAAA,EAAM,OAAO,EAAE;AAC5BlB,QAAAA,IAAAA,CAAKM,GAAG,CAACY,GAAAA,CAAAA;QACT,OAAO;AAAC,YAAA;AAAEH,gBAAAA,IAAAA;AAAME,gBAAAA;AAAW;AAAE,SAAA;AACjC,IAAA,CAAA,CAAA;AACJ;AAEA,0CACO,MAAME,SAAAA,GAAY,CAACC,MAAAA,EAAuBL,IAAAA,EAAcE,aAAgCG,MAAAA,CAAOC,IAAI,CAACC,CAAAA,KAAAA,GAASA,MAAMP,IAAI,KAAKA,QAAQO,KAAAA,CAAML,UAAU,KAAKA,UAAAA;AAEhK,6FACO,MAAMM,QAAAA,GAAW,CAACH,MAAAA,EAAuBL,IAAAA,EAAcE,UAAAA,EAAoBO,OAAAA,GAC9EA,OAAAA,GAAWL,SAAAA,CAAUC,MAAAA,EAAQL,IAAAA,EAAME,cAAcG,MAAAA,GAAS;AAAIA,QAAAA,GAAAA,MAAAA;AAAQ,QAAA;AAAEL,YAAAA,IAAAA;AAAME,YAAAA;AAAW;AAAE,KAAA,GAAIG,MAAAA,CAAOvB,MAAM,CAACyB,CAAAA,QAAS,EAAEA,KAAAA,CAAMP,IAAI,KAAKA,IAAAA,IAAQO,KAAAA,CAAML,UAAU,KAAKA,UAAS,CAAA;AAEjL,gIACO,SAASQ,UAAAA,CAAWb,WAA+B,EAAA;AACtD,IAAA,MAAMc,WAA4B,EAAE;IACpC,KAAK,MAAMT,cAAcL,WAAAA,CAAa;QAClC,MAAMe,OAAAA,GAAUD,QAAAA,CAASE,IAAI,CAACC,CAAAA,YAAaA,SAAAA,CAAUpB,KAAK,KAAKQ,UAAAA,CAAWR,KAAK,CAAA;AAC/E,QAAA,IAAIkB,OAAAA,EAASA,OAAAA,CAAQf,WAAW,CAACkB,IAAI,CAACb,UAAAA,CAAAA;AACjCS,aAAAA,QAAAA,CAASI,IAAI,CAAC;AAAE,YAAA,GAAIb,UAAAA,CAAWR,KAAK,KAAKsB,SAAAA,GAAY,EAAC,GAAI;AAAEtB,gBAAAA,KAAAA,EAAOQ,WAAWR;aAAO;YAAGG,WAAAA,EAAa;AAACK,gBAAAA;AAAW;AAAC,SAAA,CAAA;AAC3H,IAAA;IAEA,OAAOS,QAAAA;AACX;;"}

package/dist/esm/foundation/uploadModel.d.ts

@@ -0,0 +1,31 @@
+export declare enum UploadStatus {
+    Queued = "queued",
+    Uploading = "uploading",
+    Done = "done",
+    Failed = "failed"
+}
+export interface UploadRules {
+    accept: string;
+    maximumBytes: number;
+    multiple: boolean;
+}
+export interface SelectedFile {
+    name: string;
+    size: number;
+    type: string;
+}
+export declare enum UploadRefusal {
+    WrongType = "wrongType",
+    TooLarge = "tooLarge",
+    Single = "single"
+}
+export declare function matchesAccept(file: SelectedFile, accept: string): boolean;
+export declare function checkSelection<T extends SelectedFile>(files: T[], rules: UploadRules, alreadySelected?: number): {
+    accepted: T[];
+    refused: {
+        file: T;
+        reason: UploadRefusal;
+    }[];
+};
+export declare function formatBytes(bytes: number, locale: string): string;
+//# sourceMappingURL=uploadModel.d.ts.map

package/dist/esm/foundation/uploadModel.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"uploadModel.d.ts","sourceRoot":"","sources":["../../../foundation/uploadModel.ts"],"names":[],"mappings":"AAIA,oBAAY,YAAY;IACpB,MAAM,WAAW;IACjB,SAAS,cAAc;IACvB,IAAI,SAAS;IACb,MAAM,WAAW;CACpB;AAGD,MAAM,WAAW,WAAW;IAExB,MAAM,EAAE,MAAM,CAAC;IACf,YAAY,EAAE,MAAM,CAAC;IACrB,QAAQ,EAAE,OAAO,CAAC;CACrB;AAGD,MAAM,WAAW,YAAY;IACzB,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;CAChB;AAGD,oBAAY,aAAa;IACrB,SAAS,cAAc;IACvB,QAAQ,aAAa;IACrB,MAAM,WAAW;CACpB;AAGD,wBAAgB,aAAa,CAAC,IAAI,EAAE,YAAY,EAAE,MAAM,EAAE,MAAM,GAAG,OAAO,CAOzE;AAGD,wBAAgB,cAAc,CAAC,CAAC,SAAS,YAAY,EAAE,KAAK,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,WAAW,EAAE,eAAe,SAAI,GAAG;IAAE,QAAQ,EAAE,CAAC,EAAE,CAAC;IAAC,OAAO,EAAE;QAAE,IAAI,EAAE,CAAC,CAAC;QAAC,MAAM,EAAE,aAAa,CAAA;KAAE,EAAE,CAAA;CAAE,CAY5K;AAGD,wBAAgB,WAAW,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,CAMjE"}

package/dist/esm/foundation/uploadModel.js

@@ -0,0 +1,65 @@
+// Copyright (c) Cratis. All rights reserved.
+// Licensed under the MIT license. See LICENSE file in the project root for full license information.
+/** Where a file is in being uploaded. */ var UploadStatus = /*#__PURE__*/ function(UploadStatus) {
+    UploadStatus["Queued"] = "queued";
+    UploadStatus["Uploading"] = "uploading";
+    UploadStatus["Done"] = "done";
+    UploadStatus["Failed"] = "failed";
+    return UploadStatus;
+}({});
+/** Why a file was refused. */ var UploadRefusal = /*#__PURE__*/ function(UploadRefusal) {
+    UploadRefusal["WrongType"] = "wrongType";
+    UploadRefusal["TooLarge"] = "tooLarge";
+    UploadRefusal["Single"] = "single";
+    return UploadRefusal;
+}({});
+/** Whether a file matches an `accept` list; an empty list accepts everything, and matching ignores case. */ function matchesAccept(file, accept) {
+    const patterns = accept.split(',').map((pattern)=>pattern.trim().toLowerCase()).filter((pattern)=>pattern.length > 0);
+    if (patterns.length === 0) return true;
+    const name = file.name.toLowerCase();
+    const type = file.type.toLowerCase();
+    return patterns.some((pattern)=>pattern.startsWith('.') ? name.endsWith(pattern) : pattern.endsWith('/*') ? type.startsWith(pattern.slice(0, -1)) : type === pattern);
+}
+/** Sorts a selection into the files to take and the reasons for refusing the others. Only the first is taken when one file is allowed. */ function checkSelection(files, rules, alreadySelected = 0) {
+    const accepted = [];
+    const refused = [];
+    for (const file of files){
+        if (!matchesAccept(file, rules.accept)) refused.push({
+            file,
+            reason: "wrongType"
+        });
+        else if (rules.maximumBytes > 0 && file.size > rules.maximumBytes) refused.push({
+            file,
+            reason: "tooLarge"
+        });
+        else if (!rules.multiple && alreadySelected + accepted.length >= 1) refused.push({
+            file,
+            reason: "single"
+        });
+        else accepted.push(file);
+    }
+    return {
+        accepted,
+        refused
+    };
+}
+/** A file size in the largest unit that keeps it under 1024, for the locale. */ function formatBytes(bytes, locale) {
+    const units = [
+        'B',
+        'KB',
+        'MB',
+        'GB'
+    ];
+    let value = bytes;
+    let unit = 0;
+    while(value >= 1024 && unit < units.length - 1){
+        value /= 1024;
+        unit++;
+    }
+    return `${new Intl.NumberFormat(locale, {
+        maximumFractionDigits: unit === 0 ? 0 : 1
+    }).format(value)} ${units[unit]}`;
+}
+
+export { UploadRefusal, UploadStatus, checkSelection, formatBytes, matchesAccept };
+//# sourceMappingURL=uploadModel.js.map

package/dist/esm/foundation/uploadModel.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"uploadModel.js","sources":["../../../foundation/uploadModel.ts"],"sourcesContent":["// Copyright (c) Cratis. All rights reserved.\n// Licensed under the MIT license. See LICENSE file in the project root for full license information.\n\n/** Where a file is in being uploaded. */\nexport enum UploadStatus {\n    Queued = 'queued',\n    Uploading = 'uploading',\n    Done = 'done',\n    Failed = 'failed',\n}\n\n/** The rules a selection is checked against before anything is sent. */\nexport interface UploadRules {\n    /** A comma-separated `accept` list: extensions (`.pdf`), MIME types (`image/png`) and wildcards (`image/*`). */\n    accept: string;\n    maximumBytes: number;\n    multiple: boolean;\n}\n\n/** What the checker needs of a file. */\nexport interface SelectedFile {\n    name: string;\n    size: number;\n    type: string;\n}\n\n/** Why a file was refused. */\nexport enum UploadRefusal {\n    WrongType = 'wrongType',\n    TooLarge = 'tooLarge',\n    Single = 'single',\n}\n\n/** Whether a file matches an `accept` list; an empty list accepts everything, and matching ignores case. */\nexport function matchesAccept(file: SelectedFile, accept: string): boolean {\n    const patterns = accept.split(',').map(pattern => pattern.trim().toLowerCase()).filter(pattern => pattern.length > 0);\n    if (patterns.length === 0) return true;\n\n    const name = file.name.toLowerCase();\n    const type = file.type.toLowerCase();\n    return patterns.some(pattern => pattern.startsWith('.') ? name.endsWith(pattern) : pattern.endsWith('/*') ? type.startsWith(pattern.slice(0, -1)) : type === pattern);\n}\n\n/** Sorts a selection into the files to take and the reasons for refusing the others. Only the first is taken when one file is allowed. */\nexport function checkSelection<T extends SelectedFile>(files: T[], rules: UploadRules, alreadySelected = 0): { accepted: T[]; refused: { file: T; reason: UploadRefusal }[] } {\n    const accepted: T[] = [];\n    const refused: { file: T; reason: UploadRefusal }[] = [];\n\n    for (const file of files) {\n        if (!matchesAccept(file, rules.accept)) refused.push({ file, reason: UploadRefusal.WrongType });\n        else if (rules.maximumBytes > 0 && file.size > rules.maximumBytes) refused.push({ file, reason: UploadRefusal.TooLarge });\n        else if (!rules.multiple && alreadySelected + accepted.length >= 1) refused.push({ file, reason: UploadRefusal.Single });\n        else accepted.push(file);\n    }\n\n    return { accepted, refused };\n}\n\n/** A file size in the largest unit that keeps it under 1024, for the locale. */\nexport function formatBytes(bytes: number, locale: string): string {\n    const units = ['B', 'KB', 'MB', 'GB'];\n    let value = bytes;\n    let unit = 0;\n    while (value >= 1024 && unit < units.length - 1) { value /= 1024; unit++; }\n    return `${new Intl.NumberFormat(locale, { maximumFractionDigits: unit === 0 ? 0 : 1 }).format(value)} ${units[unit]}`;\n}\n"],"names":["UploadStatus","UploadRefusal","matchesAccept","file","accept","patterns","split","map","pattern","trim","toLowerCase","filter","length","name","type","some","startsWith","endsWith","slice","checkSelection","files","rules","alreadySelected","accepted","refused","push","reason","maximumBytes","size","multiple","formatBytes","bytes","locale","units","value","unit","Intl","NumberFormat","maximumFractionDigits","format"],"mappings":"AAAA;AACA;AAEA,0CACO,IAAKA,YAAAA,iBAAAA,SAAAA,YAAAA,EAAAA;;;;;AAAAA,IAAAA,OAAAA,YAAAA;AAKX,CAAA,CAAA,EAAA;AAiBD,+BACO,IAAKC,aAAAA,iBAAAA,SAAAA,aAAAA,EAAAA;;;;AAAAA,IAAAA,OAAAA,aAAAA;AAIX,CAAA,CAAA,EAAA;AAED,6GACO,SAASC,aAAAA,CAAcC,IAAkB,EAAEC,MAAc,EAAA;IAC5D,MAAMC,QAAAA,GAAWD,OAAOE,KAAK,CAAC,KAAKC,GAAG,CAACC,CAAAA,OAAAA,GAAWA,OAAAA,CAAQC,IAAI,EAAA,CAAGC,WAAW,IAAIC,MAAM,CAACH,CAAAA,OAAAA,GAAWA,OAAAA,CAAQI,MAAM,GAAG,CAAA,CAAA;AACnH,IAAA,IAAIP,QAAAA,CAASO,MAAM,KAAK,CAAA,EAAG,OAAO,IAAA;AAElC,IAAA,MAAMC,IAAAA,GAAOV,IAAAA,CAAKU,IAAI,CAACH,WAAW,EAAA;AAClC,IAAA,MAAMI,IAAAA,GAAOX,IAAAA,CAAKW,IAAI,CAACJ,WAAW,EAAA;IAClC,OAAOL,QAAAA,CAASU,IAAI,CAACP,CAAAA,OAAAA,GAAWA,OAAAA,CAAQQ,UAAU,CAAC,GAAA,CAAA,GAAOH,IAAAA,CAAKI,QAAQ,CAACT,OAAAA,CAAAA,GAAWA,QAAQS,QAAQ,CAAC,IAAA,CAAA,GAAQH,IAAAA,CAAKE,UAAU,CAACR,OAAAA,CAAQU,KAAK,CAAC,CAAA,EAAG,EAAC,CAAA,CAAA,GAAMJ,IAAAA,KAASN,OAAAA,CAAAA;AACjK;AAEA,2IACO,SAASW,cAAAA,CAAuCC,KAAU,EAAEC,KAAkB,EAAEC,eAAAA,GAAkB,CAAC,EAAA;AACtG,IAAA,MAAMC,WAAgB,EAAE;AACxB,IAAA,MAAMC,UAAgD,EAAE;IAExD,KAAK,MAAMrB,QAAQiB,KAAAA,CAAO;QACtB,IAAI,CAAClB,cAAcC,IAAAA,EAAMkB,KAAAA,CAAMjB,MAAM,CAAA,EAAGoB,OAAAA,CAAQC,IAAI,CAAC;AAAEtB,YAAAA,IAAAA;YAAMuB,MAAM,EAAA;AAA0B,SAAA,CAAA;AACxF,aAAA,IAAIL,KAAAA,CAAMM,YAAY,GAAG,CAAA,IAAKxB,IAAAA,CAAKyB,IAAI,GAAGP,KAAAA,CAAMM,YAAY,EAAEH,OAAAA,CAAQC,IAAI,CAAC;AAAEtB,YAAAA,IAAAA;YAAMuB,MAAM,EAAA;AAAyB,SAAA,CAAA;aAClH,IAAI,CAACL,KAAAA,CAAMQ,QAAQ,IAAIP,eAAAA,GAAkBC,QAAAA,CAASX,MAAM,IAAI,CAAA,EAAGY,OAAAA,CAAQC,IAAI,CAAC;AAAEtB,YAAAA,IAAAA;YAAMuB,MAAM,EAAA;AAAuB,SAAA,CAAA;AACjHH,aAAAA,QAAAA,CAASE,IAAI,CAACtB,IAAAA,CAAAA;AACvB,IAAA;IAEA,OAAO;AAAEoB,QAAAA,QAAAA;AAAUC,QAAAA;AAAQ,KAAA;AAC/B;AAEA,iFACO,SAASM,WAAAA,CAAYC,KAAa,EAAEC,MAAc,EAAA;AACrD,IAAA,MAAMC,KAAAA,GAAQ;AAAC,QAAA,GAAA;AAAK,QAAA,IAAA;AAAM,QAAA,IAAA;AAAM,QAAA;AAAK,KAAA;AACrC,IAAA,IAAIC,KAAAA,GAAQH,KAAAA;AACZ,IAAA,IAAII,IAAAA,GAAO,CAAA;AACX,IAAA,MAAOD,SAAS,IAAA,IAAQC,IAAAA,GAAOF,KAAAA,CAAMrB,MAAM,GAAG,CAAA,CAAG;QAAEsB,KAAAA,IAAS,IAAA;AAAMC,QAAAA,IAAAA,EAAAA;AAAQ,IAAA;AAC1E,IAAA,OAAO,CAAA,EAAG,IAAIC,IAAAA,CAAKC,YAAY,CAACL,MAAAA,EAAQ;QAAEM,qBAAAA,EAAuBH,IAAAA,KAAS,IAAI,CAAA,GAAI;KAAE,CAAA,CAAGI,MAAM,CAACL,KAAAA,CAAAA,CAAO,CAAC,EAAED,KAAK,CAACE,KAAK,CAAA,CAAE;AACzH;;"}

package/dist/esm/index.js

@@ -55,7 +55,7 @@ export { LayoutModeSwitcher } from './shell/LayoutModeSwitcher.js';
 export { formatText, foundationStrings, readFoundationStrings } from './foundation/foundationStrings.js';
 export { ComponentState, componentStates, readComponentState } from './foundation/ComponentState.js';
 export { PermissionRule, readPermissionRule } from './foundation/PermissionRule.js';
-export { NumberFormat, formatDate, formatNumber, isRightToLeft, readLocale, readNumberFormat } from './foundation/formatting.js';
+export { NumberFormat, formatDate, formatDay, formatNumber, isRightToLeft, readLocale, readNumberFormat } from './foundation/formatting.js';
 export { FoundationIcon, isFoundationIcon } from './foundation/FoundationIcon.js';
 export { ActionButton } from './foundation/ActionButton.js';
 export { EmptyStateView, FoundationFrame } from './foundation/StateFrame.js';
@@ -72,6 +72,21 @@ export { moveColumn, readColumns, toggleColumn, visibleColumnIds } from './found
 export { ColumnChooser } from './foundation/ColumnChooser.js';
 export { readViews } from './foundation/viewModel.js';
 export { SavedViewsMenu, savedViewActionOutput } from './foundation/SavedViewsMenu.js';
+export { completed, doneTaskIds, isOverdue, readChecklist, toggleTask } from './foundation/checklistModel.js';
+export { ChecklistSection } from './foundation/ChecklistSection.js';
+export { ActivityKind, dayOf, groupByDay, readActivity } from './foundation/activityModel.js';
+export { ActivityFeed } from './foundation/ActivityFeed.js';
+export { initialsOf, readPeople, visiblePeople } from './foundation/avatarModel.js';
+export { AvatarStack } from './foundation/AvatarStack.js';
+export { UploadRefusal, UploadStatus, checkSelection, formatBytes, matchesAccept } from './foundation/uploadModel.js';
+export { FileUploaderHandlerProvider, useFileUploaderHandler } from './foundation/FileUploaderHandler.js';
+export { FileUploader } from './foundation/FileUploader.js';
+export { ApprovalState, ChainOutcome, chainOutcome, effectiveSteps, readSteps } from './foundation/approvalModel.js';
+export { ApprovalChainStepper } from './foundation/ApprovalChainStepper.js';
+export { buildOrgTree, descendantCount, expandedToDepth, placements, readOrgNodes, visibleNodes } from './foundation/orgModel.js';
+export { OrgTree } from './foundation/OrgTree.js';
+export { isGranted, readGrants, readPermissions, readRoles, sectionsOf, setGrant } from './foundation/permissionModel.js';
+export { PermissionMatrix } from './foundation/PermissionMatrix.js';
 export { bindable, foundationDescriptors, list, standardStateProperties } from './foundation/foundationDescriptors.js';
 export { foundationComponentMetadata } from './foundation/foundationComponentMetadata.js';
 export { foundationElement, foundationSamples } from './foundation/foundationSamples.js';

package/dist/esm/index.js.map

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