|
| 1 | +import { Path } from '@graphql-tools/utils'; |
| 2 | +import { DeferUsage } from './collectFields.js'; |
| 3 | +import { PendingExecutionGroup, StreamRecord, SuccessfulExecutionGroup } from './types.js'; |
| 4 | + |
| 5 | +export type DeliveryGroup = DeferredFragmentRecord | StreamRecord; |
| 6 | + |
| 7 | +/** @internal */ |
| 8 | +export class DeferredFragmentRecord { |
| 9 | + path: Path | undefined; |
| 10 | + label: string | undefined; |
| 11 | + id?: string | undefined; |
| 12 | + parentDeferUsage: DeferUsage | undefined; |
| 13 | + pendingExecutionGroups: Set<PendingExecutionGroup>; |
| 14 | + successfulExecutionGroups: Set<SuccessfulExecutionGroup>; |
| 15 | + children: Set<DeliveryGroup>; |
| 16 | + pending: boolean; |
| 17 | + fns: Array<() => void>; |
| 18 | + |
| 19 | + constructor( |
| 20 | + path: Path | undefined, |
| 21 | + label: string | undefined, |
| 22 | + parentDeferUsage: DeferUsage | undefined, |
| 23 | + ) { |
| 24 | + this.path = path; |
| 25 | + this.label = label; |
| 26 | + this.parentDeferUsage = parentDeferUsage; |
| 27 | + this.pendingExecutionGroups = new Set(); |
| 28 | + this.successfulExecutionGroups = new Set(); |
| 29 | + this.children = new Set(); |
| 30 | + this.pending = false; |
| 31 | + this.fns = []; |
| 32 | + } |
| 33 | + |
| 34 | + onPending(fn: () => void): void { |
| 35 | + this.fns.push(fn); |
| 36 | + } |
| 37 | + |
| 38 | + setAsPending(): void { |
| 39 | + this.pending = true; |
| 40 | + for (const fn of this.fns) { |
| 41 | + fn(); |
| 42 | + } |
| 43 | + } |
| 44 | +} |
| 45 | + |
| 46 | +export function isDeferredFragmentRecord( |
| 47 | + deliveryGroup: DeliveryGroup, |
| 48 | +): deliveryGroup is DeferredFragmentRecord { |
| 49 | + return deliveryGroup instanceof DeferredFragmentRecord; |
| 50 | +} |
| 51 | + |
| 52 | +/** |
| 53 | + * @internal |
| 54 | + */ |
| 55 | +export class DeferredFragmentFactory { |
| 56 | + private _rootDeferredFragments = new Map<DeferUsage, DeferredFragmentRecord>(); |
| 57 | + |
| 58 | + get(deferUsage: DeferUsage, path: Path | undefined): DeferredFragmentRecord { |
| 59 | + const deferUsagePath = this._pathAtDepth(path, deferUsage.depth); |
| 60 | + let deferredFragmentRecords: Map<DeferUsage, DeferredFragmentRecord> | undefined; |
| 61 | + if (deferUsagePath === undefined) { |
| 62 | + deferredFragmentRecords = this._rootDeferredFragments; |
| 63 | + } else { |
| 64 | + // A doubly nested Map<Path, Map<DeferUsage, DeferredFragmentRecord>> |
| 65 | + // could be used, but could leak memory in long running operations. |
| 66 | + // A WeakMap could be used instead. The below implementation is |
| 67 | + // WeakMap-Like, saving the Map on the Path object directly. |
| 68 | + // Alternatively, memory could be reclaimed manually, taking care to |
| 69 | + // also reclaim memory for nested DeferredFragmentRecords if the parent |
| 70 | + // is removed secondary to an error. |
| 71 | + deferredFragmentRecords = ( |
| 72 | + deferUsagePath as unknown as { |
| 73 | + deferredFragmentRecords: Map<DeferUsage, DeferredFragmentRecord>; |
| 74 | + } |
| 75 | + ).deferredFragmentRecords; |
| 76 | + if (deferredFragmentRecords === undefined) { |
| 77 | + deferredFragmentRecords = new Map(); |
| 78 | + ( |
| 79 | + deferUsagePath as unknown as { |
| 80 | + deferredFragmentRecords: Map<DeferUsage, DeferredFragmentRecord>; |
| 81 | + } |
| 82 | + ).deferredFragmentRecords = deferredFragmentRecords; |
| 83 | + } |
| 84 | + } |
| 85 | + let deferredFragmentRecord = deferredFragmentRecords.get(deferUsage); |
| 86 | + if (deferredFragmentRecord === undefined) { |
| 87 | + const { label, parentDeferUsage } = deferUsage; |
| 88 | + deferredFragmentRecord = new DeferredFragmentRecord(deferUsagePath, label, parentDeferUsage); |
| 89 | + deferredFragmentRecords.set(deferUsage, deferredFragmentRecord); |
| 90 | + } |
| 91 | + return deferredFragmentRecord; |
| 92 | + } |
| 93 | + |
| 94 | + private _pathAtDepth(path: Path | undefined, depth: number): Path | undefined { |
| 95 | + if (depth === 0) { |
| 96 | + return; |
| 97 | + } |
| 98 | + const stack: Array<Path> = []; |
| 99 | + let currentPath = path; |
| 100 | + while (currentPath !== undefined) { |
| 101 | + stack.unshift(currentPath); |
| 102 | + currentPath = currentPath.prev; |
| 103 | + } |
| 104 | + return stack[depth - 1]; |
| 105 | + } |
| 106 | +} |
0 commit comments