package melange

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

Belt.List

Utilities for List data type

type 'a t = 'a list
module A : sig ... end

Belt.Array Utililites for Array functions

val mutableCell : 'a -> 'a t -> 'a t
val unsafeMutateTail : 'a t -> 'a t -> unit
val head : 'a list -> 'b option
val headExn : 'a list -> 'b
val tail : 'a list -> 'b list option
val tailExn : 'a list -> 'b list
val add : 'a list -> 'b -> 'a list
val nthAux : 'a list -> int -> 'b option
val nthAuxAssert : 'a list -> int -> 'b
val get : 'a list -> int -> 'b option
val getExn : 'a list -> int -> 'b
val partitionAux : ('a -> bool) Js.Fn.arity1 -> 'b list -> 'c t -> 'd t -> unit
val splitAux : ('a * 'b) list -> 'c t -> 'd t -> unit
val copyAuxCont : 'a list -> 'b t -> 'b t
val copyAuxWitFilter : ('a -> bool) Js.Fn.arity1 -> 'b list -> 'c t -> unit
val copyAuxWithFilterIndex : ('a -> int -> bool) Js.Fn.arity2 -> 'b list -> 'c t -> int -> unit
val copyAuxWitFilterMap : ('a -> 'b option) Js.Fn.arity1 -> 'c list -> 'd t -> unit
val removeAssocAuxWithMap : ('a * 'b) list -> 'c -> ('a * 'b) t -> ('d -> 'e -> bool) Js.Fn.arity2 -> bool
val setAssocAuxWithMap : ('a * 'b) list -> 'c -> 'd -> ('a * 'b) t -> ('e -> 'f -> bool) Js.Fn.arity2 -> bool
val copyAuxWithMap : 'a list -> 'b t -> ('c -> 'd) Js.Fn.arity1 -> unit
val zipAux : 'a list -> 'b list -> ('c * 'd) t -> unit
val copyAuxWithMap2 : ('a -> 'b -> 'c) Js.Fn.arity2 -> 'd list -> 'e list -> 'f t -> unit
val copyAuxWithMapI : (int -> 'a -> 'b) Js.Fn.arity2 -> int -> 'c list -> 'd t -> unit
val takeAux : int -> 'a list -> 'b t -> bool
val splitAtAux : int -> 'a list -> 'b t -> 'a list option
val take : 'a list -> int -> 'b t option
val dropAux : 'a list -> int -> 'a list option
val drop : 'a list -> int -> 'a list option
val splitAt : 'a list -> int -> ('b t * 'a list) option
val concat : 'a list -> 'b t -> 'b t
val mapU : 'a list -> ('b -> 'c) Js.Fn.arity1 -> 'd t
val map : 'a list -> ('b -> 'c) -> 'd t
val zipByU : 'a list -> 'b list -> ('c -> 'd -> 'e) Js.Fn.arity2 -> 'f t
val zipBy : 'a list -> 'b list -> ('c -> 'd -> 'e) -> 'f t
val mapWithIndexU : 'a list -> (int -> 'b -> 'c) Js.Fn.arity2 -> 'd t
val mapWithIndex : 'a list -> (int -> 'b -> 'c) -> 'd t
val makeByU : int -> (int -> 'a) Js.Fn.arity1 -> 'b t
val makeBy : int -> (int -> 'a) -> 'b t
val make : int -> 'a -> 'a0 list
val lengthAux : 'a list -> int -> int
val length : 'a list -> int
val size : 'a list -> int
val fillAux : 'a A.t -> int -> 'b list -> unit
val fromArrayAux : 'a A.t -> int -> 'b list -> 'b list
val fromArray : 'a A.t -> 'a list
val toArray : 'a t -> 'b A.t
val shuffle : 'a t -> 'b list
val reverseConcat : 'a list -> 'b list -> 'b list
val reverse : 'a list -> 'a list
val flattenAux : 'a t -> 'b list list -> unit
val flatten : 'a list list -> 'b t
val concatMany : 'a t A.t -> 'a t
val mapRevAux : ('a -> 'b) Js.Fn.arity1 -> 'c list -> 'd list -> 'c list
val mapReverseU : 'a list -> ('a -> 'b) Js.Fn.arity1 -> 'b list
val mapReverse : 'a list -> ('b -> 'c) -> 'd list
val forEachU : 'a list -> ('b -> 'c) Js.Fn.arity1 -> unit
val forEach : 'a list -> ('b -> 'c) -> unit
val iteri : 'a list -> int -> (int -> 'b -> 'c) Js.Fn.arity2 -> unit
val forEachWithIndexU : 'a list -> (int -> 'a -> 'b) Js.Fn.arity2 -> unit
val forEachWithIndex : 'a list -> (int -> 'b -> 'c) -> unit
val reduceU : 'a list -> 'b -> ('c -> 'd -> 'e) Js.Fn.arity2 -> 'f
val reduce : 'a list -> 'b -> ('c -> 'd -> 'e) -> 'f
val reduceReverseUnsafeU : 'a list -> 'b -> ('c -> 'd -> 'e) Js.Fn.arity2 -> 'f
val reduceReverseU : 'a list -> 'b -> ('b0 -> 'a0 -> 'b0) Js.Fn.arity2 -> 'b0
val reduceReverse : 'a list -> 'b -> ('c -> 'd -> 'e) -> 'f
val reduceWithIndexAuxU : 'a list -> 'b -> ('c -> 'd -> int -> 'e) Js.Fn.arity3 -> int -> 'f
val reduceWithIndexU : 'a list -> 'b -> ('c -> 'a -> int -> 'c) Js.Fn.arity3 -> 'd
val reduceWithIndex : 'a list -> 'b -> ('c -> 'd -> int -> 'e) -> 'f
val mapRevAux2 : 'a list -> 'b list -> 'c list -> ('d -> 'e -> 'f) Js.Fn.arity2 -> 'c list
val mapReverse2U : 'a list -> 'b list -> ('a -> 'b -> 'c) Js.Fn.arity2 -> 'c list
val mapReverse2 : 'a list -> 'b list -> ('c -> 'd -> 'e) -> 'f list
val forEach2U : 'a list -> 'b list -> ('c -> 'd -> 'e) Js.Fn.arity2 -> unit
val forEach2 : 'a list -> 'b list -> ('c -> 'd -> 'e) -> unit
val reduce2U : 'a list -> 'b list -> 'c -> ('d -> 'e -> 'f -> 'g) Js.Fn.arity3 -> 'h
val reduce2 : 'a list -> 'b list -> 'c -> ('d -> 'e -> 'f -> 'g) -> 'h
val reduceReverse2UnsafeU : 'a list -> 'b list -> 'c -> ('d -> 'e -> 'f -> 'g) Js.Fn.arity3 -> 'h
val reduceReverse2U : 'a list -> 'b list -> 'c -> ('c0 -> 'a0 -> 'b0 -> 'c0) Js.Fn.arity3 -> 'c0
val reduceReverse2 : 'a list -> 'b list -> 'c -> ('d -> 'e -> 'f -> 'g) -> 'h
val everyU : 'a list -> ('b -> bool) Js.Fn.arity1 -> bool
val every : 'a list -> ('b -> bool) -> bool
val someU : 'a list -> ('b -> bool) Js.Fn.arity1 -> bool
val some : 'a list -> ('b -> bool) -> bool
val every2U : 'a list -> 'b list -> ('c -> 'd -> bool) Js.Fn.arity2 -> bool
val every2 : 'a list -> 'b list -> ('c -> 'd -> bool) -> bool
val cmpByLength : 'a list -> 'b list -> int
val cmpU : 'a list -> 'b list -> ('c -> 'd -> int) Js.Fn.arity2 -> int
val cmp : 'a list -> 'b list -> ('c -> 'd -> int) -> int
val eqU : 'a list -> 'b list -> ('c -> 'd -> bool) Js.Fn.arity2 -> bool
val eq : 'a list -> 'b list -> ('c -> 'd -> bool) -> bool
val some2U : 'a list -> 'b list -> ('c -> 'd -> bool) Js.Fn.arity2 -> bool
val some2 : 'a list -> 'b list -> ('c -> 'd -> bool) -> bool
val hasU : 'a list -> 'b -> ('c -> 'd -> bool) Js.Fn.arity2 -> bool
val has : 'a list -> 'b -> ('c -> 'd -> bool) -> bool
val getAssocU : ('a * 'b) list -> 'c -> ('d -> 'e -> bool) Js.Fn.arity2 -> 'f option
val getAssoc : ('a * 'b) list -> 'c -> ('d -> 'e -> bool) -> 'b option
val hasAssocU : ('a * 'b) list -> 'c -> ('d -> 'e -> bool) Js.Fn.arity2 -> bool
val hasAssoc : ('a * 'b) list -> 'c -> ('d -> 'e -> bool) -> bool
val removeAssocU : ('a * 'b) t -> 'c -> ('d -> 'e -> bool) Js.Fn.arity2 -> ('a * 'b) t
val removeAssoc : ('a * 'b) t -> 'c -> ('d -> 'e -> bool) -> ('a * 'b) t
val setAssocU : ('a * 'b) list -> 'c -> 'd -> ('e -> 'e -> bool) Js.Fn.arity2 -> ('a * 'b) t
val setAssoc : ('a * 'b) list -> 'c -> 'd -> ('e -> 'f -> bool) -> ('a * 'b) t
val sortU : 'a t -> ('b -> 'b -> int) Js.Fn.arity2 -> 'c list
val sort : 'a t -> ('b -> 'c -> int) -> 'a list
val getByU : 'a list -> ('b -> bool) Js.Fn.arity1 -> 'c option
val getBy : 'a list -> ('b -> bool) -> 'a option
val keepU : 'a list -> ('b -> bool) Js.Fn.arity1 -> 'c t
val keep : 'a list -> ('b -> bool) -> 'a t
val keepWithIndexU : 'a list -> ('a -> int -> bool) Js.Fn.arity2 -> 'a t
val keepWithIndex : 'a list -> ('b -> int -> bool) -> 'a t
val keepMapU : 'a list -> ('b -> 'c option) Js.Fn.arity1 -> 'd t
val keepMap : 'a list -> ('b -> 'c option) -> 'c t
val partitionU : 'a list -> ('b -> bool) Js.Fn.arity1 -> 'c t * 'd t
val partition : 'a list -> ('b -> bool) -> 'a t * 'a t
val unzip : ('a * 'b) list -> 'c t * 'd t
val zip : 'a list -> 'b list -> ('c * 'd) 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