type t = t
include Stdlib.Hashtbl.HashedType with type t := t
val hash : t -> intA hashing function on keys. It must be such that if two keys are equal according to
equal, then they have identical hash values as computed byhash. Examples: suitable (equal,hash) pairs for arbitrary key types include- (
(=),Hashtbl.hash) for comparing objects by structure (provided objects do not contain floats) - (
(fun x y -> compare x y = 0),Hashtbl.hash) for comparing objects by structure and handlingStdlib.nancorrectly - (
(==),Hashtbl.hash) for comparing objects by physical equality (e.g. for mutable or cyclic objects).
- (
include Stdlib.Map.OrderedType with type t := t
val compare : t -> t -> intA total ordering function over the keys. This is a two-argument function
fsuch thatf e1 e2is zero if the keyse1ande2are equal,f e1 e2is strictly negative ife1is smaller thane2, andf e1 e2is strictly positive ife1is greater thane2. Example: a suitable ordering function is the generic structural comparison functionStdlib.compare.
val output : Stdlib.out_channel -> t -> unitval print : Stdlib.Format.formatter -> t -> unit