package melange

  1. Overview
  2. Docs
Legend:
Library
Module
Module type
Parameter
Class
Class type

Belt.MutableQueue

An FIFO(first in first out) queue data structure

module A : sig ... end

Belt.Array Utililites for Array functions

type 'a node = {
  1. content : 'a;
  2. mutable next : 'a cell;
}
and 'a cell = 'a node option
and 'a t = {
  1. mutable length : int;
  2. mutable first : 'a cell;
  3. mutable last : 'a cell;
}
val make : unit -> 'a t
val clear : 'a t -> unit
val add : 'a t -> 'b -> unit
val peek : 'a t -> 'b option
val peekUndefined : 'a t -> 'b Js.Undefined.t
val peekExn : 'a t -> 'b
val pop : 'a t -> 'b option
val popExn : 'a t -> 'b
val popUndefined : 'a t -> 'b Js.Undefined.t
val copyAux : 'a t -> 'a cell -> 'b cell -> 'a t
val copy : 'a t -> 'b t
val copyMapAux : 'a t -> 'a cell -> 'b cell -> ('c -> 'd) Js.Fn.arity1 -> 'a t
val mapU : 'a t -> ('b -> 'c) Js.Fn.arity1 -> 'c t
val map : 'a t -> ('b -> 'c) -> 'd t
val isEmpty : 'a t -> bool
val size : 'a t -> int
val iterAux : 'a cell -> ('b -> unit) Js.Fn.arity1 -> unit
val forEachU : 'a t -> ('b -> unit) Js.Fn.arity1 -> unit
val forEach : 'a t -> ('b -> unit) -> unit
val foldAux : ('a -> 'b -> 'c) Js.Fn.arity2 -> 'd -> 'e cell -> 'f
val reduceU : 'a t -> 'b -> ('c -> 'd -> 'c) Js.Fn.arity2 -> 'e
val reduce : 'a t -> 'b -> ('c -> 'd -> 'e) -> 'f
val transfer : 'a t -> 'b t -> unit
val fillAux : int -> 'a A.t -> 'b cell -> unit
val toArray : 'a t -> 'b A.t
val fromArray : 'a A.t -> 'b t
OCaml

Innovation. Community. Security.