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.
See Base.Array for comments.
val compare : ('a -> 'a -> -> 'a t -> 'a t -> val compare__local : ('a -> 'a -> -> 'a t -> 'a t -> val invariant : _ t -> val create : len :int -> 'a -> 'a t val singleton : 'a -> 'a t val init : int -> f :(int -> 'a ) -> 'a t val get : 'a t -> int -> 'a val unsafe_get : 'a t -> int -> 'a val unsafe_get_local : 'a t -> int -> 'a val set : 'a t -> int -> 'a -> val unsafe_set : 'a t -> int -> 'a -> val swap : _ t -> int -> int -> unitval unsafe_set_omit_phys_equal_check : 'a t -> int -> 'a -> 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.
val unsafe_set_with_caml_modify : 'a t -> int -> 'a -> 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.
val set_with_caml_modify : 'a t -> int -> 'a -> Same as unsafe_set_with_caml_modify, but with bounds check.
val map : 'a t -> f :('a -> 'b ) -> 'b t val mapi : 'a t -> f :(int -> 'a -> 'b ) -> 'b t val iter : 'a t -> f :('a -> -> val iteri : 'a t -> f :(int -> 'a -> -> Like iter
val fold : 'a t -> init :'acc -> f :('acc -> 'a -> 'acc ) -> 'acc val foldi : 'a t -> init :'acc -> f :(int -> 'acc -> 'a -> 'acc ) -> 'acc val unsafe_to_array_inplace__promise_not_a_float : 'a t -> 'a arrayunsafe_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.
val of_array : 'a array-> 'a t of_array and to_array return fresh arrays with the same contents rather than returning a reference to the underlying array.
val to_array : 'a t -> 'a arrayval of_list : 'a list-> 'a t val of_list_rev : 'a list-> 'a t val to_list : 'a t -> 'a listinclude Blit.S1 with type 'a t := 'a t val blit :
src :'a t -> src_pos :int -> dst :'a t -> dst_pos :int -> len :int -> val blito :
src :'a t -> ?src_pos :int -> ?src_len :int -> dst :'a t -> ?dst_pos :int -> unit ->
unitval unsafe_blit :
src :'a t -> src_pos :int -> dst :'a t -> dst_pos :int -> len :int -> val sub : 'a t -> pos :int -> len :int -> 'a t val subo : ?pos :int -> ?len :int -> 'a t -> 'a t val exists : 'a t -> f :('a -> -> val existsi : 'a t -> f :(int -> 'a -> -> val for_all : 'a t -> f :('a -> -> val for_alli : 'a t -> f :(int -> 'a -> -> val concat : 'a t -> 'a t val concat_map : 'a t -> f :('a -> 'b t -> 'b t val concat_mapi : 'a t -> f :(int -> 'a -> 'b t -> 'b t val partition_map : 'a t -> f :('a -> ('b , 'c ) Either.t -> 'b t 'c t val filter : 'a t -> f :('a -> -> 'a t val filteri : 'a t -> f :(int -> 'a -> -> 'a t val filter_map : 'a t -> f :('a -> 'b option -> 'b t val filter_mapi : 'a t -> f :(int -> 'a -> 'b option -> 'b t val find : 'a t -> f :('a -> -> 'a optionval findi : 'a t -> f :(int -> 'a -> -> (int * 'a ) optionval find_map : 'a t -> f :('a -> 'b option -> 'b optionval find_mapi : 'a t -> f :(int -> 'a -> 'b option -> 'b optionval map2_exn : 'a t -> 'b t -> f :('a -> 'b -> 'c ) -> 'c t Functions with the 2 suffix raise an exception if the lengths of the two given arrays aren't the same.
val fold2_exn :
'a t -> 'b t -> init :'acc -> f :('acc -> 'a -> 'b -> 'acc ) -> 'acc val min_elt : 'a t -> compare :('a -> 'a -> -> 'a optionval max_elt : 'a t -> compare :('a -> 'a -> -> 'a optionval sort : ?pos :int -> ?len :int -> 'a t -> compare :('a -> 'a -> -> 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 Binary_searchable.S1 with type 'a t := 'a t val binary_search :
?pos :int -> ?len :int -> 'a t -> compare :('a -> 'key -> -> [ `Last_strictly_less_than
| `Last_less_than_or_equal_to
| `Last_equal_to
| `First_equal_to
| `First_greater_than_or_equal_to
| `First_strictly_greater_than ] -> 'key -> int option val binary_search_segmented :
?pos :int -> ?len :int -> 'a t -> segment_of :('a -> [ `Left | `Right ] ) -> [ `Last_on_left | `First_on_right ] -> int option val unsafe_create_uninitialized : len :int -> _ t The behavior is undefined if you access an element before setting it.
val create_obj_array : len :int -> Obj.t t New obj array filled with Obj.repr 0
val unsafe_set_assuming_currently_int : Obj.t t -> int -> Obj.t -> 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.
val unsafe_set_int_assuming_currently_int : Obj.t t -> int -> int -> unitval unsafe_set_int : Obj.t t -> int -> int -> unitval unsafe_clear_if_pointer : Obj.t t -> int -> unitunsafe_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.