bap-primus

The BAP Microexecution Framework
Legend:
Library
Module
Module type
Parameter
Class
Class type
Library bap_primus
Module Bap_primus . Std . Primus . Generator . Make . Machine . Id . Map . Tree
include Core_kernel.Map_intf.Make_S_plain_tree(Key).S
include Core_kernel.Map_intf.Creators_and_accessors1 with type 'a t := 'a t with type 'a tree := 'a t with type key := Key.t
include Core_kernel.Map_intf.Creators1 with type 'a t := 'a t with type 'a tree := 'a t with type key := Key.t
include Core_kernel.Map_intf.Map.Creators1 with type 'a t := 'a t with type 'a tree := 'a t with type key := Key.t
val empty : _ t
val singleton : Key.t -> 'a -> 'a t
val of_alist : (Key.t * 'a) list -> [ `Ok of 'a t | `Duplicate_key of Key.t ]
val of_alist_or_error : (Key.t * 'a) list -> 'a t Base.Or_error.t
val of_alist_exn : (Key.t * 'a) list -> 'a t
val of_alist_multi : (Key.t * 'a) list -> 'a list t
val of_alist_fold : (Key.t * 'a) list -> init:'b -> f:( 'b -> 'a -> 'b ) -> 'b t
val of_alist_reduce : (Key.t * 'a) list -> f:( 'a -> 'a -> 'a ) -> 'a t
val of_sorted_array : (Key.t * 'a) array -> 'a t Base.Or_error.t
val of_sorted_array_unchecked : (Key.t * 'a) array -> 'a t
val of_increasing_iterator_unchecked : len:int -> f:( int -> Key.t * 'a ) -> 'a t
val of_increasing_sequence : (Key.t * 'a) Base.Sequence.t -> 'a t Base.Or_error.t
val of_iteri : iteri:( f:( key:Key.t -> data:'v -> unit ) -> unit ) -> [ `Ok of 'v t | `Duplicate_key of Key.t ]
val of_tree : 'a t -> 'a t
val of_hashtbl_exn : ( Key.t, 'a ) Core_kernel.Hashtbl.t -> 'a t
include Core_kernel.Map_intf.Accessors1 with type 'a t := 'a t with type 'a tree := 'a t with type key := Key.t
include Core_kernel.Map_intf.Map.Accessors1 with type 'a t := 'a t with type 'a tree := 'a t with type key := Key.t
val invariants : _ t -> bool
val is_empty : _ t -> bool
val length : _ t -> int
val add : 'a t -> key:Key.t -> data:'a -> [ `Ok of 'a t | `Duplicate ]
val add_exn : 'a t -> key:Key.t -> data:'a -> 'a t
val set : 'a t -> key:Key.t -> data:'a -> 'a t
val add_multi : 'a list t -> key:Key.t -> data:'a -> 'a list t
val remove_multi : 'a list t -> Key.t -> 'a list t
val find_multi : 'a list t -> Key.t -> 'a list
val change : 'a t -> Key.t -> f:( 'a option -> 'a option ) -> 'a t
val update : 'a t -> Key.t -> f:( 'a option -> 'a ) -> 'a t
val find : 'a t -> Key.t -> 'a option
val find_exn : 'a t -> Key.t -> 'a
val remove : 'a t -> Key.t -> 'a t
val mem : _ t -> Key.t -> bool
val iter_keys : _ t -> f:( Key.t -> unit ) -> unit
val iter : 'a t -> f:( 'a -> unit ) -> unit
val iteri : 'a t -> f:( key:Key.t -> data:'a -> unit ) -> unit
val iter2 : 'a t -> 'b t -> f: ( key:Key.t -> data:[ `Left of 'a | `Right of 'b | `Both of 'a * 'b ] -> unit ) -> unit
val map : 'a t -> f:( 'a -> 'b ) -> 'b t
val mapi : 'a t -> f:( key:Key.t -> data:'a -> 'b ) -> 'b t
val fold : 'a t -> init:'b -> f:( key:Key.t -> data:'a -> 'b -> 'b ) -> 'b
val fold_right : 'a t -> init:'b -> f:( key:Key.t -> data:'a -> 'b -> 'b ) -> 'b
val fold2 : 'a t -> 'b t -> init:'c -> f: ( key:Key.t -> data:[ `Left of 'a | `Right of 'b | `Both of 'a * 'b ] -> 'c -> 'c ) -> 'c
val filter_keys : 'a t -> f:( Key.t -> bool ) -> 'a t
val filter : 'a t -> f:( 'a -> bool ) -> 'a t
val filteri : 'a t -> f:( key:Key.t -> data:'a -> bool ) -> 'a t
val filter_map : 'a t -> f:( 'a -> 'b option ) -> 'b t
val filter_mapi : 'a t -> f:( key:Key.t -> data:'a -> 'b option ) -> 'b t
val partition_mapi : 'a t -> f:( key:Key.t -> data:'a -> [ `Fst of 'b | `Snd of 'c ] ) -> 'b t * 'c t
val partition_map : 'a t -> f:( 'a -> [ `Fst of 'b | `Snd of 'c ] ) -> 'b t * 'c t
val partitioni_tf : 'a t ->