package javalib

  1. Overview
  2. Docs
module type S = sig ... end
type +'a t
type key = int
val empty : 'a t
val is_empty : 'a t -> bool
val add : ?merge:('a -> 'a -> 'a) -> int -> 'a -> 'a t -> 'a t
val modify : int -> ('a option -> 'a) -> 'a t -> 'a t
val find : int -> 'a t -> 'a
val findi_element : (int -> 'a -> bool) -> 'a t -> int * 'a
val find_element : ('a -> bool) -> 'a t -> 'a
val remove : int -> 'a t -> 'a t
val mem : int -> 'a t -> bool
val iter : (int -> 'a -> unit) -> 'a t -> unit
val iter_ordered : ((int * 'a) -> (int * 'a) -> int) -> (int -> 'a -> unit) -> 'a t -> unit
val map : ('a -> 'b) -> 'a t -> 'b t
val mapi : (int -> 'a -> 'b) -> 'a t -> 'b t
val fold : (int -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val fold_ordered : ((int * 'a) -> (int * 'a) -> int) -> (int -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int
val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
val merge : ('a -> 'a -> 'a) -> 'a t -> 'a t -> 'a t
val merge_first : 'a t -> 'a t -> 'a t
val diff : ('a -> 'a -> bool) -> 'a t -> 'a t -> 'a t
val choose_and_remove : 'a t -> int * 'a * 'a t
val inter : 'a t -> 'a t -> 'a t
val inter_map2 : ('a -> 'a -> 'a) -> 'a t -> 'a t -> 'a t
val keys_subset : 'a t -> 'a t -> bool
val subset : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
val cardinal : 'a t -> int
val exists : (int -> 'a -> bool) -> 'a t -> bool
val filter : ('a -> bool) -> 'a t -> 'a t
val filteri : (int -> 'a -> bool) -> 'a t -> 'a t
val filter_map : ('a -> 'b option) -> 'a t -> 'b t
val partition : ('a -> bool) -> 'a t -> 'a t * 'a t
val elements : 'a t -> (int * 'a) list
OCaml

Innovation. Community. Security.