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