aboutsummaryrefslogtreecommitdiff
path: root/lib/lStream.ml
diff options
context:
space:
mode:
Diffstat (limited to 'lib/lStream.ml')
-rw-r--r--lib/lStream.ml79
1 files changed, 79 insertions, 0 deletions
diff --git a/lib/lStream.ml b/lib/lStream.ml
new file mode 100644
index 0000000000..169cc7cf3e
--- /dev/null
+++ b/lib/lStream.ml
@@ -0,0 +1,79 @@
+(************************************************************************)
+(* * The Coq Proof Assistant / The Coq Development Team *)
+(* v * Copyright INRIA, CNRS and contributors *)
+(* <O___,, * (see version control and CREDITS file for authors & dates) *)
+(* \VV/ **************************************************************)
+(* // * This file is distributed under the terms of the *)
+(* * GNU Lesser General Public License Version 2.1 *)
+(* * (see LICENSE file for the text of the license) *)
+(************************************************************************)
+
+(** Streams equipped with a (non-canonical) location function *)
+
+type 'a t = {
+ strm : 'a Stream.t;
+ (* Give the loc of i-th element (counting from 1) and the empty initial interval if 0 *)
+ fun_loc : int -> Loc.t;
+ (* Remember max token peeked *)
+ mutable max_peek : int;
+}
+
+let from ?(source=Loc.ToplevelInput) f =
+ let loct = Hashtbl.create 207 in
+ let loct_func loct i = Hashtbl.find loct i in
+ let loct_add loct i loc = Hashtbl.add loct i loc in
+ let strm =
+ Stream.from
+ (fun i ->
+ match f i with
+ | None -> None
+ | Some (a,loc) ->
+ loct_add loct i loc; Some a) in
+ let initial = Loc.initial source in
+ let fun_loc i = if i = 0 then initial else loct_func loct (i - 1) in
+ { strm; max_peek = 0; fun_loc }
+
+let count strm = Stream.count strm.strm
+
+let current_loc strm =
+ strm.fun_loc (Stream.count strm.strm)
+
+let max_peek_loc strm =
+ strm.fun_loc strm.max_peek
+
+let interval_loc bp ep strm =
+ assert (bp <= ep);
+ if ep > strm.max_peek then failwith "Not peeked position";
+ if bp == ep then
+ Loc.after (strm.fun_loc bp) 0 0
+ else
+ let loc1 = strm.fun_loc (bp + 1) in
+ let loc2 = strm.fun_loc ep in
+ Loc.merge loc1 loc2
+
+let get_loc n strm =
+ strm.fun_loc (n + 1)
+
+let peek strm =
+ let a = Stream.peek strm.strm in
+ if Option.has_some (Stream.peek strm.strm) then strm.max_peek <- max (Stream.count strm.strm + 1) strm.max_peek;
+ a
+
+let npeek n strm =
+ let l = Stream.npeek n strm.strm in
+ strm.max_peek <- max (Stream.count strm.strm + List.length l) strm.max_peek;
+ l
+
+let peek_nth n strm =
+ let list = Stream.npeek (n + 1) strm.strm in
+ let rec loop list p =
+ match list, p with
+ x :: _, 0 -> strm.max_peek <- Stream.count strm.strm + n + 1; x
+ | _ :: l, p -> loop l (p - 1)
+ | [], p -> strm.max_peek <- Stream.count strm.strm + (n - p); raise Stream.Failure
+ in
+ loop list n
+
+let junk strm = Stream.junk strm.strm
+
+let next strm = Stream.next strm.strm