Module Belt.MutableStack

Belt.MutableStack

An FILO(first in last out) stack data structure

First in last out stack.

This module implements stacks, with in-place modification.

type 'a t

type t('a);

val make : unit -> 'a t

let make: unit => t('a);

returns a new stack, initially empty.

val clear : 'a t -> unit

let clear: t('a) => unit;

Discard all elements from the stack.

val copy : 'a t -> 'a t

let copy: t('a) => t('a);

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

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

let push: t('a) => 'a => unit;

val popUndefined : 'a t -> 'a Js.undefined

let popUndefined: t('a) => Js.undefined('a);

val pop : 'a t -> 'a option

let pop: t('a) => option('a);

val topUndefined : 'a t -> 'a Js.undefined

let topUndefined: t('a) => Js.undefined('a);

val top : 'a t -> 'a option

let top: t('a) => option('a);

val isEmpty : 'a t -> bool

let isEmpty: t('a) => bool;

val size : 'a t -> int

let size: t('a) => int;

val forEachU : 'a t -> ('a -> unit) Js.Fn.arity1 -> unit

let forEachU: t('a) => Js.Fn.arity1(('a => unit)) => unit;

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

let forEach: t('a) => ('a => unit) => unit;

val dynamicPopIterU : 'a t -> ('a -> unit) Js.Fn.arity1 -> unit

let dynamicPopIterU: t('a) => Js.Fn.arity1(('a => unit)) => unit;

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

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