foldkit-surface 0.12.0 → 0.13.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/edgeCache.d.ts +78 -0
- package/dist/edgeCache.d.ts.map +1 -0
- package/dist/edgeCache.js +124 -0
- package/dist/edgeCache.js.map +1 -0
- package/dist/index.d.ts +2 -1
- package/dist/index.d.ts.map +1 -1
- package/dist/index.js +3 -1
- package/dist/index.js.map +1 -1
- package/package.json +1 -1
|
@@ -0,0 +1,78 @@
|
|
|
1
|
+
import { Context, Data, Duration, Effect, Option } from "effect";
|
|
2
|
+
/** How long an answer stays fresh. */
|
|
3
|
+
export interface CachePolicy {
|
|
4
|
+
readonly maxAge: Duration.Duration;
|
|
5
|
+
}
|
|
6
|
+
/** A cache declaration as written: `{ maxAge: '60 seconds' }`. */
|
|
7
|
+
export interface CacheOptions {
|
|
8
|
+
readonly maxAge: Duration.Input;
|
|
9
|
+
}
|
|
10
|
+
/** The policy `options` says, refused where it is written when it keeps nothing. */
|
|
11
|
+
export declare const cachePolicy: (options: CacheOptions) => CachePolicy;
|
|
12
|
+
/** Whole seconds, as `Cache-Control: max-age` counts them. */
|
|
13
|
+
export declare const maxAgeSeconds: (policy: CachePolicy) => number;
|
|
14
|
+
/** The shorter of two policies: what an answer holding both stays fresh for. */
|
|
15
|
+
export declare const shorterPolicy: (a: CachePolicy, b: CachePolicy) => CachePolicy;
|
|
16
|
+
/**
|
|
17
|
+
* What a cache store keeps: an answer's text by key, for `maxAge`, dropped
|
|
18
|
+
* early when a write names one of its `tags`.
|
|
19
|
+
*/
|
|
20
|
+
export interface CacheStore {
|
|
21
|
+
readonly match: (key: string) => Effect.Effect<Option.Option<string>>;
|
|
22
|
+
readonly put: (key: string, body: string, options: {
|
|
23
|
+
readonly maxAge: Duration.Duration;
|
|
24
|
+
readonly tags: ReadonlyArray<string>;
|
|
25
|
+
}) => Effect.Effect<void>;
|
|
26
|
+
readonly purge: (tags: ReadonlyArray<string>) => Effect.Effect<void>;
|
|
27
|
+
}
|
|
28
|
+
/** What `CacheStore.workers` needs of a Workers `Cache` (`caches.default`). */
|
|
29
|
+
export interface WorkersCache {
|
|
30
|
+
match(request: Request): Promise<Response | undefined>;
|
|
31
|
+
put(request: Request, response: Response): Promise<void>;
|
|
32
|
+
delete(request: Request): Promise<boolean>;
|
|
33
|
+
}
|
|
34
|
+
/** A store in this process's memory, holding at most `limit` answers. */
|
|
35
|
+
declare const memory: (options?: {
|
|
36
|
+
readonly limit?: number | undefined;
|
|
37
|
+
}) => CacheStore & {
|
|
38
|
+
readonly size: () => number;
|
|
39
|
+
};
|
|
40
|
+
/**
|
|
41
|
+
* A store over a Workers `Cache` (`caches.default`). Keys are URLs, as the
|
|
42
|
+
* Cache API requires. Which answers a tag names is known to this isolate
|
|
43
|
+
* alone: a write purges what this isolate stored, and another isolate's or
|
|
44
|
+
* another data centre's copy stays until its `maxAge`.
|
|
45
|
+
*/
|
|
46
|
+
declare const workers: (cache: WorkersCache) => CacheStore;
|
|
47
|
+
/**
|
|
48
|
+
* One read a page render made, as the reader judged it: public and fresh for
|
|
49
|
+
* `maxAge`, tagged with the rows and lists it holds, or private.
|
|
50
|
+
*/
|
|
51
|
+
export type CachedRead = Data.TaggedEnum<{
|
|
52
|
+
Public: {
|
|
53
|
+
readonly policy: CachePolicy;
|
|
54
|
+
readonly tags: ReadonlyArray<string>;
|
|
55
|
+
};
|
|
56
|
+
Private: {};
|
|
57
|
+
}>;
|
|
58
|
+
export declare const CachedRead: Data.TaggedEnum.Constructor<{
|
|
59
|
+
readonly _tag: "Private";
|
|
60
|
+
} | {
|
|
61
|
+
readonly _tag: "Public";
|
|
62
|
+
readonly policy: CachePolicy;
|
|
63
|
+
readonly tags: ReadonlyArray<string>;
|
|
64
|
+
}>;
|
|
65
|
+
/**
|
|
66
|
+
* Where a page render's reader notes each read it made (`foldkit-ssr` gives
|
|
67
|
+
* one per render it may cache; `pageReader` notes into it). None outside such
|
|
68
|
+
* a render.
|
|
69
|
+
*/
|
|
70
|
+
export declare const PageReads: Context.Reference<Option.Option<(read: CachedRead) => void>>;
|
|
71
|
+
export declare const CacheStore: {
|
|
72
|
+
/** A store in this process's memory: for Node, a dev server and tests. */
|
|
73
|
+
memory: typeof memory;
|
|
74
|
+
/** A store over a Workers `Cache` (`caches.default`). */
|
|
75
|
+
workers: typeof workers;
|
|
76
|
+
};
|
|
77
|
+
export {};
|
|
78
|
+
//# sourceMappingURL=edgeCache.d.ts.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"edgeCache.d.ts","names":[],"sources":["../src/edgeCache.ts"],"mappings":";;iBAWiB;WACN,QAAQ,SAAS;;;iBAIX;WACN,QAAQ,SAAS;;;qBAIf,cAAW,SAAa,iBAAe;;qBAWvC,gBAAa,QAAY;;qBAIzB,gBAAa,GAAO,aAAW,GAAK,gBAAc;;;;;iBAO9C;WACN,QAAQ,gBAAgB,OAAO,OAAO,OAAO;WAC7C,MACP,aACA,cACA;aAAoB,QAAQ,SAAS;aAAmB,MAAM;QAC3D,OAAO;WACH,QAAQ,MAAM,0BAA0B,OAAO;;;iBAIzC;EACf,MAAM,SAAS,UAAU,QAAQ;EACjC,IAAI,SAAS,SAAS,UAAU,WAAW;EAC3C,OAAO,SAAS,UAAU;;;cAwCtB,SAAM;WAAwB;MAA4B;WAInB;;;;;;;;cAqCvC,UAAO,OAAW,iBAAe;;;;;YA6B3B,aAAa,KAAK;EAC5B;aAAmB,QAAQ;aAAsB,MAAM;;EACvD;;qBAEW,YAAU,KAAA,WAAA;;;;WAHM,QAAA;WAA4B,MAAA;;;;;;;qBAU5C,WAAS,QAAA,UAAA,OAAA,QAAA,MAA0C;qBAKnD"}
|
|
@@ -0,0 +1,124 @@
|
|
|
1
|
+
import { Clock, Context, Data, Duration, Effect, Option } from "effect";
|
|
2
|
+
// src/edgeCache.ts
|
|
3
|
+
/**
|
|
4
|
+
* What a server keeps of an answer, and where (#428): how long it stays fresh
|
|
5
|
+
* (`CachePolicy`), a store that keeps answers by key and drops each one
|
|
6
|
+
* tagged with what a write names (`CacheStore`), and the note a page
|
|
7
|
+
* render's reader makes of each read (`PageReads`), which `foldkit-ssr`
|
|
8
|
+
* reads to decide whether a page may be kept. Whether an answer may be
|
|
9
|
+
* shared is never decided here: `foldkit-remote-server` proves a read public.
|
|
10
|
+
*/
|
|
11
|
+
/** The policy `options` says, refused where it is written when it keeps nothing. */
|
|
12
|
+
const cachePolicy = (options) => {
|
|
13
|
+
const maxAge = Duration.fromInputUnsafe(options.maxAge);
|
|
14
|
+
if (!Duration.isFinite(maxAge) || !Duration.isGreaterThanOrEqualTo(maxAge, Duration.seconds(1))) throw new Error(`foldkit: a cache's maxAge must be a finite time of at least one second, as Cache-Control counts it; ${JSON.stringify(options.maxAge)} is not`);
|
|
15
|
+
return { maxAge };
|
|
16
|
+
};
|
|
17
|
+
/** Whole seconds, as `Cache-Control: max-age` counts them. */
|
|
18
|
+
const maxAgeSeconds = (policy) => Math.floor(Duration.toMillis(policy.maxAge) / 1e3);
|
|
19
|
+
/** The shorter of two policies: what an answer holding both stays fresh for. */
|
|
20
|
+
const shorterPolicy = (a, b) => Duration.isLessThan(b.maxAge, a.maxAge) ? b : a;
|
|
21
|
+
/**
|
|
22
|
+
* Which keys each tag names, bounded: past `limit` keys the oldest tags are
|
|
23
|
+
* forgotten, and a write naming one of them leaves its answers to expire.
|
|
24
|
+
*/
|
|
25
|
+
const tagIndex = (limit) => {
|
|
26
|
+
const keysOf = /* @__PURE__ */ new Map();
|
|
27
|
+
let size = 0;
|
|
28
|
+
return {
|
|
29
|
+
add: (key, tags) => {
|
|
30
|
+
for (const tag of tags) {
|
|
31
|
+
const keys = keysOf.get(tag) ?? /* @__PURE__ */ new Set();
|
|
32
|
+
if (!keys.has(key)) size += 1;
|
|
33
|
+
keys.add(key);
|
|
34
|
+
keysOf.delete(tag);
|
|
35
|
+
keysOf.set(tag, keys);
|
|
36
|
+
}
|
|
37
|
+
for (const [tag, keys] of keysOf) {
|
|
38
|
+
if (size <= limit) break;
|
|
39
|
+
keysOf.delete(tag);
|
|
40
|
+
size -= keys.size;
|
|
41
|
+
}
|
|
42
|
+
},
|
|
43
|
+
take: (tags) => {
|
|
44
|
+
const taken = /* @__PURE__ */ new Set();
|
|
45
|
+
for (const tag of tags) {
|
|
46
|
+
const keys = keysOf.get(tag);
|
|
47
|
+
if (keys === void 0) continue;
|
|
48
|
+
keysOf.delete(tag);
|
|
49
|
+
size -= keys.size;
|
|
50
|
+
for (const key of keys) taken.add(key);
|
|
51
|
+
}
|
|
52
|
+
return taken;
|
|
53
|
+
}
|
|
54
|
+
};
|
|
55
|
+
};
|
|
56
|
+
/** A store in this process's memory, holding at most `limit` answers. */
|
|
57
|
+
const memory = (options = {}) => {
|
|
58
|
+
const limit = options.limit ?? 1e3;
|
|
59
|
+
const entries = /* @__PURE__ */ new Map();
|
|
60
|
+
const index = tagIndex(limit * 16);
|
|
61
|
+
return {
|
|
62
|
+
size: () => entries.size,
|
|
63
|
+
match: (key) => Effect.map(Clock.currentTimeMillis, (now) => {
|
|
64
|
+
const entry = entries.get(key);
|
|
65
|
+
if (entry === void 0) return Option.none();
|
|
66
|
+
if (entry.expires <= now) {
|
|
67
|
+
entries.delete(key);
|
|
68
|
+
return Option.none();
|
|
69
|
+
}
|
|
70
|
+
return Option.some(entry.body);
|
|
71
|
+
}),
|
|
72
|
+
put: (key, body, { maxAge, tags }) => Effect.map(Clock.currentTimeMillis, (now) => {
|
|
73
|
+
entries.delete(key);
|
|
74
|
+
entries.set(key, {
|
|
75
|
+
body,
|
|
76
|
+
expires: now + Duration.toMillis(maxAge)
|
|
77
|
+
});
|
|
78
|
+
index.add(key, tags);
|
|
79
|
+
for (const oldest of entries.keys()) {
|
|
80
|
+
if (entries.size <= limit) break;
|
|
81
|
+
entries.delete(oldest);
|
|
82
|
+
}
|
|
83
|
+
}),
|
|
84
|
+
purge: (tags) => Effect.sync(() => {
|
|
85
|
+
for (const key of index.take(tags)) entries.delete(key);
|
|
86
|
+
})
|
|
87
|
+
};
|
|
88
|
+
};
|
|
89
|
+
/**
|
|
90
|
+
* A store over a Workers `Cache` (`caches.default`). Keys are URLs, as the
|
|
91
|
+
* Cache API requires. Which answers a tag names is known to this isolate
|
|
92
|
+
* alone: a write purges what this isolate stored, and another isolate's or
|
|
93
|
+
* another data centre's copy stays until its `maxAge`.
|
|
94
|
+
*/
|
|
95
|
+
const workers = (cache) => {
|
|
96
|
+
const index = tagIndex(16e3);
|
|
97
|
+
return {
|
|
98
|
+
match: (key) => Effect.promise(async () => {
|
|
99
|
+
const response = await cache.match(new Request(key));
|
|
100
|
+
return response === void 0 ? Option.none() : Option.some(await response.text());
|
|
101
|
+
}),
|
|
102
|
+
put: (key, body, { maxAge, tags }) => Effect.promise(async () => {
|
|
103
|
+
index.add(key, tags);
|
|
104
|
+
await cache.put(new Request(key), new Response(body, { headers: { "cache-control": `max-age=${maxAgeSeconds({ maxAge })}` } }));
|
|
105
|
+
}),
|
|
106
|
+
purge: (tags) => Effect.promise(() => Promise.all([...index.take(tags)].map((key) => cache.delete(new Request(key))))).pipe(Effect.asVoid)
|
|
107
|
+
};
|
|
108
|
+
};
|
|
109
|
+
const CachedRead = Data.taggedEnum();
|
|
110
|
+
/**
|
|
111
|
+
* Where a page render's reader notes each read it made (`foldkit-ssr` gives
|
|
112
|
+
* one per render it may cache; `pageReader` notes into it). None outside such
|
|
113
|
+
* a render.
|
|
114
|
+
*/
|
|
115
|
+
const PageReads = Context.Reference("foldkit-surface/PageReads", { defaultValue: () => Option.none() });
|
|
116
|
+
const CacheStore = {
|
|
117
|
+
/** A store in this process's memory: for Node, a dev server and tests. */
|
|
118
|
+
memory,
|
|
119
|
+
/** A store over a Workers `Cache` (`caches.default`). */
|
|
120
|
+
workers
|
|
121
|
+
};
|
|
122
|
+
export { CacheStore, CachedRead, PageReads, cachePolicy, maxAgeSeconds, shorterPolicy };
|
|
123
|
+
|
|
124
|
+
//# sourceMappingURL=edgeCache.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"edgeCache.js","names":[],"sources":["../src/edgeCache.ts"],"sourcesContent":["/**\n * What a server keeps of an answer, and where (#428): how long it stays fresh\n * (`CachePolicy`), a store that keeps answers by key and drops each one\n * tagged with what a write names (`CacheStore`), and the note a page\n * render's reader makes of each read (`PageReads`), which `foldkit-ssr`\n * reads to decide whether a page may be kept. Whether an answer may be\n * shared is never decided here: `foldkit-remote-server` proves a read public.\n */\nimport { Clock, Context, Data, Duration, Effect, Option } from 'effect'\n\n/** How long an answer stays fresh. */\nexport interface CachePolicy {\n readonly maxAge: Duration.Duration\n}\n\n/** A cache declaration as written: `{ maxAge: '60 seconds' }`. */\nexport interface CacheOptions {\n readonly maxAge: Duration.Input\n}\n\n/** The policy `options` says, refused where it is written when it keeps nothing. */\nexport const cachePolicy = (options: CacheOptions): CachePolicy => {\n const maxAge = Duration.fromInputUnsafe(options.maxAge)\n if (!Duration.isFinite(maxAge) || !Duration.isGreaterThanOrEqualTo(maxAge, Duration.seconds(1))) {\n throw new Error(\n `foldkit: a cache's maxAge must be a finite time of at least one second, as Cache-Control counts it; ${JSON.stringify(options.maxAge)} is not`,\n )\n }\n return { maxAge }\n}\n\n/** Whole seconds, as `Cache-Control: max-age` counts them. */\nexport const maxAgeSeconds = (policy: CachePolicy): number =>\n Math.floor(Duration.toMillis(policy.maxAge) / 1000)\n\n/** The shorter of two policies: what an answer holding both stays fresh for. */\nexport const shorterPolicy = (a: CachePolicy, b: CachePolicy): CachePolicy =>\n Duration.isLessThan(b.maxAge, a.maxAge) ? b : a\n\n/**\n * What a cache store keeps: an answer's text by key, for `maxAge`, dropped\n * early when a write names one of its `tags`.\n */\nexport interface CacheStore {\n readonly match: (key: string) => Effect.Effect<Option.Option<string>>\n readonly put: (\n key: string,\n body: string,\n options: { readonly maxAge: Duration.Duration; readonly tags: ReadonlyArray<string> },\n ) => Effect.Effect<void>\n readonly purge: (tags: ReadonlyArray<string>) => Effect.Effect<void>\n}\n\n/** What `CacheStore.workers` needs of a Workers `Cache` (`caches.default`). */\nexport interface WorkersCache {\n match(request: Request): Promise<Response | undefined>\n put(request: Request, response: Response): Promise<void>\n delete(request: Request): Promise<boolean>\n}\n\n/**\n * Which keys each tag names, bounded: past `limit` keys the oldest tags are\n * forgotten, and a write naming one of them leaves its answers to expire.\n */\nconst tagIndex = (limit: number) => {\n const keysOf = new Map<string, Set<string>>()\n let size = 0\n return {\n add: (key: string, tags: ReadonlyArray<string>) => {\n for (const tag of tags) {\n const keys = keysOf.get(tag) ?? new Set<string>()\n if (!keys.has(key)) size += 1\n keys.add(key)\n keysOf.delete(tag)\n keysOf.set(tag, keys)\n }\n for (const [tag, keys] of keysOf) {\n if (size <= limit) break\n keysOf.delete(tag)\n size -= keys.size\n }\n },\n take: (tags: ReadonlyArray<string>): ReadonlySet<string> => {\n const taken = new Set<string>()\n for (const tag of tags) {\n const keys = keysOf.get(tag)\n if (keys === undefined) continue\n keysOf.delete(tag)\n size -= keys.size\n for (const key of keys) taken.add(key)\n }\n return taken\n },\n }\n}\n\n/** A store in this process's memory, holding at most `limit` answers. */\nconst memory = (options: { readonly limit?: number | undefined } = {}) => {\n const limit = options.limit ?? 1000\n const entries = new Map<string, { readonly body: string; readonly expires: number }>()\n const index = tagIndex(limit * 16)\n const store: CacheStore & { readonly size: () => number } = {\n size: () => entries.size,\n match: key =>\n Effect.map(Clock.currentTimeMillis, now => {\n const entry = entries.get(key)\n if (entry === undefined) return Option.none()\n if (entry.expires <= now) {\n entries.delete(key)\n return Option.none()\n }\n return Option.some(entry.body)\n }),\n put: (key, body, { maxAge, tags }) =>\n Effect.map(Clock.currentTimeMillis, now => {\n entries.delete(key)\n entries.set(key, { body, expires: now + Duration.toMillis(maxAge) })\n index.add(key, tags)\n // The oldest answer goes first: a flood of distinct reads costs only room.\n for (const oldest of entries.keys()) {\n if (entries.size <= limit) break\n entries.delete(oldest)\n }\n }),\n purge: tags =>\n Effect.sync(() => {\n for (const key of index.take(tags)) entries.delete(key)\n }),\n }\n return store\n}\n\n/**\n * A store over a Workers `Cache` (`caches.default`). Keys are URLs, as the\n * Cache API requires. Which answers a tag names is known to this isolate\n * alone: a write purges what this isolate stored, and another isolate's or\n * another data centre's copy stays until its `maxAge`.\n */\nconst workers = (cache: WorkersCache): CacheStore => {\n const index = tagIndex(16_000)\n return {\n match: key =>\n Effect.promise(async () => {\n const response = await cache.match(new Request(key))\n return response === undefined ? Option.none() : Option.some(await response.text())\n }),\n put: (key, body, { maxAge, tags }) =>\n Effect.promise(async () => {\n index.add(key, tags)\n await cache.put(\n new Request(key),\n new Response(body, {\n headers: { 'cache-control': `max-age=${maxAgeSeconds({ maxAge })}` },\n }),\n )\n }),\n purge: tags =>\n Effect.promise(() =>\n Promise.all([...index.take(tags)].map(key => cache.delete(new Request(key)))),\n ).pipe(Effect.asVoid),\n }\n}\n\n/**\n * One read a page render made, as the reader judged it: public and fresh for\n * `maxAge`, tagged with the rows and lists it holds, or private.\n */\nexport type CachedRead = Data.TaggedEnum<{\n Public: { readonly policy: CachePolicy; readonly tags: ReadonlyArray<string> }\n Private: {}\n}>\nexport const CachedRead = Data.taggedEnum<CachedRead>()\n\n/**\n * Where a page render's reader notes each read it made (`foldkit-ssr` gives\n * one per render it may cache; `pageReader` notes into it). None outside such\n * a render.\n */\nexport const PageReads = Context.Reference<Option.Option<(read: CachedRead) => void>>(\n 'foldkit-surface/PageReads',\n { defaultValue: () => Option.none() },\n)\n\nexport const CacheStore = {\n /** A store in this process's memory: for Node, a dev server and tests. */\n memory,\n\n /** A store over a Workers `Cache` (`caches.default`). */\n workers,\n}\n"],"mappings":";;;;;;;;;;;AAqBA,MAAa,eAAe,YAAuC;CACjE,MAAM,SAAS,SAAS,gBAAgB,QAAQ,MAAM;CACtD,IAAI,CAAC,SAAS,SAAS,MAAM,KAAK,CAAC,SAAS,uBAAuB,QAAQ,SAAS,QAAQ,CAAC,CAAC,GAC5F,MAAM,IAAI,MACR,uGAAuG,KAAK,UAAU,QAAQ,MAAM,EAAE,QACxI;CAEF,OAAO,EAAE,OAAO;AAClB;;AAGA,MAAa,iBAAiB,WAC5B,KAAK,MAAM,SAAS,SAAS,OAAO,MAAM,IAAI,GAAI;;AAGpD,MAAa,iBAAiB,GAAgB,MAC5C,SAAS,WAAW,EAAE,QAAQ,EAAE,MAAM,IAAI,IAAI;;;;;AA2BhD,MAAM,YAAY,UAAkB;CAClC,MAAM,yBAAS,IAAI,IAAyB;CAC5C,IAAI,OAAO;CACX,OAAO;EACL,MAAM,KAAa,SAAgC;GACjD,KAAK,MAAM,OAAO,MAAM;IACtB,MAAM,OAAO,OAAO,IAAI,GAAG,qBAAK,IAAI,IAAY;IAChD,IAAI,CAAC,KAAK,IAAI,GAAG,GAAG,QAAQ;IAC5B,KAAK,IAAI,GAAG;IACZ,OAAO,OAAO,GAAG;IACjB,OAAO,IAAI,KAAK,IAAI;GACtB;GACA,KAAK,MAAM,CAAC,KAAK,SAAS,QAAQ;IAChC,IAAI,QAAQ,OAAO;IACnB,OAAO,OAAO,GAAG;IACjB,QAAQ,KAAK;GACf;EACF;EACA,OAAO,SAAqD;GAC1D,MAAM,wBAAQ,IAAI,IAAY;GAC9B,KAAK,MAAM,OAAO,MAAM;IACtB,MAAM,OAAO,OAAO,IAAI,GAAG;IAC3B,IAAI,SAAS,KAAA,GAAW;IACxB,OAAO,OAAO,GAAG;IACjB,QAAQ,KAAK;IACb,KAAK,MAAM,OAAO,MAAM,MAAM,IAAI,GAAG;GACvC;GACA,OAAO;EACT;CACF;AACF;;AAGA,MAAM,UAAU,UAAmD,CAAC,MAAM;CACxE,MAAM,QAAQ,QAAQ,SAAS;CAC/B,MAAM,0BAAU,IAAI,IAAiE;CACrF,MAAM,QAAQ,SAAS,QAAQ,EAAE;CA6BjC,OAAO;EA3BL,YAAY,QAAQ;EACpB,QAAO,QACL,OAAO,IAAI,MAAM,oBAAmB,QAAO;GACzC,MAAM,QAAQ,QAAQ,IAAI,GAAG;GAC7B,IAAI,UAAU,KAAA,GAAW,OAAO,OAAO,KAAK;GAC5C,IAAI,MAAM,WAAW,KAAK;IACxB,QAAQ,OAAO,GAAG;IAClB,OAAO,OAAO,KAAK;GACrB;GACA,OAAO,OAAO,KAAK,MAAM,IAAI;EAC/B,CAAC;EACH,MAAM,KAAK,MAAM,EAAE,QAAQ,WACzB,OAAO,IAAI,MAAM,oBAAmB,QAAO;GACzC,QAAQ,OAAO,GAAG;GAClB,QAAQ,IAAI,KAAK;IAAE;IAAM,SAAS,MAAM,SAAS,SAAS,MAAM;GAAE,CAAC;GACnE,MAAM,IAAI,KAAK,IAAI;GAEnB,KAAK,MAAM,UAAU,QAAQ,KAAK,GAAG;IACnC,IAAI,QAAQ,QAAQ,OAAO;IAC3B,QAAQ,OAAO,MAAM;GACvB;EACF,CAAC;EACH,QAAO,SACL,OAAO,WAAW;GAChB,KAAK,MAAM,OAAO,MAAM,KAAK,IAAI,GAAG,QAAQ,OAAO,GAAG;EACxD,CAAC;CAEM;AACb;;;;;;;AAQA,MAAM,WAAW,UAAoC;CACnD,MAAM,QAAQ,SAAS,IAAM;CAC7B,OAAO;EACL,QAAO,QACL,OAAO,QAAQ,YAAY;GACzB,MAAM,WAAW,MAAM,MAAM,MAAM,IAAI,QAAQ,GAAG,CAAC;GACnD,OAAO,aAAa,KAAA,IAAY,OAAO,KAAK,IAAI,OAAO,KAAK,MAAM,SAAS,KAAK,CAAC;EACnF,CAAC;EACH,MAAM,KAAK,MAAM,EAAE,QAAQ,WACzB,OAAO,QAAQ,YAAY;GACzB,MAAM,IAAI,KAAK,IAAI;GACnB,MAAM,MAAM,IACV,IAAI,QAAQ,GAAG,GACf,IAAI,SAAS,MAAM,EACjB,SAAS,EAAE,iBAAiB,WAAW,cAAc,EAAE,OAAO,CAAC,IAAI,EACrE,CAAC,CACH;EACF,CAAC;EACH,QAAO,SACL,OAAO,cACL,QAAQ,IAAI,CAAC,GAAG,MAAM,KAAK,IAAI,CAAC,CAAC,CAAC,KAAI,QAAO,MAAM,OAAO,IAAI,QAAQ,GAAG,CAAC,CAAC,CAAC,CAC9E,CAAC,CAAC,KAAK,OAAO,MAAM;CACxB;AACF;AAUA,MAAa,aAAa,KAAK,WAAuB;;;;;;AAOtD,MAAa,YAAY,QAAQ,UAC/B,6BACA,EAAE,oBAAoB,OAAO,KAAK,EAAE,CACtC;AAEA,MAAa,aAAa;;CAExB;;CAGA;AACF"}
|
package/dist/index.d.ts
CHANGED
|
@@ -1,6 +1,7 @@
|
|
|
1
1
|
import { Optic, Option, Result, Schema } from "effect";
|
|
2
2
|
import { Metadata, Metadata as Metadata$1, MetadataKey, MetadataSummary, MetadataSummary as MetadataSummary$1, MetadataTypeId } from "foldkit-metadata";
|
|
3
3
|
import { Diagnostic, Diagnostics, ReportDiagnostic } from "./diagnostics.js";
|
|
4
|
+
import { CacheOptions, CachePolicy, CacheStore, CachedRead, PageReads, WorkersCache, cachePolicy, maxAgeSeconds, shorterPolicy } from "./edgeCache.js";
|
|
4
5
|
import { Html, HtmlBuilder } from "foldkit/html";
|
|
5
6
|
import { MessageUnion } from "foldkit/message";
|
|
6
7
|
import { Entry } from "foldkit/managedResource";
|
|
@@ -727,5 +728,5 @@ export declare const Module: {
|
|
|
727
728
|
*/
|
|
728
729
|
toMermaid: (module: Module<any, any, any>) => string;
|
|
729
730
|
};
|
|
730
|
-
export { type Diagnostic, Diagnostics, Metadata, type MetadataKey, type MetadataSummary, MetadataTypeId, type ReportDiagnostic };
|
|
731
|
+
export { type CacheOptions, type CachePolicy, CacheStore, CachedRead, type Diagnostic, Diagnostics, Metadata, type MetadataKey, type MetadataSummary, MetadataTypeId, PageReads, type ReportDiagnostic, type WorkersCache, cachePolicy, maxAgeSeconds, shorterPolicy };
|
|
731
732
|
//# sourceMappingURL=index.d.ts.map
|
package/dist/index.d.ts.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"index.d.ts","names":["Metadata","MetadataSummary","ManagedResourceEntry"],"sources":["../src/index.ts"],"mappings":"
|
|
1
|
+
{"version":3,"file":"index.d.ts","names":["Metadata","MetadataSummary","ManagedResourceEntry"],"sources":["../src/index.ts"],"mappings":";;;;;;;;;;;;;;;;qBA6Ca;;iBAGI,MAAM,MAAM,OAAO;;WAEzB,QAAQ,OAAO,MAAM,OAAO;WAC5B,OAAO,MAAM,SAAS,MAAM;;WAE5B;WACA,MAAM,MAAM,SAAS;WACrB,MAAM,MAAM,MAAM,OAAO,UAAU;;;;;;;WAOnC,SAAS,MAAM,MAAM,KAAK,OAAO,UAAU,UAAU;;;;;;iBAO/C,SAAS,MAAM,OAAO;YAC3B,YAAY,MAAM,MAAM,OAAO;;;;;;;iBAQ1B,SACf,MACA,OACA,6BACA,2BACQ,SAAS,MAAM,OAAO;YACpB,YAAY,MAAM,MAAM,OAAO;aAC9B,KAAK;;aAEL;;;qBAmBA;;;;;EAKX,YAAY,MAAM,OAAK,QACb,OAAO,OAAO,QAAM,OACrB,MAAM,SAAS,MAAM,QAAM,mCAEjC,SAAS,MAAM;;;;;;EAclB,QAAQ;cAAsB;KAAoB,KAAO,MAAI,SAAS;;EAGtE,KAAE,mBAAoB,SAAS;;YAIrB,QAAQ,MAAM,UAAU,OAAO,OAAO,sBACtC,WAAW,aAAa,QAAQ,MAAM,EAAE,IAAI;;iBAIvC,QAAQ,MAAM;YACnB;aACC,SAAS,GAAG,YAAY,WAAW,OAAO,OAAO,WAAW,MAAM;;;;iBAK9D,YAAY,MAAM;YACvB;aACC,SAAS,GAAG,YAAY,WAAW,OAAO,OAAO,WAAW,MAAM,OAAO,OAAO;;;;iBAK5E,QAAQ,MAAM;YACnB;aACC,QAAQ,kBAAkB,YAAY,MAAM,OAAO,OAAO;;;;iBAKtD,QAAQ,MAAM,oBAAoB;YACvC;aACC,KAAK,KAAK,QAAQ,YAAY,MAAM,OAAO,OAAO;;;KAO1D,OAAO,MAAM,UAAU,gBAAgB,OAAO,aAAa,UAC5D,YAAY,MAAM,SAClB,QAAQ,MAAM;KAEb,WAAW,MAAM,OAAO,oBAAoB,qBAAqB,SACpE,MACA,OACA,KACA,WAEA,OAAO,MAAM;;;;;;YAOH,YAAY,MAAM,SAAS,SAAS,MAAM,SAAS,OAAO,MAAM;KAEvE,QAAQ,MAAM,GAAG,sBACpB,UAAU,OAAO,YAAY,SAAS,qBAClC,UAAU,OAAO,aAAa,KAC5B,WAAW,MAAM,GAAG,KAAK,WAAW,QAAQ,MAAM,KAClD,UAAU,oBAAoB,KAC5B,WAAW,MAAM,GAAG,KAAK,WAAW,QAAQ,MAAM,KAClD,UAAU,SAAS,aAAa,wBAAwB,MACtD,WAAW,MAAM,GAAG,KAAK,WAAW,QAAQ,MAAM,GAAG,KACrD,WAAW,MAAM,GAAG,KAAK;YA0IzB;iBAeK,WAAW,MAAM;WACvB,OAAO,OAAO,MAAM;WACpB,cAAc;;WAEd,UAAUA;WACV,OAAO,MAAM,SAAS;;;;;;;;iBAShB,mBAAmB,OAAO,eAAe,OAAO,OAAO;WAC7D,QAAQ,OAAO,OAAO;WACtB,cAAc;WACd,MAAM,OAAO,UAAU,OAAO,OAAO,KAAK;WAC1C,MAAM,OAAO,OAAO,QAAQ,OAAO,OAAO,KAAK,YAAY;;KAuBjE,YAAY,UAAU,OAAO,OAAO,sBAC7B,WAAW,YAAY,WAAW,OAAO,OAAO,KAAK,EAAE;KAG9D,QAAQ,UAAU,OAAO,OAAO,QAAQ,mBACjC,WAAW,YAAY,IAAI,IAAI,kBACrC,OAAO,OAAO,KAAK,EAAE,MACrB,IAAI,WAAW,sBAAsB,KACnC;KAIH,WAAW,KACd,UAAU,sBAAsB,KAAK,IAAI,UAAU,oBAAoB,KAAK;KAEzE,UAAU,KACb,UAAU,iBAAiB,UAAU,IAAI,UAAU,eAAe,UAAU;KAEzE,WAAW,uBAAuB,WAAW,UAAU,UAAU,QAAQ;;KAGzE,QAAQ,GAAG,IAAI,MAAM,6BAEtB,qBACG,YAAY;KAKd,YAAY,uBACL,WAAW,UAAU,WAAW,QAAQ,sBACpC,qBACA,WAAW,QAAQ,MAAM;;iBAqBxB,QAAQ,MAAM;WACpB,cAAc;WACd,OAAO,MAAM,SAAS;;qBAoCpB;EACX,KACG,UAAU,OAAO,OAAO,QAAM,QAAU,OAAO,OAAO,cAChD,YAAY,YAAY,IAAE,WACpB,QACV,WAAW,OAAO,OAAO,KAAK,IAAI,QAAQ,GAAG;EAyClD,eAAe,gBAAgB,eAAe,uBAAuB,qBAAmB,SAC7E,WAAW,QAAQ,WAAW,eAAe,8CACrD,WAAW,UAAU,cAAc,WAAW,YAAY;;;;;;EA6C7D,QAAQ,MAAM,OAAK,YACL,WAAW,MAAM,WAC5B,WAAW,cAAc,OAAO,cAAc;;EAYjD,SAAS,MAAM,OAAK,YACN,WAAW,MAAM,WAC5B,WAAW,OAAO,OAAO,OAAO,OAAO,OAAO;EAWjD,OAAO,MAAM,OAAK,YAAc,WAAW,MAAM,QAAM,MAAQ,SAAO;;;;;;EAQtE,aAAa,MAAM,OAAK,OACf,OAAO,MAAM,iBAAe,OAC5B,MAAM,SAAS,OAAK;aAEhB,eAAe;aACf,WAAWA;QAErB,WAAW,MAAM;;;;;;;;;;;;;;;;;;;;;EA2BpB,SAAS,MAAM,OAAK,IACd,cAAc,SAAS;aAAwB,cAAc;MAAiB,SACzE,MAAM,SAAS,UACvB,QAAQ,MAAM;;;;;;;;EAuCjB,aAAa,sBAAsB,iCAA4B,MACpD,QAAQ,QAAQ,SAAS,mDACjC,mBAAmB,SAAS,eAAe,WAAW;;;;;;;EAuDzD,gBAAgB,oBAAoB,mCAA8B,aAChD,MAAM,QAAQ,gBAAgB,iDAC7C,mBAAmB,gBAAgB,aAAa,YAAY;;iBAiDhD,SACf,MACA,UAAU,OAAO,OAAO,QACxB,cAAc,eAAe,OAAO,OAAO;WAElC,OAAO,OAAO,OAAO;WACrB,SAAS,aAAa;WACtB,OAAO,QAAQ,MAAM;;WAErB;;iBAGM;WACN;WACA,cAAc;WACd,mBAAmBC;WACnB;;;;;;;YAQC,aAAa,0BAA0B,SAC/C,OAAO,MAAM,gCACZ,yCACiB;GAId,OAAO,MAAM,+CACC;GAEd,OAAO,MAAM,+BACb,OAAO,MAAM;;;;;KAMhB,eAAe,4BAA4B,UAAU,SAAS,WAAW,QAAQ;iBAErE,QAAQ,MAAM,OAAO,SAAS;WACpC;;WAEA;WACA,QAAQ,aAAa;WACrB,SAAS,OAAO,OAAO;WACvB;WACA,aAAa,QAAQ,WAAW,WAAW,MAAM;;;;;;;;;;;;;;;;;;;;;;;;;;;iBA4B3C,WAAW;YAChB;;aAEC;aACA,MAAM,MAAM;;;iBAIR;;WAEN;;WAEA;;iBAGM,cAAc,MAAM;WAC1B;;WAEA;;WAEA,eAAe,OAAO,SAAS,OAAO,OAAO,WAAW,MAAM;;WAE9D,UAAU;;;;;WAKV,aAAa;;;;;;;;iBASP,gBAAgB,MAAM,iBAAiB;WAC7C;WACA,SAAS,QAAQ,MAAM,gBAAgB;WACvC,QAAQ;WACR,YAAY,WAAW,MAAM;;;;;;;;iBASvB,cAAc;WACpB;;WAEA;;WAEA,UAAU;WACV,cAAc,OAAO,SAAS,cAAc,gBAAgB;;;;;;;;;;iBAWtD,cACf,MACA,aACA,OACA,SACA,gBACQ,cAAc;WACb,MAAM,cAAc,MAAM;WAC1B,OAAO,QAAQ,MAAM,OAAO,SAAS;;WAErC,UAAU;;cAGP;;;;;;;iBAQG,QAAQ;YACb,UAAU;;;KAIjB,cAAc,OAAO,OAAO,SAAS,OAAO;KAE5C,SAAS,KAAK,UAAU,OAAO,MAChC,OAAO,OAAO,KAAK,KACnB,UAAU,OAAO,OAAO,SACtB,OAAO,OAAO,KAAK;;KAIpB,WAAW,QACZ,WAAW,iBACX,eAAe,WAAW,aAAa,SAAS;KAE/C,QAAQ,MAAM,KAAK,UAAU,WAAW,YAAY,KAAK,IAAI,YAAY;KAQzE,MAAM,6CACC,WAAW,KAAK,GAAG,gBAAe,wBAAwB,KAAI;;KAIrE,SAAS,iCAAiC,wBAAuB,wBAAwB,KAC1F;KAGC,WAAW,cAAc,eAAe,OAAO,OAAO,WAAW,OAAO,OAAO,KAClF,aAAa;;KAIV,mBAAmB,cAAc,eAAe,OAAO,OAAO,eAC9D,kBACA,WAAW;;;;;;;;;;KAWX,YAAY,WAAW,KAAK,YAAY,gBAAgB;;YAGjD,SAAS,OAAO,YAAY,OAAO,OAAO,GAAG,YAAY,aAAa;;KAG7E,OAAO,KAAK,UAAU,cAAc;KAEpC,QAAQ,KAAK,UAAU,eAAe,aAAa;KAEnD,SAAS,+CACF,WAAW,OAAO,QAAQ,KAAK;;KAItC,WAAW,sBAAsB,4CAC1B,KAAK,gBAAgB,SAAS,oBAAoB,SAAS;KAGlE,gBAAgB,KAAK,UAAU,yBAAyB,UAAU;KAElE,iBAAiB,KAAK,UAAU,8BAA8B,KAAK;KAEnE,OAAO,GAAG,iBACH,WAAW,UAAU,IAAI,gBAAgB,IAAI,EAAE,KAAK,gBAAgB,IAAI,EAAE;;YAI1E,YAAY,oBAAoB,kCAAkC,2BACtE,aAAa,uCACV,sBAAsB,kCAE7B,OAAO,iBAAiB,OAAO,YAAY;;;;;;;iBAS9B,YACf,MACA,UAAU,OAAO,OAAO,QACxB,cAAc,eAAe,OAAO,OAAO,iBACnC,SAAS,MAAM,GAAG;;;;;;;WAOjB,QAAQ,QAAQ,MAAM;;;;;;WAMtB,gBACD,eAAe,qCACrB,cAAc,WAAW,QAAQ,WAAW,sBACtC,oBAAoB,mBAAmB,wBAE7C,cACA;aACW,SAAS;aACT,QAAQ;eACN,OAAO,QAAQ,MAAM;eACrB,QAAQ,SAAS;UACtB;aACG,WAAW;QAEnB,QAAQ,MAAM,QAAQ,MAAM,QAAQ,MAAM,KAAK,SAAS;;;;;;;;;WASpD,WAAW,mBAAmB;aAC5B,SAAS;aACT,SACP,OAAO,MACP,SAAS,OAAO,OAAO,KAAK,aAAa,YACtC,OAAO,OAAO,MAAM,OAAO,OAAO,KAAK,aAAa,SAAS;QAC9D,oBAAoB,MAAM,GAAG,OAAO;;;;;;;iBAQ3B,oBACf,MACA,UAAU,OAAO,OAAO,QACxB,cAAc,eAAe,OAAO,OAAO,SAC3C,2BACQ,YAAY,MAAM,GAAG;WACpB,SAAS;WACT,SACP,OAAO,MACP,SAAS,OAAO,OAAO,KAAK,aAAa,YACtC,OAAO,OAAO,MAAM,OAAO,OAAO,KAAK,aAAa,SAAS;;cAGtD;;;;;;;;KAST,cAAc,iCACjB,mBAAmB,OAAO,iBAAiB,qBAAqB;iBAEjD,WACf,MACA,SACA,eAAe,SACf,yBAAyB,kBAAkB,YAC3C,cAAc,eAAe,OAAO,OAAO,UAAU,eAAe,OAAO,OAAO,SAClF;;YAGU,qBAAqB;;WAEtB;WACA,cAAc;;WAEd,QAAQ,OAAO,MAAM,QAAQ;WAC7B,MAAM;WACN,WAAW,SAAS,YAAY,WAAW;;;;;;;;iBAoC7C,YACP,UAAU,OAAO,OAAO,QACxB,cAAc,eAAe,OAAO,OAAO,SAC3C,mBACA,iCACA;WACS,OAAO,OAAO,OAAO;WACrB,SAAS,aAAa;WACtB,SAAS,OAAO,OAAO,KAAK;WAC5B,SACP,OAAO,OAAO,OAAO,KAAK,IAC1B,SAAS,OAAO,OAAO,KAAK,aAAa,YACtC,OAAO,OACV,OAAO,OAAO,KAAK,IACnB,OAAO,OAAO,KAAK,aAAa,SAChC,YAAY;IAEZ,oBAAoB,OAAO,OAAO,KAAK,IAAI,GAAG,OAAO,YAAY;iBAC5D,YACP,UAAU,OAAO,OAAO,QACxB,cAAc,eAAe,OAAO,OAAO,SAC3C;WACS,OAAO,OAAO,OAAO;WACrB,SAAS,aAAa;IAC7B,YAAY,OAAO,OAAO,KAAK,IAAI,GAAG;KAmCrC,oBAAoB,KAAK,UAAU,gCAAgC,WAAW;KAC9E,cAAc,KAAK,UAAU,2BAA2B,eAAe;KACvE,aAAa,KAAK,UAAU,iBAAiB,yBAAyB;KACtE,gBAAgB,KAAK,UAAU,sBAAsB,oBAAoB;KACzE,cAAc,KAAK,UAAU,qCAAqC,KAAK;KAEvE,OAAO,8BAA8B,oCAAoC,MAAM;;YAGxE,kBAAkB,sBAAsB,yCAClD,6BACQ,aAAa,8CACV,sBAAsB,yCAE7B,OAAO,oBAAoB,OAAO,kBAAkB;;qBAI7C;;;;;;;EAOX,OACE,MACA,UAAU,OAAO,OAAO,QACxB,cAAc,eAAe,OAAO,OAAO,eACrC,oBAAoB,mBAAmB,UAAQ,KAEhD,SAAS,MAAM,GAAG,QAAM,UACnB,OACT,WACD,MACA,OAAO,OAAO,KAAK,aAAa,SAChC,SAAS,MAAM,OAAO,OAAO,KAAK,aAAa,SAC/C,IACA,OACA,cAAc;;;;;;EAsChB,cAAc,sBAAsB,0CAAqC,SAC3D,SACX,WACD,aAAa,eACb,gBAAgB,eAChB,cAAc,eACd,kBAAkB,OAClB,cAAc,eACd,cAAc,kBAAkB;;;;;;;;;iBA6CnB,OACf,8BACA,eACA,mBACA;WAES;WACA,MAAM;;WAEN;WACA,OAAO,OAAO,MAAM,OAAO;WAC3B,YAAY,OAAO,UAAU;;qBAG3B;;EAEX,eAAe,qBAAqB,OAAO,SAAS,SAAO;aAChD,MAAM;aACN;aACA,OAAO,OAAO,MAAM,OAAO;aAC3B,YAAY,OAAO,UAAU;QACpC,OAAO,MAAM,OAAO,SAAS;;EAMjC,KAAE,mBAAoB,SAAS;;;;;EAO/B,MAAM,OAAO,SAAS,SAAO,QACnB,eAAe,OAAO,SAAS,UAAQ,kBAE9C,OAAO,OAAO,SAAS,OAAO;;qBAItB;;;;;;;EAQN,KAAA,MAAM,OAAO,SAAS,QAAM,SACtB,QAAQ,MAAM,OAAO,SAAS,SAAO,QACtC,WAAW,OAAO,SAAS,OAAO,OAAO,aAChD,cAAc,MAAM,SAAS,cAAc;;;;;;;;;;;;;;;;;;;;;;EAgDvC,OAAA,MAAM,OAAO,SAAS,QAAQ,aAAa,OAAO,KAAG,SACjD,QAAQ,MAAM,OAAO,SAAS,SAAO,OACvC,WAAW,OAAK,QACf,MAAI,SACH,OAAO,OAAO,OAAO,KAAK,UAAU,WAC5C,cAAc,MAAM,SAAS,cAAc;;;;;;;;;;;;;;;;;;;;EAsDvC,OAAA,MAAM,aAAa,OAAO,SAAS,QAAM,OACvC,QAAQ,MAAM,OAAO,SAAS,SAAO;aAEjC,MAAM,cAAc,MAAM;aAC1B,YACP,QAAQ,gBACL;eAAyB;eAAsB,QAAQ;;QAE7D,cAAc,MAAM,aAAa,OAAO,SAAS;;;;;;;;EAgCxC,YAAA,MAAI,QACN,cAAc,OAAK,OACpB,SACN,cAAc,gBAAgB;EAG/B,OAAA,MACA,UAAU,OAAO,OAAO,QACxB,cAAc,eAAe,OAAO,OAAO,SAC3C,eACA,uBACM,oBAAoB,mBAAmB,wBAAsB,KAE9D,SAAS,MAAM,GAAG,QAAM,cACjB;aAED,SAAS,OAAO,MAAM;aACtB,QAAQ;eACN,OAAO,QAAQ,MAAM;eACrB,QAAQ;UACb,WAAW,MAAM;aACd,WAAW;QAErB,QAAQ,MAAM,OAAO,MAAM,KAAK;EA0B5B,OAAA,MAAM,OAAO,SAAS,QAAM,SACxB,QAAQ,MAAM,OAAO,SAAS,SAAO,MACxC,SAAI,QACC,eAAe,YACzB;;;;;;EAOI,OAAA,MAAM,OAAO,SAAS,QAAM,UACvB,QAAQ,MAAM,OAAO,SAAS,SAAO,QACvC,SAAS,OAAO,aACvB,SAAS,OAAO;;;;;;EAOR,WAAA,MAAM,OAAO,SAAS,QAAM,SAC5B,QAAQ,MAAM,OAAO,SAAS,SAAO,QACtC,QAAM,QACN,SAAS,OAAO,eACrB,YACH,MAAM,MACN,GAAG,YAAY,cAAc,OAAO,SAAS,gBAC1C;;;;;;EAgBF,QAAA,YAAY,cAAY,OAAS,SAAS,YAAY,mBACtD,oBAAoB,YAAY,eAAa,OACrC,aAAW,GACf,YAAY,iBAAiB,OAAO,cAAc,mBACpD;;;;;EAOM,WAAA,MAAM,OAAO,SAAS,QAAM,SAC5B,QAAQ,MAAM,OAAO,SAAS,YAAO,QACnC,eAAe,YACzB;;;;;EAiBO,UAAA,MAAM,OAAO,SAAS,QAAM,SAC3B,QAAQ,MAAM,OAAO,SAAS,YAAO,QACnC,eAAe,YACzB;;;;;;;;iBAyBY;WACN;WACA;;WAEA;WACA,MAAM;WACN,UAAU;;WAEV;;WAEA,mBAAmBA;;;;;;;;;;iBAWb,OAAO,OAAO,SAAS,WAAW;;WAExC;;;;;;;;WAQA,SAAS,cAAc;;WAEvB;;;;;;EAMT,OAAO,OAAO,OAAO,SAAS,UAAU,OAAO,OAAO,OAAO,OAAO,OAAO,SAAS;;WAE3E,OAAO,OAAO,KAAK,OAAO,SAAS;;WAEnC,UAAU,OAAO,OAAO,KAAK,QAAQ;WACrC,gBAAgB,cAAc,OAAO,SAAS;WAC9C,YACL,SAAS,eAAeC,MAAqB,OAAO;;WAG/C,WAAW;;;iBAIL,OACf,MACA,UAAU,OAAO,OAAO,QACxB,cAAc,eAAe,OAAO,OAAO;WAElC,KAAK,SAAS,MAAM,GAAG;WACvB,oBAAoB;;iBAGd;WACN;;WAQA;WACA;;;iBAIM;WACN;WACA;aAAkB;aAAuB;;;iBAGnC;WACN;WACA;WACA,oBAAoB;WACpB,oBAAoB,KAAK;WACzB,mBAAmB;;;YAIlB,WAAW,QACnB;WACW,UAAU;IACrB,QAAQ;;;;;;;;;;;qBAwCC;EACX,OAAO,MAAM,UAAU,OAAO,OAAO,QAAQ,cAAc,eAAe,OAAO,OAAO,SAAO,KACxF,SAAS,MAAM,GAAG,QAAM,iBACb,WAAW,YAC1B,OAAO,MAAM,GAAG;;EAGnB,MAAM,MAAM,UAAU,OAAO,OAAO,QAAQ,cAAc,eAAe,OAAO,OAAO,SAAO,QACpF,OAAO,MAAM,GAAG,WAAM,gBACX,WAAW,YAC7B,OAAO,MAAM,GAAG;;;;;;;EAWnB,WAAQ,QAAW,mCAAiC;;;;;;EA8EpD,WAAQ,QAAW,0BAAwB;;EA0B3C,aAAU,QAAW;;;;;EAgCrB,YAAS,QAAW"}
|
package/dist/index.js
CHANGED
|
@@ -1,6 +1,7 @@
|
|
|
1
1
|
import { Optic, Option, Predicate, Result, Schema } from "effect";
|
|
2
2
|
import { Metadata, Metadata as Metadata$1, MetadataTypeId } from "foldkit-metadata";
|
|
3
3
|
import { Diagnostics } from "./diagnostics.js";
|
|
4
|
+
import { CacheStore, CachedRead, PageReads, cachePolicy, maxAgeSeconds, shorterPolicy } from "./edgeCache.js";
|
|
4
5
|
// src/index.ts
|
|
5
6
|
/**
|
|
6
7
|
* `foldkit-surface` — the observation boundary for a Foldkit application.
|
|
@@ -145,6 +146,7 @@ const sameFields = (left, right) => {
|
|
|
145
146
|
if (typeof left !== "object" || typeof right !== "object" || left === null || right === null) return false;
|
|
146
147
|
const prototype = Object.getPrototypeOf(left);
|
|
147
148
|
if (!(prototype === Object.prototype || prototype === null || Array.isArray(left)) || Object.getPrototypeOf(right) !== prototype) return false;
|
|
149
|
+
if (Array.isArray(left) && left.length !== right.length) return false;
|
|
148
150
|
const keys = Object.keys(left);
|
|
149
151
|
return keys.length === Object.keys(right).length && keys.every((key) => Object.hasOwn(right, key) && Object.is(left[key], right[key]));
|
|
150
152
|
};
|
|
@@ -832,6 +834,6 @@ const Module = {
|
|
|
832
834
|
return lines.join("\n");
|
|
833
835
|
}
|
|
834
836
|
};
|
|
835
|
-
export { Action, Diagnostics, MessageSet, Metadata, MetadataTypeId, ModelRef, Module, Projection, RefTypeId, Surface };
|
|
837
|
+
export { Action, CacheStore, CachedRead, Diagnostics, MessageSet, Metadata, MetadataTypeId, ModelRef, Module, PageReads, Projection, RefTypeId, Surface, cachePolicy, maxAgeSeconds, shorterPolicy };
|
|
836
838
|
|
|
837
839
|
//# sourceMappingURL=index.js.map
|
package/dist/index.js.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"index.js","names":["Metadata"],"sources":["../src/index.ts"],"sourcesContent":["/**\n * `foldkit-surface` — the observation boundary for a Foldkit application.\n *\n * A Surface is a pure projection of the Model: it declares which fields a\n * feature reads and which Messages it may construct, from the application's\n * own Schema rather than a second hand-written interface. `foldkit-remote`,\n * `foldkit-sync`, `foldkit-agent`, and `foldkit-mirror` all read this boundary,\n * and `Module` validates that each Model path has one owner.\n *\n * Nothing here runs: the deliverable is the type surface, pinned by\n * `test/inference.test-d.ts`.\n */\nimport { Optic, Option, Predicate, Result, Schema } from 'effect'\nimport type { Html, HtmlBuilder } from 'foldkit/html'\nimport type { MessageUnion } from 'foldkit/message'\nimport type { Entry as ManagedResourceEntry } from 'foldkit/managedResource'\nimport type { Subscriptions } from 'foldkit/subscription'\nimport type * as Update from 'foldkit/update'\nimport type { Url } from 'foldkit/url'\nimport { Metadata, type MetadataSummary } from 'foldkit-metadata'\n\nexport { Metadata, MetadataTypeId, type MetadataKey, type MetadataSummary } from 'foldkit-metadata'\nexport { Diagnostics, type Diagnostic, type ReportDiagnostic } from './diagnostics.js'\n\n// ===========================================================================\n// ModelRef and the typed Model tree (Phase 0 cases 1)\n// ===========================================================================\n\n/**\n * The key a ref keeps its own members under; read them with `ModelRef.focus`.\n * A ref's string keys are the Model's fields, whatever their names (#331),\n * and no Schema field reaches a symbol. `Symbol.for`, so two copies of this\n * package read each other's refs.\n */\nexport const RefTypeId: unique symbol = Symbol.for('foldkit-surface/ModelRef')\n\n/** What a ref points at and how to read and write it: `ModelRef.focus(ref)`. */\nexport interface Focus<Root, Value, Encoded = unknown> {\n /** A pure codec: Foldkit Model fields carry no decoding or encoding services. */\n readonly Schema: Schema.Codec<Value, Encoded, never, never>\n readonly optic: Optic.Optional<Root, Value>\n /** The Model path the ref points at. */\n readonly dependency: readonly string[]\n readonly get: (root: Root) => Value\n readonly set: (root: Root, value: Value) => Root\n /**\n * Focused structural replacement: `set` of `fn` applied to `get`. This\n * delegates through the focus's own `set`, so container-aware setters\n * (`at`/`index` insertion and removal) keep working — never `optic`\n * calls directly. Infrastructure seam, not an application transition.\n */\n readonly modify: (root: Root, fn: (value: Value) => Value) => Root\n}\n\n/**\n * A reference to a place in the Model. Its string keys are the fields below\n * it; its own members are its `Focus`, read with `ModelRef.focus`.\n */\nexport interface ModelRef<Root, Value, Encoded = unknown> {\n readonly [RefTypeId]: Focus<Root, Value, Encoded>\n}\n\n/**\n * A `ModelRef` generated for a named Model field. `key` is the literal field\n * name, so a reference-based selection can infer its output keys without a\n * parallel field registry or string paths.\n */\nexport interface FieldRef<\n Root,\n Value,\n Key extends string = string,\n Encoded = unknown,\n> extends ModelRef<Root, Value, Encoded> {\n readonly [RefTypeId]: Focus<Root, Value, Encoded> & {\n readonly key: Key\n /** The application definition this field was generated from. */\n readonly owner: object\n }\n}\n\nconst makeFocus = <Root, Value>(\n Schema: Schema.Codec<Value, unknown, never, never>,\n optic: Optic.Optional<Root, Value>,\n dependency: readonly string[],\n get: (root: Root) => Value,\n set: (root: Root, value: Value) => Root,\n): Focus<Root, Value> => ({\n Schema,\n optic,\n dependency,\n get,\n set,\n modify: (root, fn) => set(root, fn(get(root))),\n})\n\nexport const ModelRef = {\n /**\n * Low-level escape hatch for a focus with no Model path of its own. Prefer\n * the `App.model` tree; use this for an optic that is not part of the Model.\n */\n fromOptic: <Root, Value>(\n Schema: Schema.Schema<Value>,\n optic: Optic.Optional<Root, Value>,\n dependency: readonly string[] = [],\n ): ModelRef<Root, Value> => ({\n [RefTypeId]: makeFocus(\n Schema as unknown as Schema.Codec<Value, unknown, never, never>,\n optic,\n dependency,\n root => Result.getOrThrow(optic.getResult(root)),\n (root, value) => optic.replace(value, root),\n ),\n }),\n /**\n * A ref's own members: where it points, how to read and write it, and, as\n * its value allows, `at` (a record), `index` (an array) and `select`. They\n * are kept apart from the ref's string keys, which are the Model's fields.\n */\n focus: <R extends { readonly [RefTypeId]: object }>(ref: R): R[typeof RefTypeId] =>\n ref[RefTypeId],\n /** Whether a value is a ref, as opposed to a Projection or a plain object. */\n is: (value: unknown): value is ModelRef<unknown, unknown> =>\n typeof value === 'object' && value !== null && RefTypeId in value,\n}\n\nexport type RefTree<Root, F extends Schema.Struct.Fields> = {\n readonly [K in keyof F & string]: RefNode<Root, F[K], K>\n}\n\n/** A ref whose focus can `select` a Projection of its value. */\nexport interface Selects<Root, Value> {\n readonly [RefTypeId]: {\n readonly select: <P>(projection: Projection<Value, P>) => Projection<Root, P>\n }\n}\n\n/** A ref to an optional value, whose focus selects inside the Option. */\nexport interface SelectsSome<Root, Inner> {\n readonly [RefTypeId]: {\n readonly select: <P>(projection: Projection<Inner, P>) => Projection<Root, Option.Option<P>>\n }\n}\n\n/** A ref to an array, whose focus reaches an item: `ModelRef.focus(ref).index(0)`. */\nexport interface Indexes<Root, Item> {\n readonly [RefTypeId]: {\n readonly index: (index: number) => OptionalRef<Root, Option.Option<Item>>\n }\n}\n\n/** A ref to a record, whose focus reaches an entry: `ModelRef.focus(ref).at(key)`. */\nexport interface Entries<Root, Key extends string, Value> {\n readonly [RefTypeId]: {\n readonly at: (key: Key) => OptionalRef<Root, Option.Option<Value>>\n }\n}\n\n// Tuple-wrapped so the conditional is *non-distributive*: without it,\n// `Value = Option<V>` distributes over `None | Some<V>` and `select` would\n// return a union of two unrelated projections.\ntype Select<Root, Value> = [Value] extends [Option.Option<infer Inner>]\n ? SelectsSome<Root, Inner>\n : Selects<Root, Value>\n\ntype Selectable<Root, Value, Key extends string, Encoded = unknown> = FieldRef<\n Root,\n Value,\n Key,\n Encoded\n> &\n Select<Root, Value>\n\n/**\n * A dynamic focus from `at`/`index`. Deliberately not a `FieldRef`: its key is\n * a record key or index, not a Model field, so a static `Projection.pick`\n * cannot infer a field name from it.\n */\nexport type OptionalRef<Root, Value> = ModelRef<Root, Value> & Select<Root, Value>\n\ntype RefNode<Root, S, Key extends string> =\n S extends Schema.Codec<infer A, infer Encoded, any, any>\n ? S extends Schema.Struct<infer F>\n ? Selectable<Root, A, Key, Encoded> & RefTree<Root, F>\n : A extends ReadonlyArray<infer E>\n ? Selectable<Root, A, Key, Encoded> & Indexes<Root, E>\n : A extends Readonly<Record<infer K extends string, infer V>>\n ? Selectable<Root, A, Key, Encoded> & Entries<Root, K, V>\n : Selectable<Root, A, Key, Encoded>\n : never\n\ntype AnySchema = Schema.Codec<unknown, unknown>\n\n// A key may be a stored id (`at(id)`), so only the container's own keys count.\nfunction propertyReader(root: unknown, key: string): unknown {\n return root === null || root === undefined || !Object.hasOwn(root, key)\n ? undefined\n : (root as Record<string, unknown>)[key]\n}\n\nfunction optionalReader(value: unknown): Option.Option<unknown> {\n return value === undefined ? Option.none() : Option.some(value)\n}\n\n/** Reads the tag off a Foldkit Message constructor without constructing one. */\nconst messageTag = (constructor: unknown): string | undefined => {\n const literal = (constructor as { fields?: { _tag?: { ast?: { literal?: unknown } } } }).fields\n ?._tag?.ast?.literal\n return typeof literal === 'string' ? literal : undefined\n}\n\n/** Whether a Message, of an application this cannot name, has one of `tags`. */\nconst hasTagIn = (tags: ReadonlySet<string>, message: unknown): boolean =>\n Predicate.hasProperty(message, '_tag') &&\n typeof message._tag === 'string' &&\n tags.has(message._tag)\n\n/** The tags of the Messages a Surface lists in `messages`. */\nconst messageTags = (surface: { readonly messages: readonly unknown[] }): ReadonlyArray<string> =>\n surface.messages.map(messageTag).filter((tag): tag is string => tag !== undefined)\n\nfunction makeTree(\n schema: AnySchema,\n path: readonly string[],\n optic: Optic.Optional<unknown, unknown>,\n get: (root: unknown) => unknown,\n optional = false,\n set: ((root: unknown, value: unknown) => unknown) | undefined,\n owner: object,\n): Record<string, unknown> {\n const erasedOptic = optic as {\n key(key: string): Optic.Optional<unknown, unknown>\n at(key: string): Optic.Optional<unknown, unknown>\n }\n // `Optic.at` cannot *insert* or *remove* an absent key (`replace` is a no-op\n // when the prism fails), so optional foci get container-aware setters below.\n const setFocus = set ?? ((root: unknown, value: unknown): unknown => optic.replace(value, root))\n const focus: Record<string, unknown> = {\n ...makeFocus(schema as never, optic, path, get, setFocus),\n key: path[path.length - 1] ?? '',\n owner,\n }\n const node: Record<PropertyKey, unknown> = { [RefTypeId]: focus }\n\n const fields = (schema as { readonly fields?: Schema.Struct.Fields }).fields\n if (fields !== undefined) {\n for (const key of Object.keys(fields)) {\n // Defined, not assigned: assigning `__proto__` would set the prototype.\n Object.defineProperty(node, key, {\n value: makeTree(\n fields[key] as AnySchema,\n [...path, key],\n erasedOptic.key(key),\n root => propertyReader(get(root), key),\n false,\n undefined,\n owner,\n ),\n enumerable: true,\n writable: true,\n configurable: true,\n })\n }\n }\n\n focus.at = (key: string) =>\n makeTree(\n schema,\n [...path, key],\n erasedOptic.at(key),\n root => optionalReader(propertyReader(get(root), key)),\n true,\n (root, value) => {\n const container = get(root) as Record<string, unknown>\n const option = value as Option.Option<unknown>\n if (Option.isSome(option)) {\n return setFocus(root, { ...container, [key]: option.value })\n }\n const { [key]: _removed, ...rest } = container\n return setFocus(root, rest)\n },\n owner,\n )\n focus.index = (index: number) =>\n makeTree(\n schema,\n [...path, String(index)],\n optic,\n root =>\n optionalReader(\n Array.isArray(get(root)) ? (get(root) as ReadonlyArray<unknown>)[index] : undefined,\n ),\n true,\n (root, value) => {\n const array = (Array.isArray(get(root)) ? get(root) : []) as ReadonlyArray<unknown>\n const option = value as Option.Option<unknown>\n const next = Option.isSome(option)\n ? array.map((item, i) => (i === index ? option.value : item))\n : array.filter((_, i) => i !== index)\n return setFocus(root, next)\n },\n owner,\n )\n focus.select = (projection: Projection<unknown, unknown>) => {\n const dependencies = mergeDependencies([path, ...projection.dependencies])\n return optional\n ? makeProjection(\n Schema.Option(projection.Model),\n dependencies,\n root => Option.map(get(root) as Option.Option<unknown>, value => projection.read(value)),\n projection.metadata,\n )\n : makeProjection(\n projection.Model,\n dependencies,\n root => projection.read(get(root)),\n projection.metadata,\n )\n }\n return node\n}\n\n// ===========================================================================\n// Projection (Phase 0 case 2)\n// ===========================================================================\n\nexport type DependencyTree = readonly (readonly string[])[]\n\n/** Unions dependency trees, dropping duplicates; the result is a set. */\nfunction mergeDependencies(dependencies: DependencyTree): DependencyTree {\n const seen = new Set<string>()\n const merged: (readonly string[])[] = []\n for (const dependency of dependencies) {\n const key = dependency.join('\\u0000')\n if (seen.has(key)) continue\n seen.add(key)\n merged.push(dependency)\n }\n return merged\n}\n\nexport interface Projection<Root, Value> {\n readonly Model: Schema.Codec<Value, unknown>\n readonly dependencies: DependencyTree\n /** Interpreter-owned facts about this node and everything it composes. */\n readonly metadata: Metadata\n readonly read: (root: Root) => Value\n}\n\n/**\n * A projection Surface can install back into a Model. Public reads use the\n * read-only `Projection`; only a writable selection carries installation.\n * `set` writes exactly the declared fields, so an excess field in an untrusted\n * value cannot reach local state.\n */\nexport interface WritableProjection<Model, Fields extends Schema.Struct.Fields> {\n readonly schema: Schema.Struct<Fields>\n readonly dependencies: DependencyTree\n readonly get: (model: Model) => Schema.Struct.Type<Fields>\n readonly set: (model: Model, shared: Schema.Struct.Type<Fields>) => Model\n}\n\nfunction makeProjection<Value>(\n Model: Schema.Codec<Value, unknown>,\n dependencies: DependencyTree,\n read: (root: unknown) => Value,\n metadata: Metadata = Metadata.empty,\n): Projection<unknown, Value> {\n return { Model, dependencies, metadata, read }\n}\n\n/**\n * `Schema.Struct({})` is not an empty-object schema: it accepts `{foo:1}`, `[]`,\n * and `\"str\"` even with `onExcessProperty: 'error'`. A genuinely empty selection\n * needs a `never`-valued record.\n */\nfunction objectSchema(fields: Record<string, AnySchema>): AnySchema {\n return Object.keys(fields).length === 0\n ? Schema.Record(Schema.String, Schema.Never)\n : Schema.Struct(fields)\n}\n\ntype OfSelection<F extends Schema.Struct.Fields> = {\n readonly [K in keyof F]?: true | Projection<Schema.Schema.Type<F[K]>, unknown>\n}\n\ntype OfValue<F extends Schema.Struct.Fields, Sel> = {\n readonly [K in keyof Sel & keyof F]: Sel[K] extends true\n ? Schema.Schema.Type<F[K]>\n : Sel[K] extends Projection<any, infer V>\n ? V\n : never\n}\n\ntype EntryValue<E> =\n E extends Projection<any, infer V> ? V : E extends ModelRef<any, infer V> ? V : never\n\ntype EntryRoot<E> =\n E extends Projection<infer R, any> ? R : E extends ModelRef<infer R, any> ? R : never\n\ntype EntryRoots<Entries> = { readonly [K in keyof Entries]: EntryRoot<Entries[K]> }\n\n/** `true` when the union has more than one member. Used to reject mixed roots. */\ntype IsUnion<T, U = T> = [T] extends [never]\n ? false\n : T extends unknown\n ? [U] extends [T]\n ? false\n : true\n : never\n\ntype StructValue<Entries> = {\n readonly [K in keyof Entries]: EntryValue<Entries[K]>\n} extends infer Value\n ? { readonly [K in keyof Value]: Value[K] }\n : never\n\n// What reads something no path of its own names: a Remote read, named by its\n// metadata, declares no path, and a Projection composing one declares only its\n// other parts' paths. `derive` cannot skip a read of either. A set, not a\n// field, since only a derivation asks.\nconst readsUnnamed = new WeakSet<object>()\n\nconst unnamed = (entry: { readonly dependencies: DependencyTree }): boolean =>\n entry.dependencies.length === 0 || readsUnnamed.has(entry)\n\nconst markedBy = <P extends object>(\n composed: P,\n parts: ReadonlyArray<{ readonly dependencies: DependencyTree }>,\n): P => {\n if (parts.some(unnamed)) readsUnnamed.add(composed)\n return composed\n}\n\n/** A value derived from the Model and the paths it reads: what `Projection.derive` makes. */\nexport interface Derived<Root, Value> {\n readonly dependencies: DependencyTree\n readonly read: (root: Root) => Value\n}\n\nconst valueAt = (root: unknown, path: ReadonlyArray<string>): unknown => {\n let value = root\n for (const key of path) {\n if (typeof value !== 'object' || value === null) return undefined\n value = (value as Record<string, unknown>)[key]\n }\n return value\n}\n\n// The earlier value when the new one holds the same fields: a struct is a new record every time.\nconst keepAlike = <Value>(before: Value, value: Value): Value =>\n sameFields(before, value) ? before : value\n\nconst sameFields = (left: unknown, right: unknown): boolean => {\n if (Object.is(left, right)) return true\n if (typeof left !== 'object' || typeof right !== 'object' || left === null || right === null)\n return false\n const prototype = Object.getPrototypeOf(left)\n const plain = prototype === Object.prototype || prototype === null || Array.isArray(left)\n if (!plain || Object.getPrototypeOf(right) !== prototype) return false\n const keys = Object.keys(left)\n return (\n keys.length === Object.keys(right).length &&\n keys.every(\n key =>\n Object.hasOwn(right, key) &&\n Object.is((left as Record<string, unknown>)[key], (right as Record<string, unknown>)[key]),\n )\n )\n}\n\nexport const Projection = {\n of:\n <F extends Schema.Struct.Fields>(schema: Schema.Struct<F>) =>\n <const Sel extends OfSelection<F>>(\n selection: Sel,\n ): Projection<Schema.Struct.Type<F>, OfValue<F, Sel>> => {\n // No prototype, so a field named `__proto__` stays a key (see `struct`).\n const picked: Record<string, AnySchema> = Object.create(null)\n const dependencies: (readonly string[])[] = []\n const metadata: Metadata[] = []\n // A field picked with `true` declares no path of its own.\n const parts: { readonly dependencies: DependencyTree }[] = []\n const readers: (readonly [string, (root: unknown) => unknown])[] = []\n\n for (const key of Object.keys(selection)) {\n const choice = (selection as Record<string, unknown>)[key]\n if (choice === true) {\n picked[key] = schema.fields[key] as AnySchema\n parts.push({ dependencies: [] })\n readers.push([key, root => propertyReader(root, key)])\n } else {\n const nested = choice as Projection<unknown, unknown>\n picked[key] = nested.Model\n dependencies.push(...nested.dependencies)\n metadata.push(nested.metadata)\n parts.push(nested)\n readers.push([key, root => nested.read(propertyReader(root, key))])\n }\n }\n\n const read = (root: unknown): unknown => {\n const out: Record<string, unknown> = Object.create(null)\n for (const [key, reader] of readers) out[key] = reader(root)\n return out\n }\n return markedBy(\n makeProjection(\n objectSchema(picked),\n mergeDependencies(dependencies),\n read,\n Metadata.combine(metadata),\n ),\n parts,\n ) as unknown as Projection<Schema.Struct.Type<F>, OfValue<F, Sel>>\n },\n\n struct: <const Entries extends Record<string, Projection<any, any> | ModelRef<any, any>>>(\n entries: Entries & (IsUnion<EntryRoots<Entries>[keyof Entries]> extends true ? never : unknown),\n ): Projection<EntryRoot<Entries[keyof Entries]>, StructValue<Entries>> => {\n // Keys may be stored ids (a page's node ids), so `__proto__` must stay a key.\n const picked: Record<string, AnySchema> = Object.create(null)\n const dependencies: (readonly string[])[] = []\n const metadata: Metadata[] = []\n const nesteds: Projection<unknown, unknown>[] = []\n const readers: (readonly [string, (root: unknown) => unknown])[] = []\n\n for (const key of Object.keys(entries)) {\n const entry = entries[key] as Projection<unknown, unknown> | ModelRef<unknown, unknown>\n if (ModelRef.is(entry)) {\n const focus = entry[RefTypeId]\n picked[key] = focus.Schema\n dependencies.push(focus.dependency)\n readers.push([key, focus.get])\n } else {\n picked[key] = entry.Model\n dependencies.push(...entry.dependencies)\n metadata.push(entry.metadata)\n nesteds.push(entry)\n readers.push([key, entry.read])\n }\n }\n\n const read = (root: unknown): unknown => {\n const out: Record<string, unknown> = Object.create(null)\n for (const [key, reader] of readers) out[key] = reader(root)\n return out\n }\n return markedBy(\n makeProjection(\n objectSchema(picked),\n mergeDependencies(dependencies),\n read,\n Metadata.combine(metadata),\n ),\n nesteds,\n ) as unknown as Projection<EntryRoot<Entries[keyof Entries]>, StructValue<Entries>>\n },\n\n /**\n * Maps a Projection over an array: `array(p): Projection<ReadonlyArray<Root>,\n * ReadonlyArray<Value>>`. Nesting is explicit (an array of arrays stays an\n * array of arrays); there is no flatten or double-wrap.\n */\n array: <Root, Value>(\n projection: Projection<Root, Value>,\n ): Projection<ReadonlyArray<Root>, ReadonlyArray<Value>> =>\n markedBy(\n {\n Model: Schema.Array(projection.Model),\n dependencies: projection.dependencies,\n metadata: projection.metadata,\n read: root => root.map(value => projection.read(value)),\n },\n [projection],\n ),\n\n /** Maps a Projection inside an Option, preserving absence. */\n option: <Root, Value>(\n projection: Projection<Root, Value>,\n ): Projection<Option.Option<Root>, Option.Option<Value>> =>\n markedBy(\n {\n Model: Schema.Option(projection.Model),\n dependencies: projection.dependencies,\n metadata: projection.metadata,\n read: root => Option.map(root, value => projection.read(value)),\n },\n [projection],\n ),\n\n read: <Root, Value>(projection: Projection<Root, Value>, root: Root): Value =>\n projection.read(root),\n\n /**\n * Low-level escape hatch: a Projection from a Schema and a reader, for\n * projections not derived from ModelRefs (agent context, adapters). Prefer\n * `of`/`struct`/`select`; dependencies default to empty.\n */\n fromReader: <Root, Value>(\n Model: Schema.Codec<Value, unknown>,\n read: (root: Root) => Value,\n options?: {\n readonly dependencies?: DependencyTree\n readonly metadata?: Metadata\n },\n ): Projection<Root, Value> => ({\n Model,\n dependencies: options?.dependencies ?? [],\n metadata: options?.metadata ?? Metadata.empty,\n read,\n }),\n\n /**\n * A value worked out from the Model, and worked out again only when a value\n * at a path it reads is a new object: the value counterpart of\n * `foldkit-mixins`' `SlotView.region`, and what a region can be drawn from.\n * `on` names what `derive` reads, as field references or Projections;\n * `derive` must read nothing else, or it shows what it read last. While\n * something in `on` reads what no path of its names (a Remote read, alone or\n * inside a `struct`), the value is worked out on every read. A result with\n * the same fields as the last, shallowly, gives the last back, so a memo\n * keyed on it holds. It keeps one result: the one for the last Model it was\n * given.\n *\n * @example\n * ```ts\n * const shown = Projection.derive([App.model.todos, App.model.filter], (model: Model) =>\n * model.todos.filter(todo => model.filter === 'all' || todo.done === (model.filter === 'done')),\n * )\n * // In the view: shown.read(model)\n * ```\n */\n derive: <Root, Value>(\n on: ReadonlyArray<ModelRef<Root, any> | { readonly dependencies: DependencyTree }>,\n derive: (root: Root) => Value,\n ): Derived<Root, Value> => {\n if (on.length === 0) {\n throw new Error(\n 'Projection.derive: it names nothing it reads, so nothing could tell it to work the value out again. Name field references, or Projections built from them.',\n )\n }\n const parts = on.map(entry =>\n RefTypeId in entry ? { dependencies: [entry[RefTypeId].dependency] } : entry,\n )\n const dependencies = mergeDependencies(parts.flatMap(part => part.dependencies))\n // No path changes when what such a read reads does, so none can skip it.\n const always = parts.some(unnamed)\n let last: { readonly values: ReadonlyArray<unknown>; readonly value: Value } | undefined\n const derived: Derived<Root, Value> = {\n dependencies,\n read: root => {\n const values = dependencies.map(path => valueAt(root, path))\n const before = last\n const value =\n before === undefined\n ? derive(root)\n : !always && values.every((value, index) => Object.is(value, before.values[index]))\n ? before.value\n : keepAlike(before.value, derive(root))\n last = { values, value }\n return value\n },\n }\n if (always) readsUnnamed.add(derived)\n return derived\n },\n\n /**\n * Derives a writable projection from generated Model field references:\n * `Projection.pick(App.model.todos, App.model.selectedTodoId)` infers\n * `{ todos, selectedTodoId }` and its codec. Every reference must share one\n * Root; a raw optic or an unrelated application is rejected. Repeated\n * identical members deduplicate; a conflicting definition throws.\n */\n pick: <const Refs extends readonly FieldRef<any, any, string>[]>(\n ...refs: Refs & (IsUnion<RefRoots<Refs>[number]> extends true ? never : unknown)\n ): WritableProjection<RefRoots<Refs>[number], PickFields<Refs>> => {\n const selected = refs.map(ref => ref[RefTypeId])\n // Two applications can have structurally identical Models, so the root type\n // check cannot separate them; the owner token can.\n const owner = selected[0]?.owner\n for (const focus of selected) {\n if (focus.owner !== owner) {\n throw new Error('Projection.pick: references from different applications')\n }\n }\n // A picked field is named by its last key alone, so two fields at\n // different paths with the same name would be one field: `get` would keep\n // one value and `set` would write it into both. The same field picked twice\n // is harmless and kept once; two different ones are refused here.\n // No prototype: a field named `constructor` must not read as already picked.\n const fields: Record<string, AnySchema> = Object.create(null)\n const paths: Record<string, string> = Object.create(null)\n for (const focus of [...selected]) {\n const path = focus.dependency.join('.')\n const existing = paths[focus.key]\n if (existing !== undefined) {\n if (existing === path) {\n selected.splice(selected.indexOf(focus), 1)\n continue\n }\n throw new Error(\n `Projection.pick: \"${existing}\" and \"${path}\" would both be read as \"${focus.key}\". Pick them in separate projections.`,\n )\n }\n paths[focus.key] = path\n fields[focus.key] = focus.Schema\n }\n return {\n schema: objectSchema(fields) as never,\n dependencies: mergeDependencies(selected.map(focus => focus.dependency)),\n get: model => {\n const out: Record<string, unknown> = Object.create(null)\n for (const focus of selected) out[focus.key] = focus.get(model as never)\n return out as never\n },\n set: (model, shared) => {\n let next = model\n for (const focus of selected)\n next = focus.set(next as never, (shared as Record<string, unknown>)[focus.key] as never)\n return next\n },\n }\n },\n\n /**\n * Merges disjoint writable projections into one: `Projection.compose(Todos,\n * Selection)`. Every projection must own the same Model; a field defined twice\n * with a different codec throws, while an identical definition deduplicates.\n * `set` installs each part, so composed fields keep their own write behaviour.\n */\n compose: <const Ps extends readonly WritableProjection<any, any>[]>(\n ...projections: Ps & (IsUnion<ProjectionModel<Ps[number]>> extends true ? never : unknown)\n ): WritableProjection<ProjectionModel<Ps[number]>, MergeFields<Ps>> => {\n const parts = [...projections]\n const fields: Record<string, AnySchema> = Object.create(null)\n // Where each field is read from, where the part says: a dependency path\n // ending in the field's name. The same name from two different paths is two\n // fields that would be read as one, as in `pick`.\n const paths: Record<string, string> = Object.create(null)\n const pathOf = (part: (typeof parts)[number], key: string): string | undefined =>\n part.dependencies.find(dependency => dependency.at(-1) === key)?.join('.')\n for (const part of parts) {\n for (const [key, codec] of Object.entries(part.schema.fields)) {\n const existing = fields[key]\n const path = pathOf(part, key)\n if (existing !== undefined) {\n const previous = paths[key]\n if (previous !== undefined && path !== undefined && previous !== path) {\n throw new Error(\n `Projection.compose: \"${previous}\" and \"${path}\" would both be read as \"${key}\"`,\n )\n }\n if (existing === codec) continue\n throw new Error(`Projection.compose: conflicting definitions for \"${key}\"`)\n }\n fields[key] = codec as AnySchema\n if (path !== undefined) paths[key] = path\n }\n }\n return {\n schema: objectSchema(fields) as never,\n dependencies: mergeDependencies(parts.flatMap(part => [...part.dependencies])),\n get: model => {\n const out: Record<string, unknown> = Object.create(null)\n for (const part of parts) Object.assign(out, part.get(model as never))\n return out as never\n },\n set: (model, shared) => {\n let next = model\n // Each part reads only its own fields from the merged value.\n for (const part of parts) next = part.set(next as never, shared as never)\n return next\n },\n }\n },\n}\n\n// ===========================================================================\n// Surface (Phase 0 case 3)\n// ===========================================================================\n\nexport interface AppScope<\n Root,\n F extends Schema.Struct.Fields,\n Cases extends Record<string, Schema.Struct.Fields>,\n> {\n readonly Model: Schema.Struct<F>\n readonly Message: MessageUnion<Cases>\n readonly model: RefTree<Root, F>\n /** Identity token shared by this application's references and subsets. */\n readonly owner: object\n}\n\nexport interface SurfaceInspection {\n readonly name: string\n readonly dependencies: DependencyTree\n readonly metadata: readonly MetadataSummary[]\n readonly emits: readonly unknown[]\n}\n\n/**\n * A Surface's params codec: present when the Surface declares params, absent\n * when `Params` is `void`, and possibly either when `Params` is `any`/`unknown`\n * so a params Surface still fits a `Surface<…, any>` position.\n */\nexport type ParamsSchema<Params> = unknown extends Params\n ? Schema.Codec<Params, unknown> | undefined\n : [Params] extends [void]\n ? [void] extends [Params]\n ? // Exactly `void`: no params, no schema.\n undefined\n : // `undefined` also extends `void`, but a Surface may still declare its schema.\n Schema.Codec<Params, unknown> | undefined\n : [void] extends [Params]\n ? // `void | X`: the schema is optional.\n Schema.Codec<Params, unknown> | undefined\n : Schema.Codec<Params, unknown>\n\n/**\n * The params argument of `Surface.read`, `contract` and `inspect`: required\n * unless `undefined` is a params value, as it is for a Surface without params.\n */\ntype ParamsArgument<Params> = undefined extends Params ? [params?: Params] : [params: Params]\n\nexport interface Surface<Root, Model, Message, Params> {\n readonly name: string\n /** Identity token of the application this Surface belongs to. */\n readonly owner: object\n readonly Params: ParamsSchema<Params>\n readonly Message: Schema.Schema<Message>\n readonly messages: readonly unknown[]\n readonly projection: (params: Params) => Projection<Root, Model>\n}\n\n/**\n * A Surface as the Model activates it: its params are a function of the Model\n * (`undefined` while inactive), so its requirements are too. `Surface.at`\n * builds one; a Subscription derives what to fetch, subscribe, and retain\n * from a list of them.\n */\n/**\n * Why a Surface is active, when that is something other than a callback.\n *\n * `Surface.at` takes an arbitrary function of the Model, which is correct and\n * opaque: nothing can say *why* the Surface is on without running it. When\n * activation is a tagged value at a known place — a route, a mode, a\n * selection — `Surface.when` records the place and the tag, and a manifest can\n * be built without evaluating anything.\n */\n/**\n * What `Surface.when` needs of a place in the Model: where it is, and how to\n * read it.\n *\n * A ref whose focus can be read, and deliberately not a whole `ModelRef`.\n * Activation **observes** — it never installs a value — so asking for a\n * writable reference would claim an authority it does not use. It also makes\n * the common case work: a field holding a tagged union is a *union of*\n * `FieldRef`s, one per case, which no single `ModelRef<Root, Value>` accepts.\n */\nexport interface ModelPlace<Root> {\n readonly [RefTypeId]: {\n /** Where the value lives, as `ModelRef.focus(place).dependency` gives it. */\n readonly dependency: readonly string[]\n readonly get: (root: Root) => unknown\n }\n}\n\nexport interface Activation {\n /** The Model path the tagged value lives at, as a focus's `dependency` gives it. */\n readonly path: readonly string[]\n /** The tag the Surface is active under; a Site node reading the viewer waits for one too. */\n readonly tag: string\n}\n\nexport interface ActiveSurface<Root, Model = unknown> {\n readonly name: string\n /** Identity token of the application the Surface belongs to. */\n readonly owner: object\n /** The projection for the params the Model gives; none while the Surface is inactive. */\n readonly projectionOf: (model: Root) => Option.Option<Projection<Root, Model>>\n /** The tags of the Messages the Surface lists in `messages`: what it may send. */\n readonly messages: ReadonlyArray<string>\n /**\n * Present when a tagged value at a known place activates the Surface\n * (`Surface.when`, or a Site node); absent for a bare `Surface.at`.\n */\n readonly activation?: Activation | undefined\n}\n\n/**\n * One Surface definition instantiated with concrete params: the unit a\n * `SurfaceSource` resolves to. `key` distinguishes instances of one Surface\n * (a Composition node id, say); a lone `Surface.at`/`Surface.when` instance\n * is keyed by its Surface name.\n */\nexport interface SurfaceInstance<Root, Model = unknown, Params = unknown> {\n readonly key: string\n readonly surface: Surface<Root, Model, unknown, Params>\n readonly params: Params\n readonly projection: Projection<Root, Model>\n}\n\n/**\n * A source of active Surface instances: what `Data.subscriptions`,\n * `Data.wiring`, `Remote.resume`, an SSR plan, an agent manifest, or DevTools\n * resolves a declaration to. `Surface.at` and `Surface.when` are sources of\n * zero or one instance; `Surface.each` of zero to many.\n */\nexport interface SurfaceSource<Root> {\n readonly name: string\n /** Identity token of the application the Surfaces belong to. */\n readonly owner: object\n /** The tags of the Messages the Surface lists: what an instance may send. */\n readonly messages: ReadonlyArray<string>\n readonly instancesOf: (model: Root) => ReadonlyArray<SurfaceInstance<Root, any, any>>\n}\n\n/**\n * One Surface definition instantiated per item of a parent Surface's Model:\n * `Surface.each` as data. `from` names the prerequisite — the family resolves\n * no instances until the parent is active — so consumers can tell the\n * requirements needed to *discover* instances from the requirements *of* the\n * discovered instances. That distinction is what lets `Data.satisfy` reach a\n * fixed point: first the parent, then what the parent reveals.\n */\nexport interface SurfaceFamily<\n Root,\n ParentModel,\n Model,\n Message,\n Params,\n> extends SurfaceSource<Root> {\n readonly from: ActiveSurface<Root, ParentModel>\n readonly child: Surface<Root, Model, Message, Params>\n /** The tags of the Messages the child Surface lists: what an instance may send. */\n readonly messages: ReadonlyArray<string>\n}\n\ndeclare const invalid: unique symbol\n\n/**\n * A compile-time failure that names its cause. Intersected onto a parameter\n * type when a type-level check fails, so the error reads as one line\n * (`Property '[invalid]' is missing … required in type 'Invalid<\"…\">'`)\n * naming the descriptor, instead of a wall of structural mismatch.\n */\nexport interface Invalid<Message extends string> {\n readonly [invalid]: Message\n}\n\n/** The fields of a `Schema.Struct`, or a schema, where params are declared. */\ntype ParamsShape = Schema.Struct.Fields | Schema.Top\n\ntype ParamsOf<P> = P extends Schema.Top\n ? Schema.Schema.Type<P>\n : P extends Schema.Struct.Fields\n ? Schema.Struct.Type<P>\n : void\n\n/** What a Surface's `model` may return: a Projection, or an object of Projections and refs to lift. */\ntype ModelShape<Root> =\n | Projection<Root, unknown>\n | Record<string, Projection<Root, any> | ModelRef<Root, any>>\n\ntype ModelOf<Root, R> = R extends Projection<Root, infer M> ? M : StructValue<R>\n\nconst isProjection = (value: unknown): value is Projection<unknown, unknown> =>\n typeof value === 'object' &&\n value !== null &&\n typeof (value as { read?: unknown }).read === 'function' &&\n Metadata.is((value as { metadata?: unknown }).metadata)\n\ntype MsgOf<Ms extends readonly unknown[]> = {\n readonly [K in keyof Ms]: Ms[K] extends (...args: never[]) => infer M ? M : never\n}[number]\n\n/** The union of Messages a tuple of constructors produces. */\ntype SubsetOf<Ms extends readonly unknown[]> = Ms[number] extends (...args: never[]) => infer M\n ? M\n : never\n\ntype AppMessage<Cases extends Record<string, Schema.Struct.Fields>> = Schema.Schema.Type<\n MessageUnion<Cases>\n>\n\n/** A Message constructor whose produced Message belongs to the App's universe. */\ntype MessageConstructor<Cases extends Record<string, Schema.Struct.Fields>> = (\n ...args: never[]\n) => AppMessage<Cases>\n\n/**\n * The renderer's builder: the real `HtmlBuilder` with its private\n * `MessageUniverse` phantom removed, so the renderer's `OnClick` accepts only\n * the Surface's Message subset. `HtmlBuilder<M>` stays invariant even without\n * the phantom (`OnClick` returns `{ message: M }`), so a superset builder is\n * not assignable to this; `Surface.view` casts, which is sound because the\n * renderer can only construct subset Messages and the real builder accepts the\n * superset.\n */\ntype ViewBuilder<Message> = Omit<HtmlBuilder<Message>, keyof HtmlBuilder<never> & symbol>\n\n/** A renderer for a Surface's projected Model, with its Message set narrowed. */\nexport type Renderer<Model, Message> = (model: Model, h: ViewBuilder<Message>) => Html\n\n/** `unknown` when `Sub` is a subtype of `Super`, `never` otherwise. */\ntype Subset<Sub, Super> = [Sub] extends [Super] ? unknown : never\n\ntype RefRoot<R> = R extends ModelRef<infer Root, any> ? Root : never\n\ntype RefRoots<Refs extends readonly unknown[]> = {\n readonly [K in keyof Refs]: RefRoot<Refs[K]>\n}\n\n/** The struct fields a reference selection produces, keyed by each ref's field. */\ntype PickFields<Refs extends readonly FieldRef<any, any, string>[]> = {\n readonly [R in Refs[number] as R[typeof RefTypeId]['key']]: R[typeof RefTypeId]['Schema']\n}\n\ntype ProjectionModel<P> = P extends WritableProjection<infer M, any> ? M : never\n\ntype ProjectionFields<P> = P extends WritableProjection<any, infer F> ? F : never\n\ntype Merge2<A, B> = {\n readonly [K in keyof A | keyof B]: K extends keyof A ? A[K] : K extends keyof B ? B[K] : never\n}\n\n/** Merges the fields of several projections; an overlapping key is rejected at runtime. */\nexport type MergeFields<Ps extends readonly WritableProjection<any, any>[]> = Ps extends readonly [\n infer Head extends WritableProjection<any, any>,\n ...infer Tail extends readonly WritableProjection<any, any>[],\n]\n ? Merge2<ProjectionFields<Head>, MergeFields<Tail>>\n : {}\n\n/**\n * An application definition: the Model and Message schemas and the generated\n * field references. It is data, not a running instance, so it can be inspected\n * without mounting anything. Context, replication, and validation all read the\n * same `App.model` references.\n */\nexport interface Application<\n Root,\n F extends Schema.Struct.Fields,\n Cases extends Record<string, Schema.Struct.Fields>,\n> extends AppScope<Root, F, Cases> {\n /**\n * @deprecated Use `App.model`, the same references under the name the rest\n * of the API uses: `App.surface` hands a Surface `{ model }`, and\n * `Remote.make` and `Editor.at` take `model: App.model.…`. Removed in a\n * later minor.\n */\n readonly fields: RefTree<Root, F>\n /**\n * `Surface.make` with the mechanical wrappers lifted: `params` are the\n * fields of a `Schema.Struct` (or a schema), and `model` may return an\n * object of Projections and refs, which becomes `Projection.struct`.\n */\n readonly surface: <\n const Params extends ParamsShape | undefined = undefined,\n Shape extends ModelShape<Root> = Projection<Root, unknown>,\n const Ms extends readonly MessageConstructor<Cases>[] = readonly [],\n >(\n name: string,\n config: {\n readonly params?: Params\n readonly model: (context: {\n readonly model: RefTree<Root, F>\n readonly params: ParamsOf<Params>\n }) => Shape\n readonly messages?: Ms\n },\n ) => Surface<Root, ModelOf<Root, Shape>, MsgOf<Ms>, ParamsOf<Params>>\n /**\n * This application made runnable, once its update exists: the same\n * references and the same owner, with the initial Model and the transition\n * function a replicator replays. An update is often built from what is made\n * over the references (a Remote domain, a placed Bundle), so it cannot be\n * given when they are; this joins the two without a second application,\n * whose references would be another owner's.\n */\n readonly runnable: <Resources = never>(config: {\n readonly initial: Root\n readonly update: (\n model: Root,\n message: Schema.Schema.Type<MessageUnion<Cases>>,\n ) => Update.Return<Root, Schema.Schema.Type<MessageUnion<Cases>>, Resources>\n }) => RunnableApplication<Root, F, Cases, Resources>\n}\n\n/**\n * An `Application` that also carries the initial Model and the transition\n * function, so a replicator can derive the initial shared value and replay.\n * `Resources` is whatever `update`'s Commands need.\n */\nexport interface RunnableApplication<\n Root,\n F extends Schema.Struct.Fields,\n Cases extends Record<string, Schema.Struct.Fields>,\n Resources = never,\n> extends Application<Root, F, Cases> {\n readonly initial: Root\n readonly update: (\n model: Root,\n message: Schema.Schema.Type<MessageUnion<Cases>>,\n ) => Update.Return<Root, Schema.Schema.Type<MessageUnion<Cases>>, Resources>\n}\n\ndeclare const messageSubsetRoot: unique symbol\n\n/**\n * A typed subset of one application's Messages: the selected constructors, a\n * codec for exactly those variants, and a runtime membership test. Surface does\n * not label a subset agent-visible, durable, or presence; `Agent` and `Sync`\n * attach their own policy to the same value.\n */\n/** The union of encoded types a tuple of constructor schemas produces. */\ntype SubsetEncoded<Ms extends readonly unknown[]> =\n Ms[number] extends Schema.Codec<any, infer Encoded, any, any> ? Encoded : never\n\nexport interface MessageSet<\n Root,\n Message,\n Subset extends Message,\n Ms extends readonly ((...args: never[]) => Message)[],\n Cases extends Record<string, Schema.Struct.Fields> = Record<string, Schema.Struct.Fields>,\n Encoded = unknown,\n> {\n /** Phantom owner, so a subset cannot be crossed between applications. */\n readonly [messageSubsetRoot]?: Root\n /** The application identity token, checked when subsets compose. */\n readonly owner: object\n readonly constructors: Ms\n /** A pure codec for exactly the selected variants. */\n readonly schema: Schema.Codec<Subset, Encoded, never, never>\n readonly tags: ReadonlySet<string>\n readonly includes: (message: Message) => message is Subset\n}\n\nconst makeScope = <\n F extends Schema.Struct.Fields,\n Cases extends Record<string, Schema.Struct.Fields>,\n>(config: {\n readonly Model: Schema.Struct<F>\n readonly Message: MessageUnion<Cases>\n}): AppScope<Schema.Struct.Type<F>, F, Cases> => {\n // One token per application, so a selection cannot silently mix two\n // applications whose Models happen to be structurally identical.\n const owner: object = {}\n return {\n Model: config.Model,\n Message: config.Message,\n owner,\n model: makeTree(\n // A generic `F` hides the Struct's services; a Foldkit Model is pure.\n config.Model as unknown as AnySchema,\n [],\n Optic.id(),\n root => root,\n false,\n undefined,\n owner,\n ) as unknown as RefTree<Schema.Struct.Type<F>, F>,\n }\n}\n\n/**\n * Captures an application's pure references once. `initial` and `update` are\n * optional: an agent needs only the Model, Message, and field references, while\n * a replicator needs them to derive the initial shared value and replay. A\n * `RunnableApplication` is returned when both are supplied.\n */\nfunction application<\n F extends Schema.Struct.Fields,\n Cases extends Record<string, Schema.Struct.Fields>,\n Resources = never,\n ManagedResourceServices = never,\n>(config: {\n readonly Model: Schema.Struct<F>\n readonly Message: MessageUnion<Cases>\n readonly initial: Schema.Struct.Type<F>\n readonly update: (\n model: Schema.Struct.Type<F>,\n message: Schema.Schema.Type<MessageUnion<Cases>>,\n ) => Update.Return<\n Schema.Struct.Type<F>,\n Schema.Schema.Type<MessageUnion<Cases>>,\n Resources | ManagedResourceServices\n >\n}): RunnableApplication<Schema.Struct.Type<F>, F, Cases, Resources | ManagedResourceServices>\nfunction application<\n F extends Schema.Struct.Fields,\n Cases extends Record<string, Schema.Struct.Fields>,\n>(config: {\n readonly Model: Schema.Struct<F>\n readonly Message: MessageUnion<Cases>\n}): Application<Schema.Struct.Type<F>, F, Cases>\nfunction application(config: any): any {\n const scope = makeScope(config)\n const surface = (\n name: string,\n surfaceConfig: {\n readonly params?: ParamsShape | undefined\n readonly model: (context: { readonly model: unknown; readonly params: unknown }) => unknown\n readonly messages?: readonly unknown[]\n },\n ) =>\n Surface.make(scope, name, {\n ...(surfaceConfig.params === undefined\n ? {}\n : {\n Params: Schema.isSchema(surfaceConfig.params)\n ? surfaceConfig.params\n : Schema.Struct(surfaceConfig.params),\n }),\n model: (context: { readonly model: unknown; readonly params: unknown }) => {\n const shape = surfaceConfig.model(context)\n return isProjection(shape) ? shape : Projection.struct(shape as never)\n },\n messages: surfaceConfig.messages,\n } as never)\n const made = { ...scope, fields: scope.model, surface }\n const runnable = (run: { readonly initial: unknown; readonly update: unknown }): unknown => ({\n ...made,\n runnable,\n initial: run.initial,\n update: run.update,\n })\n return { ...made, runnable, initial: config.initial, update: config.update }\n}\n\ntype ConstructorOfSubset<S> = S extends MessageSet<any, any, any, infer Ms, any> ? Ms : never\ntype ValueOfSubset<S> = S extends MessageSet<any, any, infer V, any, any> ? V : never\ntype RootOfSubset<S> = S extends MessageSet<infer R, any, any, any, any> ? R : never\ntype MessageOfSubset<S> = S extends MessageSet<any, infer M, any, any, any> ? M : never\ntype CasesOfSubset<S> = S extends MessageSet<any, any, any, any, infer C> ? C : never\n\ntype Concat<A extends readonly unknown[], B extends readonly unknown[]> = [...A, ...B]\n\n/** Concatenates the constructor tuples of several subsets, preserving each. */\nexport type MergeConstructors<Subs extends readonly MessageSet<any, any, any, any, any>[]> =\n Subs extends readonly [\n infer Head extends MessageSet<any, any, any, any, any>,\n ...infer Tail extends readonly MessageSet<any, any, any, any, any>[],\n ]\n ? Concat<ConstructorOfSubset<Head>, MergeConstructors<Tail>>\n : []\n\n/** Typed Message subsets of one application, by constructor reference. */\nexport const MessageSet = {\n /**\n * Selects a typed Message subset by constructor reference:\n * `MessageSet.make(App, [Message.CreatedTodo, Message.RenamedTodo])`. Each\n * constructor must be this application's own variant; a duplicate or a variant\n * from another union throws.\n */\n make: <\n Root,\n F extends Schema.Struct.Fields,\n Cases extends Record<string, Schema.Struct.Fields>,\n const Ms extends readonly MessageConstructor<Cases>[],\n >(\n app: AppScope<Root, F, Cases>,\n messages: Ms,\n ): MessageSet<\n Root,\n Schema.Schema.Type<MessageUnion<Cases>>,\n SubsetOf<Ms> & Schema.Schema.Type<MessageUnion<Cases>>,\n Ms,\n Cases,\n SubsetEncoded<Ms>\n > => {\n const tags = new Set<string>()\n for (const constructor of messages) {\n const tag = messageTag(constructor)\n if (tag === undefined) {\n throw new Error('MessageSet.make: expected Message constructors')\n }\n if ((app.Message as unknown as Record<string, unknown>)[tag] !== constructor) {\n throw new Error(\n `MessageSet.make: \"${tag}\" is not a variant of this application's Message union`,\n )\n }\n if (tags.has(tag)) throw new Error(`MessageSet.make: duplicate \"${tag}\"`)\n tags.add(tag)\n }\n return {\n owner: app.owner,\n constructors: messages,\n schema: Schema.Union([...messages] as unknown as ReadonlyArray<\n Schema.Schema<unknown>\n >) as unknown as Schema.Codec<\n SubsetOf<Ms> & Schema.Schema.Type<MessageUnion<Cases>>,\n SubsetEncoded<Ms>,\n never,\n never\n >,\n tags,\n includes: (message): message is SubsetOf<Ms> & Schema.Schema.Type<MessageUnion<Cases>> =>\n hasTagIn(tags, message),\n }\n },\n\n /**\n * Unions several Message subsets into one. Every subset must belong to the\n * same application; a tag declared twice throws. Disjoint feature modules can\n * each declare their own subset and compose them here.\n */\n union: <const Subs extends readonly MessageSet<any, any, any, any, any>[]>(\n ...subsets: Subs\n ): MessageSet<\n RootOfSubset<Subs[number]>,\n MessageOfSubset<Subs[number]>,\n ValueOfSubset<Subs[number]>,\n MergeConstructors<Subs>,\n CasesOfSubset<Subs[number]>,\n SubsetEncoded<MergeConstructors<Subs>>\n > => {\n const parts = [...subsets]\n const owner = parts[0]?.owner\n const tags = new Set<string>()\n const constructors: Array<Schema.Schema<unknown>> = []\n for (const part of parts) {\n if (part.owner !== owner) {\n throw new Error('MessageSet.union: subsets from different applications')\n }\n for (const constructor of part.constructors) {\n const tag = messageTag(constructor)\n if (tag === undefined) continue\n if (tags.has(tag)) throw new Error(`MessageSet.union: duplicate \"${tag}\"`)\n tags.add(tag)\n constructors.push(constructor as Schema.Schema<unknown>)\n }\n }\n return {\n owner: owner as object,\n constructors: constructors as never,\n schema: Schema.Union(constructors) as unknown as Schema.Codec<\n ValueOfSubset<Subs[number]>,\n SubsetEncoded<MergeConstructors<Subs>>,\n never,\n never\n >,\n tags,\n includes: (message): message is ValueOfSubset<Subs[number]> => hasTagIn(tags, message),\n }\n },\n}\n\n// ===========================================================================\n// Action: a named capability that ends in an existing Message\n// ===========================================================================\n\n/**\n * A capability a consumer may invoke by name with data, such as an agent's\n * tool or a page Block's button. It ends in one of the application's own\n * Messages, so `update` stays the only place a Message has effects, and its\n * input is decoded by its Schema before `toMessage` sees it: stored or\n * untrusted data never executes.\n */\n// `Input` defaults to `never`: an Action known only as an Action takes no input but through `run`.\nexport interface Action<\n Name extends string = string,\n Input = never,\n Encoded = unknown,\n Message = unknown,\n> {\n readonly _tag: 'Action'\n readonly name: Name\n /** What it does, for a person choosing it or an agent deciding to. */\n readonly description: string\n readonly input: Schema.Codec<Input, Encoded, never, never>\n readonly toMessage: (input: Input) => Message\n}\n\nexport const Action = {\n /** An Action: `Action.define({ name: 'addToCart', description, input, toMessage })`. */\n define: <const Name extends string, Input, Encoded, Message>(config: {\n readonly name: Name\n readonly description: string\n readonly input: Schema.Codec<Input, Encoded, never, never>\n readonly toMessage: (input: Input) => Message\n }): Action<Name, Input, Encoded, Message> => {\n if (config.name.length === 0) throw new Error('Action.define: an Action needs a name')\n return Object.freeze({ _tag: 'Action', ...config })\n },\n\n /** Whether a value is an Action. */\n is: (value: unknown): value is Action =>\n typeof value === 'object' && Predicate.isTagged(value, 'Action'),\n\n /**\n * The Message an Action makes of `data`, decoded as its input first; a\n * failure says why the input was refused and makes no Message.\n */\n run: <Input, Encoded, Message>(\n action: Action<string, Input, Encoded, Message>,\n data: unknown,\n ): Result.Result<Message, Schema.SchemaError> =>\n Result.map(Schema.decodeUnknownResult(action.input)(data), action.toMessage),\n}\n\nexport const Surface = {\n application,\n\n /**\n * A Surface as the Model activates it. `params` is the value, or a function\n * of the Model returning it (none while the Surface is inactive, e.g. on\n * another route); the Surface's requirements then follow the Model.\n */\n at: <Root, Model, Message, Params>(\n surface: Surface<Root, Model, Message, Params>,\n params: Params | ((model: Root) => Option.Option<Params>),\n ): ActiveSurface<Root, Model> & SurfaceSource<Root> => {\n const paramsOf = (model: Root): Option.Option<Params> =>\n typeof params === 'function'\n ? (params as (model: Root) => Option.Option<Params>)(model)\n : Option.some(params)\n const projectionOf = (model: Root): Option.Option<Projection<Root, Model>> =>\n Option.map(paramsOf(model), surface.projection)\n return {\n name: surface.name,\n owner: surface.owner,\n messages: messageTags(surface),\n projectionOf,\n instancesOf: model => {\n const value = paramsOf(model)\n if (Option.isNone(value)) return []\n return [\n {\n key: surface.name,\n surface,\n params: value.value,\n projection: surface.projection(value.value),\n },\n ]\n },\n }\n },\n\n /**\n * A Surface active while a tagged value at a known place has a given tag.\n *\n * ```ts\n * Surface.when(ProjectPage, App.model.route, AppRoute.Project, route => ({\n * projectId: route.projectId,\n * }))\n * ```\n *\n * The same thing `Surface.at` does with a callback, and one fact more: the\n * place and the tag are **values**, so what activates the Surface can be read\n * without running anything. That is what a route-to-Surface manifest, a\n * prefetch analysis, or an explanation of why a read is happening needs.\n *\n * Deliberately **not router-specific.** A route is one kind of tagged Model\n * state; a mode, a wizard step and a selected tab are others, and none of\n * them should need their own helper.\n *\n * `Surface.at` stays, and is still the answer when activation is a genuine\n * computation rather than a tag.\n */\n when: <Root, Model, Message, Params, Case extends Schema.Top>(\n surface: Surface<Root, Model, Message, Params>,\n place: ModelPlace<Root>,\n tagged: Case,\n params: (value: Schema.Schema.Type<Case>) => Params,\n ): ActiveSurface<Root, Model> & SurfaceSource<Root> => {\n const tag = messageTag(tagged)\n if (tag === undefined) {\n throw new Error(\n `Surface.when: expected a tagged constructor for \"${surface.name}\", which is what names the case that activates it`,\n )\n }\n const focus = place[RefTypeId]\n const paramsOf = (model: Root): Option.Option<Params> => {\n const value = focus.get(model)\n return Predicate.isTagged(value, tag)\n ? Option.some(params(value as Schema.Schema.Type<Case>))\n : Option.none()\n }\n return {\n name: surface.name,\n owner: surface.owner,\n messages: messageTags(surface),\n activation: { path: focus.dependency, tag },\n projectionOf: model => Option.map(paramsOf(model), surface.projection),\n instancesOf: model => {\n const value = paramsOf(model)\n if (Option.isNone(value)) return []\n return [\n {\n key: surface.name,\n surface,\n params: value.value,\n projection: surface.projection(value.value),\n },\n ]\n },\n }\n },\n\n /**\n * One Surface definition for each item of a parent Surface's Model: zero to\n * many keyed instances, where `Surface.at`/`Surface.when` give zero or one.\n *\n * ```ts\n * Surface.each(ProductGrid, {\n * from: CmsPage,\n * instances: ({ document }) => nodesOf(document).map(node => ({\n * key: node.id,\n * params: { category: node.props.category },\n * })),\n * })\n * ```\n *\n * Keys must be non-empty strings that survive as record keys: `__proto__`\n * is refused, and duplicates throw. Consumers looking instances up by key\n * must still read through `Object.hasOwn` or a `Map`: any string key is\n * otherwise admitted.\n */\n each: <Root, ParentModel, Model, Message, Params>(\n child: Surface<Root, Model, Message, Params>,\n config: {\n readonly from: ActiveSurface<Root, ParentModel>\n readonly instances: (\n parent: ParentModel,\n ) => ReadonlyArray<{ readonly key: string; readonly params: Params }>\n },\n ): SurfaceFamily<Root, ParentModel, Model, Message, Params> => ({\n name: child.name,\n owner: child.owner,\n from: config.from,\n child,\n messages: messageTags(child),\n instancesOf: model => {\n const parent = config.from.projectionOf(model)\n if (Option.isNone(parent)) return []\n const seen = new Set<string>()\n return config.instances(parent.value.read(model)).map(({ key, params }) => {\n if (typeof key !== 'string' || key.length === 0)\n throw new Error(\n `Surface.each: \"${child.name}\" needs a non-empty string key for every instance`,\n )\n if (key === '__proto__')\n throw new Error(`Surface.each: \"${child.name}\" refuses \"__proto__\" as an instance key`)\n if (seen.has(key))\n throw new Error(`Surface.each: \"${child.name}\" has two instances keyed \"${key}\"`)\n seen.add(key)\n return { key, surface: child, params, projection: child.projection(params) }\n })\n },\n }),\n\n /**\n * What a source resolves to for a Model: the family's instances, or the\n * lone instance of a `Surface.at`/`Surface.when` value. Hand-written\n * `ActiveSurface` values predate sources; they are not sources until they\n * grow `instancesOf`, and consumers that still take them read `projectionOf`\n * directly.\n */\n instances: <Root>(\n source: SurfaceSource<Root>,\n model: Root,\n ): ReadonlyArray<SurfaceInstance<Root, any, any>> => source.instancesOf(model),\n\n make: <\n Root,\n F extends Schema.Struct.Fields,\n Cases extends Record<string, Schema.Struct.Fields>,\n Params = void,\n Model = unknown,\n const Ms extends readonly MessageConstructor<Cases>[] = readonly [],\n >(\n app: AppScope<Root, F, Cases>,\n name: string,\n config: {\n readonly Params?: Schema.Codec<Params, unknown>\n readonly model: (context: {\n readonly model: RefTree<Root, F>\n readonly params: Params\n }) => Projection<Root, Model>\n readonly messages?: Ms\n },\n ): Surface<Root, Model, MsgOf<Ms>, Params> => {\n // Deliberately no eager `projection(undefined)`: a parameterized Surface's\n // projection may read `params`.\n const projection = (params: Params): Projection<Root, Model> => {\n // The types refuse a missing argument; a caller typed `any`, or plain\n // JavaScript, otherwise meets a TypeError from inside `model`.\n if (\n params === undefined &&\n config.Params !== undefined &&\n !Schema.is(config.Params)(undefined)\n ) {\n throw new Error(`Surface \"${name}\" declares params, and was given none`)\n }\n return config.model({ model: app.model, params })\n }\n return {\n name,\n owner: app.owner,\n // Absent only when `Params` is exactly `void`; `ParamsSchema` keeps it optional otherwise.\n Params: config.Params as ParamsSchema<Params>,\n Message: Schema.Never as unknown as Schema.Schema<MsgOf<Ms>>,\n messages: config.messages ?? [],\n projection,\n }\n },\n\n read: <Root, Model, Message, Params>(\n surface: Surface<Root, Model, Message, Params>,\n root: Root,\n ...params: ParamsArgument<Params>\n ): Model => surface.projection(params[0] as Params).read(root),\n\n /**\n * Binds a renderer to a Surface's projected Model and Message set. A\n * type-level binder: the renderer already has this shape, but `Model` and\n * `Message` are derived from the Surface instead of written by hand.\n */\n view: <Root, Model, Message, Params>(\n _surface: Surface<Root, Model, Message, Params>,\n render: Renderer<Model, Message>,\n ): Renderer<Model, Message> => render,\n\n /**\n * The application boundary: consume the Root Model, project it, and hand the\n * projected Model to the renderer. `Subset` rejects a Surface whose Messages\n * the application builder cannot route.\n */\n rootView: <Root, Model, Message, Params>(\n surface: Surface<Root, Model, Message, Params>,\n params: Params,\n render: Renderer<Model, Message>,\n ): (<AppMessage>(\n root: Root,\n h: HtmlBuilder<AppMessage> & Subset<Message, AppMessage>,\n ) => Html) => {\n const projection = surface.projection(params)\n // Sound narrowing: the renderer can only construct this Surface's Messages,\n // and `Subset` guarantees the application builder accepts them.\n return <AppMessage>(\n root: Root,\n h: HtmlBuilder<AppMessage> & Subset<Message, AppMessage>,\n ): Html => render(projection.read(root), h as unknown as ViewBuilder<Message>)\n },\n\n /**\n * Embeds a child renderer in a parent view. `ParentModel extends ChildModel`\n * enforces \"child Model requirement ⊆ parent projected Model\"; `Subset`\n * enforces \"child Message set ⊆ parent Message set\".\n */\n embed:\n <ChildModel, ChildMessage>(child: Renderer<ChildModel, ChildMessage>) =>\n <ParentModel extends ChildModel, ParentMessage>(\n model: ParentModel,\n h: ViewBuilder<ParentMessage> & Subset<ChildMessage, ParentMessage>,\n ): Html =>\n child(model, h as unknown as ViewBuilder<ChildMessage>),\n\n /**\n * A Surface as a `Contract` for `Module`: what it observes, requires, and may\n * emit. A parameterized Surface needs its `params` to build the projection.\n */\n contract: <Root, Model, Message, Params>(\n surface: Surface<Root, Model, Message, Params>,\n ...params: ParamsArgument<Params>\n ): Contract => {\n const projection = surface.projection(params[0] as Params)\n return {\n kind: 'surface',\n name: surface.name,\n owner: surface.owner,\n owns: [],\n observes: projection.dependencies,\n messages: messageTags(surface),\n metadata: Metadata.summarize(projection.metadata),\n }\n },\n\n /**\n * Pure introspection for DevTools: what a Surface observes (dependencies,\n * requirements) and what it may emit. No behavior change, no I/O.\n */\n inspect: <Root, Model, Message, Params>(\n surface: Surface<Root, Model, Message, Params>,\n ...params: ParamsArgument<Params>\n ): SurfaceInspection => {\n const projection = surface.projection(params[0] as Params)\n return {\n name: surface.name,\n dependencies: projection.dependencies,\n metadata: Metadata.summarize(projection.metadata),\n emits: surface.messages,\n }\n },\n}\n\n// ===========================================================================\n// Entity, Selection, Remote moved to `foldkit-remote` (Phase 3).\n// ===========================================================================\n\n// ===========================================================================\n// Module: the pure composition root\n// ===========================================================================\n\n/**\n * What one contract claims about an application, as data. Sync, Remote, and\n * Agent attach one to the values they produce; `Surface.contract` derives one\n * from a Surface. `owns` are the Model paths the contract is the authority for\n * (a replicated projection, a remote store); `observes` are the paths it reads.\n */\nexport interface Contract {\n readonly kind: string\n readonly name: string\n /** The application's identity token; absent when the value cannot know it. */\n readonly owner?: object | undefined\n readonly owns: DependencyTree\n readonly observes: DependencyTree\n /** Message tags the contract may cause, expose, or record. */\n readonly messages: readonly string[]\n /** What interpreters attached to the contract's reads, as text. */\n readonly metadata: readonly MetadataSummary[]\n}\n\n/**\n * How one integration joins an application, as data and pure functions: the\n * Messages it routes, what it runs at startup and on a URL change, its\n * Subscriptions and Managed Resources, and its contract. Remote, Mirror, Sync,\n * and Agent produce one; `foldkit-bundle`'s assembly derives the application's\n * `update`, initial state, runtime config, and Module from a list of them.\n * `R` is the services its Commands and Subscriptions need.\n */\nexport interface Wiring<Model, Message, R = never, Claims extends string = string> {\n /** Names the integration in errors and the Module: `remote:Board`, `mirror:filters`. */\n readonly key: string\n /**\n * Message tags `route` handles. Two integrations handling one tag is an error\n * unless it is `shared`. Typed as literals (`Claims`), the tags it does not\n * share leave the parent's own update in `foldkit-bundle`'s assembly. A wiring\n * with literal `Claims` that shares some gives `shared` a literal type too: a\n * plain `string[]` there reads as sharing none.\n */\n readonly handles: ReadonlyArray<Claims>\n /** Tags several integrations may handle, each for its own values (Mirror's `MirrorRestored`, by name). */\n readonly shared?: readonly string[] | undefined\n /**\n * Folds a Message this integration handles; `None` for any other. A method, so\n * a wiring that routes only its own variants fits an assembly over the whole\n * application union.\n */\n route?(model: Model, message: Message): Option.Option<Update.Return<Model, Message, R>>\n /** Runs once when the application starts, after placements: a restore Command, a warm-up. */\n readonly init?: Update.Step<Model, Message, R> | undefined\n /** Applies the URL to the Model, at startup and whenever the URL changes. */\n readonly onUrl?: ((model: Model, url: Url) => Model) | undefined\n readonly subscriptions?: Subscriptions<Model, Message, R> | undefined\n readonly resources?:\n | Readonly<Record<string, ManagedResourceEntry<Model, Message, any, any, any>>>\n | undefined\n /** Its Module contract; absent for wiring that owns and observes nothing. */\n readonly contract?: Contract | undefined\n}\n\n/** Contracts of one application, in declaration order. Data, not a runtime. */\nexport interface Module<\n Root,\n F extends Schema.Struct.Fields,\n Cases extends Record<string, Schema.Struct.Fields>,\n> {\n readonly app: AppScope<Root, F, Cases>\n readonly contracts: readonly Contract[]\n}\n\nexport interface Finding {\n readonly rule:\n | 'foreign-contract'\n | 'duplicate-name'\n | 'ownership-overlap'\n | 'message-claimed-twice'\n | 'unknown-path'\n | 'unknown-message'\n /** `kind:name` of each contract involved. */\n readonly contracts: readonly string[]\n readonly message: string\n}\n\n/** Who owns a Model path; `undefined` is local state. */\nexport interface Ownership {\n readonly path: readonly string[]\n readonly owner: { readonly kind: string; readonly name: string } | undefined\n}\n\nexport interface ModuleManifest {\n readonly fields: readonly string[]\n readonly messages: readonly string[]\n readonly ownership: readonly Ownership[]\n readonly contracts: readonly Omit<Contract, 'owner'>[]\n readonly findings: readonly Finding[]\n}\n\n/** A value `Module.make` accepts: a contract, a value carrying one, or a Surface without params. */\nexport type ModuleItem<Root> =\n | Contract\n | { readonly contract: Contract }\n | Surface<Root, any, any, void>\n\nconst label = (contract: Contract): string => `${contract.kind}:${contract.name}`\n/** Metadata summaries are application data (a query's input), so they cannot break the table. */\nconst tableCell = (text: string): string =>\n text\n .replace(/\\\\/g, '\\\\\\\\')\n .replace(/\\|/g, '\\\\|')\n .replace(/\\r\\n?|\\n/g, ' ')\nconst pathKey = (path: readonly string[]): string => path.join('.')\nconst isPrefix = (prefix: readonly string[], path: readonly string[]): boolean =>\n prefix.length <= path.length && prefix.every((segment, index) => segment === path[index])\n\n// A carried contract wins: a sync contract also has a `projection` (writable, not a function).\nconst toContract = <Root>(item: ModuleItem<Root>): Contract =>\n 'contract' in item\n ? item.contract\n : 'projection' in item\n ? Surface.contract(item, undefined)\n : item\n\nconst applicationTags = (app: AppScope<any, any, any>): readonly string[] =>\n Object.entries(app.Message as unknown as Record<string, unknown>)\n .filter(([key, value]) => messageTag(value) === key)\n .map(([key]) => key)\n\n/** Contracts that own at least one path, with a stable label. */\nconst owners = (module: Module<any, any, any>) =>\n module.contracts.filter(contract => contract.owns.length > 0)\n\n/**\n * Collects an application's contracts as pure data so their relationships can\n * be validated and inspected without starting a runtime.\n *\n * ```ts\n * const Project = Module.make(App, [BoardSurface, ProjectSync, ProjectRemote, ProjectAgent])\n * Module.validate(Project) // findings, or []\n * Module.toMarkdown(Project)\n * ```\n */\nexport const Module = {\n make: <Root, F extends Schema.Struct.Fields, Cases extends Record<string, Schema.Struct.Fields>>(\n app: AppScope<Root, F, Cases>,\n items: readonly ModuleItem<Root>[] = [],\n ): Module<Root, F, Cases> => ({ app, contracts: items.map(toContract) }),\n\n /** A new Module with more contracts; the input is unchanged. */\n add: <Root, F extends Schema.Struct.Fields, Cases extends Record<string, Schema.Struct.Fields>>(\n module: Module<Root, F, Cases>,\n ...items: readonly ModuleItem<Root>[]\n ): Module<Root, F, Cases> => ({\n app: module.app,\n contracts: [...module.contracts, ...items.map(toContract)],\n }),\n\n /**\n * Cross-contract invariants the types cannot express: a contract from another\n * application, a duplicate `kind:name`, two owners of overlapping Model paths,\n * a Message recorded by two replication contracts, and a path or Message the\n * application does not declare.\n */\n validate: (module: Module<any, any, any>): readonly Finding[] => {\n const findings: Finding[] = []\n const fields = new Set(Object.keys(module.app.Model.fields))\n const tags = new Set(applicationTags(module.app))\n const seen = new Map<string, Contract>()\n\n for (const contract of module.contracts) {\n const name = label(contract)\n if (contract.owner !== undefined && contract.owner !== module.app.owner)\n findings.push({\n rule: 'foreign-contract',\n contracts: [name],\n message: `${name} belongs to a different application`,\n })\n const duplicate = seen.get(name)\n if (duplicate !== undefined && duplicate !== contract)\n findings.push({\n rule: 'duplicate-name',\n contracts: [name],\n message: `${name} is declared twice`,\n })\n seen.set(name, contract)\n for (const path of [...contract.owns, ...contract.observes]) {\n const head = path[0]\n if (head === undefined || !fields.has(head))\n findings.push({\n rule: 'unknown-path',\n contracts: [name],\n message: `${name} references \"${pathKey(path)}\", which is not a Model field`,\n })\n }\n for (const tag of contract.messages)\n if (!tags.has(tag))\n findings.push({\n rule: 'unknown-message',\n contracts: [name],\n message: `${name} names \"${tag}\", which is not a Message of this application`,\n })\n }\n\n // The same value listed twice is one owner, as `duplicate-name` treats it.\n const owning = [...new Set(owners(module))]\n for (let i = 0; i < owning.length; i += 1)\n for (let j = i + 1; j < owning.length; j += 1) {\n const a = owning[i]!\n const b = owning[j]!\n for (const pa of a.owns)\n for (const pb of b.owns)\n // An empty path is reported as `unknown-path`, not as owning everything.\n if (pa.length > 0 && pb.length > 0 && (isPrefix(pa, pb) || isPrefix(pb, pa)))\n findings.push({\n rule: 'ownership-overlap',\n contracts: [label(a), label(b)],\n message: `${label(a)} owns \"${pathKey(pa)}\" and ${label(b)} owns \"${pathKey(pb)}\"`,\n })\n }\n\n const recorded = new Map<string, Contract>()\n for (const contract of module.contracts.filter(contract => contract.kind === 'sync'))\n for (const tag of contract.messages) {\n const other = recorded.get(tag)\n if (other !== undefined && other !== contract)\n findings.push({\n rule: 'message-claimed-twice',\n contracts: [label(other), label(contract)],\n message: `\"${tag}\" is durable in both ${label(other)} and ${label(contract)}`,\n })\n else recorded.set(tag, contract)\n }\n\n return findings\n },\n\n /**\n * The application's fields and Messages, who owns each Model path (local when\n * no contract does), every contract, and the findings. Reproducible for a\n * given Module, so it can be committed and diffed.\n */\n manifest: (module: Module<any, any, any>): ModuleManifest => {\n const ownership: Ownership[] = []\n const owning = owners(module)\n for (const field of Object.keys(module.app.Model.fields)) {\n const claims = owning.flatMap(contract =>\n contract.owns\n .filter(path => path[0] === field)\n .map(path => ({ path, owner: { kind: contract.kind, name: contract.name } })),\n )\n const whole = claims.find(claim => claim.path.length === 1)\n if (whole !== undefined) ownership.push(whole)\n else {\n ownership.push({ path: [field], owner: undefined })\n ownership.push(...claims.sort((a, b) => pathKey(a.path).localeCompare(pathKey(b.path))))\n }\n }\n return {\n fields: Object.keys(module.app.Model.fields),\n messages: applicationTags(module.app),\n ownership,\n contracts: module.contracts.map(({ owner: _owner, ...rest }) => rest),\n findings: Module.validate(module),\n }\n },\n\n /** The manifest as Markdown: the ownership tree, a table of contracts, and findings. */\n toMarkdown: (module: Module<any, any, any>): string => {\n const manifest = Module.manifest(module)\n const lines: string[] = ['```text', 'Model']\n const width = Math.max(0, ...manifest.ownership.map(row => pathKey(row.path).length))\n manifest.ownership.forEach((row, index) => {\n const last = index === manifest.ownership.length - 1\n const owner =\n row.owner === undefined ? 'LOCAL' : `${row.owner.kind.toUpperCase()} ${row.owner.name}`\n lines.push(`${last ? '└── ' : '├── '}${pathKey(row.path).padEnd(width)} ${owner}`)\n })\n lines.push(\n '```',\n '',\n '| Contract | Owns | Observes | Messages | Metadata |',\n '| --- | --- | --- | --- | --- |',\n )\n for (const contract of manifest.contracts)\n lines.push(\n `| ${contract.kind}:${contract.name} | ${contract.owns.map(pathKey).join(', ')} | ${contract.observes.map(pathKey).join(', ')} | ${contract.messages.join(', ')} | ${tableCell(contract.metadata.map(summary => `${summary.name}: ${summary.entries.join(', ')}`).join('; '))} |`,\n )\n if (manifest.findings.length > 0) {\n lines.push('', '## Findings', '')\n for (const finding of manifest.findings)\n lines.push(`- **${finding.rule}** ${finding.message}`)\n }\n return lines.join('\\n')\n },\n\n /**\n * The manifest as a Mermaid flowchart: Model fields in a subgraph, one node\n * per contract, a solid edge for ownership and a dotted edge for observation.\n */\n toMermaid: (module: Module<any, any, any>): string => {\n const manifest = Module.manifest(module)\n const lines = ['flowchart LR', ' subgraph Model']\n manifest.fields.forEach((field, index) => lines.push(` f${index}[\"${field}\"]`))\n lines.push(' end')\n // A path outside the Model (reported by `validate`) draws no edge.\n const fieldId = (path: readonly string[]): string | undefined => {\n const index = path.length === 0 ? -1 : manifest.fields.indexOf(path[0]!)\n return index < 0 ? undefined : `f${index}`\n }\n manifest.contracts.forEach((contract, index) => {\n lines.push(` c${index}[\"${contract.kind}:${contract.name}\"]`)\n for (const path of contract.owns) {\n const field = fieldId(path)\n if (field !== undefined) lines.push(` c${index} -->|owns| ${field}`)\n }\n for (const path of contract.observes) {\n const field = fieldId(path)\n if (field !== undefined && !contract.owns.some(owned => pathKey(owned) === pathKey(path)))\n lines.push(` c${index} -.-> ${field}`)\n }\n })\n return lines.join('\\n')\n },\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;AAkCA,MAAa,YAA2B,OAAO,IAAI,0BAA0B;AA8C7E,MAAM,aACJ,QACA,OACA,YACA,KACA,SACwB;CACxB;CACA;CACA;CACA;CACA;CACA,SAAS,MAAM,OAAO,IAAI,MAAM,GAAG,IAAI,IAAI,CAAC,CAAC;AAC/C;AAEA,MAAa,WAAW;;;;;CAKtB,YACE,QACA,OACA,aAAgC,CAAC,OACN,GAC1B,YAAY,UACX,QACA,OACA,aACA,SAAQ,OAAO,WAAW,MAAM,UAAU,IAAI,CAAC,IAC9C,MAAM,UAAU,MAAM,QAAQ,OAAO,IAAI,CAC5C,EACF;;;;;;CAMA,QAAoD,QAClD,IAAI;;CAEN,KAAK,UACH,OAAO,UAAU,YAAY,UAAU,QAAQ,aAAa;AAChE;AAsEA,SAAS,eAAe,MAAe,KAAsB;CAC3D,OAAO,SAAS,QAAQ,SAAS,KAAA,KAAa,CAAC,OAAO,OAAO,MAAM,GAAG,IAClE,KAAA,IACC,KAAiC;AACxC;AAEA,SAAS,eAAe,OAAwC;CAC9D,OAAO,UAAU,KAAA,IAAY,OAAO,KAAK,IAAI,OAAO,KAAK,KAAK;AAChE;;AAGA,MAAM,cAAc,gBAA6C;CAC/D,MAAM,UAAW,YAAwE,QACrF,MAAM,KAAK;CACf,OAAO,OAAO,YAAY,WAAW,UAAU,KAAA;AACjD;;AAGA,MAAM,YAAY,MAA2B,YAC3C,UAAU,YAAY,SAAS,MAAM,KACrC,OAAO,QAAQ,SAAS,YACxB,KAAK,IAAI,QAAQ,IAAI;;AAGvB,MAAM,eAAe,YACnB,QAAQ,SAAS,IAAI,UAAU,CAAC,CAAC,QAAQ,QAAuB,QAAQ,KAAA,CAAS;AAEnF,SAAS,SACP,QACA,MACA,OACA,KACA,WAAW,OACX,KACA,OACyB;CACzB,MAAM,cAAc;CAMpB,MAAM,WAAW,SAAS,MAAe,UAA4B,MAAM,QAAQ,OAAO,IAAI;CAC9F,MAAM,QAAiC;EACrC,GAAG,UAAU,QAAiB,OAAO,MAAM,KAAK,QAAQ;EACxD,KAAK,KAAK,KAAK,SAAS,MAAM;EAC9B;CACF;CACA,MAAM,OAAqC,GAAG,YAAY,MAAM;CAEhE,MAAM,SAAU,OAAsD;CACtE,IAAI,WAAW,KAAA,GACb,KAAK,MAAM,OAAO,OAAO,KAAK,MAAM,GAElC,OAAO,eAAe,MAAM,KAAK;EAC/B,OAAO,SACL,OAAO,MACP,CAAC,GAAG,MAAM,GAAG,GACb,YAAY,IAAI,GAAG,IACnB,SAAQ,eAAe,IAAI,IAAI,GAAG,GAAG,GACrC,OACA,KAAA,GACA,KACF;EACA,YAAY;EACZ,UAAU;EACV,cAAc;CAChB,CAAC;CAIL,MAAM,MAAM,QACV,SACE,QACA,CAAC,GAAG,MAAM,GAAG,GACb,YAAY,GAAG,GAAG,IAClB,SAAQ,eAAe,eAAe,IAAI,IAAI,GAAG,GAAG,CAAC,GACrD,OACC,MAAM,UAAU;EACf,MAAM,YAAY,IAAI,IAAI;EAC1B,MAAM,SAAS;EACf,IAAI,OAAO,OAAO,MAAM,GACtB,OAAO,SAAS,MAAM;GAAE,GAAG;IAAY,MAAM,OAAO;EAAM,CAAC;EAE7D,MAAM,GAAG,MAAM,UAAU,GAAG,SAAS;EACrC,OAAO,SAAS,MAAM,IAAI;CAC5B,GACA,KACF;CACF,MAAM,SAAS,UACb,SACE,QACA,CAAC,GAAG,MAAM,OAAO,KAAK,CAAC,GACvB,QACA,SACE,eACE,MAAM,QAAQ,IAAI,IAAI,CAAC,IAAK,IAAI,IAAI,CAAC,CAA4B,SAAS,KAAA,CAC5E,GACF,OACC,MAAM,UAAU;EACf,MAAM,QAAS,MAAM,QAAQ,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,IAAI,CAAC;EACvD,MAAM,SAAS;EACf,MAAM,OAAO,OAAO,OAAO,MAAM,IAC7B,MAAM,KAAK,MAAM,MAAO,MAAM,QAAQ,OAAO,QAAQ,IAAK,IAC1D,MAAM,QAAQ,GAAG,MAAM,MAAM,KAAK;EACtC,OAAO,SAAS,MAAM,IAAI;CAC5B,GACA,KACF;CACF,MAAM,UAAU,eAA6C;EAC3D,MAAM,eAAe,kBAAkB,CAAC,MAAM,GAAG,WAAW,YAAY,CAAC;EACzE,OAAO,WACH,eACE,OAAO,OAAO,WAAW,KAAK,GAC9B,eACA,SAAQ,OAAO,IAAI,IAAI,IAAI,IAA6B,UAAS,WAAW,KAAK,KAAK,CAAC,GACvF,WAAW,QACb,IACA,eACE,WAAW,OACX,eACA,SAAQ,WAAW,KAAK,IAAI,IAAI,CAAC,GACjC,WAAW,QACb;CACN;CACA,OAAO;AACT;;AASA,SAAS,kBAAkB,cAA8C;CACvE,MAAM,uBAAO,IAAI,IAAY;CAC7B,MAAM,SAAgC,CAAC;CACvC,KAAK,MAAM,cAAc,cAAc;EACrC,MAAM,MAAM,WAAW,KAAK,IAAQ;EACpC,IAAI,KAAK,IAAI,GAAG,GAAG;EACnB,KAAK,IAAI,GAAG;EACZ,OAAO,KAAK,UAAU;CACxB;CACA,OAAO;AACT;AAuBA,SAAS,eACP,OACA,cACA,MACA,WAAqBA,WAAS,OACF;CAC5B,OAAO;EAAE;EAAO;EAAc;EAAU;CAAK;AAC/C;;;;;;AAOA,SAAS,aAAa,QAA8C;CAClE,OAAO,OAAO,KAAK,MAAM,CAAC,CAAC,WAAW,IAClC,OAAO,OAAO,OAAO,QAAQ,OAAO,KAAK,IACzC,OAAO,OAAO,MAAM;AAC1B;AAyCA,MAAM,+BAAe,IAAI,QAAgB;AAEzC,MAAM,WAAW,UACf,MAAM,aAAa,WAAW,KAAK,aAAa,IAAI,KAAK;AAE3D,MAAM,YACJ,UACA,UACM;CACN,IAAI,MAAM,KAAK,OAAO,GAAG,aAAa,IAAI,QAAQ;CAClD,OAAO;AACT;AAQA,MAAM,WAAW,MAAe,SAAyC;CACvE,IAAI,QAAQ;CACZ,KAAK,MAAM,OAAO,MAAM;EACtB,IAAI,OAAO,UAAU,YAAY,UAAU,MAAM,OAAO,KAAA;EACxD,QAAS,MAAkC;CAC7C;CACA,OAAO;AACT;AAGA,MAAM,aAAoB,QAAe,UACvC,WAAW,QAAQ,KAAK,IAAI,SAAS;AAEvC,MAAM,cAAc,MAAe,UAA4B;CAC7D,IAAI,OAAO,GAAG,MAAM,KAAK,GAAG,OAAO;CACnC,IAAI,OAAO,SAAS,YAAY,OAAO,UAAU,YAAY,SAAS,QAAQ,UAAU,MACtF,OAAO;CACT,MAAM,YAAY,OAAO,eAAe,IAAI;CAE5C,IAAI,EADU,cAAc,OAAO,aAAa,cAAc,QAAQ,MAAM,QAAQ,IAAI,MAC1E,OAAO,eAAe,KAAK,MAAM,WAAW,OAAO;CACjE,MAAM,OAAO,OAAO,KAAK,IAAI;CAC7B,OACE,KAAK,WAAW,OAAO,KAAK,KAAK,CAAC,CAAC,UACnC,KAAK,OACH,QACE,OAAO,OAAO,OAAO,GAAG,KACxB,OAAO,GAAI,KAAiC,MAAO,MAAkC,IAAI,CAC7F;AAEJ;AAEA,MAAa,aAAa;CACxB,KACmC,YAE/B,cACuD;EAEvD,MAAM,SAAoC,OAAO,OAAO,IAAI;EAC5D,MAAM,eAAsC,CAAC;EAC7C,MAAM,WAAuB,CAAC;EAE9B,MAAM,QAAqD,CAAC;EAC5D,MAAM,UAA6D,CAAC;EAEpE,KAAK,MAAM,OAAO,OAAO,KAAK,SAAS,GAAG;GACxC,MAAM,SAAU,UAAsC;GACtD,IAAI,WAAW,MAAM;IACnB,OAAO,OAAO,OAAO,OAAO;IAC5B,MAAM,KAAK,EAAE,cAAc,CAAC,EAAE,CAAC;IAC/B,QAAQ,KAAK,CAAC,MAAK,SAAQ,eAAe,MAAM,GAAG,CAAC,CAAC;GACvD,OAAO;IACL,MAAM,SAAS;IACf,OAAO,OAAO,OAAO;IACrB,aAAa,KAAK,GAAG,OAAO,YAAY;IACxC,SAAS,KAAK,OAAO,QAAQ;IAC7B,MAAM,KAAK,MAAM;IACjB,QAAQ,KAAK,CAAC,MAAK,SAAQ,OAAO,KAAK,eAAe,MAAM,GAAG,CAAC,CAAC,CAAC;GACpE;EACF;EAEA,MAAM,QAAQ,SAA2B;GACvC,MAAM,MAA+B,OAAO,OAAO,IAAI;GACvD,KAAK,MAAM,CAAC,KAAK,WAAW,SAAS,IAAI,OAAO,OAAO,IAAI;GAC3D,OAAO;EACT;EACA,OAAO,SACL,eACE,aAAa,MAAM,GACnB,kBAAkB,YAAY,GAC9B,MACAA,WAAS,QAAQ,QAAQ,CAC3B,GACA,KACF;CACF;CAEF,SACE,YACwE;EAExE,MAAM,SAAoC,OAAO,OAAO,IAAI;EAC5D,MAAM,eAAsC,CAAC;EAC7C,MAAM,WAAuB,CAAC;EAC9B,MAAM,UAA0C,CAAC;EACjD,MAAM,UAA6D,CAAC;EAEpE,KAAK,MAAM,OAAO,OAAO,KAAK,OAAO,GAAG;GACtC,MAAM,QAAQ,QAAQ;GACtB,IAAI,SAAS,GAAG,KAAK,GAAG;IACtB,MAAM,QAAQ,MAAM;IACpB,OAAO,OAAO,MAAM;IACpB,aAAa,KAAK,MAAM,UAAU;IAClC,QAAQ,KAAK,CAAC,KAAK,MAAM,GAAG,CAAC;GAC/B,OAAO;IACL,OAAO,OAAO,MAAM;IACpB,aAAa,KAAK,GAAG,MAAM,YAAY;IACvC,SAAS,KAAK,MAAM,QAAQ;IAC5B,QAAQ,KAAK,KAAK;IAClB,QAAQ,KAAK,CAAC,KAAK,MAAM,IAAI,CAAC;GAChC;EACF;EAEA,MAAM,QAAQ,SAA2B;GACvC,MAAM,MAA+B,OAAO,OAAO,IAAI;GACvD,KAAK,MAAM,CAAC,KAAK,WAAW,SAAS,IAAI,OAAO,OAAO,IAAI;GAC3D,OAAO;EACT;EACA,OAAO,SACL,eACE,aAAa,MAAM,GACnB,kBAAkB,YAAY,GAC9B,MACAA,WAAS,QAAQ,QAAQ,CAC3B,GACA,OACF;CACF;;;;;;CAOA,QACE,eAEA,SACE;EACE,OAAO,OAAO,MAAM,WAAW,KAAK;EACpC,cAAc,WAAW;EACzB,UAAU,WAAW;EACrB,OAAM,SAAQ,KAAK,KAAI,UAAS,WAAW,KAAK,KAAK,CAAC;CACxD,GACA,CAAC,UAAU,CACb;;CAGF,SACE,eAEA,SACE;EACE,OAAO,OAAO,OAAO,WAAW,KAAK;EACrC,cAAc,WAAW;EACzB,UAAU,WAAW;EACrB,OAAM,SAAQ,OAAO,IAAI,OAAM,UAAS,WAAW,KAAK,KAAK,CAAC;CAChE,GACA,CAAC,UAAU,CACb;CAEF,OAAoB,YAAqC,SACvD,WAAW,KAAK,IAAI;;;;;;CAOtB,aACE,OACA,MACA,aAI6B;EAC7B;EACA,cAAc,SAAS,gBAAgB,CAAC;EACxC,UAAU,SAAS,YAAYA,WAAS;EACxC;CACF;;;;;;;;;;;;;;;;;;;;;CAsBA,SACE,IACA,WACyB;EACzB,IAAI,GAAG,WAAW,GAChB,MAAM,IAAI,MACR,4JACF;EAEF,MAAM,QAAQ,GAAG,KAAI,UACnB,aAAa,QAAQ,EAAE,cAAc,CAAC,MAAM,UAAU,CAAC,UAAU,EAAE,IAAI,KACzE;EACA,MAAM,eAAe,kBAAkB,MAAM,SAAQ,SAAQ,KAAK,YAAY,CAAC;EAE/E,MAAM,SAAS,MAAM,KAAK,OAAO;EACjC,IAAI;EACJ,MAAM,UAAgC;GACpC;GACA,OAAM,SAAQ;IACZ,MAAM,SAAS,aAAa,KAAI,SAAQ,QAAQ,MAAM,IAAI,CAAC;IAC3D,MAAM,SAAS;IACf,MAAM,QACJ,WAAW,KAAA,IACP,OAAO,IAAI,IACX,CAAC,UAAU,OAAO,OAAO,OAAO,UAAU,OAAO,GAAG,OAAO,OAAO,OAAO,MAAM,CAAC,IAC9E,OAAO,QACP,UAAU,OAAO,OAAO,OAAO,IAAI,CAAC;IAC5C,OAAO;KAAE;KAAQ;IAAM;IACvB,OAAO;GACT;EACF;EACA,IAAI,QAAQ,aAAa,IAAI,OAAO;EACpC,OAAO;CACT;;;;;;;;CASA,OACE,GAAG,SAC8D;EACjE,MAAM,WAAW,KAAK,KAAI,QAAO,IAAI,UAAU;EAG/C,MAAM,QAAQ,SAAS,EAAE,EAAE;EAC3B,KAAK,MAAM,SAAS,UAClB,IAAI,MAAM,UAAU,OAClB,MAAM,IAAI,MAAM,yDAAyD;EAQ7E,MAAM,SAAoC,OAAO,OAAO,IAAI;EAC5D,MAAM,QAAgC,OAAO,OAAO,IAAI;EACxD,KAAK,MAAM,SAAS,CAAC,GAAG,QAAQ,GAAG;GACjC,MAAM,OAAO,MAAM,WAAW,KAAK,GAAG;GACtC,MAAM,WAAW,MAAM,MAAM;GAC7B,IAAI,aAAa,KAAA,GAAW;IAC1B,IAAI,aAAa,MAAM;KACrB,SAAS,OAAO,SAAS,QAAQ,KAAK,GAAG,CAAC;KAC1C;IACF;IACA,MAAM,IAAI,MACR,qBAAqB,SAAS,SAAS,KAAK,2BAA2B,MAAM,IAAI,sCACnF;GACF;GACA,MAAM,MAAM,OAAO;GACnB,OAAO,MAAM,OAAO,MAAM;EAC5B;EACA,OAAO;GACL,QAAQ,aAAa,MAAM;GAC3B,cAAc,kBAAkB,SAAS,KAAI,UAAS,MAAM,UAAU,CAAC;GACvE,MAAK,UAAS;IACZ,MAAM,MAA+B,OAAO,OAAO,IAAI;IACvD,KAAK,MAAM,SAAS,UAAU,IAAI,MAAM,OAAO,MAAM,IAAI,KAAc;IACvE,OAAO;GACT;GACA,MAAM,OAAO,WAAW;IACtB,IAAI,OAAO;IACX,KAAK,MAAM,SAAS,UAClB,OAAO,MAAM,IAAI,MAAgB,OAAmC,MAAM,IAAa;IACzF,OAAO;GACT;EACF;CACF;;;;;;;CAQA,UACE,GAAG,gBACkE;EACrE,MAAM,QAAQ,CAAC,GAAG,WAAW;EAC7B,MAAM,SAAoC,OAAO,OAAO,IAAI;EAI5D,MAAM,QAAgC,OAAO,OAAO,IAAI;EACxD,MAAM,UAAU,MAA8B,QAC5C,KAAK,aAAa,MAAK,eAAc,WAAW,GAAG,EAAE,MAAM,GAAG,CAAC,EAAE,KAAK,GAAG;EAC3E,KAAK,MAAM,QAAQ,OACjB,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,KAAK,OAAO,MAAM,GAAG;GAC7D,MAAM,WAAW,OAAO;GACxB,MAAM,OAAO,OAAO,MAAM,GAAG;GAC7B,IAAI,aAAa,KAAA,GAAW;IAC1B,MAAM,WAAW,MAAM;IACvB,IAAI,aAAa,KAAA,KAAa,SAAS,KAAA,KAAa,aAAa,MAC/D,MAAM,IAAI,MACR,wBAAwB,SAAS,SAAS,KAAK,2BAA2B,IAAI,EAChF;IAEF,IAAI,aAAa,OAAO;IACxB,MAAM,IAAI,MAAM,oDAAoD,IAAI,EAAE;GAC5E;GACA,OAAO,OAAO;GACd,IAAI,SAAS,KAAA,GAAW,MAAM,OAAO;EACvC;EAEF,OAAO;GACL,QAAQ,aAAa,MAAM;GAC3B,cAAc,kBAAkB,MAAM,SAAQ,SAAQ,CAAC,GAAG,KAAK,YAAY,CAAC,CAAC;GAC7E,MAAK,UAAS;IACZ,MAAM,MAA+B,OAAO,OAAO,IAAI;IACvD,KAAK,MAAM,QAAQ,OAAO,OAAO,OAAO,KAAK,KAAK,IAAI,KAAc,CAAC;IACrE,OAAO;GACT;GACA,MAAM,OAAO,WAAW;IACtB,IAAI,OAAO;IAEX,KAAK,MAAM,QAAQ,OAAO,OAAO,KAAK,IAAI,MAAe,MAAe;IACxE,OAAO;GACT;EACF;CACF;AACF;AA+LA,MAAM,gBAAgB,UACpB,OAAO,UAAU,YACjB,UAAU,QACV,OAAQ,MAA6B,SAAS,cAC9CA,WAAS,GAAI,MAAiC,QAAQ;AAwKxD,MAAM,aAGJ,WAG+C;CAG/C,MAAM,QAAgB,CAAC;CACvB,OAAO;EACL,OAAO,OAAO;EACd,SAAS,OAAO;EAChB;EACA,OAAO,SAEL,OAAO,OACP,CAAC,GACD,MAAM,GAAG,IACT,SAAQ,MACR,OACA,KAAA,GACA,KACF;CACF;AACF;AAiCA,SAAS,YAAY,QAAkB;CACrC,MAAM,QAAQ,UAAU,MAAM;CAC9B,MAAM,WACJ,MACA,kBAMA,QAAQ,KAAK,OAAO,MAAM;EACxB,GAAI,cAAc,WAAW,KAAA,IACzB,CAAC,IACD,EACE,QAAQ,OAAO,SAAS,cAAc,MAAM,IACxC,cAAc,SACd,OAAO,OAAO,cAAc,MAAM,EACxC;EACJ,QAAQ,YAAmE;GACzE,MAAM,QAAQ,cAAc,MAAM,OAAO;GACzC,OAAO,aAAa,KAAK,IAAI,QAAQ,WAAW,OAAO,KAAc;EACvE;EACA,UAAU,cAAc;CAC1B,CAAU;CACZ,MAAM,OAAO;EAAE,GAAG;EAAO,QAAQ,MAAM;EAAO;CAAQ;CACtD,MAAM,YAAY,SAA2E;EAC3F,GAAG;EACH;EACA,SAAS,IAAI;EACb,QAAQ,IAAI;CACd;CACA,OAAO;EAAE,GAAG;EAAM;EAAU,SAAS,OAAO;EAAS,QAAQ,OAAO;CAAO;AAC7E;;AAoBA,MAAa,aAAa;;;;;;;CAOxB,OAME,KACA,aAQG;EACH,MAAM,uBAAO,IAAI,IAAY;EAC7B,KAAK,MAAM,eAAe,UAAU;GAClC,MAAM,MAAM,WAAW,WAAW;GAClC,IAAI,QAAQ,KAAA,GACV,MAAM,IAAI,MAAM,gDAAgD;GAElE,IAAK,IAAI,QAA+C,SAAS,aAC/D,MAAM,IAAI,MACR,qBAAqB,IAAI,uDAC3B;GAEF,IAAI,KAAK,IAAI,GAAG,GAAG,MAAM,IAAI,MAAM,+BAA+B,IAAI,EAAE;GACxE,KAAK,IAAI,GAAG;EACd;EACA,OAAO;GACL,OAAO,IAAI;GACX,cAAc;GACd,QAAQ,OAAO,MAAM,CAAC,GAAG,QAAQ,CAEhC;GAMD;GACA,WAAW,YACT,SAAS,MAAM,OAAO;EAC1B;CACF;;;;;;CAOA,QACE,GAAG,YAQA;EACH,MAAM,QAAQ,CAAC,GAAG,OAAO;EACzB,MAAM,QAAQ,MAAM,EAAE,EAAE;EACxB,MAAM,uBAAO,IAAI,IAAY;EAC7B,MAAM,eAA8C,CAAC;EACrD,KAAK,MAAM,QAAQ,OAAO;GACxB,IAAI,KAAK,UAAU,OACjB,MAAM,IAAI,MAAM,uDAAuD;GAEzE,KAAK,MAAM,eAAe,KAAK,cAAc;IAC3C,MAAM,MAAM,WAAW,WAAW;IAClC,IAAI,QAAQ,KAAA,GAAW;IACvB,IAAI,KAAK,IAAI,GAAG,GAAG,MAAM,IAAI,MAAM,gCAAgC,IAAI,EAAE;IACzE,KAAK,IAAI,GAAG;IACZ,aAAa,KAAK,WAAqC;GACzD;EACF;EACA,OAAO;GACE;GACO;GACd,QAAQ,OAAO,MAAM,YAAY;GAMjC;GACA,WAAW,YAAoD,SAAS,MAAM,OAAO;EACvF;CACF;AACF;AA4BA,MAAa,SAAS;;CAEpB,SAA6D,WAKhB;EAC3C,IAAI,OAAO,KAAK,WAAW,GAAG,MAAM,IAAI,MAAM,uCAAuC;EACrF,OAAO,OAAO,OAAO;GAAE,MAAM;GAAU,GAAG;EAAO,CAAC;CACpD;;CAGA,KAAK,UACH,OAAO,UAAU,YAAY,UAAU,SAAS,OAAO,QAAQ;;;;;CAMjE,MACE,QACA,SAEA,OAAO,IAAI,OAAO,oBAAoB,OAAO,KAAK,CAAC,CAAC,IAAI,GAAG,OAAO,SAAS;AAC/E;AAEA,MAAa,UAAU;CACrB;;;;;;CAOA,KACE,SACA,WACqD;EACrD,MAAM,YAAY,UAChB,OAAO,WAAW,aACb,OAAkD,KAAK,IACxD,OAAO,KAAK,MAAM;EACxB,MAAM,gBAAgB,UACpB,OAAO,IAAI,SAAS,KAAK,GAAG,QAAQ,UAAU;EAChD,OAAO;GACL,MAAM,QAAQ;GACd,OAAO,QAAQ;GACf,UAAU,YAAY,OAAO;GAC7B;GACA,cAAa,UAAS;IACpB,MAAM,QAAQ,SAAS,KAAK;IAC5B,IAAI,OAAO,OAAO,KAAK,GAAG,OAAO,CAAC;IAClC,OAAO,CACL;KACE,KAAK,QAAQ;KACb;KACA,QAAQ,MAAM;KACd,YAAY,QAAQ,WAAW,MAAM,KAAK;IAC5C,CACF;GACF;EACF;CACF;;;;;;;;;;;;;;;;;;;;;;CAuBA,OACE,SACA,OACA,QACA,WACqD;EACrD,MAAM,MAAM,WAAW,MAAM;EAC7B,IAAI,QAAQ,KAAA,GACV,MAAM,IAAI,MACR,oDAAoD,QAAQ,KAAK,kDACnE;EAEF,MAAM,QAAQ,MAAM;EACpB,MAAM,YAAY,UAAuC;GACvD,MAAM,QAAQ,MAAM,IAAI,KAAK;GAC7B,OAAO,UAAU,SAAS,OAAO,GAAG,IAChC,OAAO,KAAK,OAAO,KAAiC,CAAC,IACrD,OAAO,KAAK;EAClB;EACA,OAAO;GACL,MAAM,QAAQ;GACd,OAAO,QAAQ;GACf,UAAU,YAAY,OAAO;GAC7B,YAAY;IAAE,MAAM,MAAM;IAAY;GAAI;GAC1C,eAAc,UAAS,OAAO,IAAI,SAAS,KAAK,GAAG,QAAQ,UAAU;GACrE,cAAa,UAAS;IACpB,MAAM,QAAQ,SAAS,KAAK;IAC5B,IAAI,OAAO,OAAO,KAAK,GAAG,OAAO,CAAC;IAClC,OAAO,CACL;KACE,KAAK,QAAQ;KACb;KACA,QAAQ,MAAM;KACd,YAAY,QAAQ,WAAW,MAAM,KAAK;IAC5C,CACF;GACF;EACF;CACF;;;;;;;;;;;;;;;;;;;;CAqBA,OACE,OACA,YAM8D;EAC9D,MAAM,MAAM;EACZ,OAAO,MAAM;EACb,MAAM,OAAO;EACb;EACA,UAAU,YAAY,KAAK;EAC3B,cAAa,UAAS;GACpB,MAAM,SAAS,OAAO,KAAK,aAAa,KAAK;GAC7C,IAAI,OAAO,OAAO,MAAM,GAAG,OAAO,CAAC;GACnC,MAAM,uBAAO,IAAI,IAAY;GAC7B,OAAO,OAAO,UAAU,OAAO,MAAM,KAAK,KAAK,CAAC,CAAC,CAAC,KAAK,EAAE,KAAK,aAAa;IACzE,IAAI,OAAO,QAAQ,YAAY,IAAI,WAAW,GAC5C,MAAM,IAAI,MACR,kBAAkB,MAAM,KAAK,kDAC/B;IACF,IAAI,QAAQ,aACV,MAAM,IAAI,MAAM,kBAAkB,MAAM,KAAK,yCAAyC;IACxF,IAAI,KAAK,IAAI,GAAG,GACd,MAAM,IAAI,MAAM,kBAAkB,MAAM,KAAK,6BAA6B,IAAI,EAAE;IAClF,KAAK,IAAI,GAAG;IACZ,OAAO;KAAE;KAAK,SAAS;KAAO;KAAQ,YAAY,MAAM,WAAW,MAAM;IAAE;GAC7E,CAAC;EACH;CACF;;;;;;;;CASA,YACE,QACA,UACmD,OAAO,YAAY,KAAK;CAE7E,OAQE,KACA,MACA,WAQ4C;EAG5C,MAAM,cAAc,WAA4C;GAG9D,IACE,WAAW,KAAA,KACX,OAAO,WAAW,KAAA,KAClB,CAAC,OAAO,GAAG,OAAO,MAAM,CAAC,CAAC,KAAA,CAAS,GAEnC,MAAM,IAAI,MAAM,YAAY,KAAK,sCAAsC;GAEzE,OAAO,OAAO,MAAM;IAAE,OAAO,IAAI;IAAO;GAAO,CAAC;EAClD;EACA,OAAO;GACL;GACA,OAAO,IAAI;GAEX,QAAQ,OAAO;GACf,SAAS,OAAO;GAChB,UAAU,OAAO,YAAY,CAAC;GAC9B;EACF;CACF;CAEA,OACE,SACA,MACA,GAAG,WACO,QAAQ,WAAW,OAAO,EAAY,CAAC,CAAC,KAAK,IAAI;;;;;;CAO7D,OACE,UACA,WAC6B;;;;;;CAO/B,WACE,SACA,QACA,WAIY;EACZ,MAAM,aAAa,QAAQ,WAAW,MAAM;EAG5C,QACE,MACA,MACS,OAAO,WAAW,KAAK,IAAI,GAAG,CAAoC;CAC/E;;;;;;CAOA,QAC6B,WAEzB,OACA,MAEA,MAAM,OAAO,CAAyC;;;;;CAM1D,WACE,SACA,GAAG,WACU;EACb,MAAM,aAAa,QAAQ,WAAW,OAAO,EAAY;EACzD,OAAO;GACL,MAAM;GACN,MAAM,QAAQ;GACd,OAAO,QAAQ;GACf,MAAM,CAAC;GACP,UAAU,WAAW;GACrB,UAAU,YAAY,OAAO;GAC7B,UAAUA,WAAS,UAAU,WAAW,QAAQ;EAClD;CACF;;;;;CAMA,UACE,SACA,GAAG,WACmB;EACtB,MAAM,aAAa,QAAQ,WAAW,OAAO,EAAY;EACzD,OAAO;GACL,MAAM,QAAQ;GACd,cAAc,WAAW;GACzB,UAAUA,WAAS,UAAU,WAAW,QAAQ;GAChD,OAAO,QAAQ;EACjB;CACF;AACF;AA+GA,MAAM,SAAS,aAA+B,GAAG,SAAS,KAAK,GAAG,SAAS;;AAE3E,MAAM,aAAa,SACjB,KACG,QAAQ,OAAO,MAAM,CAAC,CACtB,QAAQ,OAAO,KAAK,CAAC,CACrB,QAAQ,aAAa,GAAG;AAC7B,MAAM,WAAW,SAAoC,KAAK,KAAK,GAAG;AAClE,MAAM,YAAY,QAA2B,SAC3C,OAAO,UAAU,KAAK,UAAU,OAAO,OAAO,SAAS,UAAU,YAAY,KAAK,MAAM;AAG1F,MAAM,cAAoB,SACxB,cAAc,OACV,KAAK,WACL,gBAAgB,OACd,QAAQ,SAAS,MAAM,KAAA,CAAS,IAChC;AAER,MAAM,mBAAmB,QACvB,OAAO,QAAQ,IAAI,OAA6C,CAAC,CAC9D,QAAQ,CAAC,KAAK,WAAW,WAAW,KAAK,MAAM,GAAG,CAAC,CACnD,KAAK,CAAC,SAAS,GAAG;;AAGvB,MAAM,UAAU,WACd,OAAO,UAAU,QAAO,aAAY,SAAS,KAAK,SAAS,CAAC;;;;;;;;;;;AAY9D,MAAa,SAAS;CACpB,OACE,KACA,QAAqC,CAAC,OACV;EAAE;EAAK,WAAW,MAAM,IAAI,UAAU;CAAE;;CAGtE,MACE,QACA,GAAG,WACyB;EAC5B,KAAK,OAAO;EACZ,WAAW,CAAC,GAAG,OAAO,WAAW,GAAG,MAAM,IAAI,UAAU,CAAC;CAC3D;;;;;;;CAQA,WAAW,WAAsD;EAC/D,MAAM,WAAsB,CAAC;EAC7B,MAAM,SAAS,IAAI,IAAI,OAAO,KAAK,OAAO,IAAI,MAAM,MAAM,CAAC;EAC3D,MAAM,OAAO,IAAI,IAAI,gBAAgB,OAAO,GAAG,CAAC;EAChD,MAAM,uBAAO,IAAI,IAAsB;EAEvC,KAAK,MAAM,YAAY,OAAO,WAAW;GACvC,MAAM,OAAO,MAAM,QAAQ;GAC3B,IAAI,SAAS,UAAU,KAAA,KAAa,SAAS,UAAU,OAAO,IAAI,OAChE,SAAS,KAAK;IACZ,MAAM;IACN,WAAW,CAAC,IAAI;IAChB,SAAS,GAAG,KAAK;GACnB,CAAC;GACH,MAAM,YAAY,KAAK,IAAI,IAAI;GAC/B,IAAI,cAAc,KAAA,KAAa,cAAc,UAC3C,SAAS,KAAK;IACZ,MAAM;IACN,WAAW,CAAC,IAAI;IAChB,SAAS,GAAG,KAAK;GACnB,CAAC;GACH,KAAK,IAAI,MAAM,QAAQ;GACvB,KAAK,MAAM,QAAQ,CAAC,GAAG,SAAS,MAAM,GAAG,SAAS,QAAQ,GAAG;IAC3D,MAAM,OAAO,KAAK;IAClB,IAAI,SAAS,KAAA,KAAa,CAAC,OAAO,IAAI,IAAI,GACxC,SAAS,KAAK;KACZ,MAAM;KACN,WAAW,CAAC,IAAI;KAChB,SAAS,GAAG,KAAK,eAAe,QAAQ,IAAI,EAAE;IAChD,CAAC;GACL;GACA,KAAK,MAAM,OAAO,SAAS,UACzB,IAAI,CAAC,KAAK,IAAI,GAAG,GACf,SAAS,KAAK;IACZ,MAAM;IACN,WAAW,CAAC,IAAI;IAChB,SAAS,GAAG,KAAK,UAAU,IAAI;GACjC,CAAC;EACP;EAGA,MAAM,SAAS,CAAC,GAAG,IAAI,IAAI,OAAO,MAAM,CAAC,CAAC;EAC1C,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK,GACtC,KAAK,IAAI,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK,GAAG;GAC7C,MAAM,IAAI,OAAO;GACjB,MAAM,IAAI,OAAO;GACjB,KAAK,MAAM,MAAM,EAAE,MACjB,KAAK,MAAM,MAAM,EAAE,MAEjB,IAAI,GAAG,SAAS,KAAK,GAAG,SAAS,MAAM,SAAS,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,IACxE,SAAS,KAAK;IACZ,MAAM;IACN,WAAW,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC;IAC9B,SAAS,GAAG,MAAM,CAAC,EAAE,SAAS,QAAQ,EAAE,EAAE,QAAQ,MAAM,CAAC,EAAE,SAAS,QAAQ,EAAE,EAAE;GAClF,CAAC;EACT;EAEF,MAAM,2BAAW,IAAI,IAAsB;EAC3C,KAAK,MAAM,YAAY,OAAO,UAAU,QAAO,aAAY,SAAS,SAAS,MAAM,GACjF,KAAK,MAAM,OAAO,SAAS,UAAU;GACnC,MAAM,QAAQ,SAAS,IAAI,GAAG;GAC9B,IAAI,UAAU,KAAA,KAAa,UAAU,UACnC,SAAS,KAAK;IACZ,MAAM;IACN,WAAW,CAAC,MAAM,KAAK,GAAG,MAAM,QAAQ,CAAC;IACzC,SAAS,IAAI,IAAI,uBAAuB,MAAM,KAAK,EAAE,OAAO,MAAM,QAAQ;GAC5E,CAAC;QACE,SAAS,IAAI,KAAK,QAAQ;EACjC;EAEF,OAAO;CACT;;;;;;CAOA,WAAW,WAAkD;EAC3D,MAAM,YAAyB,CAAC;EAChC,MAAM,SAAS,OAAO,MAAM;EAC5B,KAAK,MAAM,SAAS,OAAO,KAAK,OAAO,IAAI,MAAM,MAAM,GAAG;GACxD,MAAM,SAAS,OAAO,SAAQ,aAC5B,SAAS,KACN,QAAO,SAAQ,KAAK,OAAO,KAAK,CAAC,CACjC,KAAI,UAAS;IAAE;IAAM,OAAO;KAAE,MAAM,SAAS;KAAM,MAAM,SAAS;IAAK;GAAE,EAAE,CAChF;GACA,MAAM,QAAQ,OAAO,MAAK,UAAS,MAAM,KAAK,WAAW,CAAC;GAC1D,IAAI,UAAU,KAAA,GAAW,UAAU,KAAK,KAAK;QACxC;IACH,UAAU,KAAK;KAAE,MAAM,CAAC,KAAK;KAAG,OAAO,KAAA;IAAU,CAAC;IAClD,UAAU,KAAK,GAAG,OAAO,MAAM,GAAG,MAAM,QAAQ,EAAE,IAAI,CAAC,CAAC,cAAc,QAAQ,EAAE,IAAI,CAAC,CAAC,CAAC;GACzF;EACF;EACA,OAAO;GACL,QAAQ,OAAO,KAAK,OAAO,IAAI,MAAM,MAAM;GAC3C,UAAU,gBAAgB,OAAO,GAAG;GACpC;GACA,WAAW,OAAO,UAAU,KAAK,EAAE,OAAO,QAAQ,GAAG,WAAW,IAAI;GACpE,UAAU,OAAO,SAAS,MAAM;EAClC;CACF;;CAGA,aAAa,WAA0C;EACrD,MAAM,WAAW,OAAO,SAAS,MAAM;EACvC,MAAM,QAAkB,CAAC,WAAW,OAAO;EAC3C,MAAM,QAAQ,KAAK,IAAI,GAAG,GAAG,SAAS,UAAU,KAAI,QAAO,QAAQ,IAAI,IAAI,CAAC,CAAC,MAAM,CAAC;EACpF,SAAS,UAAU,SAAS,KAAK,UAAU;GACzC,MAAM,OAAO,UAAU,SAAS,UAAU,SAAS;GACnD,MAAM,QACJ,IAAI,UAAU,KAAA,IAAY,UAAU,GAAG,IAAI,MAAM,KAAK,YAAY,EAAE,GAAG,IAAI,MAAM;GACnF,MAAM,KAAK,GAAG,OAAO,SAAS,SAAS,QAAQ,IAAI,IAAI,CAAC,CAAC,OAAO,KAAK,EAAE,IAAI,OAAO;EACpF,CAAC;EACD,MAAM,KACJ,OACA,IACA,wDACA,iCACF;EACA,KAAK,MAAM,YAAY,SAAS,WAC9B,MAAM,KACJ,KAAK,SAAS,KAAK,GAAG,SAAS,KAAK,KAAK,SAAS,KAAK,IAAI,OAAO,CAAC,CAAC,KAAK,IAAI,EAAE,KAAK,SAAS,SAAS,IAAI,OAAO,CAAC,CAAC,KAAK,IAAI,EAAE,KAAK,SAAS,SAAS,KAAK,IAAI,EAAE,KAAK,UAAU,SAAS,SAAS,KAAI,YAAW,GAAG,QAAQ,KAAK,IAAI,QAAQ,QAAQ,KAAK,IAAI,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,EAAE,GAChR;EACF,IAAI,SAAS,SAAS,SAAS,GAAG;GAChC,MAAM,KAAK,IAAI,eAAe,EAAE;GAChC,KAAK,MAAM,WAAW,SAAS,UAC7B,MAAM,KAAK,OAAO,QAAQ,KAAK,KAAK,QAAQ,SAAS;EACzD;EACA,OAAO,MAAM,KAAK,IAAI;CACxB;;;;;CAMA,YAAY,WAA0C;EACpD,MAAM,WAAW,OAAO,SAAS,MAAM;EACvC,MAAM,QAAQ,CAAC,gBAAgB,kBAAkB;EACjD,SAAS,OAAO,SAAS,OAAO,UAAU,MAAM,KAAK,QAAQ,MAAM,IAAI,MAAM,GAAG,CAAC;EACjF,MAAM,KAAK,OAAO;EAElB,MAAM,WAAW,SAAgD;GAC/D,MAAM,QAAQ,KAAK,WAAW,IAAI,KAAK,SAAS,OAAO,QAAQ,KAAK,EAAG;GACvE,OAAO,QAAQ,IAAI,KAAA,IAAY,IAAI;EACrC;EACA,SAAS,UAAU,SAAS,UAAU,UAAU;GAC9C,MAAM,KAAK,MAAM,MAAM,IAAI,SAAS,KAAK,GAAG,SAAS,KAAK,GAAG;GAC7D,KAAK,MAAM,QAAQ,SAAS,MAAM;IAChC,MAAM,QAAQ,QAAQ,IAAI;IAC1B,IAAI,UAAU,KAAA,GAAW,MAAM,KAAK,MAAM,MAAM,aAAa,OAAO;GACtE;GACA,KAAK,MAAM,QAAQ,SAAS,UAAU;IACpC,MAAM,QAAQ,QAAQ,IAAI;IAC1B,IAAI,UAAU,KAAA,KAAa,CAAC,SAAS,KAAK,MAAK,UAAS,QAAQ,KAAK,MAAM,QAAQ,IAAI,CAAC,GACtF,MAAM,KAAK,MAAM,MAAM,QAAQ,OAAO;GAC1C;EACF,CAAC;EACD,OAAO,MAAM,KAAK,IAAI;CACxB;AACF"}
|
|
1
|
+
{"version":3,"file":"index.js","names":["Metadata"],"sources":["../src/index.ts"],"sourcesContent":["/**\n * `foldkit-surface` — the observation boundary for a Foldkit application.\n *\n * A Surface is a pure projection of the Model: it declares which fields a\n * feature reads and which Messages it may construct, from the application's\n * own Schema rather than a second hand-written interface. `foldkit-remote`,\n * `foldkit-sync`, `foldkit-agent`, and `foldkit-mirror` all read this boundary,\n * and `Module` validates that each Model path has one owner.\n *\n * Nothing here runs: the deliverable is the type surface, pinned by\n * `test/inference.test-d.ts`.\n */\nimport { Optic, Option, Predicate, Result, Schema } from 'effect'\nimport type { Html, HtmlBuilder } from 'foldkit/html'\nimport type { MessageUnion } from 'foldkit/message'\nimport type { Entry as ManagedResourceEntry } from 'foldkit/managedResource'\nimport type { Subscriptions } from 'foldkit/subscription'\nimport type * as Update from 'foldkit/update'\nimport type { Url } from 'foldkit/url'\nimport { Metadata, type MetadataSummary } from 'foldkit-metadata'\n\nexport { Metadata, MetadataTypeId, type MetadataKey, type MetadataSummary } from 'foldkit-metadata'\nexport { Diagnostics, type Diagnostic, type ReportDiagnostic } from './diagnostics.js'\nexport {\n CachedRead,\n CacheStore,\n PageReads,\n cachePolicy,\n maxAgeSeconds,\n shorterPolicy,\n type CacheOptions,\n type CachePolicy,\n type WorkersCache,\n} from './edgeCache.js'\n\n// ===========================================================================\n// ModelRef and the typed Model tree (Phase 0 cases 1)\n// ===========================================================================\n\n/**\n * The key a ref keeps its own members under; read them with `ModelRef.focus`.\n * A ref's string keys are the Model's fields, whatever their names (#331),\n * and no Schema field reaches a symbol. `Symbol.for`, so two copies of this\n * package read each other's refs.\n */\nexport const RefTypeId: unique symbol = Symbol.for('foldkit-surface/ModelRef')\n\n/** What a ref points at and how to read and write it: `ModelRef.focus(ref)`. */\nexport interface Focus<Root, Value, Encoded = unknown> {\n /** A pure codec: Foldkit Model fields carry no decoding or encoding services. */\n readonly Schema: Schema.Codec<Value, Encoded, never, never>\n readonly optic: Optic.Optional<Root, Value>\n /** The Model path the ref points at. */\n readonly dependency: readonly string[]\n readonly get: (root: Root) => Value\n readonly set: (root: Root, value: Value) => Root\n /**\n * Focused structural replacement: `set` of `fn` applied to `get`. This\n * delegates through the focus's own `set`, so container-aware setters\n * (`at`/`index` insertion and removal) keep working — never `optic`\n * calls directly. Infrastructure seam, not an application transition.\n */\n readonly modify: (root: Root, fn: (value: Value) => Value) => Root\n}\n\n/**\n * A reference to a place in the Model. Its string keys are the fields below\n * it; its own members are its `Focus`, read with `ModelRef.focus`.\n */\nexport interface ModelRef<Root, Value, Encoded = unknown> {\n readonly [RefTypeId]: Focus<Root, Value, Encoded>\n}\n\n/**\n * A `ModelRef` generated for a named Model field. `key` is the literal field\n * name, so a reference-based selection can infer its output keys without a\n * parallel field registry or string paths.\n */\nexport interface FieldRef<\n Root,\n Value,\n Key extends string = string,\n Encoded = unknown,\n> extends ModelRef<Root, Value, Encoded> {\n readonly [RefTypeId]: Focus<Root, Value, Encoded> & {\n readonly key: Key\n /** The application definition this field was generated from. */\n readonly owner: object\n }\n}\n\nconst makeFocus = <Root, Value>(\n Schema: Schema.Codec<Value, unknown, never, never>,\n optic: Optic.Optional<Root, Value>,\n dependency: readonly string[],\n get: (root: Root) => Value,\n set: (root: Root, value: Value) => Root,\n): Focus<Root, Value> => ({\n Schema,\n optic,\n dependency,\n get,\n set,\n modify: (root, fn) => set(root, fn(get(root))),\n})\n\nexport const ModelRef = {\n /**\n * Low-level escape hatch for a focus with no Model path of its own. Prefer\n * the `App.model` tree; use this for an optic that is not part of the Model.\n */\n fromOptic: <Root, Value>(\n Schema: Schema.Schema<Value>,\n optic: Optic.Optional<Root, Value>,\n dependency: readonly string[] = [],\n ): ModelRef<Root, Value> => ({\n [RefTypeId]: makeFocus(\n Schema as unknown as Schema.Codec<Value, unknown, never, never>,\n optic,\n dependency,\n root => Result.getOrThrow(optic.getResult(root)),\n (root, value) => optic.replace(value, root),\n ),\n }),\n /**\n * A ref's own members: where it points, how to read and write it, and, as\n * its value allows, `at` (a record), `index` (an array) and `select`. They\n * are kept apart from the ref's string keys, which are the Model's fields.\n */\n focus: <R extends { readonly [RefTypeId]: object }>(ref: R): R[typeof RefTypeId] =>\n ref[RefTypeId],\n /** Whether a value is a ref, as opposed to a Projection or a plain object. */\n is: (value: unknown): value is ModelRef<unknown, unknown> =>\n typeof value === 'object' && value !== null && RefTypeId in value,\n}\n\nexport type RefTree<Root, F extends Schema.Struct.Fields> = {\n readonly [K in keyof F & string]: RefNode<Root, F[K], K>\n}\n\n/** A ref whose focus can `select` a Projection of its value. */\nexport interface Selects<Root, Value> {\n readonly [RefTypeId]: {\n readonly select: <P>(projection: Projection<Value, P>) => Projection<Root, P>\n }\n}\n\n/** A ref to an optional value, whose focus selects inside the Option. */\nexport interface SelectsSome<Root, Inner> {\n readonly [RefTypeId]: {\n readonly select: <P>(projection: Projection<Inner, P>) => Projection<Root, Option.Option<P>>\n }\n}\n\n/** A ref to an array, whose focus reaches an item: `ModelRef.focus(ref).index(0)`. */\nexport interface Indexes<Root, Item> {\n readonly [RefTypeId]: {\n readonly index: (index: number) => OptionalRef<Root, Option.Option<Item>>\n }\n}\n\n/** A ref to a record, whose focus reaches an entry: `ModelRef.focus(ref).at(key)`. */\nexport interface Entries<Root, Key extends string, Value> {\n readonly [RefTypeId]: {\n readonly at: (key: Key) => OptionalRef<Root, Option.Option<Value>>\n }\n}\n\n// Tuple-wrapped so the conditional is *non-distributive*: without it,\n// `Value = Option<V>` distributes over `None | Some<V>` and `select` would\n// return a union of two unrelated projections.\ntype Select<Root, Value> = [Value] extends [Option.Option<infer Inner>]\n ? SelectsSome<Root, Inner>\n : Selects<Root, Value>\n\ntype Selectable<Root, Value, Key extends string, Encoded = unknown> = FieldRef<\n Root,\n Value,\n Key,\n Encoded\n> &\n Select<Root, Value>\n\n/**\n * A dynamic focus from `at`/`index`. Deliberately not a `FieldRef`: its key is\n * a record key or index, not a Model field, so a static `Projection.pick`\n * cannot infer a field name from it.\n */\nexport type OptionalRef<Root, Value> = ModelRef<Root, Value> & Select<Root, Value>\n\ntype RefNode<Root, S, Key extends string> =\n S extends Schema.Codec<infer A, infer Encoded, any, any>\n ? S extends Schema.Struct<infer F>\n ? Selectable<Root, A, Key, Encoded> & RefTree<Root, F>\n : A extends ReadonlyArray<infer E>\n ? Selectable<Root, A, Key, Encoded> & Indexes<Root, E>\n : A extends Readonly<Record<infer K extends string, infer V>>\n ? Selectable<Root, A, Key, Encoded> & Entries<Root, K, V>\n : Selectable<Root, A, Key, Encoded>\n : never\n\ntype AnySchema = Schema.Codec<unknown, unknown>\n\n// A key may be a stored id (`at(id)`), so only the container's own keys count.\nfunction propertyReader(root: unknown, key: string): unknown {\n return root === null || root === undefined || !Object.hasOwn(root, key)\n ? undefined\n : (root as Record<string, unknown>)[key]\n}\n\nfunction optionalReader(value: unknown): Option.Option<unknown> {\n return value === undefined ? Option.none() : Option.some(value)\n}\n\n/** Reads the tag off a Foldkit Message constructor without constructing one. */\nconst messageTag = (constructor: unknown): string | undefined => {\n const literal = (constructor as { fields?: { _tag?: { ast?: { literal?: unknown } } } }).fields\n ?._tag?.ast?.literal\n return typeof literal === 'string' ? literal : undefined\n}\n\n/** Whether a Message, of an application this cannot name, has one of `tags`. */\nconst hasTagIn = (tags: ReadonlySet<string>, message: unknown): boolean =>\n Predicate.hasProperty(message, '_tag') &&\n typeof message._tag === 'string' &&\n tags.has(message._tag)\n\n/** The tags of the Messages a Surface lists in `messages`. */\nconst messageTags = (surface: { readonly messages: readonly unknown[] }): ReadonlyArray<string> =>\n surface.messages.map(messageTag).filter((tag): tag is string => tag !== undefined)\n\nfunction makeTree(\n schema: AnySchema,\n path: readonly string[],\n optic: Optic.Optional<unknown, unknown>,\n get: (root: unknown) => unknown,\n optional = false,\n set: ((root: unknown, value: unknown) => unknown) | undefined,\n owner: object,\n): Record<string, unknown> {\n const erasedOptic = optic as {\n key(key: string): Optic.Optional<unknown, unknown>\n at(key: string): Optic.Optional<unknown, unknown>\n }\n // `Optic.at` cannot *insert* or *remove* an absent key (`replace` is a no-op\n // when the prism fails), so optional foci get container-aware setters below.\n const setFocus = set ?? ((root: unknown, value: unknown): unknown => optic.replace(value, root))\n const focus: Record<string, unknown> = {\n ...makeFocus(schema as never, optic, path, get, setFocus),\n key: path[path.length - 1] ?? '',\n owner,\n }\n const node: Record<PropertyKey, unknown> = { [RefTypeId]: focus }\n\n const fields = (schema as { readonly fields?: Schema.Struct.Fields }).fields\n if (fields !== undefined) {\n for (const key of Object.keys(fields)) {\n // Defined, not assigned: assigning `__proto__` would set the prototype.\n Object.defineProperty(node, key, {\n value: makeTree(\n fields[key] as AnySchema,\n [...path, key],\n erasedOptic.key(key),\n root => propertyReader(get(root), key),\n false,\n undefined,\n owner,\n ),\n enumerable: true,\n writable: true,\n configurable: true,\n })\n }\n }\n\n focus.at = (key: string) =>\n makeTree(\n schema,\n [...path, key],\n erasedOptic.at(key),\n root => optionalReader(propertyReader(get(root), key)),\n true,\n (root, value) => {\n const container = get(root) as Record<string, unknown>\n const option = value as Option.Option<unknown>\n if (Option.isSome(option)) {\n return setFocus(root, { ...container, [key]: option.value })\n }\n const { [key]: _removed, ...rest } = container\n return setFocus(root, rest)\n },\n owner,\n )\n focus.index = (index: number) =>\n makeTree(\n schema,\n [...path, String(index)],\n optic,\n root =>\n optionalReader(\n Array.isArray(get(root)) ? (get(root) as ReadonlyArray<unknown>)[index] : undefined,\n ),\n true,\n (root, value) => {\n const array = (Array.isArray(get(root)) ? get(root) : []) as ReadonlyArray<unknown>\n const option = value as Option.Option<unknown>\n const next = Option.isSome(option)\n ? array.map((item, i) => (i === index ? option.value : item))\n : array.filter((_, i) => i !== index)\n return setFocus(root, next)\n },\n owner,\n )\n focus.select = (projection: Projection<unknown, unknown>) => {\n const dependencies = mergeDependencies([path, ...projection.dependencies])\n return optional\n ? makeProjection(\n Schema.Option(projection.Model),\n dependencies,\n root => Option.map(get(root) as Option.Option<unknown>, value => projection.read(value)),\n projection.metadata,\n )\n : makeProjection(\n projection.Model,\n dependencies,\n root => projection.read(get(root)),\n projection.metadata,\n )\n }\n return node\n}\n\n// ===========================================================================\n// Projection (Phase 0 case 2)\n// ===========================================================================\n\nexport type DependencyTree = readonly (readonly string[])[]\n\n/** Unions dependency trees, dropping duplicates; the result is a set. */\nfunction mergeDependencies(dependencies: DependencyTree): DependencyTree {\n const seen = new Set<string>()\n const merged: (readonly string[])[] = []\n for (const dependency of dependencies) {\n const key = dependency.join('\\u0000')\n if (seen.has(key)) continue\n seen.add(key)\n merged.push(dependency)\n }\n return merged\n}\n\nexport interface Projection<Root, Value> {\n readonly Model: Schema.Codec<Value, unknown>\n readonly dependencies: DependencyTree\n /** Interpreter-owned facts about this node and everything it composes. */\n readonly metadata: Metadata\n readonly read: (root: Root) => Value\n}\n\n/**\n * A projection Surface can install back into a Model. Public reads use the\n * read-only `Projection`; only a writable selection carries installation.\n * `set` writes exactly the declared fields, so an excess field in an untrusted\n * value cannot reach local state.\n */\nexport interface WritableProjection<Model, Fields extends Schema.Struct.Fields> {\n readonly schema: Schema.Struct<Fields>\n readonly dependencies: DependencyTree\n readonly get: (model: Model) => Schema.Struct.Type<Fields>\n readonly set: (model: Model, shared: Schema.Struct.Type<Fields>) => Model\n}\n\nfunction makeProjection<Value>(\n Model: Schema.Codec<Value, unknown>,\n dependencies: DependencyTree,\n read: (root: unknown) => Value,\n metadata: Metadata = Metadata.empty,\n): Projection<unknown, Value> {\n return { Model, dependencies, metadata, read }\n}\n\n/**\n * `Schema.Struct({})` is not an empty-object schema: it accepts `{foo:1}`, `[]`,\n * and `\"str\"` even with `onExcessProperty: 'error'`. A genuinely empty selection\n * needs a `never`-valued record.\n */\nfunction objectSchema(fields: Record<string, AnySchema>): AnySchema {\n return Object.keys(fields).length === 0\n ? Schema.Record(Schema.String, Schema.Never)\n : Schema.Struct(fields)\n}\n\ntype OfSelection<F extends Schema.Struct.Fields> = {\n readonly [K in keyof F]?: true | Projection<Schema.Schema.Type<F[K]>, unknown>\n}\n\ntype OfValue<F extends Schema.Struct.Fields, Sel> = {\n readonly [K in keyof Sel & keyof F]: Sel[K] extends true\n ? Schema.Schema.Type<F[K]>\n : Sel[K] extends Projection<any, infer V>\n ? V\n : never\n}\n\ntype EntryValue<E> =\n E extends Projection<any, infer V> ? V : E extends ModelRef<any, infer V> ? V : never\n\ntype EntryRoot<E> =\n E extends Projection<infer R, any> ? R : E extends ModelRef<infer R, any> ? R : never\n\ntype EntryRoots<Entries> = { readonly [K in keyof Entries]: EntryRoot<Entries[K]> }\n\n/** `true` when the union has more than one member. Used to reject mixed roots. */\ntype IsUnion<T, U = T> = [T] extends [never]\n ? false\n : T extends unknown\n ? [U] extends [T]\n ? false\n : true\n : never\n\ntype StructValue<Entries> = {\n readonly [K in keyof Entries]: EntryValue<Entries[K]>\n} extends infer Value\n ? { readonly [K in keyof Value]: Value[K] }\n : never\n\n// What reads something no path of its own names: a Remote read, named by its\n// metadata, declares no path, and a Projection composing one declares only its\n// other parts' paths. `derive` cannot skip a read of either. A set, not a\n// field, since only a derivation asks.\nconst readsUnnamed = new WeakSet<object>()\n\nconst unnamed = (entry: { readonly dependencies: DependencyTree }): boolean =>\n entry.dependencies.length === 0 || readsUnnamed.has(entry)\n\nconst markedBy = <P extends object>(\n composed: P,\n parts: ReadonlyArray<{ readonly dependencies: DependencyTree }>,\n): P => {\n if (parts.some(unnamed)) readsUnnamed.add(composed)\n return composed\n}\n\n/** A value derived from the Model and the paths it reads: what `Projection.derive` makes. */\nexport interface Derived<Root, Value> {\n readonly dependencies: DependencyTree\n readonly read: (root: Root) => Value\n}\n\nconst valueAt = (root: unknown, path: ReadonlyArray<string>): unknown => {\n let value = root\n for (const key of path) {\n if (typeof value !== 'object' || value === null) return undefined\n value = (value as Record<string, unknown>)[key]\n }\n return value\n}\n\n// The earlier value when the new one holds the same fields: a struct is a new record every time.\nconst keepAlike = <Value>(before: Value, value: Value): Value =>\n sameFields(before, value) ? before : value\n\nconst sameFields = (left: unknown, right: unknown): boolean => {\n if (Object.is(left, right)) return true\n if (typeof left !== 'object' || typeof right !== 'object' || left === null || right === null)\n return false\n const prototype = Object.getPrototypeOf(left)\n const plain = prototype === Object.prototype || prototype === null || Array.isArray(left)\n if (!plain || Object.getPrototypeOf(right) !== prototype) return false\n // Object.keys omits `length`, so two sparse arrays can share every key.\n if (Array.isArray(left) && left.length !== (right as ReadonlyArray<unknown>).length) return false\n const keys = Object.keys(left)\n return (\n keys.length === Object.keys(right).length &&\n keys.every(\n key =>\n Object.hasOwn(right, key) &&\n Object.is((left as Record<string, unknown>)[key], (right as Record<string, unknown>)[key]),\n )\n )\n}\n\nexport const Projection = {\n of:\n <F extends Schema.Struct.Fields>(schema: Schema.Struct<F>) =>\n <const Sel extends OfSelection<F>>(\n selection: Sel,\n ): Projection<Schema.Struct.Type<F>, OfValue<F, Sel>> => {\n // No prototype, so a field named `__proto__` stays a key (see `struct`).\n const picked: Record<string, AnySchema> = Object.create(null)\n const dependencies: (readonly string[])[] = []\n const metadata: Metadata[] = []\n // A field picked with `true` declares no path of its own.\n const parts: { readonly dependencies: DependencyTree }[] = []\n const readers: (readonly [string, (root: unknown) => unknown])[] = []\n\n for (const key of Object.keys(selection)) {\n const choice = (selection as Record<string, unknown>)[key]\n if (choice === true) {\n picked[key] = schema.fields[key] as AnySchema\n parts.push({ dependencies: [] })\n readers.push([key, root => propertyReader(root, key)])\n } else {\n const nested = choice as Projection<unknown, unknown>\n picked[key] = nested.Model\n dependencies.push(...nested.dependencies)\n metadata.push(nested.metadata)\n parts.push(nested)\n readers.push([key, root => nested.read(propertyReader(root, key))])\n }\n }\n\n const read = (root: unknown): unknown => {\n const out: Record<string, unknown> = Object.create(null)\n for (const [key, reader] of readers) out[key] = reader(root)\n return out\n }\n return markedBy(\n makeProjection(\n objectSchema(picked),\n mergeDependencies(dependencies),\n read,\n Metadata.combine(metadata),\n ),\n parts,\n ) as unknown as Projection<Schema.Struct.Type<F>, OfValue<F, Sel>>\n },\n\n struct: <const Entries extends Record<string, Projection<any, any> | ModelRef<any, any>>>(\n entries: Entries & (IsUnion<EntryRoots<Entries>[keyof Entries]> extends true ? never : unknown),\n ): Projection<EntryRoot<Entries[keyof Entries]>, StructValue<Entries>> => {\n // Keys may be stored ids (a page's node ids), so `__proto__` must stay a key.\n const picked: Record<string, AnySchema> = Object.create(null)\n const dependencies: (readonly string[])[] = []\n const metadata: Metadata[] = []\n const nesteds: Projection<unknown, unknown>[] = []\n const readers: (readonly [string, (root: unknown) => unknown])[] = []\n\n for (const key of Object.keys(entries)) {\n const entry = entries[key] as Projection<unknown, unknown> | ModelRef<unknown, unknown>\n if (ModelRef.is(entry)) {\n const focus = entry[RefTypeId]\n picked[key] = focus.Schema\n dependencies.push(focus.dependency)\n readers.push([key, focus.get])\n } else {\n picked[key] = entry.Model\n dependencies.push(...entry.dependencies)\n metadata.push(entry.metadata)\n nesteds.push(entry)\n readers.push([key, entry.read])\n }\n }\n\n const read = (root: unknown): unknown => {\n const out: Record<string, unknown> = Object.create(null)\n for (const [key, reader] of readers) out[key] = reader(root)\n return out\n }\n return markedBy(\n makeProjection(\n objectSchema(picked),\n mergeDependencies(dependencies),\n read,\n Metadata.combine(metadata),\n ),\n nesteds,\n ) as unknown as Projection<EntryRoot<Entries[keyof Entries]>, StructValue<Entries>>\n },\n\n /**\n * Maps a Projection over an array: `array(p): Projection<ReadonlyArray<Root>,\n * ReadonlyArray<Value>>`. Nesting is explicit (an array of arrays stays an\n * array of arrays); there is no flatten or double-wrap.\n */\n array: <Root, Value>(\n projection: Projection<Root, Value>,\n ): Projection<ReadonlyArray<Root>, ReadonlyArray<Value>> =>\n markedBy(\n {\n Model: Schema.Array(projection.Model),\n dependencies: projection.dependencies,\n metadata: projection.metadata,\n read: root => root.map(value => projection.read(value)),\n },\n [projection],\n ),\n\n /** Maps a Projection inside an Option, preserving absence. */\n option: <Root, Value>(\n projection: Projection<Root, Value>,\n ): Projection<Option.Option<Root>, Option.Option<Value>> =>\n markedBy(\n {\n Model: Schema.Option(projection.Model),\n dependencies: projection.dependencies,\n metadata: projection.metadata,\n read: root => Option.map(root, value => projection.read(value)),\n },\n [projection],\n ),\n\n read: <Root, Value>(projection: Projection<Root, Value>, root: Root): Value =>\n projection.read(root),\n\n /**\n * Low-level escape hatch: a Projection from a Schema and a reader, for\n * projections not derived from ModelRefs (agent context, adapters). Prefer\n * `of`/`struct`/`select`; dependencies default to empty.\n */\n fromReader: <Root, Value>(\n Model: Schema.Codec<Value, unknown>,\n read: (root: Root) => Value,\n options?: {\n readonly dependencies?: DependencyTree\n readonly metadata?: Metadata\n },\n ): Projection<Root, Value> => ({\n Model,\n dependencies: options?.dependencies ?? [],\n metadata: options?.metadata ?? Metadata.empty,\n read,\n }),\n\n /**\n * A value worked out from the Model, and worked out again only when a value\n * at a path it reads is a new object: the value counterpart of\n * `foldkit-mixins`' `SlotView.region`, and what a region can be drawn from.\n * `on` names what `derive` reads, as field references or Projections;\n * `derive` must read nothing else, or it shows what it read last. While\n * something in `on` reads what no path of its names (a Remote read, alone or\n * inside a `struct`), the value is worked out on every read. A result with\n * the same fields as the last, shallowly, gives the last back, so a memo\n * keyed on it holds. It keeps one result: the one for the last Model it was\n * given.\n *\n * @example\n * ```ts\n * const shown = Projection.derive([App.model.todos, App.model.filter], (model: Model) =>\n * model.todos.filter(todo => model.filter === 'all' || todo.done === (model.filter === 'done')),\n * )\n * // In the view: shown.read(model)\n * ```\n */\n derive: <Root, Value>(\n on: ReadonlyArray<ModelRef<Root, any> | { readonly dependencies: DependencyTree }>,\n derive: (root: Root) => Value,\n ): Derived<Root, Value> => {\n if (on.length === 0) {\n throw new Error(\n 'Projection.derive: it names nothing it reads, so nothing could tell it to work the value out again. Name field references, or Projections built from them.',\n )\n }\n const parts = on.map(entry =>\n RefTypeId in entry ? { dependencies: [entry[RefTypeId].dependency] } : entry,\n )\n const dependencies = mergeDependencies(parts.flatMap(part => part.dependencies))\n // No path changes when what such a read reads does, so none can skip it.\n const always = parts.some(unnamed)\n let last: { readonly values: ReadonlyArray<unknown>; readonly value: Value } | undefined\n const derived: Derived<Root, Value> = {\n dependencies,\n read: root => {\n const values = dependencies.map(path => valueAt(root, path))\n const before = last\n const value =\n before === undefined\n ? derive(root)\n : !always && values.every((value, index) => Object.is(value, before.values[index]))\n ? before.value\n : keepAlike(before.value, derive(root))\n last = { values, value }\n return value\n },\n }\n if (always) readsUnnamed.add(derived)\n return derived\n },\n\n /**\n * Derives a writable projection from generated Model field references:\n * `Projection.pick(App.model.todos, App.model.selectedTodoId)` infers\n * `{ todos, selectedTodoId }` and its codec. Every reference must share one\n * Root; a raw optic or an unrelated application is rejected. Repeated\n * identical members deduplicate; a conflicting definition throws.\n */\n pick: <const Refs extends readonly FieldRef<any, any, string>[]>(\n ...refs: Refs & (IsUnion<RefRoots<Refs>[number]> extends true ? never : unknown)\n ): WritableProjection<RefRoots<Refs>[number], PickFields<Refs>> => {\n const selected = refs.map(ref => ref[RefTypeId])\n // Two applications can have structurally identical Models, so the root type\n // check cannot separate them; the owner token can.\n const owner = selected[0]?.owner\n for (const focus of selected) {\n if (focus.owner !== owner) {\n throw new Error('Projection.pick: references from different applications')\n }\n }\n // A picked field is named by its last key alone, so two fields at\n // different paths with the same name would be one field: `get` would keep\n // one value and `set` would write it into both. The same field picked twice\n // is harmless and kept once; two different ones are refused here.\n // No prototype: a field named `constructor` must not read as already picked.\n const fields: Record<string, AnySchema> = Object.create(null)\n const paths: Record<string, string> = Object.create(null)\n for (const focus of [...selected]) {\n const path = focus.dependency.join('.')\n const existing = paths[focus.key]\n if (existing !== undefined) {\n if (existing === path) {\n selected.splice(selected.indexOf(focus), 1)\n continue\n }\n throw new Error(\n `Projection.pick: \"${existing}\" and \"${path}\" would both be read as \"${focus.key}\". Pick them in separate projections.`,\n )\n }\n paths[focus.key] = path\n fields[focus.key] = focus.Schema\n }\n return {\n schema: objectSchema(fields) as never,\n dependencies: mergeDependencies(selected.map(focus => focus.dependency)),\n get: model => {\n const out: Record<string, unknown> = Object.create(null)\n for (const focus of selected) out[focus.key] = focus.get(model as never)\n return out as never\n },\n set: (model, shared) => {\n let next = model\n for (const focus of selected)\n next = focus.set(next as never, (shared as Record<string, unknown>)[focus.key] as never)\n return next\n },\n }\n },\n\n /**\n * Merges disjoint writable projections into one: `Projection.compose(Todos,\n * Selection)`. Every projection must own the same Model; a field defined twice\n * with a different codec throws, while an identical definition deduplicates.\n * `set` installs each part, so composed fields keep their own write behaviour.\n */\n compose: <const Ps extends readonly WritableProjection<any, any>[]>(\n ...projections: Ps & (IsUnion<ProjectionModel<Ps[number]>> extends true ? never : unknown)\n ): WritableProjection<ProjectionModel<Ps[number]>, MergeFields<Ps>> => {\n const parts = [...projections]\n const fields: Record<string, AnySchema> = Object.create(null)\n // Where each field is read from, where the part says: a dependency path\n // ending in the field's name. The same name from two different paths is two\n // fields that would be read as one, as in `pick`.\n const paths: Record<string, string> = Object.create(null)\n const pathOf = (part: (typeof parts)[number], key: string): string | undefined =>\n part.dependencies.find(dependency => dependency.at(-1) === key)?.join('.')\n for (const part of parts) {\n for (const [key, codec] of Object.entries(part.schema.fields)) {\n const existing = fields[key]\n const path = pathOf(part, key)\n if (existing !== undefined) {\n const previous = paths[key]\n if (previous !== undefined && path !== undefined && previous !== path) {\n throw new Error(\n `Projection.compose: \"${previous}\" and \"${path}\" would both be read as \"${key}\"`,\n )\n }\n if (existing === codec) continue\n throw new Error(`Projection.compose: conflicting definitions for \"${key}\"`)\n }\n fields[key] = codec as AnySchema\n if (path !== undefined) paths[key] = path\n }\n }\n return {\n schema: objectSchema(fields) as never,\n dependencies: mergeDependencies(parts.flatMap(part => [...part.dependencies])),\n get: model => {\n const out: Record<string, unknown> = Object.create(null)\n for (const part of parts) Object.assign(out, part.get(model as never))\n return out as never\n },\n set: (model, shared) => {\n let next = model\n // Each part reads only its own fields from the merged value.\n for (const part of parts) next = part.set(next as never, shared as never)\n return next\n },\n }\n },\n}\n\n// ===========================================================================\n// Surface (Phase 0 case 3)\n// ===========================================================================\n\nexport interface AppScope<\n Root,\n F extends Schema.Struct.Fields,\n Cases extends Record<string, Schema.Struct.Fields>,\n> {\n readonly Model: Schema.Struct<F>\n readonly Message: MessageUnion<Cases>\n readonly model: RefTree<Root, F>\n /** Identity token shared by this application's references and subsets. */\n readonly owner: object\n}\n\nexport interface SurfaceInspection {\n readonly name: string\n readonly dependencies: DependencyTree\n readonly metadata: readonly MetadataSummary[]\n readonly emits: readonly unknown[]\n}\n\n/**\n * A Surface's params codec: present when the Surface declares params, absent\n * when `Params` is `void`, and possibly either when `Params` is `any`/`unknown`\n * so a params Surface still fits a `Surface<…, any>` position.\n */\nexport type ParamsSchema<Params> = unknown extends Params\n ? Schema.Codec<Params, unknown> | undefined\n : [Params] extends [void]\n ? [void] extends [Params]\n ? // Exactly `void`: no params, no schema.\n undefined\n : // `undefined` also extends `void`, but a Surface may still declare its schema.\n Schema.Codec<Params, unknown> | undefined\n : [void] extends [Params]\n ? // `void | X`: the schema is optional.\n Schema.Codec<Params, unknown> | undefined\n : Schema.Codec<Params, unknown>\n\n/**\n * The params argument of `Surface.read`, `contract` and `inspect`: required\n * unless `undefined` is a params value, as it is for a Surface without params.\n */\ntype ParamsArgument<Params> = undefined extends Params ? [params?: Params] : [params: Params]\n\nexport interface Surface<Root, Model, Message, Params> {\n readonly name: string\n /** Identity token of the application this Surface belongs to. */\n readonly owner: object\n readonly Params: ParamsSchema<Params>\n readonly Message: Schema.Schema<Message>\n readonly messages: readonly unknown[]\n readonly projection: (params: Params) => Projection<Root, Model>\n}\n\n/**\n * A Surface as the Model activates it: its params are a function of the Model\n * (`undefined` while inactive), so its requirements are too. `Surface.at`\n * builds one; a Subscription derives what to fetch, subscribe, and retain\n * from a list of them.\n */\n/**\n * Why a Surface is active, when that is something other than a callback.\n *\n * `Surface.at` takes an arbitrary function of the Model, which is correct and\n * opaque: nothing can say *why* the Surface is on without running it. When\n * activation is a tagged value at a known place — a route, a mode, a\n * selection — `Surface.when` records the place and the tag, and a manifest can\n * be built without evaluating anything.\n */\n/**\n * What `Surface.when` needs of a place in the Model: where it is, and how to\n * read it.\n *\n * A ref whose focus can be read, and deliberately not a whole `ModelRef`.\n * Activation **observes** — it never installs a value — so asking for a\n * writable reference would claim an authority it does not use. It also makes\n * the common case work: a field holding a tagged union is a *union of*\n * `FieldRef`s, one per case, which no single `ModelRef<Root, Value>` accepts.\n */\nexport interface ModelPlace<Root> {\n readonly [RefTypeId]: {\n /** Where the value lives, as `ModelRef.focus(place).dependency` gives it. */\n readonly dependency: readonly string[]\n readonly get: (root: Root) => unknown\n }\n}\n\nexport interface Activation {\n /** The Model path the tagged value lives at, as a focus's `dependency` gives it. */\n readonly path: readonly string[]\n /** The tag the Surface is active under; a Site node reading the viewer waits for one too. */\n readonly tag: string\n}\n\nexport interface ActiveSurface<Root, Model = unknown> {\n readonly name: string\n /** Identity token of the application the Surface belongs to. */\n readonly owner: object\n /** The projection for the params the Model gives; none while the Surface is inactive. */\n readonly projectionOf: (model: Root) => Option.Option<Projection<Root, Model>>\n /** The tags of the Messages the Surface lists in `messages`: what it may send. */\n readonly messages: ReadonlyArray<string>\n /**\n * Present when a tagged value at a known place activates the Surface\n * (`Surface.when`, or a Site node); absent for a bare `Surface.at`.\n */\n readonly activation?: Activation | undefined\n}\n\n/**\n * One Surface definition instantiated with concrete params: the unit a\n * `SurfaceSource` resolves to. `key` distinguishes instances of one Surface\n * (a Composition node id, say); a lone `Surface.at`/`Surface.when` instance\n * is keyed by its Surface name.\n */\nexport interface SurfaceInstance<Root, Model = unknown, Params = unknown> {\n readonly key: string\n readonly surface: Surface<Root, Model, unknown, Params>\n readonly params: Params\n readonly projection: Projection<Root, Model>\n}\n\n/**\n * A source of active Surface instances: what `Data.subscriptions`,\n * `Data.wiring`, `Remote.resume`, an SSR plan, an agent manifest, or DevTools\n * resolves a declaration to. `Surface.at` and `Surface.when` are sources of\n * zero or one instance; `Surface.each` of zero to many.\n */\nexport interface SurfaceSource<Root> {\n readonly name: string\n /** Identity token of the application the Surfaces belong to. */\n readonly owner: object\n /** The tags of the Messages the Surface lists: what an instance may send. */\n readonly messages: ReadonlyArray<string>\n readonly instancesOf: (model: Root) => ReadonlyArray<SurfaceInstance<Root, any, any>>\n}\n\n/**\n * One Surface definition instantiated per item of a parent Surface's Model:\n * `Surface.each` as data. `from` names the prerequisite — the family resolves\n * no instances until the parent is active — so consumers can tell the\n * requirements needed to *discover* instances from the requirements *of* the\n * discovered instances. That distinction is what lets `Data.satisfy` reach a\n * fixed point: first the parent, then what the parent reveals.\n */\nexport interface SurfaceFamily<\n Root,\n ParentModel,\n Model,\n Message,\n Params,\n> extends SurfaceSource<Root> {\n readonly from: ActiveSurface<Root, ParentModel>\n readonly child: Surface<Root, Model, Message, Params>\n /** The tags of the Messages the child Surface lists: what an instance may send. */\n readonly messages: ReadonlyArray<string>\n}\n\ndeclare const invalid: unique symbol\n\n/**\n * A compile-time failure that names its cause. Intersected onto a parameter\n * type when a type-level check fails, so the error reads as one line\n * (`Property '[invalid]' is missing … required in type 'Invalid<\"…\">'`)\n * naming the descriptor, instead of a wall of structural mismatch.\n */\nexport interface Invalid<Message extends string> {\n readonly [invalid]: Message\n}\n\n/** The fields of a `Schema.Struct`, or a schema, where params are declared. */\ntype ParamsShape = Schema.Struct.Fields | Schema.Top\n\ntype ParamsOf<P> = P extends Schema.Top\n ? Schema.Schema.Type<P>\n : P extends Schema.Struct.Fields\n ? Schema.Struct.Type<P>\n : void\n\n/** What a Surface's `model` may return: a Projection, or an object of Projections and refs to lift. */\ntype ModelShape<Root> =\n | Projection<Root, unknown>\n | Record<string, Projection<Root, any> | ModelRef<Root, any>>\n\ntype ModelOf<Root, R> = R extends Projection<Root, infer M> ? M : StructValue<R>\n\nconst isProjection = (value: unknown): value is Projection<unknown, unknown> =>\n typeof value === 'object' &&\n value !== null &&\n typeof (value as { read?: unknown }).read === 'function' &&\n Metadata.is((value as { metadata?: unknown }).metadata)\n\ntype MsgOf<Ms extends readonly unknown[]> = {\n readonly [K in keyof Ms]: Ms[K] extends (...args: never[]) => infer M ? M : never\n}[number]\n\n/** The union of Messages a tuple of constructors produces. */\ntype SubsetOf<Ms extends readonly unknown[]> = Ms[number] extends (...args: never[]) => infer M\n ? M\n : never\n\ntype AppMessage<Cases extends Record<string, Schema.Struct.Fields>> = Schema.Schema.Type<\n MessageUnion<Cases>\n>\n\n/** A Message constructor whose produced Message belongs to the App's universe. */\ntype MessageConstructor<Cases extends Record<string, Schema.Struct.Fields>> = (\n ...args: never[]\n) => AppMessage<Cases>\n\n/**\n * The renderer's builder: the real `HtmlBuilder` with its private\n * `MessageUniverse` phantom removed, so the renderer's `OnClick` accepts only\n * the Surface's Message subset. `HtmlBuilder<M>` stays invariant even without\n * the phantom (`OnClick` returns `{ message: M }`), so a superset builder is\n * not assignable to this; `Surface.view` casts, which is sound because the\n * renderer can only construct subset Messages and the real builder accepts the\n * superset.\n */\ntype ViewBuilder<Message> = Omit<HtmlBuilder<Message>, keyof HtmlBuilder<never> & symbol>\n\n/** A renderer for a Surface's projected Model, with its Message set narrowed. */\nexport type Renderer<Model, Message> = (model: Model, h: ViewBuilder<Message>) => Html\n\n/** `unknown` when `Sub` is a subtype of `Super`, `never` otherwise. */\ntype Subset<Sub, Super> = [Sub] extends [Super] ? unknown : never\n\ntype RefRoot<R> = R extends ModelRef<infer Root, any> ? Root : never\n\ntype RefRoots<Refs extends readonly unknown[]> = {\n readonly [K in keyof Refs]: RefRoot<Refs[K]>\n}\n\n/** The struct fields a reference selection produces, keyed by each ref's field. */\ntype PickFields<Refs extends readonly FieldRef<any, any, string>[]> = {\n readonly [R in Refs[number] as R[typeof RefTypeId]['key']]: R[typeof RefTypeId]['Schema']\n}\n\ntype ProjectionModel<P> = P extends WritableProjection<infer M, any> ? M : never\n\ntype ProjectionFields<P> = P extends WritableProjection<any, infer F> ? F : never\n\ntype Merge2<A, B> = {\n readonly [K in keyof A | keyof B]: K extends keyof A ? A[K] : K extends keyof B ? B[K] : never\n}\n\n/** Merges the fields of several projections; an overlapping key is rejected at runtime. */\nexport type MergeFields<Ps extends readonly WritableProjection<any, any>[]> = Ps extends readonly [\n infer Head extends WritableProjection<any, any>,\n ...infer Tail extends readonly WritableProjection<any, any>[],\n]\n ? Merge2<ProjectionFields<Head>, MergeFields<Tail>>\n : {}\n\n/**\n * An application definition: the Model and Message schemas and the generated\n * field references. It is data, not a running instance, so it can be inspected\n * without mounting anything. Context, replication, and validation all read the\n * same `App.model` references.\n */\nexport interface Application<\n Root,\n F extends Schema.Struct.Fields,\n Cases extends Record<string, Schema.Struct.Fields>,\n> extends AppScope<Root, F, Cases> {\n /**\n * @deprecated Use `App.model`, the same references under the name the rest\n * of the API uses: `App.surface` hands a Surface `{ model }`, and\n * `Remote.make` and `Editor.at` take `model: App.model.…`. Removed in a\n * later minor.\n */\n readonly fields: RefTree<Root, F>\n /**\n * `Surface.make` with the mechanical wrappers lifted: `params` are the\n * fields of a `Schema.Struct` (or a schema), and `model` may return an\n * object of Projections and refs, which becomes `Projection.struct`.\n */\n readonly surface: <\n const Params extends ParamsShape | undefined = undefined,\n Shape extends ModelShape<Root> = Projection<Root, unknown>,\n const Ms extends readonly MessageConstructor<Cases>[] = readonly [],\n >(\n name: string,\n config: {\n readonly params?: Params\n readonly model: (context: {\n readonly model: RefTree<Root, F>\n readonly params: ParamsOf<Params>\n }) => Shape\n readonly messages?: Ms\n },\n ) => Surface<Root, ModelOf<Root, Shape>, MsgOf<Ms>, ParamsOf<Params>>\n /**\n * This application made runnable, once its update exists: the same\n * references and the same owner, with the initial Model and the transition\n * function a replicator replays. An update is often built from what is made\n * over the references (a Remote domain, a placed Bundle), so it cannot be\n * given when they are; this joins the two without a second application,\n * whose references would be another owner's.\n */\n readonly runnable: <Resources = never>(config: {\n readonly initial: Root\n readonly update: (\n model: Root,\n message: Schema.Schema.Type<MessageUnion<Cases>>,\n ) => Update.Return<Root, Schema.Schema.Type<MessageUnion<Cases>>, Resources>\n }) => RunnableApplication<Root, F, Cases, Resources>\n}\n\n/**\n * An `Application` that also carries the initial Model and the transition\n * function, so a replicator can derive the initial shared value and replay.\n * `Resources` is whatever `update`'s Commands need.\n */\nexport interface RunnableApplication<\n Root,\n F extends Schema.Struct.Fields,\n Cases extends Record<string, Schema.Struct.Fields>,\n Resources = never,\n> extends Application<Root, F, Cases> {\n readonly initial: Root\n readonly update: (\n model: Root,\n message: Schema.Schema.Type<MessageUnion<Cases>>,\n ) => Update.Return<Root, Schema.Schema.Type<MessageUnion<Cases>>, Resources>\n}\n\ndeclare const messageSubsetRoot: unique symbol\n\n/**\n * A typed subset of one application's Messages: the selected constructors, a\n * codec for exactly those variants, and a runtime membership test. Surface does\n * not label a subset agent-visible, durable, or presence; `Agent` and `Sync`\n * attach their own policy to the same value.\n */\n/** The union of encoded types a tuple of constructor schemas produces. */\ntype SubsetEncoded<Ms extends readonly unknown[]> =\n Ms[number] extends Schema.Codec<any, infer Encoded, any, any> ? Encoded : never\n\nexport interface MessageSet<\n Root,\n Message,\n Subset extends Message,\n Ms extends readonly ((...args: never[]) => Message)[],\n Cases extends Record<string, Schema.Struct.Fields> = Record<string, Schema.Struct.Fields>,\n Encoded = unknown,\n> {\n /** Phantom owner, so a subset cannot be crossed between applications. */\n readonly [messageSubsetRoot]?: Root\n /** The application identity token, checked when subsets compose. */\n readonly owner: object\n readonly constructors: Ms\n /** A pure codec for exactly the selected variants. */\n readonly schema: Schema.Codec<Subset, Encoded, never, never>\n readonly tags: ReadonlySet<string>\n readonly includes: (message: Message) => message is Subset\n}\n\nconst makeScope = <\n F extends Schema.Struct.Fields,\n Cases extends Record<string, Schema.Struct.Fields>,\n>(config: {\n readonly Model: Schema.Struct<F>\n readonly Message: MessageUnion<Cases>\n}): AppScope<Schema.Struct.Type<F>, F, Cases> => {\n // One token per application, so a selection cannot silently mix two\n // applications whose Models happen to be structurally identical.\n const owner: object = {}\n return {\n Model: config.Model,\n Message: config.Message,\n owner,\n model: makeTree(\n // A generic `F` hides the Struct's services; a Foldkit Model is pure.\n config.Model as unknown as AnySchema,\n [],\n Optic.id(),\n root => root,\n false,\n undefined,\n owner,\n ) as unknown as RefTree<Schema.Struct.Type<F>, F>,\n }\n}\n\n/**\n * Captures an application's pure references once. `initial` and `update` are\n * optional: an agent needs only the Model, Message, and field references, while\n * a replicator needs them to derive the initial shared value and replay. A\n * `RunnableApplication` is returned when both are supplied.\n */\nfunction application<\n F extends Schema.Struct.Fields,\n Cases extends Record<string, Schema.Struct.Fields>,\n Resources = never,\n ManagedResourceServices = never,\n>(config: {\n readonly Model: Schema.Struct<F>\n readonly Message: MessageUnion<Cases>\n readonly initial: Schema.Struct.Type<F>\n readonly update: (\n model: Schema.Struct.Type<F>,\n message: Schema.Schema.Type<MessageUnion<Cases>>,\n ) => Update.Return<\n Schema.Struct.Type<F>,\n Schema.Schema.Type<MessageUnion<Cases>>,\n Resources | ManagedResourceServices\n >\n}): RunnableApplication<Schema.Struct.Type<F>, F, Cases, Resources | ManagedResourceServices>\nfunction application<\n F extends Schema.Struct.Fields,\n Cases extends Record<string, Schema.Struct.Fields>,\n>(config: {\n readonly Model: Schema.Struct<F>\n readonly Message: MessageUnion<Cases>\n}): Application<Schema.Struct.Type<F>, F, Cases>\nfunction application(config: any): any {\n const scope = makeScope(config)\n const surface = (\n name: string,\n surfaceConfig: {\n readonly params?: ParamsShape | undefined\n readonly model: (context: { readonly model: unknown; readonly params: unknown }) => unknown\n readonly messages?: readonly unknown[]\n },\n ) =>\n Surface.make(scope, name, {\n ...(surfaceConfig.params === undefined\n ? {}\n : {\n Params: Schema.isSchema(surfaceConfig.params)\n ? surfaceConfig.params\n : Schema.Struct(surfaceConfig.params),\n }),\n model: (context: { readonly model: unknown; readonly params: unknown }) => {\n const shape = surfaceConfig.model(context)\n return isProjection(shape) ? shape : Projection.struct(shape as never)\n },\n messages: surfaceConfig.messages,\n } as never)\n const made = { ...scope, fields: scope.model, surface }\n const runnable = (run: { readonly initial: unknown; readonly update: unknown }): unknown => ({\n ...made,\n runnable,\n initial: run.initial,\n update: run.update,\n })\n return { ...made, runnable, initial: config.initial, update: config.update }\n}\n\ntype ConstructorOfSubset<S> = S extends MessageSet<any, any, any, infer Ms, any> ? Ms : never\ntype ValueOfSubset<S> = S extends MessageSet<any, any, infer V, any, any> ? V : never\ntype RootOfSubset<S> = S extends MessageSet<infer R, any, any, any, any> ? R : never\ntype MessageOfSubset<S> = S extends MessageSet<any, infer M, any, any, any> ? M : never\ntype CasesOfSubset<S> = S extends MessageSet<any, any, any, any, infer C> ? C : never\n\ntype Concat<A extends readonly unknown[], B extends readonly unknown[]> = [...A, ...B]\n\n/** Concatenates the constructor tuples of several subsets, preserving each. */\nexport type MergeConstructors<Subs extends readonly MessageSet<any, any, any, any, any>[]> =\n Subs extends readonly [\n infer Head extends MessageSet<any, any, any, any, any>,\n ...infer Tail extends readonly MessageSet<any, any, any, any, any>[],\n ]\n ? Concat<ConstructorOfSubset<Head>, MergeConstructors<Tail>>\n : []\n\n/** Typed Message subsets of one application, by constructor reference. */\nexport const MessageSet = {\n /**\n * Selects a typed Message subset by constructor reference:\n * `MessageSet.make(App, [Message.CreatedTodo, Message.RenamedTodo])`. Each\n * constructor must be this application's own variant; a duplicate or a variant\n * from another union throws.\n */\n make: <\n Root,\n F extends Schema.Struct.Fields,\n Cases extends Record<string, Schema.Struct.Fields>,\n const Ms extends readonly MessageConstructor<Cases>[],\n >(\n app: AppScope<Root, F, Cases>,\n messages: Ms,\n ): MessageSet<\n Root,\n Schema.Schema.Type<MessageUnion<Cases>>,\n SubsetOf<Ms> & Schema.Schema.Type<MessageUnion<Cases>>,\n Ms,\n Cases,\n SubsetEncoded<Ms>\n > => {\n const tags = new Set<string>()\n for (const constructor of messages) {\n const tag = messageTag(constructor)\n if (tag === undefined) {\n throw new Error('MessageSet.make: expected Message constructors')\n }\n if ((app.Message as unknown as Record<string, unknown>)[tag] !== constructor) {\n throw new Error(\n `MessageSet.make: \"${tag}\" is not a variant of this application's Message union`,\n )\n }\n if (tags.has(tag)) throw new Error(`MessageSet.make: duplicate \"${tag}\"`)\n tags.add(tag)\n }\n return {\n owner: app.owner,\n constructors: messages,\n schema: Schema.Union([...messages] as unknown as ReadonlyArray<\n Schema.Schema<unknown>\n >) as unknown as Schema.Codec<\n SubsetOf<Ms> & Schema.Schema.Type<MessageUnion<Cases>>,\n SubsetEncoded<Ms>,\n never,\n never\n >,\n tags,\n includes: (message): message is SubsetOf<Ms> & Schema.Schema.Type<MessageUnion<Cases>> =>\n hasTagIn(tags, message),\n }\n },\n\n /**\n * Unions several Message subsets into one. Every subset must belong to the\n * same application; a tag declared twice throws. Disjoint feature modules can\n * each declare their own subset and compose them here.\n */\n union: <const Subs extends readonly MessageSet<any, any, any, any, any>[]>(\n ...subsets: Subs\n ): MessageSet<\n RootOfSubset<Subs[number]>,\n MessageOfSubset<Subs[number]>,\n ValueOfSubset<Subs[number]>,\n MergeConstructors<Subs>,\n CasesOfSubset<Subs[number]>,\n SubsetEncoded<MergeConstructors<Subs>>\n > => {\n const parts = [...subsets]\n const owner = parts[0]?.owner\n const tags = new Set<string>()\n const constructors: Array<Schema.Schema<unknown>> = []\n for (const part of parts) {\n if (part.owner !== owner) {\n throw new Error('MessageSet.union: subsets from different applications')\n }\n for (const constructor of part.constructors) {\n const tag = messageTag(constructor)\n if (tag === undefined) continue\n if (tags.has(tag)) throw new Error(`MessageSet.union: duplicate \"${tag}\"`)\n tags.add(tag)\n constructors.push(constructor as Schema.Schema<unknown>)\n }\n }\n return {\n owner: owner as object,\n constructors: constructors as never,\n schema: Schema.Union(constructors) as unknown as Schema.Codec<\n ValueOfSubset<Subs[number]>,\n SubsetEncoded<MergeConstructors<Subs>>,\n never,\n never\n >,\n tags,\n includes: (message): message is ValueOfSubset<Subs[number]> => hasTagIn(tags, message),\n }\n },\n}\n\n// ===========================================================================\n// Action: a named capability that ends in an existing Message\n// ===========================================================================\n\n/**\n * A capability a consumer may invoke by name with data, such as an agent's\n * tool or a page Block's button. It ends in one of the application's own\n * Messages, so `update` stays the only place a Message has effects, and its\n * input is decoded by its Schema before `toMessage` sees it: stored or\n * untrusted data never executes.\n */\n// `Input` defaults to `never`: an Action known only as an Action takes no input but through `run`.\nexport interface Action<\n Name extends string = string,\n Input = never,\n Encoded = unknown,\n Message = unknown,\n> {\n readonly _tag: 'Action'\n readonly name: Name\n /** What it does, for a person choosing it or an agent deciding to. */\n readonly description: string\n readonly input: Schema.Codec<Input, Encoded, never, never>\n readonly toMessage: (input: Input) => Message\n}\n\nexport const Action = {\n /** An Action: `Action.define({ name: 'addToCart', description, input, toMessage })`. */\n define: <const Name extends string, Input, Encoded, Message>(config: {\n readonly name: Name\n readonly description: string\n readonly input: Schema.Codec<Input, Encoded, never, never>\n readonly toMessage: (input: Input) => Message\n }): Action<Name, Input, Encoded, Message> => {\n if (config.name.length === 0) throw new Error('Action.define: an Action needs a name')\n return Object.freeze({ _tag: 'Action', ...config })\n },\n\n /** Whether a value is an Action. */\n is: (value: unknown): value is Action =>\n typeof value === 'object' && Predicate.isTagged(value, 'Action'),\n\n /**\n * The Message an Action makes of `data`, decoded as its input first; a\n * failure says why the input was refused and makes no Message.\n */\n run: <Input, Encoded, Message>(\n action: Action<string, Input, Encoded, Message>,\n data: unknown,\n ): Result.Result<Message, Schema.SchemaError> =>\n Result.map(Schema.decodeUnknownResult(action.input)(data), action.toMessage),\n}\n\nexport const Surface = {\n application,\n\n /**\n * A Surface as the Model activates it. `params` is the value, or a function\n * of the Model returning it (none while the Surface is inactive, e.g. on\n * another route); the Surface's requirements then follow the Model.\n */\n at: <Root, Model, Message, Params>(\n surface: Surface<Root, Model, Message, Params>,\n params: Params | ((model: Root) => Option.Option<Params>),\n ): ActiveSurface<Root, Model> & SurfaceSource<Root> => {\n const paramsOf = (model: Root): Option.Option<Params> =>\n typeof params === 'function'\n ? (params as (model: Root) => Option.Option<Params>)(model)\n : Option.some(params)\n const projectionOf = (model: Root): Option.Option<Projection<Root, Model>> =>\n Option.map(paramsOf(model), surface.projection)\n return {\n name: surface.name,\n owner: surface.owner,\n messages: messageTags(surface),\n projectionOf,\n instancesOf: model => {\n const value = paramsOf(model)\n if (Option.isNone(value)) return []\n return [\n {\n key: surface.name,\n surface,\n params: value.value,\n projection: surface.projection(value.value),\n },\n ]\n },\n }\n },\n\n /**\n * A Surface active while a tagged value at a known place has a given tag.\n *\n * ```ts\n * Surface.when(ProjectPage, App.model.route, AppRoute.Project, route => ({\n * projectId: route.projectId,\n * }))\n * ```\n *\n * The same thing `Surface.at` does with a callback, and one fact more: the\n * place and the tag are **values**, so what activates the Surface can be read\n * without running anything. That is what a route-to-Surface manifest, a\n * prefetch analysis, or an explanation of why a read is happening needs.\n *\n * Deliberately **not router-specific.** A route is one kind of tagged Model\n * state; a mode, a wizard step and a selected tab are others, and none of\n * them should need their own helper.\n *\n * `Surface.at` stays, and is still the answer when activation is a genuine\n * computation rather than a tag.\n */\n when: <Root, Model, Message, Params, Case extends Schema.Top>(\n surface: Surface<Root, Model, Message, Params>,\n place: ModelPlace<Root>,\n tagged: Case,\n params: (value: Schema.Schema.Type<Case>) => Params,\n ): ActiveSurface<Root, Model> & SurfaceSource<Root> => {\n const tag = messageTag(tagged)\n if (tag === undefined) {\n throw new Error(\n `Surface.when: expected a tagged constructor for \"${surface.name}\", which is what names the case that activates it`,\n )\n }\n const focus = place[RefTypeId]\n const paramsOf = (model: Root): Option.Option<Params> => {\n const value = focus.get(model)\n return Predicate.isTagged(value, tag)\n ? Option.some(params(value as Schema.Schema.Type<Case>))\n : Option.none()\n }\n return {\n name: surface.name,\n owner: surface.owner,\n messages: messageTags(surface),\n activation: { path: focus.dependency, tag },\n projectionOf: model => Option.map(paramsOf(model), surface.projection),\n instancesOf: model => {\n const value = paramsOf(model)\n if (Option.isNone(value)) return []\n return [\n {\n key: surface.name,\n surface,\n params: value.value,\n projection: surface.projection(value.value),\n },\n ]\n },\n }\n },\n\n /**\n * One Surface definition for each item of a parent Surface's Model: zero to\n * many keyed instances, where `Surface.at`/`Surface.when` give zero or one.\n *\n * ```ts\n * Surface.each(ProductGrid, {\n * from: CmsPage,\n * instances: ({ document }) => nodesOf(document).map(node => ({\n * key: node.id,\n * params: { category: node.props.category },\n * })),\n * })\n * ```\n *\n * Keys must be non-empty strings that survive as record keys: `__proto__`\n * is refused, and duplicates throw. Consumers looking instances up by key\n * must still read through `Object.hasOwn` or a `Map`: any string key is\n * otherwise admitted.\n */\n each: <Root, ParentModel, Model, Message, Params>(\n child: Surface<Root, Model, Message, Params>,\n config: {\n readonly from: ActiveSurface<Root, ParentModel>\n readonly instances: (\n parent: ParentModel,\n ) => ReadonlyArray<{ readonly key: string; readonly params: Params }>\n },\n ): SurfaceFamily<Root, ParentModel, Model, Message, Params> => ({\n name: child.name,\n owner: child.owner,\n from: config.from,\n child,\n messages: messageTags(child),\n instancesOf: model => {\n const parent = config.from.projectionOf(model)\n if (Option.isNone(parent)) return []\n const seen = new Set<string>()\n return config.instances(parent.value.read(model)).map(({ key, params }) => {\n if (typeof key !== 'string' || key.length === 0)\n throw new Error(\n `Surface.each: \"${child.name}\" needs a non-empty string key for every instance`,\n )\n if (key === '__proto__')\n throw new Error(`Surface.each: \"${child.name}\" refuses \"__proto__\" as an instance key`)\n if (seen.has(key))\n throw new Error(`Surface.each: \"${child.name}\" has two instances keyed \"${key}\"`)\n seen.add(key)\n return { key, surface: child, params, projection: child.projection(params) }\n })\n },\n }),\n\n /**\n * What a source resolves to for a Model: the family's instances, or the\n * lone instance of a `Surface.at`/`Surface.when` value. Hand-written\n * `ActiveSurface` values predate sources; they are not sources until they\n * grow `instancesOf`, and consumers that still take them read `projectionOf`\n * directly.\n */\n instances: <Root>(\n source: SurfaceSource<Root>,\n model: Root,\n ): ReadonlyArray<SurfaceInstance<Root, any, any>> => source.instancesOf(model),\n\n make: <\n Root,\n F extends Schema.Struct.Fields,\n Cases extends Record<string, Schema.Struct.Fields>,\n Params = void,\n Model = unknown,\n const Ms extends readonly MessageConstructor<Cases>[] = readonly [],\n >(\n app: AppScope<Root, F, Cases>,\n name: string,\n config: {\n readonly Params?: Schema.Codec<Params, unknown>\n readonly model: (context: {\n readonly model: RefTree<Root, F>\n readonly params: Params\n }) => Projection<Root, Model>\n readonly messages?: Ms\n },\n ): Surface<Root, Model, MsgOf<Ms>, Params> => {\n // Deliberately no eager `projection(undefined)`: a parameterized Surface's\n // projection may read `params`.\n const projection = (params: Params): Projection<Root, Model> => {\n // The types refuse a missing argument; a caller typed `any`, or plain\n // JavaScript, otherwise meets a TypeError from inside `model`.\n if (\n params === undefined &&\n config.Params !== undefined &&\n !Schema.is(config.Params)(undefined)\n ) {\n throw new Error(`Surface \"${name}\" declares params, and was given none`)\n }\n return config.model({ model: app.model, params })\n }\n return {\n name,\n owner: app.owner,\n // Absent only when `Params` is exactly `void`; `ParamsSchema` keeps it optional otherwise.\n Params: config.Params as ParamsSchema<Params>,\n Message: Schema.Never as unknown as Schema.Schema<MsgOf<Ms>>,\n messages: config.messages ?? [],\n projection,\n }\n },\n\n read: <Root, Model, Message, Params>(\n surface: Surface<Root, Model, Message, Params>,\n root: Root,\n ...params: ParamsArgument<Params>\n ): Model => surface.projection(params[0] as Params).read(root),\n\n /**\n * Binds a renderer to a Surface's projected Model and Message set. A\n * type-level binder: the renderer already has this shape, but `Model` and\n * `Message` are derived from the Surface instead of written by hand.\n */\n view: <Root, Model, Message, Params>(\n _surface: Surface<Root, Model, Message, Params>,\n render: Renderer<Model, Message>,\n ): Renderer<Model, Message> => render,\n\n /**\n * The application boundary: consume the Root Model, project it, and hand the\n * projected Model to the renderer. `Subset` rejects a Surface whose Messages\n * the application builder cannot route.\n */\n rootView: <Root, Model, Message, Params>(\n surface: Surface<Root, Model, Message, Params>,\n params: Params,\n render: Renderer<Model, Message>,\n ): (<AppMessage>(\n root: Root,\n h: HtmlBuilder<AppMessage> & Subset<Message, AppMessage>,\n ) => Html) => {\n const projection = surface.projection(params)\n // Sound narrowing: the renderer can only construct this Surface's Messages,\n // and `Subset` guarantees the application builder accepts them.\n return <AppMessage>(\n root: Root,\n h: HtmlBuilder<AppMessage> & Subset<Message, AppMessage>,\n ): Html => render(projection.read(root), h as unknown as ViewBuilder<Message>)\n },\n\n /**\n * Embeds a child renderer in a parent view. `ParentModel extends ChildModel`\n * enforces \"child Model requirement ⊆ parent projected Model\"; `Subset`\n * enforces \"child Message set ⊆ parent Message set\".\n */\n embed:\n <ChildModel, ChildMessage>(child: Renderer<ChildModel, ChildMessage>) =>\n <ParentModel extends ChildModel, ParentMessage>(\n model: ParentModel,\n h: ViewBuilder<ParentMessage> & Subset<ChildMessage, ParentMessage>,\n ): Html =>\n child(model, h as unknown as ViewBuilder<ChildMessage>),\n\n /**\n * A Surface as a `Contract` for `Module`: what it observes, requires, and may\n * emit. A parameterized Surface needs its `params` to build the projection.\n */\n contract: <Root, Model, Message, Params>(\n surface: Surface<Root, Model, Message, Params>,\n ...params: ParamsArgument<Params>\n ): Contract => {\n const projection = surface.projection(params[0] as Params)\n return {\n kind: 'surface',\n name: surface.name,\n owner: surface.owner,\n owns: [],\n observes: projection.dependencies,\n messages: messageTags(surface),\n metadata: Metadata.summarize(projection.metadata),\n }\n },\n\n /**\n * Pure introspection for DevTools: what a Surface observes (dependencies,\n * requirements) and what it may emit. No behavior change, no I/O.\n */\n inspect: <Root, Model, Message, Params>(\n surface: Surface<Root, Model, Message, Params>,\n ...params: ParamsArgument<Params>\n ): SurfaceInspection => {\n const projection = surface.projection(params[0] as Params)\n return {\n name: surface.name,\n dependencies: projection.dependencies,\n metadata: Metadata.summarize(projection.metadata),\n emits: surface.messages,\n }\n },\n}\n\n// ===========================================================================\n// Entity, Selection, Remote moved to `foldkit-remote` (Phase 3).\n// ===========================================================================\n\n// ===========================================================================\n// Module: the pure composition root\n// ===========================================================================\n\n/**\n * What one contract claims about an application, as data. Sync, Remote, and\n * Agent attach one to the values they produce; `Surface.contract` derives one\n * from a Surface. `owns` are the Model paths the contract is the authority for\n * (a replicated projection, a remote store); `observes` are the paths it reads.\n */\nexport interface Contract {\n readonly kind: string\n readonly name: string\n /** The application's identity token; absent when the value cannot know it. */\n readonly owner?: object | undefined\n readonly owns: DependencyTree\n readonly observes: DependencyTree\n /** Message tags the contract may cause, expose, or record. */\n readonly messages: readonly string[]\n /** What interpreters attached to the contract's reads, as text. */\n readonly metadata: readonly MetadataSummary[]\n}\n\n/**\n * How one integration joins an application, as data and pure functions: the\n * Messages it routes, what it runs at startup and on a URL change, its\n * Subscriptions and Managed Resources, and its contract. Remote, Mirror, Sync,\n * and Agent produce one; `foldkit-bundle`'s assembly derives the application's\n * `update`, initial state, runtime config, and Module from a list of them.\n * `R` is the services its Commands and Subscriptions need.\n */\nexport interface Wiring<Model, Message, R = never, Claims extends string = string> {\n /** Names the integration in errors and the Module: `remote:Board`, `mirror:filters`. */\n readonly key: string\n /**\n * Message tags `route` handles. Two integrations handling one tag is an error\n * unless it is `shared`. Typed as literals (`Claims`), the tags it does not\n * share leave the parent's own update in `foldkit-bundle`'s assembly. A wiring\n * with literal `Claims` that shares some gives `shared` a literal type too: a\n * plain `string[]` there reads as sharing none.\n */\n readonly handles: ReadonlyArray<Claims>\n /** Tags several integrations may handle, each for its own values (Mirror's `MirrorRestored`, by name). */\n readonly shared?: readonly string[] | undefined\n /**\n * Folds a Message this integration handles; `None` for any other. A method, so\n * a wiring that routes only its own variants fits an assembly over the whole\n * application union.\n */\n route?(model: Model, message: Message): Option.Option<Update.Return<Model, Message, R>>\n /** Runs once when the application starts, after placements: a restore Command, a warm-up. */\n readonly init?: Update.Step<Model, Message, R> | undefined\n /** Applies the URL to the Model, at startup and whenever the URL changes. */\n readonly onUrl?: ((model: Model, url: Url) => Model) | undefined\n readonly subscriptions?: Subscriptions<Model, Message, R> | undefined\n readonly resources?:\n | Readonly<Record<string, ManagedResourceEntry<Model, Message, any, any, any>>>\n | undefined\n /** Its Module contract; absent for wiring that owns and observes nothing. */\n readonly contract?: Contract | undefined\n}\n\n/** Contracts of one application, in declaration order. Data, not a runtime. */\nexport interface Module<\n Root,\n F extends Schema.Struct.Fields,\n Cases extends Record<string, Schema.Struct.Fields>,\n> {\n readonly app: AppScope<Root, F, Cases>\n readonly contracts: readonly Contract[]\n}\n\nexport interface Finding {\n readonly rule:\n | 'foreign-contract'\n | 'duplicate-name'\n | 'ownership-overlap'\n | 'message-claimed-twice'\n | 'unknown-path'\n | 'unknown-message'\n /** `kind:name` of each contract involved. */\n readonly contracts: readonly string[]\n readonly message: string\n}\n\n/** Who owns a Model path; `undefined` is local state. */\nexport interface Ownership {\n readonly path: readonly string[]\n readonly owner: { readonly kind: string; readonly name: string } | undefined\n}\n\nexport interface ModuleManifest {\n readonly fields: readonly string[]\n readonly messages: readonly string[]\n readonly ownership: readonly Ownership[]\n readonly contracts: readonly Omit<Contract, 'owner'>[]\n readonly findings: readonly Finding[]\n}\n\n/** A value `Module.make` accepts: a contract, a value carrying one, or a Surface without params. */\nexport type ModuleItem<Root> =\n | Contract\n | { readonly contract: Contract }\n | Surface<Root, any, any, void>\n\nconst label = (contract: Contract): string => `${contract.kind}:${contract.name}`\n/** Metadata summaries are application data (a query's input), so they cannot break the table. */\nconst tableCell = (text: string): string =>\n text\n .replace(/\\\\/g, '\\\\\\\\')\n .replace(/\\|/g, '\\\\|')\n .replace(/\\r\\n?|\\n/g, ' ')\nconst pathKey = (path: readonly string[]): string => path.join('.')\nconst isPrefix = (prefix: readonly string[], path: readonly string[]): boolean =>\n prefix.length <= path.length && prefix.every((segment, index) => segment === path[index])\n\n// A carried contract wins: a sync contract also has a `projection` (writable, not a function).\nconst toContract = <Root>(item: ModuleItem<Root>): Contract =>\n 'contract' in item\n ? item.contract\n : 'projection' in item\n ? Surface.contract(item, undefined)\n : item\n\nconst applicationTags = (app: AppScope<any, any, any>): readonly string[] =>\n Object.entries(app.Message as unknown as Record<string, unknown>)\n .filter(([key, value]) => messageTag(value) === key)\n .map(([key]) => key)\n\n/** Contracts that own at least one path, with a stable label. */\nconst owners = (module: Module<any, any, any>) =>\n module.contracts.filter(contract => contract.owns.length > 0)\n\n/**\n * Collects an application's contracts as pure data so their relationships can\n * be validated and inspected without starting a runtime.\n *\n * ```ts\n * const Project = Module.make(App, [BoardSurface, ProjectSync, ProjectRemote, ProjectAgent])\n * Module.validate(Project) // findings, or []\n * Module.toMarkdown(Project)\n * ```\n */\nexport const Module = {\n make: <Root, F extends Schema.Struct.Fields, Cases extends Record<string, Schema.Struct.Fields>>(\n app: AppScope<Root, F, Cases>,\n items: readonly ModuleItem<Root>[] = [],\n ): Module<Root, F, Cases> => ({ app, contracts: items.map(toContract) }),\n\n /** A new Module with more contracts; the input is unchanged. */\n add: <Root, F extends Schema.Struct.Fields, Cases extends Record<string, Schema.Struct.Fields>>(\n module: Module<Root, F, Cases>,\n ...items: readonly ModuleItem<Root>[]\n ): Module<Root, F, Cases> => ({\n app: module.app,\n contracts: [...module.contracts, ...items.map(toContract)],\n }),\n\n /**\n * Cross-contract invariants the types cannot express: a contract from another\n * application, a duplicate `kind:name`, two owners of overlapping Model paths,\n * a Message recorded by two replication contracts, and a path or Message the\n * application does not declare.\n */\n validate: (module: Module<any, any, any>): readonly Finding[] => {\n const findings: Finding[] = []\n const fields = new Set(Object.keys(module.app.Model.fields))\n const tags = new Set(applicationTags(module.app))\n const seen = new Map<string, Contract>()\n\n for (const contract of module.contracts) {\n const name = label(contract)\n if (contract.owner !== undefined && contract.owner !== module.app.owner)\n findings.push({\n rule: 'foreign-contract',\n contracts: [name],\n message: `${name} belongs to a different application`,\n })\n const duplicate = seen.get(name)\n if (duplicate !== undefined && duplicate !== contract)\n findings.push({\n rule: 'duplicate-name',\n contracts: [name],\n message: `${name} is declared twice`,\n })\n seen.set(name, contract)\n for (const path of [...contract.owns, ...contract.observes]) {\n const head = path[0]\n if (head === undefined || !fields.has(head))\n findings.push({\n rule: 'unknown-path',\n contracts: [name],\n message: `${name} references \"${pathKey(path)}\", which is not a Model field`,\n })\n }\n for (const tag of contract.messages)\n if (!tags.has(tag))\n findings.push({\n rule: 'unknown-message',\n contracts: [name],\n message: `${name} names \"${tag}\", which is not a Message of this application`,\n })\n }\n\n // The same value listed twice is one owner, as `duplicate-name` treats it.\n const owning = [...new Set(owners(module))]\n for (let i = 0; i < owning.length; i += 1)\n for (let j = i + 1; j < owning.length; j += 1) {\n const a = owning[i]!\n const b = owning[j]!\n for (const pa of a.owns)\n for (const pb of b.owns)\n // An empty path is reported as `unknown-path`, not as owning everything.\n if (pa.length > 0 && pb.length > 0 && (isPrefix(pa, pb) || isPrefix(pb, pa)))\n findings.push({\n rule: 'ownership-overlap',\n contracts: [label(a), label(b)],\n message: `${label(a)} owns \"${pathKey(pa)}\" and ${label(b)} owns \"${pathKey(pb)}\"`,\n })\n }\n\n const recorded = new Map<string, Contract>()\n for (const contract of module.contracts.filter(contract => contract.kind === 'sync'))\n for (const tag of contract.messages) {\n const other = recorded.get(tag)\n if (other !== undefined && other !== contract)\n findings.push({\n rule: 'message-claimed-twice',\n contracts: [label(other), label(contract)],\n message: `\"${tag}\" is durable in both ${label(other)} and ${label(contract)}`,\n })\n else recorded.set(tag, contract)\n }\n\n return findings\n },\n\n /**\n * The application's fields and Messages, who owns each Model path (local when\n * no contract does), every contract, and the findings. Reproducible for a\n * given Module, so it can be committed and diffed.\n */\n manifest: (module: Module<any, any, any>): ModuleManifest => {\n const ownership: Ownership[] = []\n const owning = owners(module)\n for (const field of Object.keys(module.app.Model.fields)) {\n const claims = owning.flatMap(contract =>\n contract.owns\n .filter(path => path[0] === field)\n .map(path => ({ path, owner: { kind: contract.kind, name: contract.name } })),\n )\n const whole = claims.find(claim => claim.path.length === 1)\n if (whole !== undefined) ownership.push(whole)\n else {\n ownership.push({ path: [field], owner: undefined })\n ownership.push(...claims.sort((a, b) => pathKey(a.path).localeCompare(pathKey(b.path))))\n }\n }\n return {\n fields: Object.keys(module.app.Model.fields),\n messages: applicationTags(module.app),\n ownership,\n contracts: module.contracts.map(({ owner: _owner, ...rest }) => rest),\n findings: Module.validate(module),\n }\n },\n\n /** The manifest as Markdown: the ownership tree, a table of contracts, and findings. */\n toMarkdown: (module: Module<any, any, any>): string => {\n const manifest = Module.manifest(module)\n const lines: string[] = ['```text', 'Model']\n const width = Math.max(0, ...manifest.ownership.map(row => pathKey(row.path).length))\n manifest.ownership.forEach((row, index) => {\n const last = index === manifest.ownership.length - 1\n const owner =\n row.owner === undefined ? 'LOCAL' : `${row.owner.kind.toUpperCase()} ${row.owner.name}`\n lines.push(`${last ? '└── ' : '├── '}${pathKey(row.path).padEnd(width)} ${owner}`)\n })\n lines.push(\n '```',\n '',\n '| Contract | Owns | Observes | Messages | Metadata |',\n '| --- | --- | --- | --- | --- |',\n )\n for (const contract of manifest.contracts)\n lines.push(\n `| ${contract.kind}:${contract.name} | ${contract.owns.map(pathKey).join(', ')} | ${contract.observes.map(pathKey).join(', ')} | ${contract.messages.join(', ')} | ${tableCell(contract.metadata.map(summary => `${summary.name}: ${summary.entries.join(', ')}`).join('; '))} |`,\n )\n if (manifest.findings.length > 0) {\n lines.push('', '## Findings', '')\n for (const finding of manifest.findings)\n lines.push(`- **${finding.rule}** ${finding.message}`)\n }\n return lines.join('\\n')\n },\n\n /**\n * The manifest as a Mermaid flowchart: Model fields in a subgraph, one node\n * per contract, a solid edge for ownership and a dotted edge for observation.\n */\n toMermaid: (module: Module<any, any, any>): string => {\n const manifest = Module.manifest(module)\n const lines = ['flowchart LR', ' subgraph Model']\n manifest.fields.forEach((field, index) => lines.push(` f${index}[\"${field}\"]`))\n lines.push(' end')\n // A path outside the Model (reported by `validate`) draws no edge.\n const fieldId = (path: readonly string[]): string | undefined => {\n const index = path.length === 0 ? -1 : manifest.fields.indexOf(path[0]!)\n return index < 0 ? undefined : `f${index}`\n }\n manifest.contracts.forEach((contract, index) => {\n lines.push(` c${index}[\"${contract.kind}:${contract.name}\"]`)\n for (const path of contract.owns) {\n const field = fieldId(path)\n if (field !== undefined) lines.push(` c${index} -->|owns| ${field}`)\n }\n for (const path of contract.observes) {\n const field = fieldId(path)\n if (field !== undefined && !contract.owns.some(owned => pathKey(owned) === pathKey(path)))\n lines.push(` c${index} -.-> ${field}`)\n }\n })\n return lines.join('\\n')\n },\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;AA6CA,MAAa,YAA2B,OAAO,IAAI,0BAA0B;AA8C7E,MAAM,aACJ,QACA,OACA,YACA,KACA,SACwB;CACxB;CACA;CACA;CACA;CACA;CACA,SAAS,MAAM,OAAO,IAAI,MAAM,GAAG,IAAI,IAAI,CAAC,CAAC;AAC/C;AAEA,MAAa,WAAW;;;;;CAKtB,YACE,QACA,OACA,aAAgC,CAAC,OACN,GAC1B,YAAY,UACX,QACA,OACA,aACA,SAAQ,OAAO,WAAW,MAAM,UAAU,IAAI,CAAC,IAC9C,MAAM,UAAU,MAAM,QAAQ,OAAO,IAAI,CAC5C,EACF;;;;;;CAMA,QAAoD,QAClD,IAAI;;CAEN,KAAK,UACH,OAAO,UAAU,YAAY,UAAU,QAAQ,aAAa;AAChE;AAsEA,SAAS,eAAe,MAAe,KAAsB;CAC3D,OAAO,SAAS,QAAQ,SAAS,KAAA,KAAa,CAAC,OAAO,OAAO,MAAM,GAAG,IAClE,KAAA,IACC,KAAiC;AACxC;AAEA,SAAS,eAAe,OAAwC;CAC9D,OAAO,UAAU,KAAA,IAAY,OAAO,KAAK,IAAI,OAAO,KAAK,KAAK;AAChE;;AAGA,MAAM,cAAc,gBAA6C;CAC/D,MAAM,UAAW,YAAwE,QACrF,MAAM,KAAK;CACf,OAAO,OAAO,YAAY,WAAW,UAAU,KAAA;AACjD;;AAGA,MAAM,YAAY,MAA2B,YAC3C,UAAU,YAAY,SAAS,MAAM,KACrC,OAAO,QAAQ,SAAS,YACxB,KAAK,IAAI,QAAQ,IAAI;;AAGvB,MAAM,eAAe,YACnB,QAAQ,SAAS,IAAI,UAAU,CAAC,CAAC,QAAQ,QAAuB,QAAQ,KAAA,CAAS;AAEnF,SAAS,SACP,QACA,MACA,OACA,KACA,WAAW,OACX,KACA,OACyB;CACzB,MAAM,cAAc;CAMpB,MAAM,WAAW,SAAS,MAAe,UAA4B,MAAM,QAAQ,OAAO,IAAI;CAC9F,MAAM,QAAiC;EACrC,GAAG,UAAU,QAAiB,OAAO,MAAM,KAAK,QAAQ;EACxD,KAAK,KAAK,KAAK,SAAS,MAAM;EAC9B;CACF;CACA,MAAM,OAAqC,GAAG,YAAY,MAAM;CAEhE,MAAM,SAAU,OAAsD;CACtE,IAAI,WAAW,KAAA,GACb,KAAK,MAAM,OAAO,OAAO,KAAK,MAAM,GAElC,OAAO,eAAe,MAAM,KAAK;EAC/B,OAAO,SACL,OAAO,MACP,CAAC,GAAG,MAAM,GAAG,GACb,YAAY,IAAI,GAAG,IACnB,SAAQ,eAAe,IAAI,IAAI,GAAG,GAAG,GACrC,OACA,KAAA,GACA,KACF;EACA,YAAY;EACZ,UAAU;EACV,cAAc;CAChB,CAAC;CAIL,MAAM,MAAM,QACV,SACE,QACA,CAAC,GAAG,MAAM,GAAG,GACb,YAAY,GAAG,GAAG,IAClB,SAAQ,eAAe,eAAe,IAAI,IAAI,GAAG,GAAG,CAAC,GACrD,OACC,MAAM,UAAU;EACf,MAAM,YAAY,IAAI,IAAI;EAC1B,MAAM,SAAS;EACf,IAAI,OAAO,OAAO,MAAM,GACtB,OAAO,SAAS,MAAM;GAAE,GAAG;IAAY,MAAM,OAAO;EAAM,CAAC;EAE7D,MAAM,GAAG,MAAM,UAAU,GAAG,SAAS;EACrC,OAAO,SAAS,MAAM,IAAI;CAC5B,GACA,KACF;CACF,MAAM,SAAS,UACb,SACE,QACA,CAAC,GAAG,MAAM,OAAO,KAAK,CAAC,GACvB,QACA,SACE,eACE,MAAM,QAAQ,IAAI,IAAI,CAAC,IAAK,IAAI,IAAI,CAAC,CAA4B,SAAS,KAAA,CAC5E,GACF,OACC,MAAM,UAAU;EACf,MAAM,QAAS,MAAM,QAAQ,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,IAAI,CAAC;EACvD,MAAM,SAAS;EACf,MAAM,OAAO,OAAO,OAAO,MAAM,IAC7B,MAAM,KAAK,MAAM,MAAO,MAAM,QAAQ,OAAO,QAAQ,IAAK,IAC1D,MAAM,QAAQ,GAAG,MAAM,MAAM,KAAK;EACtC,OAAO,SAAS,MAAM,IAAI;CAC5B,GACA,KACF;CACF,MAAM,UAAU,eAA6C;EAC3D,MAAM,eAAe,kBAAkB,CAAC,MAAM,GAAG,WAAW,YAAY,CAAC;EACzE,OAAO,WACH,eACE,OAAO,OAAO,WAAW,KAAK,GAC9B,eACA,SAAQ,OAAO,IAAI,IAAI,IAAI,IAA6B,UAAS,WAAW,KAAK,KAAK,CAAC,GACvF,WAAW,QACb,IACA,eACE,WAAW,OACX,eACA,SAAQ,WAAW,KAAK,IAAI,IAAI,CAAC,GACjC,WAAW,QACb;CACN;CACA,OAAO;AACT;;AASA,SAAS,kBAAkB,cAA8C;CACvE,MAAM,uBAAO,IAAI,IAAY;CAC7B,MAAM,SAAgC,CAAC;CACvC,KAAK,MAAM,cAAc,cAAc;EACrC,MAAM,MAAM,WAAW,KAAK,IAAQ;EACpC,IAAI,KAAK,IAAI,GAAG,GAAG;EACnB,KAAK,IAAI,GAAG;EACZ,OAAO,KAAK,UAAU;CACxB;CACA,OAAO;AACT;AAuBA,SAAS,eACP,OACA,cACA,MACA,WAAqBA,WAAS,OACF;CAC5B,OAAO;EAAE;EAAO;EAAc;EAAU;CAAK;AAC/C;;;;;;AAOA,SAAS,aAAa,QAA8C;CAClE,OAAO,OAAO,KAAK,MAAM,CAAC,CAAC,WAAW,IAClC,OAAO,OAAO,OAAO,QAAQ,OAAO,KAAK,IACzC,OAAO,OAAO,MAAM;AAC1B;AAyCA,MAAM,+BAAe,IAAI,QAAgB;AAEzC,MAAM,WAAW,UACf,MAAM,aAAa,WAAW,KAAK,aAAa,IAAI,KAAK;AAE3D,MAAM,YACJ,UACA,UACM;CACN,IAAI,MAAM,KAAK,OAAO,GAAG,aAAa,IAAI,QAAQ;CAClD,OAAO;AACT;AAQA,MAAM,WAAW,MAAe,SAAyC;CACvE,IAAI,QAAQ;CACZ,KAAK,MAAM,OAAO,MAAM;EACtB,IAAI,OAAO,UAAU,YAAY,UAAU,MAAM,OAAO,KAAA;EACxD,QAAS,MAAkC;CAC7C;CACA,OAAO;AACT;AAGA,MAAM,aAAoB,QAAe,UACvC,WAAW,QAAQ,KAAK,IAAI,SAAS;AAEvC,MAAM,cAAc,MAAe,UAA4B;CAC7D,IAAI,OAAO,GAAG,MAAM,KAAK,GAAG,OAAO;CACnC,IAAI,OAAO,SAAS,YAAY,OAAO,UAAU,YAAY,SAAS,QAAQ,UAAU,MACtF,OAAO;CACT,MAAM,YAAY,OAAO,eAAe,IAAI;CAE5C,IAAI,EADU,cAAc,OAAO,aAAa,cAAc,QAAQ,MAAM,QAAQ,IAAI,MAC1E,OAAO,eAAe,KAAK,MAAM,WAAW,OAAO;CAEjE,IAAI,MAAM,QAAQ,IAAI,KAAK,KAAK,WAAY,MAAiC,QAAQ,OAAO;CAC5F,MAAM,OAAO,OAAO,KAAK,IAAI;CAC7B,OACE,KAAK,WAAW,OAAO,KAAK,KAAK,CAAC,CAAC,UACnC,KAAK,OACH,QACE,OAAO,OAAO,OAAO,GAAG,KACxB,OAAO,GAAI,KAAiC,MAAO,MAAkC,IAAI,CAC7F;AAEJ;AAEA,MAAa,aAAa;CACxB,KACmC,YAE/B,cACuD;EAEvD,MAAM,SAAoC,OAAO,OAAO,IAAI;EAC5D,MAAM,eAAsC,CAAC;EAC7C,MAAM,WAAuB,CAAC;EAE9B,MAAM,QAAqD,CAAC;EAC5D,MAAM,UAA6D,CAAC;EAEpE,KAAK,MAAM,OAAO,OAAO,KAAK,SAAS,GAAG;GACxC,MAAM,SAAU,UAAsC;GACtD,IAAI,WAAW,MAAM;IACnB,OAAO,OAAO,OAAO,OAAO;IAC5B,MAAM,KAAK,EAAE,cAAc,CAAC,EAAE,CAAC;IAC/B,QAAQ,KAAK,CAAC,MAAK,SAAQ,eAAe,MAAM,GAAG,CAAC,CAAC;GACvD,OAAO;IACL,MAAM,SAAS;IACf,OAAO,OAAO,OAAO;IACrB,aAAa,KAAK,GAAG,OAAO,YAAY;IACxC,SAAS,KAAK,OAAO,QAAQ;IAC7B,MAAM,KAAK,MAAM;IACjB,QAAQ,KAAK,CAAC,MAAK,SAAQ,OAAO,KAAK,eAAe,MAAM,GAAG,CAAC,CAAC,CAAC;GACpE;EACF;EAEA,MAAM,QAAQ,SAA2B;GACvC,MAAM,MAA+B,OAAO,OAAO,IAAI;GACvD,KAAK,MAAM,CAAC,KAAK,WAAW,SAAS,IAAI,OAAO,OAAO,IAAI;GAC3D,OAAO;EACT;EACA,OAAO,SACL,eACE,aAAa,MAAM,GACnB,kBAAkB,YAAY,GAC9B,MACAA,WAAS,QAAQ,QAAQ,CAC3B,GACA,KACF;CACF;CAEF,SACE,YACwE;EAExE,MAAM,SAAoC,OAAO,OAAO,IAAI;EAC5D,MAAM,eAAsC,CAAC;EAC7C,MAAM,WAAuB,CAAC;EAC9B,MAAM,UAA0C,CAAC;EACjD,MAAM,UAA6D,CAAC;EAEpE,KAAK,MAAM,OAAO,OAAO,KAAK,OAAO,GAAG;GACtC,MAAM,QAAQ,QAAQ;GACtB,IAAI,SAAS,GAAG,KAAK,GAAG;IACtB,MAAM,QAAQ,MAAM;IACpB,OAAO,OAAO,MAAM;IACpB,aAAa,KAAK,MAAM,UAAU;IAClC,QAAQ,KAAK,CAAC,KAAK,MAAM,GAAG,CAAC;GAC/B,OAAO;IACL,OAAO,OAAO,MAAM;IACpB,aAAa,KAAK,GAAG,MAAM,YAAY;IACvC,SAAS,KAAK,MAAM,QAAQ;IAC5B,QAAQ,KAAK,KAAK;IAClB,QAAQ,KAAK,CAAC,KAAK,MAAM,IAAI,CAAC;GAChC;EACF;EAEA,MAAM,QAAQ,SAA2B;GACvC,MAAM,MAA+B,OAAO,OAAO,IAAI;GACvD,KAAK,MAAM,CAAC,KAAK,WAAW,SAAS,IAAI,OAAO,OAAO,IAAI;GAC3D,OAAO;EACT;EACA,OAAO,SACL,eACE,aAAa,MAAM,GACnB,kBAAkB,YAAY,GAC9B,MACAA,WAAS,QAAQ,QAAQ,CAC3B,GACA,OACF;CACF;;;;;;CAOA,QACE,eAEA,SACE;EACE,OAAO,OAAO,MAAM,WAAW,KAAK;EACpC,cAAc,WAAW;EACzB,UAAU,WAAW;EACrB,OAAM,SAAQ,KAAK,KAAI,UAAS,WAAW,KAAK,KAAK,CAAC;CACxD,GACA,CAAC,UAAU,CACb;;CAGF,SACE,eAEA,SACE;EACE,OAAO,OAAO,OAAO,WAAW,KAAK;EACrC,cAAc,WAAW;EACzB,UAAU,WAAW;EACrB,OAAM,SAAQ,OAAO,IAAI,OAAM,UAAS,WAAW,KAAK,KAAK,CAAC;CAChE,GACA,CAAC,UAAU,CACb;CAEF,OAAoB,YAAqC,SACvD,WAAW,KAAK,IAAI;;;;;;CAOtB,aACE,OACA,MACA,aAI6B;EAC7B;EACA,cAAc,SAAS,gBAAgB,CAAC;EACxC,UAAU,SAAS,YAAYA,WAAS;EACxC;CACF;;;;;;;;;;;;;;;;;;;;;CAsBA,SACE,IACA,WACyB;EACzB,IAAI,GAAG,WAAW,GAChB,MAAM,IAAI,MACR,4JACF;EAEF,MAAM,QAAQ,GAAG,KAAI,UACnB,aAAa,QAAQ,EAAE,cAAc,CAAC,MAAM,UAAU,CAAC,UAAU,EAAE,IAAI,KACzE;EACA,MAAM,eAAe,kBAAkB,MAAM,SAAQ,SAAQ,KAAK,YAAY,CAAC;EAE/E,MAAM,SAAS,MAAM,KAAK,OAAO;EACjC,IAAI;EACJ,MAAM,UAAgC;GACpC;GACA,OAAM,SAAQ;IACZ,MAAM,SAAS,aAAa,KAAI,SAAQ,QAAQ,MAAM,IAAI,CAAC;IAC3D,MAAM,SAAS;IACf,MAAM,QACJ,WAAW,KAAA,IACP,OAAO,IAAI,IACX,CAAC,UAAU,OAAO,OAAO,OAAO,UAAU,OAAO,GAAG,OAAO,OAAO,OAAO,MAAM,CAAC,IAC9E,OAAO,QACP,UAAU,OAAO,OAAO,OAAO,IAAI,CAAC;IAC5C,OAAO;KAAE;KAAQ;IAAM;IACvB,OAAO;GACT;EACF;EACA,IAAI,QAAQ,aAAa,IAAI,OAAO;EACpC,OAAO;CACT;;;;;;;;CASA,OACE,GAAG,SAC8D;EACjE,MAAM,WAAW,KAAK,KAAI,QAAO,IAAI,UAAU;EAG/C,MAAM,QAAQ,SAAS,EAAE,EAAE;EAC3B,KAAK,MAAM,SAAS,UAClB,IAAI,MAAM,UAAU,OAClB,MAAM,IAAI,MAAM,yDAAyD;EAQ7E,MAAM,SAAoC,OAAO,OAAO,IAAI;EAC5D,MAAM,QAAgC,OAAO,OAAO,IAAI;EACxD,KAAK,MAAM,SAAS,CAAC,GAAG,QAAQ,GAAG;GACjC,MAAM,OAAO,MAAM,WAAW,KAAK,GAAG;GACtC,MAAM,WAAW,MAAM,MAAM;GAC7B,IAAI,aAAa,KAAA,GAAW;IAC1B,IAAI,aAAa,MAAM;KACrB,SAAS,OAAO,SAAS,QAAQ,KAAK,GAAG,CAAC;KAC1C;IACF;IACA,MAAM,IAAI,MACR,qBAAqB,SAAS,SAAS,KAAK,2BAA2B,MAAM,IAAI,sCACnF;GACF;GACA,MAAM,MAAM,OAAO;GACnB,OAAO,MAAM,OAAO,MAAM;EAC5B;EACA,OAAO;GACL,QAAQ,aAAa,MAAM;GAC3B,cAAc,kBAAkB,SAAS,KAAI,UAAS,MAAM,UAAU,CAAC;GACvE,MAAK,UAAS;IACZ,MAAM,MAA+B,OAAO,OAAO,IAAI;IACvD,KAAK,MAAM,SAAS,UAAU,IAAI,MAAM,OAAO,MAAM,IAAI,KAAc;IACvE,OAAO;GACT;GACA,MAAM,OAAO,WAAW;IACtB,IAAI,OAAO;IACX,KAAK,MAAM,SAAS,UAClB,OAAO,MAAM,IAAI,MAAgB,OAAmC,MAAM,IAAa;IACzF,OAAO;GACT;EACF;CACF;;;;;;;CAQA,UACE,GAAG,gBACkE;EACrE,MAAM,QAAQ,CAAC,GAAG,WAAW;EAC7B,MAAM,SAAoC,OAAO,OAAO,IAAI;EAI5D,MAAM,QAAgC,OAAO,OAAO,IAAI;EACxD,MAAM,UAAU,MAA8B,QAC5C,KAAK,aAAa,MAAK,eAAc,WAAW,GAAG,EAAE,MAAM,GAAG,CAAC,EAAE,KAAK,GAAG;EAC3E,KAAK,MAAM,QAAQ,OACjB,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,KAAK,OAAO,MAAM,GAAG;GAC7D,MAAM,WAAW,OAAO;GACxB,MAAM,OAAO,OAAO,MAAM,GAAG;GAC7B,IAAI,aAAa,KAAA,GAAW;IAC1B,MAAM,WAAW,MAAM;IACvB,IAAI,aAAa,KAAA,KAAa,SAAS,KAAA,KAAa,aAAa,MAC/D,MAAM,IAAI,MACR,wBAAwB,SAAS,SAAS,KAAK,2BAA2B,IAAI,EAChF;IAEF,IAAI,aAAa,OAAO;IACxB,MAAM,IAAI,MAAM,oDAAoD,IAAI,EAAE;GAC5E;GACA,OAAO,OAAO;GACd,IAAI,SAAS,KAAA,GAAW,MAAM,OAAO;EACvC;EAEF,OAAO;GACL,QAAQ,aAAa,MAAM;GAC3B,cAAc,kBAAkB,MAAM,SAAQ,SAAQ,CAAC,GAAG,KAAK,YAAY,CAAC,CAAC;GAC7E,MAAK,UAAS;IACZ,MAAM,MAA+B,OAAO,OAAO,IAAI;IACvD,KAAK,MAAM,QAAQ,OAAO,OAAO,OAAO,KAAK,KAAK,IAAI,KAAc,CAAC;IACrE,OAAO;GACT;GACA,MAAM,OAAO,WAAW;IACtB,IAAI,OAAO;IAEX,KAAK,MAAM,QAAQ,OAAO,OAAO,KAAK,IAAI,MAAe,MAAe;IACxE,OAAO;GACT;EACF;CACF;AACF;AA+LA,MAAM,gBAAgB,UACpB,OAAO,UAAU,YACjB,UAAU,QACV,OAAQ,MAA6B,SAAS,cAC9CA,WAAS,GAAI,MAAiC,QAAQ;AAwKxD,MAAM,aAGJ,WAG+C;CAG/C,MAAM,QAAgB,CAAC;CACvB,OAAO;EACL,OAAO,OAAO;EACd,SAAS,OAAO;EAChB;EACA,OAAO,SAEL,OAAO,OACP,CAAC,GACD,MAAM,GAAG,IACT,SAAQ,MACR,OACA,KAAA,GACA,KACF;CACF;AACF;AAiCA,SAAS,YAAY,QAAkB;CACrC,MAAM,QAAQ,UAAU,MAAM;CAC9B,MAAM,WACJ,MACA,kBAMA,QAAQ,KAAK,OAAO,MAAM;EACxB,GAAI,cAAc,WAAW,KAAA,IACzB,CAAC,IACD,EACE,QAAQ,OAAO,SAAS,cAAc,MAAM,IACxC,cAAc,SACd,OAAO,OAAO,cAAc,MAAM,EACxC;EACJ,QAAQ,YAAmE;GACzE,MAAM,QAAQ,cAAc,MAAM,OAAO;GACzC,OAAO,aAAa,KAAK,IAAI,QAAQ,WAAW,OAAO,KAAc;EACvE;EACA,UAAU,cAAc;CAC1B,CAAU;CACZ,MAAM,OAAO;EAAE,GAAG;EAAO,QAAQ,MAAM;EAAO;CAAQ;CACtD,MAAM,YAAY,SAA2E;EAC3F,GAAG;EACH;EACA,SAAS,IAAI;EACb,QAAQ,IAAI;CACd;CACA,OAAO;EAAE,GAAG;EAAM;EAAU,SAAS,OAAO;EAAS,QAAQ,OAAO;CAAO;AAC7E;;AAoBA,MAAa,aAAa;;;;;;;CAOxB,OAME,KACA,aAQG;EACH,MAAM,uBAAO,IAAI,IAAY;EAC7B,KAAK,MAAM,eAAe,UAAU;GAClC,MAAM,MAAM,WAAW,WAAW;GAClC,IAAI,QAAQ,KAAA,GACV,MAAM,IAAI,MAAM,gDAAgD;GAElE,IAAK,IAAI,QAA+C,SAAS,aAC/D,MAAM,IAAI,MACR,qBAAqB,IAAI,uDAC3B;GAEF,IAAI,KAAK,IAAI,GAAG,GAAG,MAAM,IAAI,MAAM,+BAA+B,IAAI,EAAE;GACxE,KAAK,IAAI,GAAG;EACd;EACA,OAAO;GACL,OAAO,IAAI;GACX,cAAc;GACd,QAAQ,OAAO,MAAM,CAAC,GAAG,QAAQ,CAEhC;GAMD;GACA,WAAW,YACT,SAAS,MAAM,OAAO;EAC1B;CACF;;;;;;CAOA,QACE,GAAG,YAQA;EACH,MAAM,QAAQ,CAAC,GAAG,OAAO;EACzB,MAAM,QAAQ,MAAM,EAAE,EAAE;EACxB,MAAM,uBAAO,IAAI,IAAY;EAC7B,MAAM,eAA8C,CAAC;EACrD,KAAK,MAAM,QAAQ,OAAO;GACxB,IAAI,KAAK,UAAU,OACjB,MAAM,IAAI,MAAM,uDAAuD;GAEzE,KAAK,MAAM,eAAe,KAAK,cAAc;IAC3C,MAAM,MAAM,WAAW,WAAW;IAClC,IAAI,QAAQ,KAAA,GAAW;IACvB,IAAI,KAAK,IAAI,GAAG,GAAG,MAAM,IAAI,MAAM,gCAAgC,IAAI,EAAE;IACzE,KAAK,IAAI,GAAG;IACZ,aAAa,KAAK,WAAqC;GACzD;EACF;EACA,OAAO;GACE;GACO;GACd,QAAQ,OAAO,MAAM,YAAY;GAMjC;GACA,WAAW,YAAoD,SAAS,MAAM,OAAO;EACvF;CACF;AACF;AA4BA,MAAa,SAAS;;CAEpB,SAA6D,WAKhB;EAC3C,IAAI,OAAO,KAAK,WAAW,GAAG,MAAM,IAAI,MAAM,uCAAuC;EACrF,OAAO,OAAO,OAAO;GAAE,MAAM;GAAU,GAAG;EAAO,CAAC;CACpD;;CAGA,KAAK,UACH,OAAO,UAAU,YAAY,UAAU,SAAS,OAAO,QAAQ;;;;;CAMjE,MACE,QACA,SAEA,OAAO,IAAI,OAAO,oBAAoB,OAAO,KAAK,CAAC,CAAC,IAAI,GAAG,OAAO,SAAS;AAC/E;AAEA,MAAa,UAAU;CACrB;;;;;;CAOA,KACE,SACA,WACqD;EACrD,MAAM,YAAY,UAChB,OAAO,WAAW,aACb,OAAkD,KAAK,IACxD,OAAO,KAAK,MAAM;EACxB,MAAM,gBAAgB,UACpB,OAAO,IAAI,SAAS,KAAK,GAAG,QAAQ,UAAU;EAChD,OAAO;GACL,MAAM,QAAQ;GACd,OAAO,QAAQ;GACf,UAAU,YAAY,OAAO;GAC7B;GACA,cAAa,UAAS;IACpB,MAAM,QAAQ,SAAS,KAAK;IAC5B,IAAI,OAAO,OAAO,KAAK,GAAG,OAAO,CAAC;IAClC,OAAO,CACL;KACE,KAAK,QAAQ;KACb;KACA,QAAQ,MAAM;KACd,YAAY,QAAQ,WAAW,MAAM,KAAK;IAC5C,CACF;GACF;EACF;CACF;;;;;;;;;;;;;;;;;;;;;;CAuBA,OACE,SACA,OACA,QACA,WACqD;EACrD,MAAM,MAAM,WAAW,MAAM;EAC7B,IAAI,QAAQ,KAAA,GACV,MAAM,IAAI,MACR,oDAAoD,QAAQ,KAAK,kDACnE;EAEF,MAAM,QAAQ,MAAM;EACpB,MAAM,YAAY,UAAuC;GACvD,MAAM,QAAQ,MAAM,IAAI,KAAK;GAC7B,OAAO,UAAU,SAAS,OAAO,GAAG,IAChC,OAAO,KAAK,OAAO,KAAiC,CAAC,IACrD,OAAO,KAAK;EAClB;EACA,OAAO;GACL,MAAM,QAAQ;GACd,OAAO,QAAQ;GACf,UAAU,YAAY,OAAO;GAC7B,YAAY;IAAE,MAAM,MAAM;IAAY;GAAI;GAC1C,eAAc,UAAS,OAAO,IAAI,SAAS,KAAK,GAAG,QAAQ,UAAU;GACrE,cAAa,UAAS;IACpB,MAAM,QAAQ,SAAS,KAAK;IAC5B,IAAI,OAAO,OAAO,KAAK,GAAG,OAAO,CAAC;IAClC,OAAO,CACL;KACE,KAAK,QAAQ;KACb;KACA,QAAQ,MAAM;KACd,YAAY,QAAQ,WAAW,MAAM,KAAK;IAC5C,CACF;GACF;EACF;CACF;;;;;;;;;;;;;;;;;;;;CAqBA,OACE,OACA,YAM8D;EAC9D,MAAM,MAAM;EACZ,OAAO,MAAM;EACb,MAAM,OAAO;EACb;EACA,UAAU,YAAY,KAAK;EAC3B,cAAa,UAAS;GACpB,MAAM,SAAS,OAAO,KAAK,aAAa,KAAK;GAC7C,IAAI,OAAO,OAAO,MAAM,GAAG,OAAO,CAAC;GACnC,MAAM,uBAAO,IAAI,IAAY;GAC7B,OAAO,OAAO,UAAU,OAAO,MAAM,KAAK,KAAK,CAAC,CAAC,CAAC,KAAK,EAAE,KAAK,aAAa;IACzE,IAAI,OAAO,QAAQ,YAAY,IAAI,WAAW,GAC5C,MAAM,IAAI,MACR,kBAAkB,MAAM,KAAK,kDAC/B;IACF,IAAI,QAAQ,aACV,MAAM,IAAI,MAAM,kBAAkB,MAAM,KAAK,yCAAyC;IACxF,IAAI,KAAK,IAAI,GAAG,GACd,MAAM,IAAI,MAAM,kBAAkB,MAAM,KAAK,6BAA6B,IAAI,EAAE;IAClF,KAAK,IAAI,GAAG;IACZ,OAAO;KAAE;KAAK,SAAS;KAAO;KAAQ,YAAY,MAAM,WAAW,MAAM;IAAE;GAC7E,CAAC;EACH;CACF;;;;;;;;CASA,YACE,QACA,UACmD,OAAO,YAAY,KAAK;CAE7E,OAQE,KACA,MACA,WAQ4C;EAG5C,MAAM,cAAc,WAA4C;GAG9D,IACE,WAAW,KAAA,KACX,OAAO,WAAW,KAAA,KAClB,CAAC,OAAO,GAAG,OAAO,MAAM,CAAC,CAAC,KAAA,CAAS,GAEnC,MAAM,IAAI,MAAM,YAAY,KAAK,sCAAsC;GAEzE,OAAO,OAAO,MAAM;IAAE,OAAO,IAAI;IAAO;GAAO,CAAC;EAClD;EACA,OAAO;GACL;GACA,OAAO,IAAI;GAEX,QAAQ,OAAO;GACf,SAAS,OAAO;GAChB,UAAU,OAAO,YAAY,CAAC;GAC9B;EACF;CACF;CAEA,OACE,SACA,MACA,GAAG,WACO,QAAQ,WAAW,OAAO,EAAY,CAAC,CAAC,KAAK,IAAI;;;;;;CAO7D,OACE,UACA,WAC6B;;;;;;CAO/B,WACE,SACA,QACA,WAIY;EACZ,MAAM,aAAa,QAAQ,WAAW,MAAM;EAG5C,QACE,MACA,MACS,OAAO,WAAW,KAAK,IAAI,GAAG,CAAoC;CAC/E;;;;;;CAOA,QAC6B,WAEzB,OACA,MAEA,MAAM,OAAO,CAAyC;;;;;CAM1D,WACE,SACA,GAAG,WACU;EACb,MAAM,aAAa,QAAQ,WAAW,OAAO,EAAY;EACzD,OAAO;GACL,MAAM;GACN,MAAM,QAAQ;GACd,OAAO,QAAQ;GACf,MAAM,CAAC;GACP,UAAU,WAAW;GACrB,UAAU,YAAY,OAAO;GAC7B,UAAUA,WAAS,UAAU,WAAW,QAAQ;EAClD;CACF;;;;;CAMA,UACE,SACA,GAAG,WACmB;EACtB,MAAM,aAAa,QAAQ,WAAW,OAAO,EAAY;EACzD,OAAO;GACL,MAAM,QAAQ;GACd,cAAc,WAAW;GACzB,UAAUA,WAAS,UAAU,WAAW,QAAQ;GAChD,OAAO,QAAQ;EACjB;CACF;AACF;AA+GA,MAAM,SAAS,aAA+B,GAAG,SAAS,KAAK,GAAG,SAAS;;AAE3E,MAAM,aAAa,SACjB,KACG,QAAQ,OAAO,MAAM,CAAC,CACtB,QAAQ,OAAO,KAAK,CAAC,CACrB,QAAQ,aAAa,GAAG;AAC7B,MAAM,WAAW,SAAoC,KAAK,KAAK,GAAG;AAClE,MAAM,YAAY,QAA2B,SAC3C,OAAO,UAAU,KAAK,UAAU,OAAO,OAAO,SAAS,UAAU,YAAY,KAAK,MAAM;AAG1F,MAAM,cAAoB,SACxB,cAAc,OACV,KAAK,WACL,gBAAgB,OACd,QAAQ,SAAS,MAAM,KAAA,CAAS,IAChC;AAER,MAAM,mBAAmB,QACvB,OAAO,QAAQ,IAAI,OAA6C,CAAC,CAC9D,QAAQ,CAAC,KAAK,WAAW,WAAW,KAAK,MAAM,GAAG,CAAC,CACnD,KAAK,CAAC,SAAS,GAAG;;AAGvB,MAAM,UAAU,WACd,OAAO,UAAU,QAAO,aAAY,SAAS,KAAK,SAAS,CAAC;;;;;;;;;;;AAY9D,MAAa,SAAS;CACpB,OACE,KACA,QAAqC,CAAC,OACV;EAAE;EAAK,WAAW,MAAM,IAAI,UAAU;CAAE;;CAGtE,MACE,QACA,GAAG,WACyB;EAC5B,KAAK,OAAO;EACZ,WAAW,CAAC,GAAG,OAAO,WAAW,GAAG,MAAM,IAAI,UAAU,CAAC;CAC3D;;;;;;;CAQA,WAAW,WAAsD;EAC/D,MAAM,WAAsB,CAAC;EAC7B,MAAM,SAAS,IAAI,IAAI,OAAO,KAAK,OAAO,IAAI,MAAM,MAAM,CAAC;EAC3D,MAAM,OAAO,IAAI,IAAI,gBAAgB,OAAO,GAAG,CAAC;EAChD,MAAM,uBAAO,IAAI,IAAsB;EAEvC,KAAK,MAAM,YAAY,OAAO,WAAW;GACvC,MAAM,OAAO,MAAM,QAAQ;GAC3B,IAAI,SAAS,UAAU,KAAA,KAAa,SAAS,UAAU,OAAO,IAAI,OAChE,SAAS,KAAK;IACZ,MAAM;IACN,WAAW,CAAC,IAAI;IAChB,SAAS,GAAG,KAAK;GACnB,CAAC;GACH,MAAM,YAAY,KAAK,IAAI,IAAI;GAC/B,IAAI,cAAc,KAAA,KAAa,cAAc,UAC3C,SAAS,KAAK;IACZ,MAAM;IACN,WAAW,CAAC,IAAI;IAChB,SAAS,GAAG,KAAK;GACnB,CAAC;GACH,KAAK,IAAI,MAAM,QAAQ;GACvB,KAAK,MAAM,QAAQ,CAAC,GAAG,SAAS,MAAM,GAAG,SAAS,QAAQ,GAAG;IAC3D,MAAM,OAAO,KAAK;IAClB,IAAI,SAAS,KAAA,KAAa,CAAC,OAAO,IAAI,IAAI,GACxC,SAAS,KAAK;KACZ,MAAM;KACN,WAAW,CAAC,IAAI;KAChB,SAAS,GAAG,KAAK,eAAe,QAAQ,IAAI,EAAE;IAChD,CAAC;GACL;GACA,KAAK,MAAM,OAAO,SAAS,UACzB,IAAI,CAAC,KAAK,IAAI,GAAG,GACf,SAAS,KAAK;IACZ,MAAM;IACN,WAAW,CAAC,IAAI;IAChB,SAAS,GAAG,KAAK,UAAU,IAAI;GACjC,CAAC;EACP;EAGA,MAAM,SAAS,CAAC,GAAG,IAAI,IAAI,OAAO,MAAM,CAAC,CAAC;EAC1C,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK,GACtC,KAAK,IAAI,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK,GAAG;GAC7C,MAAM,IAAI,OAAO;GACjB,MAAM,IAAI,OAAO;GACjB,KAAK,MAAM,MAAM,EAAE,MACjB,KAAK,MAAM,MAAM,EAAE,MAEjB,IAAI,GAAG,SAAS,KAAK,GAAG,SAAS,MAAM,SAAS,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,IACxE,SAAS,KAAK;IACZ,MAAM;IACN,WAAW,CAAC,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC;IAC9B,SAAS,GAAG,MAAM,CAAC,EAAE,SAAS,QAAQ,EAAE,EAAE,QAAQ,MAAM,CAAC,EAAE,SAAS,QAAQ,EAAE,EAAE;GAClF,CAAC;EACT;EAEF,MAAM,2BAAW,IAAI,IAAsB;EAC3C,KAAK,MAAM,YAAY,OAAO,UAAU,QAAO,aAAY,SAAS,SAAS,MAAM,GACjF,KAAK,MAAM,OAAO,SAAS,UAAU;GACnC,MAAM,QAAQ,SAAS,IAAI,GAAG;GAC9B,IAAI,UAAU,KAAA,KAAa,UAAU,UACnC,SAAS,KAAK;IACZ,MAAM;IACN,WAAW,CAAC,MAAM,KAAK,GAAG,MAAM,QAAQ,CAAC;IACzC,SAAS,IAAI,IAAI,uBAAuB,MAAM,KAAK,EAAE,OAAO,MAAM,QAAQ;GAC5E,CAAC;QACE,SAAS,IAAI,KAAK,QAAQ;EACjC;EAEF,OAAO;CACT;;;;;;CAOA,WAAW,WAAkD;EAC3D,MAAM,YAAyB,CAAC;EAChC,MAAM,SAAS,OAAO,MAAM;EAC5B,KAAK,MAAM,SAAS,OAAO,KAAK,OAAO,IAAI,MAAM,MAAM,GAAG;GACxD,MAAM,SAAS,OAAO,SAAQ,aAC5B,SAAS,KACN,QAAO,SAAQ,KAAK,OAAO,KAAK,CAAC,CACjC,KAAI,UAAS;IAAE;IAAM,OAAO;KAAE,MAAM,SAAS;KAAM,MAAM,SAAS;IAAK;GAAE,EAAE,CAChF;GACA,MAAM,QAAQ,OAAO,MAAK,UAAS,MAAM,KAAK,WAAW,CAAC;GAC1D,IAAI,UAAU,KAAA,GAAW,UAAU,KAAK,KAAK;QACxC;IACH,UAAU,KAAK;KAAE,MAAM,CAAC,KAAK;KAAG,OAAO,KAAA;IAAU,CAAC;IAClD,UAAU,KAAK,GAAG,OAAO,MAAM,GAAG,MAAM,QAAQ,EAAE,IAAI,CAAC,CAAC,cAAc,QAAQ,EAAE,IAAI,CAAC,CAAC,CAAC;GACzF;EACF;EACA,OAAO;GACL,QAAQ,OAAO,KAAK,OAAO,IAAI,MAAM,MAAM;GAC3C,UAAU,gBAAgB,OAAO,GAAG;GACpC;GACA,WAAW,OAAO,UAAU,KAAK,EAAE,OAAO,QAAQ,GAAG,WAAW,IAAI;GACpE,UAAU,OAAO,SAAS,MAAM;EAClC;CACF;;CAGA,aAAa,WAA0C;EACrD,MAAM,WAAW,OAAO,SAAS,MAAM;EACvC,MAAM,QAAkB,CAAC,WAAW,OAAO;EAC3C,MAAM,QAAQ,KAAK,IAAI,GAAG,GAAG,SAAS,UAAU,KAAI,QAAO,QAAQ,IAAI,IAAI,CAAC,CAAC,MAAM,CAAC;EACpF,SAAS,UAAU,SAAS,KAAK,UAAU;GACzC,MAAM,OAAO,UAAU,SAAS,UAAU,SAAS;GACnD,MAAM,QACJ,IAAI,UAAU,KAAA,IAAY,UAAU,GAAG,IAAI,MAAM,KAAK,YAAY,EAAE,GAAG,IAAI,MAAM;GACnF,MAAM,KAAK,GAAG,OAAO,SAAS,SAAS,QAAQ,IAAI,IAAI,CAAC,CAAC,OAAO,KAAK,EAAE,IAAI,OAAO;EACpF,CAAC;EACD,MAAM,KACJ,OACA,IACA,wDACA,iCACF;EACA,KAAK,MAAM,YAAY,SAAS,WAC9B,MAAM,KACJ,KAAK,SAAS,KAAK,GAAG,SAAS,KAAK,KAAK,SAAS,KAAK,IAAI,OAAO,CAAC,CAAC,KAAK,IAAI,EAAE,KAAK,SAAS,SAAS,IAAI,OAAO,CAAC,CAAC,KAAK,IAAI,EAAE,KAAK,SAAS,SAAS,KAAK,IAAI,EAAE,KAAK,UAAU,SAAS,SAAS,KAAI,YAAW,GAAG,QAAQ,KAAK,IAAI,QAAQ,QAAQ,KAAK,IAAI,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,EAAE,GAChR;EACF,IAAI,SAAS,SAAS,SAAS,GAAG;GAChC,MAAM,KAAK,IAAI,eAAe,EAAE;GAChC,KAAK,MAAM,WAAW,SAAS,UAC7B,MAAM,KAAK,OAAO,QAAQ,KAAK,KAAK,QAAQ,SAAS;EACzD;EACA,OAAO,MAAM,KAAK,IAAI;CACxB;;;;;CAMA,YAAY,WAA0C;EACpD,MAAM,WAAW,OAAO,SAAS,MAAM;EACvC,MAAM,QAAQ,CAAC,gBAAgB,kBAAkB;EACjD,SAAS,OAAO,SAAS,OAAO,UAAU,MAAM,KAAK,QAAQ,MAAM,IAAI,MAAM,GAAG,CAAC;EACjF,MAAM,KAAK,OAAO;EAElB,MAAM,WAAW,SAAgD;GAC/D,MAAM,QAAQ,KAAK,WAAW,IAAI,KAAK,SAAS,OAAO,QAAQ,KAAK,EAAG;GACvE,OAAO,QAAQ,IAAI,KAAA,IAAY,IAAI;EACrC;EACA,SAAS,UAAU,SAAS,UAAU,UAAU;GAC9C,MAAM,KAAK,MAAM,MAAM,IAAI,SAAS,KAAK,GAAG,SAAS,KAAK,GAAG;GAC7D,KAAK,MAAM,QAAQ,SAAS,MAAM;IAChC,MAAM,QAAQ,QAAQ,IAAI;IAC1B,IAAI,UAAU,KAAA,GAAW,MAAM,KAAK,MAAM,MAAM,aAAa,OAAO;GACtE;GACA,KAAK,MAAM,QAAQ,SAAS,UAAU;IACpC,MAAM,QAAQ,QAAQ,IAAI;IAC1B,IAAI,UAAU,KAAA,KAAa,CAAC,SAAS,KAAK,MAAK,UAAS,QAAQ,KAAK,MAAM,QAAQ,IAAI,CAAC,GACtF,MAAM,KAAK,MAAM,MAAM,QAAQ,OAAO;GAC1C;EACF,CAAC;EACD,OAAO,MAAM,KAAK,IAAI;CACxB;AACF"}
|