author  haftmann 
Mon, 10 Aug 2009 12:24:47 +0200  
changeset 32352  4839a704939a 
parent 32188  005f9abae1e3 
child 32737  76fa673eee8b 
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 

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

125 
(*integers*) 

126 
val inc: int ref > int 

127 
val dec: int ref > int 

128 
val upto: int * int > int list 

129 
val downto: int * int > int list 

130 
val radixpand: int * int > int list 

131 
val radixstring: int * string * int > string 

132 
val string_of_int: int > string 

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

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

135 
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

136 
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

137 
val oct_char: string > string 
4621  138 

139 
(*strings*) 

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

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

149 
val commas: string list > string 

150 
val commas_quote: string list > string 

151 
val cat_lines: string list > string 

152 
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

153 
val split_lines: string > string list 
5942  154 
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

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

157 
val unprefix: string > string > string 
5285  158 
val unsuffix: string > string > string 
10951  159 
val replicate_string: int > string > string 
14926  160 
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

161 
val match_string: string > string > bool 
4621  162 

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

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

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

172 
val mem_string: string * string list > bool 

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

174 
val union_int: int list * int list > int list 

175 
val union_string: string list * string list > string list 

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

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

180 
val inter_string: string list * string list > string list 

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

182 
val subset_int: int list * int list > bool 

183 
val subset_string: string list * string list > bool 

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

185 
val eq_set_string: string list * string list > bool 

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

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

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

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

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

198 
(*orders*) 

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

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

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

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

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

18427  211 
val sort_distinct: ('a * 'a > order) > 'a list > 'a list 
4621  212 
val sort_strings: string list > string list 
213 
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

214 
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

215 
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

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

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

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

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

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

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

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

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

224 

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

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

229 
val gensym: string > string 

16439  230 
type stamp 
231 
val stamp: unit > stamp 

232 
type serial 

233 
val serial: unit > serial 

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

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

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

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

246 
val last_elem: 'a list > 'a 

247 
end; 

248 

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

250 
struct 
0  251 

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

252 
(* functions *) 
0  253 

23860  254 
fun undefined _ = raise Match; 
255 

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

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

0  260 

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

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

263 

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

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

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

268 

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

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

160  272 

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

160  275 

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

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

277 

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

280 

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

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

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

283 

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

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

285 
 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

286 

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

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

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

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

290 
 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

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

292 

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

293 

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

294 
(* pairs *) 
233  295 

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

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

298 

299 
fun fst (x, y) = x; 

300 
fun snd (x, y) = y; 

301 

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

302 
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

303 
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

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

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

307 

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

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

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

312 

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

313 
(* booleans *) 
233  314 

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

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

318 

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

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

233  322 

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

0  325 

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

326 

380  327 
(* flags *) 
328 

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

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

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

332 

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

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

340 
val orig_value = ! flag; 

341 
val _ = flag := value; 

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

343 
val _ = flag := orig_value; 

344 
in Exn.release result end) (); 

2958  345 

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

23932  348 

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

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

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

357 

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

358 

233  359 
(** lists **) 
360 

15570  361 
exception UnequalLengths; 
233  362 

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

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

367 

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

19273  369 

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

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

374 

25058  375 
fun perhaps_apply funs arg = 
376 
let 

377 
fun app [] res = res 

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

379 
(case f x of 

380 
NONE => app fs (changed, x) 

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

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

383 

384 
fun perhaps_loop f arg = 

385 
let 

386 
fun loop (changed, x) = 

387 
(case f x of 

388 
NONE => (changed, x) 

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

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

391 

233  392 

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

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

394 

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

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

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

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

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

402 
in itl end; 

403 

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

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

406 
fun foldr f (l, e) = 

407 
let fun itr [] = e 

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

409 
in itr l end; 

410 

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

413 
fun foldl1 f [] = raise Empty 

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

415 

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

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

16705  424 
fun foldl_map f = 
425 
let 

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

427 
 fold_aux (x, y :: ys) = 

428 
let 

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

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

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

432 
in fold_aux end; 

433 

233  434 

435 
(* basic list functions *) 

436 

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

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

20348  442 

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

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

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

445 

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

448 
val map_filter = List.mapPartial; 

449 

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

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

19011  453 

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

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

458 

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

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

0  463 

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

466 

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

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

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

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

473 
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

474 
 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

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

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

479 

18514  480 
fun map_index f = 
481 
let 

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

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

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

21118  486 
fun fold_index f = 
487 
let 

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

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

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

15570  492 
val last_elem = List.last; 
233  493 

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

498 

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

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

3762  504 

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

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

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

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

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

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

514 

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

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

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

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

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

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

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

523 

15531  524 
val flat = List.concat; 
233  525 

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

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

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

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

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

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

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

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

541 
 separate _ xs = xs; 

542 

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

545 

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

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

550 
in 

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

554 

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

555 

25549  556 
(* direct product *) 
557 

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

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

233  561 

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

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

233  565 

25549  566 

567 
(* lists of pairs *) 

233  568 

15570  569 
exception UnequalLengths; 
570 

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

573 
 map2 _ _ _ = raise UnequalLengths; 

380  574 

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

577 
 fold2 f _ _ _ = raise UnequalLengths; 

380  578 

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

581 
let 

582 
val (y, w) = f x; 

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

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

585 

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

588 
 zip_options _ [] = [] 

589 
 zip_options [] _ = raise UnequalLengths; 

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

590 

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

593 
fun [] ~~ [] = [] 

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

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

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

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

15570  599 
val split_list = ListPair.unzip; 
233  600 

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

233  603 

604 
(* prefixes, suffixes *) 

605 

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

608 
 is_prefix eq _ _ = false; 

233  609 

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

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

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

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

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

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

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

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

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

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

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

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

629 
 take_suffix pred (x :: xs) = 

630 
(case take_suffix pred xs of 

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

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

633 

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

636 

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

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

23220  642 

643 

233  644 
(** integers **) 
645 

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

646 
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

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

649 

650 
(* lists of integers *) 

651 

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

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

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

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

660 

661 
(* convert integers to strings *) 

662 

663 
(*expand the number in the given base; 

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

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

666 
let 

667 
fun radix (n, tail) = 

668 
if n < base then n :: tail 

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

670 
in radix (num, []) end; 

671 

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

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

674 
fun radixstring (base, zerochar, num) = 

675 
let val offset = ord zerochar; 

676 
fun chrof n = chr (offset + n) 

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

678 

679 

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

680 
val string_of_int = Int.toString; 
233  681 

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

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

683 
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

684 

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

233  687 

688 

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

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

690 

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

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

694 
val limit = zero + radix; 

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

696 
 scan (num, c :: cs) = 

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

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

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

700 
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

701 

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

702 
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

703 

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

704 
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

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 

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

707 

233  708 
(** strings **) 
709 

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

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

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

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

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

722 
in iter (x0, 0) end; 

6282  723 

14968  724 
fun exists_string pred str = 
725 
let 

726 
val n = size str; 

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

728 
in ex 0 end; 

6312  729 

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

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

737 
if i + n > len then NONE 

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

742 
NONE => NONE 

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

744 
end; 

28022  745 

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

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

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

749 

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

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

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

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

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

758 

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

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

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

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

765 

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

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

767 

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

768 
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

769 
 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

770 

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

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

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

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

775 
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

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

777 

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

5285  781 

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

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

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

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

787 

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

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

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

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

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

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

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

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

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

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

798 
 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

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

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

26439  803 
(* canonical operations *) 
804 

18923  805 
fun member eq list x = 
806 
let 

807 
fun memb [] = false 

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

809 
in memb list end; 

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

810 

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

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

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

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

817 
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

818 
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

819 
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

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

26439  822 

823 
(* oldstyle infixes *) 

824 

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

827 
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

828 

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

831 
 [] union ys = ys 

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

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

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

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

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

838 

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

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

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

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

843 

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

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

849 

850 
(*intersection*) 

851 
fun [] inter ys = [] 

852 
 (x :: xs) inter ys = 

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

854 

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

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

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

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

858 
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

859 

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

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

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

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

863 
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

864 

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

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

7090  870 

233  871 

872 
(*subset*) 

873 
fun [] subset ys = true 

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

875 

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

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

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

879 

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

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

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

883 

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

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

887 

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

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

890 
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

891 

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

893 

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

265  898 

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

901 
 [] \ x = []; 

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

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

233  904 

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

906 
first of equal elements*) 

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

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

910 
 dist (rev_seen, x :: xs) = 

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

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

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

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

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

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

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

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

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

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

925 

16878  926 
fun has_duplicates eq = 
927 
let 

928 
fun dups [] = false 

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

930 
in dups end; 

931 

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

932 

32352  933 
(* matrices *) 
934 

935 
fun map_transpose f xss = 

936 
let 

937 
val n = case distinct (op =) (map length xss) 

938 
of [] => 0 

939 
 [n] => n 

940 
 _ => raise UnequalLengths; 

941 
in map (fn m => f (map (fn xs => nth xs m) xss)) (0 upto n  1) end; 

942 

943 

23220  944 

22142  945 
(** lists as multisets **) 
946 

947 
fun remove1 _ _ [] = raise Empty 

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

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

233  952 

0  953 

954 

2506  955 
(** orders **) 
956 

18966  957 
fun is_equal EQUAL = true 
958 
 is_equal _ = false; 

959 

4445  960 
fun rev_order LESS = GREATER 
961 
 rev_order EQUAL = EQUAL 

962 
 rev_order GREATER = LESS; 

963 

4479  964 
(*assume rel is a linear strict order*) 
4445  965 
fun make_ord rel (x, y) = 
966 
if rel (x, y) then LESS 

967 
else if rel (y, x) then GREATER 

968 
else EQUAL; 

969 

25224  970 
fun bool_ord (false, true) = LESS 
971 
 bool_ord (true, false) = GREATER 

972 
 bool_ord _ = EQUAL; 

973 

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

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

975 
val string_ord = String.compare; 
2506  976 

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

979 

16492  980 
fun option_ord ord (SOME x, SOME y) = ord (x, y) 
981 
 option_ord _ (NONE, NONE) = EQUAL 

982 
 option_ord _ (NONE, SOME _) = LESS 

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

984 

4343  985 
(*lexicographic product*) 
986 
fun prod_ord a_ord b_ord ((x, y), (x', y')) = 

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

988 

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

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

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

4343  993 
 dict_ord _ ([], _ :: _) = LESS 
16984  994 
 dict_ord _ (_ :: _, []) = GREATER; 
4343  995 

996 
(*lexicographic product of lists*) 

997 
fun list_ord elem_ord (xs, ys) = 

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

2506  1000 

4621  1001 
(* sorting *) 
1002 

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

4621  1005 
let 
16878  1006 
fun qsort [] = [] 
1007 
 qsort (xs as [_]) = xs 

18427  1008 
 qsort (xs as [x, y]) = 
1009 
(case ord (x, y) of 

1010 
LESS => xs 

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

1012 
 GREATER => [y, x]) 

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

1014 
let val (lts, eqs, gts) = part (nth xs (length xs div 2)) xs 
16878  1015 
in qsort lts @ eqs @ qsort gts end 
4621  1016 
and part _ [] = ([], [], []) 
1017 
 part pivot (x :: xs) = add (ord (x, pivot)) x (part pivot xs) 

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

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

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

1023 

18427  1024 
fun sort ord = quicksort false ord; 
1025 
fun sort_distinct ord = quicksort true ord; 

1026 

4621  1027 
val sort_strings = sort string_ord; 
1028 
fun sort_wrt sel xs = sort (string_ord o pairself sel) xs; 

1029 

1030 

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

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

1032 

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

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

1034 
fun tag_list k [] = [] 
30570  1035 
 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

1036 

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

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

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

1039 
 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

1040 
 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

1041 
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

1042 
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

1043 

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

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

1045 
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

1046 

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

1047 

2506  1048 

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

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

1050 

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

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

1052 

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

1053 
fun rmod x y = x  y * Real.realFloor (x / y); 
14106
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 
local 
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset

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

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

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

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

1060 

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

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

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

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

1064 

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

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

1066 

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

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

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

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

1070 

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

1071 
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

1072 

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

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

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

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

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

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

1079 

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

1080 

23220  1081 

4621  1082 
(** misc **) 
233  1083 

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

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

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

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

1087 

0  1088 

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

233  1092 
let fun part k xs = 
1093 
if k>j then 

0  1094 
(case xs of [] => [] 
15570  1095 
 _ => raise Fail "partition_list") 
0  1096 
else 
19691  1097 
let val (ns, rest) = List.partition (p k) xs; 
233  1098 
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

1099 
in part (i: int) end; 
0  1100 

19691  1101 
fun partition_eq (eq:'a * 'a > bool) = 
1102 
let 

1103 
fun part [] = [] 

1104 
 part (x :: ys) = 

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

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

1107 
in part end; 

1108 

1109 

0  1110 

233  1111 
(* generating identifiers *) 
0  1112 

4063  1113 
(** Freshly generated identifiers; supplied prefix MUST start with a letter **) 
22369  1114 
local 
1115 
(*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

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

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

1118 
else if i<52 then chr (ord "a" + i  26) 
22369  1119 
else chr (ord "0" + i  52); 
4063  1120 

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

4284  1123 

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

1124 
val gensym_seed = ref (0: int); 
2003  1125 

22369  1126 
in 
24148  1127 
fun gensym pre = pre ^ newid (NAMED_CRITICAL "gensym" (fn () => inc gensym_seed)); 
22369  1128 
end; 
4063  1129 

1130 

16439  1131 
(* stamps and serial numbers *) 
1132 

1133 
type stamp = unit ref; 

1134 
val stamp: unit > stamp = ref; 

1135 

1136 
type serial = int; 

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

1137 
val serial = Multithreading.serial; 
19512  1138 
val serial_string = string_of_int o serial; 
1139 

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

1140 

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

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

1142 

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

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

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

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

1146 

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

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

1148 

32188  1149 
structure Basic_Library: BASIC_LIBRARY = Library; 
1150 
open Basic_Library; 