package ocamlgraph

  1. Overview
  2. Docs
package ocamlgraph
Legend:
Library
Module
Module type
Parameter
Class
Class type

Parameters

module G : G

Signature

module S : sig ... end
type idom = G.V.t -> G.V.t
type idoms = G.V.t -> G.V.t -> bool
type dom_tree = G.V.t -> G.V.t list
type dominators = G.V.t -> G.V.t list
type dom = G.V.t -> G.V.t -> bool
type sdom = G.V.t -> G.V.t -> bool
type dom_frontier = G.V.t -> G.V.t list
type dom_graph = unit -> G.t
type dom_functions = {
  1. idom : idom;
  2. idoms : idoms;
  3. dom_tree : dom_tree;
  4. dominators : dominators;
  5. dom : dom;
  6. sdom : sdom;
  7. dom_frontier : dom_frontier;
  8. dom_graph : dom_graph;
}
val compute_idom : G.t -> G.V.t -> G.V.t -> G.V.t
val dominators_to_dom : ('a -> S.t) -> S.elt -> 'a -> bool
val dominators_to_sdom : (G.V.t -> S.t) -> S.elt -> G.V.t -> bool
val dom_to_sdom : (G.V.t -> G.V.t -> bool) -> G.V.t -> G.V.t -> bool
val dominators_to_sdominators : (S.elt -> S.t) -> S.elt -> S.t
val dominators_to_idoms : (S.elt -> S.t) -> S.elt -> S.elt -> bool
val dominators_to_dom_tree : G.t -> ?pred:(G.t -> S.elt -> S.elt list) -> (S.elt -> S.t) -> S.elt -> S.t
val idom_to_dom_tree : G.t -> (G.V.t -> G.V.t) -> G.V.t -> G.V.t list
val idom_to_idoms : idom -> G.V.t -> G.V.t -> bool
val compute_dom_frontier : G.t -> dom_tree -> idom -> G.V.t -> G.V.t list
val idom_to_dominators : ('a -> 'a) -> 'a -> 'a list
val idom_to_dom : (G.V.t -> G.V.t) -> G.V.t -> G.V.t -> bool
val compute_dom_graph : G.t -> dom_tree -> G.t
val compute_all : G.t -> G.V.t -> dom_functions
OCaml

Innovation. Community. Security.

GitHub Discord Twitter Peertube RSS
About
Changelog Releases Industrial Users Academic Users Why OCaml
Ecosystem
Packages Community Events OCaml Planet Jobs
Resources
Install OCaml Get Started Platform Tools Language Manual Standard Library API Books Exercises Papers OCaml Playground Logo
Policies
Carbon Footprint Governance Privacy Code of Conduct