package bap-std
Graph of Term identifiers.
This is a graph where all information is distilled to term identifiers and relations between them, that are also labeled with term identifiers.
type node = tid
val start : node
start
is a pseudo node that is used as the entry node of a graph.
val exit : node
exit
is a pseudo node that is used as the exit node of a graph.
include Graphlib.Std.Graph
with type node := tid
and type Node.label = tid
and type Edge.label = tid
module Node : sig ... end
module Edge : sig ... end
val empty : t
val number_of_edges : t -> int
val number_of_nodes : t -> int
val comparator : (t, comparator_witness) Base__Comparator.comparator
module Replace_polymorphic_compare : sig ... end
module Map : sig ... end
module Set : sig ... end
val hash_fold_t :
Ppx_hash_lib.Std.Hash.state ->
t ->
Ppx_hash_lib.Std.Hash.state
val hash : t -> Ppx_hash_lib.Std.Hash.hash_value
val hashable : t Core_kernel__.Hashtbl.Hashable.t
module Table : sig ... end
module Hash_set : sig ... end
module Hash_queue : sig ... end
val to_string : t -> string
val str : unit -> t -> string
val pps : unit -> t -> string
val ppo : Core_kernel.Out_channel.t -> t -> unit
val pp_seq : Stdlib.Format.formatter -> t Core_kernel.Sequence.t -> unit
val pp : Base__.Formatter.t -> t -> unit
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>