package dune

You can search for identifiers within the package.

in-package search v0.2.0

Fast, portable and opinionated build system

Install

Dune Dependency

github.com Readme Changelog MIT License Edit opam file Versions (19)

Authors

J

Jane Street Group, LLC

Maintainers

J

Jane Street developers

Sources

dune-1.9.3.tbz

sha256=317bec6de4429b5dee157e9864294e1534b722a2acfc50480bd16c804ab790ca

sha512=17450333156622d4612816f9ad5a224c741d62b247d63c1d77b5359d37517c1f9bc598dd11fa024f4e02ccf7eef474cd532eef1d9c34ed13439db6c781f9fa7a

doc/dune._stdune/Stdune/String/Map/index.html

Module `String.Map`

include Map.S with type key = t

type key = t

and +'a t

val empty : 'a t

val is_empty : 'a t -> bool

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

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

val update : 'a t -> key -> f:('a option -> 'a option) -> 'a t

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

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

val add_multi : 'a list t -> key -> 'a -> 'a list t

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

val union : 'a t -> 'a t -> f:(key -> 'a -> 'a -> 'a option) -> 'a t

val superpose : 'a t -> 'a t -> 'a t

superpose a b is b augmented with bindings of a that are not in b.

val compare : 'a t -> 'a t -> compare:('a -> 'a -> Ordering.t) -> Ordering.t

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

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

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

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

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

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

val for_alli : 'a t -> f:(key -> 'a -> bool) -> bool

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

val existsi : 'a t -> f:(key -> 'a -> bool) -> bool

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

val filteri : 'a t -> f:(key -> 'a -> bool) -> 'a t

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

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

val cardinal : 'a t -> int

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

val of_list : (key * 'a) list -> ('a t, key * 'a * 'a) Result.t

val of_list_map : 
  'a list ->
  f:('a -> key * 'b) ->
  ('b t, key * 'a * 'a) Result.t

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

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

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

val keys : 'a t -> key list

val values : 'a t -> 'a list

val min_binding : 'a t -> (key * 'a) option

val max_binding : 'a t -> (key * 'a) option

val choose : 'a t -> (key * 'a) option

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

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

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

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

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

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

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

module Multi : sig ... end

val pp : (Format.formatter -> 'a -> unit) -> Format.formatter -> 'a t -> unit

val to_dyn : ('a -> Stdune__.Dyn0.t) -> 'a t -> Stdune__.Dyn0.t