package melange

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

Specalized when value type is int, more efficient than the generic type, its compare behavior is fixed using the built-in comparison

module I : sig ... end
module N : sig ... end
module A : sig ... end

Belt.Array Utililites for Array functions

type value = I.value
type t = I.t
val empty : 'a option
val isEmpty : 'a N.t -> bool
val minimum : 'a N.t -> 'a option
val minUndefined : 'a N.t -> 'a Js.undefined
val maximum : 'a N.t -> 'a option
val maxUndefined : 'a N.t -> 'a Js.undefined
val forEach : 'a N.t -> ('a -> unit) -> unit
val forEachU : 'a N.t -> ('a -> unit) Js.Fn.arity1 -> unit
val reduce : 'a N.t -> 'b -> ('b -> 'a -> 'b) -> 'b
val reduceU : 'a N.t -> 'b -> ('b -> 'a -> 'b) Js.Fn.arity2 -> 'b
val every : 'a N.t -> ('a -> bool) -> bool
val everyU : 'a N.t -> ('a -> bool) Js.Fn.arity1 -> bool
val some : 'a N.t -> ('a -> bool) -> bool
val someU : 'a N.t -> ('a -> bool) Js.Fn.arity1 -> bool
val keep : 'a N.t -> ('a -> bool) -> 'a N.t
val keepU : 'a N.t -> ('a -> bool) Js.Fn.arity1 -> 'a N.t
val partition : 'a N.t -> ('a -> bool) -> 'a N.t * 'a N.t
val partitionU : 'a N.t -> ('a -> bool) Js.Fn.arity1 -> 'a N.t * 'a N.t
val size : 'a N.t -> int
val toList : 'a N.t -> 'a list
val toArray : 'a N.t -> 'a array
val fromSortedArrayUnsafe : 'a array -> 'a N.t
val checkInvariantInternal : 'a N.t -> unit
val add : t -> value -> t
val mergeMany : t -> value A.t -> t
val remove : t -> value -> t
val removeMany : t -> value A.t -> t
val fromArray : I.value array -> I.value I.N.t
val cmp : I.value I.N.t -> I.value I.N.t -> int
val eq : I.t -> I.value I.N.t -> bool
val get : I.t -> I.value -> I.value option
val getUndefined : I.t -> I.value -> I.value Js.Undefined.t
val getExn : I.t -> I.value -> I.value
val subset : I.t -> I.t -> bool
val has : I.t -> I.value -> bool
val splitAuxNoPivot : value N.node -> value -> t * t
val splitAuxPivot : value N.node -> value -> bool ref -> t * t
val split : t -> value -> (t * t) * bool
val union : t -> t -> t
val intersect : t -> t -> I.value N.t
val diff : t -> t -> t
OCaml

Innovation. Community. Security.

GitHub Discord Twitter Peertube RSS
About
Changelog Releases Industrial Users Academic Users Why OCaml
Ecosystem
Packages Community Events OCaml Planet Jobs
Resources
Install OCaml Get Started Platform Tools Language Manual Standard Library API Books Exercises Papers OCaml Playground Logo
Policies
Carbon Footprint Governance Privacy Code of Conduct