1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
|
(**************************************************************************)
(* *)
(* OCaml *)
(* *)
(* Xavier Leroy, projet Cristal, INRIA Rocquencourt *)
(* *)
(* Copyright 1996 Institut National de Recherche en Informatique et *)
(* en Automatique. *)
(* *)
(* All rights reserved. This file is distributed under the terms of *)
(* the GNU Lesser General Public License version 2.1, with the *)
(* special exception on linking described in the file LICENSE. *)
(* *)
(**************************************************************************)
type 'a t = { mutable c : 'a list; mutable len : int; }
exception Empty
let create () = { c = []; len = 0; }
let clear s = s.c <- []; s.len <- 0
let copy s = { c = s.c; len = s.len; }
let push x s = s.c <- x :: s.c; s.len <- s.len + 1
let pop s =
match s.c with
| hd::tl -> s.c <- tl; s.len <- s.len - 1; hd
| [] -> raise Empty
let pop_opt s =
match s.c with
| hd::tl -> s.c <- tl; s.len <- s.len - 1; Some hd
| [] -> None
let drop s =
match s.c with
| _hd::tl -> s.c <- tl; s.len <- s.len - 1
| [] -> raise Empty
let top s =
match s.c with
| hd::_ -> hd
| [] -> raise Empty
let top_opt s =
match s.c with
| hd::_ -> Some hd
| [] -> None
let is_empty s = (s.c = [])
let length s = s.len
let iter f s = List.iter f s.c
let fold f acc s = List.fold_left f acc s.c
(** {1 Iterators} *)
let to_seq s = List.to_seq s.c
let add_seq q i = Seq.iter (fun x -> push x q) i
let of_seq g =
let s = create() in
add_seq s g;
s
|
