@baack-software/baack-ts-tasks 0.0.0-stage → 0.0.1

package/LICENSE

@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

package/README.md

@@ -1,3 +1,159 @@
-# Temporary Holding Version
+# baack-ts-tasks
 
-This version is a temporary placeholder for this package. An operational version to replace this has been submitted for review and is awaiting a staged release.
+TypeScript tools for [Baack](https://www.baack.co) tasks, built on
+[`@baack-software/baack-ts-client`](https://github.com/Baack-Software/baack-ts-client): a typed task API, helpers for
+building task views, a task store for UIs, and shadcn/ui task components for React, used first by the Baack console. See [docs/PLAN.md](docs/PLAN.md).
+
+## Usage
+
+```ts
+import { BaackClient } from '@baack-software/baack-ts-client';
+import { TaskClient, byUrgency, filterTasks, groupTasks, isOverdue, toTimestamp } from '@baack-software/baack-ts-tasks';
+
+const tasks = new TaskClient(new BaackClient({ baseUrl: 'https://api.baack.co', credentials: 'include' }));
+
+// List a company's tasks, with the identities and projects for names and pickers.
+const { tasks: all, identities, projects } = await tasks.list({ owner: companyUrn });
+
+// Work with them without further requests.
+const mine = filterTasks(all, { assignee: [me], open: true }).sort(byUrgency);
+const overdue = all.filter((task) => isOverdue(task));
+const board = groupTasks(all, 'status'); // every status as a column, in order
+
+// Change them. Each update reads the task and sends it whole with the change, since the API stores what an update
+// sends; `actor` attributes the change in the activity log.
+const task = await tasks.create({ owner: companyUrn, title: 'Welcome your new customer', dueTimestamp: toTimestamp(due) });
+await tasks.setStatus(task, 'IN_PROGRESS', { actor: me });
+await tasks.addBlocker(task, otherTaskUrn, { actor: me });
+await tasks.comment(task, 'Called them, waiting to hear back', { actor: me });
+const logs = await tasks.allLogs(task); // newest first
+```
+
+### Store
+
+`@baack-software/baack-ts-tasks/store` holds a company's tasks for a UI. Changes show at once, and roll back if the
+server refuses them, without disturbing other changes still in flight. A short while after each write the store reads
+the task again, since the server can change it after accepting. `subscribe` and `getState` fit React's
+`useSyncExternalStore`.
+
+```ts
+import { TaskStore, selectGroups, selectName } from '@baack-software/baack-ts-tasks/store';
+
+const store = new TaskStore(tasks, { owner: companyUrn, actor: me });
+store.subscribe(() => {
+  const state = store.getState(); // a new object on every change
+  render(selectGroups(state, 'status', { assignee: [me] }, byUrgency), (urn) => selectName(state, urn));
+});
+await store.load();
+
+await store.setStatus(urn, 'COMPLETED');      // shown straight away; rolled back and rethrown on failure
+await store.addBlocker(urn, otherUrn);         // builds on changes still in flight
+await store.loadLogs(urn);                     // state.logs.get(urn), newest first; loadMoreLogs for older
+await store.comment(urn, 'Done, thanks all');  // shown at the top of the log
+```
+
+Workflows can't be listed through the API, so name the ones the app uses: `new TaskStore(tasks, { owner, workflows:
+[workflowUrn] })` loads them into `state.workflows`. `groupByStage(tasks, workflow)` makes columns of its stages in
+order, and `groupByWorkflow(tasks, workflows)` a column per workflow (a task's workflow is the one its stage is in).
+`TaskView` offers both as board groupings, Workflow and each workflow's stages, and a Stage picker in the editor. Its
+board columns are sorted open first, then by priority, due date and title (`byPriorityThenDue`).
+
+### Conflicting edits
+
+Updates replace the stored task, so a change made from a stale copy would undo what someone else saved since. Pass the
+copy the person was looking at as `base`, and the update keeps everything they didn't change:
+
+- A field they changed that someone else also changed since `base` is a conflict: the update throws
+  `TaskConflictError` with each field's base, theirs and mine values, and the task as it is now, and saves nothing.
+  `resolveConflicts(changes, choices)` keeps "mine" or "theirs" per field; update again against `current`.
+- Fields only someone else changed are kept and reported to `onChangedElsewhere`.
+- List changes (blockers, associations) are applied as additions and removals, so they never conflict.
+
+```ts
+try {
+  await tasks.update(task, { title }, { base: task, onChangedElsewhere: (fields) => notify(fields) });
+} catch (error) {
+  if (!(error instanceof TaskConflictError)) throw error;
+  const choices = await askPerson(error.conflicts); // { title: 'mine' } or { title: 'theirs' }
+  await tasks.update(error.current, resolveConflicts({ title }, choices), { base: error.current });
+}
+```
+
+`TaskStore.update` does this for you, with what it shows as the base: on a conflict it shows the task as it is now,
+and fields others changed go in `state.changedElsewhere` until `dismissChangedElsewhere`. `TaskEditor` turns a
+conflict into a panel to keep mine or use theirs for each field. The API doesn't check versions on write yet, so a
+change saved in the moment between the read and the write can still be lost.
+
+### React components
+
+`@baack-software/baack-ts-tasks/react` has the task UI built from shadcn/ui (style `radix-nova`): `TaskView` (the
+whole view, on a `TaskStore`), and the parts it is made of for apps that compose their own: `TaskBoard`, `TaskTable`,
+`TaskFilters`, `TaskEditor`, `TaskConflicts`, `TaskActivity`, `TaskCreateForm`, and badges, due dates and avatars. The parts take plain
+props and callbacks, so any data layer (the store, TanStack Query, …) can drive them. The editor relates a task to
+people, other tasks, and any companies and content in its `directory` (`TaskView` takes them as `related`, since the
+store doesn't load them).
+
+`TasksAbout` is the panel for a console page about one thing: `<TasksAbout store={store} about={{ kind: 'company',
+urn }} onOpen={…} />` lists its open tasks, most urgent first, shows completed ones on request, and has a quick-add
+whose task is related to it (`kind` is `identity`, `company`, `entity`, `task` or `project`). The API can't search by
+association yet, so it filters the store's tasks; share one store across a page's panels.
+
+```tsx
+import { TaskCopyProvider, TaskView } from '@baack-software/baack-ts-tasks/react';
+
+<TaskCopyProvider entity={copyEntity /* optional */}>
+  <TaskView store={store} me={myIdentityUrn} />
+</TaskCopyProvider>
+```
+
+- **Theme.** The components use the shadcn CSS variables (`--primary`, `--muted`, `--border`, …), so they take the
+  host app's theme. Tailwind must scan the package: `@source "../node_modules/@baack-software/baack-ts-tasks/dist";`.
+- **Copy.** Every label, heading and message is a Baack text item rendered with `baack-ts-components`, with an en-GB
+  placeholder until content exists. Pass the content entity to `TaskCopyProvider` to replace or translate it; the
+  Baack editor can edit it in place. `TASK_COPY` lists every item name and placeholder.
+- **Peers.** React 19, and `@baack-software/baack-ts-components` for the copy.
+
+Try it with a fake API: `npm run demo`. Add `?layout=table`, `?group=workflowStage`, `?task=t-hero` or `?theme=dark`
+to the URL; `?about=co-acme` shows a page about a company with its `TasksAbout` panel; with `?task=t-hero&conflict`,
+someone else edits the task shortly after loading, so changing its title shows a conflict.
+
+Timestamps are UTC without a zone. Use `parseTimestamp`, `toTimestamp`, `toLocalInput` and `fromLocalInput` rather
+than `new Date(timestamp)`, which reads them as local time.
+
+### Server: webhooks and automations
+
+`@baack-software/baack-ts-tasks/server` is for webhook endpoints and scheduled jobs, with a token that can write
+tasks, so never in a browser. It uses Web Crypto and the Fetch API types, so it runs on Node 20+, Deno, Bun and edge
+runtimes.
+
+```ts
+import { webhookHandler, taskFromWebhook, unblockOnCompletion, welcomeNewCompany } from '@baack-software/baack-ts-tasks/server';
+
+// A Fetch API handler: verifies the signature, skips retries already handled, then runs onEvent.
+export const POST = webhookHandler({
+  secret: process.env.BAACK_WEBHOOK_SECRET!,
+  onEvent: async ({ event }) => {
+    await welcomeNewCompany(event, tasks, { owner: companyUrn }); // on COMPANY CREATE
+    await unblockOnCompletion(event, tasks);                       // on TASK UPDATE to a finished status
+  },
+});
+```
+
+A delivery's `Signature` is a base64 HMAC-SHA256, keyed with the subscription's secret, over the raw body, then the
+`Last-Modified` timestamp, then the `Idempotency-Key` (the trigger's URN), as `Signed-Headers` lists them.
+`verifyWebhook({ body, headers }, secret)` checks it on its own; pass the body exactly as received, since
+re-serialised JSON won't match. Events carry no task, so `taskFromWebhook` reads it (`null` once deleted). Retries
+reuse the idempotency key: the handler remembers keys in memory by default; pass an `idempotency` store backed by
+your database when several processes receive deliveries. `signWebhook` signs a body the same way, for tests and for
+replaying deliveries locally. `overdueTasks(tasks, owner)` and `byAssignee` are for a nightly reminder job.
+
+## Development
+
+The client is linked from `../baack-ts-client` while both change; build it there first.
+
+```sh
+npm install
+npm test
+npm run typecheck
+npm run build
+```

package/dist/activity.d.ts

@@ -0,0 +1,20 @@
+import type { TaskLog } from '@baack-software/baack-ts-client';
+import type { Activity } from './types.ts';
+/** What happened, as a short sentence without the subject, e.g. "Status set to In progress". */
+export declare const ACTIVITY_LABELS: Readonly<Record<Activity, string>>;
+/** A readable label for an activity, falling back to the raw value in lower case for activities added later. */
+export declare function activityLabel(activity: string): string;
+/** Whether the log entry is a comment rather than a recorded change. */
+export declare function isComment(log: Pick<TaskLog, 'activity'>): boolean;
+/** A comment and the replies to it, oldest reply first. */
+export interface CommentThread {
+    comment: TaskLog;
+    replies: TaskLog[];
+}
+/**
+ * Groups comments into threads by `replyTo`, most recently active thread first. Expects `logs` newest first, as the
+ * API returns them.
+ * A reply whose parent is not in `logs` (for example on an older page) starts its own thread.
+ */
+export declare function commentThreads(logs: readonly TaskLog[]): CommentThread[];
+//# sourceMappingURL=activity.d.ts.map

package/dist/activity.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"activity.d.ts","sourceRoot":"","sources":["../src/activity.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,iCAAiC,CAAC;AAC/D,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAE3C,gGAAgG;AAChG,eAAO,MAAM,eAAe,EAAE,QAAQ,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,CAqC9D,CAAC;AAEF,gHAAgH;AAChH,wBAAgB,aAAa,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,CAEtD;AAED,wEAAwE;AACxE,wBAAgB,SAAS,CAAC,GAAG,EAAE,IAAI,CAAC,OAAO,EAAE,UAAU,CAAC,GAAG,OAAO,CAEjE;AAED,2DAA2D;AAC3D,MAAM,WAAW,aAAa;IAC5B,OAAO,EAAE,OAAO,CAAC;IACjB,OAAO,EAAE,OAAO,EAAE,CAAC;CACpB;AAED;;;;GAIG;AACH,wBAAgB,cAAc,CAAC,IAAI,EAAE,SAAS,OAAO,EAAE,GAAG,aAAa,EAAE,CAqBxE"}

package/dist/activity.js

@@ -0,0 +1,75 @@
+/** What happened, as a short sentence without the subject, e.g. "Status set to In progress". */
+export const ACTIVITY_LABELS = {
+    CREATED: 'Created',
+    STATUS_UNDEFINED: 'Status set to Undefined',
+    STATUS_PENDING: 'Status set to Pending',
+    STATUS_IN_PROGRESS: 'Status set to In progress',
+    STATUS_BLOCKED: 'Status set to Blocked',
+    STATUS_COMPLETED: 'Status set to Completed',
+    STATUS_COMPL_ETED: 'Status set to Completed',
+    STATUS_CLOSED: 'Status set to Closed',
+    PRIORITY_NONE: 'Priority set to None',
+    PRIORITY_LOW: 'Priority set to Low',
+    PRIORITY_MEDIUM: 'Priority set to Medium',
+    PRIORITY_HIGH: 'Priority set to High',
+    PRIORITY_CRITICAL: 'Priority set to Critical',
+    WORKFLOW_STAGE_SET: 'Moved to a workflow stage',
+    WORKFLOW_STAGE_UNSET: 'Removed from its workflow stage',
+    COMMENT_ADDED: 'Commented',
+    WORK_TASK_ASSOCIATION_ADDED: 'Related task added',
+    WORK_TASK_ASSOCIATION_REMOVED: 'Related task removed',
+    WORK_TASK_BLOCKER_ADDED: 'Blocker added',
+    WORK_TASK_BLOCKER_REMOVED: 'Blocker removed',
+    WORK_TASK_BLOCKING_ADDED: 'Now blocking a task',
+    WORK_TASK_BLOCKING_REMOVED: 'No longer blocking a task',
+    WORK_TASK_ENTITY_ADDED: 'Content added',
+    WORK_TASK_ENTITY_REMOVED: 'Content removed',
+    WORK_TASK_IDENTITY_ADDED: 'Person added',
+    WORK_TASK_IDENTITY_REMOVED: 'Person removed',
+    WORK_TASK_COMPANY_ADDED: 'Company added',
+    WORK_TASK_COMPANY_REMOVED: 'Company removed',
+    WORK_PROJECT_SET: 'Added to a project',
+    WORK_PROJECT_UNSET: 'Removed from its project',
+    ASSIGNED: 'Assigned',
+    UNASSIGNED: 'Unassigned',
+    TITLE_UPDATED: 'Title changed',
+    DESCRIPTION_UPDATED: 'Description changed',
+    DUE_DATE_UPDATED: 'Due date changed',
+    DUE_DATE_UNSET: 'Due date removed',
+};
+/** A readable label for an activity, falling back to the raw value in lower case for activities added later. */
+export function activityLabel(activity) {
+    return ACTIVITY_LABELS[activity] ?? activity.toLowerCase().replaceAll('_', ' ');
+}
+/** Whether the log entry is a comment rather than a recorded change. */
+export function isComment(log) {
+    return log.activity === 'COMMENT_ADDED';
+}
+/**
+ * Groups comments into threads by `replyTo`, most recently active thread first. Expects `logs` newest first, as the
+ * API returns them.
+ * A reply whose parent is not in `logs` (for example on an older page) starts its own thread.
+ */
+export function commentThreads(logs) {
+    const comments = logs.filter(isComment);
+    const byUrn = new Map(comments.map((log) => [log.urn, log]));
+    const rootOf = (log) => {
+        const seen = new Set();
+        let current = log;
+        while (current.replyTo && byUrn.has(current.replyTo.urn) && !seen.has(current.urn)) {
+            seen.add(current.urn);
+            current = byUrn.get(current.replyTo.urn);
+        }
+        return current;
+    };
+    const threads = new Map();
+    for (const log of comments) {
+        const root = rootOf(log);
+        const thread = threads.get(root.urn) ?? { comment: root, replies: [] };
+        if (root !== log)
+            thread.replies.unshift(log);
+        threads.set(root.urn, thread);
+    }
+    return [...threads.values()];
+}
+//# sourceMappingURL=activity.js.map

package/dist/activity.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"activity.js","sourceRoot":"","sources":["../src/activity.ts"],"names":[],"mappings":"AAGA,gGAAgG;AAChG,MAAM,CAAC,MAAM,eAAe,GAAuC;IACjE,OAAO,EAAE,SAAS;IAClB,gBAAgB,EAAE,yBAAyB;IAC3C,cAAc,EAAE,uBAAuB;IACvC,kBAAkB,EAAE,2BAA2B;IAC/C,cAAc,EAAE,uBAAuB;IACvC,gBAAgB,EAAE,yBAAyB;IAC3C,iBAAiB,EAAE,yBAAyB;IAC5C,aAAa,EAAE,sBAAsB;IACrC,aAAa,EAAE,sBAAsB;IACrC,YAAY,EAAE,qBAAqB;IACnC,eAAe,EAAE,wBAAwB;IACzC,aAAa,EAAE,sBAAsB;IACrC,iBAAiB,EAAE,0BAA0B;IAC7C,kBAAkB,EAAE,2BAA2B;IAC/C,oBAAoB,EAAE,iCAAiC;IACvD,aAAa,EAAE,WAAW;IAC1B,2BAA2B,EAAE,oBAAoB;IACjD,6BAA6B,EAAE,sBAAsB;IACrD,uBAAuB,EAAE,eAAe;IACxC,yBAAyB,EAAE,iBAAiB;IAC5C,wBAAwB,EAAE,qBAAqB;IAC/C,0BAA0B,EAAE,2BAA2B;IACvD,sBAAsB,EAAE,eAAe;IACvC,wBAAwB,EAAE,iBAAiB;IAC3C,wBAAwB,EAAE,cAAc;IACxC,0BAA0B,EAAE,gBAAgB;IAC5C,uBAAuB,EAAE,eAAe;IACxC,yBAAyB,EAAE,iBAAiB;IAC5C,gBAAgB,EAAE,oBAAoB;IACtC,kBAAkB,EAAE,0BAA0B;IAC9C,QAAQ,EAAE,UAAU;IACpB,UAAU,EAAE,YAAY;IACxB,aAAa,EAAE,eAAe;IAC9B,mBAAmB,EAAE,qBAAqB;IAC1C,gBAAgB,EAAE,kBAAkB;IACpC,cAAc,EAAE,kBAAkB;CACnC,CAAC;AAEF,gHAAgH;AAChH,MAAM,UAAU,aAAa,CAAC,QAAgB;IAC5C,OAAQ,eAA0C,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,WAAW,EAAE,CAAC,UAAU,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;AAC9G,CAAC;AAED,wEAAwE;AACxE,MAAM,UAAU,SAAS,CAAC,GAA8B;IACtD,OAAO,GAAG,CAAC,QAAQ,KAAK,eAAe,CAAC;AAC1C,CAAC;AAQD;;;;GAIG;AACH,MAAM,UAAU,cAAc,CAAC,IAAwB;IACrD,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IACxC,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAC7D,MAAM,MAAM,GAAG,CAAC,GAAY,EAAW,EAAE;QACvC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,IAAI,OAAO,GAAG,GAAG,CAAC;QAClB,OAAO,OAAO,CAAC,OAAO,IAAI,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YACnF,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YACtB,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAE,CAAC;QAC5C,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC,CAAC;IAEF,MAAM,OAAO,GAAG,IAAI,GAAG,EAAyB,CAAC;IACjD,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;QACzB,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;QACvE,IAAI,IAAI,KAAK,GAAG;YAAE,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAC9C,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;IAChC,CAAC;IACD,OAAO,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;AAC/B,CAAC"}

package/dist/blockers.d.ts

@@ -0,0 +1,28 @@
+import type { Task } from '@baack-software/baack-ts-client';
+import type { RefLike } from './types.ts';
+/** Finds a task by URN, for example from a store or a `Map`. */
+export type TaskLookup = (urn: string) => Task | undefined;
+/** A lookup over a list of tasks. */
+export declare function lookupFrom(tasks: Iterable<Task>): TaskLookup;
+/**
+ * The URNs of the tasks blocking `task` that are still open. A blocker the lookup doesn't know counts as open, since
+ * the task may be blocked by work the reader can't see.
+ */
+export declare function openBlockers(task: Task, lookup: TaskLookup): string[];
+/** Whether every task blocking `task` is done, so work can start. */
+export declare function isUnblocked(task: Task, lookup: TaskLookup): boolean;
+/**
+ * Blocking edges among `tasks`, from each task to the tasks it blocks. Reads both `blocking` and `blockedBy`, so an
+ * edge recorded on only one side still counts.
+ */
+export declare function blockingGraph(tasks: Iterable<Task>): Map<string, Set<string>>;
+/** A cycle of blocking tasks as a list of URNs (the first task blocks the second, and so on, back to the first), or undefined. */
+export declare function findBlockingCycle(tasks: Iterable<Task>): string[] | undefined;
+/** Whether making `blocker` block `task` would create a cycle, given the current `tasks`. */
+export declare function wouldCreateCycle(tasks: Iterable<Task>, task: RefLike, blocker: RefLike): boolean;
+/**
+ * Tasks in an order where each comes after the tasks blocking it, keeping the given order otherwise. Tasks in a
+ * cycle are placed at the end in their given order.
+ */
+export declare function dependencyOrder(tasks: readonly Task[]): Task[];
+//# sourceMappingURL=blockers.d.ts.map

package/dist/blockers.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"blockers.d.ts","sourceRoot":"","sources":["../src/blockers.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,iCAAiC,CAAC;AAG5D,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,YAAY,CAAC;AAE1C,gEAAgE;AAChE,MAAM,MAAM,UAAU,GAAG,CAAC,GAAG,EAAE,MAAM,KAAK,IAAI,GAAG,SAAS,CAAC;AAE3D,qCAAqC;AACrC,wBAAgB,UAAU,CAAC,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,GAAG,UAAU,CAI5D;AAED;;;GAGG;AACH,wBAAgB,YAAY,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,UAAU,GAAG,MAAM,EAAE,CAOrE;AAED,qEAAqE;AACrE,wBAAgB,WAAW,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,UAAU,GAAG,OAAO,CAEnE;AAED;;;GAGG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAa7E;AAED,kIAAkI;AAClI,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,GAAG,MAAM,EAAE,GAAG,SAAS,CA4B7E;AAED,6FAA6F;AAC7F,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,GAAG,OAAO,CAkBhG;AAED;;;GAGG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,SAAS,IAAI,EAAE,GAAG,IAAI,EAAE,CAyB9D"}

package/dist/blockers.js

@@ -0,0 +1,134 @@
+import { urnOf } from "./refs.js";
+import { isOpen } from "./tasks.js";
+/** A lookup over a list of tasks. */
+export function lookupFrom(tasks) {
+    const byUrn = new Map();
+    for (const task of tasks)
+        byUrn.set(task.urn, task);
+    return (urn) => byUrn.get(urn);
+}
+/**
+ * The URNs of the tasks blocking `task` that are still open. A blocker the lookup doesn't know counts as open, since
+ * the task may be blocked by work the reader can't see.
+ */
+export function openBlockers(task, lookup) {
+    return (task.blockedBy ?? [])
+        .map((blocker) => blocker.urn)
+        .filter((urn) => {
+        const blocker = lookup(urn);
+        return blocker === undefined || isOpen(blocker);
+    });
+}
+/** Whether every task blocking `task` is done, so work can start. */
+export function isUnblocked(task, lookup) {
+    return openBlockers(task, lookup).length === 0;
+}
+/**
+ * Blocking edges among `tasks`, from each task to the tasks it blocks. Reads both `blocking` and `blockedBy`, so an
+ * edge recorded on only one side still counts.
+ */
+export function blockingGraph(tasks) {
+    const graph = new Map();
+    const edge = (from, to) => {
+        const targets = graph.get(from) ?? new Set();
+        targets.add(to);
+        graph.set(from, targets);
+    };
+    for (const task of tasks) {
+        if (!graph.has(task.urn))
+            graph.set(task.urn, new Set());
+        for (const blocked of task.blocking ?? [])
+            edge(task.urn, blocked.urn);
+        for (const blocker of task.blockedBy ?? [])
+            edge(blocker.urn, task.urn);
+    }
+    return graph;
+}
+/** A cycle of blocking tasks as a list of URNs (the first task blocks the second, and so on, back to the first), or undefined. */
+export function findBlockingCycle(tasks) {
+    const graph = blockingGraph(tasks);
+    const state = new Map();
+    const path = [];
+    const visit = (urn) => {
+        state.set(urn, 'visiting');
+        path.push(urn);
+        for (const next of graph.get(urn) ?? []) {
+            const seen = state.get(next);
+            if (seen === 'visiting')
+                return path.slice(path.indexOf(next));
+            if (seen === undefined) {
+                const cycle = visit(next);
+                if (cycle)
+                    return cycle;
+            }
+        }
+        path.pop();
+        state.set(urn, 'done');
+        return undefined;
+    };
+    for (const urn of graph.keys()) {
+        if (state.get(urn) === undefined) {
+            const cycle = visit(urn);
+            if (cycle)
+                return cycle;
+        }
+    }
+    return undefined;
+}
+/** Whether making `blocker` block `task` would create a cycle, given the current `tasks`. */
+export function wouldCreateCycle(tasks, task, blocker) {
+    const from = urnOf(blocker);
+    const to = urnOf(task);
+    if (from === to)
+        return true;
+    // A cycle appears when the blocker is already reachable from the task it would block.
+    const graph = blockingGraph(tasks);
+    const queue = [to];
+    const seen = new Set(queue);
+    for (let urn = queue.shift(); urn !== undefined; urn = queue.shift()) {
+        for (const next of graph.get(urn) ?? []) {
+            if (next === from)
+                return true;
+            if (!seen.has(next)) {
+                seen.add(next);
+                queue.push(next);
+            }
+        }
+    }
+    return false;
+}
+/**
+ * Tasks in an order where each comes after the tasks blocking it, keeping the given order otherwise. Tasks in a
+ * cycle are placed at the end in their given order.
+ */
+export function dependencyOrder(tasks) {
+    const known = new Set(tasks.map((task) => task.urn));
+    const graph = blockingGraph(tasks);
+    const waiting = new Map(tasks.map((task) => [task.urn, 0]));
+    for (const [from, targets] of graph) {
+        if (!known.has(from))
+            continue;
+        for (const to of targets)
+            if (known.has(to))
+                waiting.set(to, (waiting.get(to) ?? 0) + 1);
+    }
+    const ordered = [];
+    const placed = new Set();
+    let progress = true;
+    while (progress) {
+        progress = false;
+        for (const task of tasks) {
+            if (placed.has(task.urn) || waiting.get(task.urn) !== 0)
+                continue;
+            ordered.push(task);
+            placed.add(task.urn);
+            progress = true;
+            for (const to of graph.get(task.urn) ?? []) {
+                if (known.has(to))
+                    waiting.set(to, (waiting.get(to) ?? 0) - 1);
+            }
+        }
+    }
+    return [...ordered, ...tasks.filter((task) => !placed.has(task.urn))];
+}
+//# sourceMappingURL=blockers.js.map

package/dist/blockers.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"blockers.js","sourceRoot":"","sources":["../src/blockers.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,KAAK,EAAE,MAAM,WAAW,CAAC;AAClC,OAAO,EAAE,MAAM,EAAE,MAAM,YAAY,CAAC;AAMpC,qCAAqC;AACrC,MAAM,UAAU,UAAU,CAAC,KAAqB;IAC9C,MAAM,KAAK,GAAG,IAAI,GAAG,EAAgB,CAAC;IACtC,KAAK,MAAM,IAAI,IAAI,KAAK;QAAE,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;IACpD,OAAO,CAAC,GAAG,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AACjC,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,YAAY,CAAC,IAAU,EAAE,MAAkB;IACzD,OAAO,CAAC,IAAI,CAAC,SAAS,IAAI,EAAE,CAAC;SAC1B,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC;SAC7B,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE;QACd,MAAM,OAAO,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;QAC5B,OAAO,OAAO,KAAK,SAAS,IAAI,MAAM,CAAC,OAAO,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;AACP,CAAC;AAED,qEAAqE;AACrE,MAAM,UAAU,WAAW,CAAC,IAAU,EAAE,MAAkB;IACxD,OAAO,YAAY,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC;AACjD,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,aAAa,CAAC,KAAqB;IACjD,MAAM,KAAK,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC7C,MAAM,IAAI,GAAG,CAAC,IAAY,EAAE,EAAU,EAAE,EAAE;QACxC,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;QACrD,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAChB,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;IAC3B,CAAC,CAAC;IACF,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC;YAAE,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QACzD,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,QAAQ,IAAI,EAAE;YAAE,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC;QACvE,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,SAAS,IAAI,EAAE;YAAE,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;IAC1E,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,kIAAkI;AAClI,MAAM,UAAU,iBAAiB,CAAC,KAAqB;IACrD,MAAM,KAAK,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC;IACnC,MAAM,KAAK,GAAG,IAAI,GAAG,EAA+B,CAAC;IACrD,MAAM,IAAI,GAAa,EAAE,CAAC;IAE1B,MAAM,KAAK,GAAG,CAAC,GAAW,EAAwB,EAAE;QAClD,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC;QAC3B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACf,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC;YACxC,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAC7B,IAAI,IAAI,KAAK,UAAU;gBAAE,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;YAC/D,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;gBACvB,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;gBAC1B,IAAI,KAAK;oBAAE,OAAO,KAAK,CAAC;YAC1B,CAAC;QACH,CAAC;QACD,IAAI,CAAC,GAAG,EAAE,CAAC;QACX,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;QACvB,OAAO,SAAS,CAAC;IACnB,CAAC,CAAC;IAEF,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;QAC/B,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,SAAS,EAAE,CAAC;YACjC,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;YACzB,IAAI,KAAK;gBAAE,OAAO,KAAK,CAAC;QAC1B,CAAC;IACH,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,6FAA6F;AAC7F,MAAM,UAAU,gBAAgB,CAAC,KAAqB,EAAE,IAAa,EAAE,OAAgB;IACrF,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC;IAC5B,MAAM,EAAE,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;IACvB,IAAI,IAAI,KAAK,EAAE;QAAE,OAAO,IAAI,CAAC;IAC7B,sFAAsF;IACtF,MAAM,KAAK,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC;IACnC,MAAM,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;IACnB,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;IAC5B,KAAK,IAAI,GAAG,GAAG,KAAK,CAAC,KAAK,EAAE,EAAE,GAAG,KAAK,SAAS,EAAE,GAAG,GAAG,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;QACrE,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC;YACxC,IAAI,IAAI,KAAK,IAAI;gBAAE,OAAO,IAAI,CAAC;YAC/B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBACpB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBACf,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACnB,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,eAAe,CAAC,KAAsB;IACpD,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IACrD,MAAM,KAAK,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC;IACnC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAiB,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5E,KAAK,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,KAAK,EAAE,CAAC;QACpC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,SAAS;QAC/B,KAAK,MAAM,EAAE,IAAI,OAAO;YAAE,IAAI,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,OAAO,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC3F,CAAC;IAED,MAAM,OAAO,GAAW,EAAE,CAAC;IAC3B,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;IACjC,IAAI,QAAQ,GAAG,IAAI,CAAC;IACpB,OAAO,QAAQ,EAAE,CAAC;QAChB,QAAQ,GAAG,KAAK,CAAC;QACjB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC;gBAAE,SAAS;YAClE,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACnB,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACrB,QAAQ,GAAG,IAAI,CAAC;YAChB,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC;gBAC3C,IAAI,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;oBAAE,OAAO,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACjE,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,CAAC,GAAG,OAAO,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AACxE,CAAC"}