DIET Maps from integers, packed using ranges
val empty : eq:('a -> 'a -> bool) -> 'a tThe empty map. Needs one parameter: a comparison function for the values, to enable merging of ranges with identical values.
val singleton : eq:('a -> 'a -> bool) -> int -> 'a -> 'a tval is_empty : 'a t -> boolTest whether a map is empty (i.e. has no bindings)
add_range lo hi y t adds bindings to y for all values in the range lo,hi, returning a new map
val find : int -> 'a t -> 'afind x t returns the y that is bound to x in t.
Not_found if x is unbound
modify x f t replaces the y that is bound to x in t by f y.
Not_found if x is unbound
modify_def dft x f t does the same as modify x f t but binds x to f dft if x was not bound.
modify_opt x f t allows to modify the binding for x in t or absence thereof.
val mem : int -> 'a t -> boolTest whether there is a binding from the given int
val iter : (int -> 'a -> unit) -> 'a t -> unititer f t calls f on every binding
val iter_range : (int -> int -> 'a -> unit) -> 'a t -> unititer_range f t calls f on every contiguous range. For maps, contiguous ranges must map to the same y
Create a new map by modifying each y by the given function. This will not create new ranges; the mapping function is only applied to each contiguous range once. It is not applied to the ranges in order. ~eq defaults to (=).
Create a new map by computing new values based on key and value of the existing bindings. This can create new ranges, as adjacent bindings can be assigned different values. ~eq defaults to (=).
Create a new map by modifying each y using the given function. This will not create new ranges, but will have access to the lo,hi of the current range. ~eq defaults to (=).
val fold : (int -> 'b -> 'a -> 'a) -> 'b t -> 'a -> 'afold f t x0 folds all the bindings of t into x0 using f to merge.
val fold_range : (int -> int -> 'b -> 'a -> 'a) -> 'b t -> 'a -> 'afold_range f t x0 folds all the contiguous ranges of t into x0 using f to merge. The order of foldings is unspecified.
set_to_map s x returns a map where every element of s is bound to x.
map_to_set p t returns the set of keys of t where p evaluates as true
of_enum e returns the set of given ranges
fold2_range f t u x0 folds across each range that's defined in either t or u or both, giving that range and the possible values to f to merge with x0.
Example: let union_first = fold2_range (fun _lo _hi a b = match a,b with Some x,_ -> x | _,Some y -> y)
val get_dec_eq : 'a t -> 'a -> 'a -> boolGet the equality function used in an IMap.t