@strapi/utils 5.61.0 → 5.62.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/email-regex.d.ts +2 -0
- package/dist/email-regex.d.ts.map +1 -0
- package/dist/email-regex.js +17 -0
- package/dist/email-regex.js.map +1 -0
- package/dist/email-regex.mjs +15 -0
- package/dist/email-regex.mjs.map +1 -0
- package/dist/errors.d.ts +1 -0
- package/dist/errors.d.ts.map +1 -1
- package/dist/errors.js +35 -0
- package/dist/errors.js.map +1 -1
- package/dist/errors.mjs +35 -0
- package/dist/errors.mjs.map +1 -1
- package/dist/index.d.ts +1 -0
- package/dist/index.d.ts.map +1 -1
- package/dist/index.js +2 -0
- package/dist/index.js.map +1 -1
- package/dist/index.mjs +1 -0
- package/dist/index.mjs.map +1 -1
- package/dist/pagination.d.ts +9 -5
- package/dist/pagination.d.ts.map +1 -1
- package/dist/pagination.js +2 -1
- package/dist/pagination.js.map +1 -1
- package/dist/pagination.mjs +2 -1
- package/dist/pagination.mjs.map +1 -1
- package/dist/sanitize/index.d.ts +2 -2
- package/dist/sanitize/index.d.ts.map +1 -1
- package/dist/sanitize/index.js.map +1 -1
- package/dist/sanitize/index.mjs.map +1 -1
- package/dist/sanitize/sanitizers.d.ts +3 -3
- package/dist/sanitize/sanitizers.d.ts.map +1 -1
- package/dist/sanitize/sanitizers.js +13 -11
- package/dist/sanitize/sanitizers.js.map +1 -1
- package/dist/sanitize/sanitizers.mjs +13 -11
- package/dist/sanitize/sanitizers.mjs.map +1 -1
- package/dist/traverse/factory.d.ts +7 -0
- package/dist/traverse/factory.d.ts.map +1 -1
- package/dist/traverse/factory.js +18 -4
- package/dist/traverse/factory.js.map +1 -1
- package/dist/traverse/factory.mjs +18 -4
- package/dist/traverse/factory.mjs.map +1 -1
- package/dist/traverse/query-populate.d.ts.map +1 -1
- package/dist/traverse/query-populate.js +47 -13
- package/dist/traverse/query-populate.js.map +1 -1
- package/dist/traverse/query-populate.mjs +47 -13
- package/dist/traverse/query-populate.mjs.map +1 -1
- package/dist/traverse-entity.d.ts +5 -5
- package/dist/traverse-entity.d.ts.map +1 -1
- package/dist/traverse-entity.js.map +1 -1
- package/dist/traverse-entity.mjs.map +1 -1
- package/dist/types.d.ts +9 -0
- package/dist/types.d.ts.map +1 -1
- package/dist/validate/index.d.ts +2 -2
- package/dist/validate/index.d.ts.map +1 -1
- package/dist/validate/index.js.map +1 -1
- package/dist/validate/index.mjs.map +1 -1
- package/dist/validate/validators.d.ts.map +1 -1
- package/dist/validate/validators.js +12 -12
- package/dist/validate/validators.js.map +1 -1
- package/dist/validate/validators.mjs +12 -12
- package/dist/validate/validators.mjs.map +1 -1
- package/dist/yup.d.ts.map +1 -1
- package/dist/yup.js +17 -0
- package/dist/yup.js.map +1 -1
- package/dist/yup.mjs +17 -0
- package/dist/yup.mjs.map +1 -1
- package/package.json +4 -4
package/dist/traverse/factory.js
CHANGED
|
@@ -14,13 +14,23 @@ var traverseFactory = (()=>{
|
|
|
14
14
|
common: []
|
|
15
15
|
}
|
|
16
16
|
};
|
|
17
|
-
|
|
17
|
+
/**
|
|
18
|
+
* `owned` is true when `data` is part of a copy this traversal has already made.
|
|
19
|
+
*
|
|
20
|
+
* A parser's `set` and `remove` build new objects instead of writing into the data, so a
|
|
21
|
+
* single copy of the caller's data is enough to keep it untouched, and to keep the result from
|
|
22
|
+
* sharing objects with it. Values a handler recurses into come from that copy, from the
|
|
23
|
+
* handler, or from a visitor's `set`, and are walked without copying them again. A visitor
|
|
24
|
+
* must therefore `set` a fresh value, not one it shares with anything else.
|
|
25
|
+
*/ const walk = async (visitor, options, data, owned)=>{
|
|
18
26
|
const { path = DEFAULT_PATH, parent, schema, getModel } = options ?? {};
|
|
19
27
|
// interceptors
|
|
20
28
|
for (const { predicate, handler } of state.interceptors){
|
|
21
29
|
if (predicate(data)) {
|
|
30
|
+
// An interceptor can hand the caller's own data to the recursion (for example the
|
|
31
|
+
// items of a filters array), so it only skips the copy when this level already owns it.
|
|
22
32
|
return handler(visitor, options, data, {
|
|
23
|
-
recurse: traverse
|
|
33
|
+
recurse: owned ? traverseOwned : traverse
|
|
24
34
|
});
|
|
25
35
|
}
|
|
26
36
|
}
|
|
@@ -32,7 +42,7 @@ var traverseFactory = (()=>{
|
|
|
32
42
|
return data;
|
|
33
43
|
}
|
|
34
44
|
// main loop
|
|
35
|
-
let out = utils.transform(data);
|
|
45
|
+
let out = utils.transform(owned || !utils.clone ? data : utils.clone(data));
|
|
36
46
|
const keys = utils.keys(out);
|
|
37
47
|
// Built once per traversal rather than once per key. `state.handlers` is populated
|
|
38
48
|
// while the traversal is being defined and is fixed by the time it runs, so spreading
|
|
@@ -53,7 +63,8 @@ var traverseFactory = (()=>{
|
|
|
53
63
|
set (key, value) {
|
|
54
64
|
out = utils.set(key, value, out);
|
|
55
65
|
},
|
|
56
|
-
recurse
|
|
66
|
+
// Handlers recurse into values of `out`, which this traversal owns.
|
|
67
|
+
recurse: traverseOwned
|
|
57
68
|
};
|
|
58
69
|
// Pre-picked instead of calling lodash `pick` per key, which allocated both the
|
|
59
70
|
// key-list array literal and a fresh result object every time.
|
|
@@ -142,6 +153,9 @@ var traverseFactory = (()=>{
|
|
|
142
153
|
}
|
|
143
154
|
return out;
|
|
144
155
|
};
|
|
156
|
+
// Entry point: the data comes from the caller, so it is copied before it is walked.
|
|
157
|
+
const traverse = (visitor, options, data)=>walk(visitor, options, data, false);
|
|
158
|
+
const traverseOwned = (visitor, options, data)=>walk(visitor, options, data, true);
|
|
145
159
|
return {
|
|
146
160
|
traverse,
|
|
147
161
|
intercept (predicate, handler) {
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"factory.js","sources":["../../src/traverse/factory.ts"],"sourcesContent":["/* eslint-disable @typescript-eslint/no-loop-func */\nimport {\n AnyAttribute,\n Attribute,\n ComponentAttribute,\n DynamicZoneAttribute,\n Model,\n RelationalAttribute,\n} from '../types';\n\nexport interface Path {\n raw: string | null;\n attribute: string | null;\n}\n\nexport interface Parent {\n attribute?: Attribute;\n key: string | null;\n path: Path;\n schema: Model;\n}\n\nexport interface TraverseOptions {\n schema: Model;\n path?: Path;\n parent?: Parent;\n getModel(uid: string): Model;\n}\n\nexport interface VisitorOptions {\n data: unknown;\n value: unknown;\n schema: Model;\n key: string;\n attribute?: AnyAttribute;\n path: Path;\n parent?: Parent;\n getModel(uid: string): Model;\n}\n\nexport type Traverse = (\n visitor: Visitor,\n options: TraverseOptions,\n data: unknown\n) => Promise<unknown>;\n\nexport interface Visitor {\n (visitorOptions: VisitorOptions, opts: Pick<TransformUtils, 'set' | 'remove'>): void;\n}\n\ninterface Interceptor<T = unknown> {\n predicate(data: unknown): data is T;\n handler(\n visitor: Visitor,\n options: TraverseOptions,\n data: T,\n recurseOptions: { recurse: Traverse }\n ): void;\n}\n\ninterface ParseUtils<T> {\n transform(data: T): unknown;\n remove(key: string, data: T): unknown;\n set(key: string, value: unknown, data: T): unknown;\n keys(data: T): string[];\n get(key: string, data: T): unknown;\n}\n\ninterface Parser<T = unknown> {\n predicate(data: unknown): data is T;\n parser(data: T): ParseUtils<T>;\n}\n\ninterface Ignore {\n (ctx: Context): boolean;\n}\n\ninterface AttributeHandler<AttributeType = Attribute> {\n predicate(ctx: Context<AttributeType>): boolean;\n handler(ctx: Context<AttributeType>, opts: Pick<TransformUtils, 'set' | 'recurse'>): void;\n}\ninterface CommonHandler<AttributeType = Attribute> {\n predicate(ctx: Context<AttributeType>): boolean;\n handler(ctx: Context<AttributeType>, opts: Pick<TransformUtils, 'set' | 'recurse'>): void;\n}\n\nexport interface TransformUtils {\n remove(key: string): void;\n set(key: string, value: unknown): void;\n recurse: Traverse;\n}\n\ninterface Context<AttributeType = Attribute> {\n key: string;\n value: unknown;\n attribute: AttributeType;\n schema: Model;\n path: Path;\n data: unknown;\n visitor: Visitor;\n parent?: Parent;\n getModel(uid: string): Model;\n}\n\ninterface State {\n parsers: Parser[];\n interceptors: Interceptor[];\n ignore: Ignore[];\n handlers: {\n attributes: AttributeHandler[];\n common: CommonHandler[];\n };\n}\n\nconst DEFAULT_PATH = { raw: null, attribute: null } satisfies Path;\n\nexport default () => {\n const state: State = {\n parsers: [],\n interceptors: [],\n ignore: [],\n handlers: {\n attributes: [],\n common: [],\n },\n };\n\n const traverse: Traverse = async (visitor, options, data) => {\n const { path = DEFAULT_PATH, parent, schema, getModel } = options ?? {};\n\n // interceptors\n for (const { predicate, handler } of state.interceptors) {\n if (predicate(data)) {\n return handler(visitor, options, data, { recurse: traverse });\n }\n }\n\n // parsers\n const parser = state.parsers.find((parser) => parser.predicate(data))?.parser;\n const utils = parser?.(data);\n\n // Return the data untouched if we don't know how to traverse it\n if (!utils) {\n return data;\n }\n\n // main loop\n let out = utils.transform(data);\n const keys = utils.keys(out);\n\n // Built once per traversal rather than once per key. `state.handlers` is populated\n // while the traversal is being defined and is fixed by the time it runs, so spreading\n // both lists on every key allocated a fresh array to hold the same handlers. This\n // loop runs for every key of every node of every query, which made it one of the\n // hottest allocation sites in a request.\n const handlers = [...state.handlers.common, ...state.handlers.attributes];\n\n // Also hoisted: none of these close over `key` (each method takes it as an argument),\n // so the previous code allocated three closures per key to no end. They still mutate\n // the same `out` binding, so behaviour is unchanged.\n const transformUtils: TransformUtils = {\n remove(key) {\n out = utils.remove(key, out);\n },\n set(key, value) {\n out = utils.set(key, value, out);\n },\n recurse: traverse,\n };\n\n // Pre-picked instead of calling lodash `pick` per key, which allocated both the\n // key-list array literal and a fresh result object every time.\n const visitorUtils: Pick<TransformUtils, 'set' | 'remove'> = {\n remove: transformUtils.remove,\n set: transformUtils.set,\n };\n const handlerUtils: Pick<TransformUtils, 'set' | 'recurse'> = {\n set: transformUtils.set,\n recurse: transformUtils.recurse,\n };\n\n for (const key of keys) {\n const attribute = schema?.attributes?.[key];\n\n // The attribute segment only grows when the key maps to an attribute; otherwise the\n // parent's value carries through unchanged.\n let attributePath = path.attribute;\n if (attribute != null) {\n attributePath = path.attribute == null ? key : `${path.attribute}.${key}`;\n }\n\n // A single literal rather than a spread followed by conditional assignment: the\n // spread produced an object whose hidden class then transitioned on each write.\n // `Path` is closed over `raw` and `attribute` and callers never supply their own,\n // so nothing can be dropped by building it directly.\n const newPath: Path = {\n raw: path.raw == null ? key : `${path.raw}.${key}`,\n attribute: attributePath,\n };\n\n // visitors\n const visitorOptions: VisitorOptions = {\n key,\n value: utils.get(key, out),\n attribute,\n schema,\n path: newPath,\n data: out,\n getModel,\n parent,\n };\n\n // Awaited unconditionally. Most visitors are synchronous, and awaiting a\n // non-thenable still schedules a microtask, but skipping that await changes\n // the order of branches that recurse concurrently via Promise.all.\n //\n // That reordering used to drop nested populate in content-manager's\n // getQueryPopulate: a shallow `relation` write replaced the subtree a deeper\n // sibling had written at `relation.populate.component`. #27236 fixed that\n // visitor by merging paths. Re-measuring the skip afterward showed no\n // throughput gain, so the await stays.\n await visitor(visitorOptions, visitorUtils);\n\n const value = utils.get(key, out);\n\n const createContext = (): Context => ({\n key,\n value,\n attribute,\n schema,\n path: newPath,\n data: out,\n visitor,\n getModel,\n parent,\n });\n\n // ignore\n const ignoreCtx = createContext();\n const shouldIgnore = state.ignore.some((predicate) => predicate(ignoreCtx));\n\n if (shouldIgnore) {\n continue;\n }\n\n // handlers\n //\n // `for await` over a plain array awaits every element, allocating a promise per\n // handler per key even though the elements are ordinary objects. A plain `for...of`\n // with explicit thenable checks is equivalent for non-promise elements, and the\n // predicates in practice are synchronous.\n for (const handler of handlers) {\n const ctx = createContext();\n\n // A fresh context per handler is deliberate: a handler may call `set`, which\n // reassigns `out`, and the next handler must observe the updated `data`.\n const predicated = handler.predicate(ctx) as unknown;\n const pass =\n predicated != null && typeof (predicated as PromiseLike<boolean>).then === 'function'\n ? await (predicated as PromiseLike<boolean>)\n : predicated;\n\n if (pass) {\n const handled = handler.handler(ctx, handlerUtils) as unknown;\n\n if (handled != null && typeof (handled as PromiseLike<void>).then === 'function') {\n await handled;\n }\n }\n }\n }\n\n return out;\n };\n\n return {\n traverse,\n\n intercept<T>(predicate: Interceptor<T>['predicate'], handler: Interceptor<T>['handler']) {\n state.interceptors.push({ predicate, handler });\n return this;\n },\n\n parse<T>(predicate: Parser<T>['predicate'], parser: Parser<T>['parser']) {\n state.parsers.push({ predicate, parser });\n return this;\n },\n\n ignore(predicate: Ignore) {\n state.ignore.push(predicate);\n return this;\n },\n\n on(predicate: CommonHandler['predicate'], handler: CommonHandler['handler']) {\n state.handlers.common.push({ predicate, handler });\n return this;\n },\n\n onAttribute(predicate: AttributeHandler['predicate'], handler: AttributeHandler['handler']) {\n state.handlers.attributes.push({ predicate, handler });\n return this;\n },\n\n onRelation(handler: AttributeHandler<RelationalAttribute>['handler']) {\n return this.onAttribute(({ attribute }) => attribute?.type === 'relation', handler);\n },\n\n onMedia(handler: AttributeHandler<RelationalAttribute>['handler']) {\n return this.onAttribute(({ attribute }) => attribute?.type === 'media', handler);\n },\n\n onComponent(handler: AttributeHandler<ComponentAttribute>['handler']) {\n return this.onAttribute(({ attribute }) => attribute?.type === 'component', handler);\n },\n\n onDynamicZone(handler: AttributeHandler<DynamicZoneAttribute>['handler']) {\n return this.onAttribute(({ attribute }) => attribute?.type === 'dynamiczone', handler);\n },\n };\n};\n"],"names":["DEFAULT_PATH","raw","attribute","state","parsers","interceptors","ignore","handlers","attributes","common","traverse","visitor","options","data","path","parent","schema","getModel","predicate","handler","recurse","parser","find","utils","out","transform","keys","transformUtils","remove","key","set","value","visitorUtils","handlerUtils","attributePath","newPath","visitorOptions","get","createContext","ignoreCtx","shouldIgnore","some","ctx","predicated","pass","then","handled","intercept","push","parse","on","onAttribute","onRelation","type","onMedia","onComponent","onDynamicZone"],"mappings":";;AAAA,qDAkHA,MAAMA,YAAAA,GAAe;IAAEC,GAAAA,EAAK,IAAA;IAAMC,SAAAA,EAAW;AAAK,CAAA;AAElD,sBAAe,CAAA,IAAA;AACb,IAAA,MAAMC,KAAAA,GAAe;AACnBC,QAAAA,OAAAA,EAAS,EAAE;AACXC,QAAAA,YAAAA,EAAc,EAAE;AAChBC,QAAAA,MAAAA,EAAQ,EAAE;QACVC,QAAAA,EAAU;AACRC,YAAAA,UAAAA,EAAY,EAAE;AACdC,YAAAA,MAAAA,EAAQ;AACV;AACF,KAAA;IAEA,MAAMC,QAAAA,GAAqB,OAAOC,OAAAA,EAASC,OAAAA,EAASC,IAAAA,GAAAA;AAClD,QAAA,MAAM,EAAEC,IAAAA,GAAOd,YAAY,EAAEe,MAAM,EAAEC,MAAM,EAAEC,QAAQ,EAAE,GAAGL,OAAAA,IAAW,EAAC;;QAGtE,KAAK,MAAM,EAAEM,SAAS,EAAEC,OAAO,EAAE,IAAIhB,KAAAA,CAAME,YAAY,CAAE;AACvD,YAAA,IAAIa,UAAUL,IAAAA,CAAAA,EAAO;gBACnB,OAAOM,OAAAA,CAAQR,OAAAA,EAASC,OAAAA,EAASC,IAAAA,EAAM;oBAAEO,OAAAA,EAASV;AAAS,iBAAA,CAAA;AAC7D,YAAA;AACF,QAAA;;QAGA,MAAMW,MAAAA,GAASlB,KAAAA,CAAMC,OAAO,CAACkB,IAAI,CAAC,CAACD,MAAAA,GAAWA,MAAAA,CAAOH,SAAS,CAACL,IAAAA,CAAAA,CAAAA,EAAQQ,MAAAA;AACvE,QAAA,MAAME,QAAQF,MAAAA,GAASR,IAAAA,CAAAA;;AAGvB,QAAA,IAAI,CAACU,KAAAA,EAAO;YACV,OAAOV,IAAAA;AACT,QAAA;;QAGA,IAAIW,GAAAA,GAAMD,KAAAA,CAAME,SAAS,CAACZ,IAAAA,CAAAA;QAC1B,MAAMa,IAAAA,GAAOH,KAAAA,CAAMG,IAAI,CAACF,GAAAA,CAAAA;;;;;;AAOxB,QAAA,MAAMjB,QAAAA,GAAW;eAAIJ,KAAAA,CAAMI,QAAQ,CAACE,MAAM;eAAKN,KAAAA,CAAMI,QAAQ,CAACC;AAAW,SAAA;;;;AAKzE,QAAA,MAAMmB,cAAAA,GAAiC;AACrCC,YAAAA,MAAAA,CAAAA,CAAOC,GAAG,EAAA;gBACRL,GAAAA,GAAMD,KAAAA,CAAMK,MAAM,CAACC,GAAAA,EAAKL,GAAAA,CAAAA;AAC1B,YAAA,CAAA;YACAM,GAAAA,CAAAA,CAAID,GAAG,EAAEE,KAAK,EAAA;AACZP,gBAAAA,GAAAA,GAAMD,KAAAA,CAAMO,GAAG,CAACD,GAAAA,EAAKE,KAAAA,EAAOP,GAAAA,CAAAA;AAC9B,YAAA,CAAA;YACAJ,OAAAA,EAASV;AACX,SAAA;;;AAIA,QAAA,MAAMsB,YAAAA,GAAuD;AAC3DJ,YAAAA,MAAAA,EAAQD,eAAeC,MAAM;AAC7BE,YAAAA,GAAAA,EAAKH,eAAeG;AACtB,SAAA;AACA,QAAA,MAAMG,YAAAA,GAAwD;AAC5DH,YAAAA,GAAAA,EAAKH,eAAeG,GAAG;AACvBV,YAAAA,OAAAA,EAASO,eAAeP;AAC1B,SAAA;QAEA,KAAK,MAAMS,OAAOH,IAAAA,CAAM;AACtB,YAAA,MAAMxB,SAAAA,GAAYc,MAAAA,EAAQR,UAAAA,GAAaqB,GAAAA,CAAI;;;YAI3C,IAAIK,aAAAA,GAAgBpB,KAAKZ,SAAS;AAClC,YAAA,IAAIA,aAAa,IAAA,EAAM;gBACrBgC,aAAAA,GAAgBpB,IAAAA,CAAKZ,SAAS,IAAI,IAAA,GAAO2B,GAAAA,GAAM,CAAA,EAAGf,IAAAA,CAAKZ,SAAS,CAAC,CAAC,EAAE2B,GAAAA,CAAAA,CAAK;AAC3E,YAAA;;;;;AAMA,YAAA,MAAMM,OAAAA,GAAgB;gBACpBlC,GAAAA,EAAKa,IAAAA,CAAKb,GAAG,IAAI,IAAA,GAAO4B,GAAAA,GAAM,CAAA,EAAGf,IAAAA,CAAKb,GAAG,CAAC,CAAC,EAAE4B,GAAAA,CAAAA,CAAK;gBAClD3B,SAAAA,EAAWgC;AACb,aAAA;;AAGA,YAAA,MAAME,cAAAA,GAAiC;AACrCP,gBAAAA,GAAAA;gBACAE,KAAAA,EAAOR,KAAAA,CAAMc,GAAG,CAACR,GAAAA,EAAKL,GAAAA,CAAAA;AACtBtB,gBAAAA,SAAAA;AACAc,gBAAAA,MAAAA;gBACAF,IAAAA,EAAMqB,OAAAA;gBACNtB,IAAAA,EAAMW,GAAAA;AACNP,gBAAAA,QAAAA;AACAF,gBAAAA;AACF,aAAA;;;;;;;;;;AAWA,YAAA,MAAMJ,QAAQyB,cAAAA,EAAgBJ,YAAAA,CAAAA;AAE9B,YAAA,MAAMD,KAAAA,GAAQR,KAAAA,CAAMc,GAAG,CAACR,GAAAA,EAAKL,GAAAA,CAAAA;YAE7B,MAAMc,aAAAA,GAAgB,KAAgB;AACpCT,oBAAAA,GAAAA;AACAE,oBAAAA,KAAAA;AACA7B,oBAAAA,SAAAA;AACAc,oBAAAA,MAAAA;oBACAF,IAAAA,EAAMqB,OAAAA;oBACNtB,IAAAA,EAAMW,GAAAA;AACNb,oBAAAA,OAAAA;AACAM,oBAAAA,QAAAA;AACAF,oBAAAA;iBACF,CAAA;;AAGA,YAAA,MAAMwB,SAAAA,GAAYD,aAAAA,EAAAA;YAClB,MAAME,YAAAA,GAAerC,MAAMG,MAAM,CAACmC,IAAI,CAAC,CAACvB,YAAcA,SAAAA,CAAUqB,SAAAA,CAAAA,CAAAA;AAEhE,YAAA,IAAIC,YAAAA,EAAc;AAChB,gBAAA;AACF,YAAA;;;;;;;YAQA,KAAK,MAAMrB,WAAWZ,QAAAA,CAAU;AAC9B,gBAAA,MAAMmC,GAAAA,GAAMJ,aAAAA,EAAAA;;;gBAIZ,MAAMK,UAAAA,GAAaxB,OAAAA,CAAQD,SAAS,CAACwB,GAAAA,CAAAA;gBACrC,MAAME,IAAAA,GACJD,UAAAA,IAAc,IAAA,IAAQ,OAAQA,WAAoCE,IAAI,KAAK,UAAA,GACvE,MAAOF,UAAAA,GACPA,UAAAA;AAEN,gBAAA,IAAIC,IAAAA,EAAM;AACR,oBAAA,MAAME,OAAAA,GAAU3B,OAAAA,CAAQA,OAAO,CAACuB,GAAAA,EAAKT,YAAAA,CAAAA;AAErC,oBAAA,IAAIa,WAAW,IAAA,IAAQ,OAAO,OAACA,CAA8BD,IAAI,KAAK,UAAA,EAAY;wBAChF,MAAMC,OAAAA;AACR,oBAAA;AACF,gBAAA;AACF,YAAA;AACF,QAAA;QAEA,OAAOtB,GAAAA;AACT,IAAA,CAAA;IAEA,OAAO;AACLd,QAAAA,QAAAA;QAEAqC,SAAAA,CAAAA,CAAa7B,SAAsC,EAAEC,OAAkC,EAAA;YACrFhB,KAAAA,CAAME,YAAY,CAAC2C,IAAI,CAAC;AAAE9B,gBAAAA,SAAAA;AAAWC,gBAAAA;AAAQ,aAAA,CAAA;AAC7C,YAAA,OAAO,IAAI;AACb,QAAA,CAAA;QAEA8B,KAAAA,CAAAA,CAAS/B,SAAiC,EAAEG,MAA2B,EAAA;YACrElB,KAAAA,CAAMC,OAAO,CAAC4C,IAAI,CAAC;AAAE9B,gBAAAA,SAAAA;AAAWG,gBAAAA;AAAO,aAAA,CAAA;AACvC,YAAA,OAAO,IAAI;AACb,QAAA,CAAA;AAEAf,QAAAA,MAAAA,CAAAA,CAAOY,SAAiB,EAAA;YACtBf,KAAAA,CAAMG,MAAM,CAAC0C,IAAI,CAAC9B,SAAAA,CAAAA;AAClB,YAAA,OAAO,IAAI;AACb,QAAA,CAAA;QAEAgC,EAAAA,CAAAA,CAAGhC,SAAqC,EAAEC,OAAiC,EAAA;AACzEhB,YAAAA,KAAAA,CAAMI,QAAQ,CAACE,MAAM,CAACuC,IAAI,CAAC;AAAE9B,gBAAAA,SAAAA;AAAWC,gBAAAA;AAAQ,aAAA,CAAA;AAChD,YAAA,OAAO,IAAI;AACb,QAAA,CAAA;QAEAgC,WAAAA,CAAAA,CAAYjC,SAAwC,EAAEC,OAAoC,EAAA;AACxFhB,YAAAA,KAAAA,CAAMI,QAAQ,CAACC,UAAU,CAACwC,IAAI,CAAC;AAAE9B,gBAAAA,SAAAA;AAAWC,gBAAAA;AAAQ,aAAA,CAAA;AACpD,YAAA,OAAO,IAAI;AACb,QAAA,CAAA;AAEAiC,QAAAA,UAAAA,CAAAA,CAAWjC,OAAyD,EAAA;YAClE,OAAO,IAAI,CAACgC,WAAW,CAAC,CAAC,EAAEjD,SAAS,EAAE,GAAKA,SAAAA,EAAWmD,IAAAA,KAAS,UAAA,EAAYlC,OAAAA,CAAAA;AAC7E,QAAA,CAAA;AAEAmC,QAAAA,OAAAA,CAAAA,CAAQnC,OAAyD,EAAA;YAC/D,OAAO,IAAI,CAACgC,WAAW,CAAC,CAAC,EAAEjD,SAAS,EAAE,GAAKA,SAAAA,EAAWmD,IAAAA,KAAS,OAAA,EAASlC,OAAAA,CAAAA;AAC1E,QAAA,CAAA;AAEAoC,QAAAA,WAAAA,CAAAA,CAAYpC,OAAwD,EAAA;YAClE,OAAO,IAAI,CAACgC,WAAW,CAAC,CAAC,EAAEjD,SAAS,EAAE,GAAKA,SAAAA,EAAWmD,IAAAA,KAAS,WAAA,EAAalC,OAAAA,CAAAA;AAC9E,QAAA,CAAA;AAEAqC,QAAAA,aAAAA,CAAAA,CAAcrC,OAA0D,EAAA;YACtE,OAAO,IAAI,CAACgC,WAAW,CAAC,CAAC,EAAEjD,SAAS,EAAE,GAAKA,SAAAA,EAAWmD,IAAAA,KAAS,aAAA,EAAelC,OAAAA,CAAAA;AAChF,QAAA;AACF,KAAA;AACF,CAAA;;;;"}
|
|
1
|
+
{"version":3,"file":"factory.js","sources":["../../src/traverse/factory.ts"],"sourcesContent":["/* eslint-disable @typescript-eslint/no-loop-func */\nimport {\n AnyAttribute,\n Attribute,\n ComponentAttribute,\n DynamicZoneAttribute,\n Model,\n RelationalAttribute,\n} from '../types';\n\nexport interface Path {\n raw: string | null;\n attribute: string | null;\n}\n\nexport interface Parent {\n attribute?: Attribute;\n key: string | null;\n path: Path;\n schema: Model;\n}\n\nexport interface TraverseOptions {\n schema: Model;\n path?: Path;\n parent?: Parent;\n getModel(uid: string): Model;\n}\n\nexport interface VisitorOptions {\n data: unknown;\n value: unknown;\n schema: Model;\n key: string;\n attribute?: AnyAttribute;\n path: Path;\n parent?: Parent;\n getModel(uid: string): Model;\n}\n\nexport type Traverse = (\n visitor: Visitor,\n options: TraverseOptions,\n data: unknown\n) => Promise<unknown>;\n\nexport interface Visitor {\n (visitorOptions: VisitorOptions, opts: Pick<TransformUtils, 'set' | 'remove'>): void;\n}\n\ninterface Interceptor<T = unknown> {\n predicate(data: unknown): data is T;\n handler(\n visitor: Visitor,\n options: TraverseOptions,\n data: T,\n recurseOptions: { recurse: Traverse }\n ): void;\n}\n\ninterface ParseUtils<T> {\n /**\n * Copies data the traversal does not own yet. Optional. It runs once, on the data the caller\n * passes in, and not on the values the traversal recurses into, which are already part of\n * that copy.\n */\n clone?(data: T): T;\n /** Runs at every level, on the data about to be walked. */\n transform(data: T): unknown;\n remove(key: string, data: T): unknown;\n set(key: string, value: unknown, data: T): unknown;\n keys(data: T): string[];\n get(key: string, data: T): unknown;\n}\n\ninterface Parser<T = unknown> {\n predicate(data: unknown): data is T;\n parser(data: T): ParseUtils<T>;\n}\n\ninterface Ignore {\n (ctx: Context): boolean;\n}\n\ninterface AttributeHandler<AttributeType = Attribute> {\n predicate(ctx: Context<AttributeType>): boolean;\n handler(ctx: Context<AttributeType>, opts: Pick<TransformUtils, 'set' | 'recurse'>): void;\n}\ninterface CommonHandler<AttributeType = Attribute> {\n predicate(ctx: Context<AttributeType>): boolean;\n handler(ctx: Context<AttributeType>, opts: Pick<TransformUtils, 'set' | 'recurse'>): void;\n}\n\nexport interface TransformUtils {\n remove(key: string): void;\n set(key: string, value: unknown): void;\n recurse: Traverse;\n}\n\ninterface Context<AttributeType = Attribute> {\n key: string;\n value: unknown;\n attribute: AttributeType;\n schema: Model;\n path: Path;\n data: unknown;\n visitor: Visitor;\n parent?: Parent;\n getModel(uid: string): Model;\n}\n\ninterface State {\n parsers: Parser[];\n interceptors: Interceptor[];\n ignore: Ignore[];\n handlers: {\n attributes: AttributeHandler[];\n common: CommonHandler[];\n };\n}\n\nconst DEFAULT_PATH = { raw: null, attribute: null } satisfies Path;\n\nexport default () => {\n const state: State = {\n parsers: [],\n interceptors: [],\n ignore: [],\n handlers: {\n attributes: [],\n common: [],\n },\n };\n\n /**\n * `owned` is true when `data` is part of a copy this traversal has already made.\n *\n * A parser's `set` and `remove` build new objects instead of writing into the data, so a\n * single copy of the caller's data is enough to keep it untouched, and to keep the result from\n * sharing objects with it. Values a handler recurses into come from that copy, from the\n * handler, or from a visitor's `set`, and are walked without copying them again. A visitor\n * must therefore `set` a fresh value, not one it shares with anything else.\n */\n const walk = async (\n visitor: Visitor,\n options: TraverseOptions,\n data: unknown,\n owned: boolean\n ): Promise<unknown> => {\n const { path = DEFAULT_PATH, parent, schema, getModel } = options ?? {};\n\n // interceptors\n for (const { predicate, handler } of state.interceptors) {\n if (predicate(data)) {\n // An interceptor can hand the caller's own data to the recursion (for example the\n // items of a filters array), so it only skips the copy when this level already owns it.\n return handler(visitor, options, data, { recurse: owned ? traverseOwned : traverse });\n }\n }\n\n // parsers\n const parser = state.parsers.find((parser) => parser.predicate(data))?.parser;\n const utils = parser?.(data);\n\n // Return the data untouched if we don't know how to traverse it\n if (!utils) {\n return data;\n }\n\n // main loop\n let out = utils.transform(owned || !utils.clone ? data : utils.clone(data));\n const keys = utils.keys(out);\n\n // Built once per traversal rather than once per key. `state.handlers` is populated\n // while the traversal is being defined and is fixed by the time it runs, so spreading\n // both lists on every key allocated a fresh array to hold the same handlers. This\n // loop runs for every key of every node of every query, which made it one of the\n // hottest allocation sites in a request.\n const handlers = [...state.handlers.common, ...state.handlers.attributes];\n\n // Also hoisted: none of these close over `key` (each method takes it as an argument),\n // so the previous code allocated three closures per key to no end. They still mutate\n // the same `out` binding, so behaviour is unchanged.\n const transformUtils: TransformUtils = {\n remove(key) {\n out = utils.remove(key, out);\n },\n set(key, value) {\n out = utils.set(key, value, out);\n },\n // Handlers recurse into values of `out`, which this traversal owns.\n recurse: traverseOwned,\n };\n\n // Pre-picked instead of calling lodash `pick` per key, which allocated both the\n // key-list array literal and a fresh result object every time.\n const visitorUtils: Pick<TransformUtils, 'set' | 'remove'> = {\n remove: transformUtils.remove,\n set: transformUtils.set,\n };\n const handlerUtils: Pick<TransformUtils, 'set' | 'recurse'> = {\n set: transformUtils.set,\n recurse: transformUtils.recurse,\n };\n\n for (const key of keys) {\n const attribute = schema?.attributes?.[key];\n\n // The attribute segment only grows when the key maps to an attribute; otherwise the\n // parent's value carries through unchanged.\n let attributePath = path.attribute;\n if (attribute != null) {\n attributePath = path.attribute == null ? key : `${path.attribute}.${key}`;\n }\n\n // A single literal rather than a spread followed by conditional assignment: the\n // spread produced an object whose hidden class then transitioned on each write.\n // `Path` is closed over `raw` and `attribute` and callers never supply their own,\n // so nothing can be dropped by building it directly.\n const newPath: Path = {\n raw: path.raw == null ? key : `${path.raw}.${key}`,\n attribute: attributePath,\n };\n\n // visitors\n const visitorOptions: VisitorOptions = {\n key,\n value: utils.get(key, out),\n attribute,\n schema,\n path: newPath,\n data: out,\n getModel,\n parent,\n };\n\n // Awaited unconditionally. Most visitors are synchronous, and awaiting a\n // non-thenable still schedules a microtask, but skipping that await changes\n // the order of branches that recurse concurrently via Promise.all.\n //\n // That reordering used to drop nested populate in content-manager's\n // getQueryPopulate: a shallow `relation` write replaced the subtree a deeper\n // sibling had written at `relation.populate.component`. #27236 fixed that\n // visitor by merging paths. Re-measuring the skip afterward showed no\n // throughput gain, so the await stays.\n await visitor(visitorOptions, visitorUtils);\n\n const value = utils.get(key, out);\n\n const createContext = (): Context => ({\n key,\n value,\n attribute,\n schema,\n path: newPath,\n data: out,\n visitor,\n getModel,\n parent,\n });\n\n // ignore\n const ignoreCtx = createContext();\n const shouldIgnore = state.ignore.some((predicate) => predicate(ignoreCtx));\n\n if (shouldIgnore) {\n continue;\n }\n\n // handlers\n //\n // `for await` over a plain array awaits every element, allocating a promise per\n // handler per key even though the elements are ordinary objects. A plain `for...of`\n // with explicit thenable checks is equivalent for non-promise elements, and the\n // predicates in practice are synchronous.\n for (const handler of handlers) {\n const ctx = createContext();\n\n // A fresh context per handler is deliberate: a handler may call `set`, which\n // reassigns `out`, and the next handler must observe the updated `data`.\n const predicated = handler.predicate(ctx) as unknown;\n const pass =\n predicated != null && typeof (predicated as PromiseLike<boolean>).then === 'function'\n ? await (predicated as PromiseLike<boolean>)\n : predicated;\n\n if (pass) {\n const handled = handler.handler(ctx, handlerUtils) as unknown;\n\n if (handled != null && typeof (handled as PromiseLike<void>).then === 'function') {\n await handled;\n }\n }\n }\n }\n\n return out;\n };\n\n // Entry point: the data comes from the caller, so it is copied before it is walked.\n const traverse: Traverse = (visitor, options, data) => walk(visitor, options, data, false);\n const traverseOwned: Traverse = (visitor, options, data) => walk(visitor, options, data, true);\n\n return {\n traverse,\n\n intercept<T>(predicate: Interceptor<T>['predicate'], handler: Interceptor<T>['handler']) {\n state.interceptors.push({ predicate, handler });\n return this;\n },\n\n parse<T>(predicate: Parser<T>['predicate'], parser: Parser<T>['parser']) {\n state.parsers.push({ predicate, parser });\n return this;\n },\n\n ignore(predicate: Ignore) {\n state.ignore.push(predicate);\n return this;\n },\n\n on(predicate: CommonHandler['predicate'], handler: CommonHandler['handler']) {\n state.handlers.common.push({ predicate, handler });\n return this;\n },\n\n onAttribute(predicate: AttributeHandler['predicate'], handler: AttributeHandler['handler']) {\n state.handlers.attributes.push({ predicate, handler });\n return this;\n },\n\n onRelation(handler: AttributeHandler<RelationalAttribute>['handler']) {\n return this.onAttribute(({ attribute }) => attribute?.type === 'relation', handler);\n },\n\n onMedia(handler: AttributeHandler<RelationalAttribute>['handler']) {\n return this.onAttribute(({ attribute }) => attribute?.type === 'media', handler);\n },\n\n onComponent(handler: AttributeHandler<ComponentAttribute>['handler']) {\n return this.onAttribute(({ attribute }) => attribute?.type === 'component', handler);\n },\n\n onDynamicZone(handler: AttributeHandler<DynamicZoneAttribute>['handler']) {\n return this.onAttribute(({ attribute }) => attribute?.type === 'dynamiczone', handler);\n },\n };\n};\n"],"names":["DEFAULT_PATH","raw","attribute","state","parsers","interceptors","ignore","handlers","attributes","common","walk","visitor","options","data","owned","path","parent","schema","getModel","predicate","handler","recurse","traverseOwned","traverse","parser","find","utils","out","transform","clone","keys","transformUtils","remove","key","set","value","visitorUtils","handlerUtils","attributePath","newPath","visitorOptions","get","createContext","ignoreCtx","shouldIgnore","some","ctx","predicated","pass","then","handled","intercept","push","parse","on","onAttribute","onRelation","type","onMedia","onComponent","onDynamicZone"],"mappings":";;AAAA,qDAyHA,MAAMA,YAAAA,GAAe;IAAEC,GAAAA,EAAK,IAAA;IAAMC,SAAAA,EAAW;AAAK,CAAA;AAElD,sBAAe,CAAA,IAAA;AACb,IAAA,MAAMC,KAAAA,GAAe;AACnBC,QAAAA,OAAAA,EAAS,EAAE;AACXC,QAAAA,YAAAA,EAAc,EAAE;AAChBC,QAAAA,MAAAA,EAAQ,EAAE;QACVC,QAAAA,EAAU;AACRC,YAAAA,UAAAA,EAAY,EAAE;AACdC,YAAAA,MAAAA,EAAQ;AACV;AACF,KAAA;AAEA;;;;;;;;AAQC,MACD,MAAMC,IAAAA,GAAO,OACXC,OAAAA,EACAC,SACAC,IAAAA,EACAC,KAAAA,GAAAA;AAEA,QAAA,MAAM,EAAEC,IAAAA,GAAOf,YAAY,EAAEgB,MAAM,EAAEC,MAAM,EAAEC,QAAQ,EAAE,GAAGN,OAAAA,IAAW,EAAC;;QAGtE,KAAK,MAAM,EAAEO,SAAS,EAAEC,OAAO,EAAE,IAAIjB,KAAAA,CAAME,YAAY,CAAE;AACvD,YAAA,IAAIc,UAAUN,IAAAA,CAAAA,EAAO;;;gBAGnB,OAAOO,OAAAA,CAAQT,OAAAA,EAASC,OAAAA,EAASC,IAAAA,EAAM;AAAEQ,oBAAAA,OAAAA,EAASP,QAAQQ,aAAAA,GAAgBC;AAAS,iBAAA,CAAA;AACrF,YAAA;AACF,QAAA;;QAGA,MAAMC,MAAAA,GAASrB,KAAAA,CAAMC,OAAO,CAACqB,IAAI,CAAC,CAACD,MAAAA,GAAWA,MAAAA,CAAOL,SAAS,CAACN,IAAAA,CAAAA,CAAAA,EAAQW,MAAAA;AACvE,QAAA,MAAME,QAAQF,MAAAA,GAASX,IAAAA,CAAAA;;AAGvB,QAAA,IAAI,CAACa,KAAAA,EAAO;YACV,OAAOb,IAAAA;AACT,QAAA;;AAGA,QAAA,IAAIc,GAAAA,GAAMD,KAAAA,CAAME,SAAS,CAACd,KAAAA,IAAS,CAACY,KAAAA,CAAMG,KAAK,GAAGhB,IAAAA,GAAOa,KAAAA,CAAMG,KAAK,CAAChB,IAAAA,CAAAA,CAAAA;QACrE,MAAMiB,IAAAA,GAAOJ,KAAAA,CAAMI,IAAI,CAACH,GAAAA,CAAAA;;;;;;AAOxB,QAAA,MAAMpB,QAAAA,GAAW;eAAIJ,KAAAA,CAAMI,QAAQ,CAACE,MAAM;eAAKN,KAAAA,CAAMI,QAAQ,CAACC;AAAW,SAAA;;;;AAKzE,QAAA,MAAMuB,cAAAA,GAAiC;AACrCC,YAAAA,MAAAA,CAAAA,CAAOC,GAAG,EAAA;gBACRN,GAAAA,GAAMD,KAAAA,CAAMM,MAAM,CAACC,GAAAA,EAAKN,GAAAA,CAAAA;AAC1B,YAAA,CAAA;YACAO,GAAAA,CAAAA,CAAID,GAAG,EAAEE,KAAK,EAAA;AACZR,gBAAAA,GAAAA,GAAMD,KAAAA,CAAMQ,GAAG,CAACD,GAAAA,EAAKE,KAAAA,EAAOR,GAAAA,CAAAA;AAC9B,YAAA,CAAA;;YAEAN,OAAAA,EAASC;AACX,SAAA;;;AAIA,QAAA,MAAMc,YAAAA,GAAuD;AAC3DJ,YAAAA,MAAAA,EAAQD,eAAeC,MAAM;AAC7BE,YAAAA,GAAAA,EAAKH,eAAeG;AACtB,SAAA;AACA,QAAA,MAAMG,YAAAA,GAAwD;AAC5DH,YAAAA,GAAAA,EAAKH,eAAeG,GAAG;AACvBb,YAAAA,OAAAA,EAASU,eAAeV;AAC1B,SAAA;QAEA,KAAK,MAAMY,OAAOH,IAAAA,CAAM;AACtB,YAAA,MAAM5B,SAAAA,GAAYe,MAAAA,EAAQT,UAAAA,GAAayB,GAAAA,CAAI;;;YAI3C,IAAIK,aAAAA,GAAgBvB,KAAKb,SAAS;AAClC,YAAA,IAAIA,aAAa,IAAA,EAAM;gBACrBoC,aAAAA,GAAgBvB,IAAAA,CAAKb,SAAS,IAAI,IAAA,GAAO+B,GAAAA,GAAM,CAAA,EAAGlB,IAAAA,CAAKb,SAAS,CAAC,CAAC,EAAE+B,GAAAA,CAAAA,CAAK;AAC3E,YAAA;;;;;AAMA,YAAA,MAAMM,OAAAA,GAAgB;gBACpBtC,GAAAA,EAAKc,IAAAA,CAAKd,GAAG,IAAI,IAAA,GAAOgC,GAAAA,GAAM,CAAA,EAAGlB,IAAAA,CAAKd,GAAG,CAAC,CAAC,EAAEgC,GAAAA,CAAAA,CAAK;gBAClD/B,SAAAA,EAAWoC;AACb,aAAA;;AAGA,YAAA,MAAME,cAAAA,GAAiC;AACrCP,gBAAAA,GAAAA;gBACAE,KAAAA,EAAOT,KAAAA,CAAMe,GAAG,CAACR,GAAAA,EAAKN,GAAAA,CAAAA;AACtBzB,gBAAAA,SAAAA;AACAe,gBAAAA,MAAAA;gBACAF,IAAAA,EAAMwB,OAAAA;gBACN1B,IAAAA,EAAMc,GAAAA;AACNT,gBAAAA,QAAAA;AACAF,gBAAAA;AACF,aAAA;;;;;;;;;;AAWA,YAAA,MAAML,QAAQ6B,cAAAA,EAAgBJ,YAAAA,CAAAA;AAE9B,YAAA,MAAMD,KAAAA,GAAQT,KAAAA,CAAMe,GAAG,CAACR,GAAAA,EAAKN,GAAAA,CAAAA;YAE7B,MAAMe,aAAAA,GAAgB,KAAgB;AACpCT,oBAAAA,GAAAA;AACAE,oBAAAA,KAAAA;AACAjC,oBAAAA,SAAAA;AACAe,oBAAAA,MAAAA;oBACAF,IAAAA,EAAMwB,OAAAA;oBACN1B,IAAAA,EAAMc,GAAAA;AACNhB,oBAAAA,OAAAA;AACAO,oBAAAA,QAAAA;AACAF,oBAAAA;iBACF,CAAA;;AAGA,YAAA,MAAM2B,SAAAA,GAAYD,aAAAA,EAAAA;YAClB,MAAME,YAAAA,GAAezC,MAAMG,MAAM,CAACuC,IAAI,CAAC,CAAC1B,YAAcA,SAAAA,CAAUwB,SAAAA,CAAAA,CAAAA;AAEhE,YAAA,IAAIC,YAAAA,EAAc;AAChB,gBAAA;AACF,YAAA;;;;;;;YAQA,KAAK,MAAMxB,WAAWb,QAAAA,CAAU;AAC9B,gBAAA,MAAMuC,GAAAA,GAAMJ,aAAAA,EAAAA;;;gBAIZ,MAAMK,UAAAA,GAAa3B,OAAAA,CAAQD,SAAS,CAAC2B,GAAAA,CAAAA;gBACrC,MAAME,IAAAA,GACJD,UAAAA,IAAc,IAAA,IAAQ,OAAQA,WAAoCE,IAAI,KAAK,UAAA,GACvE,MAAOF,UAAAA,GACPA,UAAAA;AAEN,gBAAA,IAAIC,IAAAA,EAAM;AACR,oBAAA,MAAME,OAAAA,GAAU9B,OAAAA,CAAQA,OAAO,CAAC0B,GAAAA,EAAKT,YAAAA,CAAAA;AAErC,oBAAA,IAAIa,WAAW,IAAA,IAAQ,OAAO,OAACA,CAA8BD,IAAI,KAAK,UAAA,EAAY;wBAChF,MAAMC,OAAAA;AACR,oBAAA;AACF,gBAAA;AACF,YAAA;AACF,QAAA;QAEA,OAAOvB,GAAAA;AACT,IAAA,CAAA;;IAGA,MAAMJ,QAAAA,GAAqB,CAACZ,OAAAA,EAASC,OAAAA,EAASC,OAASH,IAAAA,CAAKC,OAAAA,EAASC,SAASC,IAAAA,EAAM,KAAA,CAAA;IACpF,MAAMS,aAAAA,GAA0B,CAACX,OAAAA,EAASC,OAAAA,EAASC,OAASH,IAAAA,CAAKC,OAAAA,EAASC,SAASC,IAAAA,EAAM,IAAA,CAAA;IAEzF,OAAO;AACLU,QAAAA,QAAAA;QAEA4B,SAAAA,CAAAA,CAAahC,SAAsC,EAAEC,OAAkC,EAAA;YACrFjB,KAAAA,CAAME,YAAY,CAAC+C,IAAI,CAAC;AAAEjC,gBAAAA,SAAAA;AAAWC,gBAAAA;AAAQ,aAAA,CAAA;AAC7C,YAAA,OAAO,IAAI;AACb,QAAA,CAAA;QAEAiC,KAAAA,CAAAA,CAASlC,SAAiC,EAAEK,MAA2B,EAAA;YACrErB,KAAAA,CAAMC,OAAO,CAACgD,IAAI,CAAC;AAAEjC,gBAAAA,SAAAA;AAAWK,gBAAAA;AAAO,aAAA,CAAA;AACvC,YAAA,OAAO,IAAI;AACb,QAAA,CAAA;AAEAlB,QAAAA,MAAAA,CAAAA,CAAOa,SAAiB,EAAA;YACtBhB,KAAAA,CAAMG,MAAM,CAAC8C,IAAI,CAACjC,SAAAA,CAAAA;AAClB,YAAA,OAAO,IAAI;AACb,QAAA,CAAA;QAEAmC,EAAAA,CAAAA,CAAGnC,SAAqC,EAAEC,OAAiC,EAAA;AACzEjB,YAAAA,KAAAA,CAAMI,QAAQ,CAACE,MAAM,CAAC2C,IAAI,CAAC;AAAEjC,gBAAAA,SAAAA;AAAWC,gBAAAA;AAAQ,aAAA,CAAA;AAChD,YAAA,OAAO,IAAI;AACb,QAAA,CAAA;QAEAmC,WAAAA,CAAAA,CAAYpC,SAAwC,EAAEC,OAAoC,EAAA;AACxFjB,YAAAA,KAAAA,CAAMI,QAAQ,CAACC,UAAU,CAAC4C,IAAI,CAAC;AAAEjC,gBAAAA,SAAAA;AAAWC,gBAAAA;AAAQ,aAAA,CAAA;AACpD,YAAA,OAAO,IAAI;AACb,QAAA,CAAA;AAEAoC,QAAAA,UAAAA,CAAAA,CAAWpC,OAAyD,EAAA;YAClE,OAAO,IAAI,CAACmC,WAAW,CAAC,CAAC,EAAErD,SAAS,EAAE,GAAKA,SAAAA,EAAWuD,IAAAA,KAAS,UAAA,EAAYrC,OAAAA,CAAAA;AAC7E,QAAA,CAAA;AAEAsC,QAAAA,OAAAA,CAAAA,CAAQtC,OAAyD,EAAA;YAC/D,OAAO,IAAI,CAACmC,WAAW,CAAC,CAAC,EAAErD,SAAS,EAAE,GAAKA,SAAAA,EAAWuD,IAAAA,KAAS,OAAA,EAASrC,OAAAA,CAAAA;AAC1E,QAAA,CAAA;AAEAuC,QAAAA,WAAAA,CAAAA,CAAYvC,OAAwD,EAAA;YAClE,OAAO,IAAI,CAACmC,WAAW,CAAC,CAAC,EAAErD,SAAS,EAAE,GAAKA,SAAAA,EAAWuD,IAAAA,KAAS,WAAA,EAAarC,OAAAA,CAAAA;AAC9E,QAAA,CAAA;AAEAwC,QAAAA,aAAAA,CAAAA,CAAcxC,OAA0D,EAAA;YACtE,OAAO,IAAI,CAACmC,WAAW,CAAC,CAAC,EAAErD,SAAS,EAAE,GAAKA,SAAAA,EAAWuD,IAAAA,KAAS,aAAA,EAAerC,OAAAA,CAAAA;AAChF,QAAA;AACF,KAAA;AACF,CAAA;;;;"}
|
|
@@ -12,13 +12,23 @@ var traverseFactory = (()=>{
|
|
|
12
12
|
common: []
|
|
13
13
|
}
|
|
14
14
|
};
|
|
15
|
-
|
|
15
|
+
/**
|
|
16
|
+
* `owned` is true when `data` is part of a copy this traversal has already made.
|
|
17
|
+
*
|
|
18
|
+
* A parser's `set` and `remove` build new objects instead of writing into the data, so a
|
|
19
|
+
* single copy of the caller's data is enough to keep it untouched, and to keep the result from
|
|
20
|
+
* sharing objects with it. Values a handler recurses into come from that copy, from the
|
|
21
|
+
* handler, or from a visitor's `set`, and are walked without copying them again. A visitor
|
|
22
|
+
* must therefore `set` a fresh value, not one it shares with anything else.
|
|
23
|
+
*/ const walk = async (visitor, options, data, owned)=>{
|
|
16
24
|
const { path = DEFAULT_PATH, parent, schema, getModel } = options ?? {};
|
|
17
25
|
// interceptors
|
|
18
26
|
for (const { predicate, handler } of state.interceptors){
|
|
19
27
|
if (predicate(data)) {
|
|
28
|
+
// An interceptor can hand the caller's own data to the recursion (for example the
|
|
29
|
+
// items of a filters array), so it only skips the copy when this level already owns it.
|
|
20
30
|
return handler(visitor, options, data, {
|
|
21
|
-
recurse: traverse
|
|
31
|
+
recurse: owned ? traverseOwned : traverse
|
|
22
32
|
});
|
|
23
33
|
}
|
|
24
34
|
}
|
|
@@ -30,7 +40,7 @@ var traverseFactory = (()=>{
|
|
|
30
40
|
return data;
|
|
31
41
|
}
|
|
32
42
|
// main loop
|
|
33
|
-
let out = utils.transform(data);
|
|
43
|
+
let out = utils.transform(owned || !utils.clone ? data : utils.clone(data));
|
|
34
44
|
const keys = utils.keys(out);
|
|
35
45
|
// Built once per traversal rather than once per key. `state.handlers` is populated
|
|
36
46
|
// while the traversal is being defined and is fixed by the time it runs, so spreading
|
|
@@ -51,7 +61,8 @@ var traverseFactory = (()=>{
|
|
|
51
61
|
set (key, value) {
|
|
52
62
|
out = utils.set(key, value, out);
|
|
53
63
|
},
|
|
54
|
-
recurse
|
|
64
|
+
// Handlers recurse into values of `out`, which this traversal owns.
|
|
65
|
+
recurse: traverseOwned
|
|
55
66
|
};
|
|
56
67
|
// Pre-picked instead of calling lodash `pick` per key, which allocated both the
|
|
57
68
|
// key-list array literal and a fresh result object every time.
|
|
@@ -140,6 +151,9 @@ var traverseFactory = (()=>{
|
|
|
140
151
|
}
|
|
141
152
|
return out;
|
|
142
153
|
};
|
|
154
|
+
// Entry point: the data comes from the caller, so it is copied before it is walked.
|
|
155
|
+
const traverse = (visitor, options, data)=>walk(visitor, options, data, false);
|
|
156
|
+
const traverseOwned = (visitor, options, data)=>walk(visitor, options, data, true);
|
|
143
157
|
return {
|
|
144
158
|
traverse,
|
|
145
159
|
intercept (predicate, handler) {
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"factory.mjs","sources":["../../src/traverse/factory.ts"],"sourcesContent":["/* eslint-disable @typescript-eslint/no-loop-func */\nimport {\n AnyAttribute,\n Attribute,\n ComponentAttribute,\n DynamicZoneAttribute,\n Model,\n RelationalAttribute,\n} from '../types';\n\nexport interface Path {\n raw: string | null;\n attribute: string | null;\n}\n\nexport interface Parent {\n attribute?: Attribute;\n key: string | null;\n path: Path;\n schema: Model;\n}\n\nexport interface TraverseOptions {\n schema: Model;\n path?: Path;\n parent?: Parent;\n getModel(uid: string): Model;\n}\n\nexport interface VisitorOptions {\n data: unknown;\n value: unknown;\n schema: Model;\n key: string;\n attribute?: AnyAttribute;\n path: Path;\n parent?: Parent;\n getModel(uid: string): Model;\n}\n\nexport type Traverse = (\n visitor: Visitor,\n options: TraverseOptions,\n data: unknown\n) => Promise<unknown>;\n\nexport interface Visitor {\n (visitorOptions: VisitorOptions, opts: Pick<TransformUtils, 'set' | 'remove'>): void;\n}\n\ninterface Interceptor<T = unknown> {\n predicate(data: unknown): data is T;\n handler(\n visitor: Visitor,\n options: TraverseOptions,\n data: T,\n recurseOptions: { recurse: Traverse }\n ): void;\n}\n\ninterface ParseUtils<T> {\n transform(data: T): unknown;\n remove(key: string, data: T): unknown;\n set(key: string, value: unknown, data: T): unknown;\n keys(data: T): string[];\n get(key: string, data: T): unknown;\n}\n\ninterface Parser<T = unknown> {\n predicate(data: unknown): data is T;\n parser(data: T): ParseUtils<T>;\n}\n\ninterface Ignore {\n (ctx: Context): boolean;\n}\n\ninterface AttributeHandler<AttributeType = Attribute> {\n predicate(ctx: Context<AttributeType>): boolean;\n handler(ctx: Context<AttributeType>, opts: Pick<TransformUtils, 'set' | 'recurse'>): void;\n}\ninterface CommonHandler<AttributeType = Attribute> {\n predicate(ctx: Context<AttributeType>): boolean;\n handler(ctx: Context<AttributeType>, opts: Pick<TransformUtils, 'set' | 'recurse'>): void;\n}\n\nexport interface TransformUtils {\n remove(key: string): void;\n set(key: string, value: unknown): void;\n recurse: Traverse;\n}\n\ninterface Context<AttributeType = Attribute> {\n key: string;\n value: unknown;\n attribute: AttributeType;\n schema: Model;\n path: Path;\n data: unknown;\n visitor: Visitor;\n parent?: Parent;\n getModel(uid: string): Model;\n}\n\ninterface State {\n parsers: Parser[];\n interceptors: Interceptor[];\n ignore: Ignore[];\n handlers: {\n attributes: AttributeHandler[];\n common: CommonHandler[];\n };\n}\n\nconst DEFAULT_PATH = { raw: null, attribute: null } satisfies Path;\n\nexport default () => {\n const state: State = {\n parsers: [],\n interceptors: [],\n ignore: [],\n handlers: {\n attributes: [],\n common: [],\n },\n };\n\n const traverse: Traverse = async (visitor, options, data) => {\n const { path = DEFAULT_PATH, parent, schema, getModel } = options ?? {};\n\n // interceptors\n for (const { predicate, handler } of state.interceptors) {\n if (predicate(data)) {\n return handler(visitor, options, data, { recurse: traverse });\n }\n }\n\n // parsers\n const parser = state.parsers.find((parser) => parser.predicate(data))?.parser;\n const utils = parser?.(data);\n\n // Return the data untouched if we don't know how to traverse it\n if (!utils) {\n return data;\n }\n\n // main loop\n let out = utils.transform(data);\n const keys = utils.keys(out);\n\n // Built once per traversal rather than once per key. `state.handlers` is populated\n // while the traversal is being defined and is fixed by the time it runs, so spreading\n // both lists on every key allocated a fresh array to hold the same handlers. This\n // loop runs for every key of every node of every query, which made it one of the\n // hottest allocation sites in a request.\n const handlers = [...state.handlers.common, ...state.handlers.attributes];\n\n // Also hoisted: none of these close over `key` (each method takes it as an argument),\n // so the previous code allocated three closures per key to no end. They still mutate\n // the same `out` binding, so behaviour is unchanged.\n const transformUtils: TransformUtils = {\n remove(key) {\n out = utils.remove(key, out);\n },\n set(key, value) {\n out = utils.set(key, value, out);\n },\n recurse: traverse,\n };\n\n // Pre-picked instead of calling lodash `pick` per key, which allocated both the\n // key-list array literal and a fresh result object every time.\n const visitorUtils: Pick<TransformUtils, 'set' | 'remove'> = {\n remove: transformUtils.remove,\n set: transformUtils.set,\n };\n const handlerUtils: Pick<TransformUtils, 'set' | 'recurse'> = {\n set: transformUtils.set,\n recurse: transformUtils.recurse,\n };\n\n for (const key of keys) {\n const attribute = schema?.attributes?.[key];\n\n // The attribute segment only grows when the key maps to an attribute; otherwise the\n // parent's value carries through unchanged.\n let attributePath = path.attribute;\n if (attribute != null) {\n attributePath = path.attribute == null ? key : `${path.attribute}.${key}`;\n }\n\n // A single literal rather than a spread followed by conditional assignment: the\n // spread produced an object whose hidden class then transitioned on each write.\n // `Path` is closed over `raw` and `attribute` and callers never supply their own,\n // so nothing can be dropped by building it directly.\n const newPath: Path = {\n raw: path.raw == null ? key : `${path.raw}.${key}`,\n attribute: attributePath,\n };\n\n // visitors\n const visitorOptions: VisitorOptions = {\n key,\n value: utils.get(key, out),\n attribute,\n schema,\n path: newPath,\n data: out,\n getModel,\n parent,\n };\n\n // Awaited unconditionally. Most visitors are synchronous, and awaiting a\n // non-thenable still schedules a microtask, but skipping that await changes\n // the order of branches that recurse concurrently via Promise.all.\n //\n // That reordering used to drop nested populate in content-manager's\n // getQueryPopulate: a shallow `relation` write replaced the subtree a deeper\n // sibling had written at `relation.populate.component`. #27236 fixed that\n // visitor by merging paths. Re-measuring the skip afterward showed no\n // throughput gain, so the await stays.\n await visitor(visitorOptions, visitorUtils);\n\n const value = utils.get(key, out);\n\n const createContext = (): Context => ({\n key,\n value,\n attribute,\n schema,\n path: newPath,\n data: out,\n visitor,\n getModel,\n parent,\n });\n\n // ignore\n const ignoreCtx = createContext();\n const shouldIgnore = state.ignore.some((predicate) => predicate(ignoreCtx));\n\n if (shouldIgnore) {\n continue;\n }\n\n // handlers\n //\n // `for await` over a plain array awaits every element, allocating a promise per\n // handler per key even though the elements are ordinary objects. A plain `for...of`\n // with explicit thenable checks is equivalent for non-promise elements, and the\n // predicates in practice are synchronous.\n for (const handler of handlers) {\n const ctx = createContext();\n\n // A fresh context per handler is deliberate: a handler may call `set`, which\n // reassigns `out`, and the next handler must observe the updated `data`.\n const predicated = handler.predicate(ctx) as unknown;\n const pass =\n predicated != null && typeof (predicated as PromiseLike<boolean>).then === 'function'\n ? await (predicated as PromiseLike<boolean>)\n : predicated;\n\n if (pass) {\n const handled = handler.handler(ctx, handlerUtils) as unknown;\n\n if (handled != null && typeof (handled as PromiseLike<void>).then === 'function') {\n await handled;\n }\n }\n }\n }\n\n return out;\n };\n\n return {\n traverse,\n\n intercept<T>(predicate: Interceptor<T>['predicate'], handler: Interceptor<T>['handler']) {\n state.interceptors.push({ predicate, handler });\n return this;\n },\n\n parse<T>(predicate: Parser<T>['predicate'], parser: Parser<T>['parser']) {\n state.parsers.push({ predicate, parser });\n return this;\n },\n\n ignore(predicate: Ignore) {\n state.ignore.push(predicate);\n return this;\n },\n\n on(predicate: CommonHandler['predicate'], handler: CommonHandler['handler']) {\n state.handlers.common.push({ predicate, handler });\n return this;\n },\n\n onAttribute(predicate: AttributeHandler['predicate'], handler: AttributeHandler['handler']) {\n state.handlers.attributes.push({ predicate, handler });\n return this;\n },\n\n onRelation(handler: AttributeHandler<RelationalAttribute>['handler']) {\n return this.onAttribute(({ attribute }) => attribute?.type === 'relation', handler);\n },\n\n onMedia(handler: AttributeHandler<RelationalAttribute>['handler']) {\n return this.onAttribute(({ attribute }) => attribute?.type === 'media', handler);\n },\n\n onComponent(handler: AttributeHandler<ComponentAttribute>['handler']) {\n return this.onAttribute(({ attribute }) => attribute?.type === 'component', handler);\n },\n\n onDynamicZone(handler: AttributeHandler<DynamicZoneAttribute>['handler']) {\n return this.onAttribute(({ attribute }) => attribute?.type === 'dynamiczone', handler);\n },\n };\n};\n"],"names":["DEFAULT_PATH","raw","attribute","state","parsers","interceptors","ignore","handlers","attributes","common","traverse","visitor","options","data","path","parent","schema","getModel","predicate","handler","recurse","parser","find","utils","out","transform","keys","transformUtils","remove","key","set","value","visitorUtils","handlerUtils","attributePath","newPath","visitorOptions","get","createContext","ignoreCtx","shouldIgnore","some","ctx","predicated","pass","then","handled","intercept","push","parse","on","onAttribute","onRelation","type","onMedia","onComponent","onDynamicZone"],"mappings":"AAAA,qDAkHA,MAAMA,YAAAA,GAAe;IAAEC,GAAAA,EAAK,IAAA;IAAMC,SAAAA,EAAW;AAAK,CAAA;AAElD,sBAAe,CAAA,IAAA;AACb,IAAA,MAAMC,KAAAA,GAAe;AACnBC,QAAAA,OAAAA,EAAS,EAAE;AACXC,QAAAA,YAAAA,EAAc,EAAE;AAChBC,QAAAA,MAAAA,EAAQ,EAAE;QACVC,QAAAA,EAAU;AACRC,YAAAA,UAAAA,EAAY,EAAE;AACdC,YAAAA,MAAAA,EAAQ;AACV;AACF,KAAA;IAEA,MAAMC,QAAAA,GAAqB,OAAOC,OAAAA,EAASC,OAAAA,EAASC,IAAAA,GAAAA;AAClD,QAAA,MAAM,EAAEC,IAAAA,GAAOd,YAAY,EAAEe,MAAM,EAAEC,MAAM,EAAEC,QAAQ,EAAE,GAAGL,OAAAA,IAAW,EAAC;;QAGtE,KAAK,MAAM,EAAEM,SAAS,EAAEC,OAAO,EAAE,IAAIhB,KAAAA,CAAME,YAAY,CAAE;AACvD,YAAA,IAAIa,UAAUL,IAAAA,CAAAA,EAAO;gBACnB,OAAOM,OAAAA,CAAQR,OAAAA,EAASC,OAAAA,EAASC,IAAAA,EAAM;oBAAEO,OAAAA,EAASV;AAAS,iBAAA,CAAA;AAC7D,YAAA;AACF,QAAA;;QAGA,MAAMW,MAAAA,GAASlB,KAAAA,CAAMC,OAAO,CAACkB,IAAI,CAAC,CAACD,MAAAA,GAAWA,MAAAA,CAAOH,SAAS,CAACL,IAAAA,CAAAA,CAAAA,EAAQQ,MAAAA;AACvE,QAAA,MAAME,QAAQF,MAAAA,GAASR,IAAAA,CAAAA;;AAGvB,QAAA,IAAI,CAACU,KAAAA,EAAO;YACV,OAAOV,IAAAA;AACT,QAAA;;QAGA,IAAIW,GAAAA,GAAMD,KAAAA,CAAME,SAAS,CAACZ,IAAAA,CAAAA;QAC1B,MAAMa,IAAAA,GAAOH,KAAAA,CAAMG,IAAI,CAACF,GAAAA,CAAAA;;;;;;AAOxB,QAAA,MAAMjB,QAAAA,GAAW;eAAIJ,KAAAA,CAAMI,QAAQ,CAACE,MAAM;eAAKN,KAAAA,CAAMI,QAAQ,CAACC;AAAW,SAAA;;;;AAKzE,QAAA,MAAMmB,cAAAA,GAAiC;AACrCC,YAAAA,MAAAA,CAAAA,CAAOC,GAAG,EAAA;gBACRL,GAAAA,GAAMD,KAAAA,CAAMK,MAAM,CAACC,GAAAA,EAAKL,GAAAA,CAAAA;AAC1B,YAAA,CAAA;YACAM,GAAAA,CAAAA,CAAID,GAAG,EAAEE,KAAK,EAAA;AACZP,gBAAAA,GAAAA,GAAMD,KAAAA,CAAMO,GAAG,CAACD,GAAAA,EAAKE,KAAAA,EAAOP,GAAAA,CAAAA;AAC9B,YAAA,CAAA;YACAJ,OAAAA,EAASV;AACX,SAAA;;;AAIA,QAAA,MAAMsB,YAAAA,GAAuD;AAC3DJ,YAAAA,MAAAA,EAAQD,eAAeC,MAAM;AAC7BE,YAAAA,GAAAA,EAAKH,eAAeG;AACtB,SAAA;AACA,QAAA,MAAMG,YAAAA,GAAwD;AAC5DH,YAAAA,GAAAA,EAAKH,eAAeG,GAAG;AACvBV,YAAAA,OAAAA,EAASO,eAAeP;AAC1B,SAAA;QAEA,KAAK,MAAMS,OAAOH,IAAAA,CAAM;AACtB,YAAA,MAAMxB,SAAAA,GAAYc,MAAAA,EAAQR,UAAAA,GAAaqB,GAAAA,CAAI;;;YAI3C,IAAIK,aAAAA,GAAgBpB,KAAKZ,SAAS;AAClC,YAAA,IAAIA,aAAa,IAAA,EAAM;gBACrBgC,aAAAA,GAAgBpB,IAAAA,CAAKZ,SAAS,IAAI,IAAA,GAAO2B,GAAAA,GAAM,CAAA,EAAGf,IAAAA,CAAKZ,SAAS,CAAC,CAAC,EAAE2B,GAAAA,CAAAA,CAAK;AAC3E,YAAA;;;;;AAMA,YAAA,MAAMM,OAAAA,GAAgB;gBACpBlC,GAAAA,EAAKa,IAAAA,CAAKb,GAAG,IAAI,IAAA,GAAO4B,GAAAA,GAAM,CAAA,EAAGf,IAAAA,CAAKb,GAAG,CAAC,CAAC,EAAE4B,GAAAA,CAAAA,CAAK;gBAClD3B,SAAAA,EAAWgC;AACb,aAAA;;AAGA,YAAA,MAAME,cAAAA,GAAiC;AACrCP,gBAAAA,GAAAA;gBACAE,KAAAA,EAAOR,KAAAA,CAAMc,GAAG,CAACR,GAAAA,EAAKL,GAAAA,CAAAA;AACtBtB,gBAAAA,SAAAA;AACAc,gBAAAA,MAAAA;gBACAF,IAAAA,EAAMqB,OAAAA;gBACNtB,IAAAA,EAAMW,GAAAA;AACNP,gBAAAA,QAAAA;AACAF,gBAAAA;AACF,aAAA;;;;;;;;;;AAWA,YAAA,MAAMJ,QAAQyB,cAAAA,EAAgBJ,YAAAA,CAAAA;AAE9B,YAAA,MAAMD,KAAAA,GAAQR,KAAAA,CAAMc,GAAG,CAACR,GAAAA,EAAKL,GAAAA,CAAAA;YAE7B,MAAMc,aAAAA,GAAgB,KAAgB;AACpCT,oBAAAA,GAAAA;AACAE,oBAAAA,KAAAA;AACA7B,oBAAAA,SAAAA;AACAc,oBAAAA,MAAAA;oBACAF,IAAAA,EAAMqB,OAAAA;oBACNtB,IAAAA,EAAMW,GAAAA;AACNb,oBAAAA,OAAAA;AACAM,oBAAAA,QAAAA;AACAF,oBAAAA;iBACF,CAAA;;AAGA,YAAA,MAAMwB,SAAAA,GAAYD,aAAAA,EAAAA;YAClB,MAAME,YAAAA,GAAerC,MAAMG,MAAM,CAACmC,IAAI,CAAC,CAACvB,YAAcA,SAAAA,CAAUqB,SAAAA,CAAAA,CAAAA;AAEhE,YAAA,IAAIC,YAAAA,EAAc;AAChB,gBAAA;AACF,YAAA;;;;;;;YAQA,KAAK,MAAMrB,WAAWZ,QAAAA,CAAU;AAC9B,gBAAA,MAAMmC,GAAAA,GAAMJ,aAAAA,EAAAA;;;gBAIZ,MAAMK,UAAAA,GAAaxB,OAAAA,CAAQD,SAAS,CAACwB,GAAAA,CAAAA;gBACrC,MAAME,IAAAA,GACJD,UAAAA,IAAc,IAAA,IAAQ,OAAQA,WAAoCE,IAAI,KAAK,UAAA,GACvE,MAAOF,UAAAA,GACPA,UAAAA;AAEN,gBAAA,IAAIC,IAAAA,EAAM;AACR,oBAAA,MAAME,OAAAA,GAAU3B,OAAAA,CAAQA,OAAO,CAACuB,GAAAA,EAAKT,YAAAA,CAAAA;AAErC,oBAAA,IAAIa,WAAW,IAAA,IAAQ,OAAO,OAACA,CAA8BD,IAAI,KAAK,UAAA,EAAY;wBAChF,MAAMC,OAAAA;AACR,oBAAA;AACF,gBAAA;AACF,YAAA;AACF,QAAA;QAEA,OAAOtB,GAAAA;AACT,IAAA,CAAA;IAEA,OAAO;AACLd,QAAAA,QAAAA;QAEAqC,SAAAA,CAAAA,CAAa7B,SAAsC,EAAEC,OAAkC,EAAA;YACrFhB,KAAAA,CAAME,YAAY,CAAC2C,IAAI,CAAC;AAAE9B,gBAAAA,SAAAA;AAAWC,gBAAAA;AAAQ,aAAA,CAAA;AAC7C,YAAA,OAAO,IAAI;AACb,QAAA,CAAA;QAEA8B,KAAAA,CAAAA,CAAS/B,SAAiC,EAAEG,MAA2B,EAAA;YACrElB,KAAAA,CAAMC,OAAO,CAAC4C,IAAI,CAAC;AAAE9B,gBAAAA,SAAAA;AAAWG,gBAAAA;AAAO,aAAA,CAAA;AACvC,YAAA,OAAO,IAAI;AACb,QAAA,CAAA;AAEAf,QAAAA,MAAAA,CAAAA,CAAOY,SAAiB,EAAA;YACtBf,KAAAA,CAAMG,MAAM,CAAC0C,IAAI,CAAC9B,SAAAA,CAAAA;AAClB,YAAA,OAAO,IAAI;AACb,QAAA,CAAA;QAEAgC,EAAAA,CAAAA,CAAGhC,SAAqC,EAAEC,OAAiC,EAAA;AACzEhB,YAAAA,KAAAA,CAAMI,QAAQ,CAACE,MAAM,CAACuC,IAAI,CAAC;AAAE9B,gBAAAA,SAAAA;AAAWC,gBAAAA;AAAQ,aAAA,CAAA;AAChD,YAAA,OAAO,IAAI;AACb,QAAA,CAAA;QAEAgC,WAAAA,CAAAA,CAAYjC,SAAwC,EAAEC,OAAoC,EAAA;AACxFhB,YAAAA,KAAAA,CAAMI,QAAQ,CAACC,UAAU,CAACwC,IAAI,CAAC;AAAE9B,gBAAAA,SAAAA;AAAWC,gBAAAA;AAAQ,aAAA,CAAA;AACpD,YAAA,OAAO,IAAI;AACb,QAAA,CAAA;AAEAiC,QAAAA,UAAAA,CAAAA,CAAWjC,OAAyD,EAAA;YAClE,OAAO,IAAI,CAACgC,WAAW,CAAC,CAAC,EAAEjD,SAAS,EAAE,GAAKA,SAAAA,EAAWmD,IAAAA,KAAS,UAAA,EAAYlC,OAAAA,CAAAA;AAC7E,QAAA,CAAA;AAEAmC,QAAAA,OAAAA,CAAAA,CAAQnC,OAAyD,EAAA;YAC/D,OAAO,IAAI,CAACgC,WAAW,CAAC,CAAC,EAAEjD,SAAS,EAAE,GAAKA,SAAAA,EAAWmD,IAAAA,KAAS,OAAA,EAASlC,OAAAA,CAAAA;AAC1E,QAAA,CAAA;AAEAoC,QAAAA,WAAAA,CAAAA,CAAYpC,OAAwD,EAAA;YAClE,OAAO,IAAI,CAACgC,WAAW,CAAC,CAAC,EAAEjD,SAAS,EAAE,GAAKA,SAAAA,EAAWmD,IAAAA,KAAS,WAAA,EAAalC,OAAAA,CAAAA;AAC9E,QAAA,CAAA;AAEAqC,QAAAA,aAAAA,CAAAA,CAAcrC,OAA0D,EAAA;YACtE,OAAO,IAAI,CAACgC,WAAW,CAAC,CAAC,EAAEjD,SAAS,EAAE,GAAKA,SAAAA,EAAWmD,IAAAA,KAAS,aAAA,EAAelC,OAAAA,CAAAA;AAChF,QAAA;AACF,KAAA;AACF,CAAA;;;;"}
|
|
1
|
+
{"version":3,"file":"factory.mjs","sources":["../../src/traverse/factory.ts"],"sourcesContent":["/* eslint-disable @typescript-eslint/no-loop-func */\nimport {\n AnyAttribute,\n Attribute,\n ComponentAttribute,\n DynamicZoneAttribute,\n Model,\n RelationalAttribute,\n} from '../types';\n\nexport interface Path {\n raw: string | null;\n attribute: string | null;\n}\n\nexport interface Parent {\n attribute?: Attribute;\n key: string | null;\n path: Path;\n schema: Model;\n}\n\nexport interface TraverseOptions {\n schema: Model;\n path?: Path;\n parent?: Parent;\n getModel(uid: string): Model;\n}\n\nexport interface VisitorOptions {\n data: unknown;\n value: unknown;\n schema: Model;\n key: string;\n attribute?: AnyAttribute;\n path: Path;\n parent?: Parent;\n getModel(uid: string): Model;\n}\n\nexport type Traverse = (\n visitor: Visitor,\n options: TraverseOptions,\n data: unknown\n) => Promise<unknown>;\n\nexport interface Visitor {\n (visitorOptions: VisitorOptions, opts: Pick<TransformUtils, 'set' | 'remove'>): void;\n}\n\ninterface Interceptor<T = unknown> {\n predicate(data: unknown): data is T;\n handler(\n visitor: Visitor,\n options: TraverseOptions,\n data: T,\n recurseOptions: { recurse: Traverse }\n ): void;\n}\n\ninterface ParseUtils<T> {\n /**\n * Copies data the traversal does not own yet. Optional. It runs once, on the data the caller\n * passes in, and not on the values the traversal recurses into, which are already part of\n * that copy.\n */\n clone?(data: T): T;\n /** Runs at every level, on the data about to be walked. */\n transform(data: T): unknown;\n remove(key: string, data: T): unknown;\n set(key: string, value: unknown, data: T): unknown;\n keys(data: T): string[];\n get(key: string, data: T): unknown;\n}\n\ninterface Parser<T = unknown> {\n predicate(data: unknown): data is T;\n parser(data: T): ParseUtils<T>;\n}\n\ninterface Ignore {\n (ctx: Context): boolean;\n}\n\ninterface AttributeHandler<AttributeType = Attribute> {\n predicate(ctx: Context<AttributeType>): boolean;\n handler(ctx: Context<AttributeType>, opts: Pick<TransformUtils, 'set' | 'recurse'>): void;\n}\ninterface CommonHandler<AttributeType = Attribute> {\n predicate(ctx: Context<AttributeType>): boolean;\n handler(ctx: Context<AttributeType>, opts: Pick<TransformUtils, 'set' | 'recurse'>): void;\n}\n\nexport interface TransformUtils {\n remove(key: string): void;\n set(key: string, value: unknown): void;\n recurse: Traverse;\n}\n\ninterface Context<AttributeType = Attribute> {\n key: string;\n value: unknown;\n attribute: AttributeType;\n schema: Model;\n path: Path;\n data: unknown;\n visitor: Visitor;\n parent?: Parent;\n getModel(uid: string): Model;\n}\n\ninterface State {\n parsers: Parser[];\n interceptors: Interceptor[];\n ignore: Ignore[];\n handlers: {\n attributes: AttributeHandler[];\n common: CommonHandler[];\n };\n}\n\nconst DEFAULT_PATH = { raw: null, attribute: null } satisfies Path;\n\nexport default () => {\n const state: State = {\n parsers: [],\n interceptors: [],\n ignore: [],\n handlers: {\n attributes: [],\n common: [],\n },\n };\n\n /**\n * `owned` is true when `data` is part of a copy this traversal has already made.\n *\n * A parser's `set` and `remove` build new objects instead of writing into the data, so a\n * single copy of the caller's data is enough to keep it untouched, and to keep the result from\n * sharing objects with it. Values a handler recurses into come from that copy, from the\n * handler, or from a visitor's `set`, and are walked without copying them again. A visitor\n * must therefore `set` a fresh value, not one it shares with anything else.\n */\n const walk = async (\n visitor: Visitor,\n options: TraverseOptions,\n data: unknown,\n owned: boolean\n ): Promise<unknown> => {\n const { path = DEFAULT_PATH, parent, schema, getModel } = options ?? {};\n\n // interceptors\n for (const { predicate, handler } of state.interceptors) {\n if (predicate(data)) {\n // An interceptor can hand the caller's own data to the recursion (for example the\n // items of a filters array), so it only skips the copy when this level already owns it.\n return handler(visitor, options, data, { recurse: owned ? traverseOwned : traverse });\n }\n }\n\n // parsers\n const parser = state.parsers.find((parser) => parser.predicate(data))?.parser;\n const utils = parser?.(data);\n\n // Return the data untouched if we don't know how to traverse it\n if (!utils) {\n return data;\n }\n\n // main loop\n let out = utils.transform(owned || !utils.clone ? data : utils.clone(data));\n const keys = utils.keys(out);\n\n // Built once per traversal rather than once per key. `state.handlers` is populated\n // while the traversal is being defined and is fixed by the time it runs, so spreading\n // both lists on every key allocated a fresh array to hold the same handlers. This\n // loop runs for every key of every node of every query, which made it one of the\n // hottest allocation sites in a request.\n const handlers = [...state.handlers.common, ...state.handlers.attributes];\n\n // Also hoisted: none of these close over `key` (each method takes it as an argument),\n // so the previous code allocated three closures per key to no end. They still mutate\n // the same `out` binding, so behaviour is unchanged.\n const transformUtils: TransformUtils = {\n remove(key) {\n out = utils.remove(key, out);\n },\n set(key, value) {\n out = utils.set(key, value, out);\n },\n // Handlers recurse into values of `out`, which this traversal owns.\n recurse: traverseOwned,\n };\n\n // Pre-picked instead of calling lodash `pick` per key, which allocated both the\n // key-list array literal and a fresh result object every time.\n const visitorUtils: Pick<TransformUtils, 'set' | 'remove'> = {\n remove: transformUtils.remove,\n set: transformUtils.set,\n };\n const handlerUtils: Pick<TransformUtils, 'set' | 'recurse'> = {\n set: transformUtils.set,\n recurse: transformUtils.recurse,\n };\n\n for (const key of keys) {\n const attribute = schema?.attributes?.[key];\n\n // The attribute segment only grows when the key maps to an attribute; otherwise the\n // parent's value carries through unchanged.\n let attributePath = path.attribute;\n if (attribute != null) {\n attributePath = path.attribute == null ? key : `${path.attribute}.${key}`;\n }\n\n // A single literal rather than a spread followed by conditional assignment: the\n // spread produced an object whose hidden class then transitioned on each write.\n // `Path` is closed over `raw` and `attribute` and callers never supply their own,\n // so nothing can be dropped by building it directly.\n const newPath: Path = {\n raw: path.raw == null ? key : `${path.raw}.${key}`,\n attribute: attributePath,\n };\n\n // visitors\n const visitorOptions: VisitorOptions = {\n key,\n value: utils.get(key, out),\n attribute,\n schema,\n path: newPath,\n data: out,\n getModel,\n parent,\n };\n\n // Awaited unconditionally. Most visitors are synchronous, and awaiting a\n // non-thenable still schedules a microtask, but skipping that await changes\n // the order of branches that recurse concurrently via Promise.all.\n //\n // That reordering used to drop nested populate in content-manager's\n // getQueryPopulate: a shallow `relation` write replaced the subtree a deeper\n // sibling had written at `relation.populate.component`. #27236 fixed that\n // visitor by merging paths. Re-measuring the skip afterward showed no\n // throughput gain, so the await stays.\n await visitor(visitorOptions, visitorUtils);\n\n const value = utils.get(key, out);\n\n const createContext = (): Context => ({\n key,\n value,\n attribute,\n schema,\n path: newPath,\n data: out,\n visitor,\n getModel,\n parent,\n });\n\n // ignore\n const ignoreCtx = createContext();\n const shouldIgnore = state.ignore.some((predicate) => predicate(ignoreCtx));\n\n if (shouldIgnore) {\n continue;\n }\n\n // handlers\n //\n // `for await` over a plain array awaits every element, allocating a promise per\n // handler per key even though the elements are ordinary objects. A plain `for...of`\n // with explicit thenable checks is equivalent for non-promise elements, and the\n // predicates in practice are synchronous.\n for (const handler of handlers) {\n const ctx = createContext();\n\n // A fresh context per handler is deliberate: a handler may call `set`, which\n // reassigns `out`, and the next handler must observe the updated `data`.\n const predicated = handler.predicate(ctx) as unknown;\n const pass =\n predicated != null && typeof (predicated as PromiseLike<boolean>).then === 'function'\n ? await (predicated as PromiseLike<boolean>)\n : predicated;\n\n if (pass) {\n const handled = handler.handler(ctx, handlerUtils) as unknown;\n\n if (handled != null && typeof (handled as PromiseLike<void>).then === 'function') {\n await handled;\n }\n }\n }\n }\n\n return out;\n };\n\n // Entry point: the data comes from the caller, so it is copied before it is walked.\n const traverse: Traverse = (visitor, options, data) => walk(visitor, options, data, false);\n const traverseOwned: Traverse = (visitor, options, data) => walk(visitor, options, data, true);\n\n return {\n traverse,\n\n intercept<T>(predicate: Interceptor<T>['predicate'], handler: Interceptor<T>['handler']) {\n state.interceptors.push({ predicate, handler });\n return this;\n },\n\n parse<T>(predicate: Parser<T>['predicate'], parser: Parser<T>['parser']) {\n state.parsers.push({ predicate, parser });\n return this;\n },\n\n ignore(predicate: Ignore) {\n state.ignore.push(predicate);\n return this;\n },\n\n on(predicate: CommonHandler['predicate'], handler: CommonHandler['handler']) {\n state.handlers.common.push({ predicate, handler });\n return this;\n },\n\n onAttribute(predicate: AttributeHandler['predicate'], handler: AttributeHandler['handler']) {\n state.handlers.attributes.push({ predicate, handler });\n return this;\n },\n\n onRelation(handler: AttributeHandler<RelationalAttribute>['handler']) {\n return this.onAttribute(({ attribute }) => attribute?.type === 'relation', handler);\n },\n\n onMedia(handler: AttributeHandler<RelationalAttribute>['handler']) {\n return this.onAttribute(({ attribute }) => attribute?.type === 'media', handler);\n },\n\n onComponent(handler: AttributeHandler<ComponentAttribute>['handler']) {\n return this.onAttribute(({ attribute }) => attribute?.type === 'component', handler);\n },\n\n onDynamicZone(handler: AttributeHandler<DynamicZoneAttribute>['handler']) {\n return this.onAttribute(({ attribute }) => attribute?.type === 'dynamiczone', handler);\n },\n };\n};\n"],"names":["DEFAULT_PATH","raw","attribute","state","parsers","interceptors","ignore","handlers","attributes","common","walk","visitor","options","data","owned","path","parent","schema","getModel","predicate","handler","recurse","traverseOwned","traverse","parser","find","utils","out","transform","clone","keys","transformUtils","remove","key","set","value","visitorUtils","handlerUtils","attributePath","newPath","visitorOptions","get","createContext","ignoreCtx","shouldIgnore","some","ctx","predicated","pass","then","handled","intercept","push","parse","on","onAttribute","onRelation","type","onMedia","onComponent","onDynamicZone"],"mappings":"AAAA,qDAyHA,MAAMA,YAAAA,GAAe;IAAEC,GAAAA,EAAK,IAAA;IAAMC,SAAAA,EAAW;AAAK,CAAA;AAElD,sBAAe,CAAA,IAAA;AACb,IAAA,MAAMC,KAAAA,GAAe;AACnBC,QAAAA,OAAAA,EAAS,EAAE;AACXC,QAAAA,YAAAA,EAAc,EAAE;AAChBC,QAAAA,MAAAA,EAAQ,EAAE;QACVC,QAAAA,EAAU;AACRC,YAAAA,UAAAA,EAAY,EAAE;AACdC,YAAAA,MAAAA,EAAQ;AACV;AACF,KAAA;AAEA;;;;;;;;AAQC,MACD,MAAMC,IAAAA,GAAO,OACXC,OAAAA,EACAC,SACAC,IAAAA,EACAC,KAAAA,GAAAA;AAEA,QAAA,MAAM,EAAEC,IAAAA,GAAOf,YAAY,EAAEgB,MAAM,EAAEC,MAAM,EAAEC,QAAQ,EAAE,GAAGN,OAAAA,IAAW,EAAC;;QAGtE,KAAK,MAAM,EAAEO,SAAS,EAAEC,OAAO,EAAE,IAAIjB,KAAAA,CAAME,YAAY,CAAE;AACvD,YAAA,IAAIc,UAAUN,IAAAA,CAAAA,EAAO;;;gBAGnB,OAAOO,OAAAA,CAAQT,OAAAA,EAASC,OAAAA,EAASC,IAAAA,EAAM;AAAEQ,oBAAAA,OAAAA,EAASP,QAAQQ,aAAAA,GAAgBC;AAAS,iBAAA,CAAA;AACrF,YAAA;AACF,QAAA;;QAGA,MAAMC,MAAAA,GAASrB,KAAAA,CAAMC,OAAO,CAACqB,IAAI,CAAC,CAACD,MAAAA,GAAWA,MAAAA,CAAOL,SAAS,CAACN,IAAAA,CAAAA,CAAAA,EAAQW,MAAAA;AACvE,QAAA,MAAME,QAAQF,MAAAA,GAASX,IAAAA,CAAAA;;AAGvB,QAAA,IAAI,CAACa,KAAAA,EAAO;YACV,OAAOb,IAAAA;AACT,QAAA;;AAGA,QAAA,IAAIc,GAAAA,GAAMD,KAAAA,CAAME,SAAS,CAACd,KAAAA,IAAS,CAACY,KAAAA,CAAMG,KAAK,GAAGhB,IAAAA,GAAOa,KAAAA,CAAMG,KAAK,CAAChB,IAAAA,CAAAA,CAAAA;QACrE,MAAMiB,IAAAA,GAAOJ,KAAAA,CAAMI,IAAI,CAACH,GAAAA,CAAAA;;;;;;AAOxB,QAAA,MAAMpB,QAAAA,GAAW;eAAIJ,KAAAA,CAAMI,QAAQ,CAACE,MAAM;eAAKN,KAAAA,CAAMI,QAAQ,CAACC;AAAW,SAAA;;;;AAKzE,QAAA,MAAMuB,cAAAA,GAAiC;AACrCC,YAAAA,MAAAA,CAAAA,CAAOC,GAAG,EAAA;gBACRN,GAAAA,GAAMD,KAAAA,CAAMM,MAAM,CAACC,GAAAA,EAAKN,GAAAA,CAAAA;AAC1B,YAAA,CAAA;YACAO,GAAAA,CAAAA,CAAID,GAAG,EAAEE,KAAK,EAAA;AACZR,gBAAAA,GAAAA,GAAMD,KAAAA,CAAMQ,GAAG,CAACD,GAAAA,EAAKE,KAAAA,EAAOR,GAAAA,CAAAA;AAC9B,YAAA,CAAA;;YAEAN,OAAAA,EAASC;AACX,SAAA;;;AAIA,QAAA,MAAMc,YAAAA,GAAuD;AAC3DJ,YAAAA,MAAAA,EAAQD,eAAeC,MAAM;AAC7BE,YAAAA,GAAAA,EAAKH,eAAeG;AACtB,SAAA;AACA,QAAA,MAAMG,YAAAA,GAAwD;AAC5DH,YAAAA,GAAAA,EAAKH,eAAeG,GAAG;AACvBb,YAAAA,OAAAA,EAASU,eAAeV;AAC1B,SAAA;QAEA,KAAK,MAAMY,OAAOH,IAAAA,CAAM;AACtB,YAAA,MAAM5B,SAAAA,GAAYe,MAAAA,EAAQT,UAAAA,GAAayB,GAAAA,CAAI;;;YAI3C,IAAIK,aAAAA,GAAgBvB,KAAKb,SAAS;AAClC,YAAA,IAAIA,aAAa,IAAA,EAAM;gBACrBoC,aAAAA,GAAgBvB,IAAAA,CAAKb,SAAS,IAAI,IAAA,GAAO+B,GAAAA,GAAM,CAAA,EAAGlB,IAAAA,CAAKb,SAAS,CAAC,CAAC,EAAE+B,GAAAA,CAAAA,CAAK;AAC3E,YAAA;;;;;AAMA,YAAA,MAAMM,OAAAA,GAAgB;gBACpBtC,GAAAA,EAAKc,IAAAA,CAAKd,GAAG,IAAI,IAAA,GAAOgC,GAAAA,GAAM,CAAA,EAAGlB,IAAAA,CAAKd,GAAG,CAAC,CAAC,EAAEgC,GAAAA,CAAAA,CAAK;gBAClD/B,SAAAA,EAAWoC;AACb,aAAA;;AAGA,YAAA,MAAME,cAAAA,GAAiC;AACrCP,gBAAAA,GAAAA;gBACAE,KAAAA,EAAOT,KAAAA,CAAMe,GAAG,CAACR,GAAAA,EAAKN,GAAAA,CAAAA;AACtBzB,gBAAAA,SAAAA;AACAe,gBAAAA,MAAAA;gBACAF,IAAAA,EAAMwB,OAAAA;gBACN1B,IAAAA,EAAMc,GAAAA;AACNT,gBAAAA,QAAAA;AACAF,gBAAAA;AACF,aAAA;;;;;;;;;;AAWA,YAAA,MAAML,QAAQ6B,cAAAA,EAAgBJ,YAAAA,CAAAA;AAE9B,YAAA,MAAMD,KAAAA,GAAQT,KAAAA,CAAMe,GAAG,CAACR,GAAAA,EAAKN,GAAAA,CAAAA;YAE7B,MAAMe,aAAAA,GAAgB,KAAgB;AACpCT,oBAAAA,GAAAA;AACAE,oBAAAA,KAAAA;AACAjC,oBAAAA,SAAAA;AACAe,oBAAAA,MAAAA;oBACAF,IAAAA,EAAMwB,OAAAA;oBACN1B,IAAAA,EAAMc,GAAAA;AACNhB,oBAAAA,OAAAA;AACAO,oBAAAA,QAAAA;AACAF,oBAAAA;iBACF,CAAA;;AAGA,YAAA,MAAM2B,SAAAA,GAAYD,aAAAA,EAAAA;YAClB,MAAME,YAAAA,GAAezC,MAAMG,MAAM,CAACuC,IAAI,CAAC,CAAC1B,YAAcA,SAAAA,CAAUwB,SAAAA,CAAAA,CAAAA;AAEhE,YAAA,IAAIC,YAAAA,EAAc;AAChB,gBAAA;AACF,YAAA;;;;;;;YAQA,KAAK,MAAMxB,WAAWb,QAAAA,CAAU;AAC9B,gBAAA,MAAMuC,GAAAA,GAAMJ,aAAAA,EAAAA;;;gBAIZ,MAAMK,UAAAA,GAAa3B,OAAAA,CAAQD,SAAS,CAAC2B,GAAAA,CAAAA;gBACrC,MAAME,IAAAA,GACJD,UAAAA,IAAc,IAAA,IAAQ,OAAQA,WAAoCE,IAAI,KAAK,UAAA,GACvE,MAAOF,UAAAA,GACPA,UAAAA;AAEN,gBAAA,IAAIC,IAAAA,EAAM;AACR,oBAAA,MAAME,OAAAA,GAAU9B,OAAAA,CAAQA,OAAO,CAAC0B,GAAAA,EAAKT,YAAAA,CAAAA;AAErC,oBAAA,IAAIa,WAAW,IAAA,IAAQ,OAAO,OAACA,CAA8BD,IAAI,KAAK,UAAA,EAAY;wBAChF,MAAMC,OAAAA;AACR,oBAAA;AACF,gBAAA;AACF,YAAA;AACF,QAAA;QAEA,OAAOvB,GAAAA;AACT,IAAA,CAAA;;IAGA,MAAMJ,QAAAA,GAAqB,CAACZ,OAAAA,EAASC,OAAAA,EAASC,OAASH,IAAAA,CAAKC,OAAAA,EAASC,SAASC,IAAAA,EAAM,KAAA,CAAA;IACpF,MAAMS,aAAAA,GAA0B,CAACX,OAAAA,EAASC,OAAAA,EAASC,OAASH,IAAAA,CAAKC,OAAAA,EAASC,SAASC,IAAAA,EAAM,IAAA,CAAA;IAEzF,OAAO;AACLU,QAAAA,QAAAA;QAEA4B,SAAAA,CAAAA,CAAahC,SAAsC,EAAEC,OAAkC,EAAA;YACrFjB,KAAAA,CAAME,YAAY,CAAC+C,IAAI,CAAC;AAAEjC,gBAAAA,SAAAA;AAAWC,gBAAAA;AAAQ,aAAA,CAAA;AAC7C,YAAA,OAAO,IAAI;AACb,QAAA,CAAA;QAEAiC,KAAAA,CAAAA,CAASlC,SAAiC,EAAEK,MAA2B,EAAA;YACrErB,KAAAA,CAAMC,OAAO,CAACgD,IAAI,CAAC;AAAEjC,gBAAAA,SAAAA;AAAWK,gBAAAA;AAAO,aAAA,CAAA;AACvC,YAAA,OAAO,IAAI;AACb,QAAA,CAAA;AAEAlB,QAAAA,MAAAA,CAAAA,CAAOa,SAAiB,EAAA;YACtBhB,KAAAA,CAAMG,MAAM,CAAC8C,IAAI,CAACjC,SAAAA,CAAAA;AAClB,YAAA,OAAO,IAAI;AACb,QAAA,CAAA;QAEAmC,EAAAA,CAAAA,CAAGnC,SAAqC,EAAEC,OAAiC,EAAA;AACzEjB,YAAAA,KAAAA,CAAMI,QAAQ,CAACE,MAAM,CAAC2C,IAAI,CAAC;AAAEjC,gBAAAA,SAAAA;AAAWC,gBAAAA;AAAQ,aAAA,CAAA;AAChD,YAAA,OAAO,IAAI;AACb,QAAA,CAAA;QAEAmC,WAAAA,CAAAA,CAAYpC,SAAwC,EAAEC,OAAoC,EAAA;AACxFjB,YAAAA,KAAAA,CAAMI,QAAQ,CAACC,UAAU,CAAC4C,IAAI,CAAC;AAAEjC,gBAAAA,SAAAA;AAAWC,gBAAAA;AAAQ,aAAA,CAAA;AACpD,YAAA,OAAO,IAAI;AACb,QAAA,CAAA;AAEAoC,QAAAA,UAAAA,CAAAA,CAAWpC,OAAyD,EAAA;YAClE,OAAO,IAAI,CAACmC,WAAW,CAAC,CAAC,EAAErD,SAAS,EAAE,GAAKA,SAAAA,EAAWuD,IAAAA,KAAS,UAAA,EAAYrC,OAAAA,CAAAA;AAC7E,QAAA,CAAA;AAEAsC,QAAAA,OAAAA,CAAAA,CAAQtC,OAAyD,EAAA;YAC/D,OAAO,IAAI,CAACmC,WAAW,CAAC,CAAC,EAAErD,SAAS,EAAE,GAAKA,SAAAA,EAAWuD,IAAAA,KAAS,OAAA,EAASrC,OAAAA,CAAAA;AAC1E,QAAA,CAAA;AAEAuC,QAAAA,WAAAA,CAAAA,CAAYvC,OAAwD,EAAA;YAClE,OAAO,IAAI,CAACmC,WAAW,CAAC,CAAC,EAAErD,SAAS,EAAE,GAAKA,SAAAA,EAAWuD,IAAAA,KAAS,WAAA,EAAarC,OAAAA,CAAAA;AAC9E,QAAA,CAAA;AAEAwC,QAAAA,aAAAA,CAAAA,CAAcxC,OAA0D,EAAA;YACtE,OAAO,IAAI,CAACmC,WAAW,CAAC,CAAC,EAAErD,SAAS,EAAE,GAAKA,SAAAA,EAAWuD,IAAAA,KAAS,aAAA,EAAerC,OAAAA,CAAAA;AAChF,QAAA;AACF,KAAA;AACF,CAAA;;;;"}
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"query-populate.d.ts","sourceRoot":"","sources":["../../src/traverse/query-populate.ts"],"names":[],"mappings":";
|
|
1
|
+
{"version":3,"file":"query-populate.d.ts","sourceRoot":"","sources":["../../src/traverse/query-populate.ts"],"names":[],"mappings":";AAuWA,wBAAwC"}
|
|
@@ -32,6 +32,16 @@ const isKeyword = (keyword)=>{
|
|
|
32
32
|
return !attribute && keyword === key;
|
|
33
33
|
};
|
|
34
34
|
};
|
|
35
|
+
/**
|
|
36
|
+
* Below a relation, media, component or `on` fragment (`parent.attribute` is set), the keys of a
|
|
37
|
+
* populate value are query keywords, even when the schema also has an attribute of the same
|
|
38
|
+
* name. Elsewhere, a key that names an attribute is that attribute.
|
|
39
|
+
*/ const isKeywordPosition = ({ attribute, parent })=>!attribute || !!parent?.attribute;
|
|
40
|
+
/**
|
|
41
|
+
* A nested `populate`. Unlike `isKeyword`, this also matches in a keyword position when the
|
|
42
|
+
* schema has an attribute named `populate`: the value is still walked as a nested populate of
|
|
43
|
+
* the schema, not as that attribute, so every visitor checks it against the right schema.
|
|
44
|
+
*/ const isPopulateKeyword = (ctx)=>ctx.key === 'populate' && isKeywordPosition(ctx);
|
|
35
45
|
const isWildcard = (value)=>value === '*';
|
|
36
46
|
const isPopulateString = (value)=>{
|
|
37
47
|
return _.isString(value) && !isWildcard(value);
|
|
@@ -112,7 +122,10 @@ const populate = factory().intercept(isPopulateString, async (visitor, options,
|
|
|
112
122
|
};
|
|
113
123
|
})// Parse object values
|
|
114
124
|
.parse(isObj, ()=>({
|
|
115
|
-
|
|
125
|
+
// Copied once, where the traversal is handed the caller's populate, rather than at every
|
|
126
|
+
// nested level: a deep copy at every level cost the size of the populate times its depth.
|
|
127
|
+
clone: _.cloneDeep,
|
|
128
|
+
transform: _.identity,
|
|
116
129
|
remove (key, data) {
|
|
117
130
|
// eslint-disable-next-line no-unused-vars
|
|
118
131
|
const { [key]: ignored, ...rest } = data;
|
|
@@ -145,14 +158,18 @@ const populate = factory().intercept(isPopulateString, async (visitor, options,
|
|
|
145
158
|
'sort',
|
|
146
159
|
'filters',
|
|
147
160
|
'fields'
|
|
148
|
-
].includes(key) && (
|
|
161
|
+
].includes(key) && isKeywordPosition({
|
|
162
|
+
attribute,
|
|
163
|
+
parent
|
|
164
|
+
});
|
|
149
165
|
}).on(// Handle recursion on populate."populate"
|
|
150
|
-
|
|
166
|
+
isPopulateKeyword, async ({ key, visitor, path, value, schema, getModel }, { set, recurse })=>{
|
|
167
|
+
// No `attribute`: the keys of the nested populate are attributes of `schema` again, even
|
|
168
|
+
// when `schema` has an attribute named `populate`.
|
|
151
169
|
const parent = {
|
|
152
170
|
key,
|
|
153
171
|
path,
|
|
154
|
-
schema
|
|
155
|
-
attribute
|
|
172
|
+
schema
|
|
156
173
|
};
|
|
157
174
|
const newValue = await recurse(visitor, {
|
|
158
175
|
schema,
|
|
@@ -181,8 +198,13 @@ isKeyword('populate'), async ({ key, visitor, path, value, schema, getModel, att
|
|
|
181
198
|
}
|
|
182
199
|
set(key, newOn);
|
|
183
200
|
})// Handle populate on relation
|
|
184
|
-
.onRelation(async ({ key, value, attribute, visitor, path, schema, getModel }, { set, recurse })=>{
|
|
185
|
-
|
|
201
|
+
.onRelation(async ({ key, value, attribute, visitor, path, schema, getModel, parent: keyParent }, { set, recurse })=>{
|
|
202
|
+
// A `populate` attribute in a keyword position is walked by `isPopulateKeyword` instead.
|
|
203
|
+
if (value == null || isPopulateKeyword({
|
|
204
|
+
key,
|
|
205
|
+
attribute,
|
|
206
|
+
parent: keyParent
|
|
207
|
+
})) {
|
|
186
208
|
return;
|
|
187
209
|
}
|
|
188
210
|
const parent = {
|
|
@@ -221,8 +243,12 @@ isKeyword('populate'), async ({ key, visitor, path, value, schema, getModel, att
|
|
|
221
243
|
}, value);
|
|
222
244
|
set(key, newValue);
|
|
223
245
|
})// Handle populate on media
|
|
224
|
-
.onMedia(async ({ key, path, schema, attribute, visitor, value, getModel }, { recurse, set })=>{
|
|
225
|
-
if (value == null
|
|
246
|
+
.onMedia(async ({ key, path, schema, attribute, visitor, value, getModel, parent: keyParent }, { recurse, set })=>{
|
|
247
|
+
if (value == null || isPopulateKeyword({
|
|
248
|
+
key,
|
|
249
|
+
attribute,
|
|
250
|
+
parent: keyParent
|
|
251
|
+
})) {
|
|
226
252
|
return;
|
|
227
253
|
}
|
|
228
254
|
const parent = {
|
|
@@ -241,8 +267,12 @@ isKeyword('populate'), async ({ key, visitor, path, value, schema, getModel, att
|
|
|
241
267
|
}, value);
|
|
242
268
|
set(key, newValue);
|
|
243
269
|
})// Handle populate on components
|
|
244
|
-
.onComponent(async ({ key, value, schema, visitor, path, attribute, getModel }, { recurse, set })=>{
|
|
245
|
-
if (value == null
|
|
270
|
+
.onComponent(async ({ key, value, schema, visitor, path, attribute, getModel, parent: keyParent }, { recurse, set })=>{
|
|
271
|
+
if (value == null || isPopulateKeyword({
|
|
272
|
+
key,
|
|
273
|
+
attribute,
|
|
274
|
+
parent: keyParent
|
|
275
|
+
})) {
|
|
246
276
|
return;
|
|
247
277
|
}
|
|
248
278
|
const parent = {
|
|
@@ -260,8 +290,12 @@ isKeyword('populate'), async ({ key, visitor, path, value, schema, getModel, att
|
|
|
260
290
|
}, value);
|
|
261
291
|
set(key, newValue);
|
|
262
292
|
})// Handle populate on dynamic zones
|
|
263
|
-
.onDynamicZone(async ({ key, value, schema, visitor, path, attribute, getModel }, { set, recurse })=>{
|
|
264
|
-
if (value == null || !_.isObject(value)
|
|
293
|
+
.onDynamicZone(async ({ key, value, schema, visitor, path, attribute, getModel, parent: keyParent }, { set, recurse })=>{
|
|
294
|
+
if (value == null || !_.isObject(value) || isPopulateKeyword({
|
|
295
|
+
key,
|
|
296
|
+
attribute,
|
|
297
|
+
parent: keyParent
|
|
298
|
+
})) {
|
|
265
299
|
return;
|
|
266
300
|
}
|
|
267
301
|
const parent = {
|
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"query-populate.js","sources":["../../src/traverse/query-populate.ts"],"sourcesContent":["import { isString, isEmpty, isObject, constant, identity, cloneDeep } from 'lodash';\n\nimport { curry } from '../curry';\nimport traverseFactory, { type Parent } from './factory';\nimport { Attribute } from '../types';\nimport { isMorphToRelationalAttribute } from '../content-types';\nimport { ValidationError } from '../errors';\n\nconst DEFAULT_QS_ARRAY_LIMIT = 100;\n\n/**\n * Detects objects with consecutive numeric string keys and string values — the shape `qs`\n * produces when indexed array notation exceeds `arrayLimit` (see #25632).\n */\nconst isQsArrayLimitPopulateObject = (value: unknown): value is Record<string, string> => {\n if (!isObject(value) || Array.isArray(value)) {\n return false;\n }\n\n const keys = Object.keys(value);\n\n if (keys.length === 0 || keys.length <= DEFAULT_QS_ARRAY_LIMIT) {\n return false;\n }\n\n const hasConsecutiveNumericKeys = keys.every((key, index) => key === String(index));\n\n if (!hasConsecutiveNumericKeys) {\n return false;\n }\n\n return Object.values(value).every((entry) => typeof entry === 'string');\n};\n\nconst throwQsArrayLimitPopulateError = (entryCount: number) => {\n throw new ValidationError(\n `Too many populate entries (${entryCount}). The maximum number of populate entries when using array notation is ${DEFAULT_QS_ARRAY_LIMIT}. ` +\n 'Consider using object notation (populate[field]=true), nested population, or reducing the number of fields.'\n );\n};\n\nconst isKeyword = (keyword: string) => {\n return ({ key, attribute }: { key: string; attribute: Attribute }) => {\n return !attribute && keyword === key;\n };\n};\n\nconst isWildcard = (value: unknown): value is '*' => value === '*';\n\nconst isPopulateString = (value: unknown): value is string => {\n return isString(value) && !isWildcard(value);\n};\n\nconst isStringArray = (value: unknown): value is string[] =>\n Array.isArray(value) && value.every(isString);\n\nconst isObj = (value: unknown): value is Record<string, unknown> => isObject(value);\n\nconst populate = traverseFactory()\n .intercept(isPopulateString, async (visitor, options, populate, { recurse }) => {\n /**\n * Ensure the populate clause its in the extended format ( { populate: { ... } }, and not just a string)\n * This gives a consistent structure to track the \"parent\" node of each nested populate clause\n */\n const populateObject = pathsToObjectPopulate([populate]);\n const traversedPopulate = (await recurse(visitor, options, populateObject)) as PopulateObject;\n const paths = objectPopulateToPaths(traversedPopulate);\n\n // Dot notation cannot represent polymorphic `on` fragments. Keep the object form\n // when a visitor adds one, rather than trying to serialize it as nested `populate`.\n return paths ? paths[0] : traversedPopulate;\n })\n // Array of strings ['foo', 'bar.baz'] => traverse as one object, then serialize when possible\n .intercept(isStringArray, async (visitor, options, populate, { recurse }) => {\n const populateObject = pathsToObjectPopulate(populate);\n const traversedPopulate = (await recurse(visitor, options, populateObject)) as PopulateObject;\n const paths = objectPopulateToPaths(traversedPopulate);\n\n // A string array cannot hold polymorphic `on` fragments. Return the sanitized object\n // as a whole when one is present, so consumers receive a valid populate representation.\n return paths ?? traversedPopulate;\n })\n .intercept(isQsArrayLimitPopulateObject, async (_visitor, _options, populate) => {\n throwQsArrayLimitPopulateError(Object.keys(populate).length);\n })\n // for wildcard, generate custom utilities to modify the values\n .parse(isWildcard, () => ({\n /**\n * Since value is '*', we don't need to transform it\n */\n transform: identity,\n\n /**\n * '*' isn't a key/value structure, so regardless\n * of the given key, it returns the data ('*')\n */\n get: (_key, data) => data,\n\n /**\n * '*' isn't a key/value structure, so regardless\n * of the given `key`, use `value` as the new `data`\n */\n set: (_key, value) => value,\n\n /**\n * '*' isn't a key/value structure, but we need to simulate at least one to enable\n * the data traversal. We're using '' since it represents a falsy string value\n */\n keys: constant(['']),\n\n /**\n * Removing '*' means setting it to undefined, regardless of the given key\n */\n remove: constant(undefined),\n }))\n\n // Parse string values\n .parse(isString, () => {\n const tokenize = (value: string) => value.split('.');\n const recompose = (parts: string[]) => parts.join('.');\n\n return {\n transform: (value) => value.trim(),\n\n remove(key, data) {\n const [root] = tokenize(data);\n\n return root === key ? undefined : data;\n },\n\n set(key, value, data) {\n const [root] = tokenize(data);\n\n if (root !== key) {\n return data;\n }\n\n return value == null || isEmpty(value) ? root : `${root}.${value}`;\n },\n\n keys(data) {\n const v = tokenize(data)[0];\n return v ? [v] : [];\n },\n\n get(key, data) {\n const [root, ...rest] = tokenize(data);\n\n return key === root ? recompose(rest) : undefined;\n },\n };\n })\n // Parse object values\n .parse(isObj, () => ({\n transform: cloneDeep,\n\n remove(key, data) {\n // eslint-disable-next-line no-unused-vars\n const { [key]: ignored, ...rest } = data;\n\n return rest;\n },\n\n set(key, value, data) {\n return { ...data, [key]: value };\n },\n\n keys(data) {\n return Object.keys(data);\n },\n\n get(key, data) {\n return data[key];\n },\n }))\n .ignore(({ key, attribute, parent }) => {\n // We don't want to recurse using traversePopulate for query keywords.\n // Instead, the visitors handle them with the appropriate traversal (sort, filters, etc.).\n //\n // When a keyword name (e.g. 'filters') also exists as an attribute in the schema,\n // we still treat it as a keyword if we're inside a nested populate context\n // (parent is an attribute). This prevents the traverse from recursing into\n // component/relation attributes named 'filters' with query filter data,\n // which would cause \"Invalid key\" validation errors (issue #21338).\n //\n // The attribute can still be populated explicitly via `populate: { filters: true }`.\n return ['sort', 'filters', 'fields'].includes(key) && (!attribute || !!parent?.attribute);\n })\n .on(\n // Handle recursion on populate.\"populate\"\n isKeyword('populate'),\n async ({ key, visitor, path, value, schema, getModel, attribute }, { set, recurse }) => {\n const parent: Parent = { key, path, schema, attribute };\n\n const newValue = await recurse(visitor, { schema, path, getModel, parent }, value);\n\n set(key, newValue);\n }\n )\n .on(\n isKeyword('on'),\n async ({ key, visitor, path, value, getModel, parent }, { set, recurse }) => {\n const newOn: Record<string, unknown> = {};\n\n if (!isObj(value)) {\n return;\n }\n\n for (const [uid, subPopulate] of Object.entries(value)) {\n const model = getModel(uid);\n const newPath = { ...path, raw: `${path.raw}[${uid}]` };\n\n newOn[uid] = await recurse(\n visitor,\n { schema: model, path: newPath, getModel, parent },\n subPopulate\n );\n }\n\n set(key, newOn);\n }\n )\n // Handle populate on relation\n .onRelation(\n async ({ key, value, attribute, visitor, path, schema, getModel }, { set, recurse }) => {\n if (value == null) {\n return;\n }\n\n const parent: Parent = { key, path, schema, attribute };\n\n if (isMorphToRelationalAttribute(attribute)) {\n // Don't traverse values that cannot be parsed\n if (!isObject(value) || !('on' in value && isObject(value?.on))) {\n return;\n }\n\n // If there is a populate fragment defined, traverse it\n const newValue = await recurse(\n visitor,\n { schema, path, getModel, parent },\n { on: value?.on }\n );\n\n set(key, { ...value, ...(newValue as Record<string, unknown>) });\n\n return;\n }\n\n const targetSchemaUID = attribute.target;\n const targetSchema = getModel(targetSchemaUID!);\n\n const newValue = await recurse(\n visitor,\n { schema: targetSchema, path, getModel, parent },\n value\n );\n\n set(key, newValue);\n }\n )\n // Handle populate on media\n .onMedia(async ({ key, path, schema, attribute, visitor, value, getModel }, { recurse, set }) => {\n if (value == null) {\n return;\n }\n\n const parent: Parent = { key, path, schema, attribute };\n\n const targetSchemaUID = 'plugin::upload.file';\n const targetSchema = getModel(targetSchemaUID);\n\n const newValue = await recurse(\n visitor,\n { schema: targetSchema, path, getModel, parent },\n value\n );\n\n set(key, newValue);\n })\n // Handle populate on components\n .onComponent(\n async ({ key, value, schema, visitor, path, attribute, getModel }, { recurse, set }) => {\n if (value == null) {\n return;\n }\n\n const parent: Parent = { key, path, schema, attribute };\n\n const targetSchema = getModel(attribute.component);\n\n const newValue = await recurse(\n visitor,\n { schema: targetSchema, path, getModel, parent },\n value\n );\n\n set(key, newValue);\n }\n )\n // Handle populate on dynamic zones\n .onDynamicZone(\n async ({ key, value, schema, visitor, path, attribute, getModel }, { set, recurse }) => {\n if (value == null || !isObject(value)) {\n return;\n }\n\n const parent: Parent = { key, path, schema, attribute };\n\n // Handle fragment syntax\n if ('on' in value && value.on) {\n const newOn = await recurse(visitor, { schema, path, getModel, parent }, { on: value.on });\n\n set(key, newOn);\n }\n }\n );\n\nexport default curry(populate.traverse);\n\ntype PopulateObject = {\n [key: string]: true | { populate: PopulateObject };\n};\n\nconst objectPopulateToPaths = (input: PopulateObject): string[] | undefined => {\n const paths: string[] = [];\n\n function traverse(currentObj: PopulateObject, parentPath: string): boolean {\n for (const [key, value] of Object.entries(currentObj)) {\n const currentPath = parentPath ? `${parentPath}.${key}` : key;\n if (value === true) {\n paths.push(currentPath);\n } else {\n const nestedPopulate = (value as { populate?: PopulateObject }).populate;\n\n if (!nestedPopulate || !traverse(nestedPopulate, currentPath)) {\n return false;\n }\n }\n }\n\n return true;\n }\n\n if (!traverse(input, '')) {\n return undefined;\n }\n\n return paths;\n};\n\nconst pathsToObjectPopulate = (input: string[]): PopulateObject => {\n const result: PopulateObject = {};\n\n function traverse(object: PopulateObject, keys: string[]): void {\n const [first, ...rest] = keys;\n if (rest.length === 0) {\n object[first] = true;\n } else {\n if (!object[first] || typeof object[first] === 'boolean') {\n object[first] = { populate: {} };\n }\n traverse((object[first] as { populate: PopulateObject }).populate, rest);\n }\n }\n\n input.forEach((clause) => traverse(result, clause.split('.')));\n\n return result;\n};\n"],"names":["DEFAULT_QS_ARRAY_LIMIT","isQsArrayLimitPopulateObject","value","isObject","Array","isArray","keys","Object","length","hasConsecutiveNumericKeys","every","key","index","String","values","entry","throwQsArrayLimitPopulateError","entryCount","ValidationError","isKeyword","keyword","attribute","isWildcard","isPopulateString","isString","isStringArray","isObj","populate","traverseFactory","intercept","visitor","options","recurse","populateObject","pathsToObjectPopulate","traversedPopulate","paths","objectPopulateToPaths","_visitor","_options","parse","transform","identity","get","_key","data","set","constant","remove","undefined","tokenize","split","recompose","parts","join","trim","root","isEmpty","v","rest","cloneDeep","ignored","ignore","parent","includes","on","path","schema","getModel","newValue","newOn","uid","subPopulate","entries","model","newPath","raw","onRelation","isMorphToRelationalAttribute","targetSchemaUID","target","targetSchema","onMedia","onComponent","component","onDynamicZone","curry","traverse","input","currentObj","parentPath","currentPath","push","nestedPopulate","result","object","first","forEach","clause"],"mappings":";;;;;;;;AAQA,MAAMA,sBAAAA,GAAyB,GAAA;AAE/B;;;IAIA,MAAMC,+BAA+B,CAACC,KAAAA,GAAAA;AACpC,IAAA,IAAI,CAACC,UAAAA,CAASD,KAAAA,CAAAA,IAAUE,KAAAA,CAAMC,OAAO,CAACH,KAAAA,CAAAA,EAAQ;QAC5C,OAAO,KAAA;AACT,IAAA;IAEA,MAAMI,IAAAA,GAAOC,MAAAA,CAAOD,IAAI,CAACJ,KAAAA,CAAAA;AAEzB,IAAA,IAAII,KAAKE,MAAM,KAAK,KAAKF,IAAAA,CAAKE,MAAM,IAAIR,sBAAAA,EAAwB;QAC9D,OAAO,KAAA;AACT,IAAA;IAEA,MAAMS,yBAAAA,GAA4BH,KAAKI,KAAK,CAAC,CAACC,GAAAA,EAAKC,KAAAA,GAAUD,QAAQE,MAAAA,CAAOD,KAAAA,CAAAA,CAAAA;AAE5E,IAAA,IAAI,CAACH,yBAAAA,EAA2B;QAC9B,OAAO,KAAA;AACT,IAAA;IAEA,OAAOF,MAAAA,CAAOO,MAAM,CAACZ,KAAAA,CAAAA,CAAOQ,KAAK,CAAC,CAACK,KAAAA,GAAU,OAAOA,KAAAA,KAAU,QAAA,CAAA;AAChE,CAAA;AAEA,MAAMC,iCAAiC,CAACC,UAAAA,GAAAA;IACtC,MAAM,IAAIC,sBAAAA,CACR,CAAC,2BAA2B,EAAED,UAAAA,CAAW,uEAAuE,EAAEjB,sBAAAA,CAAuB,EAAE,CAAC,GAC1I,6GAAA,CAAA;AAEN,CAAA;AAEA,MAAMmB,YAAY,CAACC,OAAAA,GAAAA;AACjB,IAAA,OAAO,CAAC,EAAET,GAAG,EAAEU,SAAS,EAAyC,GAAA;QAC/D,OAAO,CAACA,aAAaD,OAAAA,KAAYT,GAAAA;AACnC,IAAA,CAAA;AACF,CAAA;AAEA,MAAMW,UAAAA,GAAa,CAACpB,KAAAA,GAAiCA,KAAAA,KAAU,GAAA;AAE/D,MAAMqB,mBAAmB,CAACrB,KAAAA,GAAAA;IACxB,OAAOsB,UAAAA,CAAStB,KAAAA,CAAAA,IAAU,CAACoB,UAAAA,CAAWpB,KAAAA,CAAAA;AACxC,CAAA;AAEA,MAAMuB,aAAAA,GAAgB,CAACvB,KAAAA,GACrBE,KAAAA,CAAMC,OAAO,CAACH,KAAAA,CAAAA,IAAUA,KAAAA,CAAMQ,KAAK,CAACc,UAAAA,CAAAA;AAEtC,MAAME,KAAAA,GAAQ,CAACxB,KAAAA,GAAqDC,UAAAA,CAASD,KAAAA,CAAAA;AAE7E,MAAMyB,QAAAA,GAAWC,OAAAA,EAAAA,CACdC,SAAS,CAACN,gBAAAA,EAAkB,OAAOO,OAAAA,EAASC,OAAAA,EAASJ,QAAAA,EAAU,EAAEK,OAAO,EAAE,GAAA;AACzE;;;QAIA,MAAMC,iBAAiBC,qBAAAA,CAAsB;AAACP,QAAAA;AAAS,KAAA,CAAA;AACvD,IAAA,MAAMQ,iBAAAA,GAAqB,MAAMH,OAAAA,CAAQF,OAAAA,EAASC,OAAAA,EAASE,cAAAA,CAAAA;AAC3D,IAAA,MAAMG,QAAQC,qBAAAA,CAAsBF,iBAAAA,CAAAA;;;AAIpC,IAAA,OAAOC,KAAAA,GAAQA,KAAK,CAAC,CAAA,CAAE,GAAGD,iBAAAA;AAC5B,CAAA,CACA;CACCN,SAAS,CAACJ,eAAe,OAAOK,OAAAA,EAASC,SAASJ,QAAAA,EAAU,EAAEK,OAAO,EAAE,GAAA;AACtE,IAAA,MAAMC,iBAAiBC,qBAAAA,CAAsBP,QAAAA,CAAAA;AAC7C,IAAA,MAAMQ,iBAAAA,GAAqB,MAAMH,OAAAA,CAAQF,OAAAA,EAASC,OAAAA,EAASE,cAAAA,CAAAA;AAC3D,IAAA,MAAMG,QAAQC,qBAAAA,CAAsBF,iBAAAA,CAAAA;;;AAIpC,IAAA,OAAOC,KAAAA,IAASD,iBAAAA;AAClB,CAAA,CAAA,CACCN,SAAS,CAAC5B,4BAAAA,EAA8B,OAAOqC,UAAUC,QAAAA,EAAUZ,QAAAA,GAAAA;AAClEX,IAAAA,8BAAAA,CAA+BT,MAAAA,CAAOD,IAAI,CAACqB,QAAAA,CAAAA,CAAUnB,MAAM,CAAA;AAC7D,CAAA,CACA;CACCgC,KAAK,CAAClB,UAAAA,EAAY,KAAO;AACxB;;AAEC,QACDmB,SAAAA,EAAWC,UAAAA;AAEX;;;QAIAC,GAAAA,EAAK,CAACC,IAAAA,EAAMC,IAAAA,GAASA,IAAAA;AAErB;;;QAIAC,GAAAA,EAAK,CAACF,IAAAA,EAAM1C,KAAAA,GAAUA,KAAAA;AAEtB;;;AAGC,QACDI,MAAMyC,UAAAA,CAAS;AAAC,YAAA;AAAG,SAAA,CAAA;AAEnB;;AAEC,QACDC,QAAQD,UAAAA,CAASE,SAAAA;AACnB,KAAA,EAEA;AACCT,CAAAA,KAAK,CAAChB,UAAAA,EAAU,IAAA;AACf,IAAA,MAAM0B,QAAAA,GAAW,CAAChD,KAAAA,GAAkBA,KAAAA,CAAMiD,KAAK,CAAC,GAAA,CAAA;AAChD,IAAA,MAAMC,SAAAA,GAAY,CAACC,KAAAA,GAAoBA,KAAAA,CAAMC,IAAI,CAAC,GAAA,CAAA;IAElD,OAAO;QACLb,SAAAA,EAAW,CAACvC,KAAAA,GAAUA,KAAAA,CAAMqD,IAAI,EAAA;QAEhCP,MAAAA,CAAAA,CAAOrC,GAAG,EAAEkC,IAAI,EAAA;YACd,MAAM,CAACW,IAAAA,CAAK,GAAGN,QAAAA,CAASL,IAAAA,CAAAA;YAExB,OAAOW,IAAAA,KAAS7C,MAAMsC,SAAAA,GAAYJ,IAAAA;AACpC,QAAA,CAAA;AAEAC,QAAAA,GAAAA,CAAAA,CAAInC,GAAG,EAAET,KAAK,EAAE2C,IAAI,EAAA;YAClB,MAAM,CAACW,IAAAA,CAAK,GAAGN,QAAAA,CAASL,IAAAA,CAAAA;AAExB,YAAA,IAAIW,SAAS7C,GAAAA,EAAK;gBAChB,OAAOkC,IAAAA;AACT,YAAA;YAEA,OAAO3C,KAAAA,IAAS,QAAQuD,SAAAA,CAAQvD,KAAAA,CAAAA,GAASsD,OAAO,CAAA,EAAGA,IAAAA,CAAK,CAAC,EAAEtD,KAAAA,CAAAA,CAAO;AACpE,QAAA,CAAA;AAEAI,QAAAA,IAAAA,CAAAA,CAAKuC,IAAI,EAAA;AACP,YAAA,MAAMa,CAAAA,GAAIR,QAAAA,CAASL,IAAAA,CAAK,CAAC,CAAA,CAAE;AAC3B,YAAA,OAAOa,CAAAA,GAAI;AAACA,gBAAAA;AAAE,aAAA,GAAG,EAAE;AACrB,QAAA,CAAA;QAEAf,GAAAA,CAAAA,CAAIhC,GAAG,EAAEkC,IAAI,EAAA;AACX,YAAA,MAAM,CAACW,IAAAA,EAAM,GAAGG,IAAAA,CAAK,GAAGT,QAAAA,CAASL,IAAAA,CAAAA;YAEjC,OAAOlC,GAAAA,KAAQ6C,IAAAA,GAAOJ,SAAAA,CAAUO,IAAAA,CAAAA,GAAQV,SAAAA;AAC1C,QAAA;AACF,KAAA;AACF,CAAA,CACA;CACCT,KAAK,CAACd,KAAAA,EAAO,KAAO;QACnBe,SAAAA,EAAWmB,WAAAA;QAEXZ,MAAAA,CAAAA,CAAOrC,GAAG,EAAEkC,IAAI,EAAA;;YAEd,MAAM,EAAE,CAAClC,GAAAA,GAAMkD,OAAO,EAAE,GAAGF,MAAM,GAAGd,IAAAA;YAEpC,OAAOc,IAAAA;AACT,QAAA,CAAA;AAEAb,QAAAA,GAAAA,CAAAA,CAAInC,GAAG,EAAET,KAAK,EAAE2C,IAAI,EAAA;YAClB,OAAO;AAAE,gBAAA,GAAGA,IAAI;AAAE,gBAAA,CAAClC,MAAMT;AAAM,aAAA;AACjC,QAAA,CAAA;AAEAI,QAAAA,IAAAA,CAAAA,CAAKuC,IAAI,EAAA;YACP,OAAOtC,MAAAA,CAAOD,IAAI,CAACuC,IAAAA,CAAAA;AACrB,QAAA,CAAA;QAEAF,GAAAA,CAAAA,CAAIhC,GAAG,EAAEkC,IAAI,EAAA;YACX,OAAOA,IAAI,CAAClC,GAAAA,CAAI;AAClB,QAAA;KACF,CAAA,CAAA,CACCmD,MAAM,CAAC,CAAC,EAAEnD,GAAG,EAAEU,SAAS,EAAE0C,MAAM,EAAE,GAAA;;;;;;;;;;;IAWjC,OAAO;AAAC,QAAA,MAAA;AAAQ,QAAA,SAAA;AAAW,QAAA;KAAS,CAACC,QAAQ,CAACrD,GAAAA,CAAAA,KAAS,CAACU,SAAAA,IAAa,CAAC,CAAC0C,MAAAA,EAAQ1C,SAAQ,CAAA;AACzF,CAAA,CAAA,CACC4C,EAAE;AAED9C,SAAAA,CAAU,UAAA,CAAA,EACV,OAAO,EAAER,GAAG,EAAEmB,OAAO,EAAEoC,IAAI,EAAEhE,KAAK,EAAEiE,MAAM,EAAEC,QAAQ,EAAE/C,SAAS,EAAE,EAAE,EAAEyB,GAAG,EAAEd,OAAO,EAAE,GAAA;AACjF,IAAA,MAAM+B,MAAAA,GAAiB;AAAEpD,QAAAA,GAAAA;AAAKuD,QAAAA,IAAAA;AAAMC,QAAAA,MAAAA;AAAQ9C,QAAAA;AAAU,KAAA;IAEtD,MAAMgD,QAAAA,GAAW,MAAMrC,OAAAA,CAAQF,OAAAA,EAAS;AAAEqC,QAAAA,MAAAA;AAAQD,QAAAA,IAAAA;AAAME,QAAAA,QAAAA;AAAUL,QAAAA;KAAO,EAAG7D,KAAAA,CAAAA;AAE5E4C,IAAAA,GAAAA,CAAInC,GAAAA,EAAK0D,QAAAA,CAAAA;AACX,CAAA,CAAA,CAEDJ,EAAE,CACD9C,SAAAA,CAAU,IAAA,CAAA,EACV,OAAO,EAAER,GAAG,EAAEmB,OAAO,EAAEoC,IAAI,EAAEhE,KAAK,EAAEkE,QAAQ,EAAEL,MAAM,EAAE,EAAE,EAAEjB,GAAG,EAAEd,OAAO,EAAE,GAAA;AACtE,IAAA,MAAMsC,QAAiC,EAAC;IAExC,IAAI,CAAC5C,MAAMxB,KAAAA,CAAAA,EAAQ;AACjB,QAAA;AACF,IAAA;IAEA,KAAK,MAAM,CAACqE,GAAAA,EAAKC,WAAAA,CAAY,IAAIjE,MAAAA,CAAOkE,OAAO,CAACvE,KAAAA,CAAAA,CAAQ;AACtD,QAAA,MAAMwE,QAAQN,QAAAA,CAASG,GAAAA,CAAAA;AACvB,QAAA,MAAMI,OAAAA,GAAU;AAAE,YAAA,GAAGT,IAAI;YAAEU,GAAAA,EAAK,CAAA,EAAGV,KAAKU,GAAG,CAAC,CAAC,EAAEL,GAAAA,CAAI,CAAC;AAAE,SAAA;AAEtDD,QAAAA,KAAK,CAACC,GAAAA,CAAI,GAAG,MAAMvC,QACjBF,OAAAA,EACA;YAAEqC,MAAAA,EAAQO,KAAAA;YAAOR,IAAAA,EAAMS,OAAAA;AAASP,YAAAA,QAAAA;AAAUL,YAAAA;SAAO,EACjDS,WAAAA,CAAAA;AAEJ,IAAA;AAEA1B,IAAAA,GAAAA,CAAInC,GAAAA,EAAK2D,KAAAA,CAAAA;AACX,CAAA,CAEF;CACCO,UAAU,CACT,OAAO,EAAElE,GAAG,EAAET,KAAK,EAAEmB,SAAS,EAAES,OAAO,EAAEoC,IAAI,EAAEC,MAAM,EAAEC,QAAQ,EAAE,EAAE,EAAEtB,GAAG,EAAEd,OAAO,EAAE,GAAA;AACjF,IAAA,IAAI9B,SAAS,IAAA,EAAM;AACjB,QAAA;AACF,IAAA;AAEA,IAAA,MAAM6D,MAAAA,GAAiB;AAAEpD,QAAAA,GAAAA;AAAKuD,QAAAA,IAAAA;AAAMC,QAAAA,MAAAA;AAAQ9C,QAAAA;AAAU,KAAA;AAEtD,IAAA,IAAIyD,0CAA6BzD,SAAAA,CAAAA,EAAY;;QAE3C,IAAI,CAAClB,UAAAA,CAASD,KAAAA,CAAAA,IAAU,EAAE,QAAQA,KAAAA,IAASC,UAAAA,CAASD,KAAAA,EAAO+D,EAAAA,CAAE,CAAA,EAAI;AAC/D,YAAA;AACF,QAAA;;QAGA,MAAMI,QAAAA,GAAW,MAAMrC,OAAAA,CACrBF,OAAAA,EACA;AAAEqC,YAAAA,MAAAA;AAAQD,YAAAA,IAAAA;AAAME,YAAAA,QAAAA;AAAUL,YAAAA;SAAO,EACjC;AAAEE,YAAAA,EAAAA,EAAI/D,KAAAA,EAAO+D;AAAG,SAAA,CAAA;AAGlBnB,QAAAA,GAAAA,CAAInC,GAAAA,EAAK;AAAE,YAAA,GAAGT,KAAK;AAAE,YAAA,GAAImE;AAAqC,SAAA,CAAA;AAE9D,QAAA;AACF,IAAA;IAEA,MAAMU,eAAAA,GAAkB1D,UAAU2D,MAAM;AACxC,IAAA,MAAMC,eAAeb,QAAAA,CAASW,eAAAA,CAAAA;IAE9B,MAAMV,QAAAA,GAAW,MAAMrC,OAAAA,CACrBF,OAAAA,EACA;QAAEqC,MAAAA,EAAQc,YAAAA;AAAcf,QAAAA,IAAAA;AAAME,QAAAA,QAAAA;AAAUL,QAAAA;KAAO,EAC/C7D,KAAAA,CAAAA;AAGF4C,IAAAA,GAAAA,CAAInC,GAAAA,EAAK0D,QAAAA,CAAAA;AACX,CAAA,CAEF;CACCa,OAAO,CAAC,OAAO,EAAEvE,GAAG,EAAEuD,IAAI,EAAEC,MAAM,EAAE9C,SAAS,EAAES,OAAO,EAAE5B,KAAK,EAAEkE,QAAQ,EAAE,EAAE,EAAEpC,OAAO,EAAEc,GAAG,EAAE,GAAA;AAC1F,IAAA,IAAI5C,SAAS,IAAA,EAAM;AACjB,QAAA;AACF,IAAA;AAEA,IAAA,MAAM6D,MAAAA,GAAiB;AAAEpD,QAAAA,GAAAA;AAAKuD,QAAAA,IAAAA;AAAMC,QAAAA,MAAAA;AAAQ9C,QAAAA;AAAU,KAAA;AAEtD,IAAA,MAAM0D,eAAAA,GAAkB,qBAAA;AACxB,IAAA,MAAME,eAAeb,QAAAA,CAASW,eAAAA,CAAAA;IAE9B,MAAMV,QAAAA,GAAW,MAAMrC,OAAAA,CACrBF,OAAAA,EACA;QAAEqC,MAAAA,EAAQc,YAAAA;AAAcf,QAAAA,IAAAA;AAAME,QAAAA,QAAAA;AAAUL,QAAAA;KAAO,EAC/C7D,KAAAA,CAAAA;AAGF4C,IAAAA,GAAAA,CAAInC,GAAAA,EAAK0D,QAAAA,CAAAA;AACX,CAAA,CACA;CACCc,WAAW,CACV,OAAO,EAAExE,GAAG,EAAET,KAAK,EAAEiE,MAAM,EAAErC,OAAO,EAAEoC,IAAI,EAAE7C,SAAS,EAAE+C,QAAQ,EAAE,EAAE,EAAEpC,OAAO,EAAEc,GAAG,EAAE,GAAA;AACjF,IAAA,IAAI5C,SAAS,IAAA,EAAM;AACjB,QAAA;AACF,IAAA;AAEA,IAAA,MAAM6D,MAAAA,GAAiB;AAAEpD,QAAAA,GAAAA;AAAKuD,QAAAA,IAAAA;AAAMC,QAAAA,MAAAA;AAAQ9C,QAAAA;AAAU,KAAA;IAEtD,MAAM4D,YAAAA,GAAeb,QAAAA,CAAS/C,SAAAA,CAAU+D,SAAS,CAAA;IAEjD,MAAMf,QAAAA,GAAW,MAAMrC,OAAAA,CACrBF,OAAAA,EACA;QAAEqC,MAAAA,EAAQc,YAAAA;AAAcf,QAAAA,IAAAA;AAAME,QAAAA,QAAAA;AAAUL,QAAAA;KAAO,EAC/C7D,KAAAA,CAAAA;AAGF4C,IAAAA,GAAAA,CAAInC,GAAAA,EAAK0D,QAAAA,CAAAA;AACX,CAAA,CAEF;CACCgB,aAAa,CACZ,OAAO,EAAE1E,GAAG,EAAET,KAAK,EAAEiE,MAAM,EAAErC,OAAO,EAAEoC,IAAI,EAAE7C,SAAS,EAAE+C,QAAQ,EAAE,EAAE,EAAEtB,GAAG,EAAEd,OAAO,EAAE,GAAA;AACjF,IAAA,IAAI9B,KAAAA,IAAS,IAAA,IAAQ,CAACC,UAAAA,CAASD,KAAAA,CAAAA,EAAQ;AACrC,QAAA;AACF,IAAA;AAEA,IAAA,MAAM6D,MAAAA,GAAiB;AAAEpD,QAAAA,GAAAA;AAAKuD,QAAAA,IAAAA;AAAMC,QAAAA,MAAAA;AAAQ9C,QAAAA;AAAU,KAAA;;AAGtD,IAAA,IAAI,IAAA,IAAQnB,KAAAA,IAASA,KAAAA,CAAM+D,EAAE,EAAE;QAC7B,MAAMK,KAAAA,GAAQ,MAAMtC,OAAAA,CAAQF,OAAAA,EAAS;AAAEqC,YAAAA,MAAAA;AAAQD,YAAAA,IAAAA;AAAME,YAAAA,QAAAA;AAAUL,YAAAA;SAAO,EAAG;AAAEE,YAAAA,EAAAA,EAAI/D,MAAM+D;AAAG,SAAA,CAAA;AAExFnB,QAAAA,GAAAA,CAAInC,GAAAA,EAAK2D,KAAAA,CAAAA;AACX,IAAA;AACF,CAAA,CAAA;AAGJ,4BAAegB,WAAAA,CAAM3D,QAAAA,CAAS4D,QAAQ,CAAA;AAMtC,MAAMlD,wBAAwB,CAACmD,KAAAA,GAAAA;AAC7B,IAAA,MAAMpD,QAAkB,EAAE;IAE1B,SAASmD,QAAAA,CAASE,UAA0B,EAAEC,UAAkB,EAAA;QAC9D,KAAK,MAAM,CAAC/E,GAAAA,EAAKT,KAAAA,CAAM,IAAIK,MAAAA,CAAOkE,OAAO,CAACgB,UAAAA,CAAAA,CAAa;AACrD,YAAA,MAAME,cAAcD,UAAAA,GAAa,CAAA,EAAGA,WAAW,CAAC,EAAE/E,KAAK,GAAGA,GAAAA;AAC1D,YAAA,IAAIT,UAAU,IAAA,EAAM;AAClBkC,gBAAAA,KAAAA,CAAMwD,IAAI,CAACD,WAAAA,CAAAA;YACb,CAAA,MAAO;gBACL,MAAME,cAAAA,GAAiB,KAAC3F,CAAwCyB,QAAQ;AAExE,gBAAA,IAAI,CAACkE,cAAAA,IAAkB,CAACN,QAAAA,CAASM,gBAAgBF,WAAAA,CAAAA,EAAc;oBAC7D,OAAO,KAAA;AACT,gBAAA;AACF,YAAA;AACF,QAAA;QAEA,OAAO,IAAA;AACT,IAAA;IAEA,IAAI,CAACJ,QAAAA,CAASC,KAAAA,EAAO,EAAA,CAAA,EAAK;QACxB,OAAOvC,SAAAA;AACT,IAAA;IAEA,OAAOb,KAAAA;AACT,CAAA;AAEA,MAAMF,wBAAwB,CAACsD,KAAAA,GAAAA;AAC7B,IAAA,MAAMM,SAAyB,EAAC;IAEhC,SAASP,QAAAA,CAASQ,MAAsB,EAAEzF,IAAc,EAAA;AACtD,QAAA,MAAM,CAAC0F,KAAAA,EAAO,GAAGrC,IAAAA,CAAK,GAAGrD,IAAAA;QACzB,IAAIqD,IAAAA,CAAKnD,MAAM,KAAK,CAAA,EAAG;YACrBuF,MAAM,CAACC,MAAM,GAAG,IAAA;QAClB,CAAA,MAAO;YACL,IAAI,CAACD,MAAM,CAACC,KAAAA,CAAM,IAAI,OAAOD,MAAM,CAACC,KAAAA,CAAM,KAAK,SAAA,EAAW;gBACxDD,MAAM,CAACC,MAAM,GAAG;AAAErE,oBAAAA,QAAAA,EAAU;AAAG,iBAAA;AACjC,YAAA;AACA4D,YAAAA,QAAAA,CAAS,MAAO,CAACS,KAAAA,CAAM,CAAkCrE,QAAQ,EAAEgC,IAAAA,CAAAA;AACrE,QAAA;AACF,IAAA;IAEA6B,KAAAA,CAAMS,OAAO,CAAC,CAACC,MAAAA,GAAWX,SAASO,MAAAA,EAAQI,MAAAA,CAAO/C,KAAK,CAAC,GAAA,CAAA,CAAA,CAAA;IAExD,OAAO2C,MAAAA;AACT,CAAA;;;;"}
|
|
1
|
+
{"version":3,"file":"query-populate.js","sources":["../../src/traverse/query-populate.ts"],"sourcesContent":["import { isString, isEmpty, isObject, constant, identity, cloneDeep } from 'lodash';\n\nimport { curry } from '../curry';\nimport traverseFactory, { type Parent } from './factory';\nimport { Attribute } from '../types';\nimport { isMorphToRelationalAttribute } from '../content-types';\nimport { ValidationError } from '../errors';\n\nconst DEFAULT_QS_ARRAY_LIMIT = 100;\n\n/**\n * Detects objects with consecutive numeric string keys and string values — the shape `qs`\n * produces when indexed array notation exceeds `arrayLimit` (see #25632).\n */\nconst isQsArrayLimitPopulateObject = (value: unknown): value is Record<string, string> => {\n if (!isObject(value) || Array.isArray(value)) {\n return false;\n }\n\n const keys = Object.keys(value);\n\n if (keys.length === 0 || keys.length <= DEFAULT_QS_ARRAY_LIMIT) {\n return false;\n }\n\n const hasConsecutiveNumericKeys = keys.every((key, index) => key === String(index));\n\n if (!hasConsecutiveNumericKeys) {\n return false;\n }\n\n return Object.values(value).every((entry) => typeof entry === 'string');\n};\n\nconst throwQsArrayLimitPopulateError = (entryCount: number) => {\n throw new ValidationError(\n `Too many populate entries (${entryCount}). The maximum number of populate entries when using array notation is ${DEFAULT_QS_ARRAY_LIMIT}. ` +\n 'Consider using object notation (populate[field]=true), nested population, or reducing the number of fields.'\n );\n};\n\nconst isKeyword = (keyword: string) => {\n return ({ key, attribute }: { key: string; attribute: Attribute }) => {\n return !attribute && keyword === key;\n };\n};\n\ntype KeyContext = { key: string; attribute?: Attribute; parent?: Parent };\n\n/**\n * Below a relation, media, component or `on` fragment (`parent.attribute` is set), the keys of a\n * populate value are query keywords, even when the schema also has an attribute of the same\n * name. Elsewhere, a key that names an attribute is that attribute.\n */\nconst isKeywordPosition = ({ attribute, parent }: Omit<KeyContext, 'key'>) =>\n !attribute || !!parent?.attribute;\n\n/**\n * A nested `populate`. Unlike `isKeyword`, this also matches in a keyword position when the\n * schema has an attribute named `populate`: the value is still walked as a nested populate of\n * the schema, not as that attribute, so every visitor checks it against the right schema.\n */\nconst isPopulateKeyword = (ctx: KeyContext) => ctx.key === 'populate' && isKeywordPosition(ctx);\n\nconst isWildcard = (value: unknown): value is '*' => value === '*';\n\nconst isPopulateString = (value: unknown): value is string => {\n return isString(value) && !isWildcard(value);\n};\n\nconst isStringArray = (value: unknown): value is string[] =>\n Array.isArray(value) && value.every(isString);\n\nconst isObj = (value: unknown): value is Record<string, unknown> => isObject(value);\n\nconst populate = traverseFactory()\n .intercept(isPopulateString, async (visitor, options, populate, { recurse }) => {\n /**\n * Ensure the populate clause its in the extended format ( { populate: { ... } }, and not just a string)\n * This gives a consistent structure to track the \"parent\" node of each nested populate clause\n */\n const populateObject = pathsToObjectPopulate([populate]);\n const traversedPopulate = (await recurse(visitor, options, populateObject)) as PopulateObject;\n const paths = objectPopulateToPaths(traversedPopulate);\n\n // Dot notation cannot represent polymorphic `on` fragments. Keep the object form\n // when a visitor adds one, rather than trying to serialize it as nested `populate`.\n return paths ? paths[0] : traversedPopulate;\n })\n // Array of strings ['foo', 'bar.baz'] => traverse as one object, then serialize when possible\n .intercept(isStringArray, async (visitor, options, populate, { recurse }) => {\n const populateObject = pathsToObjectPopulate(populate);\n const traversedPopulate = (await recurse(visitor, options, populateObject)) as PopulateObject;\n const paths = objectPopulateToPaths(traversedPopulate);\n\n // A string array cannot hold polymorphic `on` fragments. Return the sanitized object\n // as a whole when one is present, so consumers receive a valid populate representation.\n return paths ?? traversedPopulate;\n })\n .intercept(isQsArrayLimitPopulateObject, async (_visitor, _options, populate) => {\n throwQsArrayLimitPopulateError(Object.keys(populate).length);\n })\n // for wildcard, generate custom utilities to modify the values\n .parse(isWildcard, () => ({\n /**\n * Since value is '*', we don't need to transform it\n */\n transform: identity,\n\n /**\n * '*' isn't a key/value structure, so regardless\n * of the given key, it returns the data ('*')\n */\n get: (_key, data) => data,\n\n /**\n * '*' isn't a key/value structure, so regardless\n * of the given `key`, use `value` as the new `data`\n */\n set: (_key, value) => value,\n\n /**\n * '*' isn't a key/value structure, but we need to simulate at least one to enable\n * the data traversal. We're using '' since it represents a falsy string value\n */\n keys: constant(['']),\n\n /**\n * Removing '*' means setting it to undefined, regardless of the given key\n */\n remove: constant(undefined),\n }))\n\n // Parse string values\n .parse(isString, () => {\n const tokenize = (value: string) => value.split('.');\n const recompose = (parts: string[]) => parts.join('.');\n\n return {\n transform: (value) => value.trim(),\n\n remove(key, data) {\n const [root] = tokenize(data);\n\n return root === key ? undefined : data;\n },\n\n set(key, value, data) {\n const [root] = tokenize(data);\n\n if (root !== key) {\n return data;\n }\n\n return value == null || isEmpty(value) ? root : `${root}.${value}`;\n },\n\n keys(data) {\n const v = tokenize(data)[0];\n return v ? [v] : [];\n },\n\n get(key, data) {\n const [root, ...rest] = tokenize(data);\n\n return key === root ? recompose(rest) : undefined;\n },\n };\n })\n // Parse object values\n .parse(isObj, () => ({\n // Copied once, where the traversal is handed the caller's populate, rather than at every\n // nested level: a deep copy at every level cost the size of the populate times its depth.\n clone: cloneDeep,\n transform: identity,\n\n remove(key, data) {\n // eslint-disable-next-line no-unused-vars\n const { [key]: ignored, ...rest } = data;\n\n return rest;\n },\n\n set(key, value, data) {\n return { ...data, [key]: value };\n },\n\n keys(data) {\n return Object.keys(data);\n },\n\n get(key, data) {\n return data[key];\n },\n }))\n .ignore(({ key, attribute, parent }) => {\n // We don't want to recurse using traversePopulate for query keywords.\n // Instead, the visitors handle them with the appropriate traversal (sort, filters, etc.).\n //\n // When a keyword name (e.g. 'filters') also exists as an attribute in the schema,\n // we still treat it as a keyword if we're inside a nested populate context\n // (parent is an attribute). This prevents the traverse from recursing into\n // component/relation attributes named 'filters' with query filter data,\n // which would cause \"Invalid key\" validation errors (issue #21338).\n //\n // The attribute can still be populated explicitly via `populate: { filters: true }`.\n return ['sort', 'filters', 'fields'].includes(key) && isKeywordPosition({ attribute, parent });\n })\n .on(\n // Handle recursion on populate.\"populate\"\n isPopulateKeyword,\n async ({ key, visitor, path, value, schema, getModel }, { set, recurse }) => {\n // No `attribute`: the keys of the nested populate are attributes of `schema` again, even\n // when `schema` has an attribute named `populate`.\n const parent: Parent = { key, path, schema };\n\n const newValue = await recurse(visitor, { schema, path, getModel, parent }, value);\n\n set(key, newValue);\n }\n )\n .on(\n isKeyword('on'),\n async ({ key, visitor, path, value, getModel, parent }, { set, recurse }) => {\n const newOn: Record<string, unknown> = {};\n\n if (!isObj(value)) {\n return;\n }\n\n for (const [uid, subPopulate] of Object.entries(value)) {\n const model = getModel(uid);\n const newPath = { ...path, raw: `${path.raw}[${uid}]` };\n\n newOn[uid] = await recurse(\n visitor,\n { schema: model, path: newPath, getModel, parent },\n subPopulate\n );\n }\n\n set(key, newOn);\n }\n )\n // Handle populate on relation\n .onRelation(\n async (\n { key, value, attribute, visitor, path, schema, getModel, parent: keyParent },\n { set, recurse }\n ) => {\n // A `populate` attribute in a keyword position is walked by `isPopulateKeyword` instead.\n if (value == null || isPopulateKeyword({ key, attribute, parent: keyParent })) {\n return;\n }\n\n const parent: Parent = { key, path, schema, attribute };\n\n if (isMorphToRelationalAttribute(attribute)) {\n // Don't traverse values that cannot be parsed\n if (!isObject(value) || !('on' in value && isObject(value?.on))) {\n return;\n }\n\n // If there is a populate fragment defined, traverse it\n const newValue = await recurse(\n visitor,\n { schema, path, getModel, parent },\n { on: value?.on }\n );\n\n set(key, { ...value, ...(newValue as Record<string, unknown>) });\n\n return;\n }\n\n const targetSchemaUID = attribute.target;\n const targetSchema = getModel(targetSchemaUID!);\n\n const newValue = await recurse(\n visitor,\n { schema: targetSchema, path, getModel, parent },\n value\n );\n\n set(key, newValue);\n }\n )\n // Handle populate on media\n .onMedia(\n async (\n { key, path, schema, attribute, visitor, value, getModel, parent: keyParent },\n { recurse, set }\n ) => {\n if (value == null || isPopulateKeyword({ key, attribute, parent: keyParent })) {\n return;\n }\n\n const parent: Parent = { key, path, schema, attribute };\n\n const targetSchemaUID = 'plugin::upload.file';\n const targetSchema = getModel(targetSchemaUID);\n\n const newValue = await recurse(\n visitor,\n { schema: targetSchema, path, getModel, parent },\n value\n );\n\n set(key, newValue);\n }\n )\n // Handle populate on components\n .onComponent(\n async (\n { key, value, schema, visitor, path, attribute, getModel, parent: keyParent },\n { recurse, set }\n ) => {\n if (value == null || isPopulateKeyword({ key, attribute, parent: keyParent })) {\n return;\n }\n\n const parent: Parent = { key, path, schema, attribute };\n\n const targetSchema = getModel(attribute.component);\n\n const newValue = await recurse(\n visitor,\n { schema: targetSchema, path, getModel, parent },\n value\n );\n\n set(key, newValue);\n }\n )\n // Handle populate on dynamic zones\n .onDynamicZone(\n async (\n { key, value, schema, visitor, path, attribute, getModel, parent: keyParent },\n { set, recurse }\n ) => {\n if (\n value == null ||\n !isObject(value) ||\n isPopulateKeyword({ key, attribute, parent: keyParent })\n ) {\n return;\n }\n\n const parent: Parent = { key, path, schema, attribute };\n\n // Handle fragment syntax\n if ('on' in value && value.on) {\n const newOn = await recurse(visitor, { schema, path, getModel, parent }, { on: value.on });\n\n set(key, newOn);\n }\n }\n );\n\nexport default curry(populate.traverse);\n\ntype PopulateObject = {\n [key: string]: true | { populate: PopulateObject };\n};\n\nconst objectPopulateToPaths = (input: PopulateObject): string[] | undefined => {\n const paths: string[] = [];\n\n function traverse(currentObj: PopulateObject, parentPath: string): boolean {\n for (const [key, value] of Object.entries(currentObj)) {\n const currentPath = parentPath ? `${parentPath}.${key}` : key;\n if (value === true) {\n paths.push(currentPath);\n } else {\n const nestedPopulate = (value as { populate?: PopulateObject }).populate;\n\n if (!nestedPopulate || !traverse(nestedPopulate, currentPath)) {\n return false;\n }\n }\n }\n\n return true;\n }\n\n if (!traverse(input, '')) {\n return undefined;\n }\n\n return paths;\n};\n\nconst pathsToObjectPopulate = (input: string[]): PopulateObject => {\n const result: PopulateObject = {};\n\n function traverse(object: PopulateObject, keys: string[]): void {\n const [first, ...rest] = keys;\n if (rest.length === 0) {\n object[first] = true;\n } else {\n if (!object[first] || typeof object[first] === 'boolean') {\n object[first] = { populate: {} };\n }\n traverse((object[first] as { populate: PopulateObject }).populate, rest);\n }\n }\n\n input.forEach((clause) => traverse(result, clause.split('.')));\n\n return result;\n};\n"],"names":["DEFAULT_QS_ARRAY_LIMIT","isQsArrayLimitPopulateObject","value","isObject","Array","isArray","keys","Object","length","hasConsecutiveNumericKeys","every","key","index","String","values","entry","throwQsArrayLimitPopulateError","entryCount","ValidationError","isKeyword","keyword","attribute","isKeywordPosition","parent","isPopulateKeyword","ctx","isWildcard","isPopulateString","isString","isStringArray","isObj","populate","traverseFactory","intercept","visitor","options","recurse","populateObject","pathsToObjectPopulate","traversedPopulate","paths","objectPopulateToPaths","_visitor","_options","parse","transform","identity","get","_key","data","set","constant","remove","undefined","tokenize","split","recompose","parts","join","trim","root","isEmpty","v","rest","clone","cloneDeep","ignored","ignore","includes","on","path","schema","getModel","newValue","newOn","uid","subPopulate","entries","model","newPath","raw","onRelation","keyParent","isMorphToRelationalAttribute","targetSchemaUID","target","targetSchema","onMedia","onComponent","component","onDynamicZone","curry","traverse","input","currentObj","parentPath","currentPath","push","nestedPopulate","result","object","first","forEach","clause"],"mappings":";;;;;;;;AAQA,MAAMA,sBAAAA,GAAyB,GAAA;AAE/B;;;IAIA,MAAMC,+BAA+B,CAACC,KAAAA,GAAAA;AACpC,IAAA,IAAI,CAACC,UAAAA,CAASD,KAAAA,CAAAA,IAAUE,KAAAA,CAAMC,OAAO,CAACH,KAAAA,CAAAA,EAAQ;QAC5C,OAAO,KAAA;AACT,IAAA;IAEA,MAAMI,IAAAA,GAAOC,MAAAA,CAAOD,IAAI,CAACJ,KAAAA,CAAAA;AAEzB,IAAA,IAAII,KAAKE,MAAM,KAAK,KAAKF,IAAAA,CAAKE,MAAM,IAAIR,sBAAAA,EAAwB;QAC9D,OAAO,KAAA;AACT,IAAA;IAEA,MAAMS,yBAAAA,GAA4BH,KAAKI,KAAK,CAAC,CAACC,GAAAA,EAAKC,KAAAA,GAAUD,QAAQE,MAAAA,CAAOD,KAAAA,CAAAA,CAAAA;AAE5E,IAAA,IAAI,CAACH,yBAAAA,EAA2B;QAC9B,OAAO,KAAA;AACT,IAAA;IAEA,OAAOF,MAAAA,CAAOO,MAAM,CAACZ,KAAAA,CAAAA,CAAOQ,KAAK,CAAC,CAACK,KAAAA,GAAU,OAAOA,KAAAA,KAAU,QAAA,CAAA;AAChE,CAAA;AAEA,MAAMC,iCAAiC,CAACC,UAAAA,GAAAA;IACtC,MAAM,IAAIC,sBAAAA,CACR,CAAC,2BAA2B,EAAED,UAAAA,CAAW,uEAAuE,EAAEjB,sBAAAA,CAAuB,EAAE,CAAC,GAC1I,6GAAA,CAAA;AAEN,CAAA;AAEA,MAAMmB,YAAY,CAACC,OAAAA,GAAAA;AACjB,IAAA,OAAO,CAAC,EAAET,GAAG,EAAEU,SAAS,EAAyC,GAAA;QAC/D,OAAO,CAACA,aAAaD,OAAAA,KAAYT,GAAAA;AACnC,IAAA,CAAA;AACF,CAAA;AAIA;;;;AAIC,IACD,MAAMW,iBAAAA,GAAoB,CAAC,EAAED,SAAS,EAAEE,MAAM,EAA2B,GACvE,CAACF,SAAAA,IAAa,CAAC,CAACE,MAAAA,EAAQF,SAAAA;AAE1B;;;;IAKA,MAAMG,oBAAoB,CAACC,GAAAA,GAAoBA,IAAId,GAAG,KAAK,cAAcW,iBAAAA,CAAkBG,GAAAA,CAAAA;AAE3F,MAAMC,UAAAA,GAAa,CAACxB,KAAAA,GAAiCA,KAAAA,KAAU,GAAA;AAE/D,MAAMyB,mBAAmB,CAACzB,KAAAA,GAAAA;IACxB,OAAO0B,UAAAA,CAAS1B,KAAAA,CAAAA,IAAU,CAACwB,UAAAA,CAAWxB,KAAAA,CAAAA;AACxC,CAAA;AAEA,MAAM2B,aAAAA,GAAgB,CAAC3B,KAAAA,GACrBE,KAAAA,CAAMC,OAAO,CAACH,KAAAA,CAAAA,IAAUA,KAAAA,CAAMQ,KAAK,CAACkB,UAAAA,CAAAA;AAEtC,MAAME,KAAAA,GAAQ,CAAC5B,KAAAA,GAAqDC,UAAAA,CAASD,KAAAA,CAAAA;AAE7E,MAAM6B,QAAAA,GAAWC,OAAAA,EAAAA,CACdC,SAAS,CAACN,gBAAAA,EAAkB,OAAOO,OAAAA,EAASC,OAAAA,EAASJ,QAAAA,EAAU,EAAEK,OAAO,EAAE,GAAA;AACzE;;;QAIA,MAAMC,iBAAiBC,qBAAAA,CAAsB;AAACP,QAAAA;AAAS,KAAA,CAAA;AACvD,IAAA,MAAMQ,iBAAAA,GAAqB,MAAMH,OAAAA,CAAQF,OAAAA,EAASC,OAAAA,EAASE,cAAAA,CAAAA;AAC3D,IAAA,MAAMG,QAAQC,qBAAAA,CAAsBF,iBAAAA,CAAAA;;;AAIpC,IAAA,OAAOC,KAAAA,GAAQA,KAAK,CAAC,CAAA,CAAE,GAAGD,iBAAAA;AAC5B,CAAA,CACA;CACCN,SAAS,CAACJ,eAAe,OAAOK,OAAAA,EAASC,SAASJ,QAAAA,EAAU,EAAEK,OAAO,EAAE,GAAA;AACtE,IAAA,MAAMC,iBAAiBC,qBAAAA,CAAsBP,QAAAA,CAAAA;AAC7C,IAAA,MAAMQ,iBAAAA,GAAqB,MAAMH,OAAAA,CAAQF,OAAAA,EAASC,OAAAA,EAASE,cAAAA,CAAAA;AAC3D,IAAA,MAAMG,QAAQC,qBAAAA,CAAsBF,iBAAAA,CAAAA;;;AAIpC,IAAA,OAAOC,KAAAA,IAASD,iBAAAA;AAClB,CAAA,CAAA,CACCN,SAAS,CAAChC,4BAAAA,EAA8B,OAAOyC,UAAUC,QAAAA,EAAUZ,QAAAA,GAAAA;AAClEf,IAAAA,8BAAAA,CAA+BT,MAAAA,CAAOD,IAAI,CAACyB,QAAAA,CAAAA,CAAUvB,MAAM,CAAA;AAC7D,CAAA,CACA;CACCoC,KAAK,CAAClB,UAAAA,EAAY,KAAO;AACxB;;AAEC,QACDmB,SAAAA,EAAWC,UAAAA;AAEX;;;QAIAC,GAAAA,EAAK,CAACC,IAAAA,EAAMC,IAAAA,GAASA,IAAAA;AAErB;;;QAIAC,GAAAA,EAAK,CAACF,IAAAA,EAAM9C,KAAAA,GAAUA,KAAAA;AAEtB;;;AAGC,QACDI,MAAM6C,UAAAA,CAAS;AAAC,YAAA;AAAG,SAAA,CAAA;AAEnB;;AAEC,QACDC,QAAQD,UAAAA,CAASE,SAAAA;AACnB,KAAA,EAEA;AACCT,CAAAA,KAAK,CAAChB,UAAAA,EAAU,IAAA;AACf,IAAA,MAAM0B,QAAAA,GAAW,CAACpD,KAAAA,GAAkBA,KAAAA,CAAMqD,KAAK,CAAC,GAAA,CAAA;AAChD,IAAA,MAAMC,SAAAA,GAAY,CAACC,KAAAA,GAAoBA,KAAAA,CAAMC,IAAI,CAAC,GAAA,CAAA;IAElD,OAAO;QACLb,SAAAA,EAAW,CAAC3C,KAAAA,GAAUA,KAAAA,CAAMyD,IAAI,EAAA;QAEhCP,MAAAA,CAAAA,CAAOzC,GAAG,EAAEsC,IAAI,EAAA;YACd,MAAM,CAACW,IAAAA,CAAK,GAAGN,QAAAA,CAASL,IAAAA,CAAAA;YAExB,OAAOW,IAAAA,KAASjD,MAAM0C,SAAAA,GAAYJ,IAAAA;AACpC,QAAA,CAAA;AAEAC,QAAAA,GAAAA,CAAAA,CAAIvC,GAAG,EAAET,KAAK,EAAE+C,IAAI,EAAA;YAClB,MAAM,CAACW,IAAAA,CAAK,GAAGN,QAAAA,CAASL,IAAAA,CAAAA;AAExB,YAAA,IAAIW,SAASjD,GAAAA,EAAK;gBAChB,OAAOsC,IAAAA;AACT,YAAA;YAEA,OAAO/C,KAAAA,IAAS,QAAQ2D,SAAAA,CAAQ3D,KAAAA,CAAAA,GAAS0D,OAAO,CAAA,EAAGA,IAAAA,CAAK,CAAC,EAAE1D,KAAAA,CAAAA,CAAO;AACpE,QAAA,CAAA;AAEAI,QAAAA,IAAAA,CAAAA,CAAK2C,IAAI,EAAA;AACP,YAAA,MAAMa,CAAAA,GAAIR,QAAAA,CAASL,IAAAA,CAAK,CAAC,CAAA,CAAE;AAC3B,YAAA,OAAOa,CAAAA,GAAI;AAACA,gBAAAA;AAAE,aAAA,GAAG,EAAE;AACrB,QAAA,CAAA;QAEAf,GAAAA,CAAAA,CAAIpC,GAAG,EAAEsC,IAAI,EAAA;AACX,YAAA,MAAM,CAACW,IAAAA,EAAM,GAAGG,IAAAA,CAAK,GAAGT,QAAAA,CAASL,IAAAA,CAAAA;YAEjC,OAAOtC,GAAAA,KAAQiD,IAAAA,GAAOJ,SAAAA,CAAUO,IAAAA,CAAAA,GAAQV,SAAAA;AAC1C,QAAA;AACF,KAAA;AACF,CAAA,CACA;CACCT,KAAK,CAACd,KAAAA,EAAO,KAAO;;;QAGnBkC,KAAAA,EAAOC,WAAAA;QACPpB,SAAAA,EAAWC,UAAAA;QAEXM,MAAAA,CAAAA,CAAOzC,GAAG,EAAEsC,IAAI,EAAA;;YAEd,MAAM,EAAE,CAACtC,GAAAA,GAAMuD,OAAO,EAAE,GAAGH,MAAM,GAAGd,IAAAA;YAEpC,OAAOc,IAAAA;AACT,QAAA,CAAA;AAEAb,QAAAA,GAAAA,CAAAA,CAAIvC,GAAG,EAAET,KAAK,EAAE+C,IAAI,EAAA;YAClB,OAAO;AAAE,gBAAA,GAAGA,IAAI;AAAE,gBAAA,CAACtC,MAAMT;AAAM,aAAA;AACjC,QAAA,CAAA;AAEAI,QAAAA,IAAAA,CAAAA,CAAK2C,IAAI,EAAA;YACP,OAAO1C,MAAAA,CAAOD,IAAI,CAAC2C,IAAAA,CAAAA;AACrB,QAAA,CAAA;QAEAF,GAAAA,CAAAA,CAAIpC,GAAG,EAAEsC,IAAI,EAAA;YACX,OAAOA,IAAI,CAACtC,GAAAA,CAAI;AAClB,QAAA;KACF,CAAA,CAAA,CACCwD,MAAM,CAAC,CAAC,EAAExD,GAAG,EAAEU,SAAS,EAAEE,MAAM,EAAE,GAAA;;;;;;;;;;;IAWjC,OAAO;AAAC,QAAA,MAAA;AAAQ,QAAA,SAAA;AAAW,QAAA;KAAS,CAAC6C,QAAQ,CAACzD,GAAAA,CAAAA,IAAQW,iBAAAA,CAAkB;AAAED,QAAAA,SAAAA;AAAWE,QAAAA;AAAO,KAAA,CAAA;AAC9F,CAAA,CAAA,CACC8C,EAAE;AAED7C,iBAAAA,EACA,OAAO,EAAEb,GAAG,EAAEuB,OAAO,EAAEoC,IAAI,EAAEpE,KAAK,EAAEqE,MAAM,EAAEC,QAAQ,EAAE,EAAE,EAAEtB,GAAG,EAAEd,OAAO,EAAE,GAAA;;;AAGtE,IAAA,MAAMb,MAAAA,GAAiB;AAAEZ,QAAAA,GAAAA;AAAK2D,QAAAA,IAAAA;AAAMC,QAAAA;AAAO,KAAA;IAE3C,MAAME,QAAAA,GAAW,MAAMrC,OAAAA,CAAQF,OAAAA,EAAS;AAAEqC,QAAAA,MAAAA;AAAQD,QAAAA,IAAAA;AAAME,QAAAA,QAAAA;AAAUjD,QAAAA;KAAO,EAAGrB,KAAAA,CAAAA;AAE5EgD,IAAAA,GAAAA,CAAIvC,GAAAA,EAAK8D,QAAAA,CAAAA;AACX,CAAA,CAAA,CAEDJ,EAAE,CACDlD,SAAAA,CAAU,IAAA,CAAA,EACV,OAAO,EAAER,GAAG,EAAEuB,OAAO,EAAEoC,IAAI,EAAEpE,KAAK,EAAEsE,QAAQ,EAAEjD,MAAM,EAAE,EAAE,EAAE2B,GAAG,EAAEd,OAAO,EAAE,GAAA;AACtE,IAAA,MAAMsC,QAAiC,EAAC;IAExC,IAAI,CAAC5C,MAAM5B,KAAAA,CAAAA,EAAQ;AACjB,QAAA;AACF,IAAA;IAEA,KAAK,MAAM,CAACyE,GAAAA,EAAKC,WAAAA,CAAY,IAAIrE,MAAAA,CAAOsE,OAAO,CAAC3E,KAAAA,CAAAA,CAAQ;AACtD,QAAA,MAAM4E,QAAQN,QAAAA,CAASG,GAAAA,CAAAA;AACvB,QAAA,MAAMI,OAAAA,GAAU;AAAE,YAAA,GAAGT,IAAI;YAAEU,GAAAA,EAAK,CAAA,EAAGV,KAAKU,GAAG,CAAC,CAAC,EAAEL,GAAAA,CAAI,CAAC;AAAE,SAAA;AAEtDD,QAAAA,KAAK,CAACC,GAAAA,CAAI,GAAG,MAAMvC,QACjBF,OAAAA,EACA;YAAEqC,MAAAA,EAAQO,KAAAA;YAAOR,IAAAA,EAAMS,OAAAA;AAASP,YAAAA,QAAAA;AAAUjD,YAAAA;SAAO,EACjDqD,WAAAA,CAAAA;AAEJ,IAAA;AAEA1B,IAAAA,GAAAA,CAAIvC,GAAAA,EAAK+D,KAAAA,CAAAA;AACX,CAAA,CAEF;CACCO,UAAU,CACT,OACE,EAAEtE,GAAG,EAAET,KAAK,EAAEmB,SAAS,EAAEa,OAAO,EAAEoC,IAAI,EAAEC,MAAM,EAAEC,QAAQ,EAAEjD,MAAAA,EAAQ2D,SAAS,EAAE,EAC7E,EAAEhC,GAAG,EAAEd,OAAO,EAAE,GAAA;;IAGhB,IAAIlC,KAAAA,IAAS,QAAQsB,iBAAAA,CAAkB;AAAEb,QAAAA,GAAAA;AAAKU,QAAAA,SAAAA;QAAWE,MAAAA,EAAQ2D;KAAU,CAAA,EAAI;AAC7E,QAAA;AACF,IAAA;AAEA,IAAA,MAAM3D,MAAAA,GAAiB;AAAEZ,QAAAA,GAAAA;AAAK2D,QAAAA,IAAAA;AAAMC,QAAAA,MAAAA;AAAQlD,QAAAA;AAAU,KAAA;AAEtD,IAAA,IAAI8D,0CAA6B9D,SAAAA,CAAAA,EAAY;;QAE3C,IAAI,CAAClB,UAAAA,CAASD,KAAAA,CAAAA,IAAU,EAAE,QAAQA,KAAAA,IAASC,UAAAA,CAASD,KAAAA,EAAOmE,EAAAA,CAAE,CAAA,EAAI;AAC/D,YAAA;AACF,QAAA;;QAGA,MAAMI,QAAAA,GAAW,MAAMrC,OAAAA,CACrBF,OAAAA,EACA;AAAEqC,YAAAA,MAAAA;AAAQD,YAAAA,IAAAA;AAAME,YAAAA,QAAAA;AAAUjD,YAAAA;SAAO,EACjC;AAAE8C,YAAAA,EAAAA,EAAInE,KAAAA,EAAOmE;AAAG,SAAA,CAAA;AAGlBnB,QAAAA,GAAAA,CAAIvC,GAAAA,EAAK;AAAE,YAAA,GAAGT,KAAK;AAAE,YAAA,GAAIuE;AAAqC,SAAA,CAAA;AAE9D,QAAA;AACF,IAAA;IAEA,MAAMW,eAAAA,GAAkB/D,UAAUgE,MAAM;AACxC,IAAA,MAAMC,eAAed,QAAAA,CAASY,eAAAA,CAAAA;IAE9B,MAAMX,QAAAA,GAAW,MAAMrC,OAAAA,CACrBF,OAAAA,EACA;QAAEqC,MAAAA,EAAQe,YAAAA;AAAchB,QAAAA,IAAAA;AAAME,QAAAA,QAAAA;AAAUjD,QAAAA;KAAO,EAC/CrB,KAAAA,CAAAA;AAGFgD,IAAAA,GAAAA,CAAIvC,GAAAA,EAAK8D,QAAAA,CAAAA;AACX,CAAA,CAEF;CACCc,OAAO,CACN,OACE,EAAE5E,GAAG,EAAE2D,IAAI,EAAEC,MAAM,EAAElD,SAAS,EAAEa,OAAO,EAAEhC,KAAK,EAAEsE,QAAQ,EAAEjD,MAAAA,EAAQ2D,SAAS,EAAE,EAC7E,EAAE9C,OAAO,EAAEc,GAAG,EAAE,GAAA;IAEhB,IAAIhD,KAAAA,IAAS,QAAQsB,iBAAAA,CAAkB;AAAEb,QAAAA,GAAAA;AAAKU,QAAAA,SAAAA;QAAWE,MAAAA,EAAQ2D;KAAU,CAAA,EAAI;AAC7E,QAAA;AACF,IAAA;AAEA,IAAA,MAAM3D,MAAAA,GAAiB;AAAEZ,QAAAA,GAAAA;AAAK2D,QAAAA,IAAAA;AAAMC,QAAAA,MAAAA;AAAQlD,QAAAA;AAAU,KAAA;AAEtD,IAAA,MAAM+D,eAAAA,GAAkB,qBAAA;AACxB,IAAA,MAAME,eAAed,QAAAA,CAASY,eAAAA,CAAAA;IAE9B,MAAMX,QAAAA,GAAW,MAAMrC,OAAAA,CACrBF,OAAAA,EACA;QAAEqC,MAAAA,EAAQe,YAAAA;AAAchB,QAAAA,IAAAA;AAAME,QAAAA,QAAAA;AAAUjD,QAAAA;KAAO,EAC/CrB,KAAAA,CAAAA;AAGFgD,IAAAA,GAAAA,CAAIvC,GAAAA,EAAK8D,QAAAA,CAAAA;AACX,CAAA,CAEF;CACCe,WAAW,CACV,OACE,EAAE7E,GAAG,EAAET,KAAK,EAAEqE,MAAM,EAAErC,OAAO,EAAEoC,IAAI,EAAEjD,SAAS,EAAEmD,QAAQ,EAAEjD,MAAAA,EAAQ2D,SAAS,EAAE,EAC7E,EAAE9C,OAAO,EAAEc,GAAG,EAAE,GAAA;IAEhB,IAAIhD,KAAAA,IAAS,QAAQsB,iBAAAA,CAAkB;AAAEb,QAAAA,GAAAA;AAAKU,QAAAA,SAAAA;QAAWE,MAAAA,EAAQ2D;KAAU,CAAA,EAAI;AAC7E,QAAA;AACF,IAAA;AAEA,IAAA,MAAM3D,MAAAA,GAAiB;AAAEZ,QAAAA,GAAAA;AAAK2D,QAAAA,IAAAA;AAAMC,QAAAA,MAAAA;AAAQlD,QAAAA;AAAU,KAAA;IAEtD,MAAMiE,YAAAA,GAAed,QAAAA,CAASnD,SAAAA,CAAUoE,SAAS,CAAA;IAEjD,MAAMhB,QAAAA,GAAW,MAAMrC,OAAAA,CACrBF,OAAAA,EACA;QAAEqC,MAAAA,EAAQe,YAAAA;AAAchB,QAAAA,IAAAA;AAAME,QAAAA,QAAAA;AAAUjD,QAAAA;KAAO,EAC/CrB,KAAAA,CAAAA;AAGFgD,IAAAA,GAAAA,CAAIvC,GAAAA,EAAK8D,QAAAA,CAAAA;AACX,CAAA,CAEF;CACCiB,aAAa,CACZ,OACE,EAAE/E,GAAG,EAAET,KAAK,EAAEqE,MAAM,EAAErC,OAAO,EAAEoC,IAAI,EAAEjD,SAAS,EAAEmD,QAAQ,EAAEjD,MAAAA,EAAQ2D,SAAS,EAAE,EAC7E,EAAEhC,GAAG,EAAEd,OAAO,EAAE,GAAA;AAEhB,IAAA,IACElC,KAAAA,IAAS,IAAA,IACT,CAACC,UAAAA,CAASD,UACVsB,iBAAAA,CAAkB;AAAEb,QAAAA,GAAAA;AAAKU,QAAAA,SAAAA;QAAWE,MAAAA,EAAQ2D;KAAU,CAAA,EACtD;AACA,QAAA;AACF,IAAA;AAEA,IAAA,MAAM3D,MAAAA,GAAiB;AAAEZ,QAAAA,GAAAA;AAAK2D,QAAAA,IAAAA;AAAMC,QAAAA,MAAAA;AAAQlD,QAAAA;AAAU,KAAA;;AAGtD,IAAA,IAAI,IAAA,IAAQnB,KAAAA,IAASA,KAAAA,CAAMmE,EAAE,EAAE;QAC7B,MAAMK,KAAAA,GAAQ,MAAMtC,OAAAA,CAAQF,OAAAA,EAAS;AAAEqC,YAAAA,MAAAA;AAAQD,YAAAA,IAAAA;AAAME,YAAAA,QAAAA;AAAUjD,YAAAA;SAAO,EAAG;AAAE8C,YAAAA,EAAAA,EAAInE,MAAMmE;AAAG,SAAA,CAAA;AAExFnB,QAAAA,GAAAA,CAAIvC,GAAAA,EAAK+D,KAAAA,CAAAA;AACX,IAAA;AACF,CAAA,CAAA;AAGJ,4BAAeiB,WAAAA,CAAM5D,QAAAA,CAAS6D,QAAQ,CAAA;AAMtC,MAAMnD,wBAAwB,CAACoD,KAAAA,GAAAA;AAC7B,IAAA,MAAMrD,QAAkB,EAAE;IAE1B,SAASoD,QAAAA,CAASE,UAA0B,EAAEC,UAAkB,EAAA;QAC9D,KAAK,MAAM,CAACpF,GAAAA,EAAKT,KAAAA,CAAM,IAAIK,MAAAA,CAAOsE,OAAO,CAACiB,UAAAA,CAAAA,CAAa;AACrD,YAAA,MAAME,cAAcD,UAAAA,GAAa,CAAA,EAAGA,WAAW,CAAC,EAAEpF,KAAK,GAAGA,GAAAA;AAC1D,YAAA,IAAIT,UAAU,IAAA,EAAM;AAClBsC,gBAAAA,KAAAA,CAAMyD,IAAI,CAACD,WAAAA,CAAAA;YACb,CAAA,MAAO;gBACL,MAAME,cAAAA,GAAiB,KAAChG,CAAwC6B,QAAQ;AAExE,gBAAA,IAAI,CAACmE,cAAAA,IAAkB,CAACN,QAAAA,CAASM,gBAAgBF,WAAAA,CAAAA,EAAc;oBAC7D,OAAO,KAAA;AACT,gBAAA;AACF,YAAA;AACF,QAAA;QAEA,OAAO,IAAA;AACT,IAAA;IAEA,IAAI,CAACJ,QAAAA,CAASC,KAAAA,EAAO,EAAA,CAAA,EAAK;QACxB,OAAOxC,SAAAA;AACT,IAAA;IAEA,OAAOb,KAAAA;AACT,CAAA;AAEA,MAAMF,wBAAwB,CAACuD,KAAAA,GAAAA;AAC7B,IAAA,MAAMM,SAAyB,EAAC;IAEhC,SAASP,QAAAA,CAASQ,MAAsB,EAAE9F,IAAc,EAAA;AACtD,QAAA,MAAM,CAAC+F,KAAAA,EAAO,GAAGtC,IAAAA,CAAK,GAAGzD,IAAAA;QACzB,IAAIyD,IAAAA,CAAKvD,MAAM,KAAK,CAAA,EAAG;YACrB4F,MAAM,CAACC,MAAM,GAAG,IAAA;QAClB,CAAA,MAAO;YACL,IAAI,CAACD,MAAM,CAACC,KAAAA,CAAM,IAAI,OAAOD,MAAM,CAACC,KAAAA,CAAM,KAAK,SAAA,EAAW;gBACxDD,MAAM,CAACC,MAAM,GAAG;AAAEtE,oBAAAA,QAAAA,EAAU;AAAG,iBAAA;AACjC,YAAA;AACA6D,YAAAA,QAAAA,CAAS,MAAO,CAACS,KAAAA,CAAM,CAAkCtE,QAAQ,EAAEgC,IAAAA,CAAAA;AACrE,QAAA;AACF,IAAA;IAEA8B,KAAAA,CAAMS,OAAO,CAAC,CAACC,MAAAA,GAAWX,SAASO,MAAAA,EAAQI,MAAAA,CAAOhD,KAAK,CAAC,GAAA,CAAA,CAAA,CAAA;IAExD,OAAO4C,MAAAA;AACT,CAAA;;;;"}
|