@code0-tech/triangulum 0.37.2 → 0.38.0

package/dist/index.cjs

@@ -1,12 +1,12 @@
-Object.defineProperty(exports,Symbol.toStringTag,{value:`Module`});const e=require("./utils-euztPiZI.cjs");let t=require("typescript");t=e.y(t,1);var n=(n,r)=>{let i=e.v(n?.value);if(!i)return`any`;let a=`
+Object.defineProperty(exports,Symbol.toStringTag,{value:`Module`});const e=require("./utils-BftsgxoV.cjs");let t=require("typescript");t=e.b(t,1);var n=(n,r)=>{let i=e.y(n?.value);if(!i)return`any`;let a=`
         ${e.r(r,`unknown`)}
         const tempValue = ${i??`any`};
     `,o=`index.ts`,s=e.t(o,a),c=s.getSourceFile(o),l=s.languageService.getProgram().getTypeChecker(),u=`any`,d=e=>{if(t.default.isVariableDeclaration(e)&&e.name.getText()===`tempValue`){let n=l.getTypeAtLocation(e),r=n=>{if(n.isUnion()){let e=n.types.map(r);return Array.from(new Set(e)).sort().join(` | `)}if(l.isArrayType(n)){let e=n.typeArguments||[],t=e.length>0?r(e[0]):`any`;return e[0]?.isUnion()?`(${t})[]`:`${t}[]`}if(n.getFlags()&t.default.TypeFlags.Object||n.isClassOrInterface()){let t=l.getPropertiesOfType(n);if(t.length>0)return`{ ${t.map(t=>{let n=l.getTypeOfSymbolAtLocation(t,e);return`${t.getName()}: ${r(n)}`}).join(`, `)} }`}let i=l.getBaseTypeOfLiteralType(n);return l.typeToString(i,e)};u=r(n)}t.default.forEachChild(e,d)};return d(c),u},r=(n,r)=>{let i=`
         ${e.r(r)}
         type Target = ${n};
     `,a=`index.ts`,o=e.t(a,i),s=o.getSourceFile(a),c=o.languageService.getProgram().getTypeChecker(),l=s.statements.find(e=>t.default.isTypeAliasDeclaration(e)&&e.name.text===`Target`);if(!l)return{__typename:`LiteralValue`,value:null};let u=c.getTypeAtLocation(l.type),d=(e,n,r=new Set)=>{let i=new Set(r);if(i.has(e))return null;let a=e.getFlags();if(e.isUnion()){if(n.type,t.default.isTypeAliasDeclaration(n)&&n.type&&t.default.isUnionTypeNode(n.type)){let e=c.getTypeFromTypeNode(n.type.types[0]);return d(e,n,i)}let r=e.types.filter(e=>{let n=e.getFlags();return!(n&t.default.TypeFlags.Undefined)&&!(n&t.default.TypeFlags.Null)}),a=r.length>0?r[0]:e.types[0];return d(a,n,i)}if(a&t.default.TypeFlags.StringLiteral)return e.value;if(a&t.default.TypeFlags.String)return``;if(a&t.default.TypeFlags.NumberLiteral)return e.value;if(a&t.default.TypeFlags.Number)return 0;if(a&t.default.TypeFlags.BooleanLiteral)return e.intrinsicName===`true`;if(a&t.default.TypeFlags.Boolean)return!1;if(c.isArrayType(e)){i.add(e);let t=e.typeArguments?.[0]||c.getAnyType(),r=d(t,n,i);return r===null?[]:[r]}if(e.isClassOrInterface()||a&t.default.TypeFlags.Object||e.getProperties().length>0){i.add(e);let t={};return e.getProperties().forEach(e=>{let r=c.getTypeOfSymbolAtLocation(e,n),a=e.valueDeclaration;r&&(t[e.getName()]=d(r,a||n,i))}),t}return null};return{__typename:`LiteralValue`,value:d(u,l)}},i=2345,a=2322,o=2339,s=(e,t,n)=>{if(e.getStart()>t||e.getEnd()<n)return;let r=e;return e.forEachChild(e=>{let i=s(e,t,n);i&&(r=i)}),r},c=(e,n,r)=>{if(e.start===void 0||e.length===void 0)return!1;let c=s(n,e.start,e.start+e.length);if(!c)return!1;if((e.code===i||e.code===a)&&t.default.isExpression(c)){let e=r.getTypeAtLocation(c);if(!e.isUnion())return!1;let n=r.getContextualType(c);return n?e.types.some(e=>(e.flags&(t.default.TypeFlags.Null|t.default.TypeFlags.Undefined))===0&&r.isTypeAssignableTo(e,n)):!1}if(e.code===o&&t.default.isPropertyAccessExpression(c.parent)){let e=r.getNonNullableType(r.getTypeAtLocation(c.parent.expression));if(!e.isUnion())return!1;let t=c.getText();return e.types.some(e=>e.getProperty(t)!==void 0)}return!1},l=(n,r,i)=>{if(!n?.startingNodeId)return{isValid:!1,returnType:`void`,diagnostics:[{nodeId:null,parameterIndex:null,code:0,message:`You need to provide a starting node to be able to execute this flow.`,severity:`error`}]};if(!n.nodes?.nodes?.find(e=>e?.id==n.startingNodeId))return{isValid:!1,returnType:`void`,diagnostics:[{nodeId:null,parameterIndex:null,code:0,message:`The starting node is not linked within the flow. Please make sure the starting node is connected to the rest of the flow.`,severity:`error`}]};let a=new Set(r?.map(e=>e.identifier)),o=(n.nodes?.nodes??[]).filter(e=>e?.functionDefinition&&!a.has(e.functionDefinition.identifier)).map(e=>({nodeId:e.id,parameterIndex:null,code:0,message:`The function definition "${e.functionDefinition.identifier}" is not reachable.`,severity:`error`}));if(o.length>0)return{isValid:!1,returnType:`void`,diagnostics:o};let s=e.n(n,r,i,!1,!1),l=`index.ts`,u=e.t(l,s),d=u.getSourceFile(l),f=u.languageService.getProgram(),p=f.getTypeChecker(),m=f.getSemanticDiagnostics(d).map(e=>{let n=(0,t.flattenDiagnosticMessageText)(e.messageText,`
-`),r,i=null;if(e.start!==void 0){let t=d.getFullText(),n=Math.max(0,e.start-300),a=Math.min(t.length,e.start),o=t.substring(n,a),s=/\/\* @pos ([^ ]+) (\d+|null) \*\//g,c,l=null,u=-1;for(;(c=s.exec(o))!==null;){let t=n+c.index+c[0].length;t<=e.start&&t>u&&(u=t,l=c)}l&&(r=l[1]===`null`?null:l[1],i=parseInt(l[2],10))}let a=c(e,d,p)?`warning`:`error`;return{message:n,code:e.code,severity:a,nodeId:r,parameterIndex:typeof i==`number`&&Number.isSafeInteger(i)?i:null}}).filter(e=>e!==null);return{isValid:!m.some(e=>e?.severity===`error`),returnType:`void`,diagnostics:m}},u=(n,r,i)=>{let a=e.v(r?.value),o=`
+`),r,i=null;if(e.start!==void 0){let t=d.getFullText(),n=Math.max(0,e.start-300),a=Math.min(t.length,e.start),o=t.substring(n,a),s=/\/\* @pos ([^ ]+) (\d+|null) \*\//g,c,l=null,u=-1;for(;(c=s.exec(o))!==null;){let t=n+c.index+c[0].length;t<=e.start&&t>u&&(u=t,l=c)}l&&(r=l[1]===`null`?null:l[1],i=parseInt(l[2],10))}let a=c(e,d,p)?`warning`:`error`;return{message:n,code:e.code,severity:a,nodeId:r,parameterIndex:typeof i==`number`&&Number.isSafeInteger(i)?i:null}}).filter(e=>e!==null);return{isValid:!m.some(e=>e?.severity===`error`),returnType:`void`,diagnostics:m}},u=(n,r,i)=>{let a=e.y(r?.value),o=`
         ${e.r(i)}
         const testValue: ${n} = ${a};
     `,s=`index.ts`,c=e.t(s,o).languageService.getSemanticDiagnostics(s).map(e=>{let n=t.default.flattenDiagnosticMessageText(e.messageText,`
-`),r=n.includes(`not assignable to parameter of type`)&&(n.includes(`'{}'`)||n.includes(`undefined`))||n.includes(`not assignable to type 'undefined'`)||n.includes(`not assignable to type 'void'`)||n.includes(`may be a mistake because neither type sufficiently overlaps`);return{message:n,code:e.code,severity:r?`warning`:`error`}});return{isValid:!c.some(e=>e.severity===`error`),returnType:`void`,diagnostics:c}},d=(n,r,i,a)=>{let o=e.n(n,i,r),s=`index.ts`,c=e.t(s,o),l=c.getSourceFile(s),u=c.languageService.getProgram().getTypeChecker(),d=n.nodes?.nodes?.find(e=>e?.id===a),y=a?`fn_${d?.functionDefinition?.identifier?.replace(/::/g,`_`)}`:`flow`,b=a?`node_${e.i(a)}`:`flow_${e.i(n.id)}`,x=p(l),S=m(l).get(b),C=x.get(y),w=h(u,S),T=g(u,C,S),E=w?.map((e,n)=>(e.flags&t.default.TypeFlags.Undefined)===0?e:T?.[n]??e),D=(d?.parameters?.nodes??[]).map(e=>e?.value!=null),O=v(u,S,E,T,_(C,w,D),a?x:new Map,a?i:[],D),k=f(u,S,C);return{nodeId:a,parameters:O,return:k?e.l(u,S,k,Array.from(x.values()),i,!1):{input:`generic`}}},f=(e,n,r)=>{if(n?.initializer&&t.default.isCallExpression(n.initializer)){let t=e.getResolvedSignature(n.initializer);if(t)return e.getReturnTypeOfSignature(t)}if(r){let t=e.getSignatureFromDeclaration(r);if(t)return e.getReturnTypeOfSignature(t)}},p=e=>new Map(e.statements.filter(t.default.isFunctionDeclaration).map(e=>[e.name.getText(),e])),m=e=>{let n=[];return e.statements.forEach(e=>{e.forEachChild(function e(r){t.default.isVariableDeclaration(r)&&(r.parent.flags&t.default.NodeFlags.Const)!==0&&n.push([r.name.getText(),r]),r.forEachChild(e)})}),new Map(n)},h=(e,n)=>{if(n?.initializer&&t.default.isCallExpression(n.initializer))return e.getResolvedSignature(n.initializer)?.parameters.map(t=>e.getTypeOfSymbolAtLocation(t,n.initializer))},g=(e,t,n)=>{if(t&&n?.initializer)return t.parameters.map(t=>{let r=e.getSymbolAtLocation(t.name);return e.getTypeOfSymbolAtLocation(r,n.initializer)})},_=(e,n,r=[])=>{let i=e.typeParameters?.map(e=>e.name.getText())||[],a={};e.parameters.forEach((e,n)=>{if(!e.type)return;let r=new Set;e.type.forEachChild(function n(a){if(t.default.isTypeReferenceNode(a)&&t.default.isIdentifier(a.typeName)){let e=a.typeName.text;i.includes(e)&&r.add(e)}if(t.default.isTypeReferenceNode(e.type)&&t.default.isIdentifier(e.type.typeName)){let t=e.type.typeName.text;i.includes(t)&&r.add(t)}a.forEachChild(n)}),r.forEach(e=>{a[e]||(a[e]=[]),a[e].push(n)})});let o=Object.values(a).filter(e=>e.length>1).map(([e,...t])=>t.map(t=>({parameterIndex:t,dependsOnIndex:e}))).flat();return n?o.filter(e=>{if(r[e.dependsOnIndex])return!1;let i=n[e.parameterIndex];if(!i)return!0;let a=(i.flags&t.default.TypeFlags.Null)!==0,o=(i.flags&t.default.TypeFlags.Undefined)!==0;return a||o}):o},v=(n,r,i,a,o,s,c,l)=>{if(!i)return[];let u=e.l(n,r,n.getAnyType(),Array.from(s.values()),c,!0).suggestions;return i.map((i,d)=>{let f=a?.[d],p=f?M(n,f,r):void 0,m=Array.from(s.values()),h=f?e.l(n,r,f,m,c,!0):void 0,g=C(n,e.h(i)),_=y(r,d),v=_?T(n,f,_):void 0,b=v??f;if(_&&(t.default.isArrayLiteralExpression(_)||t.default.isObjectLiteralExpression(_)&&(g||v!=null&&C(n,v)))){let a=e.l(n,r,i,m,c,!0,p).suggestions;return{schema:t.default.isArrayLiteralExpression(_)?E(n,r,b,_,m,c,a,u):k(n,r,b,_,m,c,a,u),blockedBy:o.filter(e=>e.parameterIndex===d).map(e=>e.dependsOnIndex)}}let x=e.g(e.l(n,r,i,m,c,!0,p));return{schema:e.m(h,x,l[d]??!1,u),blockedBy:o.filter(e=>e.parameterIndex===d).map(e=>e.dependsOnIndex)}})},y=(e,n)=>{if(e.initializer&&t.default.isCallExpression(e.initializer))return e.initializer.arguments[n]},b=new Set([`select`,`boolean`,`number`,`text`]),x=t.default.TypeFlags.Null|t.default.TypeFlags.Undefined|t.default.TypeFlags.Void|t.default.TypeFlags.Never,S=e=>(e.flags&x)!==0,C=(e,n)=>(n.flags&t.default.TypeFlags.Object)!==0&&!e.isArrayType(n)&&!e.isTupleType(n),w=e=>e.properties.filter(t.default.isPropertyAssignment).map(e=>A(e)),T=(n,r,i)=>{if(!r)return;let a=e.h(r);if(!a.isUnion()||e.f(a))return;let o=a.types.filter(e=>(e.flags&(t.default.TypeFlags.Undefined|t.default.TypeFlags.Null))===0);if(o.length<2)return;let s=n.getTypeAtLocation(i);if((s.flags&(t.default.TypeFlags.Any|t.default.TypeFlags.Unknown))===0){let e=o.find(e=>n.isTypeAssignableTo(s,e));if(e)return e}if(t.default.isObjectLiteralExpression(i)){let e=w(i),t,r=0;for(let i of o){let a=e.filter(e=>n.getPropertyOfType(i,e)!=null).length;a>r&&(t=i,r=a)}return t}if(t.default.isArrayLiteralExpression(i))return o.find(e=>n.isArrayType(e)||n.isTupleType(e))},E=(t,n,r,i,a,o,s,c)=>{let l=r?e.l(t,n,r,a,o,!0):void 0,u=l!=null&&l.input?.startsWith(`list`)===!0,d=r?e.h(r):void 0,f=d&&t.isArrayType(d)?t.getTypeArguments(d)[0]:void 0,p=i.elements.map(e=>O(t,n,f,e,a,o,c));return e._({input:u?l.input:`list`,type:(u?l.type:void 0)??t.typeToString(t.getBaseTypeOfLiteralType(t.getTypeAtLocation(i))),items:p,declaredItems:e.o(u?l.items:void 0,c)},s??D(l,c))},D=(e,t)=>!e||e.input===`generic`?t:e.suggestions,O=(n,r,i,a,o,s,c)=>{let l=T(n,i,a)??i;if(t.default.isArrayLiteralExpression(a))return E(n,r,l,a,o,s,void 0,c);if(t.default.isObjectLiteralExpression(a))return k(n,r,l,a,o,s,void 0,c);let u=l?e.l(n,r,l,o,s,!0):void 0,d=!u||u.input===`generic`,f=n.getBaseTypeOfLiteralType(n.getTypeAtLocation(a));return d?e.c(e.l(n,r,f,o,s,!0),c):b.has(u.input)?e._({...u,...S(f)?{}:{type:n.typeToString(f)}},u.suggestions):e.s(u,c)},k=(n,r,i,a,o,s,c,l)=>{let u=i?e.l(n,r,i,o,s,!0):void 0,d=u?.input===`data`;if(u&&!d&&u.input!==`generic`)return e._({...u,type:n.typeToString(n.getBaseTypeOfLiteralType(n.getTypeAtLocation(a)))},c??u.suggestions);let f=d?u.properties??{}:{},p={};for(let[t,n]of Object.entries(f))p[t]=Array.isArray(n)?n.map(t=>e.s(t,l)):e.s(n,l);let m=[];for(let c of a.properties){if(!t.default.isPropertyAssignment(c))continue;let a=A(c);p[a]=O(n,r,d?j(n,e.h(i),a):void 0,c.initializer,o,s,l),m.push(a)}let h=d?u.required??[]:m;return e._({input:`data`,type:(d?u.type:void 0)??n.typeToString(n.getBaseTypeOfLiteralType(n.getTypeAtLocation(a))),properties:p,required:h},c??D(u,l))},A=e=>t.default.isStringLiteralLike(e.name)||t.default.isNumericLiteral(e.name)?e.name.text:e.name.getText(),j=(e,t,n)=>{let r=e.getPropertyOfType(t,n);if(!r)return;let i=r.valueDeclaration??r.declarations?.[0];return i?e.getTypeOfSymbolAtLocation(r,i):void 0},M=(e,n,r)=>{if((n.flags&t.default.TypeFlags.TypeParameter)!==0){let r=n.symbol?.declarations?.[0];return r&&t.default.isTypeParameterDeclaration(r)&&r.constraint?e.getTypeFromTypeNode(r.constraint):e.getAnyType()}if((n.flags&t.default.TypeFlags.Conditional)!==0)return e.getBaseConstraintOfType(n)??e.getAnyType();if((n.flags&t.default.TypeFlags.Object)!==0&&N(n,e,new Set)){let i=n.aliasSymbol?.getName();if(i){let n=e.getSymbolsInScope(r,t.default.SymbolFlags.Variable).find(e=>e.getName()===`__widen_${i}`);if(n)return e.getTypeOfSymbolAtLocation(n,r)}return e.getAnyType()}return n},N=(e,n,r)=>!r.has(e)&&(r.add(e),!!((e.flags&t.default.TypeFlags.TypeParameter)!==0||(e.flags&t.default.TypeFlags.Object)!==0&&(n.getTypeArguments(e).some(e=>N(e,n,r))||e.aliasTypeArguments?.some(e=>N(e,n,r))))),P=(n,r=[])=>{let i=`index.ts`,a=`${e.r(r)}\ntype MyType = ${n}`,o=e.t(i,a).languageService.getProgram(),s=o?.getSourceFile(i),c=o?.getTypeChecker();if(!s||!c)return;let l=s.statements.filter(e=>t.default.isTypeAliasDeclaration(e)||t.default.isInterfaceDeclaration(e)||t.default.isClassDeclaration(e)).pop();if(!l)return;let u=c.getTypeAtLocation(l);if(u)return e.l(c,void 0,u,[],[],!1)};exports.CUSTOM_INPUT_IDENTIFIERS=e.a,exports.declaredItemsOf=e.o,exports.declaredSchema=e.s,exports.genericNodeSchema=e.c,exports.getFlowValidation=l,exports.getSchema=e.l,exports.getSignatureSchema=d,exports.getTypeFromValue=n,exports.getTypeSchema=P,exports.getValueFromType=r,exports.getValueValidation=u,exports.isCustomInputIdentifier=e.u,exports.isCustomInputKind=e.d,exports.isOptionsUnion=e.f,exports.isSubFlow=e.p,exports.mergeSchemas=e.m,exports.nonNullishType=e.h,exports.normalizeNodeSchema=e.g,exports.withSuggestions=e._;
+`),r=n.includes(`not assignable to parameter of type`)&&(n.includes(`'{}'`)||n.includes(`undefined`))||n.includes(`not assignable to type 'undefined'`)||n.includes(`not assignable to type 'void'`)||n.includes(`may be a mistake because neither type sufficiently overlaps`);return{message:n,code:e.code,severity:r?`warning`:`error`}});return{isValid:!c.some(e=>e.severity===`error`),returnType:`void`,diagnostics:c}},d=(n,r,i,a)=>{let o=e.n(n,i,r),s=`index.ts`,c=e.t(s,o),l=c.getSourceFile(s),u=c.languageService.getProgram().getTypeChecker(),d=n.nodes?.nodes?.find(e=>e?.id===a),y=a?`fn_${d?.functionDefinition?.identifier?.replace(/::/g,`_`)}`:`flow`,b=a?`node_${e.i(a)}`:`flow_${e.i(n.id)}`,x=p(l),S=m(l).get(b),C=x.get(y),w=h(u,S),T=g(u,C,S),E=w?.map((e,n)=>(e.flags&t.default.TypeFlags.Undefined)===0?e:T?.[n]??e),D=(d?.parameters?.nodes??[]).map(e=>e?.value!=null),O=v(u,S,E,T,_(C,w,D),a?x:new Map,a?i:[],D),k=f(u,S,C);return{nodeId:a,parameters:O,return:k?e.l(u,S,k,Array.from(x.values()),i,!1):{input:`generic`}}},f=(e,n,r)=>{if(n?.initializer&&t.default.isCallExpression(n.initializer)){let t=e.getResolvedSignature(n.initializer);if(t)return e.getReturnTypeOfSignature(t)}if(r){let t=e.getSignatureFromDeclaration(r);if(t)return e.getReturnTypeOfSignature(t)}},p=e=>new Map(e.statements.filter(t.default.isFunctionDeclaration).map(e=>[e.name.getText(),e])),m=e=>{let n=[];return e.statements.forEach(e=>{e.forEachChild(function e(r){t.default.isVariableDeclaration(r)&&(r.parent.flags&t.default.NodeFlags.Const)!==0&&n.push([r.name.getText(),r]),r.forEachChild(e)})}),new Map(n)},h=(e,n)=>{if(n?.initializer&&t.default.isCallExpression(n.initializer))return e.getResolvedSignature(n.initializer)?.parameters.map(t=>e.getTypeOfSymbolAtLocation(t,n.initializer))},g=(e,t,n)=>{if(t&&n?.initializer)return t.parameters.map(t=>{let r=e.getSymbolAtLocation(t.name);return e.getTypeOfSymbolAtLocation(r,n.initializer)})},_=(e,n,r=[])=>{let i=e.typeParameters?.map(e=>e.name.getText())||[],a={};e.parameters.forEach((e,n)=>{if(!e.type)return;let r=new Set;e.type.forEachChild(function n(a){if(t.default.isTypeReferenceNode(a)&&t.default.isIdentifier(a.typeName)){let e=a.typeName.text;i.includes(e)&&r.add(e)}if(t.default.isTypeReferenceNode(e.type)&&t.default.isIdentifier(e.type.typeName)){let t=e.type.typeName.text;i.includes(t)&&r.add(t)}a.forEachChild(n)}),r.forEach(e=>{a[e]||(a[e]=[]),a[e].push(n)})});let o=Object.values(a).filter(e=>e.length>1).map(([e,...t])=>t.map(t=>({parameterIndex:t,dependsOnIndex:e}))).flat();return n?o.filter(e=>{if(r[e.dependsOnIndex])return!1;let i=n[e.parameterIndex];if(!i)return!0;let a=(i.flags&t.default.TypeFlags.Null)!==0,o=(i.flags&t.default.TypeFlags.Undefined)!==0;return a||o}):o},v=(n,r,i,a,o,s,c,l)=>{if(!i)return[];let u=e.v(e.l(n,r,n.getAnyType(),Array.from(s.values()),c,!0));return i.map((i,d)=>{let f=a?.[d],p=f?M(n,f,r):void 0,m=Array.from(s.values()),h=f?e.l(n,r,f,m,c,!0):void 0,g=C(n,e.h(i)),_=y(r,d),v=_?T(n,f,_):void 0,b=v??f;if(_&&(t.default.isArrayLiteralExpression(_)||t.default.isObjectLiteralExpression(_)&&(g||v!=null&&C(n,v)))){let a=e.v(e.l(n,r,i,m,c,!0,p));return{schema:t.default.isArrayLiteralExpression(_)?E(n,r,b,_,m,c,a,u):k(n,r,b,_,m,c,a,u),blockedBy:o.filter(e=>e.parameterIndex===d).map(e=>e.dependsOnIndex)}}let x=e.g(e.l(n,r,i,m,c,!0,p));return{schema:e.m(h,x,l[d]??!1,u),blockedBy:o.filter(e=>e.parameterIndex===d).map(e=>e.dependsOnIndex)}})},y=(e,n)=>{if(e.initializer&&t.default.isCallExpression(e.initializer))return e.initializer.arguments[n]},b=new Set([`select`,`boolean`,`number`,`text`]),x=t.default.TypeFlags.Null|t.default.TypeFlags.Undefined|t.default.TypeFlags.Void|t.default.TypeFlags.Never,S=e=>(e.flags&x)!==0,C=(e,n)=>(n.flags&t.default.TypeFlags.Object)!==0&&!e.isArrayType(n)&&!e.isTupleType(n),w=e=>e.properties.filter(t.default.isPropertyAssignment).map(e=>A(e)),T=(n,r,i)=>{if(!r)return;let a=e.h(r);if(!a.isUnion()||e.f(a))return;let o=a.types.filter(e=>(e.flags&(t.default.TypeFlags.Undefined|t.default.TypeFlags.Null))===0);if(o.length<2)return;let s=n.getTypeAtLocation(i);if((s.flags&(t.default.TypeFlags.Any|t.default.TypeFlags.Unknown))===0){let e=o.find(e=>n.isTypeAssignableTo(s,e));if(e)return e}if(t.default.isObjectLiteralExpression(i)){let e=w(i),t,r=0;for(let i of o){let a=e.filter(e=>n.getPropertyOfType(i,e)!=null).length;a>r&&(t=i,r=a)}return t}if(t.default.isArrayLiteralExpression(i))return o.find(e=>n.isArrayType(e)||n.isTupleType(e))},E=(t,n,r,i,a,o,s,c)=>{let l=r?e.l(t,n,r,a,o,!0):void 0,u=l!=null&&l.input?.startsWith(`list`)===!0,d=r?e.h(r):void 0,f=d&&t.isArrayType(d)?t.getTypeArguments(d)[0]:void 0,p=i.elements.map(e=>O(t,n,f,e,a,o,c));return e._({input:u?l.input:`list`,type:(u?l.type:void 0)??t.typeToString(t.getBaseTypeOfLiteralType(t.getTypeAtLocation(i))),items:p,declaredItems:e.o(u?l.items:void 0,c)},s??D(l,c))},D=(t,n)=>!t||t.input===`generic`?n:e.v(t),O=(n,r,i,a,o,s,c)=>{let l=T(n,i,a)??i;if(t.default.isArrayLiteralExpression(a))return E(n,r,l,a,o,s,void 0,c);if(t.default.isObjectLiteralExpression(a))return k(n,r,l,a,o,s,void 0,c);let u=l?e.l(n,r,l,o,s,!0):void 0,d=!u||u.input===`generic`,f=n.getBaseTypeOfLiteralType(n.getTypeAtLocation(a));return d?e.c(e.l(n,r,f,o,s,!0),c):b.has(u.input)?e._({...u,...S(f)?{}:{type:n.typeToString(f)}},e.v(u)):e.s(u,c)},k=(n,r,i,a,o,s,c,l)=>{let u=i?e.l(n,r,i,o,s,!0):void 0,d=u?.input===`data`;if(u&&!d&&u.input!==`generic`)return e._({...u,type:n.typeToString(n.getBaseTypeOfLiteralType(n.getTypeAtLocation(a)))},c??e.v(u));let f=d?u.properties??{}:{},p={};for(let[t,n]of Object.entries(f))p[t]=Array.isArray(n)?n.map(t=>e.s(t,l)):e.s(n,l);let m=[];for(let c of a.properties){if(!t.default.isPropertyAssignment(c))continue;let a=A(c);p[a]=O(n,r,d?j(n,e.h(i),a):void 0,c.initializer,o,s,l),m.push(a)}let h=d?u.required??[]:m;return e._({input:`data`,type:(d?u.type:void 0)??n.typeToString(n.getBaseTypeOfLiteralType(n.getTypeAtLocation(a))),properties:p,required:h},c??D(u,l))},A=e=>t.default.isStringLiteralLike(e.name)||t.default.isNumericLiteral(e.name)?e.name.text:e.name.getText(),j=(e,t,n)=>{let r=e.getPropertyOfType(t,n);if(!r)return;let i=r.valueDeclaration??r.declarations?.[0];return i?e.getTypeOfSymbolAtLocation(r,i):void 0},M=(e,n,r)=>{if((n.flags&t.default.TypeFlags.TypeParameter)!==0){let r=n.symbol?.declarations?.[0];return r&&t.default.isTypeParameterDeclaration(r)&&r.constraint?e.getTypeFromTypeNode(r.constraint):e.getAnyType()}if((n.flags&t.default.TypeFlags.Conditional)!==0)return e.getBaseConstraintOfType(n)??e.getAnyType();if((n.flags&t.default.TypeFlags.Object)!==0&&N(n,e,new Set)){let i=n.aliasSymbol?.getName();if(i){let n=e.getSymbolsInScope(r,t.default.SymbolFlags.Variable).find(e=>e.getName()===`__widen_${i}`);if(n)return e.getTypeOfSymbolAtLocation(n,r)}return e.getAnyType()}return n},N=(e,n,r)=>!r.has(e)&&(r.add(e),!!((e.flags&t.default.TypeFlags.TypeParameter)!==0||(e.flags&t.default.TypeFlags.Object)!==0&&(n.getTypeArguments(e).some(e=>N(e,n,r))||e.aliasTypeArguments?.some(e=>N(e,n,r))))),P=(n,r=[])=>{let i=`index.ts`,a=`${e.r(r)}\ntype MyType = ${n}`,o=e.t(i,a).languageService.getProgram(),s=o?.getSourceFile(i),c=o?.getTypeChecker();if(!s||!c)return;let l=s.statements.filter(e=>t.default.isTypeAliasDeclaration(e)||t.default.isInterfaceDeclaration(e)||t.default.isClassDeclaration(e)).pop();if(!l)return;let u=c.getTypeAtLocation(l);if(u)return e.l(c,void 0,u,[],[],!1)};exports.CUSTOM_INPUT_IDENTIFIERS=e.a,exports.declaredItemsOf=e.o,exports.declaredSchema=e.s,exports.genericNodeSchema=e.c,exports.getFlowValidation=l,exports.getSchema=e.l,exports.getSignatureSchema=d,exports.getTypeFromValue=n,exports.getTypeSchema=P,exports.getValueFromType=r,exports.getValueValidation=u,exports.isCustomInputIdentifier=e.u,exports.isCustomInputKind=e.d,exports.isOptionsUnion=e.f,exports.isSubFlow=e.p,exports.mergeSchemas=e.m,exports.nonNullishType=e.h,exports.normalizeNodeSchema=e.g,exports.withSuggestions=e._;

package/dist/index.js

@@ -1,14 +1,14 @@
-import { _ as e, a as t, c as n, d as r, f as i, g as a, h as o, i as s, l as c, m as l, n as u, o as d, p as f, r as p, s as m, t as h, u as g, v as _ } from "./utils-DSmUMJiO.js";
-import v, { flattenDiagnosticMessageText as y } from "typescript";
+import { _ as e, a as t, c as n, d as r, f as i, g as a, h as o, i as s, l as c, m as l, n as u, o as d, p as f, r as p, s as m, t as h, u as g, v as _, y as v } from "./utils-A--QqsC6.js";
+import y, { flattenDiagnosticMessageText as b } from "typescript";
 //#region src/extraction/getTypeFromValue.ts
-var b = (e, t) => {
-	let n = _(e?.value);
+var x = (e, t) => {
+	let n = v(e?.value);
 	if (!n) return "any";
 	let r = `
         ${p(t, "unknown")}
         const tempValue = ${n ?? "any"};
     `, i = "index.ts", a = h(i, r), o = a.getSourceFile(i), s = a.languageService.getProgram().getTypeChecker(), c = "any", l = (e) => {
-		if (v.isVariableDeclaration(e) && e.name.getText() === "tempValue") {
+		if (y.isVariableDeclaration(e) && e.name.getText() === "tempValue") {
 			let t = s.getTypeAtLocation(e), n = (t) => {
 				if (t.isUnion()) {
 					let e = t.types.map(n);
@@ -18,7 +18,7 @@ var b = (e, t) => {
 					let e = t.typeArguments || [], r = e.length > 0 ? n(e[0]) : "any";
 					return e[0]?.isUnion() ? `(${r})[]` : `${r}[]`;
 				}
-				if (t.getFlags() & v.TypeFlags.Object || t.isClassOrInterface()) {
+				if (t.getFlags() & y.TypeFlags.Object || t.isClassOrInterface()) {
 					let r = s.getPropertiesOfType(t);
 					if (r.length > 0) return `{ ${r.map((t) => {
 						let r = s.getTypeOfSymbolAtLocation(t, e);
@@ -30,14 +30,14 @@ var b = (e, t) => {
 			};
 			c = n(t);
 		}
-		v.forEachChild(e, l);
+		y.forEachChild(e, l);
 	};
 	return l(o), c;
-}, x = (e, t) => {
+}, S = (e, t) => {
 	let n = `
         ${p(t)}
         type Target = ${e};
-    `, r = "index.ts", i = h(r, n), a = i.getSourceFile(r), o = i.languageService.getProgram().getTypeChecker(), s = a.statements.find((e) => v.isTypeAliasDeclaration(e) && e.name.text === "Target");
+    `, r = "index.ts", i = h(r, n), a = i.getSourceFile(r), o = i.languageService.getProgram().getTypeChecker(), s = a.statements.find((e) => y.isTypeAliasDeclaration(e) && e.name.text === "Target");
 	if (!s) return {
 		__typename: "LiteralValue",
 		value: null
@@ -47,28 +47,28 @@ var b = (e, t) => {
 		if (r.has(e)) return null;
 		let i = e.getFlags();
 		if (e.isUnion()) {
-			if (t.type, v.isTypeAliasDeclaration(t) && t.type && v.isUnionTypeNode(t.type)) {
+			if (t.type, y.isTypeAliasDeclaration(t) && t.type && y.isUnionTypeNode(t.type)) {
 				let e = o.getTypeFromTypeNode(t.type.types[0]);
 				return l(e, t, r);
 			}
 			let n = e.types.filter((e) => {
 				let t = e.getFlags();
-				return !(t & v.TypeFlags.Undefined) && !(t & v.TypeFlags.Null);
+				return !(t & y.TypeFlags.Undefined) && !(t & y.TypeFlags.Null);
 			}), i = n.length > 0 ? n[0] : e.types[0];
 			return l(i, t, r);
 		}
-		if (i & v.TypeFlags.StringLiteral) return e.value;
-		if (i & v.TypeFlags.String) return "";
-		if (i & v.TypeFlags.NumberLiteral) return e.value;
-		if (i & v.TypeFlags.Number) return 0;
-		if (i & v.TypeFlags.BooleanLiteral) return e.intrinsicName === "true";
-		if (i & v.TypeFlags.Boolean) return !1;
+		if (i & y.TypeFlags.StringLiteral) return e.value;
+		if (i & y.TypeFlags.String) return "";
+		if (i & y.TypeFlags.NumberLiteral) return e.value;
+		if (i & y.TypeFlags.Number) return 0;
+		if (i & y.TypeFlags.BooleanLiteral) return e.intrinsicName === "true";
+		if (i & y.TypeFlags.Boolean) return !1;
 		if (o.isArrayType(e)) {
 			r.add(e);
 			let n = e.typeArguments?.[0] || o.getAnyType(), i = l(n, t, r);
 			return i === null ? [] : [i];
 		}
-		if (e.isClassOrInterface() || i & v.TypeFlags.Object || e.getProperties().length > 0) {
+		if (e.isClassOrInterface() || i & y.TypeFlags.Object || e.getProperties().length > 0) {
 			r.add(e);
 			let n = {};
 			return e.getProperties().forEach((e) => {
@@ -82,31 +82,31 @@ var b = (e, t) => {
 		__typename: "LiteralValue",
 		value: l(c, s)
 	};
-}, S = 2345, C = 2322, w = 2339, T = (e, t, n) => {
+}, C = 2345, w = 2322, T = 2339, E = (e, t, n) => {
 	if (e.getStart() > t || e.getEnd() < n) return;
 	let r = e;
 	return e.forEachChild((e) => {
-		let i = T(e, t, n);
+		let i = E(e, t, n);
 		i && (r = i);
 	}), r;
-}, E = (e, t, n) => {
+}, D = (e, t, n) => {
 	if (e.start === void 0 || e.length === void 0) return !1;
-	let r = T(t, e.start, e.start + e.length);
+	let r = E(t, e.start, e.start + e.length);
 	if (!r) return !1;
-	if ((e.code === S || e.code === C) && v.isExpression(r)) {
+	if ((e.code === C || e.code === w) && y.isExpression(r)) {
 		let e = n.getTypeAtLocation(r);
 		if (!e.isUnion()) return !1;
 		let t = n.getContextualType(r);
-		return t ? e.types.some((e) => (e.flags & (v.TypeFlags.Null | v.TypeFlags.Undefined)) === 0 && n.isTypeAssignableTo(e, t)) : !1;
+		return t ? e.types.some((e) => (e.flags & (y.TypeFlags.Null | y.TypeFlags.Undefined)) === 0 && n.isTypeAssignableTo(e, t)) : !1;
 	}
-	if (e.code === w && v.isPropertyAccessExpression(r.parent)) {
+	if (e.code === T && y.isPropertyAccessExpression(r.parent)) {
 		let e = n.getNonNullableType(n.getTypeAtLocation(r.parent.expression));
 		if (!e.isUnion()) return !1;
 		let t = r.getText();
 		return e.types.some((e) => e.getProperty(t) !== void 0);
 	}
 	return !1;
-}, D = (e, t, n) => {
+}, O = (e, t, n) => {
 	if (!e?.startingNodeId) return {
 		isValid: !1,
 		returnType: "void",
@@ -142,7 +142,7 @@ var b = (e, t) => {
 		diagnostics: i
 	};
 	let a = u(e, t, n, !1, !1), o = "index.ts", s = h(o, a), c = s.getSourceFile(o), l = s.languageService.getProgram(), d = l.getTypeChecker(), f = l.getSemanticDiagnostics(c).map((e) => {
-		let t = y(e.messageText, "\n"), n, r = null;
+		let t = b(e.messageText, "\n"), n, r = null;
 		if (e.start !== void 0) {
 			let t = c.getFullText(), i = Math.max(0, e.start - 300), a = Math.min(t.length, e.start), o = t.substring(i, a), s = /\/\* @pos ([^ ]+) (\d+|null) \*\//g, l, u = null, d = -1;
 			for (; (l = s.exec(o)) !== null;) {
@@ -151,7 +151,7 @@ var b = (e, t) => {
 			}
 			u && (n = u[1] === "null" ? null : u[1], r = parseInt(u[2], 10));
 		}
-		let i = E(e, c, d) ? "warning" : "error";
+		let i = D(e, c, d) ? "warning" : "error";
 		return {
 			message: t,
 			code: e.code,
@@ -165,12 +165,12 @@ var b = (e, t) => {
 		returnType: "void",
 		diagnostics: f
 	};
-}, O = (e, t, n) => {
-	let r = _(t?.value), i = `
+}, k = (e, t, n) => {
+	let r = v(t?.value), i = `
         ${p(n)}
         const testValue: ${e} = ${r};
     `, a = "index.ts", o = h(a, i).languageService.getSemanticDiagnostics(a).map((e) => {
-		let t = v.flattenDiagnosticMessageText(e.messageText, "\n"), n = t.includes("not assignable to parameter of type") && (t.includes("'{}'") || t.includes("undefined")) || t.includes("not assignable to type 'undefined'") || t.includes("not assignable to type 'void'") || t.includes("may be a mistake because neither type sufficiently overlaps");
+		let t = y.flattenDiagnosticMessageText(e.messageText, "\n"), n = t.includes("not assignable to parameter of type") && (t.includes("'{}'") || t.includes("undefined")) || t.includes("not assignable to type 'undefined'") || t.includes("not assignable to type 'void'") || t.includes("may be a mistake because neither type sufficiently overlaps");
 		return {
 			message: t,
 			code: e.code,
@@ -182,15 +182,15 @@ var b = (e, t) => {
 		returnType: "void",
 		diagnostics: o
 	};
-}, k = (e, t, n, r) => {
-	let i = u(e, n, t), a = "index.ts", o = h(a, i), l = o.getSourceFile(a), d = o.languageService.getProgram().getTypeChecker(), f = e.nodes?.nodes?.find((e) => e?.id === r), p = r ? `fn_${f?.functionDefinition?.identifier?.replace(/::/g, "_")}` : "flow", m = r ? `node_${s(r)}` : `flow_${s(e.id)}`, g = j(l), _ = M(l).get(m), y = g.get(p), b = N(d, _), x = P(d, y, _), S = b?.map((e, t) => (e.flags & v.TypeFlags.Undefined) === 0 ? e : x?.[t] ?? e), C = (f?.parameters?.nodes ?? []).map((e) => e?.value != null), w = I(d, _, S, x, F(y, b, C), r ? g : /* @__PURE__ */ new Map(), r ? n : [], C), T = A(d, _, y);
+}, A = (e, t, n, r) => {
+	let i = u(e, n, t), a = "index.ts", o = h(a, i), l = o.getSourceFile(a), d = o.languageService.getProgram().getTypeChecker(), f = e.nodes?.nodes?.find((e) => e?.id === r), p = r ? `fn_${f?.functionDefinition?.identifier?.replace(/::/g, "_")}` : "flow", m = r ? `node_${s(r)}` : `flow_${s(e.id)}`, g = M(l), _ = N(l).get(m), v = g.get(p), b = P(d, _), x = F(d, v, _), S = b?.map((e, t) => (e.flags & y.TypeFlags.Undefined) === 0 ? e : x?.[t] ?? e), C = (f?.parameters?.nodes ?? []).map((e) => e?.value != null), w = L(d, _, S, x, I(v, b, C), r ? g : /* @__PURE__ */ new Map(), r ? n : [], C), T = j(d, _, v);
 	return {
 		nodeId: r,
 		parameters: w,
 		return: T ? c(d, _, T, Array.from(g.values()), n, !1) : { input: "generic" }
 	};
-}, A = (e, t, n) => {
-	if (t?.initializer && v.isCallExpression(t.initializer)) {
+}, j = (e, t, n) => {
+	if (t?.initializer && y.isCallExpression(t.initializer)) {
 		let n = e.getResolvedSignature(t.initializer);
 		if (n) return e.getReturnTypeOfSignature(n);
 	}
@@ -198,31 +198,31 @@ var b = (e, t) => {
 		let t = e.getSignatureFromDeclaration(n);
 		if (t) return e.getReturnTypeOfSignature(t);
 	}
-}, j = (e) => new Map(e.statements.filter(v.isFunctionDeclaration).map((e) => [e.name.getText(), e])), M = (e) => {
+}, M = (e) => new Map(e.statements.filter(y.isFunctionDeclaration).map((e) => [e.name.getText(), e])), N = (e) => {
 	let t = [];
 	return e.statements.forEach((e) => {
 		e.forEachChild(function e(n) {
-			v.isVariableDeclaration(n) && (n.parent.flags & v.NodeFlags.Const) !== 0 && t.push([n.name.getText(), n]), n.forEachChild(e);
+			y.isVariableDeclaration(n) && (n.parent.flags & y.NodeFlags.Const) !== 0 && t.push([n.name.getText(), n]), n.forEachChild(e);
 		});
 	}), new Map(t);
-}, N = (e, t) => {
-	if (t?.initializer && v.isCallExpression(t.initializer)) return e.getResolvedSignature(t.initializer)?.parameters.map((n) => e.getTypeOfSymbolAtLocation(n, t.initializer));
-}, P = (e, t, n) => {
+}, P = (e, t) => {
+	if (t?.initializer && y.isCallExpression(t.initializer)) return e.getResolvedSignature(t.initializer)?.parameters.map((n) => e.getTypeOfSymbolAtLocation(n, t.initializer));
+}, F = (e, t, n) => {
 	if (t && n?.initializer) return t.parameters.map((t) => {
 		let r = e.getSymbolAtLocation(t.name);
 		return e.getTypeOfSymbolAtLocation(r, n.initializer);
 	});
-}, F = (e, t, n = []) => {
+}, I = (e, t, n = []) => {
 	let r = e.typeParameters?.map((e) => e.name.getText()) || [], i = {};
 	e.parameters.forEach((e, t) => {
 		if (!e.type) return;
 		let n = /* @__PURE__ */ new Set();
 		e.type.forEachChild(function t(i) {
-			if (v.isTypeReferenceNode(i) && v.isIdentifier(i.typeName)) {
+			if (y.isTypeReferenceNode(i) && y.isIdentifier(i.typeName)) {
 				let e = i.typeName.text;
 				r.includes(e) && n.add(e);
 			}
-			if (v.isTypeReferenceNode(e.type) && v.isIdentifier(e.type.typeName)) {
+			if (y.isTypeReferenceNode(e.type) && y.isIdentifier(e.type.typeName)) {
 				let t = e.type.typeName.text;
 				r.includes(t) && n.add(t);
 			}
@@ -239,119 +239,119 @@ var b = (e, t) => {
 		if (n[e.dependsOnIndex]) return !1;
 		let r = t[e.parameterIndex];
 		if (!r) return !0;
-		let i = (r.flags & v.TypeFlags.Null) !== 0, a = (r.flags & v.TypeFlags.Undefined) !== 0;
+		let i = (r.flags & y.TypeFlags.Null) !== 0, a = (r.flags & y.TypeFlags.Undefined) !== 0;
 		return i || a;
 	}) : a;
-}, I = (e, t, n, r, i, s, u, d) => {
+}, L = (e, t, n, r, i, s, u, d) => {
 	if (!n) return [];
-	let f = c(e, t, e.getAnyType(), Array.from(s.values()), u, !0).suggestions;
+	let f = _(c(e, t, e.getAnyType(), Array.from(s.values()), u, !0));
 	return n.map((n, p) => {
-		let m = r?.[p], h = m ? X(e, m, t) : void 0, g = Array.from(s.values()), _ = m ? c(e, t, m, g, u, !0) : void 0, y = V(e, o(n)), b = L(t, p), x = b ? U(e, m, b) : void 0, S = x ?? m;
-		if (b && (v.isArrayLiteralExpression(b) || v.isObjectLiteralExpression(b) && (y || x != null && V(e, x)))) {
-			let r = c(e, t, n, g, u, !0, h).suggestions;
+		let m = r?.[p], h = m ? Z(e, m, t) : void 0, g = Array.from(s.values()), v = m ? c(e, t, m, g, u, !0) : void 0, b = H(e, o(n)), x = R(t, p), S = x ? W(e, m, x) : void 0, C = S ?? m;
+		if (x && (y.isArrayLiteralExpression(x) || y.isObjectLiteralExpression(x) && (b || S != null && H(e, S)))) {
+			let r = _(c(e, t, n, g, u, !0, h));
 			return {
-				schema: v.isArrayLiteralExpression(b) ? W(e, t, S, b, g, u, r, f) : q(e, t, S, b, g, u, r, f),
+				schema: y.isArrayLiteralExpression(x) ? G(e, t, C, x, g, u, r, f) : J(e, t, C, x, g, u, r, f),
 				blockedBy: i.filter((e) => e.parameterIndex === p).map((e) => e.dependsOnIndex)
 			};
 		}
-		let C = a(c(e, t, n, g, u, !0, h));
+		let w = a(c(e, t, n, g, u, !0, h));
 		return {
-			schema: l(_, C, d[p] ?? !1, f),
+			schema: l(v, w, d[p] ?? !1, f),
 			blockedBy: i.filter((e) => e.parameterIndex === p).map((e) => e.dependsOnIndex)
 		};
 	});
-}, L = (e, t) => {
-	if (e.initializer && v.isCallExpression(e.initializer)) return e.initializer.arguments[t];
-}, R = /* @__PURE__ */ new Set([
+}, R = (e, t) => {
+	if (e.initializer && y.isCallExpression(e.initializer)) return e.initializer.arguments[t];
+}, z = /* @__PURE__ */ new Set([
 	"select",
 	"boolean",
 	"number",
 	"text"
-]), z = v.TypeFlags.Null | v.TypeFlags.Undefined | v.TypeFlags.Void | v.TypeFlags.Never, B = (e) => (e.flags & z) !== 0, V = (e, t) => (t.flags & v.TypeFlags.Object) !== 0 && !e.isArrayType(t) && !e.isTupleType(t), H = (e) => e.properties.filter(v.isPropertyAssignment).map((e) => J(e)), U = (e, t, n) => {
+]), B = y.TypeFlags.Null | y.TypeFlags.Undefined | y.TypeFlags.Void | y.TypeFlags.Never, V = (e) => (e.flags & B) !== 0, H = (e, t) => (t.flags & y.TypeFlags.Object) !== 0 && !e.isArrayType(t) && !e.isTupleType(t), U = (e) => e.properties.filter(y.isPropertyAssignment).map((e) => Y(e)), W = (e, t, n) => {
 	if (!t) return;
 	let r = o(t);
 	if (!r.isUnion() || i(r)) return;
-	let a = r.types.filter((e) => (e.flags & (v.TypeFlags.Undefined | v.TypeFlags.Null)) === 0);
+	let a = r.types.filter((e) => (e.flags & (y.TypeFlags.Undefined | y.TypeFlags.Null)) === 0);
 	if (a.length < 2) return;
 	let s = e.getTypeAtLocation(n);
-	if ((s.flags & (v.TypeFlags.Any | v.TypeFlags.Unknown)) === 0) {
+	if ((s.flags & (y.TypeFlags.Any | y.TypeFlags.Unknown)) === 0) {
 		let t = a.find((t) => e.isTypeAssignableTo(s, t));
 		if (t) return t;
 	}
-	if (v.isObjectLiteralExpression(n)) {
-		let t = H(n), r, i = 0;
+	if (y.isObjectLiteralExpression(n)) {
+		let t = U(n), r, i = 0;
 		for (let n of a) {
 			let a = t.filter((t) => e.getPropertyOfType(n, t) != null).length;
 			a > i && (r = n, i = a);
 		}
 		return r;
 	}
-	if (v.isArrayLiteralExpression(n)) return a.find((t) => e.isArrayType(t) || e.isTupleType(t));
-}, W = (t, n, r, i, a, s, l, u) => {
-	let f = r ? c(t, n, r, a, s, !0) : void 0, p = f != null && f.input?.startsWith("list") === !0, m = r ? o(r) : void 0, h = m && t.isArrayType(m) ? t.getTypeArguments(m)[0] : void 0, g = i.elements.map((e) => K(t, n, h, e, a, s, u));
+	if (y.isArrayLiteralExpression(n)) return a.find((t) => e.isArrayType(t) || e.isTupleType(t));
+}, G = (t, n, r, i, a, s, l, u) => {
+	let f = r ? c(t, n, r, a, s, !0) : void 0, p = f != null && f.input?.startsWith("list") === !0, m = r ? o(r) : void 0, h = m && t.isArrayType(m) ? t.getTypeArguments(m)[0] : void 0, g = i.elements.map((e) => q(t, n, h, e, a, s, u));
 	return e({
 		input: p ? f.input : "list",
 		type: (p ? f.type : void 0) ?? t.typeToString(t.getBaseTypeOfLiteralType(t.getTypeAtLocation(i))),
 		items: g,
 		declaredItems: d(p ? f.items : void 0, u)
-	}, l ?? G(f, u));
-}, G = (e, t) => !e || e.input === "generic" ? t : e.suggestions, K = (t, r, i, a, o, s, l) => {
-	let u = U(t, i, a) ?? i;
-	if (v.isArrayLiteralExpression(a)) return W(t, r, u, a, o, s, void 0, l);
-	if (v.isObjectLiteralExpression(a)) return q(t, r, u, a, o, s, void 0, l);
+	}, l ?? K(f, u));
+}, K = (e, t) => !e || e.input === "generic" ? t : _(e), q = (t, r, i, a, o, s, l) => {
+	let u = W(t, i, a) ?? i;
+	if (y.isArrayLiteralExpression(a)) return G(t, r, u, a, o, s, void 0, l);
+	if (y.isObjectLiteralExpression(a)) return J(t, r, u, a, o, s, void 0, l);
 	let d = u ? c(t, r, u, o, s, !0) : void 0, f = !d || d.input === "generic", p = t.getBaseTypeOfLiteralType(t.getTypeAtLocation(a));
-	return f ? n(c(t, r, p, o, s, !0), l) : R.has(d.input) ? e({
+	return f ? n(c(t, r, p, o, s, !0), l) : z.has(d.input) ? e({
 		...d,
-		...B(p) ? {} : { type: t.typeToString(p) }
-	}, d.suggestions) : m(d, l);
-}, q = (t, n, r, i, a, s, l, u) => {
+		...V(p) ? {} : { type: t.typeToString(p) }
+	}, _(d)) : m(d, l);
+}, J = (t, n, r, i, a, s, l, u) => {
 	let d = r ? c(t, n, r, a, s, !0) : void 0, f = d?.input === "data";
 	if (d && !f && d.input !== "generic") return e({
 		...d,
 		type: t.typeToString(t.getBaseTypeOfLiteralType(t.getTypeAtLocation(i)))
-	}, l ?? d.suggestions);
+	}, l ?? _(d));
 	let p = f ? d.properties ?? {} : {}, h = {};
 	for (let [e, t] of Object.entries(p)) h[e] = Array.isArray(t) ? t.map((e) => m(e, u)) : m(t, u);
 	let g = [];
 	for (let e of i.properties) {
-		if (!v.isPropertyAssignment(e)) continue;
-		let i = J(e);
-		h[i] = K(t, n, f ? Y(t, o(r), i) : void 0, e.initializer, a, s, u), g.push(i);
+		if (!y.isPropertyAssignment(e)) continue;
+		let i = Y(e);
+		h[i] = q(t, n, f ? X(t, o(r), i) : void 0, e.initializer, a, s, u), g.push(i);
 	}
-	let _ = f ? d.required ?? [] : g;
+	let v = f ? d.required ?? [] : g;
 	return e({
 		input: "data",
 		type: (f ? d.type : void 0) ?? t.typeToString(t.getBaseTypeOfLiteralType(t.getTypeAtLocation(i))),
 		properties: h,
-		required: _
-	}, l ?? G(d, u));
-}, J = (e) => v.isStringLiteralLike(e.name) || v.isNumericLiteral(e.name) ? e.name.text : e.name.getText(), Y = (e, t, n) => {
+		required: v
+	}, l ?? K(d, u));
+}, Y = (e) => y.isStringLiteralLike(e.name) || y.isNumericLiteral(e.name) ? e.name.text : e.name.getText(), X = (e, t, n) => {
 	let r = e.getPropertyOfType(t, n);
 	if (!r) return;
 	let i = r.valueDeclaration ?? r.declarations?.[0];
 	return i ? e.getTypeOfSymbolAtLocation(r, i) : void 0;
-}, X = (e, t, n) => {
-	if ((t.flags & v.TypeFlags.TypeParameter) !== 0) {
+}, Z = (e, t, n) => {
+	if ((t.flags & y.TypeFlags.TypeParameter) !== 0) {
 		let n = t.symbol?.declarations?.[0];
-		return n && v.isTypeParameterDeclaration(n) && n.constraint ? e.getTypeFromTypeNode(n.constraint) : e.getAnyType();
+		return n && y.isTypeParameterDeclaration(n) && n.constraint ? e.getTypeFromTypeNode(n.constraint) : e.getAnyType();
 	}
-	if ((t.flags & v.TypeFlags.Conditional) !== 0) return e.getBaseConstraintOfType(t) ?? e.getAnyType();
-	if ((t.flags & v.TypeFlags.Object) !== 0 && Z(t, e, /* @__PURE__ */ new Set())) {
+	if ((t.flags & y.TypeFlags.Conditional) !== 0) return e.getBaseConstraintOfType(t) ?? e.getAnyType();
+	if ((t.flags & y.TypeFlags.Object) !== 0 && Q(t, e, /* @__PURE__ */ new Set())) {
 		let r = t.aliasSymbol?.getName();
 		if (r) {
-			let t = e.getSymbolsInScope(n, v.SymbolFlags.Variable).find((e) => e.getName() === `__widen_${r}`);
+			let t = e.getSymbolsInScope(n, y.SymbolFlags.Variable).find((e) => e.getName() === `__widen_${r}`);
 			if (t) return e.getTypeOfSymbolAtLocation(t, n);
 		}
 		return e.getAnyType();
 	}
 	return t;
-}, Z = (e, t, n) => !n.has(e) && (n.add(e), !!((e.flags & v.TypeFlags.TypeParameter) !== 0 || (e.flags & v.TypeFlags.Object) !== 0 && (t.getTypeArguments(e).some((e) => Z(e, t, n)) || e.aliasTypeArguments?.some((e) => Z(e, t, n))))), Q = (e, t = []) => {
+}, Q = (e, t, n) => !n.has(e) && (n.add(e), !!((e.flags & y.TypeFlags.TypeParameter) !== 0 || (e.flags & y.TypeFlags.Object) !== 0 && (t.getTypeArguments(e).some((e) => Q(e, t, n)) || e.aliasTypeArguments?.some((e) => Q(e, t, n))))), $ = (e, t = []) => {
 	let n = "index.ts", r = `${p(t)}\ntype MyType = ${e}`, i = h(n, r).languageService.getProgram(), a = i?.getSourceFile(n), o = i?.getTypeChecker();
 	if (!a || !o) return;
-	let s = a.statements.filter((e) => v.isTypeAliasDeclaration(e) || v.isInterfaceDeclaration(e) || v.isClassDeclaration(e)).pop();
+	let s = a.statements.filter((e) => y.isTypeAliasDeclaration(e) || y.isInterfaceDeclaration(e) || y.isClassDeclaration(e)).pop();
 	if (!s) return;
 	let l = o.getTypeAtLocation(s);
 	if (l) return c(o, void 0, l, [], [], !1);
 };
 //#endregion
-export { t as CUSTOM_INPUT_IDENTIFIERS, d as declaredItemsOf, m as declaredSchema, n as genericNodeSchema, D as getFlowValidation, c as getSchema, k as getSignatureSchema, b as getTypeFromValue, Q as getTypeSchema, x as getValueFromType, O as getValueValidation, g as isCustomInputIdentifier, r as isCustomInputKind, i as isOptionsUnion, f as isSubFlow, l as mergeSchemas, o as nonNullishType, a as normalizeNodeSchema, e as withSuggestions };
+export { t as CUSTOM_INPUT_IDENTIFIERS, d as declaredItemsOf, m as declaredSchema, n as genericNodeSchema, O as getFlowValidation, c as getSchema, A as getSignatureSchema, x as getTypeFromValue, $ as getTypeSchema, S as getValueFromType, k as getValueValidation, g as isCustomInputIdentifier, r as isCustomInputKind, i as isOptionsUnion, f as isSubFlow, l as mergeSchemas, o as nonNullishType, a as normalizeNodeSchema, e as withSuggestions };

package/dist/server.cjs

@@ -1,2 +1,2 @@
-Object.defineProperty(exports,Symbol.toStringTag,{value:`Module`});const e=require("./utils-euztPiZI.cjs");let t=require("typescript");t=e.y(t,1);let n=require("ts-json-schema-generator");var r={...n.DEFAULT_CONFIG,expose:`none`,topRef:!1,jsDoc:`none`,skipTypeCheck:!0},i=(e,t)=>{let n=Object.keys(e);if(n.length===0)return{};let r=o(a(e,t)),i={};for(let e of n)try{i[e]=s(r.createSchema(e))}catch{i[e]={}}return i},a=(t,n)=>{let r=Object.entries(t).map(([e,t])=>`export type ${e} = ${t};`).join(`
+Object.defineProperty(exports,Symbol.toStringTag,{value:`Module`});const e=require("./utils-BftsgxoV.cjs");let t=require("typescript");t=e.b(t,1);let n=require("ts-json-schema-generator");var r={...n.DEFAULT_CONFIG,expose:`none`,topRef:!1,jsDoc:`none`,skipTypeCheck:!0},i=(e,t)=>{let n=Object.keys(e);if(n.length===0)return{};let r=o(a(e,t)),i={};for(let e of n)try{i[e]=s(r.createSchema(e))}catch{i[e]={}}return i},a=(t,n)=>{let r=Object.entries(t).map(([e,t])=>`export type ${e} = ${t};`).join(`
 `);return`${e.r(n)}\n${r}`},o=t=>{let i=e.t(`index.ts`,t).languageService.getProgram();return new n.SchemaGenerator(i,(0,n.createParser)(i,r),(0,n.createFormatter)(r),r)},s=e=>{let{$schema:t,definitions:n,...r}=e,i=n&&Object.keys(n).length>0?{...r,definitions:n}:r;return JSON.parse(JSON.stringify(i))},c=(t,n,r)=>{if(!t)return;let a=`index.ts`,o=e.n(t,n,r),s=e.t(a,o),c=s.getSourceFile(a),d=s.languageService.getProgram().getTypeChecker(),m=i({...f(d,c),...p(d,c,t)},r),h=(t.nodes?.nodes??[]).map(e=>e&&b(e,m));return{...t,inputSchema:m[l]??v(),outputSchema:m[u]??y(),nodes:{...t.nodes,nodes:h}}},l=`Flow_input`,u=`Flow_output`,d=(t,n,r)=>`Node_${e.i(t)}_${n}_${r}`,f=(e,n)=>{let r=n.statements.filter(t.default.isFunctionDeclaration).find(e=>e.name?.getText()===`flow`);if(!r)return{};let i=e.getSignatureFromDeclaration(r);if(!i)return{};let{input:a,output:o}=_(e,i,r);return{[l]:a,[u]:o}},p=(e,t,n)=>{let r=w(t),i={};for(let t of n.nodes?.nodes??[]){if(!t?.id)continue;let n=t.parameters?.nodes;if(!n?.some(x))continue;let a=C(r,t);a&&n.forEach((n,r)=>{if(!x(n))return;let o=a.arguments[r],s=o?e.getTypeAtLocation(o).getCallSignatures()[0]:void 0;if(!s)return;let{input:c,output:l}=m(e,s,o);i[d(t.id,r,`input`)]=c,i[d(t.id,r,`output`)]=l})}return i},m=(e,n,r)=>({input:`{ ${h(e,n,r).join(`; `)} }`,output:(n=>e.typeToString(n,r,t.default.TypeFormatFlags.NoTruncation))(e.getReturnTypeOfSignature(n))}),h=(e,n,r)=>{let i=n=>e.typeToString(n,r,t.default.TypeFormatFlags.NoTruncation),a=n.getParameters();if(a.length===1){let t=g(e,e.getTypeOfSymbolAtLocation(a[0],a[0].valueDeclaration??r),r);if(t)return t}return a.map(t=>{let n=e.getTypeOfSymbolAtLocation(t,t.valueDeclaration??r),a=S(t)?`?`:``;return`${t.getName()}${a}: ${i(n)}`})},g=(e,n,r)=>{let i=n,a=i.target;if(a&&(a.objectFlags&t.default.ObjectFlags.Tuple)!==0)return e.getTypeArguments(i).map((n,i)=>{let o=a.labeledElementDeclarations?.[i];return`${o?.name&&t.default.isIdentifier(o.name)?o.name.text:`arg${i}`}${(a.elementFlags[i]&t.default.ElementFlags.Optional)===0?``:`?`}: ${e.typeToString(n,r,t.default.TypeFormatFlags.NoTruncation)}`})},_=(e,n,r)=>{let i=n=>e.typeToString(n,r,t.default.TypeFormatFlags.NoTruncation);return{input:`{ ${n.parameters.map(t=>{let n=e.getTypeOfSymbolAtLocation(t,t.valueDeclaration??r),a=S(t)?`?`:``;return`${t.getName()}${a}: ${i(n)}`}).join(`; `)} }`,output:i(e.getReturnTypeOfSignature(n))}},v=()=>({type:`object`}),y=()=>({}),b=(e,t)=>{let n=e.parameters?.nodes;if(!n?.some(x))return e;let r=n.map((n,r)=>{if(!x(n))return n;let i={...n.value,inputSchema:t[d(e.id,r,`input`)]??v(),outputSchema:t[d(e.id,r,`output`)]??y()};return{...n,value:i}});return{...e,parameters:{...e.parameters,nodes:r}}},x=e=>e?.value?.__typename===`SubFlowValue`,S=e=>{let n=e.valueDeclaration;return!!n&&t.default.isParameter(n)&&(!!n.questionToken||!!n.initializer||!!n.dotDotDotToken)},C=(n,r)=>{let i=n.get(`node_${e.i(r.id)}`)?.initializer;return i&&t.default.isCallExpression(i)?i:void 0},w=e=>{let n=new Map;return e.statements.forEach(e=>{e.forEachChild(function e(r){t.default.isVariableDeclaration(r)&&(r.parent.flags&t.default.NodeFlags.Const)!==0&&n.set(r.name.getText(),r),r.forEachChild(e)})}),n};exports.getFlowSchemas=c;

package/dist/server.js

@@ -1,4 +1,4 @@
-import { i as e, n as t, r as n, t as r } from "./utils-DSmUMJiO.js";
+import { i as e, n as t, r as n, t as r } from "./utils-A--QqsC6.js";
 import i from "typescript";
 import { DEFAULT_CONFIG as a, SchemaGenerator as o, createFormatter as s, createParser as c } from "ts-json-schema-generator";
 //#region src/util/jsonSchema.util.ts

package/dist/util/nodes.util.d.ts

@@ -1,5 +1,6 @@
 import { default as ts } from 'typescript';
-import { FunctionDefinition, NodeFunction } from '@code0-tech/sagittarius-graphql-types';
+import { FunctionDefinition } from '@code0-tech/sagittarius-graphql-types';
+import { SuggestionCandidate } from './suggestion.util';
 /**
  * Filters and transforms function declarations into a collection of compatible node functions.
  *
@@ -24,11 +25,12 @@ import { FunctionDefinition, NodeFunction } from '@code0-tech/sagittarius-graphq
  * @param {ts.Type} paramType - The target parameter type used to filter compatible
  *        functions. Only functions with return types assignable to this type are included
  *
- * @returns {NodeFunction[]} Array of node functions that are compatible with the
- *          specified parameter type, or an empty array if no compatible
- *          functions are found
+ * @returns {SuggestionCandidate[]} Array of node-function candidates compatible with
+ *          the specified parameter type, each carrying how certainly its return
+ *          type produces that type, or an empty array if no compatible functions
+ *          are found
  *
  * @example
  * const compatibleNodes = getNodes(checker, funcDecls, funcDefs, stringType);
  */
-export declare const getNodes: (checker: ts.TypeChecker, functionDeclarations: ts.FunctionDeclaration[], functions: FunctionDefinition[], paramType: ts.Type) => NodeFunction[];
+export declare const getNodes: (checker: ts.TypeChecker, functionDeclarations: ts.FunctionDeclaration[], functions: FunctionDefinition[], paramType: ts.Type) => SuggestionCandidate[];

package/dist/util/references.util.d.ts

@@ -1,5 +1,5 @@
 import { default as ts } from 'typescript';
-import { ReferenceValue } from '@code0-tech/sagittarius-graphql-types';
+import { SuggestionCandidate } from './suggestion.util';
 /**
  * Extracts reference values from a collection of TypeScript symbols.
  *
@@ -11,13 +11,15 @@ import { ReferenceValue } from '@code0-tech/sagittarius-graphql-types';
  * @param node - The VariableDeclaration context in which symbols are analyzed
  * @param paramType - The expected parameter type for property matching during extraction
  * @param symbols - The array of symbols to process and analyze
- * @returns An array of ReferenceValue objects representing extracted references with their paths
+ * @returns An array of reference candidates representing extracted references with
+ *          their paths, each carrying how certainly the type at that path produces
+ *          the expected type
  *
  * @example
  * // Extracts all references from symbols prefixed with node_, p_, or flow_
  * const references = getReferences(checker, variableDecl, expectedType, [symbol1, symbol2]);
  */
-export declare const getReferences: (checker: ts.TypeChecker, node: ts.VariableDeclaration, paramType: ts.Type, symbols: ts.Symbol[]) => ReferenceValue[];
+export declare const getReferences: (checker: ts.TypeChecker, node: ts.VariableDeclaration, paramType: ts.Type, symbols: ts.Symbol[]) => SuggestionCandidate[];
 /**
  * Determines whether an object type participates in a reference cycle, i.e. can
  * reach itself again through its (non-nullable) property types. Results are

package/dist/util/schema.util.d.ts

@@ -1,5 +1,7 @@
 import { default as ts, FunctionDeclaration } from 'typescript';
-import { FunctionDefinition, LiteralValue, NodeFunction, ReferenceValue, SubFlowValue } from '@code0-tech/sagittarius-graphql-types';
+import { FunctionDefinition } from '@code0-tech/sagittarius-graphql-types';
+import { SuggestionCandidate, SuggestionCertainty, SuggestionValue } from './suggestion.util';
+export type { SuggestionCandidate, SuggestionCertainty, SuggestionMatch, SuggestionMatchReason, SuggestionValue, } from './suggestion.util';
 /**
  * Maps a data type identifier to a dedicated input kind.
  *
@@ -50,7 +52,27 @@ export interface Input {
      */
     type?: string;
     /** Array of suggested values (functions, references, or literals) */
-    suggestions?: (NodeFunction | ReferenceValue | LiteralValue | SubFlowValue)[];
+    suggestions?: SuggestionValue[];
+    /**
+     * How certainly each entry of `suggestions` produces this slot's type,
+     * index-aligned with it and of the same length — `suggestions[i]` is
+     * described by `suggestionCertainty[i]`.
+     *
+     * A suggestion is `exact` when its own type is assignable to the slot's, and
+     * `possible` when the match was only reached by weakening one of the two
+     * sides: a generic return matched through its constraint, an `any` that fits
+     * everything, a union whose branches do not all fit, a value that may be
+     * nullish where the slot is not (see {@link SuggestionCertainty}).
+     *
+     * Both kinds are listed — a `possible` candidate is often the one the user
+     * wants — but the split answers two questions the flat list cannot: whether a
+     * slot has *dedicated* producers (which a consumer may want to offer ahead of
+     * building a value by hand), and whether picking one is the case that may
+     * need a cast to type-check.
+     *
+     * Present exactly when `suggestions` is.
+     */
+    suggestionCertainty?: SuggestionCertainty[];
 }
 /**
  * Represents a generic input type with no specific structure.
@@ -274,9 +296,10 @@ export declare const getSchema: (checker: ts.TypeChecker, node: ts.VariableDecla
  *   concrete value must never surface one; the resolved element types (via
  *   `items`) are kept, and the `list-file` `mimetype` is dropped because a plain
  *   list has no such field.
- * - Drops an empty `suggestions` array. Node schemas are built with suggestions
- *   enabled and therefore always carry the key — even when empty — whereas the
- *   rest of the pipeline omits it entirely when there are none.
+ * - Drops an empty `suggestions` array (and its `suggestionCertainty` twin). Node
+ *   schemas are built with suggestions enabled and therefore always carry the
+ *   keys — even when empty — whereas the rest of the pipeline omits them
+ *   entirely when there are none.
  *
  * The function-side schema still drives the final input kind in
  * {@link mergeSchemas}.
@@ -293,13 +316,17 @@ export declare const normalizeNodeSchema: (schema: Schema) => Schema;
  */
 export declare const nonNullishType: (type: ts.Type) => ts.Type;
 /**
- * Sets a schema's `suggestions` to the given set, dropping the key entirely when
- * the set is empty or missing. Suggestion-carrying schemas are built with the
- * key always present (an empty array when nothing matched), whereas the rest of
- * the pipeline omits it — so every schema that is spread into a result passes
- * through here instead of relying on the spread.
+ * Sets a schema's suggestions to the given candidates, dropping both the
+ * `suggestions` key and its `suggestionCertainty` twin entirely when the set is
+ * empty or missing. Suggestion-carrying schemas are built with the keys always
+ * present (empty arrays when nothing matched), whereas the rest of the pipeline
+ * omits them — so every schema that is spread into a result passes through here
+ * instead of relying on the spread.
+ *
+ * Taking candidates rather than two parallel arrays is what keeps the pair
+ * aligned: there is no call site that can set one without the other.
  */
-export declare const withSuggestions: <T extends Schema>(schema: T, suggestions: Input["suggestions"] | undefined) => T;
+export declare const withSuggestions: <T extends Schema>(schema: T, candidates: SuggestionCandidate[] | undefined) => T;
 /**
  * A declared (function-side) schema kept as the answer for its position, because
  * the node side has no counterpart to merge into it — e.g. a property the entered
@@ -311,7 +338,7 @@ export declare const withSuggestions: <T extends Schema>(schema: T, suggestions:
  * (see {@link genericNodeSchema}). Empty suggestion arrays are dropped so the
  * result follows the same convention as every other schema.
  */
-export declare const declaredSchema: (schema: Schema, anySuggestions?: Input["suggestions"]) => Schema;
+export declare const declaredSchema: (schema: Schema, anySuggestions?: SuggestionCandidate[] | undefined) => Schema;
 /**
  * Treats a node-side schema as sitting in a fully generic ("accepts anything")
  * slot: the declared type constrains nothing here, so the value keeps its shape
@@ -338,9 +365,9 @@ export declare const declaredSchema: (schema: Schema, anySuggestions?: Input["su
  * This is what {@link ListInput.declaredItems} carries, and it never depends on the
  * entered value.
  */
-export declare const declaredItemsOf: (functionItems: Schema[] | undefined, anySuggestions?: Input["suggestions"]) => Schema[];
-export declare const genericNodeSchema: (schema: Schema, anySuggestions?: Input["suggestions"], overrideRoot?: boolean) => Schema;
-export declare const mergeSchemas: (functionSchema: Schema | undefined, nodeSchema: Schema, valueProvided?: boolean, anySuggestions?: Input["suggestions"], topLevel?: boolean) => Schema;
+export declare const declaredItemsOf: (functionItems: Schema[] | undefined, anySuggestions?: SuggestionCandidate[] | undefined) => Schema[];
+export declare const genericNodeSchema: (schema: Schema, anySuggestions?: SuggestionCandidate[] | undefined, overrideRoot?: boolean) => Schema;
+export declare const mergeSchemas: (functionSchema: Schema | undefined, nodeSchema: Schema, valueProvided?: boolean, anySuggestions?: SuggestionCandidate[] | undefined, topLevel?: boolean) => Schema;
 /**
  * Checks whether a union's members are the *options of one input* rather than
  * alternative inputs: a string/number literal union (`'GET' | 'POST' | …`, which