esast (and estree) utility to visit nodes

Downloads in past


201.2.04 months ago2 years agoMinified + gzip package size for estree-util-visit in KB


!Buildbuild-badgebuild !Coveragecoverage-badgecoverage !Downloadsdownloads-badgedownloads !Sizesize-badgesize !Sponsorssponsors-badgecollective !Backersbackers-badgecollective !Chatchat-badgechat
esast (and estree) utility to visit nodes.


*   [`visit(tree, visitor|visitors)`](#visittree-visitorvisitors)

What is this?

This package is a utility that helps you walk the tree.

When should I use this?

This package helps when dealing with JavaScript ASTs. Use unist-util-visitunist-util-visit for other unist ASTs.


This package is ESM onlyesm. In Node.js (version 12.20+, 14.14+, 16.0+, or 18.0+), install with npm:
npm install estree-util-visit

In Deno with esm.shesmsh:
import {visit} from ''

In browsers with esm.shesmsh:
<script type="module">
  import {visit} from ''


import {parse} from 'acorn'
import {visit} from 'estree-util-visit'

const tree = parse(
  'export function x() { console.log(1 + "2"); process.exit(3) }',
  {sourceType: 'module', ecmaVersion: 2020}

visit(tree, (node) => {
  if (node.type === 'Literal' && 'value' in node) console.log(node.value)

// Both enter and leave:
walk(tree, {
  enter(node, field, index, parents) { /* … */ },
  leave(node, field, index, parents) { /* … */ }



This package exports the identifiers visit, EXIT, CONTINUE, and SKIP. There is no default export.

visit(tree, visitor|visitors)

Visit nodes (inclusive descendantsdescendant of treetree), with ancestral information.
This algorithm performs depth-firstdepth-first tree traversaltree-traversal in preorderpreorder (NLR) and/or postorderpostorder (LRN).
Compared to other estree walkers, this does not need a dictionary of which fields are nodes, because it ducktypes instead.
Walking the tree is an intensive task. Make use of the return values of the visitor(s) when possible. Instead of walking a tree multiple times, walk it once, use unist-util-isis to check if a node matches, and then perform different operations.
— same as passing `{enter: visitor}`
  • visitors ({enter: visitor, exit: visitor})
— two functions, respectively called when entering a node ([preorder][])
or before leaving a node ([postorder][])

next? = visitor(node, key, index, ancestors)

Called when a node is found.
Visitors are free to transform node. They can also transform the parent of node (the last of ancestors). Replacing node itself, if SKIP is not returned, still causes its descendants to be walked. If adding or removing previous siblings of node, visitor should return a new indexindex (number) to specify the sibling to traverse after node is traversed. Adding or removing next siblings of node is handled as expected without needing to return a new index.
  • node (Nodenode) — found node
  • key (string?) — field at which node lives in its parent
  • index (number?) — index at which node lives if parent[key] is an
  • ancestors (Array<Node>) — ancestors of node
The return value can have the following forms:
  • index (number) — treated as a tuple of [CONTINUE, index]
  • action (symbol) — treated as a tuple of [action]
  • tuple (Array<symbol|number>) — list with one or two values, the first
an `action`, the second and `index`.
Note that passing a tuple only makes sense if the `action` is `SKIP`.
If the `action` is `EXIT`, that action can be returned.
If the `action` is `CONTINUE`, `index` can be returned.
An action can have the following values:
  • EXIT (symbol) — stop traversing immediately
  • CONTINUE (symbol) — continue traversing as normal (same behaviour
as not returning an action)
  • SKIP (symbol) — do not traverse this node’s children.
Has no effect in `leave`


This package is fully typed with TypeScript. It exports the additional types Action, Index, ActionTuple, Visitor, and Visitors.


Projects maintained by the unified collective are compatible with all maintained versions of Node.js. As of now, that is Node.js 12.20+, 14.14+, 16.0+, and 18.0+. Our projects sometimes work with older versions, but this is not guaranteed.


— walk any unist tree


See contributing.mdcontributing in syntax-tree/.githubhealth for ways to get started. See support.mdsupport for ways to get help.
This project has a code of conductcoc. By interacting with this repository, organization, or community you agree to abide by its terms.


MITlicense © Titus Wormerauthor