@wylan24/mockgen 0.0.0-stage → 0.1.0-alpha.1

package/dist/collections.js

@@ -0,0 +1,215 @@
+import { generate } from './generate.js';
+import { fits, mergeAllOf, typeOf } from './schema.js';
+import { normalizeName } from './heuristics.js';
+// List endpoints are treated as windows onto a fixed, seeded collection:
+// record i always has the same data, `?page=2` shows records 10–19, and when a
+// detail route exists (`/users` + `/users/{id}`), each list item is overlaid with
+// the detail response for its id so the two always agree.
+/** Property names that hold the records in a wrapped list response. */
+const LIST_KEYS = /^(data|items|results|records|content|rows|entries|list|values|nodes|hits|objects|elements)$/;
+/** Sibling names that mark an object as a page wrapper rather than a record with a nested array. */
+const PAGE_HINT = /^(total|totalcount|count|page|pages|next|nextpage|cursor|nextcursor|meta|pagination|pageinfo|links|hasmore|hasnext|limit|offset)$/;
+/** Recognize a list response: a bare array of objects, or an object wrapping one. */
+export function findListShape(schema) {
+    if (!schema)
+        return undefined;
+    if (typeOf(schema) === 'array') {
+        return isObjectSchema(schema.items) ? { arraySchema: schema, itemSchema: schema.items } : undefined;
+    }
+    const props = (schema.allOf ? mergeAllOf(schema) : schema).properties;
+    if (!props)
+        return undefined;
+    const arrays = Object.entries(props).filter(([, s]) => typeOf(s) === 'array' && isObjectSchema(s.items));
+    const pick = arrays.find(([k]) => LIST_KEYS.test(normalizeName(k))) ??
+        (arrays.length === 1 && Object.keys(props).some((k) => PAGE_HINT.test(normalizeName(k))) ? arrays[0] : undefined);
+    return pick && { key: pick[0], arraySchema: pick[1], itemSchema: pick[1].items };
+}
+function isObjectSchema(s) {
+    return !!s && (typeOf(s) === 'object' || !!s.allOf);
+}
+/** The `GET /users/{id}` route for list route `GET /users`, if the spec has one. */
+export function findDetailRoute(routes, list) {
+    const prefix = `${list.path.replace(/\/$/, '')}/{`;
+    return routes.find((r) => r.method === 'GET' && r.path.startsWith(prefix) && r.path.endsWith('}') && !r.path.slice(prefix.length).includes('/'));
+}
+const LIMIT_PARAMS = ['limit', 'per_page', 'perPage', 'page_size', 'pageSize', 'size', 'first'];
+const OFFSET_PARAMS = ['offset', 'skip', 'start'];
+const PAGE_PARAMS = ['page', 'page_number', 'pageNumber'];
+const CURSOR_PARAMS = ['cursor', 'after', 'starting_after', 'page_token', 'pageToken'];
+/** Work out which slice of the collection a request asks for. */
+export function readPage(query, arraySchema, total, defaultLimit = 10) {
+    const min = Math.max(1, arraySchema.minItems ?? 1);
+    const max = Math.min(1000, arraySchema.maxItems ?? 1000);
+    const limit = clamp(firstInt(query, LIMIT_PARAMS) ?? defaultLimit, min, Math.max(min, max));
+    const cursor = CURSOR_PARAMS.map((p) => query.get(p)).find(Boolean);
+    const page = firstInt(query, PAGE_PARAMS);
+    const offset = Math.max(0, (cursor ? decodeCursor(cursor) : undefined) ?? firstInt(query, OFFSET_PARAMS) ?? ((page ?? 1) - 1) * limit);
+    return { offset, limit, page: page && page > 0 ? page : Math.floor(offset / limit) + 1, total };
+}
+export function buildPage(input) {
+    const { shape, query, total } = input;
+    const win = readPage(query, shape.arraySchema, total);
+    const item = shape.itemSchema.allOf ? mergeAllOf(shape.itemSchema) : shape.itemSchema;
+    const props = item.properties ?? {};
+    const idKey = input.idKey && input.idKey in props ? input.idKey : 'id' in props ? 'id' : undefined;
+    const items = [];
+    const required = new Set(item.required ?? []);
+    const projectable = !item.oneOf && !item.anyOf && !!item.properties;
+    const detailProps = (input.detailSchema?.allOf ? mergeAllOf(input.detailSchema) : input.detailSchema)?.properties ?? {};
+    for (let i = win.offset; i < Math.min(total, win.offset + win.limit); i++) {
+        const key = `${input.requestPath}#${i}`;
+        const id = idKey ? recordId(props[idKey], i, input.seed, key) : undefined;
+        const detail = id !== undefined ? input.detail?.(id) : undefined;
+        if (detail && !projectable) {
+            // Items that are a oneOf/anyOf can't be projected field by field: generate, then overlay.
+            const record = generate(shape.itemSchema, { seed: input.seed, key });
+            for (const prop of Object.keys(record))
+                if (prop in detail && fits(detail[prop], props[prop]))
+                    record[prop] = detail[prop];
+            items.push(record);
+            continue;
+        }
+        if (!detail) {
+            const record = generate(shape.itemSchema, { seed: input.seed, key });
+            if (idKey && id !== undefined && fits(id, props[idKey]))
+                record[idKey] = id;
+            items.push(record);
+            continue;
+        }
+        // The detail record is the source of truth: project it onto the item's fields
+        // rather than generating the item too (twice the work, on the hottest path).
+        const record = {};
+        for (const [prop, propSchema] of Object.entries(props)) {
+            if (prop in detail && (detailProps[prop] === propSchema || fits(detail[prop], propSchema)))
+                record[prop] = detail[prop];
+            else if (required.has(prop))
+                record[prop] = generate(propSchema, { seed: input.seed, key: `${key}.${prop}` });
+        }
+        // Required keys without a property schema still have to be there.
+        for (const prop of required)
+            if (!(prop in record))
+                record[prop] = prop in detail ? detail[prop] : generate({}, { seed: input.seed, key: `${key}.${prop}` });
+        items.push(record);
+    }
+    const hasMore = win.offset + items.length < total;
+    const headers = { 'x-total-count': String(total) };
+    const links = navLinks(input, win, hasMore);
+    const link = [links.next && `<${links.next}>; rel="next"`, links.prev && `<${links.prev}>; rel="prev"`].filter(Boolean).join(', ');
+    if (link)
+        headers.link = link;
+    if (!shape.key)
+        return { body: items, headers };
+    const body = (input.body && typeof input.body === 'object' ? input.body : {});
+    body[shape.key] = items;
+    const schema = input.schema.allOf ? mergeAllOf(input.schema) : input.schema;
+    fillMeta(body, schema, { ...win, count: items.length, hasMore, links }, shape.key, 0);
+    return { body, headers };
+}
+/** Fill pagination fields (`total`, `page`, `next`, `meta.pagination.totalPages`, …) by name. */
+function fillMeta(obj, schema, m, listKey, depth) {
+    const props = schema?.properties ?? {};
+    const totalPages = Math.max(1, Math.ceil(m.total / m.limit));
+    for (const [key, value] of Object.entries(obj)) {
+        if (key === listKey)
+            continue;
+        const s = props[key];
+        const n = normalizeName(key);
+        const set = (v) => {
+            if (fits(v, s))
+                obj[key] = v;
+        };
+        // Last page: nullable `next` becomes null, optional `next` disappears.
+        const end = () => {
+            if (s && (fits(null, s) || s.nullable))
+                obj[key] = null;
+            else if (!(schema?.required ?? []).includes(key))
+                delete obj[key];
+        };
+        if (/^(total|totalcount|totalitems|totalresults|totalrecords|totalelements|totalentries|count|totalsize)$/.test(n))
+            set(n === 'count' && 'total' in obj ? m.count : m.total); // `count` next to `total` is the page size
+        else if (/^(page|currentpage|pagenumber|pageindex)$/.test(n))
+            set(m.page);
+        else if (/^(perpage|pagesize|limit|size|itemsperpage|pagelength)$/.test(n))
+            set(m.limit);
+        else if (/^(totalpages|pagecount|pages|lastpage)$/.test(n))
+            set(totalPages);
+        else if (/^(offset|skip|start)$/.test(n))
+            set(m.offset);
+        else if (/^(hasmore|hasnext|hasnextpage|more)$/.test(n))
+            set(m.hasMore);
+        else if (/^(hasprev|hasprevious|haspreviouspage)$/.test(n))
+            set(m.offset > 0);
+        else if (/^(next|nextpage|nexturl|nextlink|nextcursor|endcursor|cursor)$/.test(n)) {
+            if (!m.hasMore)
+                end();
+            else if (typeof value === 'number' || (s && /integer|number/.test(String(typeOf(s)))))
+                set(m.page + 1);
+            else
+                set(/cursor/.test(n) ? m.links.nextCursor : m.links.next);
+        }
+        else if (/^(prev|previous|prevpage|previouspage|prevurl|prevlink|startcursor)$/.test(n)) {
+            if (m.offset === 0)
+                end();
+            else if (typeof value === 'number' || (s && /integer|number/.test(String(typeOf(s)))))
+                set(m.page - 1);
+            else
+                set(/cursor/.test(n) ? m.links.prevCursor : m.links.prev);
+        }
+        else if (depth < 2 && value && typeof value === 'object' && !Array.isArray(value)) {
+            fillMeta(value, s && (s.allOf ? mergeAllOf(s) : s), m, undefined, depth + 1);
+        }
+    }
+}
+/** Record i's id: sequential for numeric ids, otherwise generated from the id schema alone. */
+function recordId(idSchema, i, seed, key) {
+    const t = typeOf(idSchema);
+    if (t === 'integer' || t === 'number') {
+        const id = Math.max(1, Math.ceil(idSchema.minimum ?? 1)) + i;
+        if (idSchema.maximum === undefined || id <= idSchema.maximum)
+            return id;
+    }
+    return generate(idSchema, { seed, key: `${key}.id` });
+}
+function navLinks(input, win, hasMore) {
+    const link = (offset) => {
+        const q = new URLSearchParams(input.query);
+        for (const p of CURSOR_PARAMS)
+            q.delete(p);
+        const usesOffset = OFFSET_PARAMS.some((p) => q.has(p));
+        if (usesOffset)
+            for (const p of OFFSET_PARAMS)
+                q.has(p) && q.set(p, String(offset));
+        else
+            q.set(PAGE_PARAMS.find((p) => q.has(p)) ?? 'page', String(Math.floor(offset / win.limit) + 1));
+        if (!LIMIT_PARAMS.some((p) => q.has(p)))
+            q.set('limit', String(win.limit));
+        return `${input.origin ?? ''}${input.requestPath}?${q}`;
+    };
+    const prevOffset = Math.max(0, win.offset - win.limit);
+    return {
+        next: hasMore ? link(win.offset + win.limit) : undefined,
+        prev: win.offset > 0 ? link(prevOffset) : undefined,
+        nextCursor: hasMore ? encodeCursor(win.offset + win.limit) : undefined,
+        prevCursor: win.offset > 0 ? encodeCursor(prevOffset) : undefined,
+    };
+}
+/** Opaque-looking cursors that are really offsets, so any cursor we hand out works. */
+export function encodeCursor(offset) {
+    return Buffer.from(`o:${offset}`).toString('base64url');
+}
+function decodeCursor(cursor) {
+    const m = /^o:(\d+)$/.exec(Buffer.from(cursor, 'base64url').toString());
+    return m ? Number(m[1]) : undefined;
+}
+function firstInt(query, names) {
+    for (const name of names) {
+        const v = query.get(name);
+        if (v !== null && /^-?\d+$/.test(v))
+            return Number(v);
+    }
+    return undefined;
+}
+function clamp(n, min, max) {
+    return Math.min(max, Math.max(min, n));
+}
+//# sourceMappingURL=collections.js.map

package/dist/collections.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"collections.js","sourceRoot":"","sources":["../src/collections.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AACzC,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AACvD,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAGhD,yEAAyE;AACzE,+EAA+E;AAC/E,kFAAkF;AAClF,0DAA0D;AAE1D,uEAAuE;AACvE,MAAM,SAAS,GAAG,6FAA6F,CAAC;AAChH,oGAAoG;AACpG,MAAM,SAAS,GAAG,mIAAmI,CAAC;AAStJ,qFAAqF;AACrF,MAAM,UAAU,aAAa,CAAC,MAA0B;IACtD,IAAI,CAAC,MAAM;QAAE,OAAO,SAAS,CAAC;IAC9B,IAAI,MAAM,CAAC,MAAM,CAAC,KAAK,OAAO,EAAE,CAAC;QAC/B,OAAO,cAAc,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;IACtG,CAAC;IACD,MAAM,KAAK,GAAuC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,UAAU,CAAC;IAC1G,IAAI,CAAC,KAAK;QAAE,OAAO,SAAS,CAAC;IAC7B,MAAM,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,OAAO,IAAI,cAAc,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IACzG,MAAM,IAAI,GACR,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;QACtD,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IACpH,OAAO,IAAI,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC;AACnF,CAAC;AAED,SAAS,cAAc,CAAC,CAAqB;IAC3C,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;AACtD,CAAC;AAED,oFAAoF;AACpF,MAAM,UAAU,eAAe,CAAC,MAAmB,EAAE,IAAe;IAClE,MAAM,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC;IACnD,OAAO,MAAM,CAAC,IAAI,CAChB,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,KAAK,IAAI,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAC7H,CAAC;AACJ,CAAC;AAUD,MAAM,YAAY,GAAG,CAAC,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;AAChG,MAAM,aAAa,GAAG,CAAC,QAAQ,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;AAClD,MAAM,WAAW,GAAG,CAAC,MAAM,EAAE,aAAa,EAAE,YAAY,CAAC,CAAC;AAC1D,MAAM,aAAa,GAAG,CAAC,QAAQ,EAAE,OAAO,EAAE,gBAAgB,EAAE,YAAY,EAAE,WAAW,CAAC,CAAC;AAEvF,iEAAiE;AACjE,MAAM,UAAU,QAAQ,CAAC,KAAsB,EAAE,WAAmB,EAAE,KAAa,EAAE,YAAY,GAAG,EAAE;IACpG,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,WAAW,CAAC,QAAQ,IAAI,CAAC,CAAC,CAAC;IACnD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,WAAW,CAAC,QAAQ,IAAI,IAAI,CAAC,CAAC;IACzD,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,CAAC,KAAK,EAAE,YAAY,CAAC,IAAI,YAAY,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IAC5F,MAAM,MAAM,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACpE,MAAM,IAAI,GAAG,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;IAC1C,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,QAAQ,CAAC,KAAK,EAAE,aAAa,CAAC,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;IACvI,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC;AAClG,CAAC;AAsBD,MAAM,UAAU,SAAS,CAAC,KAAqB;IAC7C,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,KAAK,CAAC;IACtC,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC;IACtD,MAAM,IAAI,GAAG,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC;IACtF,MAAM,KAAK,GAA2B,IAAI,CAAC,UAAU,IAAI,EAAE,CAAC;IAC5D,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,IAAI,KAAK,CAAC,KAAK,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,IAAI,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC;IAEnG,MAAM,KAAK,GAAc,EAAE,CAAC;IAC5B,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAS,IAAI,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC;IACtD,MAAM,WAAW,GAAG,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC;IACpE,MAAM,WAAW,GAA2B,CAAC,KAAK,CAAC,YAAY,EAAE,KAAK,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,YAAY,CAAC,EAAE,UAAU,IAAI,EAAE,CAAC;IAChJ,KAAK,IAAI,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,MAAM,GAAG,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC1E,MAAM,GAAG,GAAG,GAAG,KAAK,CAAC,WAAW,IAAI,CAAC,EAAE,CAAC;QACxC,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAE,EAAE,CAAC,EAAE,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAC3E,MAAM,MAAM,GAAG,EAAE,KAAK,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QACjE,IAAI,MAAM,IAAI,CAAC,WAAW,EAAE,CAAC;YAC3B,0FAA0F;YAC1F,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,UAAU,EAAE,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,CAA4B,CAAC;YAChG,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC;gBAAE,IAAI,IAAI,IAAI,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;oBAAE,MAAM,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;YAC3H,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACnB,SAAS;QACX,CAAC;QACD,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,UAAU,EAAE,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,CAA4B,CAAC;YAChG,IAAI,KAAK,IAAI,EAAE,KAAK,SAAS,IAAI,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;gBAAE,MAAM,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;YAC5E,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACnB,SAAS;QACX,CAAC;QACD,8EAA8E;QAC9E,6EAA6E;QAC7E,MAAM,MAAM,GAA4B,EAAE,CAAC;QAC3C,KAAK,MAAM,CAAC,IAAI,EAAE,UAAU,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;YACvD,IAAI,IAAI,IAAI,MAAM,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,UAAU,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,UAAU,CAAC,CAAC;gBAAE,MAAM,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;iBACnH,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,MAAM,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,UAAU,EAAE,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,GAAG,IAAI,IAAI,EAAE,EAAE,CAAC,CAAC;QAChH,CAAC;QACD,kEAAkE;QAClE,KAAK,MAAM,IAAI,IAAI,QAAQ;YAAE,IAAI,CAAC,CAAC,IAAI,IAAI,MAAM,CAAC;gBAAE,MAAM,CAAC,IAAI,CAAC,GAAG,IAAI,IAAI,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,GAAG,IAAI,IAAI,EAAE,EAAE,CAAC,CAAC;QAC7J,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACrB,CAAC;IAED,MAAM,OAAO,GAAG,GAAG,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,GAAG,KAAK,CAAC;IAClD,MAAM,OAAO,GAA2B,EAAE,eAAe,EAAE,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;IAC3E,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;IAC5C,MAAM,IAAI,GAAG,CAAC,KAAK,CAAC,IAAI,IAAI,IAAI,KAAK,CAAC,IAAI,eAAe,EAAE,KAAK,CAAC,IAAI,IAAI,IAAI,KAAK,CAAC,IAAI,eAAe,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnI,IAAI,IAAI;QAAE,OAAO,CAAC,IAAI,GAAG,IAAI,CAAC;IAE9B,IAAI,CAAC,KAAK,CAAC,GAAG;QAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC;IAChD,MAAM,IAAI,GAAG,CAAC,KAAK,CAAC,IAAI,IAAI,OAAO,KAAK,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAA4B,CAAC;IACzG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;IACxB,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC;IAC5E,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,GAAG,GAAG,EAAE,KAAK,EAAE,KAAK,CAAC,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,EAAE,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACtF,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC;AAC3B,CAAC;AAQD,iGAAiG;AACjG,SAAS,QAAQ,CAAC,GAA4B,EAAE,MAA0B,EAAE,CAAW,EAAE,OAA2B,EAAE,KAAa;IACjI,MAAM,KAAK,GAA2B,MAAM,EAAE,UAAU,IAAI,EAAE,CAAC;IAC/D,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IAC7D,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;QAC/C,IAAI,GAAG,KAAK,OAAO;YAAE,SAAS;QAC9B,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;QACrB,MAAM,CAAC,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;QAC7B,MAAM,GAAG,GAAG,CAAC,CAAU,EAAE,EAAE;YACzB,IAAI,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC;gBAAE,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC/B,CAAC,CAAC;QACF,uEAAuE;QACvE,MAAM,GAAG,GAAG,GAAG,EAAE;YACf,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC;gBAAE,GAAG,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;iBACnD,IAAI,CAAC,CAAC,MAAM,EAAE,QAAQ,IAAI,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC;gBAAE,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC;QACpE,CAAC,CAAC;QAEF,IAAI,sGAAsG,CAAC,IAAI,CAAC,CAAC,CAAC;YAAE,GAAG,CAAC,CAAC,KAAK,OAAO,IAAI,OAAO,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,2CAA2C;aACpN,IAAI,2CAA2C,CAAC,IAAI,CAAC,CAAC,CAAC;YAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;aACrE,IAAI,yDAAyD,CAAC,IAAI,CAAC,CAAC,CAAC;YAAE,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;aACpF,IAAI,yCAAyC,CAAC,IAAI,CAAC,CAAC,CAAC;YAAE,GAAG,CAAC,UAAU,CAAC,CAAC;aACvE,IAAI,uBAAuB,CAAC,IAAI,CAAC,CAAC,CAAC;YAAE,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;aACnD,IAAI,sCAAsC,CAAC,IAAI,CAAC,CAAC,CAAC;YAAE,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;aACnE,IAAI,yCAAyC,CAAC,IAAI,CAAC,CAAC,CAAC;YAAE,GAAG,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;aACzE,IAAI,gEAAgE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;YAClF,IAAI,CAAC,CAAC,CAAC,OAAO;gBAAE,GAAG,EAAE,CAAC;iBACjB,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,CAAC,CAAC,IAAI,gBAAgB,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAAE,GAAG,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;;gBAClG,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACjE,CAAC;aAAM,IAAI,sEAAsE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;YAC1F,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;gBAAE,GAAG,EAAE,CAAC;iBACrB,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,CAAC,CAAC,IAAI,gBAAgB,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAAE,GAAG,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;;gBAClG,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;QACjE,CAAC;aAAM,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;YACpF,QAAQ,CAAC,KAAgC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;QAC1G,CAAC;IACH,CAAC;AACH,CAAC;AAED,+FAA+F;AAC/F,SAAS,QAAQ,CAAC,QAAgB,EAAE,CAAS,EAAE,IAAwB,EAAE,GAAW;IAClF,MAAM,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC;IAC3B,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,QAAQ,EAAE,CAAC;QACtC,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAC7D,IAAI,QAAQ,CAAC,OAAO,KAAK,SAAS,IAAI,EAAE,IAAI,QAAQ,CAAC,OAAO;YAAE,OAAO,EAAE,CAAC;IAC1E,CAAC;IACD,OAAO,QAAQ,CAAC,QAAQ,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,GAAG,KAAK,EAAE,CAAC,CAAC;AACxD,CAAC;AAED,SAAS,QAAQ,CAAC,KAAqB,EAAE,GAAe,EAAE,OAAgB;IACxE,MAAM,IAAI,GAAG,CAAC,MAAc,EAAE,EAAE;QAC9B,MAAM,CAAC,GAAG,IAAI,eAAe,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAC3C,KAAK,MAAM,CAAC,IAAI,aAAa;YAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAC3C,MAAM,UAAU,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACvD,IAAI,UAAU;YAAE,KAAK,MAAM,CAAC,IAAI,aAAa;gBAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;;YAC/E,CAAC,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,MAAM,EAAE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACpG,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAAE,CAAC,CAAC,GAAG,CAAC,OAAO,EAAE,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;QAC3E,OAAO,GAAG,KAAK,CAAC,MAAM,IAAI,EAAE,GAAG,KAAK,CAAC,WAAW,IAAI,CAAC,EAAE,CAAC;IAC1D,CAAC,CAAC;IACF,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,MAAM,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC;IACvD,OAAO;QACL,IAAI,EAAE,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS;QACxD,IAAI,EAAE,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,SAAS;QACnD,UAAU,EAAE,OAAO,CAAC,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,MAAM,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS;QACtE,UAAU,EAAE,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,SAAS;KAClE,CAAC;AACJ,CAAC;AAED,uFAAuF;AACvF,MAAM,UAAU,YAAY,CAAC,MAAc;IACzC,OAAO,MAAM,CAAC,IAAI,CAAC,KAAK,MAAM,EAAE,CAAC,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;AAC1D,CAAC;AAED,SAAS,YAAY,CAAC,MAAc;IAClC,MAAM,CAAC,GAAG,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC;IACxE,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;AACtC,CAAC;AAED,SAAS,QAAQ,CAAC,KAAsB,EAAE,KAAe;IACvD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC1B,IAAI,CAAC,KAAK,IAAI,IAAI,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC;YAAE,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC;IACxD,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,SAAS,KAAK,CAAC,CAAS,EAAE,GAAW,EAAE,GAAW;IAChD,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;AACzC,CAAC","sourcesContent":["import { generate } from './generate.js';\nimport { fits, mergeAllOf, typeOf } from './schema.js';\nimport { normalizeName } from './heuristics.js';\nimport type { MockRoute, Schema } from './model.js';\n\n// List endpoints are treated as windows onto a fixed, seeded collection:\n// record i always has the same data, `?page=2` shows records 10–19, and when a\n// detail route exists (`/users` + `/users/{id}`), each list item is overlaid with\n// the detail response for its id so the two always agree.\n\n/** Property names that hold the records in a wrapped list response. */\nconst LIST_KEYS = /^(data|items|results|records|content|rows|entries|list|values|nodes|hits|objects|elements)$/;\n/** Sibling names that mark an object as a page wrapper rather than a record with a nested array. */\nconst PAGE_HINT = /^(total|totalcount|count|page|pages|next|nextpage|cursor|nextcursor|meta|pagination|pageinfo|links|hasmore|hasnext|limit|offset)$/;\n\nexport interface ListShape {\n  /** Property holding the records; undefined when the response is a bare array. */\n  key?: string;\n  arraySchema: Schema;\n  itemSchema: Schema;\n}\n\n/** Recognize a list response: a bare array of objects, or an object wrapping one. */\nexport function findListShape(schema: Schema | undefined): ListShape | undefined {\n  if (!schema) return undefined;\n  if (typeOf(schema) === 'array') {\n    return isObjectSchema(schema.items) ? { arraySchema: schema, itemSchema: schema.items } : undefined;\n  }\n  const props: Record<string, Schema> | undefined = (schema.allOf ? mergeAllOf(schema) : schema).properties;\n  if (!props) return undefined;\n  const arrays = Object.entries(props).filter(([, s]) => typeOf(s) === 'array' && isObjectSchema(s.items));\n  const pick =\n    arrays.find(([k]) => LIST_KEYS.test(normalizeName(k))) ??\n    (arrays.length === 1 && Object.keys(props).some((k) => PAGE_HINT.test(normalizeName(k))) ? arrays[0] : undefined);\n  return pick && { key: pick[0], arraySchema: pick[1], itemSchema: pick[1].items };\n}\n\nfunction isObjectSchema(s: Schema | undefined): s is Schema {\n  return !!s && (typeOf(s) === 'object' || !!s.allOf);\n}\n\n/** The `GET /users/{id}` route for list route `GET /users`, if the spec has one. */\nexport function findDetailRoute(routes: MockRoute[], list: MockRoute): MockRoute | undefined {\n  const prefix = `${list.path.replace(/\\/$/, '')}/{`;\n  return routes.find(\n    (r) => r.method === 'GET' && r.path.startsWith(prefix) && r.path.endsWith('}') && !r.path.slice(prefix.length).includes('/'),\n  );\n}\n\nexport interface PageWindow {\n  offset: number;\n  limit: number;\n  /** 1-based. */\n  page: number;\n  total: number;\n}\n\nconst LIMIT_PARAMS = ['limit', 'per_page', 'perPage', 'page_size', 'pageSize', 'size', 'first'];\nconst OFFSET_PARAMS = ['offset', 'skip', 'start'];\nconst PAGE_PARAMS = ['page', 'page_number', 'pageNumber'];\nconst CURSOR_PARAMS = ['cursor', 'after', 'starting_after', 'page_token', 'pageToken'];\n\n/** Work out which slice of the collection a request asks for. */\nexport function readPage(query: URLSearchParams, arraySchema: Schema, total: number, defaultLimit = 10): PageWindow {\n  const min = Math.max(1, arraySchema.minItems ?? 1);\n  const max = Math.min(1000, arraySchema.maxItems ?? 1000);\n  const limit = clamp(firstInt(query, LIMIT_PARAMS) ?? defaultLimit, min, Math.max(min, max));\n  const cursor = CURSOR_PARAMS.map((p) => query.get(p)).find(Boolean);\n  const page = firstInt(query, PAGE_PARAMS);\n  const offset = Math.max(0, (cursor ? decodeCursor(cursor) : undefined) ?? firstInt(query, OFFSET_PARAMS) ?? ((page ?? 1) - 1) * limit);\n  return { offset, limit, page: page && page > 0 ? page : Math.floor(offset / limit) + 1, total };\n}\n\nexport interface BuildPageInput {\n  /** The list response's schema. */\n  schema: Schema;\n  /** Concrete request path, used to seed records and build next/prev links. */\n  requestPath: string;\n  query: URLSearchParams;\n  origin?: string;\n  seed?: number;\n  shape: ListShape;\n  /** Generated response body; for wrapped lists, its metadata is filled in place. */\n  body: unknown;\n  total: number;\n  /** Name of the id property that links items to the detail route. */\n  idKey?: string;\n  /** Detail response for an id, used to make list items agree with `GET /x/{id}`. */\n  detail?: (id: unknown) => Record<string, unknown> | undefined;\n  /** The detail route's schema; fields it shares with the item need no re-check. */\n  detailSchema?: Schema;\n}\n\nexport function buildPage(input: BuildPageInput): { body: unknown; headers: Record<string, string> } {\n  const { shape, query, total } = input;\n  const win = readPage(query, shape.arraySchema, total);\n  const item = shape.itemSchema.allOf ? mergeAllOf(shape.itemSchema) : shape.itemSchema;\n  const props: Record<string, Schema> = item.properties ?? {};\n  const idKey = input.idKey && input.idKey in props ? input.idKey : 'id' in props ? 'id' : undefined;\n\n  const items: unknown[] = [];\n  const required = new Set<string>(item.required ?? []);\n  const projectable = !item.oneOf && !item.anyOf && !!item.properties;\n  const detailProps: Record<string, Schema> = (input.detailSchema?.allOf ? mergeAllOf(input.detailSchema) : input.detailSchema)?.properties ?? {};\n  for (let i = win.offset; i < Math.min(total, win.offset + win.limit); i++) {\n    const key = `${input.requestPath}#${i}`;\n    const id = idKey ? recordId(props[idKey]!, i, input.seed, key) : undefined;\n    const detail = id !== undefined ? input.detail?.(id) : undefined;\n    if (detail && !projectable) {\n      // Items that are a oneOf/anyOf can't be projected field by field: generate, then overlay.\n      const record = generate(shape.itemSchema, { seed: input.seed, key }) as Record<string, unknown>;\n      for (const prop of Object.keys(record)) if (prop in detail && fits(detail[prop], props[prop])) record[prop] = detail[prop];\n      items.push(record);\n      continue;\n    }\n    if (!detail) {\n      const record = generate(shape.itemSchema, { seed: input.seed, key }) as Record<string, unknown>;\n      if (idKey && id !== undefined && fits(id, props[idKey])) record[idKey] = id;\n      items.push(record);\n      continue;\n    }\n    // The detail record is the source of truth: project it onto the item's fields\n    // rather than generating the item too (twice the work, on the hottest path).\n    const record: Record<string, unknown> = {};\n    for (const [prop, propSchema] of Object.entries(props)) {\n      if (prop in detail && (detailProps[prop] === propSchema || fits(detail[prop], propSchema))) record[prop] = detail[prop];\n      else if (required.has(prop)) record[prop] = generate(propSchema, { seed: input.seed, key: `${key}.${prop}` });\n    }\n    // Required keys without a property schema still have to be there.\n    for (const prop of required) if (!(prop in record)) record[prop] = prop in detail ? detail[prop] : generate({}, { seed: input.seed, key: `${key}.${prop}` });\n    items.push(record);\n  }\n\n  const hasMore = win.offset + items.length < total;\n  const headers: Record<string, string> = { 'x-total-count': String(total) };\n  const links = navLinks(input, win, hasMore);\n  const link = [links.next && `<${links.next}>; rel=\"next\"`, links.prev && `<${links.prev}>; rel=\"prev\"`].filter(Boolean).join(', ');\n  if (link) headers.link = link;\n\n  if (!shape.key) return { body: items, headers };\n  const body = (input.body && typeof input.body === 'object' ? input.body : {}) as Record<string, unknown>;\n  body[shape.key] = items;\n  const schema = input.schema.allOf ? mergeAllOf(input.schema) : input.schema;\n  fillMeta(body, schema, { ...win, count: items.length, hasMore, links }, shape.key, 0);\n  return { body, headers };\n}\n\ninterface MetaInfo extends PageWindow {\n  count: number;\n  hasMore: boolean;\n  links: { next?: string; prev?: string; nextCursor?: string; prevCursor?: string };\n}\n\n/** Fill pagination fields (`total`, `page`, `next`, `meta.pagination.totalPages`, …) by name. */\nfunction fillMeta(obj: Record<string, unknown>, schema: Schema | undefined, m: MetaInfo, listKey: string | undefined, depth: number) {\n  const props: Record<string, Schema> = schema?.properties ?? {};\n  const totalPages = Math.max(1, Math.ceil(m.total / m.limit));\n  for (const [key, value] of Object.entries(obj)) {\n    if (key === listKey) continue;\n    const s = props[key];\n    const n = normalizeName(key);\n    const set = (v: unknown) => {\n      if (fits(v, s)) obj[key] = v;\n    };\n    // Last page: nullable `next` becomes null, optional `next` disappears.\n    const end = () => {\n      if (s && (fits(null, s) || s.nullable)) obj[key] = null;\n      else if (!(schema?.required ?? []).includes(key)) delete obj[key];\n    };\n\n    if (/^(total|totalcount|totalitems|totalresults|totalrecords|totalelements|totalentries|count|totalsize)$/.test(n)) set(n === 'count' && 'total' in obj ? m.count : m.total); // `count` next to `total` is the page size\n    else if (/^(page|currentpage|pagenumber|pageindex)$/.test(n)) set(m.page);\n    else if (/^(perpage|pagesize|limit|size|itemsperpage|pagelength)$/.test(n)) set(m.limit);\n    else if (/^(totalpages|pagecount|pages|lastpage)$/.test(n)) set(totalPages);\n    else if (/^(offset|skip|start)$/.test(n)) set(m.offset);\n    else if (/^(hasmore|hasnext|hasnextpage|more)$/.test(n)) set(m.hasMore);\n    else if (/^(hasprev|hasprevious|haspreviouspage)$/.test(n)) set(m.offset > 0);\n    else if (/^(next|nextpage|nexturl|nextlink|nextcursor|endcursor|cursor)$/.test(n)) {\n      if (!m.hasMore) end();\n      else if (typeof value === 'number' || (s && /integer|number/.test(String(typeOf(s))))) set(m.page + 1);\n      else set(/cursor/.test(n) ? m.links.nextCursor : m.links.next);\n    } else if (/^(prev|previous|prevpage|previouspage|prevurl|prevlink|startcursor)$/.test(n)) {\n      if (m.offset === 0) end();\n      else if (typeof value === 'number' || (s && /integer|number/.test(String(typeOf(s))))) set(m.page - 1);\n      else set(/cursor/.test(n) ? m.links.prevCursor : m.links.prev);\n    } else if (depth < 2 && value && typeof value === 'object' && !Array.isArray(value)) {\n      fillMeta(value as Record<string, unknown>, s && (s.allOf ? mergeAllOf(s) : s), m, undefined, depth + 1);\n    }\n  }\n}\n\n/** Record i's id: sequential for numeric ids, otherwise generated from the id schema alone. */\nfunction recordId(idSchema: Schema, i: number, seed: number | undefined, key: string): unknown {\n  const t = typeOf(idSchema);\n  if (t === 'integer' || t === 'number') {\n    const id = Math.max(1, Math.ceil(idSchema.minimum ?? 1)) + i;\n    if (idSchema.maximum === undefined || id <= idSchema.maximum) return id;\n  }\n  return generate(idSchema, { seed, key: `${key}.id` });\n}\n\nfunction navLinks(input: BuildPageInput, win: PageWindow, hasMore: boolean): MetaInfo['links'] {\n  const link = (offset: number) => {\n    const q = new URLSearchParams(input.query);\n    for (const p of CURSOR_PARAMS) q.delete(p);\n    const usesOffset = OFFSET_PARAMS.some((p) => q.has(p));\n    if (usesOffset) for (const p of OFFSET_PARAMS) q.has(p) && q.set(p, String(offset));\n    else q.set(PAGE_PARAMS.find((p) => q.has(p)) ?? 'page', String(Math.floor(offset / win.limit) + 1));\n    if (!LIMIT_PARAMS.some((p) => q.has(p))) q.set('limit', String(win.limit));\n    return `${input.origin ?? ''}${input.requestPath}?${q}`;\n  };\n  const prevOffset = Math.max(0, win.offset - win.limit);\n  return {\n    next: hasMore ? link(win.offset + win.limit) : undefined,\n    prev: win.offset > 0 ? link(prevOffset) : undefined,\n    nextCursor: hasMore ? encodeCursor(win.offset + win.limit) : undefined,\n    prevCursor: win.offset > 0 ? encodeCursor(prevOffset) : undefined,\n  };\n}\n\n/** Opaque-looking cursors that are really offsets, so any cursor we hand out works. */\nexport function encodeCursor(offset: number): string {\n  return Buffer.from(`o:${offset}`).toString('base64url');\n}\n\nfunction decodeCursor(cursor: string): number | undefined {\n  const m = /^o:(\\d+)$/.exec(Buffer.from(cursor, 'base64url').toString());\n  return m ? Number(m[1]) : undefined;\n}\n\nfunction firstInt(query: URLSearchParams, names: string[]): number | undefined {\n  for (const name of names) {\n    const v = query.get(name);\n    if (v !== null && /^-?\\d+$/.test(v)) return Number(v);\n  }\n  return undefined;\n}\n\nfunction clamp(n: number, min: number, max: number): number {\n  return Math.min(max, Math.max(min, n));\n}\n"]}

package/dist/generate.d.ts

@@ -0,0 +1,13 @@
+import type { Schema } from './model.js';
+export interface GenerateOptions {
+    /** Global seed; the same seed + key always yields the same value. */
+    seed?: number;
+    /** Distinguishes values under one seed, e.g. `GET /users/42 200`. */
+    key?: string;
+    /** Recursion limit for circular schemas. */
+    maxDepth?: number;
+}
+/** Generate a realistic, deterministic value that satisfies `schema`. */
+export declare function generate(schema: Schema | undefined, opts?: GenerateOptions): unknown;
+/** 32-bit FNV-1a; stable across platforms and Node versions. */
+export declare function hash(input: string): number;

package/dist/generate.js

@@ -0,0 +1,377 @@
+import { faker as enFaker } from '@faker-js/faker/locale/en';
+import RandExp from 'randexp';
+import { countMatches, discriminatorOf, fits, mergeAllOf, mergeBranch, typeOf } from './schema.js';
+import { looksLikeDate, looksLikeDateTime, numberByName, stringByName } from './heuristics.js';
+// Faker's date helpers default to "now"; pin them so output never drifts.
+const REF_DATE = new Date('2026-01-01T00:00:00.000Z');
+// The package root loads every locale (~23 MB of RSS); the `locale/en` entry only
+// exports a shared instance, so build a private one from its class and definitions.
+const FakerClass = enFaker.constructor;
+const faker = new FakerClass({ locale: enFaker.rawDefinitions });
+faker.setDefaultRefDate(REF_DATE);
+// Filling every optional field of every nested object explodes on big specs (Stripe
+// objects nest dozens of expandable objects). Past this depth, or once this many
+// values have been generated, only required fields and minItems are filled.
+// 250 keeps a Stripe list page of 10 full records near 15 ms (the target is 20 ms
+// p95) while every top-level field of a record is still present.
+const RICH_DEPTH = 3;
+const VALUE_BUDGET = 250;
+/** Generate a realistic, deterministic value that satisfies `schema`. */
+export function generate(schema, opts = {}) {
+    faker.seed(hash(`${opts.seed ?? 1}:${opts.key ?? ''}`));
+    return gen(schema ?? {}, { depth: 0, maxDepth: opts.maxDepth ?? 8, budget: { values: VALUE_BUDGET } });
+}
+function gen(schema, ctx) {
+    // Real examples beat fake data, unless the spec's example contradicts its own schema.
+    if (schema.example !== undefined && fits(schema.example, schema))
+        return structuredClone(schema.example);
+    const example = Array.isArray(schema.examples) ? schema.examples.find((e) => fits(e, schema)) : undefined;
+    if (example !== undefined)
+        return structuredClone(example);
+    if ('const' in schema)
+        return schema.const;
+    if (Array.isArray(schema.enum) && schema.enum.length) {
+        // Specs sometimes list enum values their own pattern or maxLength rejects.
+        const { enum: values, ...rest } = schema;
+        const valid = values.filter((v) => v !== null && fits(v, rest));
+        const options = valid.length ? valid : values.filter((v) => v !== null);
+        return faker.helpers.arrayElement(options.length ? options : values);
+    }
+    if (Array.isArray(schema.allOf))
+        return gen(mergeAllOf(schema), ctx);
+    const choices = schema.oneOf ?? schema.anyOf;
+    if (Array.isArray(choices) && choices.length)
+        return genChoice(schema, choices, Array.isArray(schema.oneOf), ctx);
+    switch (typeOf(schema)) {
+        case 'null':
+            return null;
+        case 'object':
+            return genObject(schema, ctx);
+        case 'array':
+            return genArray(schema, ctx);
+        case 'integer':
+            return genNumber(schema, ctx, true);
+        case 'number':
+            return genNumber(schema, ctx, false);
+        case 'boolean':
+            return faker.datatype.boolean();
+        case 'string':
+            return genString(schema, ctx);
+        default:
+            return faker.word.noun();
+    }
+}
+/**
+ * Optional fields real APIs only fill when the client asks (HAL's `_embedded` via
+ * `?expand=`). Generating them makes every record several times larger than the real
+ * thing. Required ones are still filled.
+ */
+const ON_REQUEST = new Set(['_embedded']);
+function lean(ctx) {
+    return ctx.minimal === true || ctx.depth > RICH_DEPTH || ctx.budget.values <= 0;
+}
+/**
+ * Pick a `oneOf`/`anyOf` branch and generate from it. Branches often overlap (two
+ * object shapes with no required fields both accept `{}`), so each candidate is
+ * checked: it must satisfy its branch, and for `oneOf` no other branch.
+ */
+function genChoice(schema, choices, exclusive, ctx) {
+    const rest = choiceBase(schema);
+    const disc = discriminatorOf(schema);
+    if (disc)
+        return genDiscriminated(rest, disc, ctx);
+    // Deep in the tree, prefer the cheapest branch (`string` over an expanded object).
+    const order = lean(ctx) ? [...choices].sort((a, b) => cost(a) - cost(b)) : faker.helpers.shuffle([...choices]);
+    let fallback;
+    // A rejected candidate must not eat the budget of the next one, or later
+    // candidates come out bare and match every branch.
+    const budget = ctx.budget.values;
+    // Second pass: a full object often satisfies a loose sibling branch too, while
+    // the bare required fields of the same branch don't.
+    for (const attempt of [ctx, { ...ctx, minimal: true }]) {
+        for (const branch of order.slice(0, 4)) {
+            const s = Object.keys(rest).length ? mergeBranch(rest, branch) : branch;
+            ctx.budget.values = budget;
+            const value = gen(s, attempt);
+            if (fallback === undefined)
+                fallback = value;
+            if (!fits(value, s))
+                continue;
+            if (exclusive && choices.length > 1 && countMatches(value, choices, 0, 2) !== 1)
+                continue;
+            return value;
+        }
+        if (!exclusive)
+            break;
+    }
+    return fallback;
+}
+/** With a discriminator the branch is chosen by value, and the record carries that value. */
+function genDiscriminated(rest, disc, ctx) {
+    const shared = Object.keys(rest).length > 0;
+    const branchOf = (m) => (shared ? mergeBranch(rest, m.schema) : m.schema);
+    // Skip mapping values the branch's own property schema rejects (a spec bug, but common).
+    const usable = disc.mapping.filter((m) => {
+        const s = branchOf(m);
+        const prop = (s.allOf ? mergeAllOf(s) : s).properties?.[disc.property];
+        return !prop || fits(m.value, prop);
+    });
+    const entry = faker.helpers.arrayElement(usable.length ? usable : disc.mapping);
+    const value = gen(branchOf(entry), ctx);
+    if (value && typeof value === 'object' && !Array.isArray(value))
+        value[disc.property] = entry.value;
+    return value;
+}
+// Per-schema derived data, cached by identity: schemas never change, records repeat.
+const baseCache = new WeakMap();
+const siblingCache = new WeakMap();
+/** A oneOf/anyOf schema minus its alternatives: what every branch is merged with. */
+function choiceBase(schema) {
+    let base = baseCache.get(schema);
+    if (!base) {
+        const { oneOf, anyOf, discriminator, ...rest } = schema;
+        baseCache.set(schema, (base = rest));
+    }
+    return base;
+}
+function siblingsOf(props) {
+    let set = siblingCache.get(props);
+    if (!set)
+        siblingCache.set(props, (set = new Set(Object.keys(props).map((k) => k.toLowerCase()))));
+    return set;
+}
+function cost(s) {
+    if (s.enum || 'const' in s)
+        return 0;
+    const t = typeOf(s);
+    if (t === 'object')
+        return 2 + (s.required?.length ?? 0);
+    if (t === 'array')
+        return 2 + (s.minItems ?? 0);
+    if (s.allOf || s.oneOf || s.anyOf)
+        return 3;
+    return t ? 1 : 3;
+}
+function genObject(schema, ctx) {
+    const out = {};
+    if (ctx.depth >= ctx.maxDepth)
+        return out;
+    const props = schema.properties ?? {};
+    const required = new Set(schema.required ?? []);
+    const record = { siblings: siblingsOf(props), owner: ctx.name };
+    for (const [name, propSchema] of Object.entries(props)) {
+        if (propSchema.writeOnly)
+            continue;
+        if (!required.has(name) && (lean(ctx) || ON_REQUEST.has(name)))
+            continue;
+        ctx.budget.values--;
+        out[name] = gen(propSchema, { ...ctx, depth: ctx.depth + 1, name, record });
+    }
+    // Required keys the schema never describes still have to be present.
+    const extra = typeof schema.additionalProperties === 'object' ? schema.additionalProperties : {};
+    for (const name of required) {
+        if (!(name in out) && !props[name]?.writeOnly)
+            out[name] = gen(extra, { ...ctx, depth: ctx.depth + 1, name, record });
+    }
+    if (!schema.properties && schema.additionalProperties && typeof schema.additionalProperties === 'object' && !lean(ctx)) {
+        const count = faker.number.int({ min: 1, max: 3 });
+        for (let i = 0; i < count; i++) {
+            out[faker.word.noun()] = gen(schema.additionalProperties, { ...ctx, depth: ctx.depth + 1, name: undefined });
+        }
+    }
+    return out;
+}
+function genArray(schema, ctx) {
+    const min = schema.minItems ?? 0;
+    if (ctx.depth >= ctx.maxDepth)
+        return [];
+    // Nested arrays multiply (a list of invoices of line items of taxes): keep inner ones short.
+    const max = Math.max(min, schema.maxItems ?? Math.max(min, ctx.depth > 1 ? 3 : 5));
+    const count = lean(ctx) ? min : faker.number.int({ min: Math.max(min, Math.min(2, max)), max });
+    const items = schema.items ?? {};
+    // Items of a `users` array are users, so keep the singular name as the hint.
+    const name = ctx.name?.replace(/ies$/, 'y').replace(/(ss|x|sh|ch|us)es$/, '$1').replace(/([^s])s$/, '$1');
+    const out = [];
+    const seen = new Set();
+    for (let attempts = 0; out.length < count && attempts < count * 5; attempts++) {
+        const value = gen(items, { ...ctx, depth: ctx.depth + 1, name, record: undefined });
+        if (schema.uniqueItems) {
+            const k = JSON.stringify(value);
+            if (seen.has(k))
+                continue;
+            seen.add(k);
+        }
+        out.push(value);
+    }
+    return out;
+}
+function genNumber(schema, ctx, integer) {
+    let lo = schema.minimum ?? -Infinity;
+    let hi = schema.maximum ?? Infinity;
+    // 3.0 uses booleans for exclusive bounds; 3.1 uses numbers.
+    const step = integer ? 1 : 0.01;
+    if (typeof schema.exclusiveMinimum === 'number')
+        lo = Math.max(lo, schema.exclusiveMinimum + step);
+    else if (schema.exclusiveMinimum === true)
+        lo += step;
+    if (typeof schema.exclusiveMaximum === 'number')
+        hi = Math.min(hi, schema.exclusiveMaximum - step);
+    else if (schema.exclusiveMaximum === true)
+        hi -= step;
+    const hinted = ctx.name ? numberByName(faker, ctx.name, integer || schema.format === 'int64' || schema.format === 'int32') : undefined;
+    let value;
+    if (hinted !== undefined && hinted >= lo && hinted <= hi) {
+        value = hinted;
+    }
+    else {
+        const min = Number.isFinite(lo) ? lo : Number.isFinite(hi) ? hi - 1000 : 0;
+        const max = Number.isFinite(hi) ? hi : min + 1000;
+        value = integer
+            ? faker.number.int({ min: Math.ceil(min), max: Math.floor(max) })
+            : faker.number.float({ min, max, fractionDigits: 2 });
+    }
+    if (schema.multipleOf) {
+        const m = schema.multipleOf;
+        let snapped = Math.round(value / m) * m;
+        if (snapped < lo)
+            snapped += m;
+        if (snapped > hi)
+            snapped -= m;
+        value = Number(snapped.toFixed(10));
+    }
+    if (integer)
+        value = Math.round(value);
+    return value;
+}
+function genString(schema, ctx) {
+    const rec = ctx.record ?? { siblings: new Set() };
+    // `avatarUrl: {format: uri}` should still be an avatar, and `email` should match `firstName`.
+    const named = ctx.name && NAMED_FORMATS.has(schema.format) ? namedFormat(schema.format, stringByName(faker, ctx.name, rec, schema)) : undefined;
+    let value = named ?? byFormat(schema.format) ?? byPattern(schema.pattern);
+    if (value === undefined && ctx.name) {
+        if (looksLikeDate(ctx.name))
+            value = isoDate(faker.date.birthdate());
+        else if (looksLikeDateTime(ctx.name))
+            value = faker.date.past({ years: 2 }).toISOString();
+        else
+            value = stringByName(faker, ctx.name, rec, schema);
+    }
+    value ??= faker.lorem.words({ min: 1, max: 3 });
+    if (schema.format || schema.pattern)
+        return value;
+    const min = schema.minLength ?? 0;
+    const max = schema.maxLength ?? Infinity;
+    while (value.length < min)
+        value += faker.string.alpha({ length: min - value.length, casing: 'lower' });
+    if (value.length > max)
+        value = value.slice(0, max);
+    return value;
+}
+/** Formats where a name-based value (an avatar URL, a matching email) beats a generic one. */
+const NAMED_FORMATS = new Set(['email', 'idn-email', 'uri', 'url', 'iri']);
+/** Keep a name-based value when it also satisfies the generic format. */
+function namedFormat(format, candidate) {
+    if (candidate === undefined)
+        return undefined;
+    if (format === 'email' || format === 'idn-email')
+        return /^[^@\s]+@[^@\s]+\.[^@\s]+$/.test(candidate) ? candidate : undefined;
+    if (format === 'uri' || format === 'url' || format === 'iri')
+        return URL.canParse(candidate) ? candidate : undefined;
+    return undefined;
+}
+function byFormat(format) {
+    switch (format) {
+        case 'email':
+        case 'idn-email':
+            return faker.internet.email().toLowerCase();
+        case 'uri':
+        case 'url':
+        case 'iri':
+            return faker.internet.url();
+        case 'uri-reference':
+            return `/${faker.lorem.slug(2)}`;
+        case 'uuid':
+            return faker.string.uuid();
+        case 'date':
+            return isoDate(faker.date.past({ years: 2 }));
+        case 'date-time':
+            return faker.date.past({ years: 2 }).toISOString();
+        case 'time':
+            return `${faker.date.past().toISOString().slice(11, 19)}Z`;
+        case 'duration':
+            return `PT${faker.number.int({ min: 1, max: 59 })}M`;
+        case 'ipv4':
+            return faker.internet.ipv4();
+        case 'ipv6':
+            return faker.internet.ipv6();
+        case 'hostname':
+        case 'idn-hostname':
+            return faker.internet.domainName();
+        case 'byte':
+            return Buffer.from(faker.lorem.words(3)).toString('base64');
+        case 'binary':
+            return faker.string.alphanumeric(16);
+        case 'password':
+            return faker.internet.password({ length: 16 });
+        case 'json-pointer':
+            return `/${faker.word.noun()}/${faker.number.int(9)}`;
+        case 'relative-json-pointer':
+            return `0/${faker.word.noun()}`;
+        case 'uri-template':
+            return `https://${faker.internet.domainName()}/items/{id}`;
+        case 'iri-reference':
+            return `/${faker.lorem.slug(2)}`;
+        case 'regex':
+            return '^[a-z0-9-]+$';
+        default:
+            return undefined;
+    }
+}
+function byPattern(pattern) {
+    if (!pattern)
+        return undefined;
+    const compiled = patternGenerator(pattern);
+    if (!compiled)
+        return undefined;
+    for (let i = 0; i < 10; i++) {
+        const candidate = compiled.gen.gen();
+        if (compiled.re.test(candidate))
+            return candidate;
+    }
+    return undefined;
+}
+// Compiling a RandExp per value dominated pattern-heavy specs; compile once per pattern.
+// Its randomness comes from the shared, reseeded faker, so reuse stays deterministic.
+const patternCache = new Map();
+function patternGenerator(pattern) {
+    let compiled = patternCache.get(pattern);
+    if (compiled === undefined) {
+        try {
+            const gen = new RandExp(pattern);
+            gen.max = 5; // Cap `*` and `+` so values stay short.
+            gen.randInt = (min, max) => faker.number.int({ min, max });
+            // Keep generated characters printable ASCII unless the pattern says otherwise.
+            gen.defaultRange.subtract(0, 31);
+            gen.defaultRange.subtract(127, 65535);
+            compiled = { re: new RegExp(pattern, 'u'), gen };
+        }
+        catch {
+            compiled = null; // Unsupported regex features fall through to a plain string.
+        }
+        patternCache.set(pattern, compiled);
+    }
+    return compiled;
+}
+function isoDate(d) {
+    return d.toISOString().slice(0, 10);
+}
+/** 32-bit FNV-1a; stable across platforms and Node versions. */
+export function hash(input) {
+    let h = 0x811c9dc5;
+    for (let i = 0; i < input.length; i++) {
+        h ^= input.charCodeAt(i);
+        h = Math.imul(h, 0x01000193);
+    }
+    return h >>> 0;
+}
+//# sourceMappingURL=generate.js.map