package gsl

  1. Overview
  2. Docs

Permutations

type permut = (int, Stdlib.Bigarray.int_elt, Stdlib.Bigarray.c_layout) Stdlib.Bigarray.Array1.t
val of_array : int array -> permut
val to_array : permut -> int array
val init : permut -> unit
val create : int -> permut
val make : int -> permut
val swap : permut -> int -> int -> unit
val size : permut -> int
val valid : permut -> bool
val reverse : permut -> unit
val inverse : permut -> permut
val next : permut -> unit
val prev : permut -> unit
val permute : permut -> 'a array -> unit
val permute_barr : permut -> ('a, 'b, 'c) Stdlib.Bigarray.Array1.t -> unit
val permute_complex : permut -> Gsl_complex.complex_array -> unit
val permute_inverse : permut -> 'a array -> unit
val permute_inverse_barr : permut -> ('a, 'b, 'c) Stdlib.Bigarray.Array1.t -> unit
val permute_inverse_complex : permut -> Gsl_complex.complex_array -> unit
val mul : permut -> permut -> permut
val linear_to_canonical : permut -> permut
val canonical_to_linear : permut -> permut
val inversions : permut -> int
val canonical_cycles : permut -> int
val linear_cycles : permut -> int
OCaml

Innovation. Community. Security.