UNPKG

graphql

Version:

A Query Language and Runtime which can target any service.

1 lines • 5.79 kB
{"version":3,"file":"reducer.mjs","sourceRoot":"","sources":["../../src/language/reducer.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,OAAO,EAAE,+BAA8B;AAGhD,OAAO,EAAE,iBAAiB,EAAE,kBAAiB;AA8C7C,MAAM,UAAU,MAAM,CACpB,IAAa,EACb,OAAsB;IAEtB,MAAM,KAAK,GAAiB,EAAE,CAAC;IAC/B,IAAI,KAAK,GAAU;QACjB,MAAM,EAAE,CAAC,IAAI,CAAC;QACd,IAAI,EAAE,SAAS;QACf,OAAO,EAAE,EAAE;QACX,KAAK,EAAE,CAAC,CAAC;KACV,CAAC;IACF,IAAI,IAAa,CAAC;IAElB,GAAG,CAAC;QACF,IAAI,IAAsB,CAAC;QAC3B,KAAK,CAAC,KAAK,EAAE,CAAC;QACd,MAAM,MAAM,GACV,KAAK,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC;QACrE,IAAI,KAAK,CAAC,KAAK,KAAK,MAAM,EAAE,CAAC;YAC3B,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC;YACrB,IAAI,GAAG,KAAK,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC;YACjE,KAAK,GAAG,KAAK,CAAC,GAAG,EAAW,CAAC;QAC/B,CAAC;aAAM,CAAC;YACN,IAAI;gBACF,KAAK,CAAC,IAAI,KAAK,SAAS;oBACtB,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC;oBAC3B,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAkB,CAAC,CAAC;YAC7D,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACvC,SAAS;YACX,CAAC;YACD,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;gBACxB,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBACtB,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBAClB,KAAK,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC;oBAClE,SAAS;gBACX,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,MAAM,MAAM,GAAG,IAAe,CAAC;gBAC/B,IAAI,GAAG,MAAM,EAAE,IAAI,CAAC;gBACpB,MAAM,IAAI,GACR,OAAO,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;gBACjE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;oBACzB,MAAM,IAAI,KAAK,CAAC,qBAAqB,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBACzD,CAAC;gBACD,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBACtB,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBAClB,KAAK,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,EAAE,GAAG,MAAM,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC;oBAC5D,SAAS;gBACX,CAAC;YACH,CAAC;QACH,CAAC;QACD,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,MAAM,UAAU,GAAG,OAAO,CAAC,IAAI,CAAuC,CAAC;YACvE,IAAI,GAAG,UAAU,EAAE,CAAC,IAAI,CAAC,CAAC;QAC5B,CAAC;QACD,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;YAC7B,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC3B,CAAC;aAAM,CAAC;YACN,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC;QAChD,CAAC;IACH,CAAC,QAAQ,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE;IAE7B,OAAO,IAAqB,CAAC;AAC/B,CAAC","sourcesContent":["/** @category Visiting */\n\nimport { inspect } from '../jsutils/inspect.ts';\n\nimport type { ASTNode } from './ast.ts';\nimport { QueryDocumentKeys } from './ast.ts';\nimport type { Kind } from './kinds.ts';\n\n/** @internal */\nexport type ASTReducer<R> = {\n readonly [NodeT in ASTNode as NodeT['kind']]?: (node: {\n [K in keyof NodeT]: ReducedField<NodeT[K], R>;\n }) => R;\n};\n\ntype ReducedField<T, R> = T extends ASTNode\n ? R\n : T extends ReadonlyArray<ASTNode>\n ? ReadonlyArray<R>\n : T;\n\ntype Frame =\n | {\n parent: ReadonlyArray<unknown>;\n keys: undefined;\n results: Array<unknown>;\n index: number;\n }\n | {\n parent: ASTNode;\n keys: ReadonlyArray<string>;\n results: { [key: string]: unknown; kind: ASTNode['kind'] };\n index: number;\n };\n\n/** @internal */\nexport function reduce<R>(root: ASTNode, reducer: Required<ASTReducer<R>>): R;\n/**\n * Reduces children before their parents without changing the input AST.\n * Missing callbacks produce undefined; returned values are not revisited.\n * @param root - The AST node to reduce.\n * @param reducer - Callbacks receiving nodes with their children reduced.\n * @returns The reduced root value, or undefined if it has no callback.\n * @typeParam R - The result produced for each node.\n * @internal\n */\nexport function reduce<R>(\n root: ASTNode,\n reducer: ASTReducer<R | undefined>,\n): R | undefined;\n/** @internal */\nexport function reduce<R>(\n root: ASTNode,\n reducer: ASTReducer<R>,\n): R | undefined {\n const stack: Array<Frame> = [];\n let frame: Frame = {\n parent: [root],\n keys: undefined,\n results: [],\n index: -1,\n };\n let node: unknown;\n\n do {\n let kind: Kind | undefined;\n frame.index++;\n const length =\n frame.keys === undefined ? frame.parent.length : frame.keys.length;\n if (frame.index === length) {\n node = frame.results;\n kind = frame.keys === undefined ? undefined : frame.results.kind;\n frame = stack.pop() as Frame;\n } else {\n node =\n frame.keys === undefined\n ? frame.parent[frame.index]\n : frame.parent[frame.keys[frame.index] as keyof ASTNode];\n if (node == null && stack.length !== 0) {\n continue;\n }\n if (Array.isArray(node)) {\n if (node.length !== 0) {\n stack.push(frame);\n frame = { parent: node, keys: undefined, results: [], index: -1 };\n continue;\n }\n } else {\n const parent = node as ASTNode;\n kind = parent?.kind;\n const keys =\n typeof kind === 'string' ? QueryDocumentKeys[kind] : undefined;\n if (!Array.isArray(keys)) {\n throw new Error(`Invalid AST Node: ${inspect(node)}.`);\n }\n if (keys.length !== 0) {\n stack.push(frame);\n frame = { parent, keys, results: { ...parent }, index: -1 };\n continue;\n }\n }\n }\n if (kind !== undefined) {\n const reduceNode = reducer[kind] as ((node: unknown) => R) | undefined;\n node = reduceNode?.(node);\n }\n if (frame.keys === undefined) {\n frame.results.push(node);\n } else {\n frame.results[frame.keys[frame.index]] = node;\n }\n } while (stack.length !== 0);\n\n return node as R | undefined;\n}\n"]}