Module JSourceFileInfo.Array
include module type of struct include IStdlib.IStd.Array end
type !'a t = 'a Base.Array.tval bin_shape_t : Bin_prot__.Shape.t -> Bin_prot__.Shape.tval bin_size_t : ('a, 'a t) Bin_prot__.Size.sizer1val bin_write_t : ('a, 'a t) Bin_prot__.Write.writer1val bin_read_t : ('a, 'a t) Bin_prot__.Read.reader1val __bin_read_t__ : ('a, int -> 'a t) Bin_prot__.Read.reader1val bin_writer_t : ('a, 'a t) Bin_prot__.Type_class.S1.writerval bin_reader_t : ('a, 'a t) Bin_prot__.Type_class.S1.readerval bin_t : ('a, 'a t) Bin_prot__.Type_class.S1.tval quickcheck_generator :
'a Base_quickcheck.Generator.t ->
'a t Base_quickcheck.Generator.tval quickcheck_observer :
'a Base_quickcheck.Observer.t ->
'a t Base_quickcheck.Observer.tval quickcheck_shrinker :
'a Base_quickcheck.Shrinker.t ->
'a t Base_quickcheck.Shrinker.tval typerep_of_t :
'a Typerep_lib.Std_internal.Typerep.t ->
'a t Typerep_lib.Std_internal.Typerep.tval typename_of_t : 'a Typerep_lib.Typename.t -> 'a t Typerep_lib.Typename.tval compare :
'a Base__Ppx_compare_lib.compare ->
'a t Base__Ppx_compare_lib.compareval globalize : ('a -> 'a) -> 'a t -> 'a tval t_of_sexp : (Sexplib0__.Sexp.t -> 'a) -> Sexplib0__.Sexp.t -> 'a tval sexp_of_t : ('a -> Sexplib0__.Sexp.t) -> 'a t -> Sexplib0__.Sexp.tval t_sexp_grammar : 'a Sexplib0.Sexp_grammar.t -> 'a t Sexplib0.Sexp_grammar.tval binary_search : ('a t, 'a, 'key) Base__Binary_searchable_intf.binary_searchval binary_search_segmented :
('a t, 'a) Base__Binary_searchable_intf.binary_search_segmentedval of_list : 'a list -> 'a tval of_array : 'a array -> 'a tval append : 'a t -> 'a t -> 'a tval map : 'a t -> f:('a -> 'b) -> 'b tval filter : 'a t -> f:('a -> bool) -> 'a tval filter_map : 'a t -> f:('a -> 'b option) -> 'b tval concat_map : 'a t -> f:('a -> 'b t) -> 'b tval partition_tf : 'a t -> f:('a -> bool) -> 'a t * 'a tval partition_map : 'a t -> f:('a -> ('b, 'c) Base__.Either0.t) -> 'b t * 'c tval mem : 'a t -> 'a -> equal:('a -> 'a -> bool) -> boolval is_empty : 'a t -> boolval iter : 'a t -> f:('a -> unit) -> unitval fold : 'a t -> init:'acc -> f:('acc -> 'a -> 'acc) -> 'accval fold_result :
'a t ->
init:'acc ->
f:('acc -> 'a -> ('acc, 'e) Base__.Result.t) ->
('acc, 'e) Base__.Result.tval fold_until :
'a t ->
init:'acc ->
f:('acc -> 'a -> ('acc, 'final) Base__Container_intf.Continue_or_stop.t) ->
finish:('acc -> 'final) ->
'finalval exists : 'a t -> f:('a -> bool) -> boolval for_all : 'a t -> f:('a -> bool) -> boolval count : 'a t -> f:('a -> bool) -> intval sum :
(module Base__Container_intf.Summable with type t = 'sum) ->
'a t ->
f:('a -> 'sum) ->
'sumval find : 'a t -> f:('a -> bool) -> 'a optionval find_map : 'a t -> f:('a -> 'b option) -> 'b optionval to_list : 'a t -> 'a listval to_array : 'a t -> 'a arrayval min_elt : 'a t -> compare:('a -> 'a -> int) -> 'a optionval max_elt : 'a t -> compare:('a -> 'a -> int) -> 'a optionval foldi : ('a t, 'a, 'b) Base__Indexed_container_intf.foldival iteri : ('a t, 'a) Base__Indexed_container_intf.iterival existsi : 'a t -> f:(int -> 'a -> bool) -> boolval for_alli : 'a t -> f:(int -> 'a -> bool) -> boolval counti : 'a t -> f:(int -> 'a -> bool) -> intval findi : 'a t -> f:(int -> 'a -> bool) -> (int * 'a) optionval find_mapi : 'a t -> f:(int -> 'a -> 'b option) -> 'b optionval init : int -> f:(int -> 'a) -> 'a tval mapi : 'a t -> f:(int -> 'a -> 'b) -> 'b tval filteri : 'a t -> f:(int -> 'a -> bool) -> 'a tval filter_mapi : 'a t -> f:(int -> 'a -> 'b option) -> 'b tval concat_mapi : 'a t -> f:(int -> 'a -> 'b t) -> 'b tval invariant : 'a Base__Invariant_intf.inv -> 'a t Base__Invariant_intf.invval get : 'a t -> int -> 'aval set : 'a t -> int -> 'a -> unitval unsafe_get : 'a t -> int -> 'aval unsafe_set : 'a t -> int -> 'a -> unitval create : len:int -> 'a -> 'a tval create_local : len:int -> 'a -> 'a tval create_float_uninitialized : len:int -> float tval make_matrix : dimx:int -> dimy:int -> 'a -> 'a t tval copy_matrix : 'a t t -> 'a t tval concat : 'a t list -> 'a tval fill : 'a t -> pos:int -> len:int -> 'a -> unitval blit : ('a t, 'a t) Base__Blit_intf.blitval blito : ('a t, 'a t) Base__Blit_intf.blitoval unsafe_blit : ('a t, 'a t) Base__Blit_intf.blitval sub : ('a t, 'a t) Base__Blit_intf.subval subo : ('a t, 'a t) Base__Blit_intf.suboval folding_map : 'a t -> init:'acc -> f:('acc -> 'a -> 'acc * 'b) -> 'b tval folding_mapi :
'a t ->
init:'acc ->
f:(int -> 'acc -> 'a -> 'acc * 'b) ->
'b tval fold_map : 'a t -> init:'acc -> f:('acc -> 'a -> 'acc * 'b) -> 'acc * 'b tval fold_mapi :
'a t ->
init:'acc ->
f:(int -> 'acc -> 'a -> 'acc * 'b) ->
'acc * 'b tval fold_right : 'a t -> f:('a -> 'acc -> 'acc) -> init:'acc -> 'accval sort : ?pos:int -> ?len:int -> 'a t -> compare:('a -> 'a -> int) -> unitval stable_sort : 'a t -> compare:('a -> 'a -> int) -> unitval is_sorted : 'a t -> compare:('a -> 'a -> int) -> boolval is_sorted_strictly : 'a t -> compare:('a -> 'a -> int) -> boolval merge : 'a t -> 'a t -> compare:('a -> 'a -> int) -> 'a tval partitioni_tf : 'a t -> f:(int -> 'a -> bool) -> 'a t * 'a tval cartesian_product : 'a t -> 'b t -> ('a * 'b) tval transpose : 'a t t -> 'a t t optionval transpose_exn : 'a t t -> 'a t tval filter_opt : 'a option t -> 'a tval iter2_exn : 'a t -> 'b t -> f:('a -> 'b -> unit) -> unitval map2_exn : 'a t -> 'b t -> f:('a -> 'b -> 'c) -> 'c tval fold2_exn :
'a t ->
'b t ->
init:'acc ->
f:('acc -> 'a -> 'b -> 'acc) ->
'accval for_all2_exn : 'a t -> 'b t -> f:('a -> 'b -> bool) -> boolval exists2_exn : 'a t -> 'b t -> f:('a -> 'b -> bool) -> boolval swap : 'a t -> int -> int -> unitval rev_inplace : 'a t -> unitval of_list_rev : 'a list -> 'a tval of_list_map : 'a list -> f:('a -> 'b) -> 'b tval of_list_mapi : 'a list -> f:(int -> 'a -> 'b) -> 'b tval of_list_rev_map : 'a list -> f:('a -> 'b) -> 'b tval of_list_rev_mapi : 'a list -> f:(int -> 'a -> 'b) -> 'b tval map_inplace : 'a t -> f:('a -> 'a) -> unitval find_exn : 'a t -> f:('a -> bool) -> 'aval find_map_exn : 'a t -> f:('a -> 'b option) -> 'bval findi_exn : 'a t -> f:(int -> 'a -> bool) -> int * 'aval find_mapi_exn : 'a t -> f:(int -> 'a -> 'b option) -> 'bval find_consecutive_duplicate :
'a t ->
equal:('a -> 'a -> bool) ->
('a * 'a) optionval reduce : 'a t -> f:('a -> 'a -> 'a) -> 'a optionval reduce_exn : 'a t -> f:('a -> 'a -> 'a) -> 'aval permute :
?random_state:Base__.Random.State.t ->
?pos:int ->
?len:int ->
'a t ->
unitval random_element : ?random_state:Base__.Random.State.t -> 'a t -> 'a optionval random_element_exn : ?random_state:Base__.Random.State.t -> 'a t -> 'aval zip : 'a t -> 'b t -> ('a * 'b) t optionval zip_exn : 'a t -> 'b t -> ('a * 'b) tval unzip : ('a * 'b) t -> 'a t * 'b tval sorted_copy : 'a t -> compare:('a -> 'a -> int) -> 'a tval equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> boolval to_sequence : 'a t -> 'a Base__.Sequence.tval to_sequence_mutable : 'a t -> 'a Base__.Sequence.tmodule Private : sig ... endmodule Float : sig ... endval normalize : 'a t -> Core__.Import.int -> Core__.Import.intval slice : 'a t -> Core__.Import.int -> Core__.Import.int -> 'a tval nget : 'a t -> Core__.Import.int -> 'aval nset : 'a t -> Core__.Import.int -> 'a -> Core__.Import.unitmodule Permissioned : sig ... endval make : int -> 'a -> 'a t