Tuple_pool.DebugDebug builds a pool in which every function can run invariant on its pool argument(s) and/or print a debug message to stderr, as determined by !check_invariant and !show_messages, which are initially both true.
The performance of the pool resulting from Debug is much worse than that of the input Tuple_pool, even with all the controls set to false.
module Tuple_pool : Sinclude S with type 'a Pointer.t = 'a Tuple_pool.Pointer.t with type Pointer.Id.t = Tuple_pool.Pointer.Id.t with type 'a t = 'a Tuple_pool.tmodule Slots : Tuple_type.SlotsSlots has types t1, ..., t12 of arities 1 to 12 that are isomorphic to tuple types of the corresponding arities. Type ('a0, ..., 'a<N-1>) t<N> corresponds to 'a0 * ... * 'a<N-1>.
module Slot : Tuple_type.Slotmodule Pointer : sig ... endtype 'a t = 'a Tuple_pool.tA pool. 'slots will look like ('a1, ..., 'an) Slots.tn, and the pool holds tuples of type 'a1 * ... * 'an.
val sexp_of_t : ('slots -> Ppx_sexp_conv_lib.Sexp.t) -> 'slots t -> Ppx_sexp_conv_lib.Sexp.tinclude Core_kernel.Invariant.S1 with type 'a t := 'a tval invariant : ('a -> unit) -> 'a t -> unitpointer_is_valid t pointer returns true iff pointer points to a live tuple in t, i.e. pointer is not null, not free, and is in the range of t.
A pointer might not be in the range of a pool if it comes from another pool for example. In this case unsafe_get/set functions would cause a segfault.
val id_of_pointer : 'slots t -> 'slots Pointer.t -> Pointer.Id.tid_of_pointer t pointer returns an id that is unique for the lifetime of pointer's tuple. When the tuple is freed, the id is no longer valid, and pointer_of_id_exn will fail on it. Pointer.null () has a distinct id from all non-null pointers.
val pointer_of_id_exn : 'slots t -> Pointer.Id.t -> 'slots Pointer.tpointer_of_id_exn t id returns the pointer corresponding to id. It fails if the tuple corresponding to id was already freed.
create slots ~capacity ~dummy creates an empty pool that can hold up to capacity N-tuples. The slots of dummy are stored in free tuples. create raises if capacity < 0 || capacity > max_capacity ~slots_per_tuple.
max_capacity returns the maximum capacity allowed when creating a pool.
val capacity : _ t -> intcapacity returns the maximum number of tuples that the pool can hold.
val length : _ t -> intlength returns the number of tuples currently in the pool.
0 <= length t <= capacity tgrow t ~capacity returns a new pool t' with the supplied capacity. The new pool is to be used as a replacement for t. All live tuples in t are now live in t', and valid pointers to tuples in t are now valid pointers to the identical tuple in t'. It is an error to use t after calling grow t.
grow raises if the supplied capacity isn't larger than capacity t.
val is_full : _ t -> boolis_full t returns true if no more tuples can be allocated in t.
free t pointer frees the tuple pointed to by pointer from t.
unsafe_free t pointer frees the tuple pointed to by pointer without checking pointer_is_valid
new<N> t a0 ... a<N-1> returns a new tuple from the pool, with the tuple's slots initialized to a0 ... a<N-1>. new raises if is_full t.
get_tuple t pointer allocates an OCaml tuple isomorphic to the pool t's tuple pointed to by pointer. The tuple gets copied, but its slots do not.
val get : (_, 'variant) Slots.t as 'slots t -> 'slots Pointer.t -> ('variant, 'slot) Slot.t -> 'slotget t pointer slot gets slot of the tuple pointed to by pointer in pool t.
set t pointer slot a sets to a the slot of the tuple pointed to by pointer in pool t.
In get and set, it is an error to refer to a pointer that has been freed. It is also an error to use a pointer with any pool other than the one the pointer was new'd from or grown to. These errors will lead to undefined behavior, but will not segfault.
unsafe_get is comparable in speed to get for immediate values, and 5%-10% faster for pointers.
unsafe_get and unsafe_set skip bounds checking, and can thus segfault.
val check_invariant : bool Core_kernel.refval show_messages : bool Core_kernel.ref