Module c2rust_refactor::util::dataflow

Worklist algorithm for finding fixed points.

Structs

Ctxt	Worklist algorithm context. K is the type of keys, which identify nodes, and V is the type of value associated with each node. Allows indexing to retrieve data from other nodes. Accessing the current node's data triggers a panic.

Functions

iterate

Run an iterative worklist algorithm to find a fixed point. data should be pre-initialized with data for each relevant key. This function will call update(k, v, ctx) for each node. Use ctx[other_k] to obtain data for other nodes.