package binsec

  1. Overview
  2. Docs
package binsec
Legend:
Page
Library
Module
Module type
Parameter
Class
Class type
Source

Module Make.GSource

include Graph.Sig.G with type V.t = int and type E.t = int * bool * int with type t = t
Sourcetype t = t
Sourcemodule V : sig ... end
Sourcetype vertex = V.t
Sourcemodule E : sig ... end
Sourcetype edge = E.t
Sourceval is_directed : bool
Sourceval is_empty : t -> bool
Sourceval nb_vertex : t -> int
Sourceval nb_edges : t -> int
Sourceval out_degree : t -> vertex -> int
Sourceval in_degree : t -> vertex -> int
Sourceval mem_vertex : t -> vertex -> bool
Sourceval mem_edge : t -> vertex -> vertex -> bool
Sourceval mem_edge_e : t -> edge -> bool
Sourceval find_edge : t -> vertex -> vertex -> edge
Sourceval find_all_edges : t -> vertex -> vertex -> edge list
Sourceval succ : t -> vertex -> vertex list
Sourceval pred : t -> vertex -> vertex list
Sourceval succ_e : t -> vertex -> edge list
Sourceval pred_e : t -> vertex -> edge list
Sourceval iter_vertex : (vertex -> unit) -> t -> unit
Sourceval fold_vertex : (vertex -> 'a -> 'a) -> t -> 'a -> 'a
Sourceval iter_edges : (vertex -> vertex -> unit) -> t -> unit
Sourceval fold_edges : (vertex -> vertex -> 'a -> 'a) -> t -> 'a -> 'a
Sourceval iter_edges_e : (edge -> unit) -> t -> unit
Sourceval fold_edges_e : (edge -> 'a -> 'a) -> t -> 'a -> 'a
Sourceval map_vertex : (vertex -> vertex) -> t -> t
Sourceval iter_succ : (vertex -> unit) -> t -> vertex -> unit
Sourceval iter_pred : (vertex -> unit) -> t -> vertex -> unit
Sourceval fold_succ : (vertex -> 'a -> 'a) -> t -> vertex -> 'a -> 'a
Sourceval fold_pred : (vertex -> 'a -> 'a) -> t -> vertex -> 'a -> 'a
Sourceval iter_succ_e : (edge -> unit) -> t -> vertex -> unit
Sourceval fold_succ_e : (edge -> 'a -> 'a) -> t -> vertex -> 'a -> 'a
Sourceval iter_pred_e : (edge -> unit) -> t -> vertex -> unit
Sourceval fold_pred_e : (edge -> 'a -> 'a) -> t -> vertex -> 'a -> 'a
Sourceval node : t -> vertex -> Ir.node
Sourceval is_new_vertex : t -> vertex -> bool
Sourceval iter_new_vertex : (vertex -> unit) -> t -> unit
Sourceval iter_entries : (vertex -> unit) -> t -> unit
Sourceval iter_exits : (vertex -> unit) -> t -> unit
Sourceval insert_before : t -> vertex -> Ir.fallthrough -> int
Sourceval insert_list_before : t -> vertex -> Ir.fallthrough list -> int
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