Provide utilities to create identified comparators or hashes for data structures used below.
It create a unique identifier per module of functions so that different data structures with slightly different comparison functions won't mix
type ('a, 'id) hash = ('a -> int) Js.Fn.arity1type ('a, 'id) eq = ('a -> 'a -> bool) Js.Fn.arity2type ('a, 'id) cmp = ('a -> 'a -> int) Js.Fn.arity2val getHashInternal : ('a, 'id) hash -> ('a -> int) Js.Fn.arity1val getEqInternal : ('a, 'id) eq -> ('a -> 'a -> bool) Js.Fn.arity2val getCmpInternal : ('a, 'id) cmp -> ('a -> 'a -> int) Js.Fn.arity2module type Comparable = sig ... endtype ('key, 'id) comparable =
(module Comparable
with type identity = 'id
and type t = 'key)module MakeComparableU (M : sig ... end) : sig ... endmodule MakeComparable (M : sig ... end) : sig ... endval comparableU :
cmp:('key -> 'key -> int) Js.Fn.arity2 ->
(module Comparable
with type t = 'key0)val comparable :
cmp:('key -> 'key -> int) ->
(module Comparable
with type t = 'key0)module type Hashable = sig ... endmodule MakeHashableU (M : sig ... end) : sig ... endmodule MakeHashable (M : sig ... end) : sig ... endval hashableU :
hash:('key -> int) Js.Fn.arity1 ->
eq:('key0 -> 'key0 -> bool) Js.Fn.arity2 ->
(module Hashable
with type t = 'key1)