A map that includes an entry for every possible value of the key type.
This is intended to be used on 'key types where there is a full enumeration of the
type. In the common use case, 'key will be a simple variant type with [@@deriving
compare, enumerate]. For example:
module Arrow_key = struct
module T = struct
type t =
| Up
| Down
| Left
| Right
[@@deriving sexp, bin_io, compare, enumerate]
end
include T
module Total_map = Total_map.Make (T)
endIn such a case, a t is semantically equivalent to a pure function from 'key to
'value. The differences are that it is serializable and that mapping or changing a
t will produce a t using the same amount of space as the original.
However, in theory you could also modify the comparison function and enumeration, so long as the enumeration contains at least one representative of each equivalence class determined by the comparison function.
Many of the functions below have types reflecting the fact that the maps are total
(e.g., find does not return an option). The fact that they won't raise exceptions
relies on the enumeration passed to Make being complete.
val iter_keys : ('key, _, _, _) t ‑> f:('key ‑> Core_kernel__.Import.unit) ‑> Core_kernel__.Import.unitval iter : (_, 'a, _, _) t ‑> f:('a ‑> Core_kernel__.Import.unit) ‑> Core_kernel__.Import.unitval iteri : ('key, 'a, _, _) t ‑> f:(key:'key ‑> data:'a ‑> Core_kernel__.Import.unit) ‑> Core_kernel__.Import.unitval iter2 : ('key, 'a, 'cmp, 'enum) t ‑> ('key, 'b, 'cmp, 'enum) t ‑> f:(key:'key ‑> 'a ‑> 'b ‑> Core_kernel__.Import.unit) ‑> Core_kernel__.Import.unitval to_alist : ?key_order:[ `Increasing | `Decreasing ] ‑> ('key, 'a, _, _) t ‑> ('key * 'a) Core_kernel__.Import.listval find : ('key, 'a, _, _) t ‑> 'key ‑> 'aval data : (_, 'a, _, _) t ‑> 'a Core_kernel__.Import.listval for_all : (_, 'a, _, _) t ‑> f:('a ‑> Core_kernel__.Import.bool) ‑> Core_kernel__.Import.boolmodule Sequence : functor (A : Core_kernel__.Std_internal.Applicative) -> sig ... endSequence a total map of computations in order of their keys resulting in computation of the total map of results.
The only reason that the Applicative interface isn't included here is that we don't
have an Applicative.S3.
module type Key : sig ... endmodule type S : sig ... endmodule Make_using_comparator : functor (Key : sig ... end) -> S with module Key = Key with type comparator_witness = Key.comparator_witness