Lazy iteration

Pull nodes without materializing t.paths / t.nodes. Circular references are visited once and not descended into.

Import as import * as t from 'neotraverse'.

values

for (const node of t.values(tree)) and [...t.values(tree)] yield every node depth-first (like t.nodes(), but lazy).

entries

t.entries(obj, options?) yields [path, node] pairs.

Example

import * as t from 'neotraverse';

const tree = { a: 1, b: { c: 2 } };

for (const node of t.values(tree)) {
  /* every node */
}

for (const [path, node] of t.entries(tree)) {
  /* path: PropertyKey[], node: value at that path */
}

Map and Set

By default, t.forEach, t.map, t.paths, t.nodes, and lazy iteration treat Map/Set as leaf nodes. Only t.clone (and the shallow t.map copy) descend into their entries.

Pass descendIntoMapSet: true (Options) to visit Map values at their keys and Set elements at numeric indices during walks.

Example: descend into Map entries

import * as t from 'neotraverse';

const m = new Map([['k', { v: 1 }]]);
const paths: PropertyKey[][] = [];

for (const [path] of t.entries(m, { descendIntoMapSet: true })) {
  paths.push(path);
}
// includes paths into nested object values

See Types & traversal for walk vs clone behaviour.