package melange

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

Belt.MutableSet

The top level provides generic mutable set operations.

It also has two specialized inner modules Belt.MutableSet.Int and Belt.MutableSet.String

module Int : sig ... end

This module is Belt.MutableSet specialized with key type to be a primitive type. It is more efficient in general, the API is the same with Belt_MutableSet except its key type is fixed, and identity is not needed(using the built-in one)

module String : sig ... end

This module is Belt.MutableSet specialized with key type to be a primitive type. It is more efficient in general, the API is the same with Belt_MutableSet except its key type is fixed, and identity is not needed(using the built-in one)

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

Belt.Array Utililites for Array functions

module Sort : sig ... end

A module for Array sort relevant utiliites

type ('k, 'id) id = (module Belt__.Belt_Id.Comparable with type identity = 'id and type t = 'k)
type ('key, 'id) cmp
type ('value, 'id) t = {
  1. cmp : ('value, 'id) cmp;
  2. mutable data : 'value N.t;
}
val remove0 : 'a N.node -> 'b -> cmp:('b -> 'a -> int) Js.Fn.arity2 -> 'a N.t
val remove : ('a, 'b) t -> 'a -> unit
val removeMany0 : 'a N.node -> 'b A.t -> int -> int -> cmp:('b -> 'a -> int) Js.Fn.arity2 -> 'a N.node option
val removeMany : ('a, 'b) t -> 'a A.t -> unit
val removeCheck0 : 'a N.node -> 'a -> bool Js__Melange_mini_stdlib.ref -> cmp:('a, 'b) Belt__.Belt_Id.cmp -> 'a N.t
val removeCheck : ('a, 'b) t -> 'a -> bool
val addCheck0 : 'a N.t -> 'a -> bool Js__Melange_mini_stdlib.ref -> cmp:('a -> 'a -> int) Js.Fn.arity2 -> 'a N.t
val addCheck : ('a, 'b) t -> 'a -> bool
val add : ('a, 'b) t -> 'a -> unit
val addArrayMutate : 'a N.t -> 'a A.t -> cmp:('a, 'b) N.cmp -> 'a N.t
val mergeMany : ('a, 'b) t -> 'a A.t -> unit
val make : id:('value, 'identity) id -> ('value, 'identity) t
val isEmpty : ('a, 'b) t -> bool
val minimum : ('a, 'b) t -> 'a option
val minUndefined : ('a, 'b) t -> 'a Js.undefined
val maximum : ('a, 'b) t -> 'a option
val maxUndefined : ('a, 'b) t -> 'a Js.undefined
val forEachU : ('a, 'b) t -> ('a -> unit) Js.Fn.arity1 -> unit
val forEach : ('a, 'b) t -> ('a -> unit) -> unit
val reduceU : ('a, 'b) t -> 'c -> ('c -> 'a -> 'c) Js.Fn.arity2 -> 'c
val reduce : ('a, 'b) t -> 'c -> ('c -> 'a -> 'c) -> 'c
val everyU : ('a, 'b) t -> ('a -> bool) Js.Fn.arity1 -> bool
val every : ('a, 'b) t -> ('a -> bool) -> bool
val someU : ('a, 'b) t -> ('a -> bool) Js.Fn.arity1 -> bool
val some : ('a, 'b) t -> ('a -> bool) -> bool
val size : ('a, 'b) t -> int
val toList : ('a, 'b) t -> 'a list
val toArray : ('a, 'b) t -> 'a array
val fromSortedArrayUnsafe : 'value array -> id:('value, 'identity) id -> ('value, 'identity) t
val checkInvariantInternal : ('a, 'b) t -> unit
val fromArray : 'value array -> id:('value, 'identity) id -> ('value, 'identity) t
val cmp : ('a, 'b) t -> ('a, 'c) t -> int
val eq : ('a, 'b) t -> ('a, 'c) t -> bool
val get : ('a, 'b) t -> 'a -> 'a option
val getUndefined : ('a, 'b) t -> 'a -> 'a Js.undefined
val getExn : ('a, 'b) t -> 'a -> 'a
val split : ('a, 'b) t -> 'a -> (('a, 'b) t * ('a, 'b) t) * bool
val keepU : ('a, 'b) t -> ('a -> bool) Js.Fn.arity1 -> ('a, 'b) t
val keep : ('a, 'b) t -> ('a -> bool) -> ('a, 'b) t
val partitionU : ('a, 'b) t -> ('a -> bool) Js.Fn.arity1 -> ('a, 'b) t * ('a, 'b) t
val partition : ('a, 'b) t -> ('a -> bool) -> ('a, 'b) t * ('a, 'b) t
val subset : ('a, 'b) t -> ('a, 'c) t -> bool
val intersect : ('a, 'b) t -> ('a, 'c) t -> ('a, 'b) t
val diff : ('a, 'b) t -> ('a, 'c) t -> ('a, 'b) t
val union : ('a, 'b) t -> ('a, 'c) t -> ('a, 'b) t
val has : ('a, 'b) t -> 'a -> bool
val copy : ('a, 'b) t -> ('a, 'b) 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