MutableStack

t

RES
type t<'a>

make

RES
let make: unit => t<'a>

Returns a new stack, initially empty.

clear

RES
let clear: t<'a> => unit

Discard all elements from the stack.

copy

RES
let copy: t<'a> => t<'a>

copy(x) O(1) operation, return a new stack.

push

RES
let push: (t<'a>, 'a) => unit

popUndefined

RES
let popUndefined: t<'a> => Js.undefined<'a>

pop

RES
let pop: t<'a> => option<'a>

topUndefined

RES
let topUndefined: t<'a> => Js.undefined<'a>

top

RES
let top: t<'a> => option<'a>

isEmpty

RES
let isEmpty: t<'a> => bool

size

RES
let size: t<'a> => int

forEachU

RES
let forEachU: (t<'a>, (. 'a) => unit) => unit

forEach

RES
let forEach: (t<'a>, 'a => unit) => unit

dynamicPopIterU

RES
let dynamicPopIterU: (t<'a>, (. 'a) => unit) => unit

dynamicPopIter

RES
let dynamicPopIter: (t<'a>, 'a => unit) => unit

dynamicPopIter(s, f) apply f to each element of s. The item is poped before applying f, s will be empty after this opeartion. This function is useful for worklist algorithm.