package core_unix

  1. Overview
  2. Docs

Module Ofday.SetSource

Sourcetype t
include Core.Bin_prot.Binable.S with type t := t
include Bin_prot.Binable.S_only_functions with type t := t
Sourceval bin_size_t : t Bin_prot.Size.sizer
Sourceval bin_write_t : t Bin_prot.Write.writer
Sourceval bin_read_t : t Bin_prot.Read.reader
Sourceval __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.

Sourceval bin_shape_t : Bin_prot.Shape.t
include Sexplib0.Sexpable.S with type t := t
Sourceval t_of_sexp : Sexplib0.Sexp.t -> t
Sourceval sexp_of_t : t -> Sexplib0.Sexp.t
Sourceval 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.

Sourceval 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.

Sourceval contains : t -> bound -> bool
Sourceval 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.

Sourceval ubound_exn : t -> bound

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

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

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

Sourceval 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)).

Sourceval union_list : t list -> t

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

Sourceval to_poly : t -> bound Set.t
Sourceval to_list : t -> t list

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