@nocobase/plugin-flow-engine 2.1.0-alpha.39 → 2.1.0-alpha.40

package/dist/node_modules/acorn-walk/dist/walk.d.mts

@@ -0,0 +1,177 @@
+import * as acorn from "acorn"
+
+export type FullWalkerCallback<TState> = (
+  node: acorn.Node,
+  state: TState,
+  type: string
+) => void
+
+export type FullAncestorWalkerCallback<TState> = (
+  node: acorn.Node,
+  state: TState,
+  ancestors: acorn.Node[],
+  type: string
+) => void
+
+type AggregateType = {
+  Expression: acorn.Expression,
+  Statement: acorn.Statement,
+  Function: acorn.Function,
+  Class: acorn.Class,
+  Pattern: acorn.Pattern,
+  ForInit: acorn.VariableDeclaration | acorn.Expression
+}
+
+export type SimpleVisitors<TState> = {
+  [type in acorn.AnyNode["type"]]?: (node: Extract<acorn.AnyNode, { type: type }>, state: TState) => void
+} & {
+  [type in keyof AggregateType]?: (node: AggregateType[type], state: TState) => void
+}
+
+export type AncestorVisitors<TState> = {
+  [type in acorn.AnyNode["type"]]?: ( node: Extract<acorn.AnyNode, { type: type }>, state: TState, ancestors: acorn.Node[]
+) => void
+} & {
+  [type in keyof AggregateType]?: (node: AggregateType[type], state: TState, ancestors: acorn.Node[]) => void
+}
+
+export type WalkerCallback<TState> = (node: acorn.Node, state: TState) => void
+
+export type RecursiveVisitors<TState> = {
+  [type in acorn.AnyNode["type"]]?: ( node: Extract<acorn.AnyNode, { type: type }>, state: TState, callback: WalkerCallback<TState>) => void
+} &  {
+  [type in keyof AggregateType]?: (node: AggregateType[type], state: TState, callback: WalkerCallback<TState>) => void
+}
+
+export type FindPredicate = (type: string, node: acorn.Node) => boolean
+
+export interface Found<TState> {
+  node: acorn.Node,
+  state: TState
+}
+
+/**
+ * does a 'simple' walk over a tree
+ * @param node the AST node to walk
+ * @param visitors an object with properties whose names correspond to node types in the {@link https://github.com/estree/estree | ESTree spec}. The properties should contain functions that will be called with the node object and, if applicable the state at that point.
+ * @param base a walker algorithm
+ * @param state a start state. The default walker will simply visit all statements and expressions and not produce a meaningful state. (An example of a use of state is to track scope at each point in the tree.)
+ */
+export function simple<TState>(
+  node: acorn.Node,
+  visitors: SimpleVisitors<TState>,
+  base?: RecursiveVisitors<TState>,
+  state?: TState
+): void
+
+/**
+ * does a 'simple' walk over a tree, building up an array of ancestor nodes (including the current node) and passing the array to the callbacks as a third parameter.
+ * @param node
+ * @param visitors
+ * @param base
+ * @param state
+ */
+export function ancestor<TState>(
+    node: acorn.Node,
+    visitors: AncestorVisitors<TState>,
+    base?: RecursiveVisitors<TState>,
+    state?: TState
+  ): void
+
+/**
+ * does a 'recursive' walk, where the walker functions are responsible for continuing the walk on the child nodes of their target node.
+ * @param node
+ * @param state the start state
+ * @param functions contain an object that maps node types to walker functions
+ * @param base provides the fallback walker functions for node types that aren't handled in the {@link functions} object. If not given, the default walkers will be used.
+ */
+export function recursive<TState>(
+  node: acorn.Node,
+  state: TState,
+  functions: RecursiveVisitors<TState>,
+  base?: RecursiveVisitors<TState>
+): void
+
+/**
+ * does a 'full' walk over a tree, calling the {@link callback} with the arguments (node, state, type) for each node
+ * @param node
+ * @param callback
+ * @param base
+ * @param state
+ */
+export function full<TState>(
+  node: acorn.Node,
+  callback: FullWalkerCallback<TState>,
+  base?: RecursiveVisitors<TState>,
+  state?: TState
+): void
+
+/**
+ * does a 'full' walk over a tree, building up an array of ancestor nodes (including the current node) and passing the array to the callbacks as a third parameter.
+ * @param node
+ * @param callback
+ * @param base
+ * @param state
+ */
+export function fullAncestor<TState>(
+  node: acorn.Node,
+  callback: FullAncestorWalkerCallback<TState>,
+  base?: RecursiveVisitors<TState>,
+  state?: TState
+): void
+
+/**
+ * builds a new walker object by using the walker functions in {@link functions} and filling in the missing ones by taking defaults from {@link base}.
+ * @param functions
+ * @param base
+ */
+export function make<TState>(
+  functions: RecursiveVisitors<TState>,
+  base?: RecursiveVisitors<TState>
+): RecursiveVisitors<TState>
+
+/**
+ * tries to locate a node in a tree at the given start and/or end offsets, which satisfies the predicate test. {@link start} and {@link end} can be either `null` (as wildcard) or a `number`. {@link test} may be a string (indicating a node type) or a function that takes (nodeType, node) arguments and returns a boolean indicating whether this node is interesting. {@link base} and {@link state} are optional, and can be used to specify a custom walker. Nodes are tested from inner to outer, so if two nodes match the boundaries, the inner one will be preferred.
+ * @param node
+ * @param start
+ * @param end
+ * @param type
+ * @param base
+ * @param state
+ */
+export function findNodeAt<TState>(
+  node: acorn.Node,
+  start: number | undefined,
+  end?: number | undefined,
+  type?: FindPredicate | string,
+  base?: RecursiveVisitors<TState>,
+  state?: TState
+): Found<TState> | undefined
+
+/**
+ * like {@link findNodeAt}, but will match any node that exists 'around' (spanning) the given position.
+ * @param node
+ * @param start
+ * @param type
+ * @param base
+ * @param state
+ */
+export function findNodeAround<TState>(
+  node: acorn.Node,
+  start: number | undefined,
+  type?: FindPredicate | string,
+  base?: RecursiveVisitors<TState>,
+  state?: TState
+): Found<TState> | undefined
+
+/**
+ * Find the outermost matching node after a given position.
+ */
+export const findNodeAfter: typeof findNodeAround
+
+/**
+ * Find the outermost matching node before a given position.
+ */
+export const findNodeBefore: typeof findNodeAround
+
+export const base: RecursiveVisitors<any>

package/dist/node_modules/acorn-walk/dist/walk.d.ts

@@ -0,0 +1,177 @@
+import * as acorn from "acorn"
+
+export type FullWalkerCallback<TState> = (
+  node: acorn.Node,
+  state: TState,
+  type: string
+) => void
+
+export type FullAncestorWalkerCallback<TState> = (
+  node: acorn.Node,
+  state: TState,
+  ancestors: acorn.Node[],
+  type: string
+) => void
+
+type AggregateType = {
+  Expression: acorn.Expression,
+  Statement: acorn.Statement,
+  Function: acorn.Function,
+  Class: acorn.Class,
+  Pattern: acorn.Pattern,
+  ForInit: acorn.VariableDeclaration | acorn.Expression
+}
+
+export type SimpleVisitors<TState> = {
+  [type in acorn.AnyNode["type"]]?: (node: Extract<acorn.AnyNode, { type: type }>, state: TState) => void
+} & {
+  [type in keyof AggregateType]?: (node: AggregateType[type], state: TState) => void
+}
+
+export type AncestorVisitors<TState> = {
+  [type in acorn.AnyNode["type"]]?: ( node: Extract<acorn.AnyNode, { type: type }>, state: TState, ancestors: acorn.Node[]
+) => void
+} & {
+  [type in keyof AggregateType]?: (node: AggregateType[type], state: TState, ancestors: acorn.Node[]) => void
+}
+
+export type WalkerCallback<TState> = (node: acorn.Node, state: TState) => void
+
+export type RecursiveVisitors<TState> = {
+  [type in acorn.AnyNode["type"]]?: ( node: Extract<acorn.AnyNode, { type: type }>, state: TState, callback: WalkerCallback<TState>) => void
+} &  {
+  [type in keyof AggregateType]?: (node: AggregateType[type], state: TState, callback: WalkerCallback<TState>) => void
+}
+
+export type FindPredicate = (type: string, node: acorn.Node) => boolean
+
+export interface Found<TState> {
+  node: acorn.Node,
+  state: TState
+}
+
+/**
+ * does a 'simple' walk over a tree
+ * @param node the AST node to walk
+ * @param visitors an object with properties whose names correspond to node types in the {@link https://github.com/estree/estree | ESTree spec}. The properties should contain functions that will be called with the node object and, if applicable the state at that point.
+ * @param base a walker algorithm
+ * @param state a start state. The default walker will simply visit all statements and expressions and not produce a meaningful state. (An example of a use of state is to track scope at each point in the tree.)
+ */
+export function simple<TState>(
+  node: acorn.Node,
+  visitors: SimpleVisitors<TState>,
+  base?: RecursiveVisitors<TState>,
+  state?: TState
+): void
+
+/**
+ * does a 'simple' walk over a tree, building up an array of ancestor nodes (including the current node) and passing the array to the callbacks as a third parameter.
+ * @param node
+ * @param visitors
+ * @param base
+ * @param state
+ */
+export function ancestor<TState>(
+    node: acorn.Node,
+    visitors: AncestorVisitors<TState>,
+    base?: RecursiveVisitors<TState>,
+    state?: TState
+  ): void
+
+/**
+ * does a 'recursive' walk, where the walker functions are responsible for continuing the walk on the child nodes of their target node.
+ * @param node
+ * @param state the start state
+ * @param functions contain an object that maps node types to walker functions
+ * @param base provides the fallback walker functions for node types that aren't handled in the {@link functions} object. If not given, the default walkers will be used.
+ */
+export function recursive<TState>(
+  node: acorn.Node,
+  state: TState,
+  functions: RecursiveVisitors<TState>,
+  base?: RecursiveVisitors<TState>
+): void
+
+/**
+ * does a 'full' walk over a tree, calling the {@link callback} with the arguments (node, state, type) for each node
+ * @param node
+ * @param callback
+ * @param base
+ * @param state
+ */
+export function full<TState>(
+  node: acorn.Node,
+  callback: FullWalkerCallback<TState>,
+  base?: RecursiveVisitors<TState>,
+  state?: TState
+): void
+
+/**
+ * does a 'full' walk over a tree, building up an array of ancestor nodes (including the current node) and passing the array to the callbacks as a third parameter.
+ * @param node
+ * @param callback
+ * @param base
+ * @param state
+ */
+export function fullAncestor<TState>(
+  node: acorn.Node,
+  callback: FullAncestorWalkerCallback<TState>,
+  base?: RecursiveVisitors<TState>,
+  state?: TState
+): void
+
+/**
+ * builds a new walker object by using the walker functions in {@link functions} and filling in the missing ones by taking defaults from {@link base}.
+ * @param functions
+ * @param base
+ */
+export function make<TState>(
+  functions: RecursiveVisitors<TState>,
+  base?: RecursiveVisitors<TState>
+): RecursiveVisitors<TState>
+
+/**
+ * tries to locate a node in a tree at the given start and/or end offsets, which satisfies the predicate test. {@link start} and {@link end} can be either `null` (as wildcard) or a `number`. {@link test} may be a string (indicating a node type) or a function that takes (nodeType, node) arguments and returns a boolean indicating whether this node is interesting. {@link base} and {@link state} are optional, and can be used to specify a custom walker. Nodes are tested from inner to outer, so if two nodes match the boundaries, the inner one will be preferred.
+ * @param node
+ * @param start
+ * @param end
+ * @param type
+ * @param base
+ * @param state
+ */
+export function findNodeAt<TState>(
+  node: acorn.Node,
+  start: number | undefined,
+  end?: number | undefined,
+  type?: FindPredicate | string,
+  base?: RecursiveVisitors<TState>,
+  state?: TState
+): Found<TState> | undefined
+
+/**
+ * like {@link findNodeAt}, but will match any node that exists 'around' (spanning) the given position.
+ * @param node
+ * @param start
+ * @param type
+ * @param base
+ * @param state
+ */
+export function findNodeAround<TState>(
+  node: acorn.Node,
+  start: number | undefined,
+  type?: FindPredicate | string,
+  base?: RecursiveVisitors<TState>,
+  state?: TState
+): Found<TState> | undefined
+
+/**
+ * Find the outermost matching node after a given position.
+ */
+export const findNodeAfter: typeof findNodeAround
+
+/**
+ * Find the outermost matching node before a given position.
+ */
+export const findNodeBefore: typeof findNodeAround
+
+export const base: RecursiveVisitors<any>

package/dist/node_modules/acorn-walk/dist/walk.js

@@ -0,0 +1 @@
+(()=>{var e={390:function(e,t){(function(e,n){true?n(t):0})(this,(function(e){"use strict";function simple(e,t,r,i,o){if(!r){r=n}(function c(e,n,i){var o=i||e.type;r[o](e,n,c);if(t[o]){t[o](e,n)}})(e,i,o)}function ancestor(e,t,r,i,o){var a=[];if(!r){r=n}(function c(e,n,i){var o=i||e.type;var s=e!==a[a.length-1];if(s){a.push(e)}r[o](e,n,c);if(t[o]){t[o](e,n||a,a)}if(s){a.pop()}})(e,i,o)}function recursive(e,t,n,r,i){var o=n?make(n,r||undefined):r;(function c(e,t,n){o[n||e.type](e,t,c)})(e,t,i)}function makeTest(e){if(typeof e==="string"){return function(t){return t===e}}else if(!e){return function(){return true}}else{return e}}var t=function Found(e,t){this.node=e;this.state=t};function full(e,t,r,i,o){if(!r){r=n}var a;(function c(e,n,i){var o=i||e.type;r[o](e,n,c);if(a!==e){t(e,n,o);a=e}})(e,i,o)}function fullAncestor(e,t,r,i){if(!r){r=n}var o=[],a;(function c(e,n,i){var s=i||e.type;var f=e!==o[o.length-1];if(f){o.push(e)}r[s](e,n,c);if(a!==e){t(e,n||o,o,s);a=e}if(f){o.pop()}})(e,i)}function findNodeAt(e,r,i,o,a,s){if(!a){a=n}o=makeTest(o);try{(function c(e,n,s){var f=s||e.type;if((r==null||e.start<=r)&&(i==null||e.end>=i)){a[f](e,n,c)}if((r==null||e.start===r)&&(i==null||e.end===i)&&o(f,e)){throw new t(e,n)}})(e,s)}catch(e){if(e instanceof t){return e}throw e}}function findNodeAround(e,r,i,o,a){i=makeTest(i);if(!o){o=n}try{(function c(e,n,a){var s=a||e.type;if(e.start>r||e.end<r){return}o[s](e,n,c);if(i(s,e)){throw new t(e,n)}})(e,a)}catch(e){if(e instanceof t){return e}throw e}}function findNodeAfter(e,r,i,o,a){i=makeTest(i);if(!o){o=n}try{(function c(e,n,a){if(e.end<r){return}var s=a||e.type;if(e.start>=r&&i(s,e)){throw new t(e,n)}o[s](e,n,c)})(e,a)}catch(e){if(e instanceof t){return e}throw e}}function findNodeBefore(e,r,i,o,a){i=makeTest(i);if(!o){o=n}var s;(function c(e,n,a){if(e.start>r){return}var f=a||e.type;if(e.end<=r&&(!s||s.node.end<e.end)&&i(f,e)){s=new t(e,n)}o[f](e,n,c)})(e,a);return s}function make(e,t){var r=Object.create(t||n);for(var i in e){r[i]=e[i]}return r}function skipThrough(e,t,n){n(e,t)}function ignore(e,t,n){}var n={};n.Program=n.BlockStatement=n.StaticBlock=function(e,t,n){for(var r=0,i=e.body;r<i.length;r+=1){var o=i[r];n(o,t,"Statement")}};n.Statement=skipThrough;n.EmptyStatement=ignore;n.ExpressionStatement=n.ParenthesizedExpression=n.ChainExpression=function(e,t,n){return n(e.expression,t,"Expression")};n.IfStatement=function(e,t,n){n(e.test,t,"Expression");n(e.consequent,t,"Statement");if(e.alternate){n(e.alternate,t,"Statement")}};n.LabeledStatement=function(e,t,n){return n(e.body,t,"Statement")};n.BreakStatement=n.ContinueStatement=ignore;n.WithStatement=function(e,t,n){n(e.object,t,"Expression");n(e.body,t,"Statement")};n.SwitchStatement=function(e,t,n){n(e.discriminant,t,"Expression");for(var r=0,i=e.cases;r<i.length;r+=1){var o=i[r];n(o,t)}};n.SwitchCase=function(e,t,n){if(e.test){n(e.test,t,"Expression")}for(var r=0,i=e.consequent;r<i.length;r+=1){var o=i[r];n(o,t,"Statement")}};n.ReturnStatement=n.YieldExpression=n.AwaitExpression=function(e,t,n){if(e.argument){n(e.argument,t,"Expression")}};n.ThrowStatement=n.SpreadElement=function(e,t,n){return n(e.argument,t,"Expression")};n.TryStatement=function(e,t,n){n(e.block,t,"Statement");if(e.handler){n(e.handler,t)}if(e.finalizer){n(e.finalizer,t,"Statement")}};n.CatchClause=function(e,t,n){if(e.param){n(e.param,t,"Pattern")}n(e.body,t,"Statement")};n.WhileStatement=n.DoWhileStatement=function(e,t,n){n(e.test,t,"Expression");n(e.body,t,"Statement")};n.ForStatement=function(e,t,n){if(e.init){n(e.init,t,"ForInit")}if(e.test){n(e.test,t,"Expression")}if(e.update){n(e.update,t,"Expression")}n(e.body,t,"Statement")};n.ForInStatement=n.ForOfStatement=function(e,t,n){n(e.left,t,"ForInit");n(e.right,t,"Expression");n(e.body,t,"Statement")};n.ForInit=function(e,t,n){if(e.type==="VariableDeclaration"){n(e,t)}else{n(e,t,"Expression")}};n.DebuggerStatement=ignore;n.FunctionDeclaration=function(e,t,n){return n(e,t,"Function")};n.VariableDeclaration=function(e,t,n){for(var r=0,i=e.declarations;r<i.length;r+=1){var o=i[r];n(o,t)}};n.VariableDeclarator=function(e,t,n){n(e.id,t,"Pattern");if(e.init){n(e.init,t,"Expression")}};n.Function=function(e,t,n){if(e.id){n(e.id,t,"Pattern")}for(var r=0,i=e.params;r<i.length;r+=1){var o=i[r];n(o,t,"Pattern")}n(e.body,t,e.expression?"Expression":"Statement")};n.Pattern=function(e,t,n){if(e.type==="Identifier"){n(e,t,"VariablePattern")}else if(e.type==="MemberExpression"){n(e,t,"MemberPattern")}else{n(e,t)}};n.VariablePattern=ignore;n.MemberPattern=skipThrough;n.RestElement=function(e,t,n){return n(e.argument,t,"Pattern")};n.ArrayPattern=function(e,t,n){for(var r=0,i=e.elements;r<i.length;r+=1){var o=i[r];if(o){n(o,t,"Pattern")}}};n.ObjectPattern=function(e,t,n){for(var r=0,i=e.properties;r<i.length;r+=1){var o=i[r];if(o.type==="Property"){if(o.computed){n(o.key,t,"Expression")}n(o.value,t,"Pattern")}else if(o.type==="RestElement"){n(o.argument,t,"Pattern")}}};n.Expression=skipThrough;n.ThisExpression=n.Super=n.MetaProperty=ignore;n.ArrayExpression=function(e,t,n){for(var r=0,i=e.elements;r<i.length;r+=1){var o=i[r];if(o){n(o,t,"Expression")}}};n.ObjectExpression=function(e,t,n){for(var r=0,i=e.properties;r<i.length;r+=1){var o=i[r];n(o,t)}};n.FunctionExpression=n.ArrowFunctionExpression=n.FunctionDeclaration;n.SequenceExpression=function(e,t,n){for(var r=0,i=e.expressions;r<i.length;r+=1){var o=i[r];n(o,t,"Expression")}};n.TemplateLiteral=function(e,t,n){for(var r=0,i=e.quasis;r<i.length;r+=1){var o=i[r];n(o,t)}for(var a=0,s=e.expressions;a<s.length;a+=1){var f=s[a];n(f,t,"Expression")}};n.TemplateElement=ignore;n.UnaryExpression=n.UpdateExpression=function(e,t,n){n(e.argument,t,"Expression")};n.BinaryExpression=n.LogicalExpression=function(e,t,n){n(e.left,t,"Expression");n(e.right,t,"Expression")};n.AssignmentExpression=n.AssignmentPattern=function(e,t,n){n(e.left,t,"Pattern");n(e.right,t,"Expression")};n.ConditionalExpression=function(e,t,n){n(e.test,t,"Expression");n(e.consequent,t,"Expression");n(e.alternate,t,"Expression")};n.NewExpression=n.CallExpression=function(e,t,n){n(e.callee,t,"Expression");if(e.arguments){for(var r=0,i=e.arguments;r<i.length;r+=1){var o=i[r];n(o,t,"Expression")}}};n.MemberExpression=function(e,t,n){n(e.object,t,"Expression");if(e.computed){n(e.property,t,"Expression")}};n.ExportNamedDeclaration=n.ExportDefaultDeclaration=function(e,t,n){if(e.declaration){n(e.declaration,t,e.type==="ExportNamedDeclaration"||e.declaration.id?"Statement":"Expression")}if(e.source){n(e.source,t,"Expression")}};n.ExportAllDeclaration=function(e,t,n){if(e.exported){n(e.exported,t)}n(e.source,t,"Expression")};n.ImportDeclaration=function(e,t,n){for(var r=0,i=e.specifiers;r<i.length;r+=1){var o=i[r];n(o,t)}n(e.source,t,"Expression")};n.ImportExpression=function(e,t,n){n(e.source,t,"Expression")};n.ImportSpecifier=n.ImportDefaultSpecifier=n.ImportNamespaceSpecifier=n.Identifier=n.PrivateIdentifier=n.Literal=ignore;n.TaggedTemplateExpression=function(e,t,n){n(e.tag,t,"Expression");n(e.quasi,t,"Expression")};n.ClassDeclaration=n.ClassExpression=function(e,t,n){return n(e,t,"Class")};n.Class=function(e,t,n){if(e.id){n(e.id,t,"Pattern")}if(e.superClass){n(e.superClass,t,"Expression")}n(e.body,t)};n.ClassBody=function(e,t,n){for(var r=0,i=e.body;r<i.length;r+=1){var o=i[r];n(o,t)}};n.MethodDefinition=n.PropertyDefinition=n.Property=function(e,t,n){if(e.computed){n(e.key,t,"Expression")}if(e.value){n(e.value,t,"Expression")}};e.ancestor=ancestor;e.base=n;e.findNodeAfter=findNodeAfter;e.findNodeAround=findNodeAround;e.findNodeAt=findNodeAt;e.findNodeBefore=findNodeBefore;e.full=full;e.fullAncestor=fullAncestor;e.make=make;e.recursive=recursive;e.simple=simple}))}};if(typeof __nccwpck_require__!=="undefined")__nccwpck_require__.ab=__dirname+"/";var t={};e[390](0,t);module.exports=t})();

package/dist/node_modules/acorn-walk/node_modules/acorn/bin/acorn

@@ -0,0 +1,4 @@
+#!/usr/bin/env node
+"use strict"
+
+require("../dist/bin.js")