package bap-dwarf

You can search for identifiers within the package.

in-package search v0.2.0

Legend:
Library
Module
Module type
Parameter
Class
Class type

module Key : sig ... end

type 'a t

val sexp_of_t : ('a -> Sexplib.Sexp.t) -> 'a t -> Sexplib.Sexp.t

val length : 'a t -> int

val is_empty : 'a t -> bool

val iter : 'a t -> f:('a -> unit) -> unit

val fold : 'a t -> init:'accum -> f:('accum -> 'a -> 'accum) -> 'accum

val exists : 'a t -> f:('a -> bool) -> bool

val for_all : 'a t -> f:('a -> bool) -> bool

val count : 'a t -> f:('a -> bool) -> int

val sum : 
  (module Core_kernel.Commutative_group.S with type t = 'sum) ->
  'a t ->
  f:('a -> 'sum) ->
  'sum

val find : 'a t -> f:('a -> bool) -> 'a option

val find_map : 'a t -> f:('a -> 'b option) -> 'b option

val to_list : 'a t -> 'a list

val to_array : 'a t -> 'a array

val min_elt : 'a t -> cmp:('a -> 'a -> int) -> 'a option

val max_elt : 'a t -> cmp:('a -> 'a -> int) -> 'a option

val invariant : 'a t -> unit

val create : ?growth_allowed:bool -> ?size:int -> unit -> 'a t

val clear : 'a t -> unit

val mem : 'a t -> Key.t -> bool

val lookup : 'a t -> Key.t -> 'a option

val lookup_exn : 'a t -> Key.t -> 'a

val enqueue : 'a t -> Key.t -> 'a -> [ `Key_already_present | `Ok ]

val enqueue_exn : 'a t -> Key.t -> 'a -> unit

val first : 'a t -> 'a option

val first_with_key : 'a t -> (Key.t * 'a) option

val keys : 'a t -> Key.t list

val dequeue : 'a t -> 'a option

val dequeue_exn : 'a t -> 'a

val dequeue_with_key : 'a t -> (Key.t * 'a) option

val dequeue_with_key_exn : 'a t -> Key.t * 'a

val dequeue_all : 'a t -> f:('a -> unit) -> unit

val remove : 'a t -> Key.t -> [ `No_such_key | `Ok ]

val remove_exn : 'a t -> Key.t -> unit

val replace : 'a t -> Key.t -> 'a -> [ `No_such_key | `Ok ]

val replace_exn : 'a t -> Key.t -> 'a -> unit

val iteri : 'a t -> f:(key:Key.t -> data:'a -> unit) -> unit

val foldi : 'a t -> init:'b -> f:('b -> key:Key.t -> data:'a -> 'b) -> 'b