Mercurial > hg > sv-dependency-builds

annotate src/fftw-3.3.3/genfft/util.mli @ 83:ae30d91d2ffe

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Replace these with versions built using an older toolset (so as to avoid ABI compatibilities when linking on Ubuntu 14.04 for packaging purposes)
author Chris Cannam
date Fri, 07 Feb 2020 11:51:13 +0000
parents 37bf6b4a2645
children
rev   line source
Chris@10 1 (*
Chris@10 2 * Copyright (c) 1997-1999 Massachusetts Institute of Technology
Chris@10 3 * Copyright (c) 2003, 2007-11 Matteo Frigo
Chris@10 4 * Copyright (c) 2003, 2007-11 Massachusetts Institute of Technology
Chris@10 5 *
Chris@10 6 * This program is free software; you can redistribute it and/or modify
Chris@10 7 * it under the terms of the GNU General Public License as published by
Chris@10 8 * the Free Software Foundation; either version 2 of the License, or
Chris@10 9 * (at your option) any later version.
Chris@10 10 *
Chris@10 11 * This program is distributed in the hope that it will be useful,
Chris@10 12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
Chris@10 13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
Chris@10 14 * GNU General Public License for more details.
Chris@10 15 *
Chris@10 16 * You should have received a copy of the GNU General Public License
Chris@10 17 * along with this program; if not, write to the Free Software
Chris@10 18 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
Chris@10 19 *
Chris@10 20 *)
Chris@10 21
Chris@10 22 val invmod : int -> int -> int
Chris@10 23 val gcd : int -> int -> int
Chris@10 24 val lowest_terms : int -> int -> int * int
Chris@10 25 val find_generator : int -> int
Chris@10 26 val pow_mod : int -> int -> int -> int
Chris@10 27 val forall : 'a -> ('b -> 'a -> 'a) -> int -> int -> (int -> 'b) -> 'a
Chris@10 28 val sum_list : int list -> int
Chris@10 29 val max_list : int list -> int
Chris@10 30 val min_list : int list -> int
Chris@10 31 val count : ('a -> bool) -> 'a list -> int
Chris@10 32 val remove : 'a -> 'a list -> 'a list
Chris@10 33 val for_list : 'a list -> ('a -> unit) -> unit
Chris@10 34 val rmap : 'a list -> ('a -> 'b) -> 'b list
Chris@10 35 val cons : 'a -> 'a list -> 'a list
Chris@10 36 val null : 'a list -> bool
Chris@10 37 val (@@) : ('a -> 'b) -> ('c -> 'a) -> 'c -> 'b
Chris@10 38 val forall_flat : int -> int -> (int -> 'a list) -> 'a list
Chris@10 39 val identity : 'a -> 'a
Chris@10 40 val minimize : ('a -> 'b) -> 'a list -> 'a option
Chris@10 41 val find_elem : ('a -> bool) -> 'a list -> 'a option
Chris@10 42 val suchthat : int -> (int -> bool) -> int
Chris@10 43 val info : string -> unit
Chris@10 44 val iota : int -> int list
Chris@10 45 val interval : int -> int -> int list
Chris@10 46 val array : int -> (int -> 'a) -> int -> 'a
Chris@10 47 val take : int -> 'a list -> 'a list
Chris@10 48 val drop : int -> 'a list -> 'a list
Chris@10 49 val either : 'a option -> 'a -> 'a