package coq

You can search for identifiers within the package.

in-package search v0.2.0

Package contains no libraries

type key = universe_level

type +'a t

val empty : 'a t

val is_empty : 'a t -> bool

val mem : key -> 'a t -> bool

val add : key -> 'a -> 'a t -> 'a t

val singleton : key -> 'a -> 'a t

val remove : key -> 'a t -> 'a t

val merge : 
  (key -> 'a option -> 'b option -> 'c option) ->
  'a t ->
  'b t ->
  'c t

val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int

val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool

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

val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b

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

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

val filter : (key -> 'a -> bool) -> 'a t -> 'a t

val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t

val cardinal : 'a t -> int

val bindings : 'a t -> (key * 'a) list

val min_binding : 'a t -> key * 'a

val max_binding : 'a t -> key * 'a

val choose : 'a t -> key * 'a

val split : key -> 'a t -> 'a t * 'a option * 'a t

val find : key -> 'a t -> 'a

val map : ('a -> 'b) -> 'a t -> 'b t

val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t

val get : key -> 'a t -> 'a

val update : key -> 'a -> 'a t -> 'a t

val modify : key -> (key -> 'a -> 'a) -> 'a t -> 'a t

val domain : 'a t -> LSet.t

val bind : (key -> 'a) -> LSet.t -> 'a t

val fold_left : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b

val fold_right : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b

val smartmap : ('a -> 'a) -> 'a t -> 'a t

val smartmapi : (key -> 'a -> 'a) -> 'a t -> 'a t

val height : 'a t -> int

module Unsafe : sig ... end

module Monad (M : CMap.MonadS) : sig ... end

val union : 'a t -> 'a t -> 'a t

val diff : 'a t -> 'a t -> 'a t

val subst_union : 'a option t -> 'a option t -> 'a option t

val pr : ('a -> Pp.std_ppcmds) -> 'a t -> Pp.std_ppcmds