@thomasfosterau/pulpit 0.0.0 → 0.1.0

package/dist/cache.js

@@ -0,0 +1,118 @@
+/**
+ * **The reference resource cache** (pulpit#205) — `./subtype`'s
+ * {@link ResourceCacheSeam}, with a read-through `get`, over a minimal
+ * versioned key-value seam ({@link VersionedKv}).
+ *
+ * The behavioural spec is the four apps' own caches (website's, gardeneria's,
+ * preferenceflow's and in-the-dark's `apps/api/src/cache.ts`), which this
+ * replaces: one implementation of the contract the kernel already states.
+ *
+ * - **Compare-on-set** (pulpit#121). Every entry carries the version it
+ *   speaks for, and the KV seam's one conditional write keeps the highest:
+ *   a `set` or `delete` below the stored version changes nothing, and an
+ *   eviction raises the version, so a racing writer's late write-through can
+ *   never re-cache a resource older than one already replaced or evicted.
+ * - **An eviction wins a tie.** A tombstone outranks a value at the same
+ *   version: only a strictly newer write clears it, so a read-through that
+ *   loaded the row before an unpublish at that version can't re-cache it.
+ *   The cache stores a rank, `2·version` for a value and `2·version + 1` for
+ *   a tombstone, as the entry's `version`, so the seam still compares one
+ *   number.
+ * - **Tombstones outlive values.** A tombstone is kept for
+ *   `tombstoneTtlSeconds` (by default a day, and never less than the value
+ *   TTL), which must exceed the longest a write can be in flight: a late
+ *   write-through that arrives after its tombstone has expired is no longer
+ *   ordered against it.
+ * - **Serveability on both sides** (`CACHE-AUTH-005`). `set` refuses (and
+ *   evicts) a resource the `serveable` policy refuses, and `get` checks it
+ *   again, so a policy change can't serve a stale cached private row.
+ * - **Decode or evict.** `get` decodes the stored value with the resource's
+ *   schema; a value that no longer decodes (the schema moved) is evicted and
+ *   read as a miss.
+ * - **A TTL backstop.** Every write carries the configured TTL, so an entry
+ *   no write ever evicted still expires.
+ * - **Never fails.** A KV failure reads as a miss and skips a write: the
+ *   cache is an optimisation, and the store stays the source of truth.
+ *
+ * The KV seam is the application's (a Durable Object, Redis, a SQL table):
+ * nothing here imports a platform. Workers KV alone has no conditional
+ * write, so it can't fill {@link VersionedKv.putIfNotBehind}.
+ *
+ * @copyright Thomas Foster
+ * @module pulpit/cache
+ * @since 0.1.0
+ */
+import * as Effect from "effect/Effect";
+import * as Option from "effect/Option";
+import * as Schema from "effect/Schema";
+/**
+ * The default time an eviction's tombstone is kept: one day, far longer than
+ * any request can be in flight.
+ *
+ * @since 0.1.0
+ */
+export const DEFAULT_TOMBSTONE_TTL_SECONDS = 86_400;
+/**
+ * The reference {@link ResourceCacheSeam} over a {@link VersionedKv}.
+ *
+ * @example
+ * ```ts
+ * import { deepStrictEqual } from "node:assert";
+ * import * as Effect from "effect/Effect";
+ * import * as Option from "effect/Option";
+ * import * as Schema from "effect/Schema";
+ * import { makeResourceCache } from "@thomasfosterau/pulpit/cache";
+ * import { makeInMemoryVersionedKv } from "@thomasfosterau/pulpit/testing";
+ *
+ * const Post = Schema.Struct({ id: Schema.String, visibility: Schema.String });
+ * const cache = makeResourceCache({
+ *   kv: makeInMemoryVersionedKv(),
+ *   schema: Post,
+ *   serveable: (post) => post.visibility === "public",
+ *   prefix: "posts:v1:",
+ *   ttlSeconds: 3600,
+ * });
+ * const program = Effect.gen(function* () {
+ *   yield* cache.set("p-1", { id: "p-1", visibility: "public" }, 1n);
+ *   yield* cache.set("p-1", { id: "p-1", visibility: "private" }, 0n); // behind: no-op
+ *   return yield* cache.get("p-1");
+ * });
+ * deepStrictEqual(Effect.runSync(program), Option.some({ id: "p-1", visibility: "public" }));
+ * ```
+ *
+ * @since 0.1.0
+ */
+export const makeResourceCache = (options) => {
+    const { kv, serveable, prefix } = options;
+    const ttl = Math.max(1, Math.trunc(options.ttlSeconds) || 1);
+    const tombstoneTtl = Math.max(ttl, Math.trunc(options.tombstoneTtlSeconds ?? DEFAULT_TOMBSTONE_TTL_SECONDS) || ttl);
+    const encode = Schema.encodeOption(options.schema);
+    const decode = Schema.decodeUnknownOption(options.schema);
+    const keyOf = (id) => `${prefix}${id}`;
+    /**
+     * The conditional write at the entry's rank (`2·version`, plus one for a
+     * tombstone, so an eviction wins a tie), a KV failure skipped (the cache
+     * never fails). A tombstone carries the longer TTL.
+     */
+    const write = (id, version, value) => Effect.ignore(kv.putIfNotBehind(keyOf(id), { version: version * 2n + (Option.isNone(value) ? 1n : 0n), value }, Option.isNone(value) ? tombstoneTtl : ttl));
+    const evict = (id, version) => write(id, version, Option.none());
+    const set = (id, resource, version) => {
+        // Refuse (and evict) what the policy doesn't serve, or what doesn't encode.
+        const encoded = serveable(resource) ? encode(resource) : Option.none();
+        return write(id, version, encoded);
+    };
+    const get = (id) => Effect.gen(function* () {
+        const stored = yield* Effect.orElseSucceed(kv.get(keyOf(id)), () => Option.none());
+        if (Option.isNone(stored) || Option.isNone(stored.value.value))
+            return Option.none();
+        const resource = decode(stored.value.value.value);
+        if (Option.isNone(resource) || !serveable(resource.value)) {
+            // Decode or evict, and never serve what the policy now refuses (CACHE-AUTH-005).
+            yield* evict(id, stored.value.version / 2n);
+            return Option.none();
+        }
+        return resource;
+    });
+    return { set, delete: evict, get };
+};
+//# sourceMappingURL=cache.js.map

package/dist/cache.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cache.js","sourceRoot":"","sources":["../src/cache.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2CG;AAEH,OAAO,KAAK,MAAM,MAAM,eAAe,CAAC;AACxC,OAAO,KAAK,MAAM,MAAM,eAAe,CAAC;AACxC,OAAO,KAAK,MAAM,MAAM,eAAe,CAAC;AAoExC;;;;;GAKG;AACH,MAAM,CAAC,MAAM,6BAA6B,GAAG,MAAM,CAAC;AAiBpD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AACH,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAC/B,OAA6C,EACjB,EAAE;IAC9B,MAAM,EAAE,EAAE,EAAE,SAAS,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC;IAC1C,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC;IAC7D,MAAM,YAAY,GAAG,IAAI,CAAC,GAAG,CAC3B,GAAG,EACH,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,mBAAmB,IAAI,6BAA6B,CAAC,IAAI,GAAG,CAChF,CAAC;IACF,MAAM,MAAM,GAAG,MAAM,CAAC,YAAY,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IACnD,MAAM,MAAM,GAAG,MAAM,CAAC,mBAAmB,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;IAC1D,MAAM,KAAK,GAAG,CAAC,EAAU,EAAE,EAAE,CAAC,GAAG,MAAM,GAAG,EAAE,EAAE,CAAC;IAE/C;;;;OAIG;IACH,MAAM,KAAK,GAAG,CAAC,EAAU,EAAE,OAAe,EAAE,KAAiC,EAAE,EAAE,CAC/E,MAAM,CAAC,MAAM,CACX,EAAE,CAAC,cAAc,CACf,KAAK,CAAC,EAAE,CAAC,EACT,EAAE,OAAO,EAAE,OAAO,GAAG,EAAE,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,EACnE,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,GAAG,CAC1C,CACF,CAAC;IACJ,MAAM,KAAK,GAAG,CAAC,EAAU,EAAE,OAAe,EAAE,EAAE,CAAC,KAAK,CAAC,EAAE,EAAE,OAAO,EAAE,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;IAEjF,MAAM,GAAG,GAAG,CAAC,EAAU,EAAE,QAAkB,EAAE,OAAe,EAAE,EAAE;QAC9D,4EAA4E;QAC5E,MAAM,OAAO,GAAG,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QACvE,OAAO,KAAK,CAAC,EAAE,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;IACrC,CAAC,CAAC;IAEF,MAAM,GAAG,GAAG,CAAC,EAAU,EAAE,EAAE,CACzB,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;QAClB,MAAM,MAAM,GAAG,KAAK,CAAC,CAAC,MAAM,CAAC,aAAa,CAAC,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,IAAI,EAAW,CAAC,CAAC;QAC5F,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC;YAC5D,OAAO,MAAM,CAAC,IAAI,EAAY,CAAC;QACjC,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAClD,IAAI,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;YAC1D,iFAAiF;YACjF,KAAK,CAAC,CAAC,KAAK,CAAC,EAAE,EAAE,MAAM,CAAC,KAAK,CAAC,OAAO,GAAG,EAAE,CAAC,CAAC;YAC5C,OAAO,MAAM,CAAC,IAAI,EAAY,CAAC;QACjC,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC,CAAC,CAAC;IAEL,OAAO,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC;AACrC,CAAC,CAAC"}

package/dist/collections.d.ts

@@ -0,0 +1,242 @@
+/**
+ * **Ordered collections** (pulpit#193) — positioned members of a parent
+ * node: a list's items, an album's media, a byline's authors, a menu's
+ * entries.
+ *
+ * The behavioural spec is website's ordered list items (a reorder appends
+ * a parent version) and in-the-dark's list entries (an updatable position
+ * beside the chain), with their tests.
+ *
+ * ## The model (owner decision on pulpit#193)
+ *
+ * Both models, opt-in per family, over **one store seam**
+ * ({@link CollectionStore}), which holds each member's position:
+ *
+ * - **`mutable`** (the default): the order is state beside the chain, like
+ *   an edge. A write changes the store and nothing else.
+ * - **`versioned`**: every write also appends a parent version through the
+ *   parent leaf's own `update`, recording the whole order (the member ids,
+ *   in order) in a declared parent column, so `VERSION-CHAIN-001` covers it
+ *   and history shows each reorder. After the parent's `restoreVersion`,
+ *   {@link CollectionOps.resync} replaces the store's order with the one
+ *   the restored version records, keeping only the members the writer can
+ *   read, as `append` does.
+ *
+ *   That column holds the id of every member, the ones a reader of the
+ *   parent may not be able to read included, so it must stay out of the
+ *   parent's viewer-facing resource (`EDGE-001`): wrap the parent leaf's
+ *   `toResource` with {@link hideRecordedOrder}. The parent's history
+ *   (`getVersion`, `compare`) still shows it, behind the write gate
+ *   (`READ-009`).
+ *
+ * ## The gates
+ *
+ * - **Reads** go through the parent's read gate (`get`): a hidden parent is
+ *   `NodeNotFound`, never `Forbidden` (`SEC-AUTH-ENUM-001`). Each member is
+ *   read through the member leaf's own gate (`getMany`), and one the viewer
+ *   can't read is omitted, from the page and from its total, as `EDGE-001`
+ *   omits an edge with a hidden end.
+ * - **Writes** pass the parent's write gate (`authorize`), and a member must
+ *   be one the writer can read (`NodeNotFound` otherwise).
+ * - A collection holds at most {@link MAX_COLLECTION_SIZE} members, so every
+ *   read and reorder is one bounded read (`SEC-INPUT-003`).
+ *
+ * @copyright Thomas Foster
+ * @module pulpit/collections
+ * @since 0.1.0
+ */
+import * as Effect from "effect/Effect";
+import * as Schema from "effect/Schema";
+import { type Forbidden, type LeafRow, type Page, type SubtypeOps, type Unauthorized, type WriteRejected } from "./subtype.ts";
+import { NodeNotFound, type StaleVersion, type VersionChainStore, type VersionConflict } from "./version-chain.ts";
+/**
+ * The most members a collection holds (`SEC-INPUT-003`): every read and
+ * reorder reads the whole order once, so it is bounded.
+ *
+ * @since 0.1.0
+ */
+export declare const MAX_COLLECTION_SIZE = 1000;
+declare const AlreadyMember_base: Schema.Class<AlreadyMember, Schema.TaggedStruct<"AlreadyMember", {
+    readonly parentId: Schema.String;
+    readonly memberId: Schema.String;
+}>, import("effect/Cause").YieldableError & {
+    readonly brand: unique symbol;
+}>;
+/**
+ * The member is already in the collection: the wire's 409.
+ *
+ * @since 0.1.0
+ */
+export declare class AlreadyMember extends AlreadyMember_base {
+}
+declare const NotMember_base: Schema.Class<NotMember, Schema.TaggedStruct<"NotMember", {
+    readonly parentId: Schema.String;
+    readonly memberId: Schema.String;
+}>, import("effect/Cause").YieldableError & {
+    readonly brand: unique symbol;
+}>;
+/**
+ * The member is not in the collection: the wire's 404.
+ *
+ * @since 0.1.0
+ */
+export declare class NotMember extends NotMember_base {
+}
+declare const CollectionFull_base: Schema.Class<CollectionFull, Schema.TaggedStruct<"CollectionFull", {
+    readonly parentId: Schema.String;
+    readonly max: Schema.Finite;
+}>, import("effect/Cause").YieldableError & {
+    readonly brand: unique symbol;
+}>;
+/**
+ * The collection already holds {@link MAX_COLLECTION_SIZE} members: the
+ * wire's 409.
+ *
+ * @since 0.1.0
+ */
+export declare class CollectionFull extends CollectionFull_base {
+}
+/**
+ * One member's place in a collection.
+ *
+ * @since 0.1.0
+ */
+export interface CollectionEntry {
+    readonly memberId: string;
+    readonly position: number;
+}
+/**
+ * The membership table an application supplies, keyed
+ * `(parent_id, member_id)` with both foreign keys cascading. A store seam:
+ * no policy, never opens a transaction, fails only with its `E`. See the
+ * package README → Seams.
+ *
+ * @since 0.1.0
+ */
+export interface CollectionStore<E, R> {
+    /**
+     * The parent's members, by position then member id, at most `limit`
+     * (never more than {@link MAX_COLLECTION_SIZE} + 1, so the caller can
+     * tell a full collection).
+     */
+    readonly entries: (parentId: string, limit: number) => Effect.Effect<ReadonlyArray<CollectionEntry>, E, R>;
+    /** Replace the parent's whole order with `entries` (positions `0…n-1`), in one statement. */
+    readonly replace: (parentId: string, entries: ReadonlyArray<CollectionEntry>) => Effect.Effect<void, E, R>;
+}
+/**
+ * How a family keeps its order: beside the chain (`mutable`, the default)
+ * or in a parent column, versioned with the parent (`versioned`).
+ *
+ * @since 0.1.0
+ */
+export type CollectionMode<E, R> = {
+    readonly kind: "mutable";
+} | {
+    readonly kind: "versioned";
+    /**
+     * The parent column recording the order: the member ids, in order (a
+     * `jsonb` array). Keep it out of the parent's resource with
+     * {@link hideRecordedOrder} (`EDGE-001`).
+     */
+    readonly column: string;
+    /** The parent leaf's chain store, read (ungated) by `resync` for the restored order. */
+    readonly chain: VersionChainStore<E, R>;
+};
+/**
+ * One family's collection: the parent and member leaves' gated operations,
+ * the store and the mode.
+ *
+ * @since 0.1.0
+ */
+export interface CollectionDefinition<Parent, Member, E, R> {
+    /** The family's name, traced as `${type}.<operation>`. */
+    readonly type: string;
+    /** The parent leaf: `get` gates a read, `authorize` a write, `update` records a versioned order. */
+    readonly parent: Pick<SubtypeOps<Parent, E, R>, "get" | "authorize" | "update">;
+    /** The member leaf's gated batch read. */
+    readonly members: Pick<SubtypeOps<Member, E, R>, "getMany">;
+    readonly store: CollectionStore<E, R>;
+    /** The order's model; `mutable` when omitted. */
+    readonly mode?: CollectionMode<E, R> | undefined;
+}
+/**
+ * One member as a read returns it: its id, its position among the members
+ * the viewer can see (from 0), and the member resource.
+ *
+ * @since 0.1.0
+ */
+export interface CollectionMember<Member> {
+    readonly memberId: string;
+    readonly index: number;
+    readonly resource: Member;
+}
+type WriteFailure = Unauthorized | Forbidden | NodeNotFound | WriteRejected | StaleVersion | VersionConflict;
+/**
+ * The operations {@link defineCollection} produces.
+ *
+ * @since 0.1.0
+ */
+export interface CollectionOps<Member, E, R> {
+    /**
+     * One page of the members the viewer can read, in order, with their
+     * total: the parent's read gate first (`NodeNotFound`), each member
+     * through its own leaf's, a hidden one omitted. The limit is clamped to
+     * `[1, MAX_PAGE_LIMIT]`.
+     */
+    readonly list: (parentId: string, request: {
+        readonly limit: number;
+        readonly offset: number;
+    }) => Effect.Effect<Page<CollectionMember<Member>>, NodeNotFound | E, R>;
+    /**
+     * Add `memberId` at the end. Fails the parent's write gate, `NodeNotFound`
+     * for a member the writer can't read, {@link AlreadyMember} and
+     * {@link CollectionFull}; on a versioned family, the parent `update`'s
+     * failures too.
+     */
+    readonly append: (parentId: string, memberId: string) => Effect.Effect<void, WriteFailure | AlreadyMember | CollectionFull | E, R>;
+    /**
+     * Move `memberId` to `index` (clamped to the order's bounds), shifting the
+     * members between. Fails the parent's write gate and {@link NotMember}.
+     */
+    readonly move: (parentId: string, memberId: string, index: number) => Effect.Effect<void, WriteFailure | NotMember | E, R>;
+    /** Remove `memberId`. Fails the parent's write gate and {@link NotMember}. */
+    readonly remove: (parentId: string, memberId: string) => Effect.Effect<void, WriteFailure | NotMember | E, R>;
+    /**
+     * A versioned family's store order replaced by the order the parent's
+     * head records (after the parent's `restoreVersion`), behind the parent's
+     * write gate, keeping only the members the writer can read (as `append`
+     * checks). A mutable family, or a head recording no order, leaves the
+     * store as it is.
+     */
+    readonly resync: (parentId: string) => Effect.Effect<void, Unauthorized | Forbidden | NodeNotFound | E, R>;
+}
+/**
+ * Wrap a parent leaf's `toResource` so the row it maps no longer carries a
+ * versioned collection's order `column`: the recorded order names every
+ * member, the ones the viewer can't read included, so it must never reach
+ * a reader of the parent (`EDGE-001`). The chain still records it, so
+ * {@link CollectionOps.resync} reads it back.
+ *
+ * @example
+ * ```ts
+ * import { deepStrictEqual } from "node:assert";
+ * import { hideRecordedOrder } from "@thomasfosterau/pulpit/collections";
+ *
+ * const toResource = hideRecordedOrder("memberOrder", (row) => row);
+ * const row = { id: "l-1", version: 2n, action: "update", title: "Ferns", memberOrder: ["i-1"] } as const;
+ * deepStrictEqual(toResource(row), { id: "l-1", version: 2n, action: "update", title: "Ferns" });
+ * ```
+ *
+ * @since 0.1.0
+ */
+export declare const hideRecordedOrder: <Resource>(column: string, toResource: (row: LeafRow) => Resource) => ((row: LeafRow) => Resource);
+/**
+ * Bind one family's collection operations. Every operation is traced as
+ * `${type}.<operation>`, and the writes run in the caller's transaction (a
+ * versioned family's store write and parent append commit together).
+ *
+ * @since 0.1.0
+ */
+export declare const defineCollection: <Parent, Member, E, R>(definition: CollectionDefinition<Parent, Member, E, R>) => CollectionOps<Member, E, R>;
+export {};
+//# sourceMappingURL=collections.d.ts.map

package/dist/collections.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"collections.d.ts","sourceRoot":"","sources":["../src/collections.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8CG;AAGH,OAAO,KAAK,MAAM,MAAM,eAAe,CAAC;AAKxC,OAAO,KAAK,MAAM,MAAM,eAAe,CAAC;AAExC,OAAO,EAEL,KAAK,SAAS,EACd,KAAK,OAAO,EACZ,KAAK,IAAI,EACT,KAAK,UAAU,EACf,KAAK,YAAY,EACjB,KAAK,aAAa,EACnB,MAAM,cAAc,CAAC;AACtB,OAAO,EACL,YAAY,EACZ,KAAK,YAAY,EACjB,KAAK,iBAAiB,EACtB,KAAK,eAAe,EACrB,MAAM,oBAAoB,CAAC;AAE5B;;;;;GAKG;AACH,eAAO,MAAM,mBAAmB,OAAiB,CAAC;;;;;oBAW9B,OAAO,MAAM;;AAPjC;;;;GAIG;AACH,qBAAa,aAAc,SAAQ,kBAMjC;CAAG;;;;;oBAO0E,OAAO,MAAM;;AAL5F;;;;GAIG;AACH,qBAAa,SAAU,SAAQ,cAM9B;CAAG;;;;;oBAUgB,OAAO,MAAM;;AARjC;;;;;GAKG;AACH,qBAAa,cAAe,SAAQ,mBAMlC;CAAG;AAIL;;;;GAIG;AACH,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;CAC3B;AAED;;;;;;;GAOG;AACH,MAAM,WAAW,eAAe,CAAC,CAAC,EAAE,CAAC;IACnC;;;;OAIG;IACH,QAAQ,CAAC,OAAO,EAAE,CAChB,QAAQ,EAAE,MAAM,EAChB,KAAK,EAAE,MAAM,KACV,MAAM,CAAC,MAAM,CAAC,aAAa,CAAC,eAAe,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACzD,6FAA6F;IAC7F,QAAQ,CAAC,OAAO,EAAE,CAChB,QAAQ,EAAE,MAAM,EAChB,OAAO,EAAE,aAAa,CAAC,eAAe,CAAC,KACpC,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;CAChC;AAID;;;;;GAKG;AACH,MAAM,MAAM,cAAc,CAAC,CAAC,EAAE,CAAC,IAC3B;IAAE,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAA;CAAE,GAC5B;IACE,QAAQ,CAAC,IAAI,EAAE,WAAW,CAAC;IAC3B;;;;OAIG;IACH,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,wFAAwF;IACxF,QAAQ,CAAC,KAAK,EAAE,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;CACzC,CAAC;AAEN;;;;;GAKG;AACH,MAAM,WAAW,oBAAoB,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;IACxD,0DAA0D;IAC1D,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,oGAAoG;IACpG,QAAQ,CAAC,MAAM,EAAE,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,GAAG,WAAW,GAAG,QAAQ,CAAC,CAAC;IAChF,0CAA0C;IAC1C,QAAQ,CAAC,OAAO,EAAE,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;IAC5D,QAAQ,CAAC,KAAK,EAAE,eAAe,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACtC,iDAAiD;IAEjD,QAAQ,CAAC,IAAI,CAAC,EAAE,cAAc,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,SAAS,CAAC;CAClD;AAED;;;;;GAKG;AACH,MAAM,WAAW,gBAAgB,CAAC,MAAM;IACtC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;CAC3B;AAED,KAAK,YAAY,GACb,YAAY,GACZ,SAAS,GACT,YAAY,GACZ,aAAa,GACb,YAAY,GACZ,eAAe,CAAC;AAEpB;;;;GAIG;AACH,MAAM,WAAW,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC;IACzC;;;;;OAKG;IACH,QAAQ,CAAC,IAAI,EAAE,CACb,QAAQ,EAAE,MAAM,EAChB,OAAO,EAAE;QAAE,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;QAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;KAAE,KACzD,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,EAAE,YAAY,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IACxE;;;;;OAKG;IACH,QAAQ,CAAC,MAAM,EAAE,CACf,QAAQ,EAAE,MAAM,EAChB,QAAQ,EAAE,MAAM,KACb,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,YAAY,GAAG,aAAa,GAAG,cAAc,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IAC/E;;;OAGG;IACH,QAAQ,CAAC,IAAI,EAAE,CACb,QAAQ,EAAE,MAAM,EAChB,QAAQ,EAAE,MAAM,EAChB,KAAK,EAAE,MAAM,KACV,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,YAAY,GAAG,SAAS,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1D,8EAA8E;IAC9E,QAAQ,CAAC,MAAM,EAAE,CACf,QAAQ,EAAE,MAAM,EAChB,QAAQ,EAAE,MAAM,KACb,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,YAAY,GAAG,SAAS,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1D;;;;;;OAMG;IACH,QAAQ,CAAC,MAAM,EAAE,CACf,QAAQ,EAAE,MAAM,KACb,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,YAAY,GAAG,SAAS,GAAG,YAAY,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;CAC1E;AAED;;;;;;;;;;;;;;;;;;GAkBG;AACH,eAAO,MAAM,iBAAiB,GAC3B,QAAQ,UACC,MAAM,cACF,CAAC,GAAG,EAAE,OAAO,KAAK,QAAQ,KACrC,CAAC,CAAC,GAAG,EAAE,OAAO,KAAK,QAAQ,CAI7B,CAAC;AAYJ;;;;;;GAMG;AACH,eAAO,MAAM,gBAAgB,GAAI,MAAM,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,cACvC,oBAAoB,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,KACrD,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CA0G5B,CAAC"}

package/dist/collections.js

@@ -0,0 +1,215 @@
+/**
+ * **Ordered collections** (pulpit#193) — positioned members of a parent
+ * node: a list's items, an album's media, a byline's authors, a menu's
+ * entries.
+ *
+ * The behavioural spec is website's ordered list items (a reorder appends
+ * a parent version) and in-the-dark's list entries (an updatable position
+ * beside the chain), with their tests.
+ *
+ * ## The model (owner decision on pulpit#193)
+ *
+ * Both models, opt-in per family, over **one store seam**
+ * ({@link CollectionStore}), which holds each member's position:
+ *
+ * - **`mutable`** (the default): the order is state beside the chain, like
+ *   an edge. A write changes the store and nothing else.
+ * - **`versioned`**: every write also appends a parent version through the
+ *   parent leaf's own `update`, recording the whole order (the member ids,
+ *   in order) in a declared parent column, so `VERSION-CHAIN-001` covers it
+ *   and history shows each reorder. After the parent's `restoreVersion`,
+ *   {@link CollectionOps.resync} replaces the store's order with the one
+ *   the restored version records, keeping only the members the writer can
+ *   read, as `append` does.
+ *
+ *   That column holds the id of every member, the ones a reader of the
+ *   parent may not be able to read included, so it must stay out of the
+ *   parent's viewer-facing resource (`EDGE-001`): wrap the parent leaf's
+ *   `toResource` with {@link hideRecordedOrder}. The parent's history
+ *   (`getVersion`, `compare`) still shows it, behind the write gate
+ *   (`READ-009`).
+ *
+ * ## The gates
+ *
+ * - **Reads** go through the parent's read gate (`get`): a hidden parent is
+ *   `NodeNotFound`, never `Forbidden` (`SEC-AUTH-ENUM-001`). Each member is
+ *   read through the member leaf's own gate (`getMany`), and one the viewer
+ *   can't read is omitted, from the page and from its total, as `EDGE-001`
+ *   omits an edge with a hidden end.
+ * - **Writes** pass the parent's write gate (`authorize`), and a member must
+ *   be one the writer can read (`NodeNotFound` otherwise).
+ * - A collection holds at most {@link MAX_COLLECTION_SIZE} members, so every
+ *   read and reorder is one bounded read (`SEC-INPUT-003`).
+ *
+ * @copyright Thomas Foster
+ * @module pulpit/collections
+ * @since 0.1.0
+ */
+import * as Arr from "effect/Array";
+import * as Effect from "effect/Effect";
+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 Schema from "effect/Schema";
+import { byCodePoint } from "./internal/list-order.js";
+import { MAX_PAGE_LIMIT, } from "./subtype.js";
+import { NodeNotFound, } from "./version-chain.js";
+/**
+ * The most members a collection holds (`SEC-INPUT-003`): every read and
+ * reorder reads the whole order once, so it is bounded.
+ *
+ * @since 0.1.0
+ */
+export const MAX_COLLECTION_SIZE = MAX_PAGE_LIMIT;
+// ── Errors ────────────────────────────────────────────────────────────
+/**
+ * The member is already in the collection: the wire's 409.
+ *
+ * @since 0.1.0
+ */
+export class AlreadyMember extends Schema.TaggedError()("AlreadyMember", {
+    parentId: Schema.String,
+    memberId: Schema.String,
+}) {
+}
+/**
+ * The member is not in the collection: the wire's 404.
+ *
+ * @since 0.1.0
+ */
+export class NotMember extends Schema.TaggedError()("NotMember", {
+    parentId: Schema.String,
+    memberId: Schema.String,
+}) {
+}
+/**
+ * The collection already holds {@link MAX_COLLECTION_SIZE} members: the
+ * wire's 409.
+ *
+ * @since 0.1.0
+ */
+export class CollectionFull extends Schema.TaggedError()("CollectionFull", {
+    parentId: Schema.String,
+    max: Schema.Finite,
+}) {
+}
+/**
+ * Wrap a parent leaf's `toResource` so the row it maps no longer carries a
+ * versioned collection's order `column`: the recorded order names every
+ * member, the ones the viewer can't read included, so it must never reach
+ * a reader of the parent (`EDGE-001`). The chain still records it, so
+ * {@link CollectionOps.resync} reads it back.
+ *
+ * @example
+ * ```ts
+ * import { deepStrictEqual } from "node:assert";
+ * import { hideRecordedOrder } from "@thomasfosterau/pulpit/collections";
+ *
+ * const toResource = hideRecordedOrder("memberOrder", (row) => row);
+ * const row = { id: "l-1", version: 2n, action: "update", title: "Ferns", memberOrder: ["i-1"] } as const;
+ * deepStrictEqual(toResource(row), { id: "l-1", version: 2n, action: "update", title: "Ferns" });
+ * ```
+ *
+ * @since 0.1.0
+ */
+export const hideRecordedOrder = (column, toResource) => (row) => {
+    const { [column]: _recorded, ...rest } = row;
+    return toResource({ ...rest, id: row.id, version: row.version, action: row.action });
+};
+/** The order with positions `0…n-1`. */
+const renumber = (ids) => Arr.map(ids, (memberId, position) => ({ memberId, position }));
+/** By position, then member id: the store's total order. */
+const entryOrder = Order.combine(Order.mapInput(Order.Number, (entry) => entry.position), Order.mapInput(byCodePoint, (entry) => entry.memberId));
+/**
+ * Bind one family's collection operations. Every operation is traced as
+ * `${type}.<operation>`, and the writes run in the caller's transaction (a
+ * versioned family's store write and parent append commit together).
+ *
+ * @since 0.1.0
+ */
+export const defineCollection = (definition) => {
+    const { type, parent, members, store } = definition;
+    const mode = definition.mode ?? { kind: "mutable" };
+    /** The whole order, as ids (one bounded read). */
+    const orderOf = (parentId) => Effect.map(store.entries(parentId, MAX_COLLECTION_SIZE + 1), (entries) => Arr.map(Arr.sort(entries, entryOrder), (entry) => entry.memberId));
+    /** Write the new order to the store and, on a versioned family, to the parent's chain. */
+    const commit = (parentId, ids) => Effect.gen(function* () {
+        yield* store.replace(parentId, renumber(ids));
+        if (mode.kind === "versioned") {
+            yield* parent.update({ id: parentId, patch: { [mode.column]: [...ids] } });
+        }
+    });
+    const list = Effect.fn(`${type}.list`)(function* (parentId, request) {
+        // A parent the viewer can't read is missing to them (SEC-AUTH-ENUM-001).
+        yield* parent.get(parentId);
+        const ids = Arr.take(yield* orderOf(parentId), MAX_COLLECTION_SIZE);
+        const readable = Arr.isReadonlyArrayNonEmpty(ids)
+            ? yield* members.getMany(ids)
+            : HashMap.empty();
+        const shown = Arr.getSomes(Arr.map(ids, (memberId) => Option.map(HashMap.get(readable, memberId), (resource) => ({ memberId, resource }))));
+        const limit = Math.max(1, Math.min(Math.trunc(request.limit), MAX_PAGE_LIMIT));
+        const offset = Math.max(0, Math.trunc(request.offset));
+        return {
+            rows: Arr.map(shown.slice(offset, offset + limit), (member, at) => ({
+                ...member,
+                index: offset + at,
+            })),
+            total: shown.length,
+        };
+    });
+    const append = Effect.fn(`${type}.append`)(function* (parentId, memberId) {
+        yield* parent.authorize(parentId);
+        const readable = yield* members.getMany([memberId]);
+        if (!HashMap.has(readable, memberId)) {
+            return yield* new NodeNotFound({ type, id: memberId });
+        }
+        const ids = yield* orderOf(parentId);
+        if (ids.includes(memberId))
+            return yield* new AlreadyMember({ parentId, memberId });
+        if (ids.length >= MAX_COLLECTION_SIZE) {
+            return yield* new CollectionFull({ parentId, max: MAX_COLLECTION_SIZE });
+        }
+        yield* commit(parentId, [...ids, memberId]);
+    });
+    const move = Effect.fn(`${type}.move`)(function* (parentId, memberId, index) {
+        yield* parent.authorize(parentId);
+        const ids = yield* orderOf(parentId);
+        if (!ids.includes(memberId))
+            return yield* new NotMember({ parentId, memberId });
+        const rest = Arr.filter(ids, (id) => id !== memberId);
+        const at = Math.max(0, Math.min(Number.isFinite(index) ? Math.trunc(index) : 0, rest.length));
+        yield* commit(parentId, [...rest.slice(0, at), memberId, ...rest.slice(at)]);
+    });
+    const remove = Effect.fn(`${type}.remove`)(function* (parentId, memberId) {
+        yield* parent.authorize(parentId);
+        const ids = yield* orderOf(parentId);
+        if (!ids.includes(memberId))
+            return yield* new NotMember({ parentId, memberId });
+        yield* commit(parentId, Arr.filter(ids, (id) => id !== memberId));
+    });
+    const resync = Effect.fn(`${type}.resync`)(function* (parentId) {
+        yield* parent.authorize(parentId);
+        if (mode.kind !== "versioned")
+            return;
+        const head = yield* mode.chain.head(parentId);
+        if (Option.isNone(head))
+            return;
+        const snapshot = yield* mode.chain.snapshot(parentId, head.value.version);
+        const recorded = Option.flatMap(snapshot, (version) => {
+            const value = version.state[mode.column] ?? null;
+            return Arr.isArray(value) ? Option.some(value) : Option.none();
+        });
+        if (Option.isNone(recorded))
+            return;
+        const ids = Arr.take(Arr.dedupe(Arr.filter(recorded.value, Predicate.isString)), MAX_COLLECTION_SIZE);
+        // Gate parity with `append`: the column is writable through the parent's
+        // own `update`, so keep only the members the writer can read.
+        const readable = Arr.isReadonlyArrayNonEmpty(ids)
+            ? yield* members.getMany(ids)
+            : HashMap.empty();
+        yield* store.replace(parentId, renumber(Arr.filter(ids, (id) => HashMap.has(readable, id))));
+    });
+    return { list, append, move, remove, resync };
+};
+//# sourceMappingURL=collections.js.map

package/dist/collections.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"collections.js","sourceRoot":"","sources":["../src/collections.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8CG;AAEH,OAAO,KAAK,GAAG,MAAM,cAAc,CAAC;AACpC,OAAO,KAAK,MAAM,MAAM,eAAe,CAAC;AACxC,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,EAAE,WAAW,EAAE,MAAM,0BAA0B,CAAC;AACvD,OAAO,EACL,cAAc,GAOf,MAAM,cAAc,CAAC;AACtB,OAAO,EACL,YAAY,GAIb,MAAM,oBAAoB,CAAC;AAE5B;;;;;GAKG;AACH,MAAM,CAAC,MAAM,mBAAmB,GAAG,cAAc,CAAC;AAElD,yEAAyE;AAEzE;;;;GAIG;AACH,MAAM,OAAO,aAAc,SAAQ,MAAM,CAAC,WAAW,EAGlD,CAAC,eAAe,EAAE;IACnB,QAAQ,EAAE,MAAM,CAAC,MAAM;IACvB,QAAQ,EAAE,MAAM,CAAC,MAAM;CACxB,CAAC;CAAG;AAEL;;;;GAIG;AACH,MAAM,OAAO,SAAU,SAAQ,MAAM,CAAC,WAAW,EAAgD,CAC/F,WAAW,EACX;IACE,QAAQ,EAAE,MAAM,CAAC,MAAM;IACvB,QAAQ,EAAE,MAAM,CAAC,MAAM;CACxB,CACF;CAAG;AAEJ;;;;;GAKG;AACH,MAAM,OAAO,cAAe,SAAQ,MAAM,CAAC,WAAW,EAGnD,CAAC,gBAAgB,EAAE;IACpB,QAAQ,EAAE,MAAM,CAAC,MAAM;IACvB,GAAG,EAAE,MAAM,CAAC,MAAM;CACnB,CAAC;CAAG;AAwJL;;;;;;;;;;;;;;;;;;GAkBG;AACH,MAAM,CAAC,MAAM,iBAAiB,GAC5B,CACE,MAAc,EACd,UAAsC,EACR,EAAE,CAClC,CAAC,GAAG,EAAE,EAAE;IACN,MAAM,EAAE,CAAC,MAAM,CAAC,EAAE,SAAS,EAAE,GAAG,IAAI,EAAE,GAAG,GAAG,CAAC;IAC7C,OAAO,UAAU,CAAC,EAAE,GAAG,IAAI,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,OAAO,EAAE,GAAG,CAAC,OAAO,EAAE,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC;AACvF,CAAC,CAAC;AAEJ,wCAAwC;AACxC,MAAM,QAAQ,GAAG,CAAC,GAA0B,EAAkC,EAAE,CAC9E,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE,QAAQ,EAAE,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;AAEjE,4DAA4D;AAC5D,MAAM,UAAU,GAAiC,KAAK,CAAC,OAAO,CAC5D,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,KAAsB,EAAE,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,EACxE,KAAK,CAAC,QAAQ,CAAC,WAAW,EAAE,CAAC,KAAsB,EAAE,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,CACxE,CAAC;AAEF;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAC9B,UAAsD,EACzB,EAAE;IAC/B,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,GAAG,UAAU,CAAC;IACpD,MAAM,IAAI,GAAyB,UAAU,CAAC,IAAI,IAAI,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;IAE1E,kDAAkD;IAClD,MAAM,OAAO,GAAG,CAAC,QAAgB,EAAE,EAAE,CACnC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,EAAE,mBAAmB,GAAG,CAAC,CAAC,EAAE,CAAC,OAAO,EAAE,EAAE,CACvE,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,UAAU,CAAC,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,CAClE,CAAC;IAEJ,0FAA0F;IAC1F,MAAM,MAAM,GAAG,CAAC,QAAgB,EAAE,GAA0B,EAAE,EAAE,CAC9D,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC;QAClB,KAAK,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC;QAC9C,IAAI,IAAI,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;YAC9B,KAAK,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC;QAC7E,CAAC;IACH,CAAC,CAAC,CAAC;IAEL,MAAM,IAAI,GAAG,MAAM,CAAC,EAAE,CAAC,GAAG,IAAI,OAAO,CAAC,CAAC,QAAQ,CAAC,EAC9C,QAAgB,EAChB,OAA4D;QAE5D,yEAAyE;QACzE,KAAK,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC5B,MAAM,GAAG,GAAG,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,mBAAmB,CAAC,CAAC;QACpE,MAAM,QAAQ,GAAG,GAAG,CAAC,uBAAuB,CAAC,GAAG,CAAC;YAC/C,CAAC,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC;YAC7B,CAAC,CAAC,OAAO,CAAC,KAAK,EAAkB,CAAC;QACpC,MAAM,KAAK,GAAG,GAAG,CAAC,QAAQ,CACxB,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,QAAQ,EAAE,EAAE,CACxB,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC,CAAC,CACpF,CACF,CAAC;QACF,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,cAAc,CAAC,CAAC,CAAC;QAC/E,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;QACvD,OAAO;YACL,IAAI,EAAE,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,GAAG,KAAK,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;gBAClE,GAAG,MAAM;gBACT,KAAK,EAAE,MAAM,GAAG,EAAE;aACnB,CAAC,CAAC;YACH,KAAK,EAAE,KAAK,CAAC,MAAM;SACpB,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,MAAM,MAAM,GAAG,MAAM,CAAC,EAAE,CAAC,GAAG,IAAI,SAAS,CAAC,CAAC,QAAQ,CAAC,EAAE,QAAgB,EAAE,QAAgB;QACtF,KAAK,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;QAClC,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;QACpD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE,CAAC;YACrC,OAAO,KAAK,CAAC,CAAC,IAAI,YAAY,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,QAAQ,EAAE,CAAC,CAAC;QACzD,CAAC;QACD,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QACrC,IAAI,GAAG,CAAC,QAAQ,CAAC,QAAQ,CAAC;YAAE,OAAO,KAAK,CAAC,CAAC,IAAI,aAAa,CAAC,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC,CAAC;QACpF,IAAI,GAAG,CAAC,MAAM,IAAI,mBAAmB,EAAE,CAAC;YACtC,OAAO,KAAK,CAAC,CAAC,IAAI,cAAc,CAAC,EAAE,QAAQ,EAAE,GAAG,EAAE,mBAAmB,EAAE,CAAC,CAAC;QAC3E,CAAC;QACD,KAAK,CAAC,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,GAAG,EAAE,QAAQ,CAAC,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,MAAM,IAAI,GAAG,MAAM,CAAC,EAAE,CAAC,GAAG,IAAI,OAAO,CAAC,CAAC,QAAQ,CAAC,EAC9C,QAAgB,EAChB,QAAgB,EAChB,KAAa;QAEb,KAAK,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;QAClC,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QACrC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,QAAQ,CAAC;YAAE,OAAO,KAAK,CAAC,CAAC,IAAI,SAAS,CAAC,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC,CAAC;QACjF,MAAM,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,QAAQ,CAAC,CAAC;QACtD,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;QAC9F,KAAK,CAAC,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC/E,CAAC,CAAC,CAAC;IAEH,MAAM,MAAM,GAAG,MAAM,CAAC,EAAE,CAAC,GAAG,IAAI,SAAS,CAAC,CAAC,QAAQ,CAAC,EAAE,QAAgB,EAAE,QAAgB;QACtF,KAAK,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;QAClC,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QACrC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,QAAQ,CAAC;YAAE,OAAO,KAAK,CAAC,CAAC,IAAI,SAAS,CAAC,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC,CAAC;QACjF,KAAK,CAAC,CAAC,MAAM,CACX,QAAQ,EACR,GAAG,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,QAAQ,CAAC,CACzC,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,MAAM,MAAM,GAAG,MAAM,CAAC,EAAE,CAAC,GAAG,IAAI,SAAS,CAAC,CAAC,QAAQ,CAAC,EAAE,QAAgB;QACpE,KAAK,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;QAClC,IAAI,IAAI,CAAC,IAAI,KAAK,WAAW;YAAE,OAAO;QACtC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC9C,IAAI,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC;YAAE,OAAO;QAChC,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,QAAQ,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QAC1E,MAAM,QAAQ,GAAG,MAAM,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC,OAAO,EAAE,EAAE;YACpD,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC;YACjD,OAAO,GAAG,CAAC,OAAO,CAAU,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QAC1E,CAAC,CAAC,CAAC;QACH,IAAI,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC;YAAE,OAAO;QACpC,MAAM,GAAG,GAAG,GAAG,CAAC,IAAI,CAClB,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,EAAE,SAAS,CAAC,QAAQ,CAAC,CAAC,EAC1D,mBAAmB,CACpB,CAAC;QACF,yEAAyE;QACzE,8DAA8D;QAC9D,MAAM,QAAQ,GAAG,GAAG,CAAC,uBAAuB,CAAC,GAAG,CAAC;YAC/C,CAAC,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC;YAC7B,CAAC,CAAC,OAAO,CAAC,KAAK,EAAkB,CAAC;QACpC,KAAK,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,EAAE,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/F,CAAC,CAAC,CAAC;IAEH,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC;AAChD,CAAC,CAAC"}