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