package core_unix

  1. Overview
  2. Docs
package core_unix
Legend:
Library
Module
Module type
Parameter
Class
Class type
type t
include Core.Bin_prot.Binable.S with type t := t
include Bin_prot.Binable.S_only_functions with type t := t
val bin_size_t : t Bin_prot.Size.sizer
val bin_write_t : t Bin_prot.Write.writer
val bin_read_t : t Bin_prot.Read.reader
val __bin_read_t__ : (int -> t) Bin_prot.Read.reader

This function only needs implementation if t exposed to be a polymorphic variant. Despite what the type reads, this does *not* produce a function after reading; instead it takes the constructor tag (int) before reading and reads the rest of the variant t afterwards.

val bin_shape_t : Bin_prot.Shape.t
val bin_writer_t : t Bin_prot.Type_class.writer
val bin_reader_t : t Bin_prot.Type_class.reader
include Sexplib0.Sexpable.S with type t := t
val t_of_sexp : Sexplib0__.Sexp.t -> t
val sexp_of_t : t -> Sexplib0__.Sexp.t
val create_exn : (bound * bound) list -> t

create_exn creates an interval set containing intervals whose lower and upper bounds are given by the pairs passed to the function. Raises if the pairs overlap.

val create_from_intervals_exn : t list -> t

create_from_intervals_exn creates an interval set. Empty intervals are dropped. Raises if the nonempty intervals are not disjoint.

val contains : t -> bound -> bool
val contains_set : container:t -> contained:t -> bool

contains_set returns true iff for every interval in the contained set, there exists an interval in the container set that is its superset.

val ubound_exn : t -> bound

The largest and smallest element of the interval set, respectively. Raises Invalid_argument on empty sets.

val lbound_exn : t -> bound
val ubound : t -> bound option
val lbound : t -> bound option
val inter : t -> t -> t

inter t1 t2 computes the intersection of sets t1 and t2. O(length t1 * length t2).

val union : t -> t -> t

union t1 t2 computes the union of sets t1 and t2. O((length t1 + length t2) * log(length t1 + length t2)).

val union_list : t list -> t

union_list l computes the union of a list of sets. O(sum length * log(sum length)).

val to_list : t -> t list

to_list will return a list of non-overlapping intervals defining the set, in ascending order.

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