@thomasfosterau/pulpit 0.0.0 → 0.1.0

package/dist/edges.js

@@ -0,0 +1,558 @@
+/**
+ * **The edge operations factory** — a relation between nodes as its own
+ * family: a bounded list, a read by id, an idempotent create and a hard
+ * delete, gated by the visibility of the nodes the edge joins.
+ *
+ * The behavioural spec is gardeneria's `apps/api/src/operations/edge-ops.ts`
+ * (`defineEdgeOpsE`), which exists because hand-rolled edge families drift,
+ * and the ninth family's viewer gate or `LIMIT` gets forgotten. Its
+ * hand-rolled owned-child family (`disorders.ts`, the observation → disorder
+ * edge) is the spec for the endpoint gates. A `#NNN` here names a gardeneria
+ * issue.
+ *
+ * ## What an edge is
+ *
+ * An edge is a plain row in its own table: an id, a `createdAt`, one column
+ * per **end** holding the id of the node at that end, and any qualifier
+ * columns of the family's own. It is **not** a node: it has no version chain,
+ * so the chain invariants (`VERSION-CHAIN-001/002`) do not govern it. A delete
+ * is a hard `DELETE`, and there is no update: correcting an edge is deleting
+ * it and asserting the right one. A family declares zero, one or two (or
+ * more) ends; with none, it is a plain bounded row family (gardeneria's
+ * `page_collections`).
+ *
+ * ## The invariants
+ *
+ * - **An edge is readable only if the viewer can read every end**
+ *   (`EDGE-001`). Each end's node is checked against its own leaf's access
+ *   declaration, as that leaf's own `get` and list filter read it (a
+ *   reference leaf's followers arm included, pulpit#92). `get` answers a
+ *   hidden edge as {@link EdgeNotFound} and `list` omits it, never `Forbidden`
+ *   (`SEC-AUTH-ENUM-001`); a related list (the edges at one node) is a `list`
+ *   filtered on that end, so it omits every edge whose other end is hidden.
+ * - **The list filter and the per-edge predicate never disagree.**
+ *   {@link endpointFilter} renders the same facts {@link canViewEndpoint}
+ *   reads, over the ends' joined views; `tests/edges.test.ts` checks every
+ *   endpoint state × viewer.
+ * - **A tombstoned end hides its edges** from every viewer below the
+ *   view-deleted rung. That rung reads a tombstoned end as the leaf's own
+ *   `get` reads the tombstone, by its access rule (pulpit#93), so it can
+ *   list, read and delete an edge whose only hidden end is tombstoned; an
+ *   end hidden for any other reason (a `private` node below the
+ *   view-private rung, say) still hides the edge from it. Nothing is
+ *   deleted: restoring the node (the explicit `restore`,
+ *   `VERSION-CHAIN-006`) brings its edges back as they were.
+ * - **A create names only live nodes the viewer can read.** An end naming a
+ *   missing, hidden or tombstoned node fails `NodeNotFound` (the
+ *   view-deleted rung included), so a create cannot confirm a node exists.
+ * - **Cardinality is declared, and a create past it fails**
+ *   ({@link EdgeCardinalityExceeded}). An end's `maxEdges` bounds how many
+ *   edges may share one node at that end, counting only the edges the
+ *   caller can read whose every end is live (pulpit#77, pulpit#93). A
+ *   hidden edge never counts, so a refusal discloses nothing the caller
+ *   can't read; the cost is a limit that holds only over what each caller
+ *   sees, and a restore that can bring a node past it (see
+ *   {@link EdgeEnd.maxEdges}). A re-assertion of a stored edge resolves
+ *   before the count, so it stays idempotent at a full node.
+ * - **A write discloses no hidden edge's state.** A create runs in the
+ *   order ends → write gate → unique-key collision → cardinality count.
+ *   Under `"fail"` a collision with a hidden edge answers exactly as one
+ *   with a readable edge; under `"ignore"` only a readable, live edge
+ *   resolves, and any other collision is {@link EdgeConflict}. The count
+ *   reads only readable edges (README → `./edges` → What a write
+ *   discloses).
+ * - **Every list is bounded** (`SEC-INPUT-003`): a page is capped at
+ *   `MAX_PAGE_LIMIT`.
+ *
+ * ## The seam
+ *
+ * The edges are read and written through an {@link EdgeStore} the
+ * application supplies (a Drizzle store over the edge table, joining each
+ * end's current-version view; see the package README → Seams). Each end
+ * reads its nodes through an {@link EndpointView}, which a `./subtype`
+ * `LeafStore` already satisfies.
+ *
+ * @copyright Thomas Foster
+ * @module pulpit/edges
+ * @since 0.1.0
+ */
+import * as Arr from "effect/Array";
+import * as Effect from "effect/Effect";
+import * as Formatter from "effect/Formatter";
+import * as HashMap from "effect/HashMap";
+import * as Option from "effect/Option";
+import * as Order from "effect/Order";
+import * as Predicate from "effect/Predicate";
+import * as Record from "effect/Record";
+import * as Schema from "effect/Schema";
+import { always, and, anyOf, eq, gt, isIn, isNull, lt, lte, isNotIn, MAX_SET_VALUES, never, or, } from "./filter.js";
+import { renameColumns } from "./internal/filter-columns.js";
+import { canViewOwnedRow, declaresColumns, ownedFacts } from "./internal/owned-columns.js";
+import { canViewReferenceRow, referenceListFilter } from "./internal/reference-columns.js";
+import { Forbidden, MAX_PAGE_LIMIT, ownedListFilter, readScopeFor, Unauthorized, } from "./subtype.js";
+import { NodeNotFound } from "./version-chain.js";
+/** A column value as text for an error: a string as itself, anything else formatted (never `[object Object]`). */
+const columnText = (value) => Predicate.isString(value) ? value : Formatter.format(value);
+// ── Errors ────────────────────────────────────────────────────────────
+/**
+ * No edge with this id that the viewer may read: missing, or hidden because
+ * an end is (`SEC-AUTH-ENUM-001`, `EDGE-001`). The wire's 404.
+ *
+ * @since 0.1.0
+ */
+export class EdgeNotFound extends Schema.TaggedError()("EdgeNotFound", {
+    type: Schema.String,
+    id: Schema.String,
+}) {
+}
+/**
+ * A create collided with a stored edge on the family's unique key, and the
+ * family's conflict policy does not resolve it: `onConflict: "fail"`, or the
+ * edge it collided with is one the viewer may not read or has a tombstoned
+ * end. The wire's 409. It carries only the family's type, so under `"fail"`
+ * a collision with a hidden edge is the same answer as one with a readable
+ * edge (`SEC-AUTH-ENUM-001`, pulpit#93); under `"ignore"` only a readable,
+ * live edge resolves, and any other collision is this error. It says the
+ * key is taken, never by which edge.
+ *
+ * @since 0.1.0
+ */
+export class EdgeConflict extends Schema.TaggedError()("EdgeConflict", {
+    type: Schema.String,
+}) {
+}
+/**
+ * A create would put more edges at one node than its end's declared
+ * `maxEdges` allows, counting only the edges the caller can read whose every
+ * end is live ({@link EdgeEnd.maxEdges}). The wire's 409.
+ *
+ * @since 0.1.0
+ */
+export class EdgeCardinalityExceeded extends Schema.TaggedError()("EdgeCardinalityExceeded", {
+    /** The edge family's wire type. */
+    type: Schema.String,
+    /** The end (its alias in the declaration) whose limit was reached. */
+    end: Schema.String,
+    /** The node at that end, which already holds `max` edges the caller can read. */
+    nodeId: Schema.String,
+    /** The declared limit. */
+    max: Schema.Int,
+}) {
+}
+/**
+ * An edge family declared against the rules: an end's alias contains a `.`,
+ * or its `maxEdges` is not a positive safe integer. Thrown by
+ * {@link defineEdgeOps} when the family is declared, never an Effect failure,
+ * like `RegistryDeclarationError`: a malformed family must stop its module
+ * loading rather than fail open (a `NaN` limit admits every create) or
+ * refuse every create (a limit of `0`).
+ *
+ * @since 0.1.0
+ */
+export class EdgeDeclarationError extends Schema.TaggedError()("EdgeDeclarationError", { message: Schema.String }) {
+}
+/**
+ * The list-filter column naming `column` of the node at end `alias`:
+ * `alias.column`. {@link endpointFilter} writes these, a family's own list
+ * filter may too, and a store renders each against the view it joined under
+ * that alias.
+ *
+ * @since 0.1.0
+ */
+export const endpointColumn = (alias, column) => `${alias}.${column}`;
+/** Every column of `filter` rewritten to name the node at end `alias`. */
+const qualify = (alias, filter) => renameColumns(filter, (column) => endpointColumn(alias, column));
+/** A live node: its head is a `create` or an `update`, never a tombstone. */
+const isLive = (row) => row.action === "create" || row.action === "update";
+/** {@link isLive} as a list filter over one view's columns. */
+const liveFilter = () => or(eq("action", "create"), eq("action", "update"));
+/**
+ * Whether the viewer may read the node at one end (`EDGE-001`): it exists,
+ * it is live or the viewer holds the view-deleted rung (a tombstone is read
+ * as the leaf's own `get` reads it, pulpit#93), and its leaf's access admits
+ * the viewer, a tombstone's included. A reference node is
+ * readable when its view has no `visibility` column, the viewer holds the
+ * view-private rung, it is `public`, or it is `followers` and the viewer is,
+ * or follows, the account its leaf's declared `followersOfColumn` names (the
+ * predicate `defineSubtype`'s `get` runs, pulpit#92); an owned node through
+ * `canViewOwned`'s predicate, where an owner column holding no string reads
+ * as no owner, matching no viewer and never asked of the follower seam. An
+ * owned declaration naming a column the view lacks reads nothing. Never
+ * fails.
+ *
+ * @since 0.1.0
+ */
+export const canViewEndpoint = (end, viewer, policy, followers, node) => {
+    if (Option.isNone(node))
+        return Effect.succeed(false);
+    if (!isLive(node.value) && !Option.exists(viewer, policy.canViewDeleted)) {
+        return Effect.succeed(false);
+    }
+    const { access } = end;
+    const { columns } = end.nodes;
+    if (access.kind === "reference") {
+        return canViewReferenceRow(access, columns, viewer, policy, followers, node.value);
+    }
+    if (!declaresColumns(access, columns))
+        return Effect.succeed(false);
+    return canViewOwnedRow(viewer, policy, followers, ownedFacts(access, node.value));
+};
+/**
+ * The list arm of `EDGE-001`: for every end, its node is live (or the viewer
+ * holds the view-deleted rung) and readable by the viewer, over the columns
+ * {@link endpointColumn} names. The same facts as {@link canViewEndpoint},
+ * rendered as a `ListFilter` — the owned arm is `ownedListFilter`, the
+ * reference arm `referencePrivacyFilter`'s, followers arm included
+ * (pulpit#92) — so the two never disagree. A
+ * family with no ends gets `always`.
+ *
+ * @since 0.1.0
+ */
+export const endpointFilter = (ends, viewer, policy, followers) => {
+    const scope = readScopeFor(viewer, policy, followers);
+    const lifecycle = Option.exists(viewer, policy.canViewDeleted) ? always : liveFilter();
+    return and(...Record.toEntries(ends).map(([alias, end]) => qualify(alias, and(lifecycle, end.access.kind === "owned"
+        ? ownedListFilter(end.access, end.nodes.columns, scope)
+        : referenceListFilter(end.access, end.nodes.columns, scope)))));
+};
+/** Every end's node is live, over the columns {@link endpointColumn} names: the cardinality count's other arm. */
+const liveEndsFilter = (ends) => and(...Record.toEntries(ends).map(([alias]) => qualify(alias, liveFilter())));
+/**
+ * A gate on one rung of the role axes: anonymous fails `Unauthorized`, a
+ * signed-in viewer below the rung `Forbidden`. `rungGate((policy) =>
+ * policy.canModerate)` is the moderator rung gardeneria's CMS edges take.
+ *
+ * @since 0.1.0
+ */
+export const rungGate = (rung) => (request) => Option.match(request.viewer, {
+    onNone: () => Effect.fail(new Unauthorized()),
+    onSome: (account) => rung(request.policy)(account) ? Effect.succeed(account) : Effect.fail(new Forbidden()),
+});
+/**
+ * The default write gate: the corpus-write rung. Right for an edge joining
+ * reference rows, which is itself reference data.
+ *
+ * @since 0.1.0
+ */
+export const corpusWriteGate = rungGate((policy) => policy.canWriteCorpus);
+/**
+ * An edge's validity interval is malformed: a bound that is neither a
+ * `Date` nor `NULL`, `from` after `to`, or a close that would widen it. The
+ * wire's 422.
+ *
+ * @since 0.1.0
+ */
+export class InvalidValidity extends Schema.TaggedError()("InvalidValidity", {
+    type: Schema.String,
+    reason: Schema.String,
+}) {
+}
+/**
+ * The edges valid at `at` (pulpit#210), as a list filter over a family's
+ * {@link EdgeValidity} columns: `from` is `NULL` or at or before `at`, and
+ * `to` is `NULL` or after it. Pass it as a list's `where`, so "who held
+ * the office on that day" is one gated read.
+ *
+ * @example
+ * ```ts
+ * import { strictEqual } from "node:assert";
+ * import { validAt } from "@thomasfosterau/pulpit/edges";
+ * import { evaluate } from "@thomasfosterau/pulpit/filter";
+ *
+ * const filter = validAt({ from: "validFrom", to: "validTo" }, new Date("2020-06-01"));
+ * const context = { now: new Date(0), contains: () => false };
+ * const row = { validFrom: new Date("2020-01-01"), validTo: null };
+ * strictEqual(evaluate(filter, row, context), true);
+ * strictEqual(evaluate(filter, { ...row, validTo: new Date("2020-03-01") }, context), false);
+ * ```
+ *
+ * @since 0.1.0
+ */
+export const validAt = (validity, at) => and(or(isNull(validity.from), lte(validity.from, at)), or(isNull(validity.to), gt(validity.to, at)));
+/**
+ * The edges whose interval overlaps `[from, to)` (either bound none for
+ * open): `NULL`-or-before `to` on the `from` column, and `NULL`-or-after
+ * `from` on the `to` column.
+ */
+const overlapping = (validity, from, to) => and(Option.match(to, {
+    onNone: () => always,
+    onSome: (end) => or(isNull(validity.from), lt(validity.from, end)),
+}), Option.match(from, {
+    onNone: () => always,
+    onSome: (start) => or(isNull(validity.to), gt(validity.to, start)),
+}));
+/** A validity bound: a `Date`, none for `NULL` or absent, or a malformed value. */
+const boundOf = (values, column) => Option.match(Option.fromNullishOr(values[column]), {
+    onNone: () => Option.some(Option.none()),
+    onSome: (value) => Predicate.isDate(value) && !Number.isNaN(value.getTime())
+        ? Option.some(Option.some(value))
+        : Option.none(),
+});
+/** What is wrong with one end's declaration: an alias with a `.`, or a `maxEdges` that is not a positive safe integer. */
+const declarationProblem = ([alias, end]) => {
+    if (alias.includes(".")) {
+        return Option.some(`the end alias '${alias}' contains a '.', which endpointColumn reserves`);
+    }
+    const max = end.maxEdges;
+    if (max !== undefined && !(Number.isSafeInteger(max) && max > 0)) {
+        return Option.some(`the end '${alias}' declares maxEdges ${String(max)}, not a positive safe integer`);
+    }
+    return Option.none();
+};
+/** Throw {@link EdgeDeclarationError} on the first malformed end. */
+const validateEnds = (type, ends) => {
+    const problem = Arr.findFirst(Record.toEntries(ends), declarationProblem);
+    if (Option.isSome(problem)) {
+        throw new EdgeDeclarationError({ message: `${type}: ${problem.value}` });
+    }
+};
+/** The request's page window: the limit clamped to `[1, MAX_PAGE_LIMIT]` (`SEC-INPUT-003`), the offset to `≥ 0`. */
+const pageWindow = (request) => ({
+    limit: Math.max(1, Math.min(Math.trunc(request.limit), MAX_PAGE_LIMIT)),
+    offset: Math.max(0, Math.trunc(request.offset)),
+});
+/** The ends a create bounds, in the order their nodes are locked: ascending `nodeId`, so no two creates lock a pair in opposite orders. */
+const byNodeId = Order.mapInput(Order.String, (at) => at.nodeId);
+/**
+ * Bind an edge family's operations. Every produced operation is traced as
+ * `${type}.<operation>`; the writes run in the caller's transaction (the
+ * boundary is the caller's, website #1883), and a create's cardinality
+ * count and insert share it (README → Seams).
+ *
+ * Throws {@link EdgeDeclarationError}, when the family is declared, for an
+ * end alias containing a `.` or a `maxEdges` that is not a positive safe
+ * integer.
+ *
+ * @since 0.1.0
+ */
+export const defineEdgeOps = (definition) => {
+    const { type, ends, edges, policy, followers, toResource } = definition;
+    validateEnds(type, ends);
+    const validity = Option.fromUndefinedOr(definition.validity);
+    if (Option.isSome(validity)) {
+        if (validity.value.from === validity.value.to) {
+            throw new EdgeDeclarationError({ message: `${type}: validity names one column twice` });
+        }
+        if (edges.closeValidity === undefined) {
+            throw new EdgeDeclarationError({
+                message: `${type}: validity needs an edge store with closeValidity`,
+            });
+        }
+    }
+    const endEntries = Record.toEntries(ends);
+    const writeGate = definition.writeGate ?? corpusWriteGate;
+    const onConflict = definition.onConflict ?? "fail";
+    /** The node `edge` names at `end`, if the viewer may read it; none for a missing or non-string id. */
+    const readableNode = (end, viewer, edge) => {
+        const nodeId = edge[end.column];
+        return Predicate.isString(nodeId)
+            ? Effect.flatMap(end.nodes.get(nodeId), (node) => Effect.map(canViewEndpoint(end, viewer, policy, followers, node), (readable) => readable ? node : Option.none()))
+            : Effect.succeed(Option.none());
+    };
+    /**
+     * The node `edge` names at `end`, if the viewer may read it and it is
+     * live: what a create's ends must name, and the per-edge form of the
+     * cardinality count's filter (`endpointFilter` and `liveEndsFilter`).
+     */
+    const liveNode = (end, viewer, edge) => Effect.map(readableNode(end, viewer, edge), Option.filter(isLive));
+    /** The stored edge, if `node` finds every end's node for the viewer. */
+    const storedEdge = (node) => (viewer, id) => Effect.filterOrElse(edges.get(id), Option.isNone, (row) => Effect.map(Effect.forEach(endEntries, ([, end]) => node(end, viewer, row.value), {
+        concurrency: 1,
+    }), (found) => (Arr.every(found, Option.isSome) ? row : Option.none())));
+    /** The stored edge, if the viewer may read it (`EDGE-001`: every end's node is readable). */
+    const visibleEdge = storedEdge(readableNode);
+    /** The stored edge, if the cardinality count would admit it: readable, every end live. */
+    const countedEdge = storedEdge(liveNode);
+    /**
+     * A unique-key collision, settled by the conflict policy: only ever the id
+     * of an edge the count would admit, readable with every end live (owner
+     * decision on pulpit#93). The view-deleted rung reads an edge to a
+     * tombstone but can't link to one, so it can't resolve to one either.
+     */
+    const resolveCollision = (viewer, id) => Effect.gen(function* () {
+        if (onConflict === "fail")
+            return yield* new EdgeConflict({ type });
+        if (Option.isNone(yield* countedEdge(viewer, id)))
+            return yield* new EdgeConflict({ type });
+        return { id, created: false };
+    });
+    /**
+     * An end's declared `maxEdges`, checked against the edges its node already
+     * holds that `counted` admits: those the viewer can read, every end live.
+     */
+    const withinLimit = (counted) => (at) => Option.match(Option.fromNullishOr(at.end.maxEdges), {
+        onNone: () => Effect.void,
+        onSome: (max) => Effect.flatMap(edges.countAt({ column: at.end.column, nodeId: at.nodeId, where: counted }), (held) => held >= max
+            ? Effect.fail(new EdgeCardinalityExceeded({ type, end: at.alias, nodeId: at.nodeId, max }))
+            : Effect.void),
+    });
+    const list = Effect.fn(`${type}.list`)(function* (request) {
+        const viewer = yield* definition.viewer;
+        const where = and(endpointFilter(ends, viewer, policy, followers), request.where);
+        const { rows, total } = yield* edges.list({ where, ...pageWindow(request) });
+        return { rows: Arr.map(rows, toResource), total };
+    });
+    const get = Effect.fn(`${type}.get`)(function* (id) {
+        const row = yield* visibleEdge(yield* definition.viewer, id);
+        // Hidden and missing are the same answer (SEC-AUTH-ENUM-001).
+        if (Option.isNone(row))
+            return yield* new EdgeNotFound({ type, id });
+        return toResource(row.value);
+    });
+    /** The create's interval, checked (`from ≤ to`, each a `Date` or open), or none without one. */
+    const intervalOf = (values) => Option.match(validity, {
+        onNone: () => Effect.succeed(Option.none()),
+        onSome: (columns) => {
+            const from = boundOf(values, columns.from);
+            const to = boundOf(values, columns.to);
+            if (Option.isNone(from) || Option.isNone(to)) {
+                return Effect.fail(new InvalidValidity({ type, reason: "a validity bound is neither a date nor open" }));
+            }
+            const reversed = Option.isSome(from.value) &&
+                Option.isSome(to.value) &&
+                from.value.value.getTime() > to.value.value.getTime();
+            return reversed
+                ? Effect.fail(new InvalidValidity({ type, reason: "validity starts after it ends" }))
+                : Effect.succeedSome([from.value, to.value]);
+        },
+    });
+    const create = Effect.fn(`${type}.create`)(function* (input) {
+        const viewer = yield* definition.viewer;
+        const values = definition.values(input);
+        // The interval is the input's own shape: checked first, it reads nothing.
+        const interval = yield* intervalOf(values);
+        // Every end first, before the gate: a node the viewer cannot read is
+        // `NodeNotFound` whoever asks, so a gate's 403 never confirms it (#1306).
+        // An end must be live as well as readable: the view-deleted rung reads a
+        // tombstone, and still can't link to one.
+        const nodes = yield* Effect.forEach(endEntries, ([alias, end]) => Effect.flatMap(liveNode(end, viewer, values), (node) => Option.match(node, {
+            onNone: () => Effect.fail(new NodeNotFound({ type: end.type, id: columnText(values[end.column]) })),
+            onSome: (row) => Effect.succeed({ alias, end, nodeId: row.id }),
+        })), { concurrency: 1 });
+        yield* writeGate({ viewer, policy, edge: values });
+        // A re-assertion resolves before the cardinality check, so asserting an
+        // edge that is already there stays idempotent at a full end.
+        const collided = yield* edges.existing(values);
+        if (Option.isSome(collided))
+            return yield* resolveCollision(viewer, collided.value);
+        // Each bounded end's count locks its node (README → Seams), so the nodes
+        // are visited in one global order: a self-referential family's two
+        // bounded ends cannot deadlock two creates naming the pair both ways.
+        // Only edges the viewer can read with every end live count (pulpit#77,
+        // pulpit#93): a hidden edge must not shape the answer.
+        // With an interval, only the edges valid at the same time count (owner decision on pulpit#210).
+        const counted = and(endpointFilter(ends, viewer, policy, followers), liveEndsFilter(ends), Option.match(Option.all([validity, interval]), {
+            onNone: () => always,
+            onSome: ([columns, [from, to]]) => overlapping(columns, from, to),
+        }));
+        yield* Effect.forEach(Arr.sort(nodes, byNodeId), withinLimit(counted), {
+            concurrency: 1,
+            discard: true,
+        });
+        const inserted = yield* edges.insert(values);
+        if (Option.isSome(inserted))
+            return { id: inserted.value, created: true };
+        // A racing writer took the key between `existing` and the insert.
+        const raced = yield* edges.existing(values);
+        if (Option.isNone(raced))
+            return yield* new EdgeConflict({ type });
+        return yield* resolveCollision(viewer, raced.value);
+    });
+    const closeValidity = Effect.fn(`${type}.closeValidity`)(function* (id, at) {
+        const viewer = yield* definition.viewer;
+        const row = yield* visibleEdge(viewer, id);
+        if (Option.isNone(row))
+            return yield* new EdgeNotFound({ type, id });
+        yield* writeGate({ viewer, policy, edge: row.value });
+        const close = edges.closeValidity;
+        if (Option.isNone(validity) || close === undefined) {
+            return yield* new InvalidValidity({ type, reason: "the family declares no validity" });
+        }
+        const from = Option.flatten(boundOf(row.value, validity.value.from));
+        const to = Option.flatten(boundOf(row.value, validity.value.to));
+        // Only ever narrowing (EDGE-002): never past a closed end, never before the start.
+        if (Number.isNaN(at.getTime()) ||
+            Option.exists(to, (end) => at.getTime() > end.getTime()) ||
+            Option.exists(from, (start) => at.getTime() < start.getTime())) {
+            return yield* new InvalidValidity({ type, reason: "a close may only narrow the interval" });
+        }
+        if (!(yield* close(id, validity.value.to, at)))
+            return yield* new EdgeNotFound({ type, id });
+        return { id };
+    });
+    const remove = Effect.fn(`${type}.delete`)(function* (id) {
+        const viewer = yield* definition.viewer;
+        const row = yield* visibleEdge(viewer, id);
+        if (Option.isNone(row))
+            return yield* new EdgeNotFound({ type, id });
+        yield* writeGate({ viewer, policy, edge: row.value });
+        // A hard DELETE: an edge has no version chain to append a tombstone to.
+        if (!(yield* edges.delete(id)))
+            return yield* new EdgeNotFound({ type, id });
+        return { id };
+    });
+    /**
+     * The store's `members` set for `end` against `otherIds`, under the
+     * viewer's `EDGE-001` filter; none, without reading the store, for no ids,
+     * more than `MAX_SET_VALUES`, a misnamed end or a family of other than two
+     * ends. `memberFilter` reads none as `never`, `nonMemberFilter` as `always`.
+     */
+    const readableMembers = Effect.fnUntraced(function* (end, otherIds) {
+        const member = Record.get(ends, end);
+        const others = endEntries.filter(([alias]) => alias !== end);
+        const [other] = others;
+        if (Option.isNone(member) || other === undefined || others.length !== 1) {
+            return Option.none();
+        }
+        const otherColumn = other[1].column;
+        const named = anyOf(otherColumn, otherIds);
+        // No ids, or past MAX_SET_VALUES: `anyOf` is `never`.
+        if (named.kind === "never")
+            return Option.none();
+        const viewer = yield* definition.viewer;
+        const following = yield* edges.members({
+            column: member.value.column,
+            otherColumn,
+            ids: otherIds,
+            where: and(endpointFilter(ends, viewer, policy, followers), named),
+        });
+        return Option.some(following);
+    });
+    /** A membership filter traced as `${type}.<name>`: `whenNone` for no set, `wrap` over the readable members. */
+    const membershipFilter = (name, whenNone, wrap) => Effect.fn(`${type}.${name}`)(function* (end, otherIds) {
+        const following = yield* readableMembers(end, otherIds);
+        return Option.match(following, { onNone: () => whenNone, onSome: wrap });
+    });
+    const memberFilter = membershipFilter("memberFilter", never, (set) => isIn("id", set));
+    // An exclusion fails closed by excluding nothing.
+    const nonMemberFilter = membershipFilter("nonMemberFilter", always, (set) => isNotIn("id", set));
+    const countBy = Effect.fn(`${type}.countBy`)(function* (end, ids, where = always) {
+        const wanted = Arr.dedupe(ids);
+        const zero = HashMap.fromIterable(Arr.map(wanted, (id) => [id, 0]));
+        const counted = Record.get(ends, end);
+        // A misnamed end, no ids, or past MAX_SET_VALUES: every count 0, unread.
+        if (Option.isNone(counted) ||
+            !Arr.isReadonlyArrayNonEmpty(wanted) ||
+            wanted.length > MAX_SET_VALUES) {
+            return zero;
+        }
+        const viewer = yield* definition.viewer;
+        const counts = yield* edges.countBy({
+            column: counted.value.column,
+            ids: wanted,
+            where: and(endpointFilter(ends, viewer, policy, followers), where),
+        });
+        return HashMap.union(zero, HashMap.filter(counts, (_, id) => HashMap.has(zero, id)));
+    });
+    return {
+        list,
+        get,
+        create,
+        delete: remove,
+        closeValidity,
+        memberFilter,
+        nonMemberFilter,
+        countBy,
+    };
+};
+//# sourceMappingURL=edges.js.map

package/dist/edges.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"edges.js","sourceRoot":"","sources":["../src/edges.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6EG;AAEH,OAAO,KAAK,GAAG,MAAM,cAAc,CAAC;AACpC,OAAO,KAAK,MAAM,MAAM,eAAe,CAAC;AACxC,OAAO,KAAK,SAAS,MAAM,kBAAkB,CAAC;AAC9C,OAAO,KAAK,OAAO,MAAM,gBAAgB,CAAC;AAC1C,OAAO,KAAK,MAAM,MAAM,eAAe,CAAC;AACxC,OAAO,KAAK,KAAK,MAAM,cAAc,CAAC;AACtC,OAAO,KAAK,SAAS,MAAM,kBAAkB,CAAC;AAC9C,OAAO,KAAK,MAAM,MAAM,eAAe,CAAC;AACxC,OAAO,KAAK,MAAM,MAAM,eAAe,CAAC;AACxC,OAAO,EACL,MAAM,EACN,GAAG,EACH,KAAK,EACL,EAAE,EACF,EAAE,EACF,IAAI,EACJ,MAAM,EACN,EAAE,EACF,GAAG,EACH,OAAO,EACP,cAAc,EACd,KAAK,EACL,EAAE,GAEH,MAAM,aAAa,CAAC;AACrB,OAAO,EAAE,aAAa,EAAE,MAAM,8BAA8B,CAAC;AAC7D,OAAO,EAAE,eAAe,EAAE,eAAe,EAAE,UAAU,EAAE,MAAM,6BAA6B,CAAC;AAC3F,OAAO,EAAE,mBAAmB,EAAE,mBAAmB,EAAE,MAAM,iCAAiC,CAAC;AAC3F,OAAO,EACL,SAAS,EACT,cAAc,EACd,eAAe,EACf,YAAY,EACZ,YAAY,GAQb,MAAM,cAAc,CAAC;AACtB,OAAO,EAAE,YAAY,EAAoB,MAAM,oBAAoB,CAAC;AAEpE,kHAAkH;AAClH,MAAM,UAAU,GAAG,CAAC,KAAkB,EAAU,EAAE,CAChD,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;AAE9D,yEAAyE;AAEzE;;;;;GAKG;AACH,MAAM,OAAO,YAAa,SAAQ,MAAM,CAAC,WAAW,EAGjD,CAAC,cAAc,EAAE;IAClB,IAAI,EAAE,MAAM,CAAC,MAAM;IACnB,EAAE,EAAE,MAAM,CAAC,MAAM;CAClB,CAAC;CAAG;AAEL;;;;;;;;;;;GAWG;AACH,MAAM,OAAO,YAAa,SAAQ,MAAM,CAAC,WAAW,EAGjD,CAAC,cAAc,EAAE;IAClB,IAAI,EAAE,MAAM,CAAC,MAAM;CACpB,CAAC;CAAG;AAEL;;;;;;GAMG;AACH,MAAM,OAAO,uBAAwB,SAAQ,MAAM,CAAC,WAAW,EAG5D,CAAC,yBAAyB,EAAE;IAC7B,mCAAmC;IACnC,IAAI,EAAE,MAAM,CAAC,MAAM;IACnB,sEAAsE;IACtE,GAAG,EAAE,MAAM,CAAC,MAAM;IAClB,iFAAiF;IACjF,MAAM,EAAE,MAAM,CAAC,MAAM;IACrB,0BAA0B;IAC1B,GAAG,EAAE,MAAM,CAAC,GAAG;CAChB,CAAC;CAAG;AAEL;;;;;;;;;GASG;AACH,MAAM,OAAO,oBAAqB,SAAQ,MAAM,CAAC,WAAW,EAGzD,CAAC,sBAAsB,EAAE,EAAE,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC;CAAG;AA0E1D;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG,CAAC,KAAa,EAAE,MAAc,EAAU,EAAE,CAAC,GAAG,KAAK,IAAI,MAAM,EAAE,CAAC;AAE9F,0EAA0E;AAC1E,MAAM,OAAO,GAAG,CAAY,KAAa,EAAE,MAA6B,EAAyB,EAAE,CACjG,aAAa,CAAC,MAAM,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC,cAAc,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC;AAEnE,6EAA6E;AAC7E,MAAM,MAAM,GAAG,CAAC,GAAY,EAAW,EAAE,CAAC,GAAG,CAAC,MAAM,KAAK,QAAQ,IAAI,GAAG,CAAC,MAAM,KAAK,QAAQ,CAAC;AAE7F,+DAA+D;AAC/D,MAAM,UAAU,GAAG,GAAqC,EAAE,CACxD,EAAE,CAAY,EAAE,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE,EAAE,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC;AAEhE;;;;;;;;;;;;;;;GAeG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG,CAC7B,GAAkB,EAClB,MAAc,EACd,MAAoB,EACpB,SAAmC,EACnC,IAA4B,EACM,EAAE;IACpC,IAAI,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC;QAAE,OAAO,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IACtD,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,cAAc,CAAC,EAAE,CAAC;QACzE,OAAO,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IAC/B,CAAC;IACD,MAAM,EAAE,MAAM,EAAE,GAAG,GAAG,CAAC;IACvB,MAAM,EAAE,OAAO,EAAE,GAAG,GAAG,CAAC,KAAK,CAAC;IAC9B,IAAI,MAAM,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;QAChC,OAAO,mBAAmB,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IACrF,CAAC;IACD,IAAI,CAAC,eAAe,CAAC,MAAM,EAAE,OAAO,CAAC;QAAE,OAAO,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IACpE,OAAO,eAAe,CAAC,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,UAAU,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;AACpF,CAAC,CAAC;AAEF;;;;;;;;;;GAUG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG,CAC5B,IAAoB,EACpB,MAAc,EACd,MAAoB,EACpB,SAA2C,EACpB,EAAE;IACzB,MAAM,KAAK,GAAG,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC;IACtD,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,UAAU,EAAa,CAAC;IAClG,OAAO,GAAG,CACR,GAAG,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,GAAG,CAAC,EAAE,EAAE,CAC7C,OAAO,CACL,KAAK,EACL,GAAG,CACD,SAAS,EACT,GAAG,CAAC,MAAM,CAAC,IAAI,KAAK,OAAO;QACzB,CAAC,CAAC,eAAe,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC;QACvD,CAAC,CAAC,mBAAmB,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,KAAK,CAAC,OAAO,EAAE,KAAK,CAAC,CAC9D,CACF,CACF,CACF,CAAC;AACJ,CAAC,CAAC;AAEF,kHAAkH;AAClH,MAAM,cAAc,GAAG,CAAkB,IAAoB,EAAyB,EAAE,CACtF,GAAG,CACD,GAAG,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,EAAE,UAAU,EAAa,CAAC,CAAC,CACpF,CAAC;AA+BJ;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,QAAQ,GACnB,CAAC,IAAmE,EAAE,EAAE,CACxE,CAAC,OAAyB,EAA0D,EAAE,CACpF,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE;IAC3B,MAAM,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,YAAY,EAAE,CAAC;IAC7C,MAAM,EAAE,CAAC,OAAO,EAAE,EAAE,CAClB,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,SAAS,EAAE,CAAC;CACzF,CAAC,CAAC;AAEP;;;;;GAKG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG,QAAQ,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC;AAqL3E;;;;;;GAMG;AACH,MAAM,OAAO,eAAgB,SAAQ,MAAM,CAAC,WAAW,EAGpD,CAAC,iBAAiB,EAAE;IACrB,IAAI,EAAE,MAAM,CAAC,MAAM;IACnB,MAAM,EAAE,MAAM,CAAC,MAAM;CACtB,CAAC;CAAG;AAEL;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,CAAC,MAAM,OAAO,GAAG,CACrB,QAAsB,EACtB,EAAQ,EACe,EAAE,CACzB,GAAG,CACD,EAAE,CAAY,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,EAC5D,EAAE,CAAY,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CACxD,CAAC;AAEJ;;;;GAIG;AACH,MAAM,WAAW,GAAG,CAClB,QAAsB,EACtB,IAAyB,EACzB,EAAuB,EACA,EAAE,CACzB,GAAG,CACD,MAAM,CAAC,KAAK,CAAC,EAAE,EAAE;IACf,MAAM,EAAE,GAA0B,EAAE,CAAC,MAAM;IAC3C,MAAM,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,CAAY,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;CAC9E,CAAC,EACF,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE;IACjB,MAAM,EAAE,GAA0B,EAAE,CAAC,MAAM;IAC3C,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAY,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;CAC9E,CAAC,CACH,CAAC;AAEJ,mFAAmF;AACnF,MAAM,OAAO,GAAG,CACd,MAAkD,EAClD,MAAc,EACsB,EAAE,CACtC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,aAAa,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE;IACjD,MAAM,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAQ,CAAC;IAC9C,MAAM,EAAE,CAAC,KAAK,EAAE,EAAE,CAChB,SAAS,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;QACvD,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACjC,CAAC,CAAC,MAAM,CAAC,IAAI,EAAE;CACpB,CAAC,CAAC;AAuKL,0HAA0H;AAC1H,MAAM,kBAAkB,GAAG,CAAO,CAAC,KAAK,EAAE,GAAG,CAAmC,EAAE,EAAE;IAClF,IAAI,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;QACxB,OAAO,MAAM,CAAC,IAAI,CAAC,kBAAkB,KAAK,iDAAiD,CAAC,CAAC;IAC/F,CAAC;IACD,MAAM,GAAG,GAAG,GAAG,CAAC,QAAQ,CAAC;IACzB,IAAI,GAAG,KAAK,SAAS,IAAI,CAAC,CAAC,MAAM,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC,CAAC,EAAE,CAAC;QACjE,OAAO,MAAM,CAAC,IAAI,CAChB,YAAY,KAAK,uBAAuB,MAAM,CAAC,GAAG,CAAC,+BAA+B,CACnF,CAAC;IACJ,CAAC;IACD,OAAO,MAAM,CAAC,IAAI,EAAU,CAAC;AAC/B,CAAC,CAAC;AAEF,qEAAqE;AACrE,MAAM,YAAY,GAAG,CAAO,IAAY,EAAE,IAAoB,EAAQ,EAAE;IACtE,MAAM,OAAO,GAAG,GAAG,CAAC,SAAS,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,kBAAkB,CAAC,CAAC;IAC1E,IAAI,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC;QAC3B,MAAM,IAAI,oBAAoB,CAAC,EAAE,OAAO,EAAE,GAAG,IAAI,KAAK,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;IAC3E,CAAC;AACH,CAAC,CAAC;AAEF,oHAAoH;AACpH,MAAM,UAAU,GAAG,CAAC,OAAwB,EAAE,EAAE,CAAC,CAAC;IAChD,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,cAAc,CAAC,CAAC;IACvE,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;CAChD,CAAC,CAAC;AAEH,2IAA2I;AAC3I,MAAM,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAA+B,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC;AAE9F;;;;;;;;;;;GAWG;AACH,MAAM,CAAC,MAAM,aAAa,GAAG,CAC3B,UAAkE,EACtB,EAAE;IAC9C,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,UAAU,EAAE,GAAG,UAAU,CAAC;IACxE,YAAY,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACzB,MAAM,QAAQ,GAAG,MAAM,CAAC,eAAe,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;IAC7D,IAAI,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;QAC5B,IAAI,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,QAAQ,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC;YAC9C,MAAM,IAAI,oBAAoB,CAAC,EAAE,OAAO,EAAE,GAAG,IAAI,mCAAmC,EAAE,CAAC,CAAC;QAC1F,CAAC;QACD,IAAI,KAAK,CAAC,aAAa,KAAK,SAAS,EAAE,CAAC;YACtC,MAAM,IAAI,oBAAoB,CAAC;gBAC7B,OAAO,EAAE,GAAG,IAAI,mDAAmD;aACpE,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IACD,MAAM,UAAU,GAAG,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;IAC1C,MAAM,SAAS,GAAwB,UAAU,CAAC,SAAS,IAAI,eAAe,CAAC;IAC/E,MAAM,UAAU,GAAG,UAAU,CAAC,UAAU,IAAI,MAAM,CAAC;IAEnD,sGAAsG;IACtG,MAAM,YAAY,GAAG,CAAC,GAAkB,EAAE,MAAc,EAAE,IAAgB,EAAE,EAAE;QAC5E,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAChC,OAAO,SAAS,CAAC,QAAQ,CAAC,MAAM,CAAC;YAC/B,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAC7C,MAAM,CAAC,GAAG,CAAC,eAAe,CAAC,GAAG,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,IAAI,CAAC,EAAE,CAAC,QAAQ,EAAE,EAAE,CAC7E,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,EAAE,CAChC,CACF;YACH,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,EAAW,CAAC,CAAC;IAC7C,CAAC,CAAC;IAEF;;;;OAIG;IACH,MAAM,QAAQ,GAAG,CAAC,GAAkB,EAAE,MAAc,EAAE,IAAgB,EAAE,EAAE,CACxE,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;IAErE,wEAAwE;IACxE,MAAM,UAAU,GACd,CAAC,IAAyB,EAAE,EAAE,CAC9B,CAAC,MAAc,EAAE,EAAU,EAA2C,EAAE,CACtE,MAAM,CAAC,YAAY,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,GAAG,EAAE,EAAE,CACxD,MAAM,CAAC,GAAG,CACR,MAAM,CAAC,OAAO,CAAC,UAAU,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,CAAC,KAAK,CAAC,EAAE;QACpE,WAAW,EAAE,CAAC;KACf,CAAC,EACF,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,EAAO,CAAC,CACxE,CACF,CAAC;IAEN,6FAA6F;IAC7F,MAAM,WAAW,GAAG,UAAU,CAAC,YAAY,CAAC,CAAC;IAE7C,0FAA0F;IAC1F,MAAM,WAAW,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC;IAEzC;;;;;OAKG;IACH,MAAM,gBAAgB,GAAG,CAAC,MAAc,EAAE,EAAU,EAAE,EAAE,CACtD,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;QAClB,IAAI,UAAU,KAAK,MAAM;YAAE,OAAO,KAAK,CAAC,CAAC,IAAI,YAAY,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC;QACpE,IAAI,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,WAAW,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC,CAAC,IAAI,YAAY,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC;QAC5F,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;IAChC,CAAC,CAAC,CAAC;IAEL;;;OAGG;IACH,MAAM,WAAW,GACf,CAAC,OAA8B,EAAE,EAAE,CACnC,CAAC,EAAoF,EAAE,EAAE,CACvF,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,aAAa,CAAC,EAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE;QAClD,MAAM,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,IAAI;QACzB,MAAM,EAAE,CAAC,GAAG,EAAE,EAAE,CACd,MAAM,CAAC,OAAO,CACZ,KAAK,CAAC,OAAO,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,CAAC,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,EAC3E,CAAC,IAAI,EAAE,EAAE,CACP,IAAI,IAAI,GAAG;YACT,CAAC,CAAC,MAAM,CAAC,IAAI,CACT,IAAI,uBAAuB,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,CAAC,MAAM,EAAE,GAAG,EAAE,CAAC,CAC7E;YACH,CAAC,CAAC,MAAM,CAAC,IAAI,CAClB;KACJ,CAAC,CAAC;IAEP,MAAM,IAAI,GAAG,MAAM,CAAC,EAAE,CAAC,GAAG,IAAI,OAAO,CAAC,CAAC,QAAQ,CAAC,EAAE,OAAwB;QACxE,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC;QACxC,MAAM,KAAK,GAAG,GAAG,CAAY,cAAc,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC;QAC7F,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,GAAG,UAAU,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QAC7E,OAAO,EAAE,IAAI,EAAE,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,UAAU,CAAC,EAAE,KAAK,EAAE,CAAC;IACpD,CAAC,CAAC,CAAC;IAEH,MAAM,GAAG,GAAG,MAAM,CAAC,EAAE,CAAC,GAAG,IAAI,MAAM,CAAC,CAAC,QAAQ,CAAC,EAAE,EAAU;QACxD,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,UAAU,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;QAC7D,8DAA8D;QAC9D,IAAI,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC,CAAC,IAAI,YAAY,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC;QACrE,OAAO,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;IAEH,gGAAgG;IAChG,MAAM,UAAU,GAAG,CAAC,MAAkB,EAAE,EAAE,CACxC,MAAM,CAAC,KAAK,CAAC,QAAQ,EAAE;QACrB,MAAM,EAAE,GAAG,EAAE,CACX,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,EAAuD,CAAC;QACpF,MAAM,EAAE,CAAC,OAAO,EAAE,EAAE;YAClB,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC;YAC3C,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,EAAE,OAAO,CAAC,EAAE,CAAC,CAAC;YACvC,IAAI,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC7C,OAAO,MAAM,CAAC,IAAI,CAChB,IAAI,eAAe,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,6CAA6C,EAAE,CAAC,CACrF,CAAC;YACJ,CAAC;YACD,MAAM,QAAQ,GACZ,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC;gBACzB,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,KAAK,CAAC;gBACvB,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,OAAO,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;YACxD,OAAO,QAAQ;gBACb,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,eAAe,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,+BAA+B,EAAE,CAAC,CAAC;gBACrF,CAAC,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAU,CAAC,CAAC;QAC1D,CAAC;KACF,CAAC,CAAC;IAEL,MAAM,MAAM,GAAG,MAAM,CAAC,EAAE,CAAC,GAAG,IAAI,SAAS,CAAC,CAAC,QAAQ,CAAC,EAAE,KAAa;QACjE,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC;QACxC,MAAM,MAAM,GAAG,UAAU,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACxC,0EAA0E;QAC1E,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QAC3C,qEAAqE;QACrE,0EAA0E;QAC1E,yEAAyE;QACzE,0CAA0C;QAC1C,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,MAAM,CAAC,OAAO,CACjC,UAAU,EACV,CAAC,CAAC,KAAK,EAAE,GAAG,CAAC,EAAE,EAAE,CACf,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CACrD,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE;YACjB,MAAM,EAAE,GAAG,EAAE,CACX,MAAM,CAAC,IAAI,CAAC,IAAI,YAAY,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,EAAE,EAAE,UAAU,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC;YACvF,MAAM,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,CAAC,EAAE,EAAE,CAAC;SAChE,CAAC,CACH,EACH,EAAE,WAAW,EAAE,CAAC,EAAE,CACnB,CAAC;QACF,KAAK,CAAC,CAAC,SAAS,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC;QACnD,wEAAwE;QACxE,6DAA6D;QAC7D,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QAC/C,IAAI,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC;YAAE,OAAO,KAAK,CAAC,CAAC,gBAAgB,CAAC,MAAM,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC;QACpF,yEAAyE;QACzE,mEAAmE;QACnE,sEAAsE;QACtE,uEAAuE;QACvE,uDAAuD;QACvD,gGAAgG;QAChG,MAAM,OAAO,GAAG,GAAG,CACjB,cAAc,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,CAAC,EAC/C,cAAc,CAAkB,IAAI,CAAC,EACrC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,EAAE;YAC7C,MAAM,EAAE,GAA0B,EAAE,CAAC,MAAM;YAC3C,MAAM,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,WAAW,CAAY,OAAO,EAAE,IAAI,EAAE,EAAE,CAAC;SAC7E,CAAC,CACH,CAAC;QACF,KAAK,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,QAAQ,CAAC,EAAE,WAAW,CAAC,OAAO,CAAC,EAAE;YACrE,WAAW,EAAE,CAAC;YACd,OAAO,EAAE,IAAI;SACd,CAAC,CAAC;QACH,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC7C,IAAI,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC;YAAE,OAAO,EAAE,EAAE,EAAE,QAAQ,CAAC,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;QAC1E,kEAAkE;QAClE,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QAC5C,IAAI,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC,CAAC,IAAI,YAAY,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC;QACnE,OAAO,KAAK,CAAC,CAAC,gBAAgB,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;IAEH,MAAM,aAAa,GAAG,MAAM,CAAC,EAAE,CAAC,GAAG,IAAI,gBAAgB,CAAC,CAAC,QAAQ,CAAC,EAAE,EAAU,EAAE,EAAQ;QACtF,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC;QACxC,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,WAAW,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;QAC3C,IAAI,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC,CAAC,IAAI,YAAY,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC;QACrE,KAAK,CAAC,CAAC,SAAS,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC;QACtD,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;QAClC,IAAI,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACnD,OAAO,KAAK,CAAC,CAAC,IAAI,eAAe,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,iCAAiC,EAAE,CAAC,CAAC;QACzF,CAAC;QACD,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;QACrE,MAAM,EAAE,GAAG,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;QACjE,mFAAmF;QACnF,IACE,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC;YAC1B,MAAM,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,CAAC,OAAO,EAAE,GAAG,GAAG,CAAC,OAAO,EAAE,CAAC;YACxD,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,OAAO,EAAE,GAAG,KAAK,CAAC,OAAO,EAAE,CAAC,EAC9D,CAAC;YACD,OAAO,KAAK,CAAC,CAAC,IAAI,eAAe,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,sCAAsC,EAAE,CAAC,CAAC;QAC9F,CAAC;QACD,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,EAAE,EAAE,QAAQ,CAAC,KAAK,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC,CAAC,IAAI,YAAY,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC;QAC7F,OAAO,EAAE,EAAE,EAAE,CAAC;IAChB,CAAC,CAAC,CAAC;IAEH,MAAM,MAAM,GAAG,MAAM,CAAC,EAAE,CAAC,GAAG,IAAI,SAAS,CAAC,CAAC,QAAQ,CAAC,EAAE,EAAU;QAC9D,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC;QACxC,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,WAAW,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;QAC3C,IAAI,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC,CAAC,IAAI,YAAY,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC;QACrE,KAAK,CAAC,CAAC,SAAS,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC;QACtD,wEAAwE;QACxE,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC,CAAC,IAAI,YAAY,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC;QAC7E,OAAO,EAAE,EAAE,EAAE,CAAC;IAChB,CAAC,CAAC,CAAC;IAEH;;;;;OAKG;IACH,MAAM,eAAe,GAAG,MAAM,CAAC,UAAU,CAAC,QAAQ,CAAC,EACjD,GAAW,EACX,QAA+B;QAE/B,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QACrC,MAAM,MAAM,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,KAAK,KAAK,GAAG,CAAC,CAAC;QAC7D,MAAM,CAAC,KAAK,CAAC,GAAG,MAAM,CAAC;QACvB,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,KAAK,KAAK,SAAS,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxE,OAAO,MAAM,CAAC,IAAI,EAAa,CAAC;QAClC,CAAC;QACD,MAAM,WAAW,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;QACpC,MAAM,KAAK,GAAG,KAAK,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;QAC3C,sDAAsD;QACtD,IAAI,KAAK,CAAC,IAAI,KAAK,OAAO;YAAE,OAAO,MAAM,CAAC,IAAI,EAAa,CAAC;QAC5D,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC;QACxC,MAAM,SAAS,GAAG,KAAK,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC;YACrC,MAAM,EAAE,MAAM,CAAC,KAAK,CAAC,MAAM;YAC3B,WAAW;YACX,GAAG,EAAE,QAAQ;YACb,KAAK,EAAE,GAAG,CAAY,cAAc,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,KAAK,CAAC;SAC9E,CAAC,CAAC;QACH,OAAO,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IAChC,CAAC,CAAC,CAAC;IAEH,+GAA+G;IAC/G,MAAM,gBAAgB,GAAG,CACvB,IAAY,EACZ,QAA+B,EAC/B,IAA+C,EAC/C,EAAE,CACF,MAAM,CAAC,EAAE,CAAC,GAAG,IAAI,IAAI,IAAI,EAAE,CAAC,CAAC,QAAQ,CAAC,EAAE,GAAW,EAAE,QAA+B;QAClF,MAAM,SAAS,GAAG,KAAK,CAAC,CAAC,eAAe,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;QACxD,OAAO,MAAM,CAAC,KAAK,CAAC,SAAS,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC;IAC3E,CAAC,CAAC,CAAC;IAEL,MAAM,YAAY,GAAG,gBAAgB,CAAC,cAAc,EAAE,KAAK,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC;IACvF,kDAAkD;IAClD,MAAM,eAAe,GAAG,gBAAgB,CAAC,iBAAiB,EAAE,MAAM,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC;IAEjG,MAAM,OAAO,GAAG,MAAM,CAAC,EAAE,CAAC,GAAG,IAAI,UAAU,CAAC,CAAC,QAAQ,CAAC,EACpD,GAAW,EACX,GAA0B,EAC1B,KAAK,GAAsB,MAAM;QAEjC,MAAM,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAC/B,MAAM,IAAI,GAAG,OAAO,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAU,CAAC,CAAC,CAAC;QAC7E,MAAM,OAAO,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QACtC,yEAAyE;QACzE,IACE,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC;YACtB,CAAC,GAAG,CAAC,uBAAuB,CAAC,MAAM,CAAC;YACpC,MAAM,CAAC,MAAM,GAAG,cAAc,EAC9B,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;QACD,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC;QACxC,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC;YAClC,MAAM,EAAE,OAAO,CAAC,KAAK,CAAC,MAAM;YAC5B,GAAG,EAAE,MAAM;YACX,KAAK,EAAE,GAAG,CAAY,cAAc,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,KAAK,CAAC;SAC9E,CAAC,CAAC;QACH,OAAO,OAAO,CAAC,KAAK,CAClB,IAAI,EACJ,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CACzD,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,OAAO;QACL,IAAI;QACJ,GAAG;QACH,MAAM;QACN,MAAM,EAAE,MAAM;QACd,aAAa;QACb,YAAY;QACZ,eAAe;QACf,OAAO;KACR,CAAC;AACJ,CAAC,CAAC"}