package server-reason-react

  1. Overview
  2. Docs
package server-reason-react
Legend:
Library
Module
Module type
Parameter
Class
Class type
module N : sig ... end
module A : sig ... end

Belt.Array Utililites for Array functions

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

Innovation. Community. Security.

GitHub Discord Twitter Peertube RSS
About
Changelog Releases Industrial Users Academic Users Why OCaml
Ecosystem
Packages Community Events Blog 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