author  wenzelm 
Sat, 25 Jul 2009 12:43:45 +0200  
changeset 32188  005f9abae1e3 
parent 31986  a68f88d264f7 
child 32352  4839a704939a 
permissions  rwrr 
41
97aae241094b
added cons, rcons, last_elem, sort_strings, take_suffix;
wenzelm
parents:
24
diff
changeset

1 
(* Title: Pure/library.ML 
233  2 
Author: Lawrence C Paulson, Cambridge University Computer Laboratory 
16188  3 
Author: Markus Wenzel, TU Muenchen 
0  4 

28732  5 
Basic library: functions, pairs, booleans, lists, integers, 
23424
d0580634f128
moved balanced tree operations to General/balanced_tree.ML;
wenzelm
parents:
23251
diff
changeset

6 
strings, lists as sets, orders, current directory, misc. 
21395
f34ac19659ae
moved some fundamental concepts to General/basics.ML;
wenzelm
parents:
21335
diff
changeset

7 

f34ac19659ae
moved some fundamental concepts to General/basics.ML;
wenzelm
parents:
21335
diff
changeset

8 
See also General/basics.ML for the most fundamental concepts. 
0  9 
*) 
10 

21395
f34ac19659ae
moved some fundamental concepts to General/basics.ML;
wenzelm
parents:
21335
diff
changeset

11 
infix 2 ? 
f34ac19659ae
moved some fundamental concepts to General/basics.ML;
wenzelm
parents:
21335
diff
changeset

12 
infix 3 o oo ooo oooo 
f34ac19659ae
moved some fundamental concepts to General/basics.ML;
wenzelm
parents:
21335
diff
changeset

13 
infix 4 ~~ upto downto 
20854  14 
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

15 
union_string inter inter_int inter_string subset subset_int subset_string 
5893  16 

15745  17 
signature BASIC_LIBRARY = 
4621  18 
sig 
19 
(*functions*) 

23860  20 
val undefined: 'a > 'b 
16842  21 
val I: 'a > 'a 
22 
val K: 'a > 'b > 'a 

4621  23 
val curry: ('a * 'b > 'c) > 'a > 'b > 'c 
24 
val uncurry: ('a > 'b > 'c) > 'a * 'b > 'c 

21565  25 
val ? : bool * ('a > 'a) > 'a > 'a 
16721  26 
val oo: ('a > 'b) * ('c > 'd > 'a) > 'c > 'd > 'b 
27 
val ooo: ('a > 'b) * ('c > 'd > 'e > 'a) > 'c > 'd > 'e > 'b 

28 
val oooo: ('a > 'b) * ('c > 'd > 'e > 'f > 'a) > 'c > 'd > 'e > 'f > 'b 

16842  29 
val funpow: int > ('a > 'a) > 'a > 'a 
31250  30 
val funpow_yield: int > ('a > 'b * 'a) > 'a > 'b list * 'a 
1364
8ea1a962ad72
files now define a structure to allow SML/NJ to optimize the code
clasohm
parents:
1290
diff
changeset

31 

18681
3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset

32 
(*errors*) 
19542  33 
exception SYS_ERROR of string 
34 
val sys_error: string > 'a 

18681
3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset

35 
exception ERROR of string 
3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset

36 
val error: string > 'a 
3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset

37 
val cat_error: string > string > 'a 
3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset

38 
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

39 

4621  40 
(*pairs*) 
41 
val pair: 'a > 'b > 'a * 'b 

42 
val rpair: 'a > 'b > 'b * 'a 

43 
val fst: 'a * 'b > 'a 

44 
val snd: 'a * 'b > 'b 

17498
d83af87bbdc5
improved eq_fst and eq_snd, removed some deprecated stuff
haftmann
parents:
17486
diff
changeset

45 
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

46 
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

47 
val eq_pair: ('a * 'c > bool) > ('b * 'd > bool) > ('a * 'b) * ('c * 'd) > bool 
4621  48 
val swap: 'a * 'b > 'b * 'a 
49 
val apfst: ('a > 'b) > 'a * 'c > 'b * 'c 

50 
val apsnd: ('a > 'b) > 'c * 'a > 'c * 'b 

51 
val pairself: ('a > 'b) > 'a * 'a > 'b * 'b 

52 

53 
(*booleans*) 

54 
val equal: ''a > ''a > bool 

55 
val not_equal: ''a > ''a > bool 

56 
val orf: ('a > bool) * ('a > bool) > 'a > bool 

57 
val andf: ('a > bool) * ('a > bool) > 'a > bool 

58 
val exists: ('a > bool) > 'a list > bool 

59 
val forall: ('a > bool) > 'a list > bool 

60 
val set: bool ref > bool 

61 
val reset: bool ref > bool 

62 
val toggle: bool ref > bool 

9118  63 
val change: 'a ref > ('a > 'a) > unit 
28157  64 
val change_result: 'a ref > ('a > 'b * 'a) > 'b 
23932  65 
val setmp_noncritical: 'a ref > 'a > ('b > 'c) > 'b > 'c 
4621  66 
val setmp: 'a ref > 'a > ('b > 'c) > 'b > 'c 
25797  67 
val setmp_thread_data: 'a Universal.tag > 'a > 'a > ('b > 'c) > 'b > 'c 
4621  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 

25681  78 
val foldl1: ('a * 'a > 'a) > 'a list > 'a 
15760  79 
val foldr1: ('a * 'a > 'a) > 'a list > 'a 
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 
28347  84 
val burrow_fst: ('a list > 'b list) > ('a * 'c) list > ('b * 'c) list 
18549
5308a6ea3b96
rearranged burrow_split to fold_burrow to allow composition with fold_map
haftmann
parents:
18514
diff
changeset

85 
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

86 
val maps: ('a > 'b list) > 'a list > 'b list 
25549  87 
val filter: ('a > bool) > 'a list > 'a list 
88 
val filter_out: ('a > bool) > 'a list > 'a list 

89 
val map_filter: ('a > 'b option) > 'a list > 'b list 

19011  90 
val chop: int > 'a list > 'a list * 'a list 
4713  91 
val dropwhile: ('a > bool) > 'a list > 'a list 
18278  92 
val nth: 'a list > int > 'a 
18011
685d95c793ff
cleaned up nth, nth_update, nth_map and nth_string functions
haftmann
parents:
17952
diff
changeset

93 
val nth_map: int > ('a > 'a) > 'a list > 'a list 
24846  94 
val nth_drop: int > 'a list > 'a list 
18286  95 
val nth_list: 'a list list > int > 'a list 
18514  96 
val map_index: (int * 'a > 'b) > 'a list > 'b list 
97 
val fold_index: (int * 'a > 'b > 'b) > 'a list > 'b > 'b 

4621  98 
val split_last: 'a list > 'a list * 'a 
99 
val find_index: ('a > bool) > 'a list > int 

100 
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

101 
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

102 
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

103 
val eq_list: ('a * 'b > bool) > 'a list * 'b list > bool 
18330  104 
val map2: ('a > 'b > 'c) > 'a list > 'b list > 'c list 
105 
val fold2: ('a > 'b > 'c > 'c) > 'a list > 'b list > 'c > 'c 

19799  106 
val zip_options: 'a list > 'b option list > ('a * 'b) list 
18330  107 
val ~~ : 'a list * 'b list > ('a * 'b) list 
25943  108 
val map_split: ('a > 'b * 'c) > 'a list > 'b list * 'c list 
18330  109 
val split_list: ('a * 'b) list > 'a list * 'b list 
26449  110 
val map_product: ('a > 'b > 'c) > 'a list > 'b list > 'c list 
111 
val fold_product: ('a > 'b > 'c > 'c) > 'a list > 'b list > 'c > 'c 

4621  112 
val separate: 'a > 'a list > 'a list 
25980  113 
val surround: 'a > 'a list > 'a list 
4621  114 
val replicate: int > 'a > 'a list 
18441  115 
val is_prefix: ('a * 'a > bool) > 'a list > 'a list > bool 
4621  116 
val take_prefix: ('a > bool) > 'a list > 'a list * 'a list 
20108  117 
val chop_prefix: ('a * 'b > bool) > 'a list * 'b list > 'a list * ('a list * 'b list) 
4621  118 
val take_suffix: ('a > bool) > 'a list > 'a list * 'a list 
12249  119 
val prefixes1: 'a list > 'a list list 
19011  120 
val prefixes: 'a list > 'a list list 
12249  121 
val suffixes1: 'a list > 'a list list 
19011  122 
val suffixes: 'a list > 'a list list 
4621  123 

124 
(*integers*) 

125 
val inc: int ref > int 

126 
val dec: int ref > int 

127 
val upto: int * int > int list 

128 
val downto: int * int > int list 

129 
val radixpand: int * int > int list 

130 
val radixstring: int * string * int > string 

131 
val string_of_int: int > string 

21942
d6218d0f9ec3
added signed_string_of_int (pruduces proper  instead of SML's ~);
wenzelm
parents:
21920
diff
changeset

132 
val signed_string_of_int: int > string 
4621  133 
val string_of_indexname: string * int > string 
24630
351a308ab58d
simplified type int (eliminated IntInf.int, integer);
wenzelm
parents:
24593
diff
changeset

134 
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

135 
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

136 
val oct_char: string > string 
4621  137 

138 
(*strings*) 

18011
685d95c793ff
cleaned up nth, nth_update, nth_map and nth_string functions
haftmann
parents:
17952
diff
changeset

139 
val nth_string: string > int > string 
16188  140 
val fold_string: (string > 'a > 'a) > string > 'a > 'a 
6312  141 
val exists_string: (string > bool) > string > bool 
16188  142 
val forall_string: (string > bool) > string > bool 
28025  143 
val first_field: string > string > (string * string) option 
4621  144 
val enclose: string > string > string > string 
6642  145 
val unenclose: string > string 
4621  146 
val quote: string > string 
147 
val space_implode: string > string list > string 

148 
val commas: string list > string 

149 
val commas_quote: string list > string 

150 
val cat_lines: string list > string 

151 
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

152 
val split_lines: string > string list 
5942  153 
val prefix_lines: string > string > string 
18681
3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset

154 
val prefix: string > string > string 
5285  155 
val suffix: string > string > string 
18681
3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset

156 
val unprefix: string > string > string 
5285  157 
val unsuffix: string > string > string 
10951  158 
val replicate_string: int > string > string 
14926  159 
val translate_string: (string > string) > string > string 
29882
29154e67731d
New command find_consts searching for constants by type (by Timothy Bourke).
kleing
parents:
29209
diff
changeset

160 
val match_string: string > string > bool 
4621  161 

16492  162 
(*lists as sets  see also Pure/General/ord_list.ML*) 
18923  163 
val member: ('b * 'a > bool) > 'a list > 'b > bool 
164 
val insert: ('a * 'a > bool) > 'a > 'a list > 'a list 

165 
val remove: ('b * 'a > bool) > 'b > 'a list > 'a list 

24049  166 
val update: ('a * 'a > bool) > 'a > 'a list > 'a list 
19301  167 
val subtract: ('b * 'a > bool) > 'b list > 'a list > 'a list 
18923  168 
val merge: ('a * 'a > bool) > 'a list * 'a list > 'a list 
4621  169 
val mem: ''a * ''a list > bool 
170 
val mem_int: int * int list > bool 

171 
val mem_string: string * string list > bool 

172 
val union: ''a list * ''a list > ''a list 

173 
val union_int: int list * int list > int list 

174 
val union_string: string list * string list > string list 

175 
val gen_union: ('a * 'a > bool) > 'a list * 'a list > 'a list 

7090  176 
val gen_inter: ('a * 'b > bool) > 'a list * 'b list > 'a list 
4621  177 
val inter: ''a list * ''a list > ''a list 
178 
val inter_int: int list * int list > int list 

179 
val inter_string: string list * string list > string list 

180 
val subset: ''a list * ''a list > bool 

181 
val subset_int: int list * int list > bool 

182 
val subset_string: string list * string list > bool 

183 
val eq_set: ''a list * ''a list > bool 

184 
val eq_set_string: string list * string list > bool 

185 
val gen_subset: ('a * 'b > bool) > 'a list * 'b list > bool 

19301  186 
val gen_eq_set: ('a * 'b > bool) > 'a list * 'b list > bool 
4621  187 
val \ : ''a list * ''a > ''a list 
188 
val \\ : ''a list * ''a list > ''a list 

19046
bc5c6c9b114e
removed distinct, renamed gen_distinct to distinct;
wenzelm
parents:
19011
diff
changeset

189 
val distinct: ('a * 'a > bool) > 'a list > 'a list 
18966  190 
val duplicates: ('a * 'a > bool) > 'a list > 'a list 
16878  191 
val has_duplicates: ('a * 'a > bool) > 'a list > bool 
4621  192 

23220  193 
(*lists as multisets*) 
22142  194 
val remove1: ('b * 'a > bool) > 'b > 'a list > 'a list 
23220  195 
val submultiset: ('a * 'b > bool) > 'a list * 'b list > bool 
4621  196 

197 
(*orders*) 

18966  198 
val is_equal: order > bool 
4621  199 
val rev_order: order > order 
200 
val make_ord: ('a * 'a > bool) > 'a * 'a > order 

25224  201 
val bool_ord: bool * bool > order 
4621  202 
val int_ord: int * int > order 
203 
val string_ord: string * string > order 

16676  204 
val fast_string_ord: string * string > order 
16492  205 
val option_ord: ('a * 'b > order) > 'a option * 'b option > order 
4621  206 
val prod_ord: ('a * 'b > order) > ('c * 'd > order) > ('a * 'c) * ('b * 'd) > order 
207 
val dict_ord: ('a * 'b > order) > 'a list * 'b list > order 

208 
val list_ord: ('a * 'b > order) > 'a list * 'b list > order 

209 
val sort: ('a * 'a > order) > 'a list > 'a list 

18427  210 
val sort_distinct: ('a * 'a > order) > 'a list > 'a list 
4621  211 
val sort_strings: string list > string list 
212 
val sort_wrt: ('a > string) > 'a list > 'a list 

30558
2ef9892114fd
renamed Tactic.taglist/untaglist/orderlist to tag_list/untag_list/order_list (in library.ML);
wenzelm
parents:
30190
diff
changeset

213 
val tag_list: int > 'a list > (int * 'a) list 
2ef9892114fd
renamed Tactic.taglist/untaglist/orderlist to tag_list/untag_list/order_list (in library.ML);
wenzelm
parents:
30190
diff
changeset

214 
val untag_list: (int * 'a) list > 'a list 
2ef9892114fd
renamed Tactic.taglist/untaglist/orderlist to tag_list/untag_list/order_list (in library.ML);
wenzelm
parents:
30190
diff
changeset

215 
val order_list: (int * 'a) list > 'a list 
4621  216 

14106
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset

217 
(*random numbers*) 
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset

218 
exception RANDOM 
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset

219 
val random: unit > real 
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset

220 
val random_range: int > int > int 
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset

221 
val one_of: 'a list > 'a 
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset

222 
val frequency: (int * 'a) list > 'a 
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset

223 

4621  224 
(*misc*) 
19644
0b01436e1843
added divide_and_conquer combinator (by Amine Chaieb);
wenzelm
parents:
19596
diff
changeset

225 
val divide_and_conquer: ('a > 'a list * ('b list > 'b)) > 'a > 'b 
4621  226 
val partition_eq: ('a * 'a > bool) > 'a list > 'a list list 
227 
val partition_list: (int > 'a > bool) > int > int > 'a list > 'a list list 

228 
val gensym: string > string 

16439  229 
type stamp 
230 
val stamp: unit > stamp 

231 
type serial 

232 
val serial: unit > serial 

19512  233 
val serial_string: unit > string 
16535
86c9eada525b
added structure Object (from Pure/General/object.ML);
wenzelm
parents:
16492
diff
changeset

234 
structure Object: sig type T end 
4621  235 
end; 
236 

15745  237 
signature LIBRARY = 
15570  238 
sig 
15745  239 
include BASIC_LIBRARY 
15570  240 
val foldl: ('a * 'b > 'a) > 'a * 'b list > 'a 
241 
val foldr: ('a * 'b > 'b) > 'a list * 'b > 'b 

30190  242 
val foldl_map: ('a * 'b > 'a * 'c) > 'a * 'b list > 'a * 'c list 
15570  243 
val take: int * 'a list > 'a list 
244 
val drop: int * 'a list > 'a list 

245 
val last_elem: 'a list > 'a 

246 
end; 

247 

15745  248 
structure Library: LIBRARY = 
1364
8ea1a962ad72
files now define a structure to allow SML/NJ to optimize the code
clasohm
parents:
1290
diff
changeset

249 
struct 
0  250 

21395
f34ac19659ae
moved some fundamental concepts to General/basics.ML;
wenzelm
parents:
21335
diff
changeset

251 
(* functions *) 
0  252 

23860  253 
fun undefined _ = raise Match; 
254 

16842  255 
fun I x = x; 
256 
fun K x = fn _ => x; 

233  257 
fun curry f x y = f (x, y); 
258 
fun uncurry f (x, y) = f x y; 

0  259 

17141
4b0dc89de43b
added ? combinator for conditional transformations
haftmann
parents:
17101
diff
changeset

260 
(*conditional application*) 
21565  261 
fun b ? f = fn x => if b then f x else x; 
17141
4b0dc89de43b
added ? combinator for conditional transformations
haftmann
parents:
17101
diff
changeset

262 

16721  263 
(*composition with multiple args*) 
264 
fun (f oo g) x y = f (g x y); 

265 
fun (f ooo g) x y z = f (g x y z); 

266 
fun (f oooo g) x y z w = f (g x y z w); 

267 

31250  268 
(*function exponentiation: f (... (f x) ...) with n applications of f*) 
269 
fun funpow (0 : int) _ = I 

270 
 funpow n f = f #> funpow (n  1) f; 

160  271 

31250  272 
fun funpow_yield (0 : int) _ x = ([], x) 
273 
 funpow_yield n f x = x > f >> funpow_yield (n  1) f >> op ::; 

160  274 

18681
3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset

275 
(* errors *) 
3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset

276 

19542  277 
exception SYS_ERROR of string; 
278 
fun sys_error msg = raise SYS_ERROR msg; 

279 

18681
3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset

280 
exception ERROR of string; 
3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset

281 
fun error msg = raise ERROR msg; 
3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset

282 

3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset

283 
fun cat_error "" msg = error msg 
3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset

284 
 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

285 

3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset

286 
fun assert_all pred list msg = 
3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset

287 
let 
3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset

288 
fun ass [] = () 
3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset

289 
 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

290 
in ass list end; 
3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset

291 

3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset

292 

21395
f34ac19659ae
moved some fundamental concepts to General/basics.ML;
wenzelm
parents:
21335
diff
changeset

293 
(* pairs *) 
233  294 

295 
fun pair x y = (x, y); 

296 
fun rpair x y = (y, x); 

297 

298 
fun fst (x, y) = x; 

299 
fun snd (x, y) = y; 

300 

17498
d83af87bbdc5
improved eq_fst and eq_snd, removed some deprecated stuff
haftmann
parents:
17486
diff
changeset

301 
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

302 
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

303 
fun eq_pair eqx eqy ((x1, y1), (x2, y2)) = eqx (x1, x2) andalso eqy (y1, y2); 
233  304 

305 
fun swap (x, y) = (y, x); 

306 

307 
fun apfst f (x, y) = (f x, y); 

308 
fun apsnd f (x, y) = (x, f y); 

4212  309 
fun pairself f (x, y) = (f x, f y); 
233  310 

311 

21395
f34ac19659ae
moved some fundamental concepts to General/basics.ML;
wenzelm
parents:
21335
diff
changeset

312 
(* booleans *) 
233  313 

21395
f34ac19659ae
moved some fundamental concepts to General/basics.ML;
wenzelm
parents:
21335
diff
changeset

314 
(*polymorphic equality*) 
233  315 
fun equal x y = x = y; 
316 
fun not_equal x y = x <> y; 

317 

21395
f34ac19659ae
moved some fundamental concepts to General/basics.ML;
wenzelm
parents:
21335
diff
changeset

318 
(*combining predicates*) 
16721  319 
fun p orf q = fn x => p x orelse q x; 
320 
fun p andf q = fn x => p x andalso q x; 

233  321 

25752  322 
val exists = List.exists; 
323 
val forall = List.all; 

0  324 

19644
0b01436e1843
added divide_and_conquer combinator (by Amine Chaieb);
wenzelm
parents:
19596
diff
changeset

325 

380  326 
(* flags *) 
327 

328 
fun set flag = (flag := true; true); 

329 
fun reset flag = (flag := false; false); 

330 
fun toggle flag = (flag := not (! flag); ! flag); 

331 

9118  332 
fun change r f = r := f (! r); 
28157  333 
fun change_result r f = let val (x, y) = f (! r) in r := y; x end; 
9118  334 

18712  335 
(*temporarily set flag during execution*) 
23932  336 
fun setmp_noncritical flag value f x = 
26079  337 
uninterruptible (fn restore_attributes => fn () => 
338 
let 

339 
val orig_value = ! flag; 

340 
val _ = flag := value; 

341 
val result = Exn.capture (restore_attributes f) x; 

342 
val _ = flag := orig_value; 

343 
in Exn.release result end) (); 

2958  344 

26079  345 
fun setmp flag value f x = 
346 
NAMED_CRITICAL "setmp" (fn () => setmp_noncritical flag value f x); 

23932  347 

25797  348 
fun setmp_thread_data tag orig_data data f x = 
26079  349 
uninterruptible (fn restore_attributes => fn () => 
350 
let 

28122  351 
val _ = Thread.setLocal (tag, data); 
26079  352 
val result = Exn.capture (restore_attributes f) x; 
28122  353 
val _ = Thread.setLocal (tag, orig_data); 
26079  354 
in Exn.release result end) (); 
25797  355 

19644
0b01436e1843
added divide_and_conquer combinator (by Amine Chaieb);
wenzelm
parents:
19596
diff
changeset

356 

21395
f34ac19659ae
moved some fundamental concepts to General/basics.ML;
wenzelm
parents:
21335
diff
changeset

357 

233  358 
(** lists **) 
359 

15570  360 
exception UnequalLengths; 
233  361 

5285  362 
fun single x = [x]; 
233  363 

20882  364 
fun the_single [x] = x 
365 
 the_single _ = raise Empty; 

366 

367 
fun singleton f x = the_single (f [x]); 

19273  368 

25061  369 
fun yield_singleton f x = f [x] #>> the_single; 
370 

5904  371 
fun apply [] x = x 
372 
 apply (f :: fs) x = apply fs (f x); 

373 

25058  374 
fun perhaps_apply funs arg = 
375 
let 

376 
fun app [] res = res 

377 
 app (f :: fs) (changed, x) = 

378 
(case f x of 

379 
NONE => app fs (changed, x) 

380 
 SOME x' => app fs (true, x')); 

381 
in (case app funs (false, arg) of (false, _) => NONE  (true, arg') => SOME arg') end; 

382 

383 
fun perhaps_loop f arg = 

384 
let 

385 
fun loop (changed, x) = 

386 
(case f x of 

387 
NONE => (changed, x) 

388 
 SOME x' => loop (true, x')); 

389 
in (case loop (false, arg) of (false, _) => NONE  (true, arg') => SOME arg') end; 

390 

233  391 

21395
f34ac19659ae
moved some fundamental concepts to General/basics.ML;
wenzelm
parents:
21335
diff
changeset

392 
(* fold  old versions *) 
16691
539b9cc282fa
added combinatros '>' and '>>' and fold_map fitting nicely to ST combinator '>'
haftmann
parents:
16688
diff
changeset

393 

233  394 
(*the following versions of fold are designed to fit nicely with infixes*) 
0  395 

233  396 
(* (op @) (e, [x1, ..., xn]) ===> ((e @ x1) @ x2) ... @ xn 
397 
for operators that associate to the left (TAIL RECURSIVE)*) 

398 
fun foldl (f: 'a * 'b > 'a) : 'a * 'b list > 'a = 

399 
let fun itl (e, []) = e 

400 
 itl (e, a::l) = itl (f(e, a), l) 

401 
in itl end; 

402 

403 
(* (op @) ([x1, ..., xn], e) ===> x1 @ (x2 ... @ (xn @ e)) 

404 
for operators that associate to the right (not tail recursive)*) 

405 
fun foldr f (l, e) = 

406 
let fun itr [] = e 

407 
 itr (a::l) = f(a, itr l) 

408 
in itr l end; 

409 

25681  410 
(* (op @) [x1, ..., xn] ===> ((x1 @ x2) @ x3) ... @ xn 
411 
for operators that associate to the left (TAIL RECURSIVE)*) 

412 
fun foldl1 f [] = raise Empty 

413 
 foldl1 f (x :: xs) = foldl f (x, xs); 

414 

233  415 
(* (op @) [x1, ..., xn] ===> x1 @ (x2 ... @ (x[n1] @ xn)) 
416 
for n > 0, operators that associate to the right (not tail recursive)*) 

20443  417 
fun foldr1 f [] = raise Empty 
20510  418 
 foldr1 f l = 
20443  419 
let fun itr [x] = x 
20510  420 
 itr (x::l) = f(x, itr l) 
20443  421 
in itr l end; 
233  422 

16705  423 
fun foldl_map f = 
424 
let 

425 
fun fold_aux (x, []) = (x, []) 

426 
 fold_aux (x, y :: ys) = 

427 
let 

428 
val (x', y') = f (x, y); 

429 
val (x'', ys') = fold_aux (x', ys); 

430 
in (x'', y' :: ys') end; 

431 
in fold_aux end; 

432 

233  433 

434 
(* basic list functions *) 

435 

20510  436 
fun eq_list eq (list1, list2) = 
20348  437 
let 
20510  438 
fun eq_lst (x :: xs, y :: ys) = eq (x, y) andalso eq_lst (xs, ys) 
439 
 eq_lst _ = true; 

440 
in length list1 = length list2 andalso eq_lst (list1, list2) end; 

20348  441 

19483
55ee839198bd
renamed mapfilter to map_filter, made pervasive (again);
wenzelm
parents:
19474
diff
changeset

442 
fun maps f [] = [] 
55ee839198bd
renamed mapfilter to map_filter, made pervasive (again);
wenzelm
parents:
19474
diff
changeset

443 
 maps f (x :: xs) = f x @ maps f xs; 
55ee839198bd
renamed mapfilter to map_filter, made pervasive (again);
wenzelm
parents:
19474
diff
changeset

444 

25538  445 
val filter = List.filter; 
446 
fun filter_out f = filter (not o f); 

447 
val map_filter = List.mapPartial; 

448 

24593
1547ea587f5a
added some int constraints (ML_Parse.fix_ints not active here);
wenzelm
parents:
24148
diff
changeset

449 
fun chop (0: int) xs = ([], xs) 
23220  450 
 chop _ [] = ([], []) 
451 
 chop n (x :: xs) = chop (n  1) xs >> cons x; 

19011  452 

233  453 
(*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

454 
fun take (n: int, []) = [] 
233  455 
 take (n, x :: xs) = 
456 
if n > 0 then x :: take (n  1, xs) else []; 

457 

458 
(*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

459 
fun drop (n: int, []) = [] 
233  460 
 drop (n, x :: xs) = 
461 
if n > 0 then drop (n  1, xs) else x :: xs; 

0  462 

4713  463 
fun dropwhile P [] = [] 
464 
 dropwhile P (ys as x::xs) = if P x then dropwhile P xs else ys; 

465 

233  466 
(*return nth element of a list, where 0 designates the first element; 
18461  467 
raise Subscript if list too short*) 
18011
685d95c793ff
cleaned up nth, nth_update, nth_map and nth_string functions
haftmann
parents:
17952
diff
changeset

468 
fun nth xs i = List.nth (xs, i); 
233  469 

18461  470 
fun nth_list xss i = nth xss i handle Subscript => []; 
471 

18011
685d95c793ff
cleaned up nth, nth_update, nth_map and nth_string functions
haftmann
parents:
17952
diff
changeset

472 
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

473 
 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

474 
 nth_map (_: int) _ [] = raise Subscript; 
11773  475 

24846  476 
fun nth_drop n xs = 
477 
List.take (xs, n) @ List.drop (xs, n + 1); 

478 

18514  479 
fun map_index f = 
480 
let 

24593
1547ea587f5a
added some int constraints (ML_Parse.fix_ints not active here);
wenzelm
parents:
24148
diff
changeset

481 
fun mapp (_: int) [] = [] 
1547ea587f5a
added some int constraints (ML_Parse.fix_ints not active here);
wenzelm
parents:
24148
diff
changeset

482 
 mapp i (x :: xs) = f (i, x) :: mapp (i + 1) xs 
18514  483 
in mapp 0 end; 
484 

21118  485 
fun fold_index f = 
486 
let 

24593
1547ea587f5a
added some int constraints (ML_Parse.fix_ints not active here);
wenzelm
parents:
24148
diff
changeset

487 
fun fold_aux (_: int) [] y = y 
1547ea587f5a
added some int constraints (ML_Parse.fix_ints not active here);
wenzelm
parents:
24148
diff
changeset

488 
 fold_aux i (x :: xs) y = fold_aux (i + 1) xs (f (i, x) y); 
21118  489 
in fold_aux 0 end; 
490 

15570  491 
val last_elem = List.last; 
233  492 

3762  493 
(*rear decomposition*) 
15570  494 
fun split_last [] = raise Empty 
3762  495 
 split_last [x] = ([], x) 
496 
 split_last (x :: xs) = apfst (cons x) (split_last xs); 

497 

29209  498 
(*find position of first element satisfying a predicate*) 
4212  499 
fun find_index pred = 
24593
1547ea587f5a
added some int constraints (ML_Parse.fix_ints not active here);
wenzelm
parents:
24148
diff
changeset

500 
let fun find (_: int) [] = ~1 
4212  501 
 find n (x :: xs) = if pred x then n else find (n + 1) xs; 
502 
in find 0 end; 

3762  503 

4212  504 
(*find first element satisfying predicate*) 
22593  505 
val find_first = List.find; 
233  506 

4916
fe8b0c82691b
get_first: ('a > 'b option) > 'a list > 'b option;
wenzelm
parents:
4893
diff
changeset

507 
(*get first element by lookup function*) 
15531  508 
fun get_first _ [] = NONE 
4916
fe8b0c82691b
get_first: ('a > 'b option) > 'a list > 'b option;
wenzelm
parents:
4893
diff
changeset

509 
 get_first f (x :: xs) = 
fe8b0c82691b
get_first: ('a > 'b option) > 'a list > 'b option;
wenzelm
parents:
4893
diff
changeset

510 
(case f x of 
15531  511 
NONE => get_first f xs 
4916
fe8b0c82691b
get_first: ('a > 'b option) > 'a list > 'b option;
wenzelm
parents:
4893
diff
changeset

512 
 some => some); 
fe8b0c82691b
get_first: ('a > 'b option) > 'a list > 'b option;
wenzelm
parents:
4893
diff
changeset

513 

19233
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19119
diff
changeset

514 
fun get_index f = 
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19119
diff
changeset

515 
let 
24593
1547ea587f5a
added some int constraints (ML_Parse.fix_ints not active here);
wenzelm
parents:
24148
diff
changeset

516 
fun get (_: int) [] = NONE 
19461  517 
 get i (x :: xs) = 
19233
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19119
diff
changeset

518 
case f x 
19461  519 
of NONE => get (i + 1) xs 
19233
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19119
diff
changeset

520 
 SOME y => SOME (i, y) 
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19119
diff
changeset

521 
in get 0 end; 
77ca20b0ed77
renamed HOL +  * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19119
diff
changeset

522 

15531  523 
val flat = List.concat; 
233  524 

12136  525 
fun unflat (xs :: xss) ys = 
19424  526 
let val (ps, qs) = chop (length xs) ys 
13629  527 
in ps :: unflat xss qs end 
12136  528 
 unflat [] [] = [] 
15570  529 
 unflat _ _ = raise UnequalLengths; 
12136  530 

21479
63e7eb863ae6
moved string_of_pair/list/option to structure ML_Syntax;
wenzelm
parents:
21395
diff
changeset

531 
fun burrow f xss = unflat xss (f (flat xss)); 
18359  532 

24864  533 
fun burrow_options f os = map (try hd) (burrow f (map the_list os)); 
534 

18549
5308a6ea3b96
rearranged burrow_split to fold_burrow to allow composition with fold_map
haftmann
parents:
18514
diff
changeset

535 
fun fold_burrow f xss s = 
5308a6ea3b96
rearranged burrow_split to fold_burrow to allow composition with fold_map
haftmann
parents:
18514
diff
changeset

536 
apfst (unflat xss) (f (flat xss) s); 
18359  537 

233  538 
(*separate s [x1, x2, ..., xn] ===> [x1, s, x2, s, ..., s, xn]*) 
539 
fun separate s (x :: (xs as _ :: _)) = x :: s :: separate s xs 

540 
 separate _ xs = xs; 

541 

25980  542 
fun surround s (x :: xs) = s :: x :: surround s xs 
543 
 surround s [] = [s]; 

544 

233  545 
(*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

546 
fun replicate (n: int) x = 
233  547 
let fun rep (0, xs) = xs 
548 
 rep (n, xs) = rep (n  1, x :: xs) 

549 
in 

15570  550 
if n < 0 then raise Subscript 
233  551 
else rep (n, []) 
552 
end; 

553 

4248
5e8a31c41d44
added get_error: 'a error > string option, get_ok: 'a error > 'a option;
wenzelm
parents:
4224
diff
changeset

554 

25549  555 
(* direct product *) 
556 

25538  557 
fun map_product f _ [] = [] 
558 
 map_product f [] _ = [] 

559 
 map_product f (x :: xs) ys = map (f x) ys @ map_product f xs ys; 

233  560 

25538  561 
fun fold_product f _ [] z = z 
562 
 fold_product f [] _ z = z 

563 
 fold_product f (x :: xs) ys z = z > fold (f x) ys > fold_product f xs ys; 

233  564 

25549  565 

566 
(* lists of pairs *) 

233  567 

15570  568 
exception UnequalLengths; 
569 

18330  570 
fun map2 _ [] [] = [] 
571 
 map2 f (x :: xs) (y :: ys) = f x y :: map2 f xs ys 

572 
 map2 _ _ _ = raise UnequalLengths; 

380  573 

23220  574 
fun fold2 f [] [] z = z 
575 
 fold2 f (x :: xs) (y :: ys) z = fold2 f xs ys (f x y z) 

576 
 fold2 f _ _ _ = raise UnequalLengths; 

380  577 

25943  578 
fun map_split f [] = ([], []) 
579 
 map_split f (x :: xs) = 

580 
let 

581 
val (y, w) = f x; 

582 
val (ys, ws) = map_split f xs; 

583 
in (y :: ys, w :: ws) end; 

584 

19799  585 
fun zip_options (x :: xs) (SOME y :: ys) = (x, y) :: zip_options xs ys 
586 
 zip_options (_ :: xs) (NONE :: ys) = zip_options xs ys 

587 
 zip_options _ [] = [] 

588 
 zip_options [] _ = raise UnequalLengths; 

4956
a7538e43896e
added foldl_map: ('a * 'b > 'a * 'c) > 'a * 'b list > 'a * 'c list;
wenzelm
parents:
4945
diff
changeset

589 

233  590 
(*combine two lists forming a list of pairs: 
591 
[x1, ..., xn] ~~ [y1, ..., yn] ===> [(x1, y1), ..., (xn, yn)]*) 

592 
fun [] ~~ [] = [] 

593 
 (x :: xs) ~~ (y :: ys) = (x, y) :: (xs ~~ ys) 

15570  594 
 _ ~~ _ = raise UnequalLengths; 
233  595 

596 
(*inverse of ~~; the old 'split': 

597 
[(x1, y1), ..., (xn, yn)] ===> ([x1, ..., xn], [y1, ..., yn])*) 

15570  598 
val split_list = ListPair.unzip; 
233  599 

28347  600 
fun burrow_fst f xs = split_list xs >> f > op ~~; 
601 

233  602 

603 
(* prefixes, suffixes *) 

604 

18441  605 
fun is_prefix _ [] _ = true 
606 
 is_prefix eq (x :: xs) (y :: ys) = eq (x, y) andalso is_prefix eq xs ys 

607 
 is_prefix eq _ _ = false; 

233  608 

609 
(* [x1, ..., xi, ..., xn] > ([x1, ..., x(i1)], [xi, ..., xn]) 

610 
where xi is the first element that does not satisfy the predicate*) 

611 
fun take_prefix (pred : 'a > bool) (xs: 'a list) : 'a list * 'a list = 

612 
let fun take (rxs, []) = (rev rxs, []) 

255
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset

613 
 take (rxs, x :: xs) = 
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset

614 
if pred x then take(x :: rxs, xs) else (rev rxs, x :: xs) 
233  615 
in take([], xs) end; 
616 

20108  617 
fun chop_prefix eq ([], ys) = ([], ([], ys)) 
618 
 chop_prefix eq (xs, []) = ([], (xs, [])) 

23220  619 
 chop_prefix eq (xs as x :: xs', ys as y :: ys') = 
20108  620 
if eq (x, y) then 
621 
let val (ps', xys'') = chop_prefix eq (xs', ys') 

23220  622 
in (x :: ps', xys'') end 
20108  623 
else ([], (xs, ys)); 
624 

233  625 
(* [x1, ..., xi, ..., xn] > ([x1, ..., xi], [x(i+1), ..., xn]) 
626 
where xi is the last element that does not satisfy the predicate*) 

627 
fun take_suffix _ [] = ([], []) 

628 
 take_suffix pred (x :: xs) = 

629 
(case take_suffix pred xs of 

630 
([], sffx) => if pred x then ([], x :: sffx) else ([x], sffx) 

631 
 (prfx, sffx) => (x :: prfx, sffx)); 

632 

12249  633 
fun prefixes1 [] = [] 
634 
 prefixes1 (x :: xs) = map (cons x) ([] :: prefixes1 xs); 

635 

19011  636 
fun prefixes xs = [] :: prefixes1 xs; 
637 

12249  638 
fun suffixes1 xs = map rev (prefixes1 (rev xs)); 
19011  639 
fun suffixes xs = [] :: suffixes1 xs; 
233  640 

23220  641 

642 

233  643 
(** integers **) 
644 

24593
1547ea587f5a
added some int constraints (ML_Parse.fix_ints not active here);
wenzelm
parents:
24148
diff
changeset

645 
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

646 
fun dec i = (i := ! i  (1: int); ! i); 
233  647 

648 

649 
(* lists of integers *) 

650 

651 
(*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

652 
fun ((i: int) upto j) = 
21859  653 
if i > j then [] else i :: (i + 1 upto j); 
233  654 

655 
(*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

656 
fun ((i: int) downto j) = 
21859  657 
if i < j then [] else i :: (i  1 downto j); 
233  658 

659 

660 
(* convert integers to strings *) 

661 

662 
(*expand the number in the given base; 

663 
example: radixpand (2, 8) gives [1, 0, 0, 0]*) 

664 
fun radixpand (base, num) : int list = 

665 
let 

666 
fun radix (n, tail) = 

667 
if n < base then n :: tail 

668 
else radix (n div base, (n mod base) :: tail) 

669 
in radix (num, []) end; 

670 

671 
(*expands a number into a string of characters starting from "zerochar"; 

672 
example: radixstring (2, "0", 8) gives "1000"*) 

673 
fun radixstring (base, zerochar, num) = 

674 
let val offset = ord zerochar; 

675 
fun chrof n = chr (offset + n) 

676 
in implode (map chrof (radixpand (base, num))) end; 

677 

678 

3407
afd288caf573
Removal of radixstring from string_of_int; addition of string_of_indexname
paulson
parents:
3393
diff
changeset

679 
val string_of_int = Int.toString; 
233  680 

21942
d6218d0f9ec3
added signed_string_of_int (pruduces proper  instead of SML's ~);
wenzelm
parents:
21920
diff
changeset

681 
fun signed_string_of_int i = 
d6218d0f9ec3
added signed_string_of_int (pruduces proper  instead of SML's ~);
wenzelm
parents:
21920
diff
changeset

682 
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

683 

23220  684 
fun string_of_indexname (a, 0) = a 
685 
 string_of_indexname (a, i) = a ^ "_" ^ string_of_int i; 

233  686 

687 

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

688 
(* 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

689 

24630
351a308ab58d
simplified type int (eliminated IntInf.int, integer);
wenzelm
parents:
24593
diff
changeset

690 
fun read_radix_int radix cs = 
20095  691 
let 
692 
val zero = ord "0"; 

693 
val limit = zero + radix; 

694 
fun scan (num, []) = (num, []) 

695 
 scan (num, c :: cs) = 

696 
if zero <= ord c andalso ord c < limit then 

24630
351a308ab58d
simplified type int (eliminated IntInf.int, integer);
wenzelm
parents:
24593
diff
changeset

697 
scan (radix * num + (ord c  zero), cs) 
20095  698 
else (num, c :: cs); 
24630
351a308ab58d
simplified type int (eliminated IntInf.int, integer);
wenzelm
parents:
24593
diff
changeset

699 
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

700 

24630
351a308ab58d
simplified type int (eliminated IntInf.int, integer);
wenzelm
parents:
24593
diff
changeset

701 
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

702 

24630
351a308ab58d
simplified type int (eliminated IntInf.int, integer);
wenzelm
parents:
24593
diff
changeset

703 
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

704 

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

705 

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

706 

233  707 
(** strings **) 
708 

16188  709 
(* functions tuned for strings, avoiding explode *) 
6312  710 

18011
685d95c793ff
cleaned up nth, nth_update, nth_map and nth_string functions
haftmann
parents:
17952
diff
changeset

711 
fun nth_string str i = 
6959  712 
(case try String.substring (str, i, 1) of 
15531  713 
SOME s => s 
15570  714 
 NONE => raise Subscript); 
6312  715 

16188  716 
fun fold_string f str x0 = 
6282  717 
let 
718 
val n = size str; 

16188  719 
fun iter (x, i) = 
720 
if i < n then iter (f (String.substring (str, i, 1)) x, i + 1) else x; 

721 
in iter (x0, 0) end; 

6282  722 

14968  723 
fun exists_string pred str = 
724 
let 

725 
val n = size str; 

726 
fun ex i = i < n andalso (pred (String.substring (str, i, 1)) orelse ex (i + 1)); 

727 
in ex 0 end; 

6312  728 

16188  729 
fun forall_string pred = not o exists_string (not o pred); 
730 

28025  731 
fun first_field sep str = 
28022  732 
let 
28025  733 
val n = size sep; 
28022  734 
val len = size str; 
735 
fun find i = 

736 
if i + n > len then NONE 

28025  737 
else if String.substring (str, i, n) = sep then SOME i 
28022  738 
else find (i + 1); 
28025  739 
in 
740 
(case find 0 of 

741 
NONE => NONE 

742 
 SOME i => SOME (String.substring (str, 0, i), String.extract (str, i + n, NONE))) 

743 
end; 

28022  744 

512
55755ed9fab9
Pure/library/enclose, Pure/Syntax/pretty/enclose: renamed from parents
lcp
parents:
410
diff
changeset

745 
(*enclose in brackets*) 
55755ed9fab9
Pure/library/enclose, Pure/Syntax/pretty/enclose: renamed from parents
lcp
parents:
410
diff
changeset

746 
fun enclose lpar rpar str = lpar ^ str ^ rpar; 
6642  747 
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

748 

233  749 
(*simple quoting (does not escape special chars)*) 
512
55755ed9fab9
Pure/library/enclose, Pure/Syntax/pretty/enclose: renamed from parents
lcp
parents:
410
diff
changeset

750 
val quote = enclose "\"" "\""; 
233  751 

4212  752 
(*space_implode "..." (explode "hello") = "h...e...l...l...o"*) 
233  753 
fun space_implode a bs = implode (separate a bs); 
754 

255
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset

755 
val commas = space_implode ", "; 
380  756 
val commas_quote = commas o map quote; 
255
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset

757 

233  758 
(*concatenate messages, one per line, into a string*) 
255
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset

759 
val cat_lines = space_implode "\n"; 
233  760 

4212  761 
(*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

762 
fun space_explode _ "" = [] 
21899  763 
 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

764 

17a20a2af8f5
fixed space_explode, old one retained as BAD_space_explode;
wenzelm
parents:
3762
diff
changeset

765 
val split_lines = space_explode "\n"; 
17a20a2af8f5
fixed space_explode, old one retained as BAD_space_explode;
wenzelm
parents:
3762
diff
changeset

766 

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

767 
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

768 
 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

769 

18681
3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset

770 
fun prefix prfx s = prfx ^ s; 
16188  771 
fun suffix sffx s = s ^ sffx; 
5285  772 

18681
3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset

773 
fun unprefix prfx s = 
3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset

774 
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

775 
else raise Fail "unprefix"; 
3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset

776 

16188  777 
fun unsuffix sffx s = 
17061  778 
if String.isSuffix sffx s then String.substring (s, 0, size s  size sffx) 
779 
else raise Fail "unsuffix"; 

5285  780 

24593
1547ea587f5a
added some int constraints (ML_Parse.fix_ints not active here);
wenzelm
parents:
24148
diff
changeset

781 
fun replicate_string (0: int) _ = "" 
10951  782 
 replicate_string 1 a = a 
783 
 replicate_string k a = 

784 
if k mod 2 = 0 then replicate_string (k div 2) (a ^ a) 

785 
else replicate_string (k div 2) (a ^ a) ^ a; 

786 

31250  787 
fun translate_string f = String.translate (f o String.str); 
788 

29882
29154e67731d
New command find_consts searching for constants by type (by Timothy Bourke).
kleing
parents:
29209
diff
changeset

789 
(*crude matching of str against simple glob pat*) 
29154e67731d
New command find_consts searching for constants by type (by Timothy Bourke).
kleing
parents:
29209
diff
changeset

790 
fun match_string pat str = 
29154e67731d
New command find_consts searching for constants by type (by Timothy Bourke).
kleing
parents:
29209
diff
changeset

791 
let 
29154e67731d
New command find_consts searching for constants by type (by Timothy Bourke).
kleing
parents:
29209
diff
changeset

792 
fun match [] _ = true 
29154e67731d
New command find_consts searching for constants by type (by Timothy Bourke).
kleing
parents:
29209
diff
changeset

793 
 match (p :: ps) s = 
29154e67731d
New command find_consts searching for constants by type (by Timothy Bourke).
kleing
parents:
29209
diff
changeset

794 
size p <= size s andalso 
29154e67731d
New command find_consts searching for constants by type (by Timothy Bourke).
kleing
parents:
29209
diff
changeset

795 
(case try (unprefix p) s of 
29154e67731d
New command find_consts searching for constants by type (by Timothy Bourke).
kleing
parents:
29209
diff
changeset

796 
SOME s' => match ps s' 
29154e67731d
New command find_consts searching for constants by type (by Timothy Bourke).
kleing
parents:
29209
diff
changeset

797 
 NONE => match (p :: ps) (String.substring (s, 1, size s  1))); 
29154e67731d
New command find_consts searching for constants by type (by Timothy Bourke).
kleing
parents:
29209
diff
changeset

798 
in match (space_explode "*" pat) str end; 
23220  799 

16492  800 
(** lists as sets  see also Pure/General/ord_list.ML **) 
233  801 

26439  802 
(* canonical operations *) 
803 

18923  804 
fun member eq list x = 
805 
let 

806 
fun memb [] = false 

807 
 memb (y :: ys) = eq (x, y) orelse memb ys; 

808 
in memb list end; 

1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

809 

18923  810 
fun insert eq x xs = if member eq xs x then xs else x :: xs; 
811 
fun remove eq x xs = if member eq xs x then filter_out (fn y => eq (x, y)) xs else xs; 

24049  812 
fun update eq x xs = cons x (remove eq x xs); 
233  813 

19301  814 
fun subtract eq = fold (remove eq); 
815 

30572
8fbc355100f2
Library.merge/OrdList.union: optimize the important special case where the tables coincide  NOTE: this changes both the operational behaviour and the result for nonstandard eq/ord notion;
wenzelm
parents:
30570
diff
changeset

816 
fun merge eq (xs, ys) = 
8fbc355100f2
Library.merge/OrdList.union: optimize the important special case where the tables coincide  NOTE: this changes both the operational behaviour and the result for nonstandard eq/ord notion;
wenzelm
parents:
30570
diff
changeset

817 
if pointer_eq (xs, ys) then xs 
8fbc355100f2
Library.merge/OrdList.union: optimize the important special case where the tables coincide  NOTE: this changes both the operational behaviour and the result for nonstandard eq/ord notion;
wenzelm
parents:
30570
diff
changeset

818 
else if null xs then ys 
8fbc355100f2
Library.merge/OrdList.union: optimize the important special case where the tables coincide  NOTE: this changes both the operational behaviour and the result for nonstandard eq/ord notion;
wenzelm
parents:
30570
diff
changeset

819 
else fold_rev (insert eq) ys xs; 
0  820 

26439  821 

822 
(* oldstyle infixes *) 

823 

18923  824 
fun x mem xs = member (op =) xs x; 
825 
fun (x: int) mem_int xs = member (op =) xs x; 

826 
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

827 

233  828 
(*union of sets represented as lists: no repetitions*) 
829 
fun xs union [] = xs 

830 
 [] union ys = ys 

20854  831 
 (x :: xs) union ys = xs union (insert (op =) x ys); 
0  832 

2175
21fde76bc742
Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents:
2157
diff
changeset

833 
(*union of sets, optimized version for ints*) 
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

834 
fun (xs:int list) union_int [] = xs 
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

835 
 [] union_int ys = ys 
20854  836 
 (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

837 

2175
21fde76bc742
Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents:
2157
diff
changeset

838 
(*union of sets, optimized version for strings*) 
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

839 
fun (xs:string list) union_string [] = xs 
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

840 
 [] union_string ys = ys 
20854  841 
 (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

842 

0  843 
(*generalized union*) 
233  844 
fun gen_union eq (xs, []) = xs 
845 
 gen_union eq ([], ys) = ys 

18923  846 
 gen_union eq (x :: xs, ys) = gen_union eq (xs, insert eq x ys); 
233  847 

848 

849 
(*intersection*) 

850 
fun [] inter ys = [] 

851 
 (x :: xs) inter ys = 

852 
if x mem ys then x :: (xs inter ys) else xs inter ys; 

853 

2175
21fde76bc742
Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents:
2157
diff
changeset

854 
(*intersection, optimized version for ints*) 
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

855 
fun ([]:int list) inter_int ys = [] 
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

856 
 (x :: xs) inter_int ys = 
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

857 
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

858 

2175
21fde76bc742
Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents:
2157
diff
changeset

859 
(*intersection, optimized version for strings *) 
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

860 
fun ([]:string list) inter_string ys = [] 
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

861 
 (x :: xs) inter_string ys = 
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

862 
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

863 

7090  864 
(*generalized intersection*) 
865 
fun gen_inter eq ([], ys) = [] 

12284  866 
 gen_inter eq (x::xs, ys) = 
18923  867 
if member eq ys x then x :: gen_inter eq (xs, ys) 
868 
else gen_inter eq (xs, ys); 

7090  869 

233  870 

871 
(*subset*) 

872 
fun [] subset ys = true 

873 
 (x :: xs) subset ys = x mem ys andalso xs subset ys; 

874 

2175
21fde76bc742
Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents:
2157
diff
changeset

875 
(*subset, optimized version for ints*) 
16439  876 
fun ([]: int list) subset_int ys = true 
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

877 
 (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

878 

2175
21fde76bc742
Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents:
2157
diff
changeset

879 
(*subset, optimized version for strings*) 
16439  880 
fun ([]: string list) subset_string ys = true 
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

881 
 (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

882 

4363  883 
(*set equality*) 
884 
fun eq_set (xs, ys) = 

885 
xs = ys orelse (xs subset ys andalso ys subset xs); 

886 

2182
29e56f003599
Removal of polymorphic equality via mem, subset, eq_set, etc
paulson
parents:
2175
diff
changeset

887 
(*set equality for strings*) 
16439  888 
fun eq_set_string ((xs: string list), ys) = 
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

889 
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

890 

18923  891 
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

892 

19301  893 
fun gen_eq_set eq (xs, ys) = 
20348  894 
eq_list eq (xs, ys) orelse 
19301  895 
(gen_subset eq (xs, ys) andalso gen_subset (eq o swap) (ys, xs)); 
896 

265  897 

233  898 
(*removing an element from a list WITHOUT duplicates*) 
899 
fun (y :: ys) \ x = if x = y then ys else y :: (ys \ x) 

900 
 [] \ x = []; 

2243
3ebeaaacfbd1
Etaexpanded some declarations that are illegal under value polymorphism
paulson
parents:
2196
diff
changeset

901 
fun ys \\ xs = foldl (op \) (ys,xs); 
0  902 

233  903 

904 
(*makes a list of the distinct members of the input; preserves order, takes 

905 
first of equal elements*) 

19046
bc5c6c9b114e
removed distinct, renamed gen_distinct to distinct;
wenzelm
parents:
19011
diff
changeset

906 
fun distinct eq lst = 
233  907 
let 
908 
fun dist (rev_seen, []) = rev rev_seen 

909 
 dist (rev_seen, x :: xs) = 

18923  910 
if member eq rev_seen x then dist (rev_seen, xs) 
233  911 
else dist (x :: rev_seen, xs); 
19046
bc5c6c9b114e
removed distinct, renamed gen_distinct to distinct;
wenzelm
parents:
19011
diff
changeset

912 
in dist ([], lst) end; 
233  913 

255
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset

914 
(*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

915 
order, takes first of equal elements*) 
18966  916 
fun duplicates eq lst = 
255
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset

917 
let 
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset

918 
fun dups (rev_dups, []) = rev rev_dups 
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset

919 
 dups (rev_dups, x :: xs) = 
18923  920 
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

921 
dups (rev_dups, xs) 
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset

922 
else dups (x :: rev_dups, xs); 
18966  923 
in dups ([], lst) end; 
255
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset

924 

16878  925 
fun has_duplicates eq = 
926 
let 

927 
fun dups [] = false 

928 
 dups (x :: xs) = member eq xs x orelse dups xs; 

929 
in dups end; 

930 

255
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset

931 

23220  932 

22142  933 
(** lists as multisets **) 
934 

935 
fun remove1 _ _ [] = raise Empty 

23220  936 
 remove1 eq y (x::xs) = if eq (y, x) then xs else x :: remove1 eq y xs; 
22142  937 

23220  938 
fun submultiset _ ([], _) = true 
939 
 submultiset eq (x :: xs, ys) = member eq ys x andalso submultiset eq (xs, remove1 eq x ys); 

233  940 

0  941 

942 

2506  943 
(** orders **) 
944 

18966  945 
fun is_equal EQUAL = true 
946 
 is_equal _ = false; 

947 

4445  948 
fun rev_order LESS = GREATER 
949 
 rev_order EQUAL = EQUAL 

950 
 rev_order GREATER = LESS; 

951 

4479  952 
(*assume rel is a linear strict order*) 
4445  953 
fun make_ord rel (x, y) = 
954 
if rel (x, y) then LESS 

955 
else if rel (y, x) then GREATER 

956 
else EQUAL; 

957 

25224  958 
fun bool_ord (false, true) = LESS 
959 
 bool_ord (true, false) = GREATER 

960 
 bool_ord _ = EQUAL; 

961 

15051
0dbbab9f77fe
int_ord = Int.compare, string_ord = String.compare;
wenzelm
parents:
15035
diff
changeset

962 
val int_ord = Int.compare; 
0dbbab9f77fe
int_ord = Int.compare, string_ord = String.compare;
wenzelm
parents:
15035
diff
changeset

963 
val string_ord = String.compare; 
2506  964 

16676  965 
fun fast_string_ord (s1, s2) = 
966 
(case int_ord (size s1, size s2) of EQUAL => string_ord (s1, s2)  ord => ord); 

967 

16492  968 
fun option_ord ord (SOME x, SOME y) = ord (x, y) 
969 
 option_ord _ (NONE, NONE) = EQUAL 

970 
 option_ord _ (NONE, SOME _) = LESS 

971 
 option_ord _ (SOME _, NONE) = GREATER; 

972 

4343  973 
(*lexicographic product*) 
974 
fun prod_ord a_ord b_ord ((x, y), (x', y')) = 

975 
(case a_ord (x, x') of EQUAL => b_ord (y, y')  ord => ord); 

976 

977 
(*dictionary order  in general NOT wellfounded!*) 

16984  978 
fun dict_ord elem_ord (x :: xs, y :: ys) = 
979 
(case elem_ord (x, y) of EQUAL => dict_ord elem_ord (xs, ys)  ord => ord) 

980 
 dict_ord _ ([], []) = EQUAL 

4343  981 
 dict_ord _ ([], _ :: _) = LESS 
16984  982 
 dict_ord _ (_ :: _, []) = GREATER; 
4343  983 

984 
(*lexicographic product of lists*) 

985 
fun list_ord elem_ord (xs, ys) = 

16676  986 
(case int_ord (length xs, length ys) of EQUAL => dict_ord elem_ord (xs, ys)  ord => ord); 
4343  987 

2506  988 

4621  989 
(* sorting *) 
990 

18427  991 
(*quicksort  stable, i.e. does not reorder equal elements*) 
992 
fun quicksort unique ord = 

4621  993 
let 
16878  994 
fun qsort [] = [] 
995 
 qsort (xs as [_]) = xs 

18427  996 
 qsort (xs as [x, y]) = 
997 
(case ord (x, y) of 

998 
LESS => xs 

999 
 EQUAL => if unique then [x] else xs 

1000 
 GREATER => [y, x]) 

16878  1001 
 qsort xs = 
18011
685d95c793ff
cleaned up nth, nth_update, nth_map and nth_string functions
haftmann
parents:
17952
diff
changeset

1002 
let val (lts, eqs, gts) = part (nth xs (length xs div 2)) xs 
16878  1003 
in qsort lts @ eqs @ qsort gts end 
4621  1004 
and part _ [] = ([], [], []) 
1005 
 part pivot (x :: xs) = add (ord (x, pivot)) x (part pivot xs) 

1006 
and add LESS x (lts, eqs, gts) = (x :: lts, eqs, gts) 

18427  1007 
 add EQUAL x (lts, [], gts) = (lts, [x], gts) 
1008 
 add EQUAL x (res as (lts, eqs, gts)) = if unique then res else (lts, x :: eqs, gts) 

4621  1009 
 add GREATER x (lts, eqs, gts) = (lts, eqs, x :: gts); 
1010 
in qsort end; 

1011 

18427  1012 
fun sort ord = quicksort false ord; 
1013 
fun sort_distinct ord = quicksort true ord; 

1014 

4621  1015 
val sort_strings = sort string_ord; 
1016 
fun sort_wrt sel xs = sort (string_ord o pairself sel) xs; 

1017 

1018 

30558
2ef9892114fd
renamed Tactic.taglist/untaglist/orderlist to tag_list/untag_list/order_list (in library.ML);
wenzelm
parents:
30190
diff
changeset

1019 
(* items tagged by integer index *) 
2ef9892114fd
renamed Tactic.taglist/untaglist/orderlist to tag_list/untag_list/order_list (in library.ML);
wenzelm
parents:
30190
diff
changeset

1020 

2ef9892114fd
renamed Tactic.taglist/untaglist/orderlist to tag_list/untag_list/order_list (in library.ML);
wenzelm
parents:
30190
diff
changeset

1021 
(*insert tags*) 
2ef9892114fd
renamed Tactic.taglist/untaglist/orderlist to tag_list/untag_list/order_list (in library.ML);
wenzelm
parents:
30190
diff
changeset

1022 
fun tag_list k [] = [] 
30570  1023 
 tag_list k (x :: xs) = (k:int, x) :: tag_list (k + 1) xs; 
30558
2ef9892114fd
renamed Tactic.taglist/untaglist/orderlist to tag_list/untag_list/order_list (in library.ML);
wenzelm
parents:
30190
diff
changeset

1024 

2ef9892114fd
renamed Tactic.taglist/untaglist/orderlist to tag_list/untag_list/order_list (in library.ML);
wenzelm
parents:
30190
diff
changeset

1025 
(*remove tags and suppress duplicates  list is assumed sorted!*) 
2ef9892114fd
renamed Tactic.taglist/untaglist/orderlist to tag_list/untag_list/order_list (in library.ML);
wenzelm
parents:
30190
diff
changeset

1026 
fun untag_list [] = [] 
2ef9892114fd
renamed Tactic.taglist/untaglist/orderlist to tag_list/untag_list/order_list (in library.ML);
wenzelm
parents:
30190
diff
changeset

1027 
 untag_list [(k: int, x)] = [x] 
2ef9892114fd
renamed Tactic.taglist/untaglist/orderlist to tag_list/untag_list/order_list (in library.ML);
wenzelm
parents:
30190
diff
changeset

1028 
 untag_list ((k, x) :: (rest as (k', x') :: _)) = 
2ef9892114fd
renamed Tactic.taglist/untaglist/orderlist to tag_list/untag_list/order_list (in library.ML);
wenzelm
parents:
30190
diff
changeset

1029 
if k = k' then untag_list rest 
2ef9892114fd
renamed Tactic.taglist/untaglist/orderlist to tag_list/untag_list/order_list (in library.ML);
wenzelm
parents:
30190
diff
changeset

1030 
else x :: untag_list rest; 
2ef9892114fd
renamed Tactic.taglist/untaglist/orderlist to tag_list/untag_list/order_list (in library.ML);
wenzelm
parents:
30190
diff
changeset

1031 

2ef9892114fd
renamed Tactic.taglist/untaglist/orderlist to tag_list/untag_list/order_list (in library.ML);
wenzelm
parents:
30190
diff
changeset

1032 
(*return list elements in original order*) 
2ef9892114fd
renamed Tactic.taglist/untaglist/orderlist to tag_list/untag_list/order_list (in library.ML);
wenzelm
parents:
30190
diff
changeset

1033 
fun order_list list = untag_list (sort (int_ord o pairself fst) list); 
2ef9892114fd
renamed Tactic.taglist/untaglist/orderlist to tag_list/untag_list/order_list (in library.ML);
wenzelm
parents:
30190
diff
changeset

1034 

2ef9892114fd
renamed Tactic.taglist/untaglist/orderlist to tag_list/untag_list/order_list (in library.ML);
wenzelm
parents:
30190
diff
changeset

1035 

2506  1036 

14106
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset

1037 
(** random numbers **) 
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset

1038 

bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset

1039 
exception RANDOM; 
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset

1040 

14618
068bb99f3ebd
Fixed bug in rmod that caused an overflow exception in SML/NJ.
berghofe
parents:
14472
diff
changeset

1041 
fun rmod x y = x  y * Real.realFloor (x / y); 
14106
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset

1042 

bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset

1043 
local 
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset

1044 
val a = 16807.0; 
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset

1045 
val m = 2147483647.0; 
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset

1046 
val random_seed = ref 1.0; 
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset

1047 
in 
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset

1048 

23922
707639e9497d
marked some CRITICAL sections (for multithreading);
wenzelm
parents:
23860
diff
changeset

1049 
fun random () = CRITICAL (fn () => 
707639e9497d
marked some CRITICAL sections (for multithreading);
wenzelm
parents:
23860
diff
changeset

1050 
let val r = rmod (a * ! random_seed) m 
707639e9497d
marked some CRITICAL sections (for multithreading);
wenzelm
parents:
23860
diff
changeset

1051 
in (random_seed := r; r) end); 
14106
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset

1052 

bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset

1053 
end; 
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset

1054 

bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset

1055 
fun random_range l h = 
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset

1056 
if h < l orelse l < 0 then raise RANDOM 
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset

1057 
else l + Real.floor (rmod (random ()) (real (h  l + 1))); 
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset

1058 

18011
685d95c793ff
cleaned up nth, nth_update, nth_map and nth_string functions
haftmann
parents:
17952
diff
changeset

1059 
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

1060 

bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset

1061 
fun frequency xs = 
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset

1062 
let 
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset

1063 
val sum = foldl op + (0, map fst xs); 
17756  1064 
fun pick n ((k: int, x) :: xs) = 
14106
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset

1065 
if n <= k then x else pick (n  k) xs 
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset

1066 
in pick (random_range 1 sum) xs end; 
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset

1067 

bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset

1068 

23220  1069 

4621  1070 
(** misc **) 
233  1071 

19644
0b01436e1843
added divide_and_conquer combinator (by Amine Chaieb);
wenzelm
parents:
19596
diff
changeset

1072 
fun divide_and_conquer decomp x = 
0b01436e1843
added divide_and_conquer combinator (by Amine Chaieb);
wenzelm
parents:
19596
diff
changeset

1073 
let val (ys, recomb) = decomp x 
0b01436e1843
added divide_and_conquer combinator (by Amine Chaieb);
wenzelm
parents:
19596
diff
changeset

1074 
in recomb (map (divide_and_conquer decomp) ys) end; 
0b01436e1843
added divide_and_conquer combinator (by Amine Chaieb);
wenzelm
parents:
19596
diff
changeset

1075 

0  1076 

233  1077 
(*Partition a list into buckets [ bi, b(i+1), ..., bj ] 
0  1078 
putting x in bk if p(k)(x) holds. Preserve order of elements if possible.*) 
1079 
fun partition_list p i j = 

233  1080 
let fun part k xs = 
1081 
if k>j then 

0  1082 
(case xs of [] => [] 
15570  1083 
 _ => raise Fail "partition_list") 
0  1084 
else 
19691  1085 
let val (ns, rest) = List.partition (p k) xs; 
233  1086 
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

1087 
in part (i: int) end; 
0  1088 

19691  1089 
fun partition_eq (eq:'a * 'a > bool) = 
1090 
let 

1091 
fun part [] = [] 

1092 
 part (x :: ys) = 

1093 
let val (xs, xs') = List.partition (fn y => eq (x, y)) ys 

1094 
in (x::xs)::(part xs') end 

1095 
in part end; 

1096 

1097 

0  1098 

233  1099 
(* generating identifiers *) 
0  1100 

4063  1101 
(** Freshly generated identifiers; supplied prefix MUST start with a letter **) 
22369  1102 
local 
1103 
(*Maps 061 to AZ, az, 09; 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

1104 
fun gensym_char i = 
22368
0e0fe77d4768
gensym no longer includes ' or _ in names (trailing _ is bad)
paulson
parents:
22256
diff
changeset

1105 
if i<26 then chr (ord "A" + i) 
0e0fe77d4768
gensym no longer includes ' or _ in names (trailing _ is bad)
paulson
parents:
22256
diff
changeset

1106 
else if i<52 then chr (ord "a" + i  26) 
22369  1107 
else chr (ord "0" + i  52); 
4063  1108 

22369  1109 
val char_vec = Vector.tabulate (62, gensym_char); 
1110 
fun newid n = implode (map (fn i => Vector.sub (char_vec, i)) (radixpand (62, n))); 

4284  1111 

24593
1547ea587f5a
added some int constraints (ML_Parse.fix_ints not active here);
wenzelm
parents:
24148
diff
changeset

1112 
val gensym_seed = ref (0: int); 
2003  1113 

22369  1114 
in 
24148  1115 
fun gensym pre = pre ^ newid (NAMED_CRITICAL "gensym" (fn () => inc gensym_seed)); 
22369  1116 
end; 
4063  1117 

1118 

16439  1119 
(* stamps and serial numbers *) 
1120 

1121 
type stamp = unit ref; 

1122 
val stamp: unit > stamp = ref; 

1123 

1124 
type serial = int; 

25702
a61554b1e7a9
serial: now based on specific version in structure Multithreading;
wenzelm
parents:
25681
diff
changeset

1125 
val serial = Multithreading.serial; 
19512  1126 
val serial_string = string_of_int o serial; 
1127 

16535
86c9eada525b
added structure Object (from Pure/General/object.ML);
wenzelm
parents:
16492
diff
changeset

1128 

86c9eada525b
added structure Object (from Pure/General/object.ML);
wenzelm
parents:
16492
diff
changeset

1129 
(* generic objects *) 
86c9eada525b
added structure Object (from Pure/General/object.ML);
wenzelm
parents:
16492
diff
changeset

1130 

86c9eada525b
added structure Object (from Pure/General/object.ML);
wenzelm
parents:
16492
diff
changeset

1131 
(*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

1132 
constructors at any time*) 
86c9eada525b
added structure Object (from Pure/General/object.ML);
wenzelm
parents:
16492
diff
changeset

1133 
structure Object = struct type T = exn end; 
86c9eada525b
added structure Object (from Pure/General/object.ML);
wenzelm
parents:
16492
diff
changeset

1134 

1364
8ea1a962ad72
files now define a structure to allow SML/NJ to optimize the code
clasohm
parents:
1290
diff
changeset

1135 
end; 
8ea1a962ad72
files now define a structure to allow SML/NJ to optimize the code
clasohm
parents:
1290
diff
changeset

1136 

32188  1137 
structure Basic_Library: BASIC_LIBRARY = Library; 
1138 
open Basic_Library; 