Module Stack

module Stack: Extlib.ExtStack.Stack

Last-in first-out stacks.

This module implements stacks (LIFOs), with in-place modification.
Author(s): Xavier Leroy (Base module), David Teller

type 'a t

The type of stacks containing elements of type 'a.

include Stack.Enumerable

exception Empty

Raised when Stack.pop or Stack.top is applied to an empty stack.

val create : unit -> 'a t

Return a new stack, initially empty.

val push : 'a -> 'a t -> unit

push x s adds the element x at the top of stack s.

val pop : 'a t -> 'a

pop s removes and returns the topmost element in stack s, or raises Empty if the stack is empty.

val top : 'a t -> 'a

top s returns the topmost element in stack s, or raises Empty if the stack is empty.

val clear : 'a t -> unit

Discard all elements from a stack.

val copy : 'a t -> 'a t

Return a copy of the given stack.

val is_empty : 'a t -> bool

Return true if the given stack is empty, false otherwise.

val length : 'a t -> int

Return the number of elements in a stack.

val iter : ('a -> unit) -> 'a t -> unit

iter f s applies f in turn to all elements of s, from the element at the top of the stack to the element at the bottom of the stack. The stack itself is unchanged.

val enum : 'a t -> 'a Enum.t

enum s returns a destructive enumeration of the elements of stack s, from the most recently entered to the least recently entered. Reading the enumeration will progressively empty s.

val of_enum : 'a Enum.t -> 'a t

of_enum e returns a new stack containing all the elements of e. This is equivalent to calling push with the first element of the enumeration, then with the second, etc.

Boilerplate code

S-Expressions

val t_of_sexp : (Sexplib.Sexp.t -> 'a) -> Sexplib.Sexp.t -> 'a t

val sexp_of_t : ('a -> Sexplib.Sexp.t) -> 'a t -> Sexplib.Sexp.t

Printing

val print : ?first:string ->
       ?last:string ->
       ?sep:string ->
       ('a Extlib.InnerIO.output -> 'b -> unit) ->
       'a Extlib.InnerIO.output -> 'b t -> unit