41 lines
1.3 KiB
OCaml
41 lines
1.3 KiB
OCaml
(***********************************************************************)
|
|
(* *)
|
|
(* 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 Library General Public License, with *)
|
|
(* the special exception on linking described in file ../LICENSE. *)
|
|
(* *)
|
|
(***********************************************************************)
|
|
|
|
type 'a t = { mutable c : 'a list }
|
|
|
|
exception Empty
|
|
|
|
let create () = { c = [] }
|
|
|
|
let clear s = s.c <- []
|
|
|
|
let copy s = { c = s.c }
|
|
|
|
let push x s = s.c <- x :: s.c
|
|
|
|
let pop s =
|
|
match s.c with
|
|
hd::tl -> s.c <- tl; hd
|
|
| [] -> raise Empty
|
|
|
|
let top s =
|
|
match s.c with
|
|
hd::_ -> hd
|
|
| [] -> raise Empty
|
|
|
|
let is_empty s = (s.c = [])
|
|
|
|
let length s = List.length s.c
|
|
|
|
let iter f s = List.iter f s.c
|