|
cannam@167
|
1 (*
|
|
cannam@167
|
2 * Copyright (c) 1997-1999 Massachusetts Institute of Technology
|
|
cannam@167
|
3 * Copyright (c) 2003, 2007-14 Matteo Frigo
|
|
cannam@167
|
4 * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
|
|
cannam@167
|
5 *
|
|
cannam@167
|
6 * This program is free software; you can redistribute it and/or modify
|
|
cannam@167
|
7 * it under the terms of the GNU General Public License as published by
|
|
cannam@167
|
8 * the Free Software Foundation; either version 2 of the License, or
|
|
cannam@167
|
9 * (at your option) any later version.
|
|
cannam@167
|
10 *
|
|
cannam@167
|
11 * This program is distributed in the hope that it will be useful,
|
|
cannam@167
|
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
cannam@167
|
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
cannam@167
|
14 * GNU General Public License for more details.
|
|
cannam@167
|
15 *
|
|
cannam@167
|
16 * You should have received a copy of the GNU General Public License
|
|
cannam@167
|
17 * along with this program; if not, write to the Free Software
|
|
cannam@167
|
18 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
|
|
cannam@167
|
19 *
|
|
cannam@167
|
20 *)
|
|
cannam@167
|
21
|
|
cannam@167
|
22 val invmod : int -> int -> int
|
|
cannam@167
|
23 val gcd : int -> int -> int
|
|
cannam@167
|
24 val lowest_terms : int -> int -> int * int
|
|
cannam@167
|
25 val find_generator : int -> int
|
|
cannam@167
|
26 val pow_mod : int -> int -> int -> int
|
|
cannam@167
|
27 val forall : 'a -> ('b -> 'a -> 'a) -> int -> int -> (int -> 'b) -> 'a
|
|
cannam@167
|
28 val sum_list : int list -> int
|
|
cannam@167
|
29 val max_list : int list -> int
|
|
cannam@167
|
30 val min_list : int list -> int
|
|
cannam@167
|
31 val count : ('a -> bool) -> 'a list -> int
|
|
cannam@167
|
32 val remove : 'a -> 'a list -> 'a list
|
|
cannam@167
|
33 val for_list : 'a list -> ('a -> unit) -> unit
|
|
cannam@167
|
34 val rmap : 'a list -> ('a -> 'b) -> 'b list
|
|
cannam@167
|
35 val cons : 'a -> 'a list -> 'a list
|
|
cannam@167
|
36 val null : 'a list -> bool
|
|
cannam@167
|
37 val (@@) : ('a -> 'b) -> ('c -> 'a) -> 'c -> 'b
|
|
cannam@167
|
38 val forall_flat : int -> int -> (int -> 'a list) -> 'a list
|
|
cannam@167
|
39 val identity : 'a -> 'a
|
|
cannam@167
|
40 val minimize : ('a -> 'b) -> 'a list -> 'a option
|
|
cannam@167
|
41 val find_elem : ('a -> bool) -> 'a list -> 'a option
|
|
cannam@167
|
42 val suchthat : int -> (int -> bool) -> int
|
|
cannam@167
|
43 val info : string -> unit
|
|
cannam@167
|
44 val iota : int -> int list
|
|
cannam@167
|
45 val interval : int -> int -> int list
|
|
cannam@167
|
46 val array : int -> (int -> 'a) -> int -> 'a
|
|
cannam@167
|
47 val take : int -> 'a list -> 'a list
|
|
cannam@167
|
48 val drop : int -> 'a list -> 'a list
|
|
cannam@167
|
49 val either : 'a option -> 'a -> 'a
|
