diff options
Diffstat (limited to 'clib/segmenttree.mli')
| -rw-r--r-- | clib/segmenttree.mli | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/clib/segmenttree.mli b/clib/segmenttree.mli index fa198f7ad6..eb2a7569fd 100644 --- a/clib/segmenttree.mli +++ b/clib/segmenttree.mli @@ -11,7 +11,7 @@ (** This module is a very simple implementation of "segment trees". A segment tree of type ['a t] represents a mapping from a union of - disjoint segments to some values of type 'a. + disjoint segments to some values of type 'a. *) (** A mapping from a union of disjoint segments to some values of type ['a]. *) @@ -19,11 +19,11 @@ type 'a t (** [make [(i1, j1), v1; (i2, j2), v2; ...]] creates a mapping that associates to every integer [x] the value [v1] if [i1 <= x <= j1], - [v2] if [i2 <= x <= j2], and so one. + [v2] if [i2 <= x <= j2], and so one. Precondition: the segments must be sorted. *) val make : ((int * int) * 'a) list -> 'a t -(** [lookup k t] looks for an image for key [k] in the interval tree [t]. +(** [lookup k t] looks for an image for key [k] in the interval tree [t]. Raise [Not_found] if it fails. *) val lookup : int -> 'a t -> 'a |