package frama-c

You can search for identifiers within the package.

in-package search v0.2.0

Platform dedicated to the analysis of source code written in C

Install

Dune Dependency

frama-c.com Readme Edit opam file Versions (25)

Authors

Maintainers

F

frama-ci-bot@frama-c.com

Sources

frama-c-31.0-Gallium.tar.gz

sha256=a94384f00d53791cbb4b4d83ab41607bc71962d42461f02d71116c4ff6dca567

doc/frama-c.kernel/Frama_c_kernel/State_topological/Make/index.html

Module `State_topological.Make`

Functor providing topological iterators over a graph.

Parameters

module G : G

Signature

val fold : (State.t -> 'a -> 'a) -> G.t -> 'a -> 'a

fold action g seed allows iterating over the graph g in topological order. action node accu is called repeatedly, where node is the node being visited, and accu is the result of the action's previous invocation, if any, and seed otherwise. If g contains cycles, the order is unspecified inside the cycles and every node in the cycles will be presented exactly once.

val iter : (State.t -> unit) -> G.t -> unit

iter action calls action node repeatedly. Nodes are (again) presented to action in topological order. The order is the same as for fold.

On This Page

Parameters
Signature