package containers

  1. Overview
  2. Docs
package containers
Legend:
Library
Module
Module type
Parameter
Class
Class type
val add : ?eq:('a -> 'a -> bool) -> 'a -> 'a t -> 'a t

add x set adds x to set if it was not already present. Linear time.

  • since 0.11
val remove : ?eq:('a -> 'a -> bool) -> 'a -> 'a t -> 'a t

remove x set removes one occurrence of x from set. Linear time.

  • since 0.11
val mem : ?eq:('a -> 'a -> bool) -> 'a -> 'a t -> bool

membership to the list. Linear time

val subset : ?eq:('a -> 'a -> bool) -> 'a t -> 'a t -> bool

test for inclusion

val uniq : ?eq:('a -> 'a -> bool) -> 'a t -> 'a t

list uniq: remove duplicates w.r.t the equality predicate. Complexity is quadratic in the length of the list, but the order of elements is preserved. If you wish for a faster de-duplication but do not care about the order, use sort_uniq

val union : ?eq:('a -> 'a -> bool) -> 'a t -> 'a t -> 'a t

list union. Complexity is product of length of inputs.

val inter : ?eq:('a -> 'a -> bool) -> 'a t -> 'a t -> 'a t

list intersection. Complexity is product of length of inputs.,

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