From 2c53ff31c9e3a0e57318181bb937f8136e759a7d Mon Sep 17 00:00:00 2001 From: "Node.js GitHub Bot" Date: Mon, 22 Jan 2024 17:17:05 +0200 Subject: [PATCH] deps: update acorn-walk to 8.3.2 MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit PR-URL: https://github.com/nodejs/node/pull/51457 Reviewed-By: Luigi Pinca Reviewed-By: Moshe Atlow Reviewed-By: Michaël Zasso --- deps/acorn/acorn-walk/dist/walk.d.mts | 61 +++++++++++++++------------ deps/acorn/acorn-walk/dist/walk.d.ts | 61 +++++++++++++++------------ deps/acorn/acorn-walk/package.json | 2 +- 3 files changed, 67 insertions(+), 57 deletions(-) diff --git a/deps/acorn/acorn-walk/dist/walk.d.mts b/deps/acorn/acorn-walk/dist/walk.d.mts index 7bc8c9790fd1a7..e07a6afaf8e336 100644 --- a/deps/acorn/acorn-walk/dist/walk.d.mts +++ b/deps/acorn/acorn-walk/dist/walk.d.mts @@ -66,10 +66,10 @@ export function simple( /** * 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 + * @param node + * @param visitors + * @param base + * @param state */ export function ancestor( node: acorn.Node, @@ -79,8 +79,8 @@ export function ancestor( ): 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 + * 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. @@ -94,10 +94,10 @@ export function recursive( /** * 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 + * @param node + * @param callback + * @param base + * @param state */ export function full( node: acorn.Node, @@ -108,10 +108,10 @@ export function full( /** * 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 + * @param node + * @param callback + * @param base + * @param state */ export function fullAncestor( node: acorn.Node, @@ -122,8 +122,8 @@ export function fullAncestor( /** * 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 + * @param functions + * @param base */ export function make( functions: RecursiveVisitors, @@ -132,12 +132,12 @@ export function make( /** * 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 + * @param node + * @param start + * @param end + * @param type + * @param base + * @param state */ export function findNodeAt( node: acorn.Node, @@ -150,11 +150,11 @@ export function findNodeAt( /** * 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 + * @param node + * @param start + * @param type + * @param base + * @param state */ export function findNodeAround( node: acorn.Node, @@ -165,8 +165,13 @@ export function findNodeAround( ): Found | undefined /** - * similar to {@link findNodeAround}, but will match all nodes after the given position (testing outer nodes before inner nodes). + * 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 diff --git a/deps/acorn/acorn-walk/dist/walk.d.ts b/deps/acorn/acorn-walk/dist/walk.d.ts index 7bc8c9790fd1a7..e07a6afaf8e336 100644 --- a/deps/acorn/acorn-walk/dist/walk.d.ts +++ b/deps/acorn/acorn-walk/dist/walk.d.ts @@ -66,10 +66,10 @@ export function simple( /** * 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 + * @param node + * @param visitors + * @param base + * @param state */ export function ancestor( node: acorn.Node, @@ -79,8 +79,8 @@ export function ancestor( ): 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 + * 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. @@ -94,10 +94,10 @@ export function recursive( /** * 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 + * @param node + * @param callback + * @param base + * @param state */ export function full( node: acorn.Node, @@ -108,10 +108,10 @@ export function full( /** * 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 + * @param node + * @param callback + * @param base + * @param state */ export function fullAncestor( node: acorn.Node, @@ -122,8 +122,8 @@ export function fullAncestor( /** * 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 + * @param functions + * @param base */ export function make( functions: RecursiveVisitors, @@ -132,12 +132,12 @@ export function make( /** * 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 + * @param node + * @param start + * @param end + * @param type + * @param base + * @param state */ export function findNodeAt( node: acorn.Node, @@ -150,11 +150,11 @@ export function findNodeAt( /** * 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 + * @param node + * @param start + * @param type + * @param base + * @param state */ export function findNodeAround( node: acorn.Node, @@ -165,8 +165,13 @@ export function findNodeAround( ): Found | undefined /** - * similar to {@link findNodeAround}, but will match all nodes after the given position (testing outer nodes before inner nodes). + * 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 diff --git a/deps/acorn/acorn-walk/package.json b/deps/acorn/acorn-walk/package.json index 393c87a39255a0..9d3b7e5248fb83 100644 --- a/deps/acorn/acorn-walk/package.json +++ b/deps/acorn/acorn-walk/package.json @@ -16,7 +16,7 @@ ], "./package.json": "./package.json" }, - "version": "8.3.1", + "version": "8.3.2", "engines": { "node": ">=0.4.0" },