module Hash: CCHashtypet =int
type state
type'ahash_fun ='a -> state -> state
'a, merging a fingerprint of the
value into the state of type tval init : stateval finish : state -> intval apply : 'a hash_fun -> 'a -> intapply f x is the same as finish (f x init)
Those combinators have been renamed in 0.13, so as to
remove the trailing "_".
They are now defined by the application of CCHash.Make
val bool_ : bool hash_funboolval char_ : char hash_funcharval int_ : int hash_funintval string_ : string hash_funstringval int32_ : int32 hash_funint32val int64_ : int64 hash_funint64val nativeint_ : nativeint hash_funnativeintval list_ : 'a hash_fun -> 'a list hash_funlistf.val array_ : 'a hash_fun -> 'a array hash_funarrayval opt : 'a hash_fun -> 'a option hash_fun
val pair : 'a hash_fun -> 'b hash_fun -> ('a * 'b) hash_fun
val triple : 'a hash_fun ->
'b hash_fun -> 'c hash_fun -> ('a * 'b * 'c) hash_fun
val if_ : bool -> 'a hash_fun -> 'a hash_fun -> 'a hash_funtype'asequence =('a -> unit) -> unit
type'agen =unit -> 'a option
type'aklist =unit -> [ `Cons of 'a * 'a klist | `Nil ]
val seq : 'a hash_fun -> 'a sequence hash_fun
val gen : 'a hash_fun -> 'a gen hash_fun
val klist : 'a hash_fun -> 'a klist hash_fun
Parametrize over the state, and some primitives to hash basic types.
This can for instance be used for cryptographic hashing or
checksums such as MD5.
module type HASH =sig..end
module type S =sig..end
module Make(H:HASH):Swith type state = H.state
include CCHash.S