From ff01cafe8104f7620aacbfdde5dba738dbadc326 Mon Sep 17 00:00:00 2001
From: regisgia
Date: Fri, 8 Jan 2010 17:03:54 +0000
Subject: * Segmenttree: New. A very simple implementation of segment trees. *
 Unicodetable: Update with the standard table for lower case conversion. *
 Util: Rewrite "lowercase_unicode" to take the entire unicode character set  
 into account.

git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@12645 85f007b7-540e-0410-9357-904b9bb8a0f7
---
 lib/segmenttree.mli | 20 ++++++++++++++++++++
 1 file changed, 20 insertions(+)
 create mode 100644 lib/segmenttree.mli

(limited to 'lib/segmenttree.mli')

diff --git a/lib/segmenttree.mli b/lib/segmenttree.mli
new file mode 100644
index 0000000000..4aea13e9ad
--- /dev/null
+++ b/lib/segmenttree.mli
@@ -0,0 +1,20 @@
+(** 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. 
+*)
+
+(** A mapping from a union of disjoint segments to some values of type ['a]. *)
+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. 
+    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]. 
+    Raise [Not_found] if it fails. *)
+val lookup : int -> 'a t -> 'a
+
+
-- 
cgit v1.2.3