Updates

fftw-3.3.10/genfft/util.mli

@@ -0,0 +1,49 @@
+(*
+ * Copyright (c) 1997-1999 Massachusetts Institute of Technology
+ * Copyright (c) 2003, 2007-14 Matteo Frigo
+ * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
+ *
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation; either version 2 of the License, or
+ * (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, write to the Free Software
+ * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
+ *
+ *)
+
+val invmod : int -> int -> int
+val gcd : int -> int -> int
+val lowest_terms : int -> int -> int * int
+val find_generator : int -> int
+val pow_mod : int -> int -> int -> int
+val forall : 'a -> ('b -> 'a -> 'a) -> int -> int -> (int -> 'b) -> 'a
+val sum_list : int list -> int
+val max_list : int list -> int
+val min_list : int list -> int
+val count : ('a -> bool) -> 'a list -> int
+val remove : 'a -> 'a list -> 'a list
+val for_list : 'a list -> ('a -> unit) -> unit
+val rmap : 'a list -> ('a -> 'b) -> 'b list
+val cons : 'a -> 'a list -> 'a list
+val null : 'a list -> bool
+val (@@) : ('a -> 'b) -> ('c -> 'a) -> 'c -> 'b
+val forall_flat : int -> int -> (int -> 'a list) -> 'a list
+val identity : 'a -> 'a
+val minimize : ('a -> 'b) -> 'a list -> 'a option
+val find_elem : ('a -> bool) -> 'a list -> 'a option
+val suchthat : int -> (int -> bool) -> int
+val info : string -> unit
+val iota : int -> int list
+val interval : int -> int -> int list
+val array : int -> (int -> 'a) -> int -> 'a
+val take : int -> 'a list -> 'a list
+val drop : int -> 'a list -> 'a list
+val either : 'a option -> 'a -> 'a