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