author | chaieb |
Wed, 31 Oct 2007 12:19:41 +0100 | |
changeset 25252 | 833abbc3e733 |
parent 25224 | 6d4d26e878f4 |
child 25538 | 58e8ba3b792b |
permissions | -rw-r--r-- |
41
97aae241094b
added cons, rcons, last_elem, sort_strings, take_suffix;
wenzelm
parents:
24
diff
changeset
|
1 |
(* Title: Pure/library.ML |
0 | 2 |
ID: $Id$ |
233 | 3 |
Author: Lawrence C Paulson, Cambridge University Computer Laboratory |
16188 | 4 |
Author: Markus Wenzel, TU Muenchen |
0 | 5 |
|
233 | 6 |
Basic library: functions, options, pairs, booleans, lists, integers, |
23424
d0580634f128
moved balanced tree operations to General/balanced_tree.ML;
wenzelm
parents:
23251
diff
changeset
|
7 |
strings, lists as sets, orders, current directory, misc. |
21395
f34ac19659ae
moved some fundamental concepts to General/basics.ML;
wenzelm
parents:
21335
diff
changeset
|
8 |
|
f34ac19659ae
moved some fundamental concepts to General/basics.ML;
wenzelm
parents:
21335
diff
changeset
|
9 |
See also General/basics.ML for the most fundamental concepts. |
0 | 10 |
*) |
11 |
||
21395
f34ac19659ae
moved some fundamental concepts to General/basics.ML;
wenzelm
parents:
21335
diff
changeset
|
12 |
infix 1 |>>> |
f34ac19659ae
moved some fundamental concepts to General/basics.ML;
wenzelm
parents:
21335
diff
changeset
|
13 |
infix 2 ? |
f34ac19659ae
moved some fundamental concepts to General/basics.ML;
wenzelm
parents:
21335
diff
changeset
|
14 |
infix 3 o oo ooo oooo |
f34ac19659ae
moved some fundamental concepts to General/basics.ML;
wenzelm
parents:
21335
diff
changeset
|
15 |
infix 4 ~~ upto downto |
20854 | 16 |
infix orf andf \ \\ mem mem_int mem_string union union_int |
21395
f34ac19659ae
moved some fundamental concepts to General/basics.ML;
wenzelm
parents:
21335
diff
changeset
|
17 |
union_string inter inter_int inter_string subset subset_int subset_string |
5893 | 18 |
|
15745 | 19 |
signature BASIC_LIBRARY = |
4621 | 20 |
sig |
21 |
(*functions*) |
|
23860 | 22 |
val undefined: 'a -> 'b |
16842 | 23 |
val I: 'a -> 'a |
24 |
val K: 'a -> 'b -> 'a |
|
4621 | 25 |
val curry: ('a * 'b -> 'c) -> 'a -> 'b -> 'c |
26 |
val uncurry: ('a -> 'b -> 'c) -> 'a * 'b -> 'c |
|
21335
6b9d4a19a3a8
added higher-order combinators for structured results
haftmann
parents:
21182
diff
changeset
|
27 |
val |>>> : ('a * 'c) * ('a -> 'b * 'd) -> 'b * ('c * 'd) |
21565 | 28 |
val ? : bool * ('a -> 'a) -> 'a -> 'a |
16721 | 29 |
val oo: ('a -> 'b) * ('c -> 'd -> 'a) -> 'c -> 'd -> 'b |
30 |
val ooo: ('a -> 'b) * ('c -> 'd -> 'e -> 'a) -> 'c -> 'd -> 'e -> 'b |
|
31 |
val oooo: ('a -> 'b) * ('c -> 'd -> 'e -> 'f -> 'a) -> 'c -> 'd -> 'e -> 'f -> 'b |
|
16842 | 32 |
val funpow: int -> ('a -> 'a) -> 'a -> 'a |
1364
8ea1a962ad72
files now define a structure to allow SML/NJ to optimize the code
clasohm
parents:
1290
diff
changeset
|
33 |
|
18681
3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset
|
34 |
(*errors*) |
19542 | 35 |
exception SYS_ERROR of string |
36 |
val sys_error: string -> 'a |
|
18681
3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset
|
37 |
exception ERROR of string |
3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset
|
38 |
val error: string -> 'a |
3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset
|
39 |
val cat_error: string -> string -> 'a |
3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset
|
40 |
val assert_all: ('a -> bool) -> 'a list -> ('a -> string) -> unit |
3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset
|
41 |
|
4621 | 42 |
(*pairs*) |
43 |
val pair: 'a -> 'b -> 'a * 'b |
|
44 |
val rpair: 'a -> 'b -> 'b * 'a |
|
45 |
val fst: 'a * 'b -> 'a |
|
46 |
val snd: 'a * 'b -> 'b |
|
17498
d83af87bbdc5
improved eq_fst and eq_snd, removed some deprecated stuff
haftmann
parents:
17486
diff
changeset
|
47 |
val eq_fst: ('a * 'c -> bool) -> ('a * 'b) * ('c * 'd) -> bool |
d83af87bbdc5
improved eq_fst and eq_snd, removed some deprecated stuff
haftmann
parents:
17486
diff
changeset
|
48 |
val eq_snd: ('b * 'd -> bool) -> ('a * 'b) * ('c * 'd) -> bool |
19454
46a7e133f802
moved coalesce to AList, added equality predicates to library
haftmann
parents:
19424
diff
changeset
|
49 |
val eq_pair: ('a * 'c -> bool) -> ('b * 'd -> bool) -> ('a * 'b) * ('c * 'd) -> bool |
4621 | 50 |
val swap: 'a * 'b -> 'b * 'a |
51 |
val apfst: ('a -> 'b) -> 'a * 'c -> 'b * 'c |
|
52 |
val apsnd: ('a -> 'b) -> 'c * 'a -> 'c * 'b |
|
53 |
val pairself: ('a -> 'b) -> 'a * 'a -> 'b * 'b |
|
54 |
||
55 |
(*booleans*) |
|
56 |
val equal: ''a -> ''a -> bool |
|
57 |
val not_equal: ''a -> ''a -> bool |
|
58 |
val orf: ('a -> bool) * ('a -> bool) -> 'a -> bool |
|
59 |
val andf: ('a -> bool) * ('a -> bool) -> 'a -> bool |
|
60 |
val exists: ('a -> bool) -> 'a list -> bool |
|
61 |
val forall: ('a -> bool) -> 'a list -> bool |
|
62 |
val set: bool ref -> bool |
|
63 |
val reset: bool ref -> bool |
|
64 |
val toggle: bool ref -> bool |
|
9118 | 65 |
val change: 'a ref -> ('a -> 'a) -> unit |
23932 | 66 |
val setmp_noncritical: 'a ref -> 'a -> ('b -> 'c) -> 'b -> 'c |
4621 | 67 |
val setmp: 'a ref -> 'a -> ('b -> 'c) -> 'b -> 'c |
68 |
||
69 |
(*lists*) |
|
15570 | 70 |
exception UnequalLengths |
5285 | 71 |
val single: 'a -> 'a list |
20882 | 72 |
val the_single: 'a list -> 'a |
19273 | 73 |
val singleton: ('a list -> 'b list) -> 'a -> 'b |
25061 | 74 |
val yield_singleton: ('a list -> 'c -> 'b list * 'c) -> 'a -> 'c -> 'b * 'c |
5904 | 75 |
val apply: ('a -> 'a) list -> 'a -> 'a |
25058 | 76 |
val perhaps_apply: ('a -> 'a option) list -> 'a -> 'a option |
77 |
val perhaps_loop: ('a -> 'a option) -> 'a -> 'a option |
|
15760 | 78 |
val foldr1: ('a * 'a -> 'a) -> 'a list -> 'a |
18278 | 79 |
val foldl_map: ('a * 'b -> 'a * 'c) -> 'a * 'b list -> 'a * 'c list |
19461 | 80 |
val flat: 'a list list -> 'a list |
19424 | 81 |
val unflat: 'a list list -> 'b list -> 'b list list |
18441 | 82 |
val burrow: ('a list -> 'b list) -> 'a list list -> 'b list list |
24864 | 83 |
val burrow_options: ('a list -> 'b list) -> 'a option list -> 'b option list |
18549
5308a6ea3b96
rearranged burrow_split to fold_burrow to allow composition with fold_map
haftmann
parents:
18514
diff
changeset
|
84 |
val fold_burrow: ('a list -> 'c -> 'b list * 'd) -> 'a list list -> 'c -> 'b list list * 'd |
21395
f34ac19659ae
moved some fundamental concepts to General/basics.ML;
wenzelm
parents:
21335
diff
changeset
|
85 |
val maps: ('a -> 'b list) -> 'a list -> 'b list |
19011 | 86 |
val chop: int -> 'a list -> 'a list * 'a list |
4713 | 87 |
val dropwhile: ('a -> bool) -> 'a list -> 'a list |
18278 | 88 |
val nth: 'a list -> int -> 'a |
18011
685d95c793ff
cleaned up nth, nth_update, nth_map and nth_string functions
haftmann
parents:
17952
diff
changeset
|
89 |
val nth_map: int -> ('a -> 'a) -> 'a list -> 'a list |
24846 | 90 |
val nth_drop: int -> 'a list -> 'a list |
18286 | 91 |
val nth_list: 'a list list -> int -> 'a list |
18514 | 92 |
val map_index: (int * 'a -> 'b) -> 'a list -> 'b list |
93 |
val fold_index: (int * 'a -> 'b -> 'b) -> 'a list -> 'b -> 'b |
|
4621 | 94 |
val split_last: 'a list -> 'a list * 'a |
95 |
val find_index: ('a -> bool) -> 'a list -> int |
|
96 |
val find_index_eq: ''a -> ''a list -> int |
|
97 |
val find_first: ('a -> bool) -> 'a list -> 'a option |
|
19233
77ca20b0ed77
renamed HOL + - * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19119
diff
changeset
|
98 |
val get_index: ('a -> 'b option) -> 'a list -> (int * 'b) option |
4916
fe8b0c82691b
get_first: ('a -> 'b option) -> 'a list -> 'b option;
wenzelm
parents:
4893
diff
changeset
|
99 |
val get_first: ('a -> 'b option) -> 'a list -> 'b option |
19454
46a7e133f802
moved coalesce to AList, added equality predicates to library
haftmann
parents:
19424
diff
changeset
|
100 |
val eq_list: ('a * 'b -> bool) -> 'a list * 'b list -> bool |
18330 | 101 |
val map2: ('a -> 'b -> 'c) -> 'a list -> 'b list -> 'c list |
102 |
val fold2: ('a -> 'b -> 'c -> 'c) -> 'a list -> 'b list -> 'c -> 'c |
|
19799 | 103 |
val zip_options: 'a list -> 'b option list -> ('a * 'b) list |
18330 | 104 |
val ~~ : 'a list * 'b list -> ('a * 'b) list |
105 |
val split_list: ('a * 'b) list -> 'a list * 'b list |
|
4621 | 106 |
val separate: 'a -> 'a list -> 'a list |
107 |
val replicate: int -> 'a -> 'a list |
|
18148 | 108 |
val multiply: 'a list -> 'a list list -> 'a list list |
14792 | 109 |
val product: 'a list -> 'b list -> ('a * 'b) list |
16129 | 110 |
val filter: ('a -> bool) -> 'a list -> 'a list |
4621 | 111 |
val filter_out: ('a -> bool) -> 'a list -> 'a list |
19483
55ee839198bd
renamed mapfilter to map_filter, made pervasive (again);
wenzelm
parents:
19474
diff
changeset
|
112 |
val map_filter: ('a -> 'b option) -> 'a list -> 'b list |
18441 | 113 |
val is_prefix: ('a * 'a -> bool) -> 'a list -> 'a list -> bool |
4621 | 114 |
val take_prefix: ('a -> bool) -> 'a list -> 'a list * 'a list |
20108 | 115 |
val chop_prefix: ('a * 'b -> bool) -> 'a list * 'b list -> 'a list * ('a list * 'b list) |
4621 | 116 |
val take_suffix: ('a -> bool) -> 'a list -> 'a list * 'a list |
12249 | 117 |
val prefixes1: 'a list -> 'a list list |
19011 | 118 |
val prefixes: 'a list -> 'a list list |
12249 | 119 |
val suffixes1: 'a list -> 'a list list |
19011 | 120 |
val suffixes: 'a list -> 'a list list |
4621 | 121 |
|
122 |
(*integers*) |
|
123 |
val inc: int ref -> int |
|
124 |
val dec: int ref -> int |
|
125 |
val upto: int * int -> int list |
|
126 |
val downto: int * int -> int list |
|
127 |
val radixpand: int * int -> int list |
|
128 |
val radixstring: int * string * int -> string |
|
129 |
val string_of_int: int -> string |
|
21942
d6218d0f9ec3
added signed_string_of_int (pruduces proper - instead of SML's ~);
wenzelm
parents:
21920
diff
changeset
|
130 |
val signed_string_of_int: int -> string |
4621 | 131 |
val string_of_indexname: string * int -> string |
24630
351a308ab58d
simplified type int (eliminated IntInf.int, integer);
wenzelm
parents:
24593
diff
changeset
|
132 |
val read_radix_int: int -> string list -> int * string list |
14826
48cfe0fe53e2
output channels and diagnostics moved to General/output.ML; added read_int etc. from term.ML; removed obsolete mtree; type rat uses exception RAT;
wenzelm
parents:
14797
diff
changeset
|
133 |
val read_int: string list -> int * string list |
48cfe0fe53e2
output channels and diagnostics moved to General/output.ML; added read_int etc. from term.ML; removed obsolete mtree; type rat uses exception RAT;
wenzelm
parents:
14797
diff
changeset
|
134 |
val oct_char: string -> string |
4621 | 135 |
|
136 |
(*strings*) |
|
18011
685d95c793ff
cleaned up nth, nth_update, nth_map and nth_string functions
haftmann
parents:
17952
diff
changeset
|
137 |
val nth_string: string -> int -> string |
16188 | 138 |
val fold_string: (string -> 'a -> 'a) -> string -> 'a -> 'a |
6312 | 139 |
val exists_string: (string -> bool) -> string -> bool |
16188 | 140 |
val forall_string: (string -> bool) -> string -> bool |
4621 | 141 |
val enclose: string -> string -> string -> string |
6642 | 142 |
val unenclose: string -> string |
4621 | 143 |
val quote: string -> string |
144 |
val space_implode: string -> string list -> string |
|
145 |
val commas: string list -> string |
|
146 |
val commas_quote: string list -> string |
|
147 |
val cat_lines: string list -> string |
|
148 |
val space_explode: string -> string -> string list |
|
14826
48cfe0fe53e2
output channels and diagnostics moved to General/output.ML; added read_int etc. from term.ML; removed obsolete mtree; type rat uses exception RAT;
wenzelm
parents:
14797
diff
changeset
|
149 |
val split_lines: string -> string list |
5942 | 150 |
val prefix_lines: string -> string -> string |
7712 | 151 |
val untabify: string list -> string list |
18681
3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset
|
152 |
val prefix: string -> string -> string |
5285 | 153 |
val suffix: string -> string -> string |
18681
3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset
|
154 |
val unprefix: string -> string -> string |
5285 | 155 |
val unsuffix: string -> string -> string |
10951 | 156 |
val replicate_string: int -> string -> string |
14926 | 157 |
val translate_string: (string -> string) -> string -> string |
4621 | 158 |
|
16492 | 159 |
(*lists as sets -- see also Pure/General/ord_list.ML*) |
18923 | 160 |
val member: ('b * 'a -> bool) -> 'a list -> 'b -> bool |
161 |
val insert: ('a * 'a -> bool) -> 'a -> 'a list -> 'a list |
|
162 |
val remove: ('b * 'a -> bool) -> 'b -> 'a list -> 'a list |
|
24049 | 163 |
val update: ('a * 'a -> bool) -> 'a -> 'a list -> 'a list |
19301 | 164 |
val subtract: ('b * 'a -> bool) -> 'b list -> 'a list -> 'a list |
18923 | 165 |
val merge: ('a * 'a -> bool) -> 'a list * 'a list -> 'a list |
4621 | 166 |
val mem: ''a * ''a list -> bool |
167 |
val mem_int: int * int list -> bool |
|
168 |
val mem_string: string * string list -> bool |
|
169 |
val union: ''a list * ''a list -> ''a list |
|
170 |
val union_int: int list * int list -> int list |
|
171 |
val union_string: string list * string list -> string list |
|
172 |
val gen_union: ('a * 'a -> bool) -> 'a list * 'a list -> 'a list |
|
7090 | 173 |
val gen_inter: ('a * 'b -> bool) -> 'a list * 'b list -> 'a list |
4621 | 174 |
val inter: ''a list * ''a list -> ''a list |
175 |
val inter_int: int list * int list -> int list |
|
176 |
val inter_string: string list * string list -> string list |
|
177 |
val subset: ''a list * ''a list -> bool |
|
178 |
val subset_int: int list * int list -> bool |
|
179 |
val subset_string: string list * string list -> bool |
|
180 |
val eq_set: ''a list * ''a list -> bool |
|
181 |
val eq_set_string: string list * string list -> bool |
|
182 |
val gen_subset: ('a * 'b -> bool) -> 'a list * 'b list -> bool |
|
19301 | 183 |
val gen_eq_set: ('a * 'b -> bool) -> 'a list * 'b list -> bool |
4621 | 184 |
val \ : ''a list * ''a -> ''a list |
185 |
val \\ : ''a list * ''a list -> ''a list |
|
19046
bc5c6c9b114e
removed distinct, renamed gen_distinct to distinct;
wenzelm
parents:
19011
diff
changeset
|
186 |
val distinct: ('a * 'a -> bool) -> 'a list -> 'a list |
18966 | 187 |
val duplicates: ('a * 'a -> bool) -> 'a list -> 'a list |
16878 | 188 |
val has_duplicates: ('a * 'a -> bool) -> 'a list -> bool |
4621 | 189 |
|
23220 | 190 |
(*lists as multisets*) |
22142 | 191 |
val remove1: ('b * 'a -> bool) -> 'b -> 'a list -> 'a list |
23220 | 192 |
val submultiset: ('a * 'b -> bool) -> 'a list * 'b list -> bool |
4621 | 193 |
|
194 |
(*orders*) |
|
18966 | 195 |
val is_equal: order -> bool |
4621 | 196 |
val rev_order: order -> order |
197 |
val make_ord: ('a * 'a -> bool) -> 'a * 'a -> order |
|
25224 | 198 |
val bool_ord: bool * bool -> order |
4621 | 199 |
val int_ord: int * int -> order |
200 |
val string_ord: string * string -> order |
|
16676 | 201 |
val fast_string_ord: string * string -> order |
16492 | 202 |
val option_ord: ('a * 'b -> order) -> 'a option * 'b option -> order |
4621 | 203 |
val prod_ord: ('a * 'b -> order) -> ('c * 'd -> order) -> ('a * 'c) * ('b * 'd) -> order |
204 |
val dict_ord: ('a * 'b -> order) -> 'a list * 'b list -> order |
|
205 |
val list_ord: ('a * 'b -> order) -> 'a list * 'b list -> order |
|
206 |
val sort: ('a * 'a -> order) -> 'a list -> 'a list |
|
18427 | 207 |
val sort_distinct: ('a * 'a -> order) -> 'a list -> 'a list |
4621 | 208 |
val sort_strings: string list -> string list |
209 |
val sort_wrt: ('a -> string) -> 'a list -> 'a list |
|
210 |
||
14106
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
211 |
(*random numbers*) |
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
212 |
exception RANDOM |
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
213 |
val random: unit -> real |
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
214 |
val random_range: int -> int -> int |
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
215 |
val one_of: 'a list -> 'a |
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
216 |
val frequency: (int * 'a) list -> 'a |
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
217 |
|
4621 | 218 |
(*misc*) |
19644
0b01436e1843
added divide_and_conquer combinator (by Amine Chaieb);
wenzelm
parents:
19596
diff
changeset
|
219 |
val divide_and_conquer: ('a -> 'a list * ('b list -> 'b)) -> 'a -> 'b |
4621 | 220 |
val partition_eq: ('a * 'a -> bool) -> 'a list -> 'a list list |
221 |
val partition_list: (int -> 'a -> bool) -> int -> int -> 'a list -> 'a list list |
|
222 |
val gensym: string -> string |
|
16439 | 223 |
type stamp |
224 |
val stamp: unit -> stamp |
|
225 |
type serial |
|
226 |
val serial: unit -> serial |
|
19512 | 227 |
val serial_string: unit -> string |
16535
86c9eada525b
added structure Object (from Pure/General/object.ML);
wenzelm
parents:
16492
diff
changeset
|
228 |
structure Object: sig type T end |
4621 | 229 |
end; |
230 |
||
15745 | 231 |
signature LIBRARY = |
15570 | 232 |
sig |
15745 | 233 |
include BASIC_LIBRARY |
15570 | 234 |
val foldl: ('a * 'b -> 'a) -> 'a * 'b list -> 'a |
235 |
val foldr: ('a * 'b -> 'b) -> 'a list * 'b -> 'b |
|
236 |
val take: int * 'a list -> 'a list |
|
237 |
val drop: int * 'a list -> 'a list |
|
238 |
val last_elem: 'a list -> 'a |
|
239 |
end; |
|
240 |
||
15745 | 241 |
structure Library: LIBRARY = |
1364
8ea1a962ad72
files now define a structure to allow SML/NJ to optimize the code
clasohm
parents:
1290
diff
changeset
|
242 |
struct |
0 | 243 |
|
21395
f34ac19659ae
moved some fundamental concepts to General/basics.ML;
wenzelm
parents:
21335
diff
changeset
|
244 |
(* functions *) |
0 | 245 |
|
23860 | 246 |
fun undefined _ = raise Match; |
247 |
||
16842 | 248 |
fun I x = x; |
249 |
fun K x = fn _ => x; |
|
233 | 250 |
fun curry f x y = f (x, y); |
251 |
fun uncurry f (x, y) = f x y; |
|
0 | 252 |
|
21395
f34ac19659ae
moved some fundamental concepts to General/basics.ML;
wenzelm
parents:
21335
diff
changeset
|
253 |
(*application and structured results -- old version*) |
16705 | 254 |
fun (x, y) |>>> f = let val (x', z) = f x in (x', (y, z)) end; |
16842 | 255 |
|
17141
4b0dc89de43b
added ? combinator for conditional transformations
haftmann
parents:
17101
diff
changeset
|
256 |
(*conditional application*) |
21565 | 257 |
fun b ? f = fn x => if b then f x else x; |
17141
4b0dc89de43b
added ? combinator for conditional transformations
haftmann
parents:
17101
diff
changeset
|
258 |
|
16721 | 259 |
(*composition with multiple args*) |
260 |
fun (f oo g) x y = f (g x y); |
|
261 |
fun (f ooo g) x y z = f (g x y z); |
|
262 |
fun (f oooo g) x y z w = f (g x y z w); |
|
263 |
||
233 | 264 |
(*function exponentiation: f(...(f x)...) with n applications of f*) |
24593
1547ea587f5a
added some int constraints (ML_Parse.fix_ints not active here);
wenzelm
parents:
24148
diff
changeset
|
265 |
fun funpow (0: int) _ x = x |
23718 | 266 |
| funpow n f x = funpow (n - 1) f (f x); |
160 | 267 |
|
268 |
||
18681
3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset
|
269 |
(* errors *) |
3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset
|
270 |
|
19542 | 271 |
exception SYS_ERROR of string; |
272 |
fun sys_error msg = raise SYS_ERROR msg; |
|
273 |
||
18681
3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset
|
274 |
exception ERROR of string; |
3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset
|
275 |
fun error msg = raise ERROR msg; |
3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset
|
276 |
|
3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset
|
277 |
fun cat_error "" msg = error msg |
3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset
|
278 |
| cat_error msg1 msg2 = error (msg1 ^ "\n" ^ msg2); |
3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset
|
279 |
|
3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset
|
280 |
fun assert_all pred list msg = |
3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset
|
281 |
let |
3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset
|
282 |
fun ass [] = () |
3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset
|
283 |
| ass (x :: xs) = if pred x then ass xs else error (msg x); |
3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset
|
284 |
in ass list end; |
3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset
|
285 |
|
3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset
|
286 |
|
21395
f34ac19659ae
moved some fundamental concepts to General/basics.ML;
wenzelm
parents:
21335
diff
changeset
|
287 |
(* pairs *) |
233 | 288 |
|
289 |
fun pair x y = (x, y); |
|
290 |
fun rpair x y = (y, x); |
|
291 |
||
292 |
fun fst (x, y) = x; |
|
293 |
fun snd (x, y) = y; |
|
294 |
||
17498
d83af87bbdc5
improved eq_fst and eq_snd, removed some deprecated stuff
haftmann
parents:
17486
diff
changeset
|
295 |
fun eq_fst eq ((x1, _), (x2, _)) = eq (x1, x2); |
d83af87bbdc5
improved eq_fst and eq_snd, removed some deprecated stuff
haftmann
parents:
17486
diff
changeset
|
296 |
fun eq_snd eq ((_, y1), (_, y2)) = eq (y1, y2); |
19454
46a7e133f802
moved coalesce to AList, added equality predicates to library
haftmann
parents:
19424
diff
changeset
|
297 |
fun eq_pair eqx eqy ((x1, y1), (x2, y2)) = eqx (x1, x2) andalso eqy (y1, y2); |
233 | 298 |
|
299 |
fun swap (x, y) = (y, x); |
|
300 |
||
301 |
fun apfst f (x, y) = (f x, y); |
|
302 |
fun apsnd f (x, y) = (x, f y); |
|
4212 | 303 |
fun pairself f (x, y) = (f x, f y); |
233 | 304 |
|
305 |
||
21395
f34ac19659ae
moved some fundamental concepts to General/basics.ML;
wenzelm
parents:
21335
diff
changeset
|
306 |
(* booleans *) |
233 | 307 |
|
21395
f34ac19659ae
moved some fundamental concepts to General/basics.ML;
wenzelm
parents:
21335
diff
changeset
|
308 |
(*polymorphic equality*) |
233 | 309 |
fun equal x y = x = y; |
310 |
fun not_equal x y = x <> y; |
|
311 |
||
21395
f34ac19659ae
moved some fundamental concepts to General/basics.ML;
wenzelm
parents:
21335
diff
changeset
|
312 |
(*combining predicates*) |
16721 | 313 |
fun p orf q = fn x => p x orelse q x; |
314 |
fun p andf q = fn x => p x andalso q x; |
|
233 | 315 |
|
316 |
(*exists pred [x1, ..., xn] ===> pred x1 orelse ... orelse pred xn*) |
|
317 |
fun exists (pred: 'a -> bool) : 'a list -> bool = |
|
318 |
let fun boolf [] = false |
|
319 |
| boolf (x :: xs) = pred x orelse boolf xs |
|
320 |
in boolf end; |
|
321 |
||
322 |
(*forall pred [x1, ..., xn] ===> pred x1 andalso ... andalso pred xn*) |
|
323 |
fun forall (pred: 'a -> bool) : 'a list -> bool = |
|
324 |
let fun boolf [] = true |
|
325 |
| boolf (x :: xs) = pred x andalso boolf xs |
|
326 |
in boolf end; |
|
0 | 327 |
|
19644
0b01436e1843
added divide_and_conquer combinator (by Amine Chaieb);
wenzelm
parents:
19596
diff
changeset
|
328 |
|
380 | 329 |
(* flags *) |
330 |
||
331 |
fun set flag = (flag := true; true); |
|
332 |
fun reset flag = (flag := false; false); |
|
333 |
fun toggle flag = (flag := not (! flag); ! flag); |
|
334 |
||
9118 | 335 |
fun change r f = r := f (! r); |
336 |
||
18712 | 337 |
(*temporarily set flag during execution*) |
23932 | 338 |
fun setmp_noncritical flag value f x = |
2958 | 339 |
let |
340 |
val orig_value = ! flag; |
|
18712 | 341 |
val _ = flag := value; |
23963
c2ee97a963db
moved exception capture/release to structure Exn;
wenzelm
parents:
23937
diff
changeset
|
342 |
val result = Exn.capture f x; |
18712 | 343 |
val _ = flag := orig_value; |
23963
c2ee97a963db
moved exception capture/release to structure Exn;
wenzelm
parents:
23937
diff
changeset
|
344 |
in Exn.release result end; |
2958 | 345 |
|
24023 | 346 |
fun setmp flag value f x = NAMED_CRITICAL "setmp" (fn () => setmp_noncritical flag value f x); |
23932 | 347 |
|
19644
0b01436e1843
added divide_and_conquer combinator (by Amine Chaieb);
wenzelm
parents:
19596
diff
changeset
|
348 |
|
21395
f34ac19659ae
moved some fundamental concepts to General/basics.ML;
wenzelm
parents:
21335
diff
changeset
|
349 |
|
233 | 350 |
(** lists **) |
351 |
||
15570 | 352 |
exception UnequalLengths; |
233 | 353 |
|
5285 | 354 |
fun single x = [x]; |
233 | 355 |
|
20882 | 356 |
fun the_single [x] = x |
357 |
| the_single _ = raise Empty; |
|
358 |
||
359 |
fun singleton f x = the_single (f [x]); |
|
19273 | 360 |
|
25061 | 361 |
fun yield_singleton f x = f [x] #>> the_single; |
362 |
||
5904 | 363 |
fun apply [] x = x |
364 |
| apply (f :: fs) x = apply fs (f x); |
|
365 |
||
25058 | 366 |
fun perhaps_apply funs arg = |
367 |
let |
|
368 |
fun app [] res = res |
|
369 |
| app (f :: fs) (changed, x) = |
|
370 |
(case f x of |
|
371 |
NONE => app fs (changed, x) |
|
372 |
| SOME x' => app fs (true, x')); |
|
373 |
in (case app funs (false, arg) of (false, _) => NONE | (true, arg') => SOME arg') end; |
|
374 |
||
375 |
fun perhaps_loop f arg = |
|
376 |
let |
|
377 |
fun loop (changed, x) = |
|
378 |
(case f x of |
|
379 |
NONE => (changed, x) |
|
380 |
| SOME x' => loop (true, x')); |
|
381 |
in (case loop (false, arg) of (false, _) => NONE | (true, arg') => SOME arg') end; |
|
382 |
||
233 | 383 |
|
21395
f34ac19659ae
moved some fundamental concepts to General/basics.ML;
wenzelm
parents:
21335
diff
changeset
|
384 |
(* fold -- old versions *) |
16691
539b9cc282fa
added combinatros '||>' and '||>>' and fold_map fitting nicely to ST combinator '|->'
haftmann
parents:
16688
diff
changeset
|
385 |
|
233 | 386 |
(*the following versions of fold are designed to fit nicely with infixes*) |
0 | 387 |
|
233 | 388 |
(* (op @) (e, [x1, ..., xn]) ===> ((e @ x1) @ x2) ... @ xn |
389 |
for operators that associate to the left (TAIL RECURSIVE)*) |
|
390 |
fun foldl (f: 'a * 'b -> 'a) : 'a * 'b list -> 'a = |
|
391 |
let fun itl (e, []) = e |
|
392 |
| itl (e, a::l) = itl (f(e, a), l) |
|
393 |
in itl end; |
|
394 |
||
395 |
(* (op @) ([x1, ..., xn], e) ===> x1 @ (x2 ... @ (xn @ e)) |
|
396 |
for operators that associate to the right (not tail recursive)*) |
|
397 |
fun foldr f (l, e) = |
|
398 |
let fun itr [] = e |
|
399 |
| itr (a::l) = f(a, itr l) |
|
400 |
in itr l end; |
|
401 |
||
402 |
(* (op @) [x1, ..., xn] ===> x1 @ (x2 ... @ (x[n-1] @ xn)) |
|
403 |
for n > 0, operators that associate to the right (not tail recursive)*) |
|
20443 | 404 |
fun foldr1 f [] = raise Empty |
20510 | 405 |
| foldr1 f l = |
20443 | 406 |
let fun itr [x] = x |
20510 | 407 |
| itr (x::l) = f(x, itr l) |
20443 | 408 |
in itr l end; |
233 | 409 |
|
16705 | 410 |
fun foldl_map f = |
411 |
let |
|
412 |
fun fold_aux (x, []) = (x, []) |
|
413 |
| fold_aux (x, y :: ys) = |
|
414 |
let |
|
415 |
val (x', y') = f (x, y); |
|
416 |
val (x'', ys') = fold_aux (x', ys); |
|
417 |
in (x'', y' :: ys') end; |
|
418 |
in fold_aux end; |
|
419 |
||
233 | 420 |
|
421 |
(* basic list functions *) |
|
422 |
||
20510 | 423 |
fun eq_list eq (list1, list2) = |
20348 | 424 |
let |
20510 | 425 |
fun eq_lst (x :: xs, y :: ys) = eq (x, y) andalso eq_lst (xs, ys) |
426 |
| eq_lst _ = true; |
|
427 |
in length list1 = length list2 andalso eq_lst (list1, list2) end; |
|
20348 | 428 |
|
19483
55ee839198bd
renamed mapfilter to map_filter, made pervasive (again);
wenzelm
parents:
19474
diff
changeset
|
429 |
fun maps f [] = [] |
55ee839198bd
renamed mapfilter to map_filter, made pervasive (again);
wenzelm
parents:
19474
diff
changeset
|
430 |
| maps f (x :: xs) = f x @ maps f xs; |
55ee839198bd
renamed mapfilter to map_filter, made pervasive (again);
wenzelm
parents:
19474
diff
changeset
|
431 |
|
24593
1547ea587f5a
added some int constraints (ML_Parse.fix_ints not active here);
wenzelm
parents:
24148
diff
changeset
|
432 |
fun chop (0: int) xs = ([], xs) |
23220 | 433 |
| chop _ [] = ([], []) |
434 |
| chop n (x :: xs) = chop (n - 1) xs |>> cons x; |
|
19011 | 435 |
|
233 | 436 |
(*take the first n elements from a list*) |
24593
1547ea587f5a
added some int constraints (ML_Parse.fix_ints not active here);
wenzelm
parents:
24148
diff
changeset
|
437 |
fun take (n: int, []) = [] |
233 | 438 |
| take (n, x :: xs) = |
439 |
if n > 0 then x :: take (n - 1, xs) else []; |
|
440 |
||
441 |
(*drop the first n elements from a list*) |
|
24593
1547ea587f5a
added some int constraints (ML_Parse.fix_ints not active here);
wenzelm
parents:
24148
diff
changeset
|
442 |
fun drop (n: int, []) = [] |
233 | 443 |
| drop (n, x :: xs) = |
444 |
if n > 0 then drop (n - 1, xs) else x :: xs; |
|
0 | 445 |
|
4713 | 446 |
fun dropwhile P [] = [] |
447 |
| dropwhile P (ys as x::xs) = if P x then dropwhile P xs else ys; |
|
448 |
||
233 | 449 |
(*return nth element of a list, where 0 designates the first element; |
18461 | 450 |
raise Subscript if list too short*) |
18011
685d95c793ff
cleaned up nth, nth_update, nth_map and nth_string functions
haftmann
parents:
17952
diff
changeset
|
451 |
fun nth xs i = List.nth (xs, i); |
233 | 452 |
|
18461 | 453 |
fun nth_list xss i = nth xss i handle Subscript => []; |
454 |
||
18011
685d95c793ff
cleaned up nth, nth_update, nth_map and nth_string functions
haftmann
parents:
17952
diff
changeset
|
455 |
fun nth_map 0 f (x :: xs) = f x :: xs |
685d95c793ff
cleaned up nth, nth_update, nth_map and nth_string functions
haftmann
parents:
17952
diff
changeset
|
456 |
| nth_map n f (x :: xs) = x :: nth_map (n - 1) f xs |
24593
1547ea587f5a
added some int constraints (ML_Parse.fix_ints not active here);
wenzelm
parents:
24148
diff
changeset
|
457 |
| nth_map (_: int) _ [] = raise Subscript; |
11773 | 458 |
|
24846 | 459 |
fun nth_drop n xs = |
460 |
List.take (xs, n) @ List.drop (xs, n + 1); |
|
461 |
||
18514 | 462 |
fun map_index f = |
463 |
let |
|
24593
1547ea587f5a
added some int constraints (ML_Parse.fix_ints not active here);
wenzelm
parents:
24148
diff
changeset
|
464 |
fun mapp (_: int) [] = [] |
1547ea587f5a
added some int constraints (ML_Parse.fix_ints not active here);
wenzelm
parents:
24148
diff
changeset
|
465 |
| mapp i (x :: xs) = f (i, x) :: mapp (i + 1) xs |
18514 | 466 |
in mapp 0 end; |
467 |
||
21118 | 468 |
fun fold_index f = |
469 |
let |
|
24593
1547ea587f5a
added some int constraints (ML_Parse.fix_ints not active here);
wenzelm
parents:
24148
diff
changeset
|
470 |
fun fold_aux (_: int) [] y = y |
1547ea587f5a
added some int constraints (ML_Parse.fix_ints not active here);
wenzelm
parents:
24148
diff
changeset
|
471 |
| fold_aux i (x :: xs) y = fold_aux (i + 1) xs (f (i, x) y); |
21118 | 472 |
in fold_aux 0 end; |
473 |
||
15570 | 474 |
val last_elem = List.last; |
233 | 475 |
|
3762 | 476 |
(*rear decomposition*) |
15570 | 477 |
fun split_last [] = raise Empty |
3762 | 478 |
| split_last [x] = ([], x) |
479 |
| split_last (x :: xs) = apfst (cons x) (split_last xs); |
|
480 |
||
4212 | 481 |
(*find the position of an element in a list*) |
482 |
fun find_index pred = |
|
24593
1547ea587f5a
added some int constraints (ML_Parse.fix_ints not active here);
wenzelm
parents:
24148
diff
changeset
|
483 |
let fun find (_: int) [] = ~1 |
4212 | 484 |
| find n (x :: xs) = if pred x then n else find (n + 1) xs; |
485 |
in find 0 end; |
|
3762 | 486 |
|
4224 | 487 |
fun find_index_eq x = find_index (equal x); |
4212 | 488 |
|
489 |
(*find first element satisfying predicate*) |
|
22593 | 490 |
val find_first = List.find; |
233 | 491 |
|
4916
fe8b0c82691b
get_first: ('a -> 'b option) -> 'a list -> 'b option;
wenzelm
parents:
4893
diff
changeset
|
492 |
(*get first element by lookup function*) |
15531 | 493 |
fun get_first _ [] = NONE |
4916
fe8b0c82691b
get_first: ('a -> 'b option) -> 'a list -> 'b option;
wenzelm
parents:
4893
diff
changeset
|
494 |
| get_first f (x :: xs) = |
fe8b0c82691b
get_first: ('a -> 'b option) -> 'a list -> 'b option;
wenzelm
parents:
4893
diff
changeset
|
495 |
(case f x of |
15531 | 496 |
NONE => get_first f xs |
4916
fe8b0c82691b
get_first: ('a -> 'b option) -> 'a list -> 'b option;
wenzelm
parents:
4893
diff
changeset
|
497 |
| some => some); |
fe8b0c82691b
get_first: ('a -> 'b option) -> 'a list -> 'b option;
wenzelm
parents:
4893
diff
changeset
|
498 |
|
19233
77ca20b0ed77
renamed HOL + - * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19119
diff
changeset
|
499 |
fun get_index f = |
77ca20b0ed77
renamed HOL + - * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19119
diff
changeset
|
500 |
let |
24593
1547ea587f5a
added some int constraints (ML_Parse.fix_ints not active here);
wenzelm
parents:
24148
diff
changeset
|
501 |
fun get (_: int) [] = NONE |
19461 | 502 |
| get i (x :: xs) = |
19233
77ca20b0ed77
renamed HOL + - * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19119
diff
changeset
|
503 |
case f x |
19461 | 504 |
of NONE => get (i + 1) xs |
19233
77ca20b0ed77
renamed HOL + - * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19119
diff
changeset
|
505 |
| SOME y => SOME (i, y) |
77ca20b0ed77
renamed HOL + - * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19119
diff
changeset
|
506 |
in get 0 end; |
77ca20b0ed77
renamed HOL + - * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19119
diff
changeset
|
507 |
|
15531 | 508 |
val flat = List.concat; |
233 | 509 |
|
12136 | 510 |
fun unflat (xs :: xss) ys = |
19424 | 511 |
let val (ps, qs) = chop (length xs) ys |
13629 | 512 |
in ps :: unflat xss qs end |
12136 | 513 |
| unflat [] [] = [] |
15570 | 514 |
| unflat _ _ = raise UnequalLengths; |
12136 | 515 |
|
21479
63e7eb863ae6
moved string_of_pair/list/option to structure ML_Syntax;
wenzelm
parents:
21395
diff
changeset
|
516 |
fun burrow f xss = unflat xss (f (flat xss)); |
18359 | 517 |
|
24864 | 518 |
fun burrow_options f os = map (try hd) (burrow f (map the_list os)); |
519 |
||
18549
5308a6ea3b96
rearranged burrow_split to fold_burrow to allow composition with fold_map
haftmann
parents:
18514
diff
changeset
|
520 |
fun fold_burrow f xss s = |
5308a6ea3b96
rearranged burrow_split to fold_burrow to allow composition with fold_map
haftmann
parents:
18514
diff
changeset
|
521 |
apfst (unflat xss) (f (flat xss) s); |
18359 | 522 |
|
233 | 523 |
(*separate s [x1, x2, ..., xn] ===> [x1, s, x2, s, ..., s, xn]*) |
524 |
fun separate s (x :: (xs as _ :: _)) = x :: s :: separate s xs |
|
525 |
| separate _ xs = xs; |
|
526 |
||
527 |
(*make the list [x, x, ..., x] of length n*) |
|
24593
1547ea587f5a
added some int constraints (ML_Parse.fix_ints not active here);
wenzelm
parents:
24148
diff
changeset
|
528 |
fun replicate (n: int) x = |
233 | 529 |
let fun rep (0, xs) = xs |
530 |
| rep (n, xs) = rep (n - 1, x :: xs) |
|
531 |
in |
|
15570 | 532 |
if n < 0 then raise Subscript |
233 | 533 |
else rep (n, []) |
534 |
end; |
|
535 |
||
14926 | 536 |
fun translate_string f = String.translate (f o String.str); |
537 |
||
4248
5e8a31c41d44
added get_error: 'a error -> string option, get_ok: 'a error -> 'a option;
wenzelm
parents:
4224
diff
changeset
|
538 |
(*multiply [a, b, c, ...] * [xs, ys, zs, ...]*) |
18148 | 539 |
fun multiply [] _ = [] |
540 |
| multiply (x :: xs) yss = map (cons x) yss @ multiply xs yss; |
|
4248
5e8a31c41d44
added get_error: 'a error -> string option, get_ok: 'a error -> 'a option;
wenzelm
parents:
4224
diff
changeset
|
541 |
|
14792 | 542 |
(*direct product*) |
543 |
fun product _ [] = [] |
|
544 |
| product [] _ = [] |
|
545 |
| product (x :: xs) ys = map (pair x) ys @ product xs ys; |
|
546 |
||
233 | 547 |
|
548 |
(* filter *) |
|
549 |
||
550 |
(*copy the list preserving elements that satisfy the predicate*) |
|
15531 | 551 |
val filter = List.filter; |
0 | 552 |
fun filter_out f = filter (not o f); |
19483
55ee839198bd
renamed mapfilter to map_filter, made pervasive (again);
wenzelm
parents:
19474
diff
changeset
|
553 |
val map_filter = List.mapPartial; |
233 | 554 |
|
555 |
||
556 |
(* lists of pairs *) |
|
557 |
||
15570 | 558 |
exception UnequalLengths; |
559 |
||
18330 | 560 |
fun map2 _ [] [] = [] |
561 |
| map2 f (x :: xs) (y :: ys) = f x y :: map2 f xs ys |
|
562 |
| map2 _ _ _ = raise UnequalLengths; |
|
380 | 563 |
|
23220 | 564 |
fun fold2 f [] [] z = z |
565 |
| fold2 f (x :: xs) (y :: ys) z = fold2 f xs ys (f x y z) |
|
566 |
| fold2 f _ _ _ = raise UnequalLengths; |
|
380 | 567 |
|
19799 | 568 |
fun zip_options (x :: xs) (SOME y :: ys) = (x, y) :: zip_options xs ys |
569 |
| zip_options (_ :: xs) (NONE :: ys) = zip_options xs ys |
|
570 |
| zip_options _ [] = [] |
|
571 |
| zip_options [] _ = raise UnequalLengths; |
|
4956
a7538e43896e
added foldl_map: ('a * 'b -> 'a * 'c) -> 'a * 'b list -> 'a * 'c list;
wenzelm
parents:
4945
diff
changeset
|
572 |
|
233 | 573 |
(*combine two lists forming a list of pairs: |
574 |
[x1, ..., xn] ~~ [y1, ..., yn] ===> [(x1, y1), ..., (xn, yn)]*) |
|
575 |
fun [] ~~ [] = [] |
|
576 |
| (x :: xs) ~~ (y :: ys) = (x, y) :: (xs ~~ ys) |
|
15570 | 577 |
| _ ~~ _ = raise UnequalLengths; |
233 | 578 |
|
579 |
(*inverse of ~~; the old 'split': |
|
580 |
[(x1, y1), ..., (xn, yn)] ===> ([x1, ..., xn], [y1, ..., yn])*) |
|
15570 | 581 |
val split_list = ListPair.unzip; |
233 | 582 |
|
583 |
||
584 |
(* prefixes, suffixes *) |
|
585 |
||
18441 | 586 |
fun is_prefix _ [] _ = true |
587 |
| is_prefix eq (x :: xs) (y :: ys) = eq (x, y) andalso is_prefix eq xs ys |
|
588 |
| is_prefix eq _ _ = false; |
|
233 | 589 |
|
590 |
(* [x1, ..., xi, ..., xn] ---> ([x1, ..., x(i-1)], [xi, ..., xn]) |
|
591 |
where xi is the first element that does not satisfy the predicate*) |
|
592 |
fun take_prefix (pred : 'a -> bool) (xs: 'a list) : 'a list * 'a list = |
|
593 |
let fun take (rxs, []) = (rev rxs, []) |
|
255
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset
|
594 |
| take (rxs, x :: xs) = |
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset
|
595 |
if pred x then take(x :: rxs, xs) else (rev rxs, x :: xs) |
233 | 596 |
in take([], xs) end; |
597 |
||
20108 | 598 |
fun chop_prefix eq ([], ys) = ([], ([], ys)) |
599 |
| chop_prefix eq (xs, []) = ([], (xs, [])) |
|
23220 | 600 |
| chop_prefix eq (xs as x :: xs', ys as y :: ys') = |
20108 | 601 |
if eq (x, y) then |
602 |
let val (ps', xys'') = chop_prefix eq (xs', ys') |
|
23220 | 603 |
in (x :: ps', xys'') end |
20108 | 604 |
else ([], (xs, ys)); |
605 |
||
233 | 606 |
(* [x1, ..., xi, ..., xn] ---> ([x1, ..., xi], [x(i+1), ..., xn]) |
607 |
where xi is the last element that does not satisfy the predicate*) |
|
608 |
fun take_suffix _ [] = ([], []) |
|
609 |
| take_suffix pred (x :: xs) = |
|
610 |
(case take_suffix pred xs of |
|
611 |
([], sffx) => if pred x then ([], x :: sffx) else ([x], sffx) |
|
612 |
| (prfx, sffx) => (x :: prfx, sffx)); |
|
613 |
||
12249 | 614 |
fun prefixes1 [] = [] |
615 |
| prefixes1 (x :: xs) = map (cons x) ([] :: prefixes1 xs); |
|
616 |
||
19011 | 617 |
fun prefixes xs = [] :: prefixes1 xs; |
618 |
||
12249 | 619 |
fun suffixes1 xs = map rev (prefixes1 (rev xs)); |
19011 | 620 |
fun suffixes xs = [] :: suffixes1 xs; |
233 | 621 |
|
23220 | 622 |
|
623 |
||
233 | 624 |
(** integers **) |
625 |
||
24593
1547ea587f5a
added some int constraints (ML_Parse.fix_ints not active here);
wenzelm
parents:
24148
diff
changeset
|
626 |
fun inc i = (i := ! i + (1: int); ! i); |
1547ea587f5a
added some int constraints (ML_Parse.fix_ints not active here);
wenzelm
parents:
24148
diff
changeset
|
627 |
fun dec i = (i := ! i - (1: int); ! i); |
233 | 628 |
|
629 |
||
630 |
(* lists of integers *) |
|
631 |
||
632 |
(*make the list [from, from + 1, ..., to]*) |
|
24593
1547ea587f5a
added some int constraints (ML_Parse.fix_ints not active here);
wenzelm
parents:
24148
diff
changeset
|
633 |
fun ((i: int) upto j) = |
21859 | 634 |
if i > j then [] else i :: (i + 1 upto j); |
233 | 635 |
|
636 |
(*make the list [from, from - 1, ..., to]*) |
|
24593
1547ea587f5a
added some int constraints (ML_Parse.fix_ints not active here);
wenzelm
parents:
24148
diff
changeset
|
637 |
fun ((i: int) downto j) = |
21859 | 638 |
if i < j then [] else i :: (i - 1 downto j); |
233 | 639 |
|
640 |
||
641 |
(* convert integers to strings *) |
|
642 |
||
643 |
(*expand the number in the given base; |
|
644 |
example: radixpand (2, 8) gives [1, 0, 0, 0]*) |
|
645 |
fun radixpand (base, num) : int list = |
|
646 |
let |
|
647 |
fun radix (n, tail) = |
|
648 |
if n < base then n :: tail |
|
649 |
else radix (n div base, (n mod base) :: tail) |
|
650 |
in radix (num, []) end; |
|
651 |
||
652 |
(*expands a number into a string of characters starting from "zerochar"; |
|
653 |
example: radixstring (2, "0", 8) gives "1000"*) |
|
654 |
fun radixstring (base, zerochar, num) = |
|
655 |
let val offset = ord zerochar; |
|
656 |
fun chrof n = chr (offset + n) |
|
657 |
in implode (map chrof (radixpand (base, num))) end; |
|
658 |
||
659 |
||
3407
afd288caf573
Removal of radixstring from string_of_int; addition of string_of_indexname
paulson
parents:
3393
diff
changeset
|
660 |
val string_of_int = Int.toString; |
233 | 661 |
|
21942
d6218d0f9ec3
added signed_string_of_int (pruduces proper - instead of SML's ~);
wenzelm
parents:
21920
diff
changeset
|
662 |
fun signed_string_of_int i = |
d6218d0f9ec3
added signed_string_of_int (pruduces proper - instead of SML's ~);
wenzelm
parents:
21920
diff
changeset
|
663 |
if i < 0 then "-" ^ string_of_int (~ i) else string_of_int i; |
d6218d0f9ec3
added signed_string_of_int (pruduces proper - instead of SML's ~);
wenzelm
parents:
21920
diff
changeset
|
664 |
|
23220 | 665 |
fun string_of_indexname (a, 0) = a |
666 |
| string_of_indexname (a, i) = a ^ "_" ^ string_of_int i; |
|
233 | 667 |
|
668 |
||
14826
48cfe0fe53e2
output channels and diagnostics moved to General/output.ML; added read_int etc. from term.ML; removed obsolete mtree; type rat uses exception RAT;
wenzelm
parents:
14797
diff
changeset
|
669 |
(* read integers *) |
48cfe0fe53e2
output channels and diagnostics moved to General/output.ML; added read_int etc. from term.ML; removed obsolete mtree; type rat uses exception RAT;
wenzelm
parents:
14797
diff
changeset
|
670 |
|
24630
351a308ab58d
simplified type int (eliminated IntInf.int, integer);
wenzelm
parents:
24593
diff
changeset
|
671 |
fun read_radix_int radix cs = |
20095 | 672 |
let |
673 |
val zero = ord "0"; |
|
674 |
val limit = zero + radix; |
|
675 |
fun scan (num, []) = (num, []) |
|
676 |
| scan (num, c :: cs) = |
|
677 |
if zero <= ord c andalso ord c < limit then |
|
24630
351a308ab58d
simplified type int (eliminated IntInf.int, integer);
wenzelm
parents:
24593
diff
changeset
|
678 |
scan (radix * num + (ord c - zero), cs) |
20095 | 679 |
else (num, c :: cs); |
24630
351a308ab58d
simplified type int (eliminated IntInf.int, integer);
wenzelm
parents:
24593
diff
changeset
|
680 |
in scan (0, cs) end; |
14826
48cfe0fe53e2
output channels and diagnostics moved to General/output.ML; added read_int etc. from term.ML; removed obsolete mtree; type rat uses exception RAT;
wenzelm
parents:
14797
diff
changeset
|
681 |
|
24630
351a308ab58d
simplified type int (eliminated IntInf.int, integer);
wenzelm
parents:
24593
diff
changeset
|
682 |
val read_int = read_radix_int 10; |
14826
48cfe0fe53e2
output channels and diagnostics moved to General/output.ML; added read_int etc. from term.ML; removed obsolete mtree; type rat uses exception RAT;
wenzelm
parents:
14797
diff
changeset
|
683 |
|
24630
351a308ab58d
simplified type int (eliminated IntInf.int, integer);
wenzelm
parents:
24593
diff
changeset
|
684 |
fun oct_char s = chr (#1 (read_radix_int 8 (explode s))); |
14826
48cfe0fe53e2
output channels and diagnostics moved to General/output.ML; added read_int etc. from term.ML; removed obsolete mtree; type rat uses exception RAT;
wenzelm
parents:
14797
diff
changeset
|
685 |
|
48cfe0fe53e2
output channels and diagnostics moved to General/output.ML; added read_int etc. from term.ML; removed obsolete mtree; type rat uses exception RAT;
wenzelm
parents:
14797
diff
changeset
|
686 |
|
48cfe0fe53e2
output channels and diagnostics moved to General/output.ML; added read_int etc. from term.ML; removed obsolete mtree; type rat uses exception RAT;
wenzelm
parents:
14797
diff
changeset
|
687 |
|
233 | 688 |
(** strings **) |
689 |
||
16188 | 690 |
(* functions tuned for strings, avoiding explode *) |
6312 | 691 |
|
18011
685d95c793ff
cleaned up nth, nth_update, nth_map and nth_string functions
haftmann
parents:
17952
diff
changeset
|
692 |
fun nth_string str i = |
6959 | 693 |
(case try String.substring (str, i, 1) of |
15531 | 694 |
SOME s => s |
15570 | 695 |
| NONE => raise Subscript); |
6312 | 696 |
|
16188 | 697 |
fun fold_string f str x0 = |
6282 | 698 |
let |
699 |
val n = size str; |
|
16188 | 700 |
fun iter (x, i) = |
701 |
if i < n then iter (f (String.substring (str, i, 1)) x, i + 1) else x; |
|
702 |
in iter (x0, 0) end; |
|
6282 | 703 |
|
14968 | 704 |
fun exists_string pred str = |
705 |
let |
|
706 |
val n = size str; |
|
707 |
fun ex i = i < n andalso (pred (String.substring (str, i, 1)) orelse ex (i + 1)); |
|
708 |
in ex 0 end; |
|
6312 | 709 |
|
16188 | 710 |
fun forall_string pred = not o exists_string (not o pred); |
711 |
||
512
55755ed9fab9
Pure/library/enclose, Pure/Syntax/pretty/enclose: renamed from parents
lcp
parents:
410
diff
changeset
|
712 |
(*enclose in brackets*) |
55755ed9fab9
Pure/library/enclose, Pure/Syntax/pretty/enclose: renamed from parents
lcp
parents:
410
diff
changeset
|
713 |
fun enclose lpar rpar str = lpar ^ str ^ rpar; |
6642 | 714 |
fun unenclose str = String.substring (str, 1, size str - 2); |
255
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset
|
715 |
|
233 | 716 |
(*simple quoting (does not escape special chars)*) |
512
55755ed9fab9
Pure/library/enclose, Pure/Syntax/pretty/enclose: renamed from parents
lcp
parents:
410
diff
changeset
|
717 |
val quote = enclose "\"" "\""; |
233 | 718 |
|
4212 | 719 |
(*space_implode "..." (explode "hello") = "h...e...l...l...o"*) |
233 | 720 |
fun space_implode a bs = implode (separate a bs); |
721 |
||
255
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset
|
722 |
val commas = space_implode ", "; |
380 | 723 |
val commas_quote = commas o map quote; |
255
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset
|
724 |
|
233 | 725 |
(*concatenate messages, one per line, into a string*) |
255
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset
|
726 |
val cat_lines = space_implode "\n"; |
233 | 727 |
|
4212 | 728 |
(*space_explode "." "h.e..l.lo" = ["h", "e", "", "l", "lo"]*) |
3832
17a20a2af8f5
fixed space_explode, old one retained as BAD_space_explode;
wenzelm
parents:
3762
diff
changeset
|
729 |
fun space_explode _ "" = [] |
21899 | 730 |
| space_explode sep s = String.fields (fn c => str c = sep) s; |
3832
17a20a2af8f5
fixed space_explode, old one retained as BAD_space_explode;
wenzelm
parents:
3762
diff
changeset
|
731 |
|
17a20a2af8f5
fixed space_explode, old one retained as BAD_space_explode;
wenzelm
parents:
3762
diff
changeset
|
732 |
val split_lines = space_explode "\n"; |
17a20a2af8f5
fixed space_explode, old one retained as BAD_space_explode;
wenzelm
parents:
3762
diff
changeset
|
733 |
|
14826
48cfe0fe53e2
output channels and diagnostics moved to General/output.ML; added read_int etc. from term.ML; removed obsolete mtree; type rat uses exception RAT;
wenzelm
parents:
14797
diff
changeset
|
734 |
fun prefix_lines "" txt = txt |
48cfe0fe53e2
output channels and diagnostics moved to General/output.ML; added read_int etc. from term.ML; removed obsolete mtree; type rat uses exception RAT;
wenzelm
parents:
14797
diff
changeset
|
735 |
| prefix_lines prfx txt = txt |> split_lines |> map (fn s => prfx ^ s) |> cat_lines; |
48cfe0fe53e2
output channels and diagnostics moved to General/output.ML; added read_int etc. from term.ML; removed obsolete mtree; type rat uses exception RAT;
wenzelm
parents:
14797
diff
changeset
|
736 |
|
7712 | 737 |
fun untabify chs = |
738 |
let |
|
739 |
val tab_width = 8; |
|
740 |
||
22582
f315da9400fb
removed obsolete scanwords (see obsolete tactic.ML:rename_tac for its only use);
wenzelm
parents:
22567
diff
changeset
|
741 |
fun untab pos [] ys = rev ys |
22256 | 742 |
| untab pos ("\n" :: xs) ys = untab 0 xs ("\n" :: ys) |
743 |
| untab pos ("\t" :: xs) ys = |
|
22582
f315da9400fb
removed obsolete scanwords (see obsolete tactic.ML:rename_tac for its only use);
wenzelm
parents:
22567
diff
changeset
|
744 |
let val d = tab_width - (pos mod tab_width) |
23718 | 745 |
in untab (pos + d) xs (funpow d (cons " ") ys) end |
22256 | 746 |
| untab pos (c :: xs) ys = untab (pos + 1) xs (c :: ys); |
7712 | 747 |
in |
19301 | 748 |
if not (exists (fn c => c = "\t") chs) then chs |
22256 | 749 |
else untab 0 chs [] |
7712 | 750 |
end; |
751 |
||
18681
3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset
|
752 |
fun prefix prfx s = prfx ^ s; |
16188 | 753 |
fun suffix sffx s = s ^ sffx; |
5285 | 754 |
|
18681
3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset
|
755 |
fun unprefix prfx s = |
3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset
|
756 |
if String.isPrefix prfx s then String.substring (s, size prfx, size s - size prfx) |
3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset
|
757 |
else raise Fail "unprefix"; |
3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset
|
758 |
|
16188 | 759 |
fun unsuffix sffx s = |
17061 | 760 |
if String.isSuffix sffx s then String.substring (s, 0, size s - size sffx) |
761 |
else raise Fail "unsuffix"; |
|
5285 | 762 |
|
24593
1547ea587f5a
added some int constraints (ML_Parse.fix_ints not active here);
wenzelm
parents:
24148
diff
changeset
|
763 |
fun replicate_string (0: int) _ = "" |
10951 | 764 |
| replicate_string 1 a = a |
765 |
| replicate_string k a = |
|
766 |
if k mod 2 = 0 then replicate_string (k div 2) (a ^ a) |
|
767 |
else replicate_string (k div 2) (a ^ a) ^ a; |
|
768 |
||
233 | 769 |
|
23220 | 770 |
|
16492 | 771 |
(** lists as sets -- see also Pure/General/ord_list.ML **) |
233 | 772 |
|
18923 | 773 |
(*canonical member, insert, remove*) |
774 |
fun member eq list x = |
|
775 |
let |
|
776 |
fun memb [] = false |
|
777 |
| memb (y :: ys) = eq (x, y) orelse memb ys; |
|
778 |
in memb list end; |
|
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
779 |
|
18923 | 780 |
fun insert eq x xs = if member eq xs x then xs else x :: xs; |
781 |
fun remove eq x xs = if member eq xs x then filter_out (fn y => eq (x, y)) xs else xs; |
|
24049 | 782 |
fun update eq x xs = cons x (remove eq x xs); |
233 | 783 |
|
19301 | 784 |
fun subtract eq = fold (remove eq); |
785 |
||
18923 | 786 |
fun merge _ ([], ys) = ys |
787 |
| merge eq (xs, ys) = fold_rev (insert eq) ys xs; |
|
0 | 788 |
|
18923 | 789 |
(*old-style infixes*) |
790 |
fun x mem xs = member (op =) xs x; |
|
791 |
fun (x: int) mem_int xs = member (op =) xs x; |
|
792 |
fun (x: string) mem_string xs = member (op =) xs x; |
|
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
793 |
|
233 | 794 |
|
795 |
(*union of sets represented as lists: no repetitions*) |
|
796 |
fun xs union [] = xs |
|
797 |
| [] union ys = ys |
|
20854 | 798 |
| (x :: xs) union ys = xs union (insert (op =) x ys); |
0 | 799 |
|
2175
21fde76bc742
Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents:
2157
diff
changeset
|
800 |
(*union of sets, optimized version for ints*) |
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
801 |
fun (xs:int list) union_int [] = xs |
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
802 |
| [] union_int ys = ys |
20854 | 803 |
| (x :: xs) union_int ys = xs union_int (insert (op =) x ys); |
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
804 |
|
2175
21fde76bc742
Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents:
2157
diff
changeset
|
805 |
(*union of sets, optimized version for strings*) |
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
806 |
fun (xs:string list) union_string [] = xs |
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
807 |
| [] union_string ys = ys |
20854 | 808 |
| (x :: xs) union_string ys = xs union_string (insert (op =) x ys); |
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
809 |
|
0 | 810 |
(*generalized union*) |
233 | 811 |
fun gen_union eq (xs, []) = xs |
812 |
| gen_union eq ([], ys) = ys |
|
18923 | 813 |
| gen_union eq (x :: xs, ys) = gen_union eq (xs, insert eq x ys); |
233 | 814 |
|
815 |
||
816 |
(*intersection*) |
|
817 |
fun [] inter ys = [] |
|
818 |
| (x :: xs) inter ys = |
|
819 |
if x mem ys then x :: (xs inter ys) else xs inter ys; |
|
820 |
||
2175
21fde76bc742
Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents:
2157
diff
changeset
|
821 |
(*intersection, optimized version for ints*) |
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
822 |
fun ([]:int list) inter_int ys = [] |
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
823 |
| (x :: xs) inter_int ys = |
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
824 |
if x mem_int ys then x :: (xs inter_int ys) else xs inter_int ys; |
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
825 |
|
2175
21fde76bc742
Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents:
2157
diff
changeset
|
826 |
(*intersection, optimized version for strings *) |
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
827 |
fun ([]:string list) inter_string ys = [] |
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
828 |
| (x :: xs) inter_string ys = |
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
829 |
if x mem_string ys then x :: (xs inter_string ys) else xs inter_string ys; |
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
830 |
|
7090 | 831 |
(*generalized intersection*) |
832 |
fun gen_inter eq ([], ys) = [] |
|
12284 | 833 |
| gen_inter eq (x::xs, ys) = |
18923 | 834 |
if member eq ys x then x :: gen_inter eq (xs, ys) |
835 |
else gen_inter eq (xs, ys); |
|
7090 | 836 |
|
233 | 837 |
|
838 |
(*subset*) |
|
839 |
fun [] subset ys = true |
|
840 |
| (x :: xs) subset ys = x mem ys andalso xs subset ys; |
|
841 |
||
2175
21fde76bc742
Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents:
2157
diff
changeset
|
842 |
(*subset, optimized version for ints*) |
16439 | 843 |
fun ([]: int list) subset_int ys = true |
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
844 |
| (x :: xs) subset_int ys = x mem_int ys andalso xs subset_int ys; |
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
845 |
|
2175
21fde76bc742
Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents:
2157
diff
changeset
|
846 |
(*subset, optimized version for strings*) |
16439 | 847 |
fun ([]: string list) subset_string ys = true |
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
848 |
| (x :: xs) subset_string ys = x mem_string ys andalso xs subset_string ys; |
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
849 |
|
4363 | 850 |
(*set equality*) |
851 |
fun eq_set (xs, ys) = |
|
852 |
xs = ys orelse (xs subset ys andalso ys subset xs); |
|
853 |
||
2182
29e56f003599
Removal of polymorphic equality via mem, subset, eq_set, etc
paulson
parents:
2175
diff
changeset
|
854 |
(*set equality for strings*) |
16439 | 855 |
fun eq_set_string ((xs: string list), ys) = |
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
856 |
xs = ys orelse (xs subset_string ys andalso ys subset_string xs); |
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
857 |
|
18923 | 858 |
fun gen_subset eq (xs, ys) = forall (member eq ys) xs; |
2182
29e56f003599
Removal of polymorphic equality via mem, subset, eq_set, etc
paulson
parents:
2175
diff
changeset
|
859 |
|
19301 | 860 |
fun gen_eq_set eq (xs, ys) = |
20348 | 861 |
eq_list eq (xs, ys) orelse |
19301 | 862 |
(gen_subset eq (xs, ys) andalso gen_subset (eq o swap) (ys, xs)); |
863 |
||
265 | 864 |
|
233 | 865 |
(*removing an element from a list WITHOUT duplicates*) |
866 |
fun (y :: ys) \ x = if x = y then ys else y :: (ys \ x) |
|
867 |
| [] \ x = []; |
|
2243
3ebeaaacfbd1
Eta-expanded some declarations that are illegal under value polymorphism
paulson
parents:
2196
diff
changeset
|
868 |
fun ys \\ xs = foldl (op \) (ys,xs); |
0 | 869 |
|
233 | 870 |
|
871 |
(*makes a list of the distinct members of the input; preserves order, takes |
|
872 |
first of equal elements*) |
|
19046
bc5c6c9b114e
removed distinct, renamed gen_distinct to distinct;
wenzelm
parents:
19011
diff
changeset
|
873 |
fun distinct eq lst = |
233 | 874 |
let |
875 |
fun dist (rev_seen, []) = rev rev_seen |
|
876 |
| dist (rev_seen, x :: xs) = |
|
18923 | 877 |
if member eq rev_seen x then dist (rev_seen, xs) |
233 | 878 |
else dist (x :: rev_seen, xs); |
19046
bc5c6c9b114e
removed distinct, renamed gen_distinct to distinct;
wenzelm
parents:
19011
diff
changeset
|
879 |
in dist ([], lst) end; |
233 | 880 |
|
255
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset
|
881 |
(*returns a list containing all repeated elements exactly once; preserves |
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset
|
882 |
order, takes first of equal elements*) |
18966 | 883 |
fun duplicates eq lst = |
255
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset
|
884 |
let |
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset
|
885 |
fun dups (rev_dups, []) = rev rev_dups |
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset
|
886 |
| dups (rev_dups, x :: xs) = |
18923 | 887 |
if member eq rev_dups x orelse not (member eq xs x) then |
255
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset
|
888 |
dups (rev_dups, xs) |
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset
|
889 |
else dups (x :: rev_dups, xs); |
18966 | 890 |
in dups ([], lst) end; |
255
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset
|
891 |
|
16878 | 892 |
fun has_duplicates eq = |
893 |
let |
|
894 |
fun dups [] = false |
|
895 |
| dups (x :: xs) = member eq xs x orelse dups xs; |
|
896 |
in dups end; |
|
897 |
||
255
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset
|
898 |
|
23220 | 899 |
|
22142 | 900 |
(** lists as multisets **) |
901 |
||
902 |
fun remove1 _ _ [] = raise Empty |
|
23220 | 903 |
| remove1 eq y (x::xs) = if eq (y, x) then xs else x :: remove1 eq y xs; |
22142 | 904 |
|
23220 | 905 |
fun submultiset _ ([], _) = true |
906 |
| submultiset eq (x :: xs, ys) = member eq ys x andalso submultiset eq (xs, remove1 eq x ys); |
|
233 | 907 |
|
0 | 908 |
|
909 |
||
2506 | 910 |
(** orders **) |
911 |
||
18966 | 912 |
fun is_equal EQUAL = true |
913 |
| is_equal _ = false; |
|
914 |
||
4445 | 915 |
fun rev_order LESS = GREATER |
916 |
| rev_order EQUAL = EQUAL |
|
917 |
| rev_order GREATER = LESS; |
|
918 |
||
4479 | 919 |
(*assume rel is a linear strict order*) |
4445 | 920 |
fun make_ord rel (x, y) = |
921 |
if rel (x, y) then LESS |
|
922 |
else if rel (y, x) then GREATER |
|
923 |
else EQUAL; |
|
924 |
||
25224 | 925 |
fun bool_ord (false, true) = LESS |
926 |
| bool_ord (true, false) = GREATER |
|
927 |
| bool_ord _ = EQUAL; |
|
928 |
||
15051
0dbbab9f77fe
int_ord = Int.compare, string_ord = String.compare;
wenzelm
parents:
15035
diff
changeset
|
929 |
val int_ord = Int.compare; |
0dbbab9f77fe
int_ord = Int.compare, string_ord = String.compare;
wenzelm
parents:
15035
diff
changeset
|
930 |
val string_ord = String.compare; |
2506 | 931 |
|
16676 | 932 |
fun fast_string_ord (s1, s2) = |
933 |
(case int_ord (size s1, size s2) of EQUAL => string_ord (s1, s2) | ord => ord); |
|
934 |
||
16492 | 935 |
fun option_ord ord (SOME x, SOME y) = ord (x, y) |
936 |
| option_ord _ (NONE, NONE) = EQUAL |
|
937 |
| option_ord _ (NONE, SOME _) = LESS |
|
938 |
| option_ord _ (SOME _, NONE) = GREATER; |
|
939 |
||
4343 | 940 |
(*lexicographic product*) |
941 |
fun prod_ord a_ord b_ord ((x, y), (x', y')) = |
|
942 |
(case a_ord (x, x') of EQUAL => b_ord (y, y') | ord => ord); |
|
943 |
||
944 |
(*dictionary order -- in general NOT well-founded!*) |
|
16984 | 945 |
fun dict_ord elem_ord (x :: xs, y :: ys) = |
946 |
(case elem_ord (x, y) of EQUAL => dict_ord elem_ord (xs, ys) | ord => ord) |
|
947 |
| dict_ord _ ([], []) = EQUAL |
|
4343 | 948 |
| dict_ord _ ([], _ :: _) = LESS |
16984 | 949 |
| dict_ord _ (_ :: _, []) = GREATER; |
4343 | 950 |
|
951 |
(*lexicographic product of lists*) |
|
952 |
fun list_ord elem_ord (xs, ys) = |
|
16676 | 953 |
(case int_ord (length xs, length ys) of EQUAL => dict_ord elem_ord (xs, ys) | ord => ord); |
4343 | 954 |
|
2506 | 955 |
|
4621 | 956 |
(* sorting *) |
957 |
||
18427 | 958 |
(*quicksort -- stable, i.e. does not reorder equal elements*) |
959 |
fun quicksort unique ord = |
|
4621 | 960 |
let |
16878 | 961 |
fun qsort [] = [] |
962 |
| qsort (xs as [_]) = xs |
|
18427 | 963 |
| qsort (xs as [x, y]) = |
964 |
(case ord (x, y) of |
|
965 |
LESS => xs |
|
966 |
| EQUAL => if unique then [x] else xs |
|
967 |
| GREATER => [y, x]) |
|
16878 | 968 |
| qsort xs = |
18011
685d95c793ff
cleaned up nth, nth_update, nth_map and nth_string functions
haftmann
parents:
17952
diff
changeset
|
969 |
let val (lts, eqs, gts) = part (nth xs (length xs div 2)) xs |
16878 | 970 |
in qsort lts @ eqs @ qsort gts end |
4621 | 971 |
and part _ [] = ([], [], []) |
972 |
| part pivot (x :: xs) = add (ord (x, pivot)) x (part pivot xs) |
|
973 |
and add LESS x (lts, eqs, gts) = (x :: lts, eqs, gts) |
|
18427 | 974 |
| add EQUAL x (lts, [], gts) = (lts, [x], gts) |
975 |
| add EQUAL x (res as (lts, eqs, gts)) = if unique then res else (lts, x :: eqs, gts) |
|
4621 | 976 |
| add GREATER x (lts, eqs, gts) = (lts, eqs, x :: gts); |
977 |
in qsort end; |
|
978 |
||
18427 | 979 |
fun sort ord = quicksort false ord; |
980 |
fun sort_distinct ord = quicksort true ord; |
|
981 |
||
4621 | 982 |
val sort_strings = sort string_ord; |
983 |
fun sort_wrt sel xs = sort (string_ord o pairself sel) xs; |
|
984 |
||
985 |
||
2506 | 986 |
|
14106
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
987 |
(** random numbers **) |
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
988 |
|
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
989 |
exception RANDOM; |
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
990 |
|
14618
068bb99f3ebd
Fixed bug in rmod that caused an overflow exception in SML/NJ.
berghofe
parents:
14472
diff
changeset
|
991 |
fun rmod x y = x - y * Real.realFloor (x / y); |
14106
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
992 |
|
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
993 |
local |
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
994 |
val a = 16807.0; |
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
995 |
val m = 2147483647.0; |
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
996 |
val random_seed = ref 1.0; |
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
997 |
in |
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
998 |
|
23922
707639e9497d
marked some CRITICAL sections (for multithreading);
wenzelm
parents:
23860
diff
changeset
|
999 |
fun random () = CRITICAL (fn () => |
707639e9497d
marked some CRITICAL sections (for multithreading);
wenzelm
parents:
23860
diff
changeset
|
1000 |
let val r = rmod (a * ! random_seed) m |
707639e9497d
marked some CRITICAL sections (for multithreading);
wenzelm
parents:
23860
diff
changeset
|
1001 |
in (random_seed := r; r) end); |
14106
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
1002 |
|
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
1003 |
end; |
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
1004 |
|
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
1005 |
fun random_range l h = |
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
1006 |
if h < l orelse l < 0 then raise RANDOM |
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
1007 |
else l + Real.floor (rmod (random ()) (real (h - l + 1))); |
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
1008 |
|
18011
685d95c793ff
cleaned up nth, nth_update, nth_map and nth_string functions
haftmann
parents:
17952
diff
changeset
|
1009 |
fun one_of xs = nth xs (random_range 0 (length xs - 1)); |
14106
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
1010 |
|
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
1011 |
fun frequency xs = |
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
1012 |
let |
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
1013 |
val sum = foldl op + (0, map fst xs); |
17756 | 1014 |
fun pick n ((k: int, x) :: xs) = |
14106
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
1015 |
if n <= k then x else pick (n - k) xs |
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
1016 |
in pick (random_range 1 sum) xs end; |
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
1017 |
|
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
1018 |
|
23220 | 1019 |
|
4621 | 1020 |
(** misc **) |
233 | 1021 |
|
19644
0b01436e1843
added divide_and_conquer combinator (by Amine Chaieb);
wenzelm
parents:
19596
diff
changeset
|
1022 |
fun divide_and_conquer decomp x = |
0b01436e1843
added divide_and_conquer combinator (by Amine Chaieb);
wenzelm
parents:
19596
diff
changeset
|
1023 |
let val (ys, recomb) = decomp x |
0b01436e1843
added divide_and_conquer combinator (by Amine Chaieb);
wenzelm
parents:
19596
diff
changeset
|
1024 |
in recomb (map (divide_and_conquer decomp) ys) end; |
0b01436e1843
added divide_and_conquer combinator (by Amine Chaieb);
wenzelm
parents:
19596
diff
changeset
|
1025 |
|
0 | 1026 |
|
233 | 1027 |
(*Partition a list into buckets [ bi, b(i+1), ..., bj ] |
0 | 1028 |
putting x in bk if p(k)(x) holds. Preserve order of elements if possible.*) |
1029 |
fun partition_list p i j = |
|
233 | 1030 |
let fun part k xs = |
1031 |
if k>j then |
|
0 | 1032 |
(case xs of [] => [] |
15570 | 1033 |
| _ => raise Fail "partition_list") |
0 | 1034 |
else |
19691 | 1035 |
let val (ns, rest) = List.partition (p k) xs; |
233 | 1036 |
in ns :: part(k+1)rest end |
24593
1547ea587f5a
added some int constraints (ML_Parse.fix_ints not active here);
wenzelm
parents:
24148
diff
changeset
|
1037 |
in part (i: int) end; |
0 | 1038 |
|
19691 | 1039 |
fun partition_eq (eq:'a * 'a -> bool) = |
1040 |
let |
|
1041 |
fun part [] = [] |
|
1042 |
| part (x :: ys) = |
|
1043 |
let val (xs, xs') = List.partition (fn y => eq (x, y)) ys |
|
1044 |
in (x::xs)::(part xs') end |
|
1045 |
in part end; |
|
1046 |
||
1047 |
||
0 | 1048 |
|
233 | 1049 |
(* generating identifiers *) |
0 | 1050 |
|
4063 | 1051 |
(** Freshly generated identifiers; supplied prefix MUST start with a letter **) |
22369 | 1052 |
local |
1053 |
(*Maps 0-61 to A-Z, a-z, 0-9; exclude _ or ' to avoid clash with internal/unusual indentifiers*) |
|
22582
f315da9400fb
removed obsolete scanwords (see obsolete tactic.ML:rename_tac for its only use);
wenzelm
parents:
22567
diff
changeset
|
1054 |
fun gensym_char i = |
22368
0e0fe77d4768
gensym no longer includes ' or _ in names (trailing _ is bad)
paulson
parents:
22256
diff
changeset
|
1055 |
if i<26 then chr (ord "A" + i) |
0e0fe77d4768
gensym no longer includes ' or _ in names (trailing _ is bad)
paulson
parents:
22256
diff
changeset
|
1056 |
else if i<52 then chr (ord "a" + i - 26) |
22369 | 1057 |
else chr (ord "0" + i - 52); |
4063 | 1058 |
|
22369 | 1059 |
val char_vec = Vector.tabulate (62, gensym_char); |
1060 |
fun newid n = implode (map (fn i => Vector.sub (char_vec, i)) (radixpand (62, n))); |
|
4284 | 1061 |
|
24593
1547ea587f5a
added some int constraints (ML_Parse.fix_ints not active here);
wenzelm
parents:
24148
diff
changeset
|
1062 |
val gensym_seed = ref (0: int); |
2003 | 1063 |
|
22369 | 1064 |
in |
24148 | 1065 |
fun gensym pre = pre ^ newid (NAMED_CRITICAL "gensym" (fn () => inc gensym_seed)); |
22369 | 1066 |
end; |
4063 | 1067 |
|
1068 |
||
16439 | 1069 |
(* stamps and serial numbers *) |
1070 |
||
1071 |
type stamp = unit ref; |
|
1072 |
val stamp: unit -> stamp = ref; |
|
1073 |
||
1074 |
type serial = int; |
|
24593
1547ea587f5a
added some int constraints (ML_Parse.fix_ints not active here);
wenzelm
parents:
24148
diff
changeset
|
1075 |
local val count = ref (0: int) |
24148 | 1076 |
in fun serial () = NAMED_CRITICAL "serial" (fn () => inc count) end; |
16439 | 1077 |
|
19512 | 1078 |
val serial_string = string_of_int o serial; |
1079 |
||
16535
86c9eada525b
added structure Object (from Pure/General/object.ML);
wenzelm
parents:
16492
diff
changeset
|
1080 |
|
86c9eada525b
added structure Object (from Pure/General/object.ML);
wenzelm
parents:
16492
diff
changeset
|
1081 |
(* generic objects *) |
86c9eada525b
added structure Object (from Pure/General/object.ML);
wenzelm
parents:
16492
diff
changeset
|
1082 |
|
86c9eada525b
added structure Object (from Pure/General/object.ML);
wenzelm
parents:
16492
diff
changeset
|
1083 |
(*note that the builtin exception datatype may be extended by new |
86c9eada525b
added structure Object (from Pure/General/object.ML);
wenzelm
parents:
16492
diff
changeset
|
1084 |
constructors at any time*) |
86c9eada525b
added structure Object (from Pure/General/object.ML);
wenzelm
parents:
16492
diff
changeset
|
1085 |
structure Object = struct type T = exn end; |
86c9eada525b
added structure Object (from Pure/General/object.ML);
wenzelm
parents:
16492
diff
changeset
|
1086 |
|
1364
8ea1a962ad72
files now define a structure to allow SML/NJ to optimize the code
clasohm
parents:
1290
diff
changeset
|
1087 |
end; |
8ea1a962ad72
files now define a structure to allow SML/NJ to optimize the code
clasohm
parents:
1290
diff
changeset
|
1088 |
|
15745 | 1089 |
structure BasicLibrary: BASIC_LIBRARY = Library; |
1090 |
open BasicLibrary; |