You can search for identifiers within the package.
in-package search v0.2.0
module A : Array
type t = A.t
val distance : ?upper_bound:int -> t -> t -> int
Calculate Levenshtein distance between two t's.
t
If we are only interested in the distance if it is smaller than some threshold, specifying upper_bound greatly improves the performance. In that case, the return value is always is culled to upper_bound.
upper_bound