package spurs

  1. Overview
  2. Docs

Module Spurs.UtilsSource

Sourceval (.!()) : 'a Dynarray.t -> int -> 'a
Sourceval (.!()<-) : 'a Dynarray.t -> int -> 'a -> unit
Sourceval of_array_array : 'a array array -> 'a Dynarray.t Dynarray.t
Sourceval to_array_array : 'a Dynarray.t Dynarray.t -> 'a array array
Sourceval subarray : 'a Dynarray.t -> int -> int -> 'a array
Sourceval sub : 'a Dynarray.t -> int -> int -> 'a Dynarray.t
Sourceval insert : 'a Dynarray.t -> int -> 'a -> unit
Sourceval zip : 'a Dynarray.t -> 'b Dynarray.t -> ('a * 'b) Dynarray.t
Sourceval zip_array : 'a array -> 'b array -> ('a * 'b) array
Sourceval foldi : ('a -> int -> 'b -> 'a) -> 'a -> 'b Dynarray.t -> 'a
Sourceval map_inplace : ('a -> 'a) -> 'a Dynarray.t -> unit
Sourceval is_sorted_from : 'a Dynarray.t -> int -> int -> bool

Check that arr is sorted from indexes s, e (exclusive)

Sourceval is_sorted : 'a Dynarray.t -> bool
Sourceval sort_from : 'a Dynarray.t -> int -> int -> unit

Sort an array from start, stop (exclusive)

Sourceval sort_like_from : 'a Dynarray.t -> 'b Dynarray.t -> int -> int -> unit

sort keys and vals in place from start to stop, using keys to sort both

Sourceval sort_like : 'a Dynarray.t -> 'b Dynarray.t -> unit

sort_like keys vals sorts keys and vals in place, using keys to sort both

Sourceval swap : 'a Dynarray.t -> int -> int -> unit

swaps arr.i and arr.j in place. Raises if either is an invalid index

Sourceval swap_arr : 'a array -> int -> int -> unit

Same as swap, but for arrays

Sourceval cumsum : int Dynarray.t -> unit

Turns arr into the cumulative sum in place

Sourceval transpose_dynarray : 'a Dynarray.t Dynarray.t -> 'a Dynarray.t Dynarray.t

Returns the transpose of 2D Dynarray

Sourceval transpose_array : 'a array array -> 'a array array

Returns the transpose of a 2D Array

Sourceval eye : int -> float array array

Returns the identity of nxn

Sourceval range : ?start:int -> int -> int Dynarray.t

Returns the range start, stop (exclusive)

Sourceval print_float_array : float array -> unit
Sourceval print_int_array : int array -> unit

binary_search arr x searches for x in arr. If it does not exist, returns None

Sourceval binary_search_from : 'a Dynarray.t -> int -> int -> 'a -> (int, int) result
Sourceval run_checks : (bool * 'a) Lazy.t list -> (unit, 'a) result

Lazily evaluates a list of conditions and returns the first false as an error with the corresponding message