package codex

  1. Overview
  2. Docs

Module Analysis_sva.StateSource

Sourcetype key = Var.t
Sourcetype 'a t
Sourcetype !'a value = 'a
Sourcemodule BaseMap : sig ... end
Sourceval empty : 'a t
Sourceval is_empty : 'a t -> bool
Sourceval unsigned_min_binding : 'a t -> key * 'a value
Sourceval unsigned_max_binding : 'a t -> key * 'a value
Sourceval singleton : key -> 'a value -> 'a t
Sourceval cardinal : 'a t -> int
Sourceval is_singleton : 'a t -> (key * 'a value) option
Sourceval find : key -> 'a t -> 'a value
Sourceval find_opt : key -> 'a t -> 'a value option
Sourceval mem : key -> 'a t -> bool
Sourceval remove : key -> 'a t -> 'a t
Sourceval pop_unsigned_minimum : 'a t -> (key * 'a value * 'a t) option
Sourceval pop_unsigned_maximum : 'a t -> (key * 'a value * 'a t) option
Sourceval insert : key -> ('a value option -> 'a value) -> 'a t -> 'a t
Sourceval update : key -> ('a value option -> 'a value option) -> 'a t -> 'a t
Sourceval add : key -> 'a value -> 'a t -> 'a t
Sourceval split : key -> 'a t -> 'a t * 'a value option * 'a t
Sourceval iter : (key -> 'a value -> unit) -> 'a t -> unit
Sourceval fold : (key -> 'a value -> 'acc -> 'acc) -> 'a t -> 'acc -> 'acc
Sourceval filter : (key -> 'a value -> bool) -> 'a t -> 'a t
Sourceval for_all : (key -> 'a value -> bool) -> 'a t -> bool
Sourceval map : ('a value -> 'a value) -> 'a t -> 'a t
Sourceval map_no_share : ('a value -> 'b value) -> 'a t -> 'b t
Sourceval mapi : (key -> 'a value -> 'a value) -> 'a t -> 'a t
Sourceval mapi_no_share : (key -> 'a value -> 'b value) -> 'a t -> 'b t
Sourceval filter_map : (key -> 'a value -> 'a value option) -> 'a t -> 'a t
Sourceval filter_map_no_share : (key -> 'a value -> 'b value option) -> 'a t -> 'b t
Sourceval reflexive_same_domain_for_all2 : (key -> 'a value -> 'a value -> bool) -> 'a t -> 'a t -> bool
Sourceval nonreflexive_same_domain_for_all2 : (key -> 'a value -> 'b value -> bool) -> 'a t -> 'b t -> bool
Sourceval reflexive_subset_domain_for_all2 : (key -> 'a value -> 'a value -> bool) -> 'a t -> 'a t -> bool
Sourceval nonreflexive_subset_domain_for_all2 : (key -> 'a value -> 'b value -> bool) -> 'a t -> 'b t -> bool
Sourceval reflexive_any_domain_for_all2 : (key -> 'a value option -> 'b value option -> bool) -> 'a t -> 'b t -> bool
Sourceval nonreflexive_any_domain_for_all2 : (key -> 'a value option -> 'b value option -> bool) -> 'a t -> 'b t -> bool
Sourceval reflexive_equal : ('a value -> 'a value -> bool) -> 'a t -> 'a t -> bool
Sourceval reflexive_compare : ('a value -> 'a value -> int) -> 'a t -> 'a t -> int
Sourceval disjoint : 'a t -> 'a t -> bool
Sourceval min_binding_inter : 'a t -> 'b t -> (key * 'a value * 'b value) option
Sourceval max_binding_inter : 'a t -> 'b t -> (key * 'a value * 'b value) option
Sourceval idempotent_union : (key -> 'a value -> 'a value -> 'a value) -> 'a t -> 'a t -> 'a t
Sourceval nonidempotent_union : (key -> 'a value -> 'a value -> 'a value) -> 'a t -> 'a t -> 'a t
Sourceval idempotent_inter : (key -> 'a value -> 'a value -> 'a value) -> 'a t -> 'a t -> 'a t
Sourceval nonidempotent_inter_no_share : (key -> 'a value -> 'b value -> 'c value) -> 'a t -> 'b t -> 'c t
Sourceval idempotent_inter_filter : (key -> 'a value -> 'a value -> 'a value option) -> 'a t -> 'a t -> 'a t
Sourceval nonidempotent_inter_filter_no_share : (key -> 'a value -> 'b value -> 'c value option) -> 'a t -> 'b t -> 'c t
Sourceval slow_merge : (key -> 'a value option -> 'b value option -> 'c value option) -> 'a t -> 'b t -> 'c t
Sourceval symmetric_difference : (key -> 'a value -> 'a value -> 'a value option) -> 'a t -> 'a t -> 'a t
Sourceval difference : (key -> 'a value -> 'a value -> 'a value option) -> 'a t -> 'a t -> 'a t
Sourceval for_all2 : reflexive:bool -> left_only:(key -> 'a value -> bool) PatriciaTree.forall2_pred -> common:(key -> 'a value -> 'b value -> bool) PatriciaTree.forall2_pred -> right_only:(key -> 'b value -> bool) PatriciaTree.forall2_pred -> 'a t -> 'b t -> bool
Sourceval exists2 : reflexive:bool -> left_only:(key -> 'a value -> bool) PatriciaTree.forall2_pred -> common:(key -> 'a value -> 'b value -> bool) PatriciaTree.forall2_pred -> right_only:(key -> 'b value -> bool) PatriciaTree.forall2_pred -> 'a t -> 'b t -> bool
Sourceval fold2 : reflexive:bool -> left_only:(key -> 'a value -> 'r -> 'r) option -> common:(key -> 'a value -> 'b value -> 'r -> 'r) option -> right_only:(key -> 'b value -> 'r -> 'r) option -> 'a t -> 'b t -> 'r -> 'r
Sourceval iter2 : reflexive:bool -> left_only:(key -> 'a value -> unit) option -> common:(key -> 'a value -> 'b value -> unit) option -> right_only:(key -> 'b value -> unit) option -> 'a t -> 'b t -> unit
Sourceval fold_on_nonequal_inter : (key -> 'a value -> 'b value -> 'acc -> 'acc) -> 'a t -> 'b t -> 'acc -> 'acc
Sourceval fold_on_inter : (key -> 'a value -> 'b value -> 'acc -> 'acc) -> 'a t -> 'b t -> 'acc -> 'acc
Sourceval fold_on_nonequal_union : (key -> 'a value option -> 'b value option -> 'acc -> 'acc) -> 'a t -> 'b t -> 'acc -> 'acc
Sourceval fold_on_union : (key -> 'a value option -> 'b value option -> 'acc -> 'acc) -> 'a t -> 'b t -> 'acc -> 'acc
Sourcemodule WithForeign (Map2 : sig ... end) : sig ... end
Sourceval pretty : ?pp_sep:??? -> (Format.formatter -> key -> 'a value -> unit) -> Format.formatter -> 'a t -> unit
Sourceval to_seq : 'a t -> (key * 'a value) Seq.t
Sourceval to_rev_seq : 'a t -> (key * 'a value) Seq.t
Sourceval add_seq : (key * 'a value) Seq.t -> 'a t -> 'a t
Sourceval of_seq : (key * 'a value) Seq.t -> 'a t
Sourceval of_list : (key * 'a value) list -> 'a t
Sourceval to_list : 'a t -> (key * 'a value) list