jon.recoil.org

Module Base.Uniform_arraySource

Same semantics as 'a Array.t, except it's guaranteed that the representation array is not tagged with Double_array_tag, the tag for float arrays.

This means it's safer to use in the presence of Obj.magic, but it's slower than normal Array if you use it with floats.

It can often be faster than Array if you use it with non-floats.

Sourcetype 'a t

See Base.Array for comments.

include Sexplib0.Sexpable.S1 with type 'a t := 'a Base.Uniform_array.t
Sourceval compare : ('a -> 'a -> int) -> 'a Base.Uniform_array.t -> 'a Base.Uniform_array.t -> int
Sourceval invariant : _ Base.Uniform_array.t -> unit
Sourceval create : len:int -> 'a -> 'a Base.Uniform_array.t
Sourceval singleton : 'a -> 'a Base.Uniform_array.t
Sourceval init : int -> f:(int -> 'a) -> 'a Base.Uniform_array.t
Sourceval length : 'a Base.Uniform_array.t -> int
Sourceval get : 'a Base.Uniform_array.t -> int -> 'a
Sourceval unsafe_get : 'a Base.Uniform_array.t -> int -> 'a
Sourceval unsafe_get_local : 'a Base.Uniform_array.t -> int -> 'a
Sourceval set : 'a Base.Uniform_array.t -> int -> 'a -> unit
Sourceval unsafe_set : 'a Base.Uniform_array.t -> int -> 'a -> unit
Sourceval swap : _ Base.Uniform_array.t -> int -> int -> unit
Sourceval unsafe_set_omit_phys_equal_check : 'a Base.Uniform_array.t -> int -> 'a -> unit

unsafe_set_omit_phys_equal_check is like unsafe_set, except it doesn't do a phys_equal check to try to skip caml_modify. It is safe to call this even if the values are phys_equal.

Sourceval unsafe_set_with_caml_modify : 'a Base.Uniform_array.t -> int -> 'a -> unit

unsafe_set_with_caml_modify always calls caml_modify before setting and never gets the old value. This is like unsafe_set_omit_phys_equal_check except it doesn't check whether the old value and the value being set are integers to try to skip caml_modify.

Sourceval set_with_caml_modify : 'a Base.Uniform_array.t -> int -> 'a -> unit

Same as unsafe_set_with_caml_modify, but with bounds check.

Sourceval map : 'a Base.Uniform_array.t -> f:('a -> 'b) -> 'b Base.Uniform_array.t
Sourceval mapi : 'a Base.Uniform_array.t -> f:(int -> 'a -> 'b) -> 'b Base.Uniform_array.t
Sourceval iter : 'a Base.Uniform_array.t -> f:('a -> unit) -> unit
Sourceval iteri : 'a Base.Uniform_array.t -> f:(int -> 'a -> unit) -> unit

Like iter, but the function is applied to the index of the element as first argument, and the element itself as second argument.

Sourceval fold : 'a Base.Uniform_array.t -> init:'acc -> f:('acc -> 'a -> 'acc) -> 'acc
Sourceval foldi : 'a Base.Uniform_array.t -> init:'acc -> f:(int -> 'acc -> 'a -> 'acc) -> 'acc
Sourceval unsafe_to_array_inplace__promise_not_a_float : 'a Base.Uniform_array.t -> 'a array

unsafe_to_array_inplace__promise_not_a_float converts from a t to an array in place. This function is unsafe if the underlying type is a float.

Sourceval of_array : 'a array -> 'a Base.Uniform_array.t

of_array and to_array return fresh arrays with the same contents rather than returning a reference to the underlying array.

Sourceval to_array : 'a Base.Uniform_array.t -> 'a array
Sourceval of_list : 'a list -> 'a Base.Uniform_array.t
Sourceval of_list_rev : 'a list -> 'a Base.Uniform_array.t
Sourceval to_list : 'a Base.Uniform_array.t -> 'a list
include Base.Blit.S1 with type 'a t := 'a Base.Uniform_array.t
Sourceval blit : src:'a Base.Uniform_array.t -> src_pos:int -> dst:'a Base.Uniform_array.t -> dst_pos:int -> len:int -> unit
Sourceval blito : src:'a Base.Uniform_array.t -> ?src_pos:int -> ?src_len:int -> dst:'a Base.Uniform_array.t -> ?dst_pos:int -> unit -> unit
Sourceval unsafe_blit : src:'a Base.Uniform_array.t -> src_pos:int -> dst:'a Base.Uniform_array.t -> dst_pos:int -> len:int -> unit
Sourceval sub : 'a Base.Uniform_array.t -> pos:int -> len:int -> 'a Base.Uniform_array.t
Sourceval subo : ?pos:int -> ?len:int -> 'a Base.Uniform_array.t -> 'a Base.Uniform_array.t
Sourceval exists : 'a Base.Uniform_array.t -> f:('a -> bool) -> bool
Sourceval existsi : 'a Base.Uniform_array.t -> f:(int -> 'a -> bool) -> bool
Sourceval for_all : 'a Base.Uniform_array.t -> f:('a -> bool) -> bool
Sourceval for_alli : 'a Base.Uniform_array.t -> f:(int -> 'a -> bool) -> bool
Sourceval concat_map : 'a Base.Uniform_array.t -> f:('a -> 'b Base.Uniform_array.t) -> 'b Base.Uniform_array.t
Sourceval concat_mapi : 'a Base.Uniform_array.t -> f:(int -> 'a -> 'b Base.Uniform_array.t) -> 'b Base.Uniform_array.t
Sourceval partition_map : 'a Base.Uniform_array.t -> f:('a -> ('b, 'c) Base.Either.t) -> 'b Base.Uniform_array.t * 'c Base.Uniform_array.t
Sourceval filter : 'a Base.Uniform_array.t -> f:('a -> bool) -> 'a Base.Uniform_array.t
Sourceval filteri : 'a Base.Uniform_array.t -> f:(int -> 'a -> bool) -> 'a Base.Uniform_array.t
Sourceval filter_map : 'a Base.Uniform_array.t -> f:('a -> 'b option) -> 'b Base.Uniform_array.t
Sourceval filter_mapi : 'a Base.Uniform_array.t -> f:(int -> 'a -> 'b option) -> 'b Base.Uniform_array.t
Sourceval find : 'a Base.Uniform_array.t -> f:('a -> bool) -> 'a option
Sourceval findi : 'a Base.Uniform_array.t -> f:(int -> 'a -> bool) -> (int * 'a) option
Sourceval find_map : 'a Base.Uniform_array.t -> f:('a -> 'b option) -> 'b option
Sourceval find_mapi : 'a Base.Uniform_array.t -> f:(int -> 'a -> 'b option) -> 'b option
Sourceval map2_exn : 'a Base.Uniform_array.t -> 'b Base.Uniform_array.t -> f:('a -> 'b -> 'c) -> 'c Base.Uniform_array.t

Functions with the 2 suffix raise an exception if the lengths of the two given arrays aren't the same.

Sourceval fold2_exn : 'a Base.Uniform_array.t -> 'b Base.Uniform_array.t -> init:'acc -> f:('acc -> 'a -> 'b -> 'acc) -> 'acc
Sourceval min_elt : 'a Base.Uniform_array.t -> compare:('a -> 'a -> int) -> 'a option
Sourceval max_elt : 'a Base.Uniform_array.t -> compare:('a -> 'a -> int) -> 'a option
Sourceval sort : ?pos:int -> ?len:int -> 'a Base.Uniform_array.t -> compare:('a -> 'a -> int) -> unit

sort uses constant heap space.

To sort only part of the array, specify pos to be the index to start sorting from and len indicating how many elements to sort.

include Base.Binary_searchable.S1 with type 'a t := 'a Base.Uniform_array.t
Sourceval binary_search_segmented : ?pos:int -> ?len:int -> 'a Base.Uniform_array.t -> segment_of:('a -> [ `Left | `Right ]) -> [ `Last_on_left | `First_on_right ] -> int option

Extra lowlevel and unsafe functions

Sourceval unsafe_create_uninitialized : len:int -> _ Base.Uniform_array.t

The behavior is undefined if you access an element before setting it.

Sourceval create_obj_array : len:int -> Stdlib.Obj.t Base.Uniform_array.t

New obj array filled with Obj.repr 0

Sourceval unsafe_set_assuming_currently_int : Stdlib.Obj.t Base.Uniform_array.t -> int -> Stdlib.Obj.t -> unit

unsafe_set_assuming_currently_int t i obj sets index i of t to obj, but only works correctly if the value there is an immediate, i.e. Stdlib.Obj.is_int (get t i). This precondition saves a dynamic check.

unsafe_set_int_assuming_currently_int is similar, except the value being set is an int.

unsafe_set_int is similar but does not assume anything about the target.

Sourceval unsafe_set_int_assuming_currently_int : Stdlib.Obj.t Base.Uniform_array.t -> int -> int -> unit
Sourceval unsafe_set_int : Stdlib.Obj.t Base.Uniform_array.t -> int -> int -> unit
Sourceval unsafe_clear_if_pointer : Stdlib.Obj.t Base.Uniform_array.t -> int -> unit

unsafe_clear_if_pointer t i prevents t.(i) from pointing to anything to prevent space leaks. It does this by setting t.(i) to Stdlib.Obj.repr 0. As a performance hack, it only does this when not (Stdlib.Obj.is_int t.(i)). It is an error to access the cleared index before setting it again.