@depup/gatsby 5.16.1-depup.0

package/dist/schema/infer/build-example-data.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"build-example-data.js","names":["getExampleObject","fieldMap","typeName","typeConflictReporter","Object","keys","reduce","acc","key","value","buildExampleValue","path","descriptor","isArrayItem","type","conflicts","resolveWinnerType","addConflict","prepareConflictExamples","typeInfo","isMixOfDateAndString","hasOnlyEmptyStrings","example","item","exampleItemValue","nodes","multiple","linkedNodes","filter","dprops","hasKeys","result","forEach","prop","candidates","possibleTypes","length","isMixedNumber","typeNameMapper","includes","reportedValueMapper","relatedNode","find","relatedNodeList","object","itemValue","array","undefined","conflictingTypes","groups","first","map","nodeId","join","float","int","Boolean","total","date","string","empty"],"sources":["../../../src/schema/infer/build-example-data.ts"],"sourcesContent":["/* eslint-disable @typescript-eslint/no-use-before-define */\nimport { groupBy } from \"lodash\"\nimport {\n  IValueDescriptor,\n  ValueType,\n  ITypeMetadata,\n} from \"./inference-metadata\"\nimport {\n  TypeConflictReporter,\n  ITypeConflictExample,\n} from \"./type-conflict-reporter\"\n\n// See gatsby/src/schema/infer/inference-metadata.ts for the ValueDescriptor structs (-> typeInfo)\n\nconst getExampleObject = ({\n  fieldMap = {},\n  typeName,\n  typeConflictReporter,\n}: ITypeMetadata): { [k: string]: unknown } =>\n  Object.keys(fieldMap).reduce((acc, key) => {\n    const value = buildExampleValue({\n      path: `${typeName}.${key}`,\n      descriptor: fieldMap[key],\n      typeConflictReporter,\n    })\n    if (key && value !== null) {\n      acc[key] = value\n    }\n    return acc\n  }, {})\n\nconst buildExampleValue = ({\n  descriptor,\n  typeConflictReporter,\n  isArrayItem = false,\n  path = ``,\n}: {\n  descriptor: IValueDescriptor\n  typeConflictReporter?: TypeConflictReporter\n  path?: string\n  isArrayItem?: boolean\n}): unknown | null => {\n  const [type, conflicts = false] = resolveWinnerType(descriptor)\n\n  if (conflicts && typeConflictReporter) {\n    typeConflictReporter.addConflict(\n      path,\n      prepareConflictExamples(descriptor, isArrayItem)\n    )\n  }\n\n  const typeInfo = descriptor[type]\n\n  switch (type) {\n    case `null`:\n      return null\n\n    case `date`:\n    case `string`: {\n      if (isMixOfDateAndString(descriptor)) {\n        return hasOnlyEmptyStrings(descriptor) ? `1978-09-26` : `String`\n      }\n      return typeInfo.example\n    }\n\n    case `array`: {\n      const { item } = typeInfo\n      const exampleItemValue = item\n        ? buildExampleValue({\n            descriptor: item,\n            isArrayItem: true,\n            typeConflictReporter,\n            path,\n          })\n        : null\n      return exampleItemValue === null ? null : [exampleItemValue]\n    }\n\n    case `relatedNode`:\n    case `relatedNodeList`: {\n      const { nodes = {} } = typeInfo\n      return {\n        multiple: type === `relatedNodeList`,\n        linkedNodes: Object.keys(nodes).filter(key => nodes[key] > 0),\n      }\n    }\n\n    case `object`: {\n      const { dprops } = typeInfo\n      let hasKeys = false\n      const result = {}\n      Object.keys(dprops).forEach(prop => {\n        const value = buildExampleValue({\n          descriptor: dprops[prop],\n          typeConflictReporter,\n          path: `${path}.${prop}`,\n        })\n        if (value !== null) {\n          hasKeys = true\n          result[prop] = value\n        }\n      })\n      return hasKeys ? result : null\n    }\n\n    default:\n      return typeInfo.example\n  }\n}\n\nconst resolveWinnerType = (\n  descriptor: IValueDescriptor\n): [ValueType | \"null\", boolean?] => {\n  const candidates = possibleTypes(descriptor)\n  if (candidates.length === 1) {\n    return [candidates[0]]\n  }\n  if (candidates.length === 2 && isMixedNumber(descriptor)) {\n    return [`float`]\n  }\n  if (candidates.length === 2 && isMixOfDateAndString(descriptor)) {\n    return [hasOnlyEmptyStrings(descriptor) ? `date` : `string`]\n  }\n  if (candidates.length > 1) {\n    return [`null`, true]\n  }\n  return [`null`]\n}\n\nconst prepareConflictExamples = (\n  descriptor: IValueDescriptor,\n  isArrayItem: boolean\n): Array<ITypeConflictExample> => {\n  const typeNameMapper = (typeName: ValueType): string => {\n    if (typeName === `relatedNode`) {\n      return `string`\n    }\n    if (typeName === `relatedNodeList`) {\n      return `[string]`\n    }\n    return [`float`, `int`].includes(typeName) ? `number` : typeName\n  }\n  const reportedValueMapper = (typeName: ValueType): unknown => {\n    if (typeName === `relatedNode`) {\n      const { nodes } = descriptor.relatedNode ?? { nodes: {} }\n      return Object.keys(nodes).find(key => nodes[key] > 0)\n    }\n    if (typeName === `relatedNodeList`) {\n      const { nodes } = descriptor.relatedNodeList ?? { nodes: {} }\n      return Object.keys(nodes).filter(key => nodes[key] > 0)\n    }\n    if (typeName === `object`) {\n      return getExampleObject({\n        typeName,\n        fieldMap: descriptor!.object!.dprops,\n      })\n    }\n    if (typeName === `array`) {\n      const itemValue = buildExampleValue({\n        descriptor: descriptor!.array!.item,\n        isArrayItem: true,\n      })\n      return itemValue === null || itemValue === undefined ? [] : [itemValue]\n    }\n    return descriptor[typeName]?.example\n  }\n  const conflictingTypes = possibleTypes(descriptor)\n\n  if (isArrayItem) {\n    // Differentiate conflict examples by node they were first seen in.\n    // See Caveats section in the header of the ./inference-metadata.ts\n    const groups = groupBy(\n      conflictingTypes,\n      type => descriptor[type]?.first || ``\n    )\n    return Object.keys(groups).map(nodeId => {\n      return {\n        type: `[${groups[nodeId].map(typeNameMapper).join(`,`)}]`,\n        value: groups[nodeId].map(reportedValueMapper),\n      }\n    })\n  }\n\n  return conflictingTypes.map(type => {\n    return {\n      type: typeNameMapper(type),\n      value: reportedValueMapper(type),\n    }\n  })\n}\n\nconst isMixedNumber = (descriptor: IValueDescriptor): boolean => {\n  const { float, int } = descriptor\n  return Boolean(float?.total) && Boolean(int?.total)\n}\n\nconst isMixOfDateAndString = (descriptor: IValueDescriptor): boolean => {\n  const { date, string } = descriptor\n  return Boolean(date?.total) && Boolean(string?.total)\n}\n\nconst hasOnlyEmptyStrings = (descriptor: IValueDescriptor): boolean => {\n  const { string } = descriptor\n  return string !== undefined && string?.empty === string?.total\n}\n\nconst possibleTypes = (descriptor: IValueDescriptor = {}): Array<ValueType> =>\n  Object.keys(descriptor).filter(\n    type => descriptor[type].total > 0\n  ) as Array<ValueType>\n\nexport { getExampleObject }\n"],"mappings":";;;;;;AAYA;;AAEA,MAAMA,gBAAgB,GAAG,CAAC;EACxBC,QAAQ,GAAG,CAAC,CAAC;EACbC,QAAQ;EACRC;AACa,CAAC,KACdC,MAAM,CAACC,IAAI,CAACJ,QAAQ,CAAC,CAACK,MAAM,CAAC,CAACC,GAAG,EAAEC,GAAG,KAAK;EACzC,MAAMC,KAAK,GAAGC,iBAAiB,CAAC;IAC9BC,IAAI,EAAG,GAAET,QAAS,IAAGM,GAAI,EAAC;IAC1BI,UAAU,EAAEX,QAAQ,CAACO,GAAG,CAAC;IACzBL;EACF,CAAC,CAAC;EACF,IAAIK,GAAG,IAAIC,KAAK,KAAK,IAAI,EAAE;IACzBF,GAAG,CAACC,GAAG,CAAC,GAAGC,KAAK;EAClB;EACA,OAAOF,GAAG;AACZ,CAAC,EAAE,CAAC,CAAC,CAAC;AAAA;AAER,MAAMG,iBAAiB,GAAG,CAAC;EACzBE,UAAU;EACVT,oBAAoB;EACpBU,WAAW,GAAG,KAAK;EACnBF,IAAI,GAAI;AAMV,CAAC,KAAqB;EACpB,MAAM,CAACG,IAAI,EAAEC,SAAS,GAAG,KAAK,CAAC,GAAGC,iBAAiB,CAACJ,UAAU,CAAC;EAE/D,IAAIG,SAAS,IAAIZ,oBAAoB,EAAE;IACrCA,oBAAoB,CAACc,WAAW,CAC9BN,IAAI,EACJO,uBAAuB,CAACN,UAAU,EAAEC,WAAW,CAAC,CACjD;EACH;EAEA,MAAMM,QAAQ,GAAGP,UAAU,CAACE,IAAI,CAAC;EAEjC,QAAQA,IAAI;IACV,KAAM,MAAK;MACT,OAAO,IAAI;IAEb,KAAM,MAAK;IACX,KAAM,QAAO;MAAE;QACb,IAAIM,oBAAoB,CAACR,UAAU,CAAC,EAAE;UACpC,OAAOS,mBAAmB,CAACT,UAAU,CAAC,GAAI,YAAW,GAAI,QAAO;QAClE;QACA,OAAOO,QAAQ,CAACG,OAAO;MACzB;IAEA,KAAM,OAAM;MAAE;QACZ,MAAM;UAAEC;QAAK,CAAC,GAAGJ,QAAQ;QACzB,MAAMK,gBAAgB,GAAGD,IAAI,GACzBb,iBAAiB,CAAC;UAChBE,UAAU,EAAEW,IAAI;UAChBV,WAAW,EAAE,IAAI;UACjBV,oBAAoB;UACpBQ;QACF,CAAC,CAAC,GACF,IAAI;QACR,OAAOa,gBAAgB,KAAK,IAAI,GAAG,IAAI,GAAG,CAACA,gBAAgB,CAAC;MAC9D;IAEA,KAAM,aAAY;IAClB,KAAM,iBAAgB;MAAE;QACtB,MAAM;UAAEC,KAAK,GAAG,CAAC;QAAE,CAAC,GAAGN,QAAQ;QAC/B,OAAO;UACLO,QAAQ,EAAEZ,IAAI,KAAM,iBAAgB;UACpCa,WAAW,EAAEvB,MAAM,CAACC,IAAI,CAACoB,KAAK,CAAC,CAACG,MAAM,CAACpB,GAAG,IAAIiB,KAAK,CAACjB,GAAG,CAAC,GAAG,CAAC;QAC9D,CAAC;MACH;IAEA,KAAM,QAAO;MAAE;QACb,MAAM;UAAEqB;QAAO,CAAC,GAAGV,QAAQ;QAC3B,IAAIW,OAAO,GAAG,KAAK;QACnB,MAAMC,MAAM,GAAG,CAAC,CAAC;QACjB3B,MAAM,CAACC,IAAI,CAACwB,MAAM,CAAC,CAACG,OAAO,CAACC,IAAI,IAAI;UAClC,MAAMxB,KAAK,GAAGC,iBAAiB,CAAC;YAC9BE,UAAU,EAAEiB,MAAM,CAACI,IAAI,CAAC;YACxB9B,oBAAoB;YACpBQ,IAAI,EAAG,GAAEA,IAAK,IAAGsB,IAAK;UACxB,CAAC,CAAC;UACF,IAAIxB,KAAK,KAAK,IAAI,EAAE;YAClBqB,OAAO,GAAG,IAAI;YACdC,MAAM,CAACE,IAAI,CAAC,GAAGxB,KAAK;UACtB;QACF,CAAC,CAAC;QACF,OAAOqB,OAAO,GAAGC,MAAM,GAAG,IAAI;MAChC;IAEA;MACE,OAAOZ,QAAQ,CAACG,OAAO;EAAA;AAE7B,CAAC;AAED,MAAMN,iBAAiB,GACrBJ,UAA4B,IACO;EACnC,MAAMsB,UAAU,GAAGC,aAAa,CAACvB,UAAU,CAAC;EAC5C,IAAIsB,UAAU,CAACE,MAAM,KAAK,CAAC,EAAE;IAC3B,OAAO,CAACF,UAAU,CAAC,CAAC,CAAC,CAAC;EACxB;EACA,IAAIA,UAAU,CAACE,MAAM,KAAK,CAAC,IAAIC,aAAa,CAACzB,UAAU,CAAC,EAAE;IACxD,OAAO,CAAE,OAAM,CAAC;EAClB;EACA,IAAIsB,UAAU,CAACE,MAAM,KAAK,CAAC,IAAIhB,oBAAoB,CAACR,UAAU,CAAC,EAAE;IAC/D,OAAO,CAACS,mBAAmB,CAACT,UAAU,CAAC,GAAI,MAAK,GAAI,QAAO,CAAC;EAC9D;EACA,IAAIsB,UAAU,CAACE,MAAM,GAAG,CAAC,EAAE;IACzB,OAAO,CAAE,MAAK,EAAE,IAAI,CAAC;EACvB;EACA,OAAO,CAAE,MAAK,CAAC;AACjB,CAAC;AAED,MAAMlB,uBAAuB,GAAG,CAC9BN,UAA4B,EAC5BC,WAAoB,KACY;EAChC,MAAMyB,cAAc,GAAIpC,QAAmB,IAAa;IACtD,IAAIA,QAAQ,KAAM,aAAY,EAAE;MAC9B,OAAQ,QAAO;IACjB;IACA,IAAIA,QAAQ,KAAM,iBAAgB,EAAE;MAClC,OAAQ,UAAS;IACnB;IACA,OAAO,CAAE,OAAM,EAAG,KAAI,CAAC,CAACqC,QAAQ,CAACrC,QAAQ,CAAC,GAAI,QAAO,GAAGA,QAAQ;EAClE,CAAC;EACD,MAAMsC,mBAAmB,GAAItC,QAAmB,IAAc;IAAA;IAC5D,IAAIA,QAAQ,KAAM,aAAY,EAAE;MAAA;MAC9B,MAAM;QAAEuB;MAAM,CAAC,4BAAGb,UAAU,CAAC6B,WAAW,yEAAI;QAAEhB,KAAK,EAAE,CAAC;MAAE,CAAC;MACzD,OAAOrB,MAAM,CAACC,IAAI,CAACoB,KAAK,CAAC,CAACiB,IAAI,CAAClC,GAAG,IAAIiB,KAAK,CAACjB,GAAG,CAAC,GAAG,CAAC,CAAC;IACvD;IACA,IAAIN,QAAQ,KAAM,iBAAgB,EAAE;MAAA;MAClC,MAAM;QAAEuB;MAAM,CAAC,6BAAGb,UAAU,CAAC+B,eAAe,2EAAI;QAAElB,KAAK,EAAE,CAAC;MAAE,CAAC;MAC7D,OAAOrB,MAAM,CAACC,IAAI,CAACoB,KAAK,CAAC,CAACG,MAAM,CAACpB,GAAG,IAAIiB,KAAK,CAACjB,GAAG,CAAC,GAAG,CAAC,CAAC;IACzD;IACA,IAAIN,QAAQ,KAAM,QAAO,EAAE;MACzB,OAAOF,gBAAgB,CAAC;QACtBE,QAAQ;QACRD,QAAQ,EAAEW,UAAU,CAAEgC,MAAM,CAAEf;MAChC,CAAC,CAAC;IACJ;IACA,IAAI3B,QAAQ,KAAM,OAAM,EAAE;MACxB,MAAM2C,SAAS,GAAGnC,iBAAiB,CAAC;QAClCE,UAAU,EAAEA,UAAU,CAAEkC,KAAK,CAAEvB,IAAI;QACnCV,WAAW,EAAE;MACf,CAAC,CAAC;MACF,OAAOgC,SAAS,KAAK,IAAI,IAAIA,SAAS,KAAKE,SAAS,GAAG,EAAE,GAAG,CAACF,SAAS,CAAC;IACzE;IACA,+BAAOjC,UAAU,CAACV,QAAQ,CAAC,yDAApB,qBAAsBoB,OAAO;EACtC,CAAC;EACD,MAAM0B,gBAAgB,GAAGb,aAAa,CAACvB,UAAU,CAAC;EAElD,IAAIC,WAAW,EAAE;IACf;IACA;IACA,MAAMoC,MAAM,GAAG,uBACbD,gBAAgB,EAChBlC,IAAI;MAAA;MAAA,OAAI,qBAAAF,UAAU,CAACE,IAAI,CAAC,qDAAhB,iBAAkBoC,KAAK,KAAK,EAAC;IAAA,EACtC;IACD,OAAO9C,MAAM,CAACC,IAAI,CAAC4C,MAAM,CAAC,CAACE,GAAG,CAACC,MAAM,IAAI;MACvC,OAAO;QACLtC,IAAI,EAAG,IAAGmC,MAAM,CAACG,MAAM,CAAC,CAACD,GAAG,CAACb,cAAc,CAAC,CAACe,IAAI,CAAE,GAAE,CAAE,GAAE;QACzD5C,KAAK,EAAEwC,MAAM,CAACG,MAAM,CAAC,CAACD,GAAG,CAACX,mBAAmB;MAC/C,CAAC;IACH,CAAC,CAAC;EACJ;EAEA,OAAOQ,gBAAgB,CAACG,GAAG,CAACrC,IAAI,IAAI;IAClC,OAAO;MACLA,IAAI,EAAEwB,cAAc,CAACxB,IAAI,CAAC;MAC1BL,KAAK,EAAE+B,mBAAmB,CAAC1B,IAAI;IACjC,CAAC;EACH,CAAC,CAAC;AACJ,CAAC;AAED,MAAMuB,aAAa,GAAIzB,UAA4B,IAAc;EAC/D,MAAM;IAAE0C,KAAK;IAAEC;EAAI,CAAC,GAAG3C,UAAU;EACjC,OAAO4C,OAAO,CAACF,KAAK,aAALA,KAAK,uBAALA,KAAK,CAAEG,KAAK,CAAC,IAAID,OAAO,CAACD,GAAG,aAAHA,GAAG,uBAAHA,GAAG,CAAEE,KAAK,CAAC;AACrD,CAAC;AAED,MAAMrC,oBAAoB,GAAIR,UAA4B,IAAc;EACtE,MAAM;IAAE8C,IAAI;IAAEC;EAAO,CAAC,GAAG/C,UAAU;EACnC,OAAO4C,OAAO,CAACE,IAAI,aAAJA,IAAI,uBAAJA,IAAI,CAAED,KAAK,CAAC,IAAID,OAAO,CAACG,MAAM,aAANA,MAAM,uBAANA,MAAM,CAAEF,KAAK,CAAC;AACvD,CAAC;AAED,MAAMpC,mBAAmB,GAAIT,UAA4B,IAAc;EACrE,MAAM;IAAE+C;EAAO,CAAC,GAAG/C,UAAU;EAC7B,OAAO+C,MAAM,KAAKZ,SAAS,IAAI,CAAAY,MAAM,aAANA,MAAM,uBAANA,MAAM,CAAEC,KAAK,OAAKD,MAAM,aAANA,MAAM,uBAANA,MAAM,CAAEF,KAAK;AAChE,CAAC;AAED,MAAMtB,aAAa,GAAG,CAACvB,UAA4B,GAAG,CAAC,CAAC,KACtDR,MAAM,CAACC,IAAI,CAACO,UAAU,CAAC,CAACgB,MAAM,CAC5Bd,IAAI,IAAIF,UAAU,CAACE,IAAI,CAAC,CAAC2C,KAAK,GAAG,CAAC,CACf"}

package/dist/schema/infer/index.js

@@ -0,0 +1,121 @@
+"use strict";
+
+const report = require(`gatsby-cli/lib/reporter`);
+const {
+  ObjectTypeComposer
+} = require(`graphql-compose`);
+const {
+  hasNodes
+} = require(`./inference-metadata`);
+const {
+  getExampleObject
+} = require(`./build-example-data`);
+const {
+  addNodeInterface
+} = require(`../types/node-interface`);
+const {
+  addInferredFields
+} = require(`./add-inferred-fields`);
+const {
+  getDataStore
+} = require(`../../datastore`);
+const addInferredTypes = ({
+  schemaComposer,
+  typeConflictReporter,
+  typeMapping,
+  inferenceMetadata,
+  parentSpan
+}) => {
+  // XXX(freiksenet): Won't be needed after plugins set typedefs
+  // Infer File first so all the links to it would work
+  const {
+    typeMap
+  } = inferenceMetadata;
+  const typesWithNodes = Object.keys(typeMap).filter(typeName => hasNodes(typeMap[typeName]));
+  const typeNames = putFileFirst(typesWithNodes);
+  const noNodeInterfaceTypes = [];
+  const typesToInfer = [];
+  typeNames.forEach(typeName => {
+    let typeComposer;
+    if (schemaComposer.has(typeName)) {
+      typeComposer = schemaComposer.getOTC(typeName);
+      const runInfer = typeComposer.hasExtension(`infer`) ? typeComposer.getExtension(`infer`) : true;
+      if (runInfer) {
+        if (!typeComposer.hasInterface(`Node`)) {
+          noNodeInterfaceTypes.push(typeName);
+        }
+        typesToInfer.push(typeComposer);
+      }
+    } else {
+      typeComposer = ObjectTypeComposer.create(typeName, schemaComposer);
+      addNodeInterface({
+        schemaComposer,
+        typeComposer
+      });
+      typeComposer.setExtension(`createdFrom`, `inference`);
+      typesToInfer.push(typeComposer);
+    }
+  });
+  if (noNodeInterfaceTypes.length > 0) {
+    noNodeInterfaceTypes.forEach(typeName => {
+      report.warn(`Type \`${typeName}\` declared in \`createTypes\` looks like a node, ` + `but doesn't implement a \`Node\` interface. It's likely that you should ` + `add the \`Node\` interface to your type def:\n\n` + `\`type ${typeName} implements Node { ... }\`\n\n` + `If you know that you don't want it to be a node (which would mean no ` + `root queries to retrieve it), you can explicitly disable inference ` + `for it:\n\n` + `\`type ${typeName} @dontInfer { ... }\``);
+    });
+    report.panic(`Building schema failed`);
+  }
+  return typesToInfer.map(typeComposer => addInferredType({
+    schemaComposer,
+    typeComposer,
+    typeConflictReporter,
+    typeMapping,
+    parentSpan,
+    inferenceMetadata
+  }));
+};
+const addInferredType = ({
+  schemaComposer,
+  typeComposer,
+  typeConflictReporter,
+  typeMapping,
+  inferenceMetadata = {},
+  parentSpan
+}) => {
+  const typeName = typeComposer.getTypeName();
+  // TODO: Move this to where the type is created once we can get
+  // node type owner information directly from store
+  if (typeComposer.getExtension(`createdFrom`) === `inference` && hasNodes(inferenceMetadata.typeMap[typeName])) {
+    let firstNode;
+    for (const node of getDataStore().iterateNodesByType(typeName)) {
+      firstNode = node;
+      break;
+    }
+    if (firstNode) {
+      typeComposer.setExtension(`plugin`, firstNode.internal.owner);
+    }
+  }
+  const exampleValue = getExampleObject({
+    ...inferenceMetadata.typeMap[typeName],
+    typeName,
+    typeConflictReporter
+  });
+  addInferredFields({
+    schemaComposer,
+    typeComposer,
+    exampleValue,
+    typeMapping,
+    parentSpan
+  });
+  return typeComposer;
+};
+const putFileFirst = typeNames => {
+  const index = typeNames.indexOf(`File`);
+  if (index !== -1) {
+    return [`File`, ...typeNames.slice(0, index), ...typeNames.slice(index + 1)];
+  } else {
+    return typeNames;
+  }
+};
+module.exports = {
+  addInferredType,
+  addInferredTypes
+};
+//# sourceMappingURL=index.js.map

package/dist/schema/infer/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","names":["report","require","ObjectTypeComposer","hasNodes","getExampleObject","addNodeInterface","addInferredFields","getDataStore","addInferredTypes","schemaComposer","typeConflictReporter","typeMapping","inferenceMetadata","parentSpan","typeMap","typesWithNodes","Object","keys","filter","typeName","typeNames","putFileFirst","noNodeInterfaceTypes","typesToInfer","forEach","typeComposer","has","getOTC","runInfer","hasExtension","getExtension","hasInterface","push","create","setExtension","length","warn","panic","map","addInferredType","getTypeName","firstNode","node","iterateNodesByType","internal","owner","exampleValue","index","indexOf","slice","module","exports"],"sources":["../../../src/schema/infer/index.js"],"sourcesContent":["const report = require(`gatsby-cli/lib/reporter`)\nconst { ObjectTypeComposer } = require(`graphql-compose`)\nconst { hasNodes } = require(`./inference-metadata`)\nconst { getExampleObject } = require(`./build-example-data`)\nconst { addNodeInterface } = require(`../types/node-interface`)\nconst { addInferredFields } = require(`./add-inferred-fields`)\nconst { getDataStore } = require(`../../datastore`)\n\nconst addInferredTypes = ({\n  schemaComposer,\n  typeConflictReporter,\n  typeMapping,\n  inferenceMetadata,\n  parentSpan,\n}) => {\n  // XXX(freiksenet): Won't be needed after plugins set typedefs\n  // Infer File first so all the links to it would work\n  const { typeMap } = inferenceMetadata\n  const typesWithNodes = Object.keys(typeMap).filter(typeName =>\n    hasNodes(typeMap[typeName])\n  )\n  const typeNames = putFileFirst(typesWithNodes)\n  const noNodeInterfaceTypes = []\n\n  const typesToInfer = []\n\n  typeNames.forEach(typeName => {\n    let typeComposer\n    if (schemaComposer.has(typeName)) {\n      typeComposer = schemaComposer.getOTC(typeName)\n      const runInfer = typeComposer.hasExtension(`infer`)\n        ? typeComposer.getExtension(`infer`)\n        : true\n      if (runInfer) {\n        if (!typeComposer.hasInterface(`Node`)) {\n          noNodeInterfaceTypes.push(typeName)\n        }\n        typesToInfer.push(typeComposer)\n      }\n    } else {\n      typeComposer = ObjectTypeComposer.create(typeName, schemaComposer)\n      addNodeInterface({ schemaComposer, typeComposer })\n      typeComposer.setExtension(`createdFrom`, `inference`)\n      typesToInfer.push(typeComposer)\n    }\n  })\n\n  if (noNodeInterfaceTypes.length > 0) {\n    noNodeInterfaceTypes.forEach(typeName => {\n      report.warn(\n        `Type \\`${typeName}\\` declared in \\`createTypes\\` looks like a node, ` +\n          `but doesn't implement a \\`Node\\` interface. It's likely that you should ` +\n          `add the \\`Node\\` interface to your type def:\\n\\n` +\n          `\\`type ${typeName} implements Node { ... }\\`\\n\\n` +\n          `If you know that you don't want it to be a node (which would mean no ` +\n          `root queries to retrieve it), you can explicitly disable inference ` +\n          `for it:\\n\\n` +\n          `\\`type ${typeName} @dontInfer { ... }\\``\n      )\n    })\n    report.panic(`Building schema failed`)\n  }\n\n  return typesToInfer.map(typeComposer =>\n    addInferredType({\n      schemaComposer,\n      typeComposer,\n      typeConflictReporter,\n      typeMapping,\n      parentSpan,\n      inferenceMetadata,\n    })\n  )\n}\n\nconst addInferredType = ({\n  schemaComposer,\n  typeComposer,\n  typeConflictReporter,\n  typeMapping,\n  inferenceMetadata = {},\n  parentSpan,\n}) => {\n  const typeName = typeComposer.getTypeName()\n  // TODO: Move this to where the type is created once we can get\n  // node type owner information directly from store\n  if (\n    typeComposer.getExtension(`createdFrom`) === `inference` &&\n    hasNodes(inferenceMetadata.typeMap[typeName])\n  ) {\n    let firstNode\n    for (const node of getDataStore().iterateNodesByType(typeName)) {\n      firstNode = node\n      break\n    }\n    if (firstNode) {\n      typeComposer.setExtension(`plugin`, firstNode.internal.owner)\n    }\n  }\n\n  const exampleValue = getExampleObject({\n    ...inferenceMetadata.typeMap[typeName],\n    typeName,\n    typeConflictReporter,\n  })\n\n  addInferredFields({\n    schemaComposer,\n    typeComposer,\n    exampleValue,\n    typeMapping,\n    parentSpan,\n  })\n  return typeComposer\n}\n\nconst putFileFirst = typeNames => {\n  const index = typeNames.indexOf(`File`)\n  if (index !== -1) {\n    return [`File`, ...typeNames.slice(0, index), ...typeNames.slice(index + 1)]\n  } else {\n    return typeNames\n  }\n}\n\nmodule.exports = {\n  addInferredType,\n  addInferredTypes,\n}\n"],"mappings":";;AAAA,MAAMA,MAAM,GAAGC,OAAO,CAAE,yBAAwB,CAAC;AACjD,MAAM;EAAEC;AAAmB,CAAC,GAAGD,OAAO,CAAE,iBAAgB,CAAC;AACzD,MAAM;EAAEE;AAAS,CAAC,GAAGF,OAAO,CAAE,sBAAqB,CAAC;AACpD,MAAM;EAAEG;AAAiB,CAAC,GAAGH,OAAO,CAAE,sBAAqB,CAAC;AAC5D,MAAM;EAAEI;AAAiB,CAAC,GAAGJ,OAAO,CAAE,yBAAwB,CAAC;AAC/D,MAAM;EAAEK;AAAkB,CAAC,GAAGL,OAAO,CAAE,uBAAsB,CAAC;AAC9D,MAAM;EAAEM;AAAa,CAAC,GAAGN,OAAO,CAAE,iBAAgB,CAAC;AAEnD,MAAMO,gBAAgB,GAAG,CAAC;EACxBC,cAAc;EACdC,oBAAoB;EACpBC,WAAW;EACXC,iBAAiB;EACjBC;AACF,CAAC,KAAK;EACJ;EACA;EACA,MAAM;IAAEC;EAAQ,CAAC,GAAGF,iBAAiB;EACrC,MAAMG,cAAc,GAAGC,MAAM,CAACC,IAAI,CAACH,OAAO,CAAC,CAACI,MAAM,CAACC,QAAQ,IACzDhB,QAAQ,CAACW,OAAO,CAACK,QAAQ,CAAC,CAAC,CAC5B;EACD,MAAMC,SAAS,GAAGC,YAAY,CAACN,cAAc,CAAC;EAC9C,MAAMO,oBAAoB,GAAG,EAAE;EAE/B,MAAMC,YAAY,GAAG,EAAE;EAEvBH,SAAS,CAACI,OAAO,CAACL,QAAQ,IAAI;IAC5B,IAAIM,YAAY;IAChB,IAAIhB,cAAc,CAACiB,GAAG,CAACP,QAAQ,CAAC,EAAE;MAChCM,YAAY,GAAGhB,cAAc,CAACkB,MAAM,CAACR,QAAQ,CAAC;MAC9C,MAAMS,QAAQ,GAAGH,YAAY,CAACI,YAAY,CAAE,OAAM,CAAC,GAC/CJ,YAAY,CAACK,YAAY,CAAE,OAAM,CAAC,GAClC,IAAI;MACR,IAAIF,QAAQ,EAAE;QACZ,IAAI,CAACH,YAAY,CAACM,YAAY,CAAE,MAAK,CAAC,EAAE;UACtCT,oBAAoB,CAACU,IAAI,CAACb,QAAQ,CAAC;QACrC;QACAI,YAAY,CAACS,IAAI,CAACP,YAAY,CAAC;MACjC;IACF,CAAC,MAAM;MACLA,YAAY,GAAGvB,kBAAkB,CAAC+B,MAAM,CAACd,QAAQ,EAAEV,cAAc,CAAC;MAClEJ,gBAAgB,CAAC;QAAEI,cAAc;QAAEgB;MAAa,CAAC,CAAC;MAClDA,YAAY,CAACS,YAAY,CAAE,aAAY,EAAG,WAAU,CAAC;MACrDX,YAAY,CAACS,IAAI,CAACP,YAAY,CAAC;IACjC;EACF,CAAC,CAAC;EAEF,IAAIH,oBAAoB,CAACa,MAAM,GAAG,CAAC,EAAE;IACnCb,oBAAoB,CAACE,OAAO,CAACL,QAAQ,IAAI;MACvCnB,MAAM,CAACoC,IAAI,CACR,UAASjB,QAAS,oDAAmD,GACnE,0EAAyE,GACzE,kDAAiD,GACjD,UAASA,QAAS,gCAA+B,GACjD,uEAAsE,GACtE,qEAAoE,GACpE,aAAY,GACZ,UAASA,QAAS,uBAAsB,CAC5C;IACH,CAAC,CAAC;IACFnB,MAAM,CAACqC,KAAK,CAAE,wBAAuB,CAAC;EACxC;EAEA,OAAOd,YAAY,CAACe,GAAG,CAACb,YAAY,IAClCc,eAAe,CAAC;IACd9B,cAAc;IACdgB,YAAY;IACZf,oBAAoB;IACpBC,WAAW;IACXE,UAAU;IACVD;EACF,CAAC,CAAC,CACH;AACH,CAAC;AAED,MAAM2B,eAAe,GAAG,CAAC;EACvB9B,cAAc;EACdgB,YAAY;EACZf,oBAAoB;EACpBC,WAAW;EACXC,iBAAiB,GAAG,CAAC,CAAC;EACtBC;AACF,CAAC,KAAK;EACJ,MAAMM,QAAQ,GAAGM,YAAY,CAACe,WAAW,EAAE;EAC3C;EACA;EACA,IACEf,YAAY,CAACK,YAAY,CAAE,aAAY,CAAC,KAAM,WAAU,IACxD3B,QAAQ,CAACS,iBAAiB,CAACE,OAAO,CAACK,QAAQ,CAAC,CAAC,EAC7C;IACA,IAAIsB,SAAS;IACb,KAAK,MAAMC,IAAI,IAAInC,YAAY,EAAE,CAACoC,kBAAkB,CAACxB,QAAQ,CAAC,EAAE;MAC9DsB,SAAS,GAAGC,IAAI;MAChB;IACF;IACA,IAAID,SAAS,EAAE;MACbhB,YAAY,CAACS,YAAY,CAAE,QAAO,EAAEO,SAAS,CAACG,QAAQ,CAACC,KAAK,CAAC;IAC/D;EACF;EAEA,MAAMC,YAAY,GAAG1C,gBAAgB,CAAC;IACpC,GAAGQ,iBAAiB,CAACE,OAAO,CAACK,QAAQ,CAAC;IACtCA,QAAQ;IACRT;EACF,CAAC,CAAC;EAEFJ,iBAAiB,CAAC;IAChBG,cAAc;IACdgB,YAAY;IACZqB,YAAY;IACZnC,WAAW;IACXE;EACF,CAAC,CAAC;EACF,OAAOY,YAAY;AACrB,CAAC;AAED,MAAMJ,YAAY,GAAGD,SAAS,IAAI;EAChC,MAAM2B,KAAK,GAAG3B,SAAS,CAAC4B,OAAO,CAAE,MAAK,CAAC;EACvC,IAAID,KAAK,KAAK,CAAC,CAAC,EAAE;IAChB,OAAO,CAAE,MAAK,EAAE,GAAG3B,SAAS,CAAC6B,KAAK,CAAC,CAAC,EAAEF,KAAK,CAAC,EAAE,GAAG3B,SAAS,CAAC6B,KAAK,CAACF,KAAK,GAAG,CAAC,CAAC,CAAC;EAC9E,CAAC,MAAM;IACL,OAAO3B,SAAS;EAClB;AACF,CAAC;AAED8B,MAAM,CAACC,OAAO,GAAG;EACfZ,eAAe;EACf/B;AACF,CAAC"}

package/dist/schema/infer/inference-metadata.d.ts

@@ -0,0 +1,72 @@
+import { Node } from "../../../index";
+import { TypeConflictReporter } from "./type-conflict-reporter";
+export interface ITypeInfo {
+    first?: string;
+    total: number;
+    example?: unknown;
+}
+export interface ITypeInfoString extends ITypeInfo {
+    empty: number;
+    example: string;
+}
+export interface ITypeInfoDate extends ITypeInfo {
+    example: string | Date;
+}
+export interface ITypeInfoNumber extends ITypeInfo {
+    example: number;
+}
+export interface ITypeInfoBoolean extends ITypeInfo {
+    example: boolean;
+}
+export interface ITypeInfoArray extends ITypeInfo {
+    item: IValueDescriptor;
+}
+export interface ITypeInfoRelatedNodes extends ITypeInfo {
+    nodes: {
+        [key: string]: number;
+    };
+}
+export interface ITypeInfoObject extends ITypeInfo {
+    dprops: {
+        [name: string]: IValueDescriptor;
+    };
+}
+export interface IValueDescriptor {
+    int?: ITypeInfoNumber;
+    float?: ITypeInfoNumber;
+    date?: ITypeInfoDate;
+    string?: ITypeInfoString;
+    boolean?: ITypeInfoBoolean;
+    array?: ITypeInfoArray;
+    relatedNode?: ITypeInfoRelatedNodes;
+    relatedNodeList?: ITypeInfoRelatedNodes;
+    object?: ITypeInfoObject;
+}
+export type ValueType = keyof IValueDescriptor;
+export interface ITypeMetadata {
+    typeName?: string;
+    disabled?: boolean;
+    ignored?: boolean;
+    dirty?: boolean;
+    total?: number;
+    ignoredFields?: Set<string>;
+    fieldMap?: Record<string, IValueDescriptor>;
+    typeConflictReporter?: TypeConflictReporter;
+    [key: string]: unknown;
+}
+declare const ignore: (metadata?: ITypeMetadata, set?: boolean) => ITypeMetadata;
+declare const disable: (metadata?: ITypeMetadata, set?: boolean) => ITypeMetadata;
+declare const addNode: (metadata: ITypeMetadata, node: Node) => ITypeMetadata;
+declare const deleteNode: (metadata: ITypeMetadata, node: Node) => ITypeMetadata;
+declare const addNodes: (metadata: ITypeMetadata | undefined, nodes: Iterable<Node>) => ITypeMetadata;
+declare const isEmpty: ({ fieldMap }: {
+    fieldMap: any;
+}) => boolean;
+declare const hasNodes: (typeMetadata: ITypeMetadata) => boolean;
+declare const haveEqualFields: ({ fieldMap }?: {
+    fieldMap?: {} | undefined;
+}, { fieldMap: otherFieldMap }?: {
+    fieldMap?: {} | undefined;
+}) => boolean;
+declare const initialMetadata: (state?: Record<string, unknown>) => ITypeMetadata;
+export { addNode, addNodes, deleteNode, ignore, disable, isEmpty, hasNodes, haveEqualFields, initialMetadata, };

package/dist/schema/infer/inference-metadata.js

@@ -0,0 +1,280 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+exports.__esModule = true;
+exports.isEmpty = exports.initialMetadata = exports.ignore = exports.haveEqualFields = exports.hasNodes = exports.disable = exports.deleteNode = exports.addNodes = exports.addNode = void 0;
+var _isEqual2 = _interopRequireDefault(require("lodash/isEqual"));
+var _is32BitInteger = require("../../utils/is-32-bit-integer");
+var _date = require("../types/date");
+const getType = (value, key) => {
+  // Staying as close as possible to GraphQL types
+  switch (typeof value) {
+    case `number`:
+      return (0, _is32BitInteger.is32BitInteger)(value) ? `int` : `float`;
+    case `string`:
+      if (key.includes(`___NODE`)) {
+        return `relatedNode`;
+      }
+      return (0, _date.looksLikeADate)(value) ? `date` : `string`;
+    case `boolean`:
+      return `boolean`;
+    case `object`:
+      if (value === null) return `null`;
+      if (value instanceof Date) return `date`;
+      if (value instanceof String) return `string`;
+      if (Array.isArray(value)) {
+        if (value.length === 0) {
+          return `null`;
+        }
+        return key.includes(`___NODE`) ? `relatedNodeList` : `array`;
+      }
+      if (!Object.keys(value).length) return `null`;
+      return `object`;
+    default:
+      // bigint, symbol, function, unknown (host objects in IE were typeof "unknown", for example)
+      return `null`;
+  }
+};
+const updateValueDescriptorObject = (value, typeInfo, nodeId, operation, metadata, path) => {
+  path.push(value);
+  const {
+    dprops = {}
+  } = typeInfo;
+  typeInfo.dprops = dprops;
+  Object.keys(value).forEach(key => {
+    const v = value[key];
+    let descriptor = dprops[key];
+    if (descriptor === undefined) {
+      descriptor = {};
+      dprops[key] = descriptor;
+    }
+    updateValueDescriptor(nodeId, key, v, operation, descriptor, metadata, path);
+  });
+  path.pop();
+};
+const updateValueDescriptorArray = (value, key, typeInfo, nodeId, operation, metadata, path) => {
+  value.forEach(item => {
+    let descriptor = typeInfo.item;
+    if (descriptor === undefined) {
+      descriptor = {};
+      typeInfo.item = descriptor;
+    }
+    updateValueDescriptor(nodeId, key, item, operation, descriptor, metadata, path);
+  });
+};
+const updateValueDescriptorRelNodes = (listOfNodeIds, delta, operation, typeInfo, metadata) => {
+  const {
+    nodes = {}
+  } = typeInfo;
+  typeInfo.nodes = nodes;
+  listOfNodeIds.forEach(nodeId => {
+    nodes[nodeId] = (nodes[nodeId] || 0) + delta;
+
+    // Treat any new related node addition or removal as a structural change
+    // FIXME: this will produce false positives as this node can be
+    //  of the same type as another node already in the map (but we don't know it here)
+    if (nodes[nodeId] === 0 || operation === `add` && nodes[nodeId] === 1) {
+      metadata.dirty = true;
+    }
+  });
+};
+const updateValueDescriptorString = (value, delta, typeInfo) => {
+  if (value === ``) {
+    const {
+      empty = 0
+    } = typeInfo;
+    typeInfo.empty = empty + delta;
+  }
+  typeInfo.example = typeof typeInfo.example !== `undefined` ? typeInfo.example : value;
+};
+const updateValueDescriptor = (nodeId, key, value, operation = `add`, descriptor, metadata, path) => {
+  // The object may be traversed multiple times from root.
+  // Each time it does it should not revisit the same node twice
+  if (path.includes(value)) {
+    return;
+  }
+  const typeName = getType(value, key);
+  if (typeName === `null`) {
+    return;
+  }
+  const delta = operation === `del` ? -1 : 1;
+  let typeInfo = descriptor[typeName];
+  if (typeInfo === undefined) {
+    // eslint-disable-next-line no-undef
+    typeInfo = descriptor[typeName] = {
+      total: 0
+    };
+  }
+  typeInfo.total += delta;
+
+  // Keeping track of structural changes
+  // (when value of a new type is added or an existing type has no more values assigned)
+  if (typeInfo.total === 0 || operation === `add` && typeInfo.total === 1) {
+    metadata.dirty = true;
+  }
+
+  // Keeping track of the first node for this type. Only used for better conflict reporting.
+  // (see Caveats section in the header comments)
+  if (operation === `add`) {
+    if (!typeInfo.first) {
+      typeInfo.first = nodeId;
+    }
+  } else if (operation === `del`) {
+    if (typeInfo.first === nodeId || typeInfo.total === 0) {
+      typeInfo.first = undefined;
+    }
+  }
+  switch (typeName) {
+    case `object`:
+      updateValueDescriptorObject(value, typeInfo, nodeId, operation, metadata, path);
+      return;
+    case `array`:
+      updateValueDescriptorArray(value, key, typeInfo, nodeId, operation, metadata, path);
+      return;
+    case `relatedNode`:
+      updateValueDescriptorRelNodes([value], delta, operation, typeInfo, metadata);
+      return;
+    case `relatedNodeList`:
+      updateValueDescriptorRelNodes(value, delta, operation, typeInfo, metadata);
+      return;
+    case `string`:
+      updateValueDescriptorString(value, delta, typeInfo);
+      return;
+  }
+
+  // int, float, boolean, null
+
+  typeInfo.example = typeof typeInfo.example !== `undefined` ? typeInfo.example : value;
+};
+const mergeObjectKeys = (dpropsKeysA = {}, dpropsKeysB = {}) => {
+  const dprops = Object.keys(dpropsKeysA);
+  const otherProps = Object.keys(dpropsKeysB);
+  return [...new Set(dprops.concat(otherProps))];
+};
+const descriptorsAreEqual = (descriptor, otherDescriptor) => {
+  const types = possibleTypes(descriptor);
+  const otherTypes = possibleTypes(otherDescriptor);
+  const childDescriptorsAreEqual = type => {
+    var _descriptor$array, _otherDescriptor$arra;
+    switch (type) {
+      case `array`:
+        return descriptorsAreEqual(descriptor === null || descriptor === void 0 ? void 0 : (_descriptor$array = descriptor.array) === null || _descriptor$array === void 0 ? void 0 : _descriptor$array.item, otherDescriptor === null || otherDescriptor === void 0 ? void 0 : (_otherDescriptor$arra = otherDescriptor.array) === null || _otherDescriptor$arra === void 0 ? void 0 : _otherDescriptor$arra.item);
+      case `object`:
+        {
+          var _descriptor$object, _otherDescriptor$obje;
+          const dpropsKeys = mergeObjectKeys(descriptor === null || descriptor === void 0 ? void 0 : (_descriptor$object = descriptor.object) === null || _descriptor$object === void 0 ? void 0 : _descriptor$object.dprops, otherDescriptor === null || otherDescriptor === void 0 ? void 0 : (_otherDescriptor$obje = otherDescriptor.object) === null || _otherDescriptor$obje === void 0 ? void 0 : _otherDescriptor$obje.dprops);
+          return dpropsKeys.every(prop => {
+            var _descriptor$object2, _otherDescriptor$obje2;
+            return descriptorsAreEqual(descriptor === null || descriptor === void 0 ? void 0 : (_descriptor$object2 = descriptor.object) === null || _descriptor$object2 === void 0 ? void 0 : _descriptor$object2.dprops[prop], otherDescriptor === null || otherDescriptor === void 0 ? void 0 : (_otherDescriptor$obje2 = otherDescriptor.object) === null || _otherDescriptor$obje2 === void 0 ? void 0 : _otherDescriptor$obje2.dprops[prop]);
+          });
+        }
+      case `relatedNode`:
+        {
+          var _descriptor$relatedNo, _otherDescriptor$rela;
+          const nodeIds = mergeObjectKeys(descriptor === null || descriptor === void 0 ? void 0 : (_descriptor$relatedNo = descriptor.relatedNode) === null || _descriptor$relatedNo === void 0 ? void 0 : _descriptor$relatedNo.nodes, otherDescriptor === null || otherDescriptor === void 0 ? void 0 : (_otherDescriptor$rela = otherDescriptor.relatedNode) === null || _otherDescriptor$rela === void 0 ? void 0 : _otherDescriptor$rela.nodes);
+          // Must be present in both descriptors or absent in both
+          // in order to be considered equal
+          return nodeIds.every(id => {
+            var _descriptor$relatedNo2, _otherDescriptor$rela2;
+            return Boolean(descriptor === null || descriptor === void 0 ? void 0 : (_descriptor$relatedNo2 = descriptor.relatedNode) === null || _descriptor$relatedNo2 === void 0 ? void 0 : _descriptor$relatedNo2.nodes[id]) === Boolean(otherDescriptor === null || otherDescriptor === void 0 ? void 0 : (_otherDescriptor$rela2 = otherDescriptor.relatedNode) === null || _otherDescriptor$rela2 === void 0 ? void 0 : _otherDescriptor$rela2.nodes[id]);
+          });
+        }
+      case `relatedNodeList`:
+        {
+          var _descriptor$relatedNo3, _otherDescriptor$rela3;
+          const nodeIds = mergeObjectKeys(descriptor === null || descriptor === void 0 ? void 0 : (_descriptor$relatedNo3 = descriptor.relatedNodeList) === null || _descriptor$relatedNo3 === void 0 ? void 0 : _descriptor$relatedNo3.nodes, otherDescriptor === null || otherDescriptor === void 0 ? void 0 : (_otherDescriptor$rela3 = otherDescriptor.relatedNodeList) === null || _otherDescriptor$rela3 === void 0 ? void 0 : _otherDescriptor$rela3.nodes);
+          return nodeIds.every(id => {
+            var _descriptor$relatedNo4, _otherDescriptor$rela4;
+            return Boolean(descriptor === null || descriptor === void 0 ? void 0 : (_descriptor$relatedNo4 = descriptor.relatedNodeList) === null || _descriptor$relatedNo4 === void 0 ? void 0 : _descriptor$relatedNo4.nodes[id]) === Boolean(otherDescriptor === null || otherDescriptor === void 0 ? void 0 : (_otherDescriptor$rela4 = otherDescriptor.relatedNodeList) === null || _otherDescriptor$rela4 === void 0 ? void 0 : _otherDescriptor$rela4.nodes[id]);
+          });
+        }
+      default:
+        return true;
+    }
+  };
+
+  // Equal when all possible types are equal (including conflicts)
+  return (0, _isEqual2.default)(types, otherTypes) && types.every(childDescriptorsAreEqual);
+};
+const nodeFields = (node, ignoredFields = new Set()) => Object.keys(node).filter(key => !ignoredFields.has(key));
+const updateTypeMetadata = (metadata = initialMetadata(), operation, node) => {
+  if (metadata.disabled) {
+    return metadata;
+  }
+  metadata.total = (metadata.total || 0) + (operation === `add` ? 1 : -1);
+  if (metadata.ignored) {
+    return metadata;
+  }
+  const {
+    ignoredFields,
+    fieldMap = {}
+  } = metadata;
+  nodeFields(node, ignoredFields).forEach(field => {
+    let descriptor = fieldMap[field];
+    if (descriptor === undefined) {
+      descriptor = {};
+      fieldMap[field] = descriptor;
+    }
+    updateValueDescriptor(node.id, field, node[field], operation, descriptor, metadata, []);
+  });
+  metadata.fieldMap = fieldMap;
+  return metadata;
+};
+const ignore = (metadata = initialMetadata(), set = true) => {
+  metadata.ignored = set;
+  metadata.fieldMap = {};
+  return metadata;
+};
+exports.ignore = ignore;
+const disable = (metadata = initialMetadata(), set = true) => {
+  metadata.disabled = set;
+  return metadata;
+};
+exports.disable = disable;
+const addNode = (metadata, node) => updateTypeMetadata(metadata, `add`, node);
+exports.addNode = addNode;
+const deleteNode = (metadata, node) => updateTypeMetadata(metadata, `del`, node);
+exports.deleteNode = deleteNode;
+const addNodes = (metadata = initialMetadata(), nodes) => {
+  let state = metadata;
+  for (const node of nodes) {
+    state = addNode(state, node);
+  }
+  return state;
+};
+exports.addNodes = addNodes;
+const possibleTypes = (descriptor = {}) => Object.keys(descriptor).filter(type => descriptor[type].total > 0);
+const isEmpty = ({
+  fieldMap
+}) => Object.keys(fieldMap).every(field => possibleTypes(fieldMap[field]).length === 0);
+
+// Even empty type may still have nodes
+exports.isEmpty = isEmpty;
+const hasNodes = typeMetadata => {
+  var _typeMetadata$total;
+  return ((_typeMetadata$total = typeMetadata.total) !== null && _typeMetadata$total !== void 0 ? _typeMetadata$total : 0) > 0;
+};
+exports.hasNodes = hasNodes;
+const haveEqualFields = ({
+  fieldMap = {}
+} = {}, {
+  fieldMap: otherFieldMap = {}
+} = {}) => {
+  const fields = mergeObjectKeys(fieldMap, otherFieldMap);
+  return fields.every(field => descriptorsAreEqual(fieldMap[field], otherFieldMap[field]));
+};
+exports.haveEqualFields = haveEqualFields;
+const initialMetadata = state => {
+  return {
+    typeName: undefined,
+    disabled: false,
+    ignored: false,
+    dirty: false,
+    total: 0,
+    ignoredFields: undefined,
+    fieldMap: {},
+    ...state
+  };
+};
+exports.initialMetadata = initialMetadata;
+//# sourceMappingURL=inference-metadata.js.map

package/dist/schema/infer/inference-metadata.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"inference-metadata.js","names":["getType","value","key","is32BitInteger","includes","looksLikeADate","Date","String","Array","isArray","length","Object","keys","updateValueDescriptorObject","typeInfo","nodeId","operation","metadata","path","push","dprops","forEach","v","descriptor","undefined","updateValueDescriptor","pop","updateValueDescriptorArray","item","updateValueDescriptorRelNodes","listOfNodeIds","delta","nodes","dirty","updateValueDescriptorString","empty","example","typeName","total","first","mergeObjectKeys","dpropsKeysA","dpropsKeysB","otherProps","Set","concat","descriptorsAreEqual","otherDescriptor","types","possibleTypes","otherTypes","childDescriptorsAreEqual","type","array","dpropsKeys","object","every","prop","nodeIds","relatedNode","id","Boolean","relatedNodeList","nodeFields","node","ignoredFields","filter","has","updateTypeMetadata","initialMetadata","disabled","ignored","fieldMap","field","ignore","set","disable","addNode","deleteNode","addNodes","state","isEmpty","hasNodes","typeMetadata","haveEqualFields","otherFieldMap","fields"],"sources":["../../../src/schema/infer/inference-metadata.ts"],"sourcesContent":["/* eslint-disable @typescript-eslint/no-use-before-define */\n/*\n## Incrementally track the structure of nodes with metadata\n\nThis metadata can be later utilized for schema inference\n(via building `exampleValue` or directly)\n\n### Usage example:\n\n```javascript\n  const node1 = { id: '1', foo: 25, bar: 'str' }\n  const node2 = { id: '1', foo: 'conflict' }\n\n  let meta = { ignoredFields: new Set(['id']) }\n  meta = addNode(meta, node1)\n  meta = addNode(meta, node2)\n  console.log(meta.fieldMap)\n  // outputs: {\n  //   foo: {\n  //     int: { total: 1, example: 25 },\n  //     string: { total: 1, example: 'conflict' },\n  //   },\n  //   bar: {\n  //     string: { total: 1, example: 'str' },\n  //   },\n  // }\n\n  const example1 = getExampleObject({ meta, typeName, typeConflictReporter })\n  console.log(example1)\n  // outputs { bar: 'str' }\n  // and reports conflicts discovered\n\n  meta = deleteNode(meta, node2)\n  console.log(meta.fieldMap)\n  // outputs: {\n  //   foo: {\n  //     int: { total: 1, example: 25 },\n  //     string: { total: 0, example: 'conflict' },\n  //   },\n  //   bar: { string: { total: 1, example: 'str' } },\n  // }\n\n  const example2 = getExampleObject({ meta, typeName, typeConflictReporter })\n  // outputs: { foo: 25, bar: 'str' }\n```\n\n`addNode`, `deleteNode`, `getExampleObject` are O(N) where N is the number\nof fields in the node object (including nested fields)\n\n### Caveats\n\n* Conflict tracking for arrays is tricky, i.e.: { a: [5, \"foo\"] } and { a: [5] }, { a: [\"foo\"] }\n  are represented identically in metadata. To workaround it we additionally track first NodeId:\n  { a: { array: { item: { int: { total: 1, first: `1` }, string: { total: 1, first: `1` } }}\n  { a: { array: { item: { int: { total: 1, first: `1` }, string: { total: 1, first: `2` } }}\n  This way we can produce more useful conflict reports\n  (still rare edge cases possible when reporting may be confusing, i.e. when node is deleted)\n*/\n\nimport { isEqual } from \"lodash\"\nimport { is32BitInteger } from \"../../utils/is-32-bit-integer\"\nimport { looksLikeADate } from \"../types/date\"\nimport { Node } from \"../../../index\"\nimport { TypeConflictReporter } from \"./type-conflict-reporter\"\n\nexport interface ITypeInfo {\n  first?: string\n  total: number\n  example?: unknown\n}\n\nexport interface ITypeInfoString extends ITypeInfo {\n  empty: number\n  example: string\n}\n\nexport interface ITypeInfoDate extends ITypeInfo {\n  example: string | Date\n}\n\nexport interface ITypeInfoNumber extends ITypeInfo {\n  example: number\n}\n\nexport interface ITypeInfoBoolean extends ITypeInfo {\n  example: boolean\n}\n\nexport interface ITypeInfoArray extends ITypeInfo {\n  item: IValueDescriptor\n}\n\nexport interface ITypeInfoRelatedNodes extends ITypeInfo {\n  nodes: { [key: string]: number }\n}\n\nexport interface ITypeInfoObject extends ITypeInfo {\n  dprops: {\n    [name: string]: IValueDescriptor\n  }\n}\n\nexport interface IValueDescriptor {\n  int?: ITypeInfoNumber\n  float?: ITypeInfoNumber\n  date?: ITypeInfoDate\n  string?: ITypeInfoString\n  boolean?: ITypeInfoBoolean\n  array?: ITypeInfoArray\n  relatedNode?: ITypeInfoRelatedNodes\n  relatedNodeList?: ITypeInfoRelatedNodes\n  object?: ITypeInfoObject\n}\n\nexport type ValueType = keyof IValueDescriptor\n\nexport interface ITypeMetadata {\n  typeName?: string\n  disabled?: boolean\n  ignored?: boolean\n  dirty?: boolean\n  total?: number\n  ignoredFields?: Set<string>\n  fieldMap?: Record<string, IValueDescriptor>\n  typeConflictReporter?: TypeConflictReporter\n  [key: string]: unknown\n}\n\ntype Operation = \"add\" | \"del\"\n\nconst getType = (value: unknown, key: string): ValueType | \"null\" => {\n  // Staying as close as possible to GraphQL types\n  switch (typeof value) {\n    case `number`:\n      return is32BitInteger(value) ? `int` : `float`\n    case `string`:\n      if (key.includes(`___NODE`)) {\n        return `relatedNode`\n      }\n      return looksLikeADate(value) ? `date` : `string`\n    case `boolean`:\n      return `boolean`\n    case `object`:\n      if (value === null) return `null`\n      if (value instanceof Date) return `date`\n      if (value instanceof String) return `string`\n      if (Array.isArray(value)) {\n        if (value.length === 0) {\n          return `null`\n        }\n        return key.includes(`___NODE`) ? `relatedNodeList` : `array`\n      }\n      if (!Object.keys(value).length) return `null`\n      return `object`\n    default:\n      // bigint, symbol, function, unknown (host objects in IE were typeof \"unknown\", for example)\n      return `null`\n  }\n}\n\nconst updateValueDescriptorObject = (\n  value: Record<string, unknown>,\n  typeInfo: ITypeInfoObject,\n  nodeId: string,\n  operation: Operation,\n  metadata: ITypeMetadata,\n  path: Array<Record<string, unknown>>\n): void => {\n  path.push(value)\n\n  const { dprops = {} } = typeInfo\n  typeInfo.dprops = dprops\n\n  Object.keys(value).forEach(key => {\n    const v = value[key]\n\n    let descriptor = dprops[key]\n    if (descriptor === undefined) {\n      descriptor = {}\n      dprops[key] = descriptor\n    }\n\n    updateValueDescriptor(nodeId, key, v, operation, descriptor, metadata, path)\n  })\n\n  path.pop()\n}\n\nconst updateValueDescriptorArray = (\n  value: Array<unknown>,\n  key: string,\n  typeInfo: ITypeInfoArray,\n  nodeId: string,\n  operation: Operation,\n  metadata: ITypeMetadata,\n  path: Array<Record<string, unknown>>\n): void => {\n  value.forEach(item => {\n    let descriptor = typeInfo.item\n    if (descriptor === undefined) {\n      descriptor = {}\n      typeInfo.item = descriptor\n    }\n\n    updateValueDescriptor(\n      nodeId,\n      key,\n      item,\n      operation,\n      descriptor,\n      metadata,\n      path\n    )\n  })\n}\n\nconst updateValueDescriptorRelNodes = (\n  listOfNodeIds: Array<string>,\n  delta: number,\n  operation: Operation,\n  typeInfo: ITypeInfoRelatedNodes,\n  metadata: ITypeMetadata\n): void => {\n  const { nodes = {} } = typeInfo\n  typeInfo.nodes = nodes\n\n  listOfNodeIds.forEach(nodeId => {\n    nodes[nodeId] = (nodes[nodeId] || 0) + delta\n\n    // Treat any new related node addition or removal as a structural change\n    // FIXME: this will produce false positives as this node can be\n    //  of the same type as another node already in the map (but we don't know it here)\n    if (nodes[nodeId] === 0 || (operation === `add` && nodes[nodeId] === 1)) {\n      metadata.dirty = true\n    }\n  })\n}\n\nconst updateValueDescriptorString = (\n  value: string,\n  delta: number,\n  typeInfo: ITypeInfoString\n): void => {\n  if (value === ``) {\n    const { empty = 0 } = typeInfo\n    typeInfo.empty = empty + delta\n  }\n  typeInfo.example =\n    typeof typeInfo.example !== `undefined` ? typeInfo.example : value\n}\n\nconst updateValueDescriptor = (\n  nodeId: string,\n  key: string,\n  value: unknown,\n  operation: Operation = `add`,\n  descriptor: IValueDescriptor,\n  metadata: ITypeMetadata,\n  path: Array<Record<string, unknown>>\n): void => {\n  // The object may be traversed multiple times from root.\n  // Each time it does it should not revisit the same node twice\n  if (path.includes(value as Record<string, unknown>)) {\n    return\n  }\n\n  const typeName = getType(value, key)\n\n  if (typeName === `null`) {\n    return\n  }\n\n  const delta = operation === `del` ? -1 : 1\n\n  let typeInfo: ITypeInfo | undefined = descriptor[typeName]\n  if (typeInfo === undefined) {\n    // eslint-disable-next-line no-undef\n    typeInfo = (descriptor[typeName] as ITypeInfo) = { total: 0 }\n  }\n  typeInfo.total += delta\n\n  // Keeping track of structural changes\n  // (when value of a new type is added or an existing type has no more values assigned)\n  if (typeInfo.total === 0 || (operation === `add` && typeInfo.total === 1)) {\n    metadata.dirty = true\n  }\n\n  // Keeping track of the first node for this type. Only used for better conflict reporting.\n  // (see Caveats section in the header comments)\n  if (operation === `add`) {\n    if (!typeInfo.first) {\n      typeInfo.first = nodeId\n    }\n  } else if (operation === `del`) {\n    if (typeInfo.first === nodeId || typeInfo.total === 0) {\n      typeInfo.first = undefined\n    }\n  }\n\n  switch (typeName) {\n    case `object`:\n      updateValueDescriptorObject(\n        value as Record<string, unknown>,\n        typeInfo as ITypeInfoObject,\n        nodeId,\n        operation,\n        metadata,\n        path\n      )\n      return\n    case `array`:\n      updateValueDescriptorArray(\n        value as Array<unknown>,\n        key,\n        typeInfo as ITypeInfoArray,\n        nodeId,\n        operation,\n        metadata,\n        path\n      )\n      return\n    case `relatedNode`:\n      updateValueDescriptorRelNodes(\n        [value as string],\n        delta,\n        operation,\n        typeInfo as ITypeInfoRelatedNodes,\n        metadata\n      )\n      return\n    case `relatedNodeList`:\n      updateValueDescriptorRelNodes(\n        value as Array<string>,\n        delta,\n        operation,\n        typeInfo as ITypeInfoRelatedNodes,\n        metadata\n      )\n      return\n    case `string`:\n      updateValueDescriptorString(\n        value as string,\n        delta,\n        typeInfo as ITypeInfoString\n      )\n      return\n  }\n\n  // int, float, boolean, null\n\n  typeInfo.example =\n    typeof typeInfo.example !== `undefined` ? typeInfo.example : value\n}\n\nconst mergeObjectKeys = (\n  dpropsKeysA: Record<string, unknown> = {},\n  dpropsKeysB: Record<string, unknown> = {}\n): Array<string> => {\n  const dprops = Object.keys(dpropsKeysA)\n  const otherProps = Object.keys(dpropsKeysB)\n  return [...new Set(dprops.concat(otherProps))]\n}\n\nconst descriptorsAreEqual = (\n  descriptor?: IValueDescriptor,\n  otherDescriptor?: IValueDescriptor\n): boolean => {\n  const types = possibleTypes(descriptor)\n  const otherTypes = possibleTypes(otherDescriptor)\n\n  const childDescriptorsAreEqual = (type: string): boolean => {\n    switch (type) {\n      case `array`:\n        return descriptorsAreEqual(\n          descriptor?.array?.item,\n          otherDescriptor?.array?.item\n        )\n      case `object`: {\n        const dpropsKeys = mergeObjectKeys(\n          descriptor?.object?.dprops,\n          otherDescriptor?.object?.dprops\n        )\n        return dpropsKeys.every(prop =>\n          descriptorsAreEqual(\n            descriptor?.object?.dprops[prop],\n            otherDescriptor?.object?.dprops[prop]\n          )\n        )\n      }\n      case `relatedNode`: {\n        const nodeIds = mergeObjectKeys(\n          descriptor?.relatedNode?.nodes,\n          otherDescriptor?.relatedNode?.nodes\n        )\n        // Must be present in both descriptors or absent in both\n        // in order to be considered equal\n        return nodeIds.every(\n          id =>\n            Boolean(descriptor?.relatedNode?.nodes[id]) ===\n            Boolean(otherDescriptor?.relatedNode?.nodes[id])\n        )\n      }\n      case `relatedNodeList`: {\n        const nodeIds = mergeObjectKeys(\n          descriptor?.relatedNodeList?.nodes,\n          otherDescriptor?.relatedNodeList?.nodes\n        )\n        return nodeIds.every(\n          id =>\n            Boolean(descriptor?.relatedNodeList?.nodes[id]) ===\n            Boolean(otherDescriptor?.relatedNodeList?.nodes[id])\n        )\n      }\n      default:\n        return true\n    }\n  }\n\n  // Equal when all possible types are equal (including conflicts)\n  return isEqual(types, otherTypes) && types.every(childDescriptorsAreEqual)\n}\n\nconst nodeFields = (node: Node, ignoredFields = new Set()): Array<string> =>\n  Object.keys(node).filter(key => !ignoredFields.has(key))\n\nconst updateTypeMetadata = (\n  metadata = initialMetadata(),\n  operation: Operation,\n  node: Node\n): ITypeMetadata => {\n  if (metadata.disabled) {\n    return metadata\n  }\n  metadata.total = (metadata.total || 0) + (operation === `add` ? 1 : -1)\n  if (metadata.ignored) {\n    return metadata\n  }\n  const { ignoredFields, fieldMap = {} } = metadata\n\n  nodeFields(node, ignoredFields).forEach(field => {\n    let descriptor = fieldMap[field]\n    if (descriptor === undefined) {\n      descriptor = {}\n      fieldMap[field] = descriptor\n    }\n\n    updateValueDescriptor(\n      node.id,\n      field,\n      node[field],\n      operation,\n      descriptor,\n      metadata,\n      []\n    )\n  })\n  metadata.fieldMap = fieldMap\n  return metadata\n}\n\nconst ignore = (metadata = initialMetadata(), set = true): ITypeMetadata => {\n  metadata.ignored = set\n  metadata.fieldMap = {}\n  return metadata\n}\n\nconst disable = (metadata = initialMetadata(), set = true): ITypeMetadata => {\n  metadata.disabled = set\n  return metadata\n}\n\nconst addNode = (metadata: ITypeMetadata, node: Node): ITypeMetadata =>\n  updateTypeMetadata(metadata, `add`, node)\n\nconst deleteNode = (metadata: ITypeMetadata, node: Node): ITypeMetadata =>\n  updateTypeMetadata(metadata, `del`, node)\n\nconst addNodes = (\n  metadata = initialMetadata(),\n  nodes: Iterable<Node>\n): ITypeMetadata => {\n  let state = metadata\n  for (const node of nodes) {\n    state = addNode(state, node)\n  }\n  return state\n}\n\nconst possibleTypes = (descriptor: IValueDescriptor = {}): Array<ValueType> =>\n  Object.keys(descriptor).filter(\n    type => descriptor[type].total > 0\n  ) as Array<ValueType>\n\nconst isEmpty = ({ fieldMap }): boolean =>\n  Object.keys(fieldMap).every(\n    field => possibleTypes(fieldMap[field]).length === 0\n  )\n\n// Even empty type may still have nodes\nconst hasNodes = (typeMetadata: ITypeMetadata): boolean =>\n  (typeMetadata.total ?? 0) > 0\n\nconst haveEqualFields = (\n  { fieldMap = {} } = {},\n  { fieldMap: otherFieldMap = {} } = {}\n): boolean => {\n  const fields = mergeObjectKeys(fieldMap, otherFieldMap)\n  return fields.every(field =>\n    descriptorsAreEqual(fieldMap[field], otherFieldMap[field])\n  )\n}\n\nconst initialMetadata = (state?: Record<string, unknown>): ITypeMetadata => {\n  return {\n    typeName: undefined,\n    disabled: false,\n    ignored: false,\n    dirty: false,\n    total: 0,\n    ignoredFields: undefined,\n    fieldMap: {},\n    ...state,\n  }\n}\n\nexport {\n  addNode,\n  addNodes,\n  deleteNode,\n  ignore,\n  disable,\n  isEmpty,\n  hasNodes,\n  haveEqualFields,\n  initialMetadata,\n}\n"],"mappings":";;;;;;AA4DA;AACA;AAqEA,MAAMA,OAAO,GAAG,CAACC,KAAc,EAAEC,GAAW,KAAyB;EACnE;EACA,QAAQ,OAAOD,KAAK;IAClB,KAAM,QAAO;MACX,OAAO,IAAAE,8BAAc,EAACF,KAAK,CAAC,GAAI,KAAI,GAAI,OAAM;IAChD,KAAM,QAAO;MACX,IAAIC,GAAG,CAACE,QAAQ,CAAE,SAAQ,CAAC,EAAE;QAC3B,OAAQ,aAAY;MACtB;MACA,OAAO,IAAAC,oBAAc,EAACJ,KAAK,CAAC,GAAI,MAAK,GAAI,QAAO;IAClD,KAAM,SAAQ;MACZ,OAAQ,SAAQ;IAClB,KAAM,QAAO;MACX,IAAIA,KAAK,KAAK,IAAI,EAAE,OAAQ,MAAK;MACjC,IAAIA,KAAK,YAAYK,IAAI,EAAE,OAAQ,MAAK;MACxC,IAAIL,KAAK,YAAYM,MAAM,EAAE,OAAQ,QAAO;MAC5C,IAAIC,KAAK,CAACC,OAAO,CAACR,KAAK,CAAC,EAAE;QACxB,IAAIA,KAAK,CAACS,MAAM,KAAK,CAAC,EAAE;UACtB,OAAQ,MAAK;QACf;QACA,OAAOR,GAAG,CAACE,QAAQ,CAAE,SAAQ,CAAC,GAAI,iBAAgB,GAAI,OAAM;MAC9D;MACA,IAAI,CAACO,MAAM,CAACC,IAAI,CAACX,KAAK,CAAC,CAACS,MAAM,EAAE,OAAQ,MAAK;MAC7C,OAAQ,QAAO;IACjB;MACE;MACA,OAAQ,MAAK;EAAA;AAEnB,CAAC;AAED,MAAMG,2BAA2B,GAAG,CAClCZ,KAA8B,EAC9Ba,QAAyB,EACzBC,MAAc,EACdC,SAAoB,EACpBC,QAAuB,EACvBC,IAAoC,KAC3B;EACTA,IAAI,CAACC,IAAI,CAAClB,KAAK,CAAC;EAEhB,MAAM;IAAEmB,MAAM,GAAG,CAAC;EAAE,CAAC,GAAGN,QAAQ;EAChCA,QAAQ,CAACM,MAAM,GAAGA,MAAM;EAExBT,MAAM,CAACC,IAAI,CAACX,KAAK,CAAC,CAACoB,OAAO,CAACnB,GAAG,IAAI;IAChC,MAAMoB,CAAC,GAAGrB,KAAK,CAACC,GAAG,CAAC;IAEpB,IAAIqB,UAAU,GAAGH,MAAM,CAAClB,GAAG,CAAC;IAC5B,IAAIqB,UAAU,KAAKC,SAAS,EAAE;MAC5BD,UAAU,GAAG,CAAC,CAAC;MACfH,MAAM,CAAClB,GAAG,CAAC,GAAGqB,UAAU;IAC1B;IAEAE,qBAAqB,CAACV,MAAM,EAAEb,GAAG,EAAEoB,CAAC,EAAEN,SAAS,EAAEO,UAAU,EAAEN,QAAQ,EAAEC,IAAI,CAAC;EAC9E,CAAC,CAAC;EAEFA,IAAI,CAACQ,GAAG,EAAE;AACZ,CAAC;AAED,MAAMC,0BAA0B,GAAG,CACjC1B,KAAqB,EACrBC,GAAW,EACXY,QAAwB,EACxBC,MAAc,EACdC,SAAoB,EACpBC,QAAuB,EACvBC,IAAoC,KAC3B;EACTjB,KAAK,CAACoB,OAAO,CAACO,IAAI,IAAI;IACpB,IAAIL,UAAU,GAAGT,QAAQ,CAACc,IAAI;IAC9B,IAAIL,UAAU,KAAKC,SAAS,EAAE;MAC5BD,UAAU,GAAG,CAAC,CAAC;MACfT,QAAQ,CAACc,IAAI,GAAGL,UAAU;IAC5B;IAEAE,qBAAqB,CACnBV,MAAM,EACNb,GAAG,EACH0B,IAAI,EACJZ,SAAS,EACTO,UAAU,EACVN,QAAQ,EACRC,IAAI,CACL;EACH,CAAC,CAAC;AACJ,CAAC;AAED,MAAMW,6BAA6B,GAAG,CACpCC,aAA4B,EAC5BC,KAAa,EACbf,SAAoB,EACpBF,QAA+B,EAC/BG,QAAuB,KACd;EACT,MAAM;IAAEe,KAAK,GAAG,CAAC;EAAE,CAAC,GAAGlB,QAAQ;EAC/BA,QAAQ,CAACkB,KAAK,GAAGA,KAAK;EAEtBF,aAAa,CAACT,OAAO,CAACN,MAAM,IAAI;IAC9BiB,KAAK,CAACjB,MAAM,CAAC,GAAG,CAACiB,KAAK,CAACjB,MAAM,CAAC,IAAI,CAAC,IAAIgB,KAAK;;IAE5C;IACA;IACA;IACA,IAAIC,KAAK,CAACjB,MAAM,CAAC,KAAK,CAAC,IAAKC,SAAS,KAAM,KAAI,IAAIgB,KAAK,CAACjB,MAAM,CAAC,KAAK,CAAE,EAAE;MACvEE,QAAQ,CAACgB,KAAK,GAAG,IAAI;IACvB;EACF,CAAC,CAAC;AACJ,CAAC;AAED,MAAMC,2BAA2B,GAAG,CAClCjC,KAAa,EACb8B,KAAa,EACbjB,QAAyB,KAChB;EACT,IAAIb,KAAK,KAAM,EAAC,EAAE;IAChB,MAAM;MAAEkC,KAAK,GAAG;IAAE,CAAC,GAAGrB,QAAQ;IAC9BA,QAAQ,CAACqB,KAAK,GAAGA,KAAK,GAAGJ,KAAK;EAChC;EACAjB,QAAQ,CAACsB,OAAO,GACd,OAAOtB,QAAQ,CAACsB,OAAO,KAAM,WAAU,GAAGtB,QAAQ,CAACsB,OAAO,GAAGnC,KAAK;AACtE,CAAC;AAED,MAAMwB,qBAAqB,GAAG,CAC5BV,MAAc,EACdb,GAAW,EACXD,KAAc,EACde,SAAoB,GAAI,KAAI,EAC5BO,UAA4B,EAC5BN,QAAuB,EACvBC,IAAoC,KAC3B;EACT;EACA;EACA,IAAIA,IAAI,CAACd,QAAQ,CAACH,KAAK,CAA4B,EAAE;IACnD;EACF;EAEA,MAAMoC,QAAQ,GAAGrC,OAAO,CAACC,KAAK,EAAEC,GAAG,CAAC;EAEpC,IAAImC,QAAQ,KAAM,MAAK,EAAE;IACvB;EACF;EAEA,MAAMN,KAAK,GAAGf,SAAS,KAAM,KAAI,GAAG,CAAC,CAAC,GAAG,CAAC;EAE1C,IAAIF,QAA+B,GAAGS,UAAU,CAACc,QAAQ,CAAC;EAC1D,IAAIvB,QAAQ,KAAKU,SAAS,EAAE;IAC1B;IACAV,QAAQ,GAAIS,UAAU,CAACc,QAAQ,CAAC,GAAiB;MAAEC,KAAK,EAAE;IAAE,CAAC;EAC/D;EACAxB,QAAQ,CAACwB,KAAK,IAAIP,KAAK;;EAEvB;EACA;EACA,IAAIjB,QAAQ,CAACwB,KAAK,KAAK,CAAC,IAAKtB,SAAS,KAAM,KAAI,IAAIF,QAAQ,CAACwB,KAAK,KAAK,CAAE,EAAE;IACzErB,QAAQ,CAACgB,KAAK,GAAG,IAAI;EACvB;;EAEA;EACA;EACA,IAAIjB,SAAS,KAAM,KAAI,EAAE;IACvB,IAAI,CAACF,QAAQ,CAACyB,KAAK,EAAE;MACnBzB,QAAQ,CAACyB,KAAK,GAAGxB,MAAM;IACzB;EACF,CAAC,MAAM,IAAIC,SAAS,KAAM,KAAI,EAAE;IAC9B,IAAIF,QAAQ,CAACyB,KAAK,KAAKxB,MAAM,IAAID,QAAQ,CAACwB,KAAK,KAAK,CAAC,EAAE;MACrDxB,QAAQ,CAACyB,KAAK,GAAGf,SAAS;IAC5B;EACF;EAEA,QAAQa,QAAQ;IACd,KAAM,QAAO;MACXxB,2BAA2B,CACzBZ,KAAK,EACLa,QAAQ,EACRC,MAAM,EACNC,SAAS,EACTC,QAAQ,EACRC,IAAI,CACL;MACD;IACF,KAAM,OAAM;MACVS,0BAA0B,CACxB1B,KAAK,EACLC,GAAG,EACHY,QAAQ,EACRC,MAAM,EACNC,SAAS,EACTC,QAAQ,EACRC,IAAI,CACL;MACD;IACF,KAAM,aAAY;MAChBW,6BAA6B,CAC3B,CAAC5B,KAAK,CAAW,EACjB8B,KAAK,EACLf,SAAS,EACTF,QAAQ,EACRG,QAAQ,CACT;MACD;IACF,KAAM,iBAAgB;MACpBY,6BAA6B,CAC3B5B,KAAK,EACL8B,KAAK,EACLf,SAAS,EACTF,QAAQ,EACRG,QAAQ,CACT;MACD;IACF,KAAM,QAAO;MACXiB,2BAA2B,CACzBjC,KAAK,EACL8B,KAAK,EACLjB,QAAQ,CACT;MACD;EAAM;;EAGV;;EAEAA,QAAQ,CAACsB,OAAO,GACd,OAAOtB,QAAQ,CAACsB,OAAO,KAAM,WAAU,GAAGtB,QAAQ,CAACsB,OAAO,GAAGnC,KAAK;AACtE,CAAC;AAED,MAAMuC,eAAe,GAAG,CACtBC,WAAoC,GAAG,CAAC,CAAC,EACzCC,WAAoC,GAAG,CAAC,CAAC,KACvB;EAClB,MAAMtB,MAAM,GAAGT,MAAM,CAACC,IAAI,CAAC6B,WAAW,CAAC;EACvC,MAAME,UAAU,GAAGhC,MAAM,CAACC,IAAI,CAAC8B,WAAW,CAAC;EAC3C,OAAO,CAAC,GAAG,IAAIE,GAAG,CAACxB,MAAM,CAACyB,MAAM,CAACF,UAAU,CAAC,CAAC,CAAC;AAChD,CAAC;AAED,MAAMG,mBAAmB,GAAG,CAC1BvB,UAA6B,EAC7BwB,eAAkC,KACtB;EACZ,MAAMC,KAAK,GAAGC,aAAa,CAAC1B,UAAU,CAAC;EACvC,MAAM2B,UAAU,GAAGD,aAAa,CAACF,eAAe,CAAC;EAEjD,MAAMI,wBAAwB,GAAIC,IAAY,IAAc;IAAA;IAC1D,QAAQA,IAAI;MACV,KAAM,OAAM;QACV,OAAON,mBAAmB,CACxBvB,UAAU,aAAVA,UAAU,4CAAVA,UAAU,CAAE8B,KAAK,sDAAjB,kBAAmBzB,IAAI,EACvBmB,eAAe,aAAfA,eAAe,gDAAfA,eAAe,CAAEM,KAAK,0DAAtB,sBAAwBzB,IAAI,CAC7B;MACH,KAAM,QAAO;QAAE;UAAA;UACb,MAAM0B,UAAU,GAAGd,eAAe,CAChCjB,UAAU,aAAVA,UAAU,6CAAVA,UAAU,CAAEgC,MAAM,uDAAlB,mBAAoBnC,MAAM,EAC1B2B,eAAe,aAAfA,eAAe,gDAAfA,eAAe,CAAEQ,MAAM,0DAAvB,sBAAyBnC,MAAM,CAChC;UACD,OAAOkC,UAAU,CAACE,KAAK,CAACC,IAAI;YAAA;YAAA,OAC1BX,mBAAmB,CACjBvB,UAAU,aAAVA,UAAU,8CAAVA,UAAU,CAAEgC,MAAM,wDAAlB,oBAAoBnC,MAAM,CAACqC,IAAI,CAAC,EAChCV,eAAe,aAAfA,eAAe,iDAAfA,eAAe,CAAEQ,MAAM,2DAAvB,uBAAyBnC,MAAM,CAACqC,IAAI,CAAC,CACtC;UAAA,EACF;QACH;MACA,KAAM,aAAY;QAAE;UAAA;UAClB,MAAMC,OAAO,GAAGlB,eAAe,CAC7BjB,UAAU,aAAVA,UAAU,gDAAVA,UAAU,CAAEoC,WAAW,0DAAvB,sBAAyB3B,KAAK,EAC9Be,eAAe,aAAfA,eAAe,gDAAfA,eAAe,CAAEY,WAAW,0DAA5B,sBAA8B3B,KAAK,CACpC;UACD;UACA;UACA,OAAO0B,OAAO,CAACF,KAAK,CAClBI,EAAE;YAAA;YAAA,OACAC,OAAO,CAACtC,UAAU,aAAVA,UAAU,iDAAVA,UAAU,CAAEoC,WAAW,2DAAvB,uBAAyB3B,KAAK,CAAC4B,EAAE,CAAC,CAAC,KAC3CC,OAAO,CAACd,eAAe,aAAfA,eAAe,iDAAfA,eAAe,CAAEY,WAAW,2DAA5B,uBAA8B3B,KAAK,CAAC4B,EAAE,CAAC,CAAC;UAAA,EACnD;QACH;MACA,KAAM,iBAAgB;QAAE;UAAA;UACtB,MAAMF,OAAO,GAAGlB,eAAe,CAC7BjB,UAAU,aAAVA,UAAU,iDAAVA,UAAU,CAAEuC,eAAe,2DAA3B,uBAA6B9B,KAAK,EAClCe,eAAe,aAAfA,eAAe,iDAAfA,eAAe,CAAEe,eAAe,2DAAhC,uBAAkC9B,KAAK,CACxC;UACD,OAAO0B,OAAO,CAACF,KAAK,CAClBI,EAAE;YAAA;YAAA,OACAC,OAAO,CAACtC,UAAU,aAAVA,UAAU,iDAAVA,UAAU,CAAEuC,eAAe,2DAA3B,uBAA6B9B,KAAK,CAAC4B,EAAE,CAAC,CAAC,KAC/CC,OAAO,CAACd,eAAe,aAAfA,eAAe,iDAAfA,eAAe,CAAEe,eAAe,2DAAhC,uBAAkC9B,KAAK,CAAC4B,EAAE,CAAC,CAAC;UAAA,EACvD;QACH;MACA;QACE,OAAO,IAAI;IAAA;EAEjB,CAAC;;EAED;EACA,OAAO,uBAAQZ,KAAK,EAAEE,UAAU,CAAC,IAAIF,KAAK,CAACQ,KAAK,CAACL,wBAAwB,CAAC;AAC5E,CAAC;AAED,MAAMY,UAAU,GAAG,CAACC,IAAU,EAAEC,aAAa,GAAG,IAAIrB,GAAG,EAAE,KACvDjC,MAAM,CAACC,IAAI,CAACoD,IAAI,CAAC,CAACE,MAAM,CAAChE,GAAG,IAAI,CAAC+D,aAAa,CAACE,GAAG,CAACjE,GAAG,CAAC,CAAC;AAE1D,MAAMkE,kBAAkB,GAAG,CACzBnD,QAAQ,GAAGoD,eAAe,EAAE,EAC5BrD,SAAoB,EACpBgD,IAAU,KACQ;EAClB,IAAI/C,QAAQ,CAACqD,QAAQ,EAAE;IACrB,OAAOrD,QAAQ;EACjB;EACAA,QAAQ,CAACqB,KAAK,GAAG,CAACrB,QAAQ,CAACqB,KAAK,IAAI,CAAC,KAAKtB,SAAS,KAAM,KAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;EACvE,IAAIC,QAAQ,CAACsD,OAAO,EAAE;IACpB,OAAOtD,QAAQ;EACjB;EACA,MAAM;IAAEgD,aAAa;IAAEO,QAAQ,GAAG,CAAC;EAAE,CAAC,GAAGvD,QAAQ;EAEjD8C,UAAU,CAACC,IAAI,EAAEC,aAAa,CAAC,CAAC5C,OAAO,CAACoD,KAAK,IAAI;IAC/C,IAAIlD,UAAU,GAAGiD,QAAQ,CAACC,KAAK,CAAC;IAChC,IAAIlD,UAAU,KAAKC,SAAS,EAAE;MAC5BD,UAAU,GAAG,CAAC,CAAC;MACfiD,QAAQ,CAACC,KAAK,CAAC,GAAGlD,UAAU;IAC9B;IAEAE,qBAAqB,CACnBuC,IAAI,CAACJ,EAAE,EACPa,KAAK,EACLT,IAAI,CAACS,KAAK,CAAC,EACXzD,SAAS,EACTO,UAAU,EACVN,QAAQ,EACR,EAAE,CACH;EACH,CAAC,CAAC;EACFA,QAAQ,CAACuD,QAAQ,GAAGA,QAAQ;EAC5B,OAAOvD,QAAQ;AACjB,CAAC;AAED,MAAMyD,MAAM,GAAG,CAACzD,QAAQ,GAAGoD,eAAe,EAAE,EAAEM,GAAG,GAAG,IAAI,KAAoB;EAC1E1D,QAAQ,CAACsD,OAAO,GAAGI,GAAG;EACtB1D,QAAQ,CAACuD,QAAQ,GAAG,CAAC,CAAC;EACtB,OAAOvD,QAAQ;AACjB,CAAC;AAAA;AAED,MAAM2D,OAAO,GAAG,CAAC3D,QAAQ,GAAGoD,eAAe,EAAE,EAAEM,GAAG,GAAG,IAAI,KAAoB;EAC3E1D,QAAQ,CAACqD,QAAQ,GAAGK,GAAG;EACvB,OAAO1D,QAAQ;AACjB,CAAC;AAAA;AAED,MAAM4D,OAAO,GAAG,CAAC5D,QAAuB,EAAE+C,IAAU,KAClDI,kBAAkB,CAACnD,QAAQ,EAAG,KAAI,EAAE+C,IAAI,CAAC;AAAA;AAE3C,MAAMc,UAAU,GAAG,CAAC7D,QAAuB,EAAE+C,IAAU,KACrDI,kBAAkB,CAACnD,QAAQ,EAAG,KAAI,EAAE+C,IAAI,CAAC;AAAA;AAE3C,MAAMe,QAAQ,GAAG,CACf9D,QAAQ,GAAGoD,eAAe,EAAE,EAC5BrC,KAAqB,KACH;EAClB,IAAIgD,KAAK,GAAG/D,QAAQ;EACpB,KAAK,MAAM+C,IAAI,IAAIhC,KAAK,EAAE;IACxBgD,KAAK,GAAGH,OAAO,CAACG,KAAK,EAAEhB,IAAI,CAAC;EAC9B;EACA,OAAOgB,KAAK;AACd,CAAC;AAAA;AAED,MAAM/B,aAAa,GAAG,CAAC1B,UAA4B,GAAG,CAAC,CAAC,KACtDZ,MAAM,CAACC,IAAI,CAACW,UAAU,CAAC,CAAC2C,MAAM,CAC5Bd,IAAI,IAAI7B,UAAU,CAAC6B,IAAI,CAAC,CAACd,KAAK,GAAG,CAAC,CACf;AAEvB,MAAM2C,OAAO,GAAG,CAAC;EAAET;AAAS,CAAC,KAC3B7D,MAAM,CAACC,IAAI,CAAC4D,QAAQ,CAAC,CAAChB,KAAK,CACzBiB,KAAK,IAAIxB,aAAa,CAACuB,QAAQ,CAACC,KAAK,CAAC,CAAC,CAAC/D,MAAM,KAAK,CAAC,CACrD;;AAEH;AAAA;AACA,MAAMwE,QAAQ,GAAIC,YAA2B;EAAA;EAAA,OAC3C,wBAACA,YAAY,CAAC7C,KAAK,qEAAI,CAAC,IAAI,CAAC;AAAA;AAAA;AAE/B,MAAM8C,eAAe,GAAG,CACtB;EAAEZ,QAAQ,GAAG,CAAC;AAAE,CAAC,GAAG,CAAC,CAAC,EACtB;EAAEA,QAAQ,EAAEa,aAAa,GAAG,CAAC;AAAE,CAAC,GAAG,CAAC,CAAC,KACzB;EACZ,MAAMC,MAAM,GAAG9C,eAAe,CAACgC,QAAQ,EAAEa,aAAa,CAAC;EACvD,OAAOC,MAAM,CAAC9B,KAAK,CAACiB,KAAK,IACvB3B,mBAAmB,CAAC0B,QAAQ,CAACC,KAAK,CAAC,EAAEY,aAAa,CAACZ,KAAK,CAAC,CAAC,CAC3D;AACH,CAAC;AAAA;AAED,MAAMJ,eAAe,GAAIW,KAA+B,IAAoB;EAC1E,OAAO;IACL3C,QAAQ,EAAEb,SAAS;IACnB8C,QAAQ,EAAE,KAAK;IACfC,OAAO,EAAE,KAAK;IACdtC,KAAK,EAAE,KAAK;IACZK,KAAK,EAAE,CAAC;IACR2B,aAAa,EAAEzC,SAAS;IACxBgD,QAAQ,EAAE,CAAC,CAAC;IACZ,GAAGQ;EACL,CAAC;AACH,CAAC;AAAA"}

package/dist/schema/infer/is-file.d.ts

@@ -0,0 +1 @@
+export declare const isFile: (fieldPath: string, relativePath: string) => boolean;

package/dist/schema/infer/is-file.js

@@ -0,0 +1,65 @@
+"use strict";
+
+var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
+exports.__esModule = true;
+exports.isFile = void 0;
+var _path = _interopRequireDefault(require("path"));
+var _gatsbyCoreUtils = require("gatsby-core-utils");
+var _mime = _interopRequireDefault(require("mime"));
+var _isRelative = _interopRequireDefault(require("is-relative"));
+var _isRelativeUrl = _interopRequireDefault(require("is-relative-url"));
+var _getValueAt = require("../../utils/get-value-at");
+var _datastore = require("../../datastore");
+const getFirstValueAt = (node, selector) => {
+  let value = (0, _getValueAt.getValueAt)(node, selector);
+  while (Array.isArray(value)) {
+    value = value[0];
+  }
+  return value;
+};
+const withBaseDir = dir => p => _path.default.posix.join(dir, (0, _gatsbyCoreUtils.slash)(p));
+const findAncestorNode = (childNode, predicate) => {
+  let node = childNode;
+  do {
+    if (predicate(node)) {
+      return node;
+    }
+    node = (0, _datastore.getNode)(node.parent);
+  } while (node !== undefined);
+  return null;
+};
+const getBaseDir = node => {
+  if (node) {
+    const {
+      dir
+    } = findAncestorNode(node, node => node.internal.type === `File`) || {
+      dir: ``
+    };
+    return typeof dir === `string` ? dir : null;
+  }
+  return null;
+};
+const getAbsolutePath = (node, relativePath) => {
+  const dir = getBaseDir(node);
+  const withDir = withBaseDir(dir !== null && dir !== void 0 ? dir : ``);
+  return dir ? Array.isArray(relativePath) ? relativePath.map(withDir) : withDir(relativePath) : null;
+};
+const getFilePath = (fieldPath, relativePath) => {
+  const [typeName, ...selector] = Array.isArray(fieldPath) ? fieldPath : fieldPath.split(`.`);
+  if (typeName === `File`) return null;
+  const looksLikeFile = !_path.default.isAbsolute(relativePath) && _mime.default.getType(relativePath) !== null &&
+  // FIXME: Do we need all of this?
+  _mime.default.getType(relativePath) !== `application/x-msdownload` && (0, _isRelative.default)(relativePath) && (0, _isRelativeUrl.default)(relativePath);
+  if (!looksLikeFile) return null;
+  const normalizedPath = (0, _gatsbyCoreUtils.slash)(relativePath);
+  const node = (0, _datastore.getNodesByType)(typeName).find(node => getFirstValueAt(node, selector) === normalizedPath);
+  return node ? getAbsolutePath(node, normalizedPath) : null;
+};
+const isFile = (fieldPath, relativePath) => {
+  const filePath = getFilePath(fieldPath, relativePath);
+  if (!filePath) return false;
+  const filePathExists = (0, _datastore.getNodesByType)(`File`).some(node => node.absolutePath === filePath);
+  return filePathExists;
+};
+exports.isFile = isFile;
+//# sourceMappingURL=is-file.js.map