package grenier

  1. Overview
  2. Docs
A collection of various algorithms in OCaml

Install 

dune-project
 Dependency

github.com Readme Changelog Edit opam file Versions (11)

Authors

  1. F
    Frederic Bour <frederic.bour@lakaban.net>

Maintainers

  1. F
    Frederic Bour <frederic.bour@lakaban.net>

Sources

grenier-0.14.tbz
sha256=e5362e6ad0e888526517415e78b9e8243bb0cc1b0c952201884148832ac4442f
sha512=4e2f16b52b3c2786a1b8e93156184fd69d448cea571ca839b6cb88ab73f380994d1561fe24c1523c43ed8fc42d2ac01b673a13b6151fff4af4f009923d3aaf37

doc/grenier.strong/Strong/Finite/Array/index.html

Module Finite.Array

type ('n, 'a) t = private 'a array
type 'a _array =
  1. | A : ('n, 'a) t -> 'a _array
val empty : (Natural.zero, _) t
val is_empty : ('n, 'a) t -> (Natural.zero, 'n) eq option
val length : ('n, 'a) t -> 'n set
val get : ('n, 'a) t -> 'n elt -> 'a
val set : ('n, 'a) t -> 'n elt -> 'a -> unit
val make : 'n set -> 'a -> ('n, 'a) t
val init : 'n set -> ('n elt -> 'a) -> ('n, 'a) t
val make_matrix : 'i set -> 'j set -> 'a -> ('i, ('j, 'a) t) t
val append : ('n, 'a) t -> ('m, 'a) t -> (('n, 'm) Natural.sum, 'a) t
val of_array : 'a array -> 'a _array
module type T = sig ... end
module Of_array (A : sig ... end) : T with type a = A.a
val module_of_array : 'a array -> (module T with type a = 'a)
val to_array : ('n, 'a) t -> 'a array
val all_elements : 'n set -> ('n, 'n elt) t
val iter : ('a -> unit) -> (_, 'a) t -> unit
val iteri : ('n elt -> 'a -> unit) -> ('n, 'a) t -> unit
val rev_iter : ('a -> unit) -> (_, 'a) t -> unit
val rev_iteri : ('n elt -> 'a -> unit) -> ('n, 'a) t -> unit
val map : ('a -> 'b) -> ('n, 'a) t -> ('n, 'b) t
val mapi : ('n elt -> 'a -> 'b) -> ('n, 'a) t -> ('n, 'b) t
val fold_left : ('a -> 'b -> 'a) -> 'a -> ('n, 'b) t -> 'a
val fold_right : ('b -> 'a -> 'a) -> ('n, 'b) t -> 'a -> 'a
val iter2 : ('a -> 'b -> unit) -> ('n, 'a) t -> ('n, 'b) t -> unit
val map2 : ('a -> 'b -> 'c) -> ('n, 'a) t -> ('n, 'b) t -> ('n, 'c) t
val copy : ('n, 'a) t -> ('n, 'a) t