Module Base.List.Assoc

Interpret a list of (key, value) pairs as a map in which only the first occurrence of a key affects the semantics, i.e.:

List.Assoc.xxx alist ...args...

is always the same as (or at least sort of isomorphic to):

Map.xxx (alist |> Map.of_alist_multi |> Map.map ~f:List.hd) ...args...
type ('a, 'b) t = ('a * 'b) list
include sig ... end
val t_of_sexp : (Sexp.t ‑> 'a) ‑> (Sexp.t ‑> 'b) ‑> Sexp.t ‑> ('a'bt
val sexp_of_t : ('a ‑> Sexp.t) ‑> ('b ‑> Sexp.t) ‑> ('a'bt ‑> Sexp.t
val add : ('a'bt ‑> equal:('a ‑> 'a ‑> bool) ‑> 'a ‑> 'b ‑> ('a'bt
val find : ('a'bt ‑> equal:('a ‑> 'a ‑> bool) ‑> 'a ‑> 'b option
val find_exn : ('a'bt ‑> equal:('a ‑> 'a ‑> bool) ‑> 'a ‑> 'b
val mem : ('a'bt ‑> equal:('a ‑> 'a ‑> bool) ‑> 'a ‑> bool
val remove : ('a'bt ‑> equal:('a ‑> 'a ‑> bool) ‑> 'a ‑> ('a'bt
val map : ('a'bt ‑> f:('b ‑> 'c) ‑> ('a'ct
val inverse : ('a'bt ‑> ('b'at

Bijectivity is not guaranteed because we allow a key to appear more than once.