Module `Parallel_scan.Space_partition`

Space available and number of jobs required to enqueue data. first = space on the current tree and number of jobs required to be completed second = If the current-tree space is less than <max_base_jobs> then remaining number of slots on a new tree and the corresponding job count.

module Stable : sig ... end

type t = Stable.Latest.t = {

first : int * int;

second : (int * int) option;

}

include Ppx_sexp_conv_lib.Sexpable.S with type t := t

val t_of_sexp : Sexplib0__.Sexp.t -> t

val sexp_of_t : t -> Sexplib0__.Sexp.t