@sanity/cli 6.0.0-alpha.9 → 6.1.0

package/dist/actions/documents/validation/reporters/prettyReporter/formatDocumentValidation.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../../../../../src/actions/documents/validation/reporters/prettyReporter/formatDocumentValidation.ts"],"sourcesContent":["import {styleText} from 'node:util'\n\nimport {convertToTree, formatTree, maxKeyLength, type Tree} from '@sanity/cli-core/tree'\nimport {logSymbols} from '@sanity/cli-core/ux'\nimport {type Path, type ValidationMarker} from '@sanity/types'\n\nimport {Level} from '../../../types'\nimport {type DocumentValidationResult, isTty, levelValues} from './util.js'\n\ninterface FormatDocumentValidationOptions extends DocumentValidationResult {\n  basePath?: string\n  studioHost?: string\n}\n\ninterface Marker extends Pick<ValidationMarker, 'level' | 'message'> {\n  path: Path\n}\n\ntype ValidationTree = Tree<Marker>\n\nconst levelHeaders = {\n  error: isTty\n    ? styleText('bold', styleText('bgRed', styleText('black', ' ERROR ')))\n    : styleText('red', '[ERROR]'),\n  info: isTty\n    ? styleText('bold', styleText('cyan', styleText('black', ' INFO ')))\n    : styleText('cyan', '[INFO]'),\n  warning: isTty\n    ? styleText('bold', styleText('bgYellow', styleText('black', ' WARN ')))\n    : styleText('yellow', '[WARN]'),\n}\n/**\n * Creates a terminal hyperlink. Only outputs a hyperlink if the output is\n * determined to be a TTY\n */\nconst link = (linkText: string, url: string) =>\n  isTty ? `\\u001B]8;;${url}\\u0007${linkText}\\u001B]8;;\\u0007` : styleText('underline', linkText)\n\n/**\n * For sorting markers\n */\nconst compareLevels = <T extends {level: Level; message: string}>(a: T, b: T) =>\n  levelValues[a.level] - levelValues[b.level]\n\n/**\n * Formats the markers at the root of the validation tree\n */\nconst formatRootErrors = (root: ValidationTree, hasChildren: boolean, paddingLength: number) => {\n  if (!root.nodes) return ''\n\n  const [first, ...rest] = [...root.nodes].toSorted(compareLevels)\n  if (!first) return ''\n\n  const firstElbow = hasChildren ? '│ ' : '└─'\n  const firstPadding = '.'.repeat(paddingLength - 6)\n  const firstLine = `${firstElbow} (root) ${firstPadding} ${logSymbols[first.level]} ${\n    first.message\n  }`\n  const subsequentPadding = ' '.repeat(paddingLength + 2)\n  const subsequentElbow = hasChildren ? '│ ' : '  '\n\n  const restOfLines = rest\n    .map(\n      (marker) =>\n        `${subsequentElbow}${subsequentPadding} ${logSymbols[marker.level]} ${marker.message}`,\n    )\n    .join('\\n')\n  return [firstLine, restOfLines].filter(Boolean).join('\\n')\n}\n\n/**\n * Formats document validation results into a user-friendly tree structure\n */\nexport function formatDocumentValidation({\n  documentId,\n  documentType,\n  intentUrl,\n  level,\n  markers,\n}: FormatDocumentValidationOptions): string {\n  const tree = convertToTree<Marker>(markers)\n\n  const documentTypeHeader = isTty\n    ? styleText('bgWhite', styleText('black', ` ${documentType} `))\n    : `[${documentType}]`\n\n  const header = `${levelHeaders[level]} ${documentTypeHeader} ${\n    intentUrl ? link(documentId, intentUrl) : styleText('underline', documentId)\n  }`\n\n  const paddingLength = Math.max(maxKeyLength(tree.children) + 2, 30)\n\n  const childErrors = formatTree<Marker>({\n    getMessage: (marker) => [logSymbols[marker.level], marker.message].join(' '),\n    getNodes: ({nodes}) => [...(nodes ?? [])].toSorted(compareLevels),\n    node: tree.children,\n    paddingLength,\n  })\n\n  const rootErrors = formatRootErrors(tree, childErrors.length > 0, paddingLength)\n\n  return [header, rootErrors, childErrors].filter(Boolean).join('\\n')\n}\n"],"names":["styleText","convertToTree","formatTree","maxKeyLength","logSymbols","isTty","levelValues","levelHeaders","error","info","warning","link","linkText","url","compareLevels","a","b","level","formatRootErrors","root","hasChildren","paddingLength","nodes","first","rest","toSorted","firstElbow","firstPadding","repeat","firstLine","message","subsequentPadding","subsequentElbow","restOfLines","map","marker","join","filter","Boolean","formatDocumentValidation","documentId","documentType","intentUrl","markers","tree","documentTypeHeader","header","Math","max","children","childErrors","getMessage","getNodes","node","rootErrors","length"],"mappings":"AAAA,SAAQA,SAAS,QAAO,YAAW;AAEnC,SAAQC,aAAa,EAAEC,UAAU,EAAEC,YAAY,QAAkB,wBAAuB;AACxF,SAAQC,UAAU,QAAO,sBAAqB;AAI9C,SAAuCC,KAAK,EAAEC,WAAW,QAAO,YAAW;AAa3E,MAAMC,eAAe;IACnBC,OAAOH,QACHL,UAAU,QAAQA,UAAU,SAASA,UAAU,SAAS,eACxDA,UAAU,OAAO;IACrBS,MAAMJ,QACFL,UAAU,QAAQA,UAAU,QAAQA,UAAU,SAAS,cACvDA,UAAU,QAAQ;IACtBU,SAASL,QACLL,UAAU,QAAQA,UAAU,YAAYA,UAAU,SAAS,cAC3DA,UAAU,UAAU;AAC1B;AACA;;;CAGC,GACD,MAAMW,OAAO,CAACC,UAAkBC,MAC9BR,QAAQ,CAAC,UAAU,EAAEQ,IAAI,MAAM,EAAED,SAAS,gBAAgB,CAAC,GAAGZ,UAAU,aAAaY;AAEvF;;CAEC,GACD,MAAME,gBAAgB,CAA4CC,GAAMC,IACtEV,WAAW,CAACS,EAAEE,KAAK,CAAC,GAAGX,WAAW,CAACU,EAAEC,KAAK,CAAC;AAE7C;;CAEC,GACD,MAAMC,mBAAmB,CAACC,MAAsBC,aAAsBC;IACpE,IAAI,CAACF,KAAKG,KAAK,EAAE,OAAO;IAExB,MAAM,CAACC,OAAO,GAAGC,KAAK,GAAG;WAAIL,KAAKG,KAAK;KAAC,CAACG,QAAQ,CAACX;IAClD,IAAI,CAACS,OAAO,OAAO;IAEnB,MAAMG,aAAaN,cAAc,OAAO;IACxC,MAAMO,eAAe,IAAIC,MAAM,CAACP,gBAAgB;IAChD,MAAMQ,YAAY,GAAGH,WAAW,QAAQ,EAAEC,aAAa,CAAC,EAAEvB,UAAU,CAACmB,MAAMN,KAAK,CAAC,CAAC,CAAC,EACjFM,MAAMO,OAAO,EACb;IACF,MAAMC,oBAAoB,IAAIH,MAAM,CAACP,gBAAgB;IACrD,MAAMW,kBAAkBZ,cAAc,OAAO;IAE7C,MAAMa,cAAcT,KACjBU,GAAG,CACF,CAACC,SACC,GAAGH,kBAAkBD,kBAAkB,CAAC,EAAE3B,UAAU,CAAC+B,OAAOlB,KAAK,CAAC,CAAC,CAAC,EAAEkB,OAAOL,OAAO,EAAE,EAEzFM,IAAI,CAAC;IACR,OAAO;QAACP;QAAWI;KAAY,CAACI,MAAM,CAACC,SAASF,IAAI,CAAC;AACvD;AAEA;;CAEC,GACD,OAAO,SAASG,yBAAyB,EACvCC,UAAU,EACVC,YAAY,EACZC,SAAS,EACTzB,KAAK,EACL0B,OAAO,EACyB;IAChC,MAAMC,OAAO3C,cAAsB0C;IAEnC,MAAME,qBAAqBxC,QACvBL,UAAU,WAAWA,UAAU,SAAS,CAAC,CAAC,EAAEyC,aAAa,CAAC,CAAC,KAC3D,CAAC,CAAC,EAAEA,aAAa,CAAC,CAAC;IAEvB,MAAMK,SAAS,GAAGvC,YAAY,CAACU,MAAM,CAAC,CAAC,EAAE4B,mBAAmB,CAAC,EAC3DH,YAAY/B,KAAK6B,YAAYE,aAAa1C,UAAU,aAAawC,aACjE;IAEF,MAAMnB,gBAAgB0B,KAAKC,GAAG,CAAC7C,aAAayC,KAAKK,QAAQ,IAAI,GAAG;IAEhE,MAAMC,cAAchD,WAAmB;QACrCiD,YAAY,CAAChB,SAAW;gBAAC/B,UAAU,CAAC+B,OAAOlB,KAAK,CAAC;gBAAEkB,OAAOL,OAAO;aAAC,CAACM,IAAI,CAAC;QACxEgB,UAAU,CAAC,EAAC9B,KAAK,EAAC,GAAK;mBAAKA,SAAS,EAAE;aAAE,CAACG,QAAQ,CAACX;QACnDuC,MAAMT,KAAKK,QAAQ;QACnB5B;IACF;IAEA,MAAMiC,aAAapC,iBAAiB0B,MAAMM,YAAYK,MAAM,GAAG,GAAGlC;IAElE,OAAO;QAACyB;QAAQQ;QAAYJ;KAAY,CAACb,MAAM,CAACC,SAASF,IAAI,CAAC;AAChE"}
+{"version":3,"sources":["../../../../../../src/actions/documents/validation/reporters/prettyReporter/formatDocumentValidation.ts"],"sourcesContent":["import {styleText} from 'node:util'\n\nimport {logSymbols} from '@sanity/cli-core/ux'\nimport {type Path, type ValidationMarker} from '@sanity/types'\n\nimport {Level} from '../../../types'\nimport {convertToTree, formatTree, maxKeyLength, type Tree} from './tree.js'\nimport {type DocumentValidationResult, isTty, levelValues} from './util.js'\n\ninterface FormatDocumentValidationOptions extends DocumentValidationResult {\n  basePath?: string\n  studioHost?: string\n}\n\ninterface Marker extends Pick<ValidationMarker, 'level' | 'message'> {\n  path: Path\n}\n\ntype ValidationTree = Tree<Marker>\n\nconst levelHeaders = {\n  error: isTty\n    ? styleText('bold', styleText('bgRed', styleText('black', ' ERROR ')))\n    : styleText('red', '[ERROR]'),\n  info: isTty\n    ? styleText('bold', styleText('cyan', styleText('black', ' INFO ')))\n    : styleText('cyan', '[INFO]'),\n  warning: isTty\n    ? styleText('bold', styleText('bgYellow', styleText('black', ' WARN ')))\n    : styleText('yellow', '[WARN]'),\n}\n/**\n * Creates a terminal hyperlink. Only outputs a hyperlink if the output is\n * determined to be a TTY\n */\nconst link = (linkText: string, url: string) =>\n  isTty ? `\\u001B]8;;${url}\\u0007${linkText}\\u001B]8;;\\u0007` : styleText('underline', linkText)\n\n/**\n * For sorting markers\n */\nconst compareLevels = <T extends {level: Level; message: string}>(a: T, b: T) =>\n  levelValues[a.level] - levelValues[b.level]\n\n/**\n * Formats the markers at the root of the validation tree\n */\nconst formatRootErrors = (root: ValidationTree, hasChildren: boolean, paddingLength: number) => {\n  if (!root.nodes) return ''\n\n  const [first, ...rest] = [...root.nodes].toSorted(compareLevels)\n  if (!first) return ''\n\n  const firstElbow = hasChildren ? '│ ' : '└─'\n  const firstPadding = '.'.repeat(paddingLength - 6)\n  const firstLine = `${firstElbow} (root) ${firstPadding} ${logSymbols[first.level]} ${\n    first.message\n  }`\n  const subsequentPadding = ' '.repeat(paddingLength + 2)\n  const subsequentElbow = hasChildren ? '│ ' : '  '\n\n  const restOfLines = rest\n    .map(\n      (marker) =>\n        `${subsequentElbow}${subsequentPadding} ${logSymbols[marker.level]} ${marker.message}`,\n    )\n    .join('\\n')\n  return [firstLine, restOfLines].filter(Boolean).join('\\n')\n}\n\n/**\n * Formats document validation results into a user-friendly tree structure\n */\nexport function formatDocumentValidation({\n  documentId,\n  documentType,\n  intentUrl,\n  level,\n  markers,\n}: FormatDocumentValidationOptions): string {\n  const tree = convertToTree<Marker>(markers)\n\n  const documentTypeHeader = isTty\n    ? styleText('bgWhite', styleText('black', ` ${documentType} `))\n    : `[${documentType}]`\n\n  const header = `${levelHeaders[level]} ${documentTypeHeader} ${\n    intentUrl ? link(documentId, intentUrl) : styleText('underline', documentId)\n  }`\n\n  const paddingLength = Math.max(maxKeyLength(tree.children) + 2, 30)\n\n  const childErrors = formatTree<Marker>({\n    getMessage: (marker) => [logSymbols[marker.level], marker.message].join(' '),\n    getNodes: ({nodes}) => [...(nodes ?? [])].toSorted(compareLevels),\n    node: tree.children,\n    paddingLength,\n  })\n\n  const rootErrors = formatRootErrors(tree, childErrors.length > 0, paddingLength)\n\n  return [header, rootErrors, childErrors].filter(Boolean).join('\\n')\n}\n"],"names":["styleText","logSymbols","convertToTree","formatTree","maxKeyLength","isTty","levelValues","levelHeaders","error","info","warning","link","linkText","url","compareLevels","a","b","level","formatRootErrors","root","hasChildren","paddingLength","nodes","first","rest","toSorted","firstElbow","firstPadding","repeat","firstLine","message","subsequentPadding","subsequentElbow","restOfLines","map","marker","join","filter","Boolean","formatDocumentValidation","documentId","documentType","intentUrl","markers","tree","documentTypeHeader","header","Math","max","children","childErrors","getMessage","getNodes","node","rootErrors","length"],"mappings":"AAAA,SAAQA,SAAS,QAAO,YAAW;AAEnC,SAAQC,UAAU,QAAO,sBAAqB;AAI9C,SAAQC,aAAa,EAAEC,UAAU,EAAEC,YAAY,QAAkB,YAAW;AAC5E,SAAuCC,KAAK,EAAEC,WAAW,QAAO,YAAW;AAa3E,MAAMC,eAAe;IACnBC,OAAOH,QACHL,UAAU,QAAQA,UAAU,SAASA,UAAU,SAAS,eACxDA,UAAU,OAAO;IACrBS,MAAMJ,QACFL,UAAU,QAAQA,UAAU,QAAQA,UAAU,SAAS,cACvDA,UAAU,QAAQ;IACtBU,SAASL,QACLL,UAAU,QAAQA,UAAU,YAAYA,UAAU,SAAS,cAC3DA,UAAU,UAAU;AAC1B;AACA;;;CAGC,GACD,MAAMW,OAAO,CAACC,UAAkBC,MAC9BR,QAAQ,CAAC,UAAU,EAAEQ,IAAI,MAAM,EAAED,SAAS,gBAAgB,CAAC,GAAGZ,UAAU,aAAaY;AAEvF;;CAEC,GACD,MAAME,gBAAgB,CAA4CC,GAAMC,IACtEV,WAAW,CAACS,EAAEE,KAAK,CAAC,GAAGX,WAAW,CAACU,EAAEC,KAAK,CAAC;AAE7C;;CAEC,GACD,MAAMC,mBAAmB,CAACC,MAAsBC,aAAsBC;IACpE,IAAI,CAACF,KAAKG,KAAK,EAAE,OAAO;IAExB,MAAM,CAACC,OAAO,GAAGC,KAAK,GAAG;WAAIL,KAAKG,KAAK;KAAC,CAACG,QAAQ,CAACX;IAClD,IAAI,CAACS,OAAO,OAAO;IAEnB,MAAMG,aAAaN,cAAc,OAAO;IACxC,MAAMO,eAAe,IAAIC,MAAM,CAACP,gBAAgB;IAChD,MAAMQ,YAAY,GAAGH,WAAW,QAAQ,EAAEC,aAAa,CAAC,EAAE1B,UAAU,CAACsB,MAAMN,KAAK,CAAC,CAAC,CAAC,EACjFM,MAAMO,OAAO,EACb;IACF,MAAMC,oBAAoB,IAAIH,MAAM,CAACP,gBAAgB;IACrD,MAAMW,kBAAkBZ,cAAc,OAAO;IAE7C,MAAMa,cAAcT,KACjBU,GAAG,CACF,CAACC,SACC,GAAGH,kBAAkBD,kBAAkB,CAAC,EAAE9B,UAAU,CAACkC,OAAOlB,KAAK,CAAC,CAAC,CAAC,EAAEkB,OAAOL,OAAO,EAAE,EAEzFM,IAAI,CAAC;IACR,OAAO;QAACP;QAAWI;KAAY,CAACI,MAAM,CAACC,SAASF,IAAI,CAAC;AACvD;AAEA;;CAEC,GACD,OAAO,SAASG,yBAAyB,EACvCC,UAAU,EACVC,YAAY,EACZC,SAAS,EACTzB,KAAK,EACL0B,OAAO,EACyB;IAChC,MAAMC,OAAO1C,cAAsByC;IAEnC,MAAME,qBAAqBxC,QACvBL,UAAU,WAAWA,UAAU,SAAS,CAAC,CAAC,EAAEyC,aAAa,CAAC,CAAC,KAC3D,CAAC,CAAC,EAAEA,aAAa,CAAC,CAAC;IAEvB,MAAMK,SAAS,GAAGvC,YAAY,CAACU,MAAM,CAAC,CAAC,EAAE4B,mBAAmB,CAAC,EAC3DH,YAAY/B,KAAK6B,YAAYE,aAAa1C,UAAU,aAAawC,aACjE;IAEF,MAAMnB,gBAAgB0B,KAAKC,GAAG,CAAC5C,aAAawC,KAAKK,QAAQ,IAAI,GAAG;IAEhE,MAAMC,cAAc/C,WAAmB;QACrCgD,YAAY,CAAChB,SAAW;gBAAClC,UAAU,CAACkC,OAAOlB,KAAK,CAAC;gBAAEkB,OAAOL,OAAO;aAAC,CAACM,IAAI,CAAC;QACxEgB,UAAU,CAAC,EAAC9B,KAAK,EAAC,GAAK;mBAAKA,SAAS,EAAE;aAAE,CAACG,QAAQ,CAACX;QACnDuC,MAAMT,KAAKK,QAAQ;QACnB5B;IACF;IAEA,MAAMiC,aAAapC,iBAAiB0B,MAAMM,YAAYK,MAAM,GAAG,GAAGlC;IAElE,OAAO;QAACyB;QAAQQ;QAAYJ;KAAY,CAACb,MAAM,CAACC,SAASF,IAAI,CAAC;AAChE"}

package/dist/actions/documents/validation/reporters/prettyReporter/tree.js

@@ -0,0 +1,108 @@
+import { isIndexSegment, isIndexTuple, isKeySegment } from '@sanity/types';
+// FIXME: de-dupe this
+// copy/paste of `pathToString` from 'sanity' to prevent circular imports
+function pathToString(path) {
+    if (!Array.isArray(path)) {
+        throw new TypeError('Path is not an array');
+    }
+    let target = '';
+    let i = 0;
+    for (const segment of path){
+        if (isIndexSegment(segment)) {
+            target = `${target}[${segment}]`;
+        } else if (isKeySegment(segment) && segment._key) {
+            target = `${target}[_key=="${segment._key}"]`;
+        } else if (isIndexTuple(segment)) {
+            const [from, to] = segment;
+            target = `${target}[${from}:${to}]`;
+        } else if (typeof segment === 'string') {
+            const separator = i === 0 ? '' : '.';
+            target = `${target}${separator}${segment}`;
+        } else {
+            throw new TypeError(`Unsupported path segment \`${JSON.stringify(segment)}\``);
+        }
+        i++;
+    }
+    return target;
+}
+/**
+ * Recursively calculates the max length of all the keys in the given validation
+ * tree respecting extra length due to indentation depth. Used to calculate the
+ * padding for the rest of the tree.
+ */ export const maxKeyLength = (children = {}, depth = 0)=>{
+    let max = 0;
+    for (const [key, child] of Object.entries(children)){
+        const currentMax = Math.max(key.length + depth * 2, maxKeyLength(child.children, depth + 1));
+        max = Math.max(max, currentMax);
+    }
+    return max;
+};
+/**
+ * Recursively formats a given tree into a printed user-friendly tree structure
+ */ export const formatTree = ({ getMessage, getNodes: getLeaves = ({ nodes })=>nodes, indent = '', node = {}, paddingLength })=>{
+    const entries = Object.entries(node);
+    return entries.map(([key, child], index)=>{
+        const isLast = index === entries.length - 1;
+        const nextIndent = `${indent}${isLast ? '  ' : '│ '}`;
+        const leaves = getLeaves(child);
+        const nested = formatTree({
+            getMessage,
+            getNodes: getLeaves,
+            indent: nextIndent,
+            node: child.children,
+            paddingLength
+        });
+        if (!leaves?.length) {
+            const current = `${indent}${isLast ? '└' : '├'}─ ${key}`;
+            return [
+                current,
+                nested
+            ].filter(Boolean).join('\n');
+        }
+        const [first, ...rest] = leaves;
+        const firstPadding = '.'.repeat(paddingLength - indent.length - key.length);
+        const elbow = isLast ? '└' : '├';
+        const subsequentPadding = ' '.repeat(paddingLength - indent.length + 2);
+        const firstMessage = `${indent}${elbow}─ ${key} ${firstPadding} ${getMessage(first)}`;
+        const subsequentMessages = rest.map((marker)=>`${nextIndent}${subsequentPadding} ${getMessage(marker)}`).join('\n');
+        const current = [
+            firstMessage,
+            subsequentMessages
+        ].filter(Boolean).join('\n');
+        return [
+            current,
+            nested
+        ].filter(Boolean).join('\n');
+    }).join('\n');
+};
+/**
+ * Converts a set of markers with paths into a tree of markers where the paths
+ * are embedded in the tree
+ */ export function convertToTree(nodes) {
+    const root = {};
+    // add the markers to the tree
+    function addNode(node, tree = root) {
+        // if we've traversed the whole path
+        if (node.path.length === 0) {
+            if (!tree.nodes) tree.nodes = []; // ensure markers is defined
+            // then add the marker to the front
+            tree.nodes.push(node);
+            return;
+        }
+        const [current, ...rest] = node.path;
+        const key = pathToString([
+            current
+        ]);
+        // ensure the current node has children and the next node
+        if (!tree.children) tree.children = {};
+        if (!(key in tree.children)) tree.children[key] = {};
+        addNode({
+            ...node,
+            path: rest
+        }, tree.children[key]);
+    }
+    for (const node of nodes)addNode(node);
+    return root;
+}
+
+//# sourceMappingURL=tree.js.map

package/dist/actions/documents/validation/reporters/prettyReporter/tree.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../../../../src/actions/documents/validation/reporters/prettyReporter/tree.ts"],"sourcesContent":["import {isIndexSegment, isIndexTuple, isKeySegment, type Path} from '@sanity/types'\n\n// FIXME: de-dupe this\n// copy/paste of `pathToString` from 'sanity' to prevent circular imports\nfunction pathToString(path: Path): string {\n  if (!Array.isArray(path)) {\n    throw new TypeError('Path is not an array')\n  }\n\n  let target = ''\n  let i = 0\n  for (const segment of path) {\n    if (isIndexSegment(segment)) {\n      target = `${target}[${segment}]`\n    } else if (isKeySegment(segment) && segment._key) {\n      target = `${target}[_key==\"${segment._key}\"]`\n    } else if (isIndexTuple(segment)) {\n      const [from, to] = segment\n      target = `${target}[${from}:${to}]`\n    } else if (typeof segment === 'string') {\n      const separator = i === 0 ? '' : '.'\n      target = `${target}${separator}${segment}`\n    } else {\n      throw new TypeError(`Unsupported path segment \\`${JSON.stringify(segment)}\\``)\n    }\n    i++\n  }\n  return target\n}\n\ninterface BaseNode {\n  path: Path\n}\n\nexport interface Tree<Node extends BaseNode> {\n  children?: Record<string, Tree<Node>>\n  nodes?: Node[]\n}\n\n/**\n * Recursively calculates the max length of all the keys in the given validation\n * tree respecting extra length due to indentation depth. Used to calculate the\n * padding for the rest of the tree.\n */\nexport const maxKeyLength = (children: Record<string, Tree<BaseNode>> = {}, depth = 0): number => {\n  let max = 0\n  for (const [key, child] of Object.entries(children)) {\n    const currentMax = Math.max(key.length + depth * 2, maxKeyLength(child.children, depth + 1))\n    max = Math.max(max, currentMax)\n  }\n  return max\n}\n\ninterface Options<Node extends BaseNode> {\n  getMessage: (node: Node) => string\n  paddingLength: number\n\n  getNodes?: (node: Tree<Node>) => Node[] | undefined\n  indent?: string\n  node?: Record<string, Tree<Node>>\n}\n\n/**\n * Recursively formats a given tree into a printed user-friendly tree structure\n */\nexport const formatTree = <Node extends BaseNode>({\n  getMessage,\n  getNodes: getLeaves = ({nodes}) => nodes,\n  indent = '',\n  node = {},\n  paddingLength,\n}: Options<Node>): string => {\n  const entries = Object.entries(node)\n\n  return entries\n    .map(([key, child], index) => {\n      const isLast = index === entries.length - 1\n      const nextIndent = `${indent}${isLast ? '  ' : '│ '}`\n      const leaves = getLeaves(child)\n\n      const nested = formatTree({\n        getMessage,\n        getNodes: getLeaves,\n        indent: nextIndent,\n        node: child.children,\n        paddingLength,\n      })\n\n      if (!leaves?.length) {\n        const current = `${indent}${isLast ? '└' : '├'}─ ${key}`\n        return [current, nested].filter(Boolean).join('\\n')\n      }\n\n      const [first, ...rest] = leaves\n      const firstPadding = '.'.repeat(paddingLength - indent.length - key.length)\n      const elbow = isLast ? '└' : '├'\n      const subsequentPadding = ' '.repeat(paddingLength - indent.length + 2)\n\n      const firstMessage = `${indent}${elbow}─ ${key} ${firstPadding} ${getMessage(first)}`\n      const subsequentMessages = rest\n        .map((marker) => `${nextIndent}${subsequentPadding} ${getMessage(marker)}`)\n        .join('\\n')\n\n      const current = [firstMessage, subsequentMessages].filter(Boolean).join('\\n')\n      return [current, nested].filter(Boolean).join('\\n')\n    })\n    .join('\\n')\n}\n\n/**\n * Converts a set of markers with paths into a tree of markers where the paths\n * are embedded in the tree\n */\nexport function convertToTree<const Node extends BaseNode>(nodes: Node[]): Tree<Node> {\n  const root: Tree<Node> = {}\n\n  // add the markers to the tree\n  function addNode(node: Node, tree: Tree<Node> = root) {\n    // if we've traversed the whole path\n    if (node.path.length === 0) {\n      if (!tree.nodes) tree.nodes = [] // ensure markers is defined\n\n      // then add the marker to the front\n      tree.nodes.push(node)\n      return\n    }\n\n    const [current, ...rest] = node.path\n    const key = pathToString([current])\n\n    // ensure the current node has children and the next node\n    if (!tree.children) tree.children = {}\n    if (!(key in tree.children)) tree.children[key] = {}\n\n    addNode({...node, path: rest}, tree.children[key])\n  }\n\n  for (const node of nodes) addNode(node)\n  return root\n}\n"],"names":["isIndexSegment","isIndexTuple","isKeySegment","pathToString","path","Array","isArray","TypeError","target","i","segment","_key","from","to","separator","JSON","stringify","maxKeyLength","children","depth","max","key","child","Object","entries","currentMax","Math","length","formatTree","getMessage","getNodes","getLeaves","nodes","indent","node","paddingLength","map","index","isLast","nextIndent","leaves","nested","current","filter","Boolean","join","first","rest","firstPadding","repeat","elbow","subsequentPadding","firstMessage","subsequentMessages","marker","convertToTree","root","addNode","tree","push"],"mappings":"AAAA,SAAQA,cAAc,EAAEC,YAAY,EAAEC,YAAY,QAAkB,gBAAe;AAEnF,sBAAsB;AACtB,yEAAyE;AACzE,SAASC,aAAaC,IAAU;IAC9B,IAAI,CAACC,MAAMC,OAAO,CAACF,OAAO;QACxB,MAAM,IAAIG,UAAU;IACtB;IAEA,IAAIC,SAAS;IACb,IAAIC,IAAI;IACR,KAAK,MAAMC,WAAWN,KAAM;QAC1B,IAAIJ,eAAeU,UAAU;YAC3BF,SAAS,GAAGA,OAAO,CAAC,EAAEE,QAAQ,CAAC,CAAC;QAClC,OAAO,IAAIR,aAAaQ,YAAYA,QAAQC,IAAI,EAAE;YAChDH,SAAS,GAAGA,OAAO,QAAQ,EAAEE,QAAQC,IAAI,CAAC,EAAE,CAAC;QAC/C,OAAO,IAAIV,aAAaS,UAAU;YAChC,MAAM,CAACE,MAAMC,GAAG,GAAGH;YACnBF,SAAS,GAAGA,OAAO,CAAC,EAAEI,KAAK,CAAC,EAAEC,GAAG,CAAC,CAAC;QACrC,OAAO,IAAI,OAAOH,YAAY,UAAU;YACtC,MAAMI,YAAYL,MAAM,IAAI,KAAK;YACjCD,SAAS,GAAGA,SAASM,YAAYJ,SAAS;QAC5C,OAAO;YACL,MAAM,IAAIH,UAAU,CAAC,2BAA2B,EAAEQ,KAAKC,SAAS,CAACN,SAAS,EAAE,CAAC;QAC/E;QACAD;IACF;IACA,OAAOD;AACT;AAWA;;;;CAIC,GACD,OAAO,MAAMS,eAAe,CAACC,WAA2C,CAAC,CAAC,EAAEC,QAAQ,CAAC;IACnF,IAAIC,MAAM;IACV,KAAK,MAAM,CAACC,KAAKC,MAAM,IAAIC,OAAOC,OAAO,CAACN,UAAW;QACnD,MAAMO,aAAaC,KAAKN,GAAG,CAACC,IAAIM,MAAM,GAAGR,QAAQ,GAAGF,aAAaK,MAAMJ,QAAQ,EAAEC,QAAQ;QACzFC,MAAMM,KAAKN,GAAG,CAACA,KAAKK;IACtB;IACA,OAAOL;AACT,EAAC;AAWD;;CAEC,GACD,OAAO,MAAMQ,aAAa,CAAwB,EAChDC,UAAU,EACVC,UAAUC,YAAY,CAAC,EAACC,KAAK,EAAC,GAAKA,KAAK,EACxCC,SAAS,EAAE,EACXC,OAAO,CAAC,CAAC,EACTC,aAAa,EACC;IACd,MAAMX,UAAUD,OAAOC,OAAO,CAACU;IAE/B,OAAOV,QACJY,GAAG,CAAC,CAAC,CAACf,KAAKC,MAAM,EAAEe;QAClB,MAAMC,SAASD,UAAUb,QAAQG,MAAM,GAAG;QAC1C,MAAMY,aAAa,GAAGN,SAASK,SAAS,OAAO,MAAM;QACrD,MAAME,SAAST,UAAUT;QAEzB,MAAMmB,SAASb,WAAW;YACxBC;YACAC,UAAUC;YACVE,QAAQM;YACRL,MAAMZ,MAAMJ,QAAQ;YACpBiB;QACF;QAEA,IAAI,CAACK,QAAQb,QAAQ;YACnB,MAAMe,UAAU,GAAGT,SAASK,SAAS,MAAM,IAAI,EAAE,EAAEjB,KAAK;YACxD,OAAO;gBAACqB;gBAASD;aAAO,CAACE,MAAM,CAACC,SAASC,IAAI,CAAC;QAChD;QAEA,MAAM,CAACC,OAAO,GAAGC,KAAK,GAAGP;QACzB,MAAMQ,eAAe,IAAIC,MAAM,CAACd,gBAAgBF,OAAON,MAAM,GAAGN,IAAIM,MAAM;QAC1E,MAAMuB,QAAQZ,SAAS,MAAM;QAC7B,MAAMa,oBAAoB,IAAIF,MAAM,CAACd,gBAAgBF,OAAON,MAAM,GAAG;QAErE,MAAMyB,eAAe,GAAGnB,SAASiB,MAAM,EAAE,EAAE7B,IAAI,CAAC,EAAE2B,aAAa,CAAC,EAAEnB,WAAWiB,QAAQ;QACrF,MAAMO,qBAAqBN,KACxBX,GAAG,CAAC,CAACkB,SAAW,GAAGf,aAAaY,kBAAkB,CAAC,EAAEtB,WAAWyB,SAAS,EACzET,IAAI,CAAC;QAER,MAAMH,UAAU;YAACU;YAAcC;SAAmB,CAACV,MAAM,CAACC,SAASC,IAAI,CAAC;QACxE,OAAO;YAACH;YAASD;SAAO,CAACE,MAAM,CAACC,SAASC,IAAI,CAAC;IAChD,GACCA,IAAI,CAAC;AACV,EAAC;AAED;;;CAGC,GACD,OAAO,SAASU,cAA2CvB,KAAa;IACtE,MAAMwB,OAAmB,CAAC;IAE1B,8BAA8B;IAC9B,SAASC,QAAQvB,IAAU,EAAEwB,OAAmBF,IAAI;QAClD,oCAAoC;QACpC,IAAItB,KAAK9B,IAAI,CAACuB,MAAM,KAAK,GAAG;YAC1B,IAAI,CAAC+B,KAAK1B,KAAK,EAAE0B,KAAK1B,KAAK,GAAG,EAAE,EAAC,4BAA4B;YAE7D,mCAAmC;YACnC0B,KAAK1B,KAAK,CAAC2B,IAAI,CAACzB;YAChB;QACF;QAEA,MAAM,CAACQ,SAAS,GAAGK,KAAK,GAAGb,KAAK9B,IAAI;QACpC,MAAMiB,MAAMlB,aAAa;YAACuC;SAAQ;QAElC,yDAAyD;QACzD,IAAI,CAACgB,KAAKxC,QAAQ,EAAEwC,KAAKxC,QAAQ,GAAG,CAAC;QACrC,IAAI,CAAEG,CAAAA,OAAOqC,KAAKxC,QAAQ,AAAD,GAAIwC,KAAKxC,QAAQ,CAACG,IAAI,GAAG,CAAC;QAEnDoC,QAAQ;YAAC,GAAGvB,IAAI;YAAE9B,MAAM2C;QAAI,GAAGW,KAAKxC,QAAQ,CAACG,IAAI;IACnD;IAEA,KAAK,MAAMa,QAAQF,MAAOyB,QAAQvB;IAClC,OAAOsB;AACT"}

package/dist/actions/graphql/SchemaError.js

@@ -1,6 +1,4 @@
-import { logSymbols } from '@sanity/cli-core/ux';
-import { generateHelpUrl } from '@sanity/generate-help-url';
-import { upperFirst } from 'lodash-es';
+import { formatSchemaValidation } from '../schema/formatSchemaValidation.js';
 export class SchemaError extends Error {
     problemGroups;
     constructor(problemGroups){
@@ -8,30 +6,10 @@ export class SchemaError extends Error {
         this.name = 'SchemaError';
         this.problemGroups = problemGroups;
     }
-    print(output) {
-        output.warn('Uh oh… found errors in schema:\n');
-        for (const group of this.problemGroups){
-            for (const problem of group.problems){
-                const icon = logSymbols[problem.severity] || logSymbols.info;
-                let message = `${icon} ${upperFirst(problem.severity)}: ${getPath(group.path)}\n${problem.message}`;
-                if (problem.helpId) {
-                    message += `\nSee ${generateHelpUrl(problem.helpId)}`;
-                }
-                output.log(message);
-            }
-        }
+    print(output, label) {
+        output.warn(`${label ?? 'Found errors in schema'}:\n`);
+        output.log(formatSchemaValidation(this.problemGroups));
     }
 }
-function getPath(path) {
-    return path.map((segment)=>{
-        if (segment.kind === 'type' && segment.name && segment.type) {
-            return `${segment.name} - (${segment.type})`;
-        }
-        if (segment.kind === 'property' && segment.name) {
-            return segment.name;
-        }
-        return null;
-    }).filter(Boolean).join(' / ');
-}
 
 //# sourceMappingURL=SchemaError.js.map

package/dist/actions/graphql/SchemaError.js.map

@@ -1 +1 @@
-{"version":3,"sources":["../../../src/actions/graphql/SchemaError.ts"],"sourcesContent":["import {type Output} from '@sanity/cli-core'\nimport {logSymbols} from '@sanity/cli-core/ux'\nimport {generateHelpUrl} from '@sanity/generate-help-url'\nimport {type SchemaValidationProblemGroup} from '@sanity/types'\nimport {upperFirst} from 'lodash-es'\n\nexport class SchemaError extends Error {\n  problemGroups: SchemaValidationProblemGroup[]\n\n  constructor(problemGroups: SchemaValidationProblemGroup[]) {\n    super('Schema errors encountered')\n    this.name = 'SchemaError'\n    this.problemGroups = problemGroups\n  }\n\n  print(output: Output): void {\n    output.warn('Uh oh… found errors in schema:\\n')\n\n    for (const group of this.problemGroups) {\n      for (const problem of group.problems) {\n        const icon = logSymbols[problem.severity] || logSymbols.info\n\n        let message = `${icon} ${upperFirst(problem.severity)}: ${getPath(group.path)}\\n${problem.message}`\n        if (problem.helpId) {\n          message += `\\nSee ${generateHelpUrl(problem.helpId)}`\n        }\n\n        output.log(message)\n      }\n    }\n  }\n}\n\nfunction getPath(path: SchemaValidationProblemGroup['path']) {\n  return path\n    .map((segment) => {\n      if (segment.kind === 'type' && segment.name && segment.type) {\n        return `${segment.name} - (${segment.type})`\n      }\n      if (segment.kind === 'property' && segment.name) {\n        return segment.name\n      }\n      return null\n    })\n    .filter(Boolean)\n    .join(' / ')\n}\n"],"names":["logSymbols","generateHelpUrl","upperFirst","SchemaError","Error","problemGroups","name","print","output","warn","group","problem","problems","icon","severity","info","message","getPath","path","helpId","log","map","segment","kind","type","filter","Boolean","join"],"mappings":"AACA,SAAQA,UAAU,QAAO,sBAAqB;AAC9C,SAAQC,eAAe,QAAO,4BAA2B;AAEzD,SAAQC,UAAU,QAAO,YAAW;AAEpC,OAAO,MAAMC,oBAAoBC;IAC/BC,cAA6C;IAE7C,YAAYA,aAA6C,CAAE;QACzD,KAAK,CAAC;QACN,IAAI,CAACC,IAAI,GAAG;QACZ,IAAI,CAACD,aAAa,GAAGA;IACvB;IAEAE,MAAMC,MAAc,EAAQ;QAC1BA,OAAOC,IAAI,CAAC;QAEZ,KAAK,MAAMC,SAAS,IAAI,CAACL,aAAa,CAAE;YACtC,KAAK,MAAMM,WAAWD,MAAME,QAAQ,CAAE;gBACpC,MAAMC,OAAOb,UAAU,CAACW,QAAQG,QAAQ,CAAC,IAAId,WAAWe,IAAI;gBAE5D,IAAIC,UAAU,GAAGH,KAAK,CAAC,EAAEX,WAAWS,QAAQG,QAAQ,EAAE,EAAE,EAAEG,QAAQP,MAAMQ,IAAI,EAAE,EAAE,EAAEP,QAAQK,OAAO,EAAE;gBACnG,IAAIL,QAAQQ,MAAM,EAAE;oBAClBH,WAAW,CAAC,MAAM,EAAEf,gBAAgBU,QAAQQ,MAAM,GAAG;gBACvD;gBAEAX,OAAOY,GAAG,CAACJ;YACb;QACF;IACF;AACF;AAEA,SAASC,QAAQC,IAA0C;IACzD,OAAOA,KACJG,GAAG,CAAC,CAACC;QACJ,IAAIA,QAAQC,IAAI,KAAK,UAAUD,QAAQhB,IAAI,IAAIgB,QAAQE,IAAI,EAAE;YAC3D,OAAO,GAAGF,QAAQhB,IAAI,CAAC,IAAI,EAAEgB,QAAQE,IAAI,CAAC,CAAC,CAAC;QAC9C;QACA,IAAIF,QAAQC,IAAI,KAAK,cAAcD,QAAQhB,IAAI,EAAE;YAC/C,OAAOgB,QAAQhB,IAAI;QACrB;QACA,OAAO;IACT,GACCmB,MAAM,CAACC,SACPC,IAAI,CAAC;AACV"}
+{"version":3,"sources":["../../../src/actions/graphql/SchemaError.ts"],"sourcesContent":["import {type Output} from '@sanity/cli-core'\nimport {type SchemaValidationProblemGroup} from '@sanity/types'\n\nimport {formatSchemaValidation} from '../schema/formatSchemaValidation.js'\n\nexport class SchemaError extends Error {\n  problemGroups: SchemaValidationProblemGroup[]\n\n  constructor(problemGroups: SchemaValidationProblemGroup[]) {\n    super('Schema errors encountered')\n    this.name = 'SchemaError'\n    this.problemGroups = problemGroups\n  }\n\n  print(output: Output, label?: string): void {\n    output.warn(`${label ?? 'Found errors in schema'}:\\n`)\n    output.log(formatSchemaValidation(this.problemGroups))\n  }\n}\n"],"names":["formatSchemaValidation","SchemaError","Error","problemGroups","name","print","output","label","warn","log"],"mappings":"AAGA,SAAQA,sBAAsB,QAAO,sCAAqC;AAE1E,OAAO,MAAMC,oBAAoBC;IAC/BC,cAA6C;IAE7C,YAAYA,aAA6C,CAAE;QACzD,KAAK,CAAC;QACN,IAAI,CAACC,IAAI,GAAG;QACZ,IAAI,CAACD,aAAa,GAAGA;IACvB;IAEAE,MAAMC,MAAc,EAAEC,KAAc,EAAQ;QAC1CD,OAAOE,IAAI,CAAC,GAAGD,SAAS,yBAAyB,GAAG,CAAC;QACrDD,OAAOG,GAAG,CAACT,uBAAuB,IAAI,CAACG,aAAa;IACtD;AACF"}