author  krauss 
Fri, 03 Dec 2010 10:17:55 +0100  
changeset 40930  500171e7aa59 
parent 40925  7abeb749ae99 
child 40936  10aeae27c7a6 
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 
36692
54b64d4ad524
farewell to oldstyle mem infixes  type inference in situations with mem_int and mem_string should provide enough information to resolve the type of (op =)
haftmann
parents:
35976
diff
changeset

14 
infix orf andf 
5893  15 

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

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

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

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

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

16842  28 
val funpow: int > ('a > 'a) > 'a > 'a 
31250  29 
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

30 

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

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

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

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

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

35 
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

36 

4621  37 
(*pairs*) 
38 
val pair: 'a > 'b > 'a * 'b 

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

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

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

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

42 
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

43 
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

44 
val eq_pair: ('a * 'c > bool) > ('b * 'd > bool) > ('a * 'b) * ('c * 'd) > bool 
4621  45 
val swap: 'a * 'b > 'b * 'a 
46 
val apfst: ('a > 'b) > 'a * 'c > 'b * 'c 

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

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

49 

50 
(*booleans*) 

51 
val equal: ''a > ''a > bool 

52 
val not_equal: ''a > ''a > bool 

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

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

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

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

32966
5b21661fe618
indicate CRITICAL nature of various setmp combinators;
wenzelm
parents:
32737
diff
changeset

57 
val setmp_CRITICAL: 'a Unsynchronized.ref > 'a > ('b > 'c) > 'b > 'c 
25797  58 
val setmp_thread_data: 'a Universal.tag > 'a > 'a > ('b > 'c) > 'b > 'c 
4621  59 

60 
(*lists*) 

5285  61 
val single: 'a > 'a list 
20882  62 
val the_single: 'a list > 'a 
19273  63 
val singleton: ('a list > 'b list) > 'a > 'b 
25061  64 
val yield_singleton: ('a list > 'c > 'b list * 'c) > 'a > 'c > 'b * 'c 
5904  65 
val apply: ('a > 'a) list > 'a > 'a 
25058  66 
val perhaps_apply: ('a > 'a option) list > 'a > 'a option 
67 
val perhaps_loop: ('a > 'a option) > 'a > 'a option 

25681  68 
val foldl1: ('a * 'a > 'a) > 'a list > 'a 
15760  69 
val foldr1: ('a * 'a > 'a) > 'a list > 'a 
19461  70 
val flat: 'a list list > 'a list 
19424  71 
val unflat: 'a list list > 'b list > 'b list list 
18441  72 
val burrow: ('a list > 'b list) > 'a list list > 'b list list 
24864  73 
val burrow_options: ('a list > 'b list) > 'a option list > 'b option list 
28347  74 
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

75 
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

76 
val maps: ('a > 'b list) > 'a list > 'b list 
25549  77 
val filter: ('a > bool) > 'a list > 'a list 
78 
val filter_out: ('a > bool) > 'a list > 'a list 

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

33955  80 
val take: int > 'a list > 'a list 
81 
val drop: int > 'a list > 'a list 

19011  82 
val chop: int > 'a list > 'a list * 'a list 
39811  83 
val chop_while: ('a > bool) > 'a list > 'a list * 'a list 
18278  84 
val nth: 'a list > int > 'a 
18011
685d95c793ff
cleaned up nth, nth_update, nth_map and nth_string functions
haftmann
parents:
17952
diff
changeset

85 
val nth_map: int > ('a > 'a) > 'a list > 'a list 
24846  86 
val nth_drop: int > 'a list > 'a list 
18286  87 
val nth_list: 'a list list > int > 'a list 
18514  88 
val map_index: (int * 'a > 'b) > 'a list > 'b list 
89 
val fold_index: (int * 'a > 'b > 'b) > 'a list > 'b > 'b 

33063  90 
val map_range: (int > 'a) > int > 'a list 
4621  91 
val split_last: 'a list > 'a list * 'a 
92 
val find_index: ('a > bool) > 'a list > int 

93 
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

94 
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

95 
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

96 
val eq_list: ('a * 'b > bool) > 'a list * 'b list > bool 
18330  97 
val map2: ('a > 'b > 'c) > 'a list > 'b list > 'c list 
98 
val fold2: ('a > 'b > 'c > 'c) > 'a list > 'b list > 'c > 'c 

40721  99 
val fold_rev2: ('a > 'b > 'c > 'c) > 'a list > 'b list > 'c > 'c 
40564  100 
val forall2: ('a > 'b > bool) > 'a list > 'b list > bool 
19799  101 
val zip_options: 'a list > 'b option list > ('a * 'b) list 
18330  102 
val ~~ : 'a list * 'b list > ('a * 'b) list 
25943  103 
val map_split: ('a > 'b * 'c) > 'a list > 'b list * 'c list 
18330  104 
val split_list: ('a * 'b) list > 'a list * 'b list 
26449  105 
val map_product: ('a > 'b > 'c) > 'a list > 'b list > 'c list 
106 
val fold_product: ('a > 'b > 'c > 'c) > 'a list > 'b list > 'c > 'c 

32352  107 
val map_transpose: ('a list > 'b) > 'a list list > 'b list 
4621  108 
val separate: 'a > 'a list > 'a list 
25980  109 
val surround: 'a > 'a list > 'a list 
4621  110 
val replicate: int > 'a > 'a list 
18441  111 
val is_prefix: ('a * 'a > bool) > 'a list > 'a list > bool 
4621  112 
val take_prefix: ('a > bool) > 'a list > 'a list * 'a list 
20108  113 
val chop_prefix: ('a * 'b > bool) > 'a list * 'b list > 'a list * ('a list * 'b list) 
4621  114 
val take_suffix: ('a > bool) > 'a list > 'a list * 'a list 
12249  115 
val prefixes1: 'a list > 'a list list 
19011  116 
val prefixes: 'a list > 'a list list 
12249  117 
val suffixes1: 'a list > 'a list list 
19011  118 
val suffixes: 'a list > 'a list list 
4621  119 

120 
(*integers*) 

121 
val upto: int * int > int list 

122 
val downto: int * int > int list 

123 
val radixpand: int * int > int list 

124 
val radixstring: int * string * int > string 

125 
val string_of_int: int > string 

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

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

128 
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

129 
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

130 
val oct_char: string > string 
4621  131 

40291  132 
(*reals*) 
133 
val string_of_real: real > string 

134 
val signed_string_of_real: real > string 

135 

4621  136 
(*strings*) 
18011
685d95c793ff
cleaned up nth, nth_update, nth_map and nth_string functions
haftmann
parents:
17952
diff
changeset

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

146 
val commas: string list > string 

147 
val commas_quote: string list > string 

148 
val cat_lines: string list > string 

149 
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

150 
val split_lines: string > string list 
5942  151 
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

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

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

158 
val match_string: string > string > bool 
4621  159 

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

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

24049  164 
val update: ('a * 'a > bool) > 'a > 'a list > 'a list 
33042  165 
val union: ('a * 'a > bool) > 'a list > 'a list > 'a list 
19301  166 
val subtract: ('b * 'a > bool) > 'b list > 'a list > 'a list 
33049
c38f02fdf35d
curried inter as canonical list operation (beware of argument order)
haftmann
parents:
33040
diff
changeset

167 
val inter: ('a * 'b > bool) > 'b list > 'a list > 'a list 
18923  168 
val merge: ('a * 'a > bool) > 'a list * 'a list > 'a list 
33038  169 
val subset: ('a * 'b > bool) > 'a list * 'b list > bool 
170 
val eq_set: ('a * 'b > bool) > 'a list * 'b list > bool 

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

171 
val distinct: ('a * 'a > bool) > 'a list > 'a list 
18966  172 
val duplicates: ('a * 'a > bool) > 'a list > 'a list 
16878  173 
val has_duplicates: ('a * 'a > bool) > 'a list > bool 
4621  174 

23220  175 
(*lists as multisets*) 
22142  176 
val remove1: ('b * 'a > bool) > 'b > 'a list > 'a list 
33078
3aea60ca3900
multiset operations with canonical argument order
haftmann
parents:
33063
diff
changeset

177 
val combine: ('a * 'a > bool) > 'a list > 'a list > 'a list 
33079  178 
val submultiset: ('a * 'b > bool) > 'a list * 'b list > bool 
4621  179 

180 
(*orders*) 

18966  181 
val is_equal: order > bool 
4621  182 
val rev_order: order > order 
183 
val make_ord: ('a * 'a > bool) > 'a * 'a > order 

25224  184 
val bool_ord: bool * bool > order 
4621  185 
val int_ord: int * int > order 
186 
val string_ord: string * string > order 

16676  187 
val fast_string_ord: string * string > order 
16492  188 
val option_ord: ('a * 'b > order) > 'a option * 'b option > order 
4621  189 
val prod_ord: ('a * 'b > order) > ('c * 'd > order) > ('a * 'c) * ('b * 'd) > order 
190 
val dict_ord: ('a * 'b > order) > 'a list * 'b list > order 

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

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

18427  193 
val sort_distinct: ('a * 'a > order) > 'a list > 'a list 
4621  194 
val sort_strings: string list > string list 
195 
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

196 
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

197 
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

198 
val order_list: (int * 'a) list > 'a list 
4621  199 

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

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

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

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

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

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

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

206 

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

208 
val divide_and_conquer: ('a > 'a list * ('b list > 'b)) > 'a > 'b 
32978  209 
val divide_and_conquer': ('a > 'b > ('a list * ('c list * 'b > 'c * 'b)) * 'b) > 
210 
'a > 'b > 'c * 'b 

4621  211 
val partition_eq: ('a * 'a > bool) > 'a list > 'a list list 
212 
val partition_list: (int > 'a > bool) > int > int > 'a list > 'a list list 

213 
val gensym: string > string 

40509  214 
type stamp = unit Unsynchronized.ref 
16439  215 
val stamp: unit > stamp 
40509  216 
type serial = int 
16439  217 
val serial: unit > serial 
19512  218 
val serial_string: unit > string 
40509  219 
structure Object: sig type T = exn end 
4621  220 
end; 
221 

15745  222 
signature LIBRARY = 
15570  223 
sig 
15745  224 
include BASIC_LIBRARY 
15570  225 
val foldl: ('a * 'b > 'a) > 'a * 'b list > 'a 
226 
val foldr: ('a * 'b > 'b) > 'a list * 'b > 'b 

30190  227 
val foldl_map: ('a * 'b > 'a * 'c) > 'a * 'b list > 'a * 'c list 
15570  228 
val last_elem: 'a list > 'a 
229 
end; 

230 

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

232 
struct 
0  233 

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

234 
(* functions *) 
0  235 

23860  236 
fun undefined _ = raise Match; 
237 

16842  238 
fun I x = x; 
239 
fun K x = fn _ => x; 

233  240 
fun curry f x y = f (x, y); 
241 
fun uncurry f (x, y) = f x y; 

0  242 

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

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

245 

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

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

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

250 

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

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

160  254 

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

160  257 

40318
035b2afbeb2e
discontinued obsolete function sys_error and exception SYS_ERROR;
wenzelm
parents:
40291
diff
changeset

258 

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

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

260 

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

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

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

263 

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

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

265 
 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

266 

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

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

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

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

270 
 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

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

272 

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

273 

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

274 
(* pairs *) 
233  275 

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

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

278 

279 
fun fst (x, y) = x; 

280 
fun snd (x, y) = y; 

281 

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

282 
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

283 
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

284 
fun eq_pair eqx eqy ((x1, y1), (x2, y2)) = eqx (x1, x2) andalso eqy (y1, y2); 
233  285 

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

287 

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

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

4212  290 
fun pairself f (x, y) = (f x, f y); 
233  291 

292 

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

293 
(* booleans *) 
233  294 

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

295 
(*polymorphic equality*) 
233  296 
fun equal x y = x = y; 
297 
fun not_equal x y = x <> y; 

298 

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

299 
(*combining predicates*) 
16721  300 
fun p orf q = fn x => p x orelse q x; 
301 
fun p andf q = fn x => p x andalso q x; 

233  302 

25752  303 
val exists = List.exists; 
304 
val forall = List.all; 

0  305 

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

306 

380  307 
(* flags *) 
308 

32966
5b21661fe618
indicate CRITICAL nature of various setmp combinators;
wenzelm
parents:
32737
diff
changeset

309 
fun setmp_CRITICAL flag value f x = 
39616
8052101883c3
renamed setmp_noncritical to Unsynchronized.setmp to emphasize its meaning;
wenzelm
parents:
37851
diff
changeset

310 
NAMED_CRITICAL "setmp" (fn () => Unsynchronized.setmp flag value f x); 
23932  311 

25797  312 
fun setmp_thread_data tag orig_data data f x = 
26079  313 
uninterruptible (fn restore_attributes => fn () => 
314 
let 

28122  315 
val _ = Thread.setLocal (tag, data); 
26079  316 
val result = Exn.capture (restore_attributes f) x; 
28122  317 
val _ = Thread.setLocal (tag, orig_data); 
26079  318 
in Exn.release result end) (); 
25797  319 

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

320 

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

321 

233  322 
(** lists **) 
323 

5285  324 
fun single x = [x]; 
233  325 

20882  326 
fun the_single [x] = x 
327 
 the_single _ = raise Empty; 

328 

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

19273  330 

25061  331 
fun yield_singleton f x = f [x] #>> the_single; 
332 

5904  333 
fun apply [] x = x 
334 
 apply (f :: fs) x = apply fs (f x); 

335 

25058  336 
fun perhaps_apply funs arg = 
337 
let 

338 
fun app [] res = res 

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

340 
(case f x of 

341 
NONE => app fs (changed, x) 

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

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

344 

345 
fun perhaps_loop f arg = 

346 
let 

347 
fun loop (changed, x) = 

348 
(case f x of 

349 
NONE => (changed, x) 

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

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

352 

233  353 

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

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

355 

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

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

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

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

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

363 
in itl end; 

364 

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

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

367 
fun foldr f (l, e) = 

368 
let fun itr [] = e 

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

370 
in itr l end; 

371 

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

374 
fun foldl1 f [] = raise Empty 

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

376 

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

20443  379 
fun foldr1 f [] = raise Empty 
20510  380 
 foldr1 f l = 
20443  381 
let fun itr [x] = x 
20510  382 
 itr (x::l) = f(x, itr l) 
20443  383 
in itr l end; 
233  384 

16705  385 
fun foldl_map f = 
386 
let 

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

388 
 fold_aux (x, y :: ys) = 

389 
let 

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

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

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

393 
in fold_aux end; 

394 

233  395 

396 
(* basic list functions *) 

397 

20510  398 
fun eq_list eq (list1, list2) = 
20348  399 
let 
20510  400 
fun eq_lst (x :: xs, y :: ys) = eq (x, y) andalso eq_lst (xs, ys) 
401 
 eq_lst _ = true; 

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

20348  403 

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

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

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

406 

25538  407 
val filter = List.filter; 
408 
fun filter_out f = filter (not o f); 

409 
val map_filter = List.mapPartial; 

410 

33955  411 
fun take (0: int) xs = [] 
412 
 take _ [] = [] 

34059  413 
 take n (x :: xs) = x :: take (n  1) xs; 
33955  414 

415 
fun drop (0: int) xs = xs 

416 
 drop _ [] = [] 

34059  417 
 drop n (x :: xs) = drop (n  1) xs; 
33955  418 

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

419 
fun chop (0: int) xs = ([], xs) 
23220  420 
 chop _ [] = ([], []) 
421 
 chop n (x :: xs) = chop (n  1) xs >> cons x; 

19011  422 

39811  423 
fun chop_while P [] = ([], []) 
424 
 chop_while P (ys as x :: xs) = 

425 
if P x then chop_while P xs >> cons x else ([], ys); 

4713  426 

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

429 
fun nth xs i = List.nth (xs, i); 
233  430 

18461  431 
fun nth_list xss i = nth xss i handle Subscript => []; 
432 

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

433 
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

434 
 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

435 
 nth_map (_: int) _ [] = raise Subscript; 
11773  436 

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

439 

18514  440 
fun map_index f = 
441 
let 

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

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

443 
 mapp i (x :: xs) = f (i, x) :: mapp (i + 1) xs 
18514  444 
in mapp 0 end; 
445 

21118  446 
fun fold_index f = 
447 
let 

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

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

449 
 fold_aux i (x :: xs) y = fold_aux (i + 1) xs (f (i, x) y); 
21118  450 
in fold_aux 0 end; 
451 

33063  452 
fun map_range f i = 
453 
let 

33073  454 
fun mapp (k: int) = 
33063  455 
if k < i then f k :: mapp (k + 1) else []; 
456 
in mapp 0 end; 

457 

15570  458 
val last_elem = List.last; 
233  459 

3762  460 
(*rear decomposition*) 
15570  461 
fun split_last [] = raise Empty 
3762  462 
 split_last [x] = ([], x) 
463 
 split_last (x :: xs) = apfst (cons x) (split_last xs); 

464 

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

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

3762  470 

4212  471 
(*find first element satisfying predicate*) 
22593  472 
val find_first = List.find; 
233  473 

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

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

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

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

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

480 

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

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

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

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

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

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

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

489 

15531  490 
val flat = List.concat; 
233  491 

12136  492 
fun unflat (xs :: xss) ys = 
19424  493 
let val (ps, qs) = chop (length xs) ys 
13629  494 
in ps :: unflat xss qs end 
12136  495 
 unflat [] [] = [] 
40722
441260986b63
make two copies (!) of Library.UnequalLengths coincide with ListPair.UnequalLengths;
wenzelm
parents:
40721
diff
changeset

496 
 unflat _ _ = raise ListPair.UnequalLengths; 
12136  497 

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

498 
fun burrow f xss = unflat xss (f (flat xss)); 
18359  499 

24864  500 
fun burrow_options f os = map (try hd) (burrow f (map the_list os)); 
501 

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

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

503 
apfst (unflat xss) (f (flat xss) s); 
18359  504 

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

507 
 separate _ xs = xs; 

508 

25980  509 
fun surround s (x :: xs) = s :: x :: surround s xs 
510 
 surround s [] = [s]; 

511 

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

513 
fun replicate (n: int) x = 
233  514 
let fun rep (0, xs) = xs 
515 
 rep (n, xs) = rep (n  1, x :: xs) 

516 
in 

15570  517 
if n < 0 then raise Subscript 
233  518 
else rep (n, []) 
519 
end; 

520 

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

521 

25549  522 
(* direct product *) 
523 

25538  524 
fun map_product f _ [] = [] 
525 
 map_product f [] _ = [] 

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

233  527 

25538  528 
fun fold_product f _ [] z = z 
529 
 fold_product f [] _ z = z 

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

233  531 

25549  532 

533 
(* lists of pairs *) 

233  534 

18330  535 
fun map2 _ [] [] = [] 
536 
 map2 f (x :: xs) (y :: ys) = f x y :: map2 f xs ys 

40722
441260986b63
make two copies (!) of Library.UnequalLengths coincide with ListPair.UnequalLengths;
wenzelm
parents:
40721
diff
changeset

537 
 map2 _ _ _ = raise ListPair.UnequalLengths; 
380  538 

23220  539 
fun fold2 f [] [] z = z 
540 
 fold2 f (x :: xs) (y :: ys) z = fold2 f xs ys (f x y z) 

40722
441260986b63
make two copies (!) of Library.UnequalLengths coincide with ListPair.UnequalLengths;
wenzelm
parents:
40721
diff
changeset

541 
 fold2 f _ _ _ = raise ListPair.UnequalLengths; 
380  542 

40721  543 
fun fold_rev2 f [] [] z = z 
544 
 fold_rev2 f (x :: xs) (y :: ys) z = f x y (fold_rev2 f xs ys z) 

40722
441260986b63
make two copies (!) of Library.UnequalLengths coincide with ListPair.UnequalLengths;
wenzelm
parents:
40721
diff
changeset

545 
 fold_rev2 f _ _ _ = raise ListPair.UnequalLengths; 
40721  546 

40564  547 
fun forall2 P [] [] = true 
548 
 forall2 P (x :: xs) (y :: ys) = P x y andalso forall2 P xs ys 

40733  549 
 forall2 P _ _ = raise ListPair.UnequalLengths; 
40564  550 

25943  551 
fun map_split f [] = ([], []) 
552 
 map_split f (x :: xs) = 

553 
let 

554 
val (y, w) = f x; 

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

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

557 

19799  558 
fun zip_options (x :: xs) (SOME y :: ys) = (x, y) :: zip_options xs ys 
559 
 zip_options (_ :: xs) (NONE :: ys) = zip_options xs ys 

560 
 zip_options _ [] = [] 

40722
441260986b63
make two copies (!) of Library.UnequalLengths coincide with ListPair.UnequalLengths;
wenzelm
parents:
40721
diff
changeset

561 
 zip_options [] _ = raise ListPair.UnequalLengths; 
4956
a7538e43896e
added foldl_map: ('a * 'b > 'a * 'c) > 'a * 'b list > 'a * 'c list;
wenzelm
parents:
4945
diff
changeset

562 

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

565 
fun [] ~~ [] = [] 

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

40722
441260986b63
make two copies (!) of Library.UnequalLengths coincide with ListPair.UnequalLengths;
wenzelm
parents:
40721
diff
changeset

567 
 _ ~~ _ = raise ListPair.UnequalLengths; 
233  568 

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

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

15570  571 
val split_list = ListPair.unzip; 
233  572 

28347  573 
fun burrow_fst f xs = split_list xs >> f > op ~~; 
574 

233  575 

576 
(* prefixes, suffixes *) 

577 

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

580 
 is_prefix eq _ _ = false; 

233  581 

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

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

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

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

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

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

587 
if pred x then take(x :: rxs, xs) else (rev rxs, x :: xs) 
233  588 
in take([], xs) end; 
589 

20108  590 
fun chop_prefix eq ([], ys) = ([], ([], ys)) 
591 
 chop_prefix eq (xs, []) = ([], (xs, [])) 

23220  592 
 chop_prefix eq (xs as x :: xs', ys as y :: ys') = 
20108  593 
if eq (x, y) then 
594 
let val (ps', xys'') = chop_prefix eq (xs', ys') 

23220  595 
in (x :: ps', xys'') end 
20108  596 
else ([], (xs, ys)); 
597 

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

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

601 
 take_suffix pred (x :: xs) = 

602 
(case take_suffix pred xs of 

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

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

605 

12249  606 
fun prefixes1 [] = [] 
607 
 prefixes1 (x :: xs) = map (cons x) ([] :: prefixes1 xs); 

608 

19011  609 
fun prefixes xs = [] :: prefixes1 xs; 
610 

12249  611 
fun suffixes1 xs = map rev (prefixes1 (rev xs)); 
19011  612 
fun suffixes xs = [] :: suffixes1 xs; 
233  613 

23220  614 

615 

233  616 
(** integers **) 
617 

618 
(* lists of integers *) 

619 

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

621 
fun ((i: int) upto j) = 
21859  622 
if i > j then [] else i :: (i + 1 upto j); 
233  623 

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

625 
fun ((i: int) downto j) = 
21859  626 
if i < j then [] else i :: (i  1 downto j); 
233  627 

628 

629 
(* convert integers to strings *) 

630 

631 
(*expand the number in the given base; 

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

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

634 
let 

635 
fun radix (n, tail) = 

636 
if n < base then n :: tail 

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

638 
in radix (num, []) end; 

639 

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

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

642 
fun radixstring (base, zerochar, num) = 

643 
let val offset = ord zerochar; 

644 
fun chrof n = chr (offset + n) 

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

646 

647 

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

648 
val string_of_int = Int.toString; 
233  649 

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

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

651 
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

652 

23220  653 
fun string_of_indexname (a, 0) = a 
654 
 string_of_indexname (a, i) = a ^ "_" ^ string_of_int i; 

233  655 

656 

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

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

658 

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

659 
fun read_radix_int radix cs = 
20095  660 
let 
661 
val zero = ord "0"; 

662 
val limit = zero + radix; 

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

664 
 scan (num, c :: cs) = 

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

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

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

668 
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

669 

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

670 
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

671 

40627
becf5d5187cc
renamed raw "explode" function to "raw_explode" to emphasize its meaning;
wenzelm
parents:
40564
diff
changeset

672 
fun oct_char s = chr (#1 (read_radix_int 8 (raw_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

673 

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

674 

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

675 

40291  676 
(** reals **) 
677 

678 
val string_of_real = Real.fmt (StringCvt.GEN NONE); 

679 

680 
fun signed_string_of_real x = 

681 
if x < 0.0 then "" ^ string_of_real (~ x) else string_of_real x; 

682 

683 

684 

233  685 
(** strings **) 
686 

16188  687 
(* functions tuned for strings, avoiding explode *) 
6312  688 

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

689 
fun nth_string str i = 
6959  690 
(case try String.substring (str, i, 1) of 
15531  691 
SOME s => s 
15570  692 
 NONE => raise Subscript); 
6312  693 

16188  694 
fun fold_string f str x0 = 
6282  695 
let 
696 
val n = size str; 

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

699 
in iter (x0, 0) end; 

6282  700 

14968  701 
fun exists_string pred str = 
702 
let 

703 
val n = size str; 

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

705 
in ex 0 end; 

6312  706 

16188  707 
fun forall_string pred = not o exists_string (not o pred); 
708 

28025  709 
fun first_field sep str = 
28022  710 
let 
28025  711 
val n = size sep; 
28022  712 
val len = size str; 
713 
fun find i = 

714 
if i + n > len then NONE 

28025  715 
else if String.substring (str, i, n) = sep then SOME i 
28022  716 
else find (i + 1); 
28025  717 
in 
718 
(case find 0 of 

719 
NONE => NONE 

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

721 
end; 

28022  722 

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

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

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

726 

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

728 
val quote = enclose "\"" "\""; 
233  729 

40930  730 
(*space_implode "..." (Symbol.explode "hello") = "h...e...l...l...o"*) 
233  731 
fun space_implode a bs = implode (separate a bs); 
732 

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

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

735 

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

737 
val cat_lines = space_implode "\n"; 
233  738 

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

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

742 

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

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

744 

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

745 
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

746 
 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

747 

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

748 
fun prefix prfx s = prfx ^ s; 
16188  749 
fun suffix sffx s = s ^ sffx; 
5285  750 

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

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

752 
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

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

754 

16188  755 
fun unsuffix sffx s = 
17061  756 
if String.isSuffix sffx s then String.substring (s, 0, size s  size sffx) 
757 
else raise Fail "unsuffix"; 

5285  758 

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

759 
fun replicate_string (0: int) _ = "" 
10951  760 
 replicate_string 1 a = a 
761 
 replicate_string k a = 

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

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

764 

31250  765 
fun translate_string f = String.translate (f o String.str); 
766 

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

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

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

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

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

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

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

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

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

775 
 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

776 
in match (space_explode "*" pat) str end; 
23220  777 

35976  778 

779 

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

26439  782 
(* canonical operations *) 
783 

18923  784 
fun member eq list x = 
785 
let 

786 
fun memb [] = false 

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

788 
in memb list end; 

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

789 

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

24049  792 
fun update eq x xs = cons x (remove eq x xs); 
233  793 

33049
c38f02fdf35d
curried inter as canonical list operation (beware of argument order)
haftmann
parents:
33040
diff
changeset

794 
fun inter eq xs = filter (member eq xs); 
c38f02fdf35d
curried inter as canonical list operation (beware of argument order)
haftmann
parents:
33040
diff
changeset

795 

33042  796 
fun union eq = fold (insert eq); 
19301  797 
fun subtract eq = fold (remove eq); 
798 

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

799 
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

800 
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

801 
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

802 
else fold_rev (insert eq) ys xs; 
0  803 

26439  804 

33050  805 
(* subset and set equality *) 
806 

33038  807 
fun subset eq (xs, ys) = forall (member eq ys) xs; 
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset

808 

33038  809 
fun eq_set eq (xs, ys) = 
20348  810 
eq_list eq (xs, ys) orelse 
33038  811 
(subset eq (xs, ys) andalso subset (eq o swap) (ys, xs)); 
19301  812 

265  813 

233  814 
(*makes a list of the distinct members of the input; preserves order, takes 
815 
first of equal elements*) 

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

816 
fun distinct eq lst = 
233  817 
let 
818 
fun dist (rev_seen, []) = rev rev_seen 

819 
 dist (rev_seen, x :: xs) = 

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

822 
in dist ([], lst) end; 
233  823 

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

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

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

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

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

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

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

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

834 

16878  835 
fun has_duplicates eq = 
836 
let 

837 
fun dups [] = false 

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

839 
in dups end; 

840 

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

841 

32352  842 
(* matrices *) 
843 

844 
fun map_transpose f xss = 

845 
let 

40722
441260986b63
make two copies (!) of Library.UnequalLengths coincide with ListPair.UnequalLengths;
wenzelm
parents:
40721
diff
changeset

846 
val n = 
441260986b63
make two copies (!) of Library.UnequalLengths coincide with ListPair.UnequalLengths;
wenzelm
parents:
40721
diff
changeset

847 
(case distinct (op =) (map length xss) of 
441260986b63
make two copies (!) of Library.UnequalLengths coincide with ListPair.UnequalLengths;
wenzelm
parents:
40721
diff
changeset

848 
[] => 0 
32352  849 
 [n] => n 
40722
441260986b63
make two copies (!) of Library.UnequalLengths coincide with ListPair.UnequalLengths;
wenzelm
parents:
40721
diff
changeset

850 
 _ => raise ListPair.UnequalLengths); 
33206  851 
in map_range (fn m => f (map (fn xs => nth xs m) xss)) n end; 
32352  852 

853 

23220  854 

22142  855 
(** lists as multisets **) 
856 

33078
3aea60ca3900
multiset operations with canonical argument order
haftmann
parents:
33063
diff
changeset

857 
fun remove1 eq x [] = [] 
3aea60ca3900
multiset operations with canonical argument order
haftmann
parents:
33063
diff
changeset

858 
 remove1 eq x (y :: ys) = if eq (x, y) then ys else y :: remove1 eq x ys; 
22142  859 

33078
3aea60ca3900
multiset operations with canonical argument order
haftmann
parents:
33063
diff
changeset

860 
fun combine eq xs ys = fold (remove1 eq) ys xs @ ys; 
233  861 

33079  862 
fun submultiset _ ([], _) = true 
863 
 submultiset eq (x :: xs, ys) = member eq ys x andalso submultiset eq (xs, remove1 eq x ys); 

864 

0  865 

866 

2506  867 
(** orders **) 
868 

18966  869 
fun is_equal EQUAL = true 
870 
 is_equal _ = false; 

871 

4445  872 
fun rev_order LESS = GREATER 
873 
 rev_order EQUAL = EQUAL 

874 
 rev_order GREATER = LESS; 

875 

4479  876 
(*assume rel is a linear strict order*) 
4445  877 
fun make_ord rel (x, y) = 
878 
if rel (x, y) then LESS 

879 
else if rel (y, x) then GREATER 

880 
else EQUAL; 

881 

25224  882 
fun bool_ord (false, true) = LESS 
883 
 bool_ord (true, false) = GREATER 

884 
 bool_ord _ = EQUAL; 

885 

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

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

887 
val string_ord = String.compare; 
2506  888 

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

891 

16492  892 
fun option_ord ord (SOME x, SOME y) = ord (x, y) 
893 
 option_ord _ (NONE, NONE) = EQUAL 

894 
 option_ord _ (NONE, SOME _) = LESS 

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

896 

4343  897 
(*lexicographic product*) 
898 
fun prod_ord a_ord b_ord ((x, y), (x', y')) = 

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

900 

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

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

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

4343  905 
 dict_ord _ ([], _ :: _) = LESS 
16984  906 
 dict_ord _ (_ :: _, []) = GREATER; 
4343  907 

908 
(*lexicographic product of lists*) 

909 
fun list_ord elem_ord (xs, ys) = 

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

2506  912 

4621  913 
(* sorting *) 
914 

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

4621  917 
let 
16878  918 
fun qsort [] = [] 
919 
 qsort (xs as [_]) = xs 

18427  920 
 qsort (xs as [x, y]) = 
921 
(case ord (x, y) of 

922 
LESS => xs 

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

924 
 GREATER => [y, x]) 

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

926 
let val (lts, eqs, gts) = part (nth xs (length xs div 2)) xs 
16878  927 
in qsort lts @ eqs @ qsort gts end 
4621  928 
and part _ [] = ([], [], []) 
929 
 part pivot (x :: xs) = add (ord (x, pivot)) x (part pivot xs) 

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

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

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

935 

18427  936 
fun sort ord = quicksort false ord; 
937 
fun sort_distinct ord = quicksort true ord; 

938 

4621  939 
val sort_strings = sort string_ord; 
940 
fun sort_wrt sel xs = sort (string_ord o pairself sel) xs; 

941 

942 

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

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

944 

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

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

946 
fun tag_list k [] = [] 
30570  947 
 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

948 

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

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

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

951 
 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

952 
 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

953 
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

954 
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

955 

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

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

957 
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

958 

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

959 

2506  960 

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

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

962 

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

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

964 

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

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

966 

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

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

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

969 
val m = 2147483647.0; 
32737
76fa673eee8b
Raw ML references as unsynchronized state variables.
wenzelm
parents:
32352
diff
changeset

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

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

972 

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

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

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

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

976 

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

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

978 

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

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

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

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

982 

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

983 
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

984 

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

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

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

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

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

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

991 

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

992 

23220  993 

4621  994 
(** misc **) 
233  995 

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

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

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

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

999 

32978  1000 
fun divide_and_conquer' decomp x s = 
1001 
let val ((ys, recomb), s') = decomp x s 

1002 
in recomb (fold_map (divide_and_conquer' decomp) ys s') end; 

1003 

0  1004 

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

37851  1008 
let 
1009 
fun part (k: int) xs = 

1010 
if k > j then 

1011 
(case xs of 

1012 
[] => [] 

1013 
 _ => raise Fail "partition_list") 

1014 
else 

1015 
let val (ns, rest) = List.partition (p k) xs 

1016 
in ns :: part (k + 1) rest end; 

1017 
in part (i: int) end; 

0  1018 

37851  1019 
fun partition_eq (eq: 'a * 'a > bool) = 
19691  1020 
let 
1021 
fun part [] = [] 

1022 
 part (x :: ys) = 

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

37851  1024 
in (x :: xs) :: part xs' end; 
19691  1025 
in part end; 
1026 

1027 

0  1028 

233  1029 
(* generating identifiers *) 
0  1030 

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

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

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

1036 
else if i<52 then chr (ord "a" + i  26) 
22369  1037 
else chr (ord "0" + i  52); 
4063  1038 

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

4284  1041 

32737
76fa673eee8b
Raw ML references as unsynchronized state variables.
wenzelm
parents:
32352
diff
changeset

1042 
val gensym_seed = Unsynchronized.ref (0: int); 
2003  1043 

22369  1044 
in 
32737
76fa673eee8b
Raw ML references as unsynchronized state variables.
wenzelm
parents:
32352
diff
changeset

1045 
fun gensym pre = 
76fa673eee8b
Raw ML references as unsynchronized state variables.
wenzelm
parents:
32352
diff
changeset

1046 
pre ^ newid (NAMED_CRITICAL "gensym" (fn () => Unsynchronized.inc gensym_seed)); 
22369  1047 
end; 
4063  1048 

1049 

16439  1050 
(* stamps and serial numbers *) 
1051 

32737
76fa673eee8b
Raw ML references as unsynchronized state variables.
wenzelm
parents:
32352
diff
changeset

1052 
type stamp = unit Unsynchronized.ref; 
76fa673eee8b
Raw ML references as unsynchronized state variables.
wenzelm
parents:
32352
diff
changeset

1053 
val stamp: unit > stamp = Unsynchronized.ref; 
16439  1054 

1055 
type serial = int; 

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

1056 
val serial = Multithreading.serial; 
19512  1057 
val serial_string = string_of_int o serial; 
1058 

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

1059 

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

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

1061 

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

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

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

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

1065 

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

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

1067 

32188  1068 
structure Basic_Library: BASIC_LIBRARY = Library; 
1069 
open Basic_Library; 

40722
441260986b63
make two copies (!) of Library.UnequalLengths coincide with ListPair.UnequalLengths;
wenzelm
parents:
40721
diff
changeset

1070 

441260986b63
make two copies (!) of Library.UnequalLengths coincide with ListPair.UnequalLengths;
wenzelm
parents:
40721
diff
changeset

1071 
datatype legacy = UnequalLengths; 