fast-walk 0.2.0

A fast reimplementation of ast.walk()

fast-walk

A fast reimplementation of Python's ast.walk, written in Rust.

Installation

pip install fast-walk

Usage

Two public entry points, depending on whether you care about traversal order:

import ast
from fast_walk import walk_dfs, walk_unordered

tree = ast.parse("def f(x): return x + 1")

# Strict depth-first pre-order.
for node in walk_dfs(tree):
    ...

# Implementation-defined order; same node set, faster.
# ast.walk itself makes no ordering guarantee, so this is a drop-in for most code.
for node in walk_unordered(tree):
    ...

Which one to use

• walk_unordered — default choice. Same set of nodes as ast.walk but with better cache behavior (batched dict-metadata prefetching). Roughly 25% faster than walk_dfs on real Python source.
• walk_dfs — pick this only if your code actually depends on depth-first pre-order visitation. ast.walk does not document an order, so most callers can safely use walk_unordered.

Performance

Benchmark on CPython 3.13, walking the AST of difflib.py (~2000 lines, ~4300 unique AST nodes), best-of-N run pinned to a single CPU with the performance governor:

implementation	min time	relative
ast.walk (stdlib)	~2.3 ms	1×
pure-Python equivalent	~1.0 ms	~2×
fast_walk.walk_dfs	~18 µs	~130×
fast_walk.walk_unordered	~13 µs	~180×

Both fast_walk entry points are semantically equivalent to list(ast.walk(node)) — they return the same set of AST nodes. They differ only in visit order.

Development

Prerequisites

• Rust (latest stable)
• Python 3.13+
• maturin

Building from source

pip install maturin

# Iterative builds (debug profile):
maturin develop

# Optimized builds for benchmarking:
maturin develop --release

Running the tests and benchmarks

# Correctness + refcount leak tests:
pytest tests/test_refcount.py

# Benchmarks (codspeed, walltime mode):
pytest tests/benchmarks.py --codspeed

License

MIT

Links

• Repository