author | wenzelm |
Tue, 01 Mar 2016 20:51:38 +0100 | |
changeset 62491 | 7187cb7a77c5 |
parent 62468 | d97e13e5ea5b |
child 62529 | 8b7bdfc09f3b |
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 |
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 old-style 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 |
|
4621 | 31 |
(*pairs*) |
32 |
val pair: 'a -> 'b -> 'a * 'b |
|
33 |
val rpair: 'a -> 'b -> 'b * 'a |
|
34 |
val fst: 'a * 'b -> 'a |
|
35 |
val snd: 'a * 'b -> 'b |
|
17498
d83af87bbdc5
improved eq_fst and eq_snd, removed some deprecated stuff
haftmann
parents:
17486
diff
changeset
|
36 |
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
|
37 |
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
|
38 |
val eq_pair: ('a * 'c -> bool) -> ('b * 'd -> bool) -> ('a * 'b) * ('c * 'd) -> bool |
4621 | 39 |
val swap: 'a * 'b -> 'b * 'a |
40 |
val apfst: ('a -> 'b) -> 'a * 'c -> 'b * 'c |
|
41 |
val apsnd: ('a -> 'b) -> 'c * 'a -> 'c * 'b |
|
59058
a78612c67ec0
renamed "pairself" to "apply2", in accordance to @{apply 2};
wenzelm
parents:
58635
diff
changeset
|
42 |
val apply2: ('a -> 'b) -> 'a * 'a -> 'b * 'b |
4621 | 43 |
|
44 |
(*booleans*) |
|
45 |
val equal: ''a -> ''a -> bool |
|
46 |
val not_equal: ''a -> ''a -> bool |
|
47 |
val orf: ('a -> bool) * ('a -> bool) -> 'a -> bool |
|
48 |
val andf: ('a -> bool) * ('a -> bool) -> 'a -> bool |
|
49 |
val exists: ('a -> bool) -> 'a list -> bool |
|
50 |
val forall: ('a -> bool) -> 'a list -> bool |
|
25797 | 51 |
val setmp_thread_data: 'a Universal.tag -> 'a -> 'a -> ('b -> 'c) -> 'b -> 'c |
4621 | 52 |
|
53 |
(*lists*) |
|
5285 | 54 |
val single: 'a -> 'a list |
20882 | 55 |
val the_single: 'a list -> 'a |
19273 | 56 |
val singleton: ('a list -> 'b list) -> 'a -> 'b |
25061 | 57 |
val yield_singleton: ('a list -> 'c -> 'b list * 'c) -> 'a -> 'c -> 'b * 'c |
25058 | 58 |
val perhaps_apply: ('a -> 'a option) list -> 'a -> 'a option |
59 |
val perhaps_loop: ('a -> 'a option) -> 'a -> 'a option |
|
25681 | 60 |
val foldl1: ('a * 'a -> 'a) -> 'a list -> 'a |
15760 | 61 |
val foldr1: ('a * 'a -> 'a) -> 'a list -> 'a |
46891 | 62 |
val eq_list: ('a * 'a -> bool) -> 'a list * 'a list -> bool |
21395
f34ac19659ae
moved some fundamental concepts to General/basics.ML;
wenzelm
parents:
21335
diff
changeset
|
63 |
val maps: ('a -> 'b list) -> 'a list -> 'b list |
25549 | 64 |
val filter: ('a -> bool) -> 'a list -> 'a list |
65 |
val filter_out: ('a -> bool) -> 'a list -> 'a list |
|
66 |
val map_filter: ('a -> 'b option) -> 'a list -> 'b list |
|
33955 | 67 |
val take: int -> 'a list -> 'a list |
68 |
val drop: int -> 'a list -> 'a list |
|
19011 | 69 |
val chop: int -> 'a list -> 'a list * 'a list |
46891 | 70 |
val chop_groups: int -> 'a list -> 'a list list |
18278 | 71 |
val nth: 'a list -> int -> 'a |
46891 | 72 |
val nth_list: 'a list list -> int -> 'a list |
18011
685d95c793ff
cleaned up nth, nth_update, nth_map and nth_string functions
haftmann
parents:
17952
diff
changeset
|
73 |
val nth_map: int -> ('a -> 'a) -> 'a list -> 'a list |
24846 | 74 |
val nth_drop: int -> 'a list -> 'a list |
18514 | 75 |
val map_index: (int * 'a -> 'b) -> 'a list -> 'b list |
76 |
val fold_index: (int * 'a -> 'b -> 'b) -> 'a list -> 'b -> 'b |
|
33063 | 77 |
val map_range: (int -> 'a) -> int -> 'a list |
52271
6f3771c00280
combinator fold_range, corresponding to map_range
haftmann
parents:
51990
diff
changeset
|
78 |
val fold_range: (int -> 'a -> 'a) -> int -> 'a -> 'a |
4621 | 79 |
val split_last: 'a list -> 'a list * 'a |
46891 | 80 |
val find_first: ('a -> bool) -> 'a list -> 'a option |
4621 | 81 |
val find_index: ('a -> bool) -> 'a list -> int |
46891 | 82 |
val get_first: ('a -> 'b option) -> 'a list -> 'b option |
19233
77ca20b0ed77
renamed HOL + - * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19119
diff
changeset
|
83 |
val get_index: ('a -> 'b option) -> 'a list -> (int * 'b) option |
46891 | 84 |
val flat: 'a list list -> 'a list |
85 |
val unflat: 'a list list -> 'b list -> 'b list list |
|
86 |
val grouped: int -> (('a list -> 'b list) -> 'c list list -> 'd list list) -> |
|
87 |
('a -> 'b) -> 'c list -> 'd list |
|
88 |
val burrow: ('a list -> 'b list) -> 'a list list -> 'b list list |
|
89 |
val burrow_options: ('a list -> 'b list) -> 'a option list -> 'b option list |
|
90 |
val fold_burrow: ('a list -> 'c -> 'b list * 'd) -> 'a list list -> 'c -> 'b list list * 'd |
|
91 |
val separate: 'a -> 'a list -> 'a list |
|
92 |
val surround: 'a -> 'a list -> 'a list |
|
93 |
val replicate: int -> 'a -> 'a list |
|
94 |
val map_product: ('a -> 'b -> 'c) -> 'a list -> 'b list -> 'c list |
|
95 |
val fold_product: ('a -> 'b -> 'c -> 'c) -> 'a list -> 'b list -> 'c -> 'c |
|
18330 | 96 |
val map2: ('a -> 'b -> 'c) -> 'a list -> 'b list -> 'c list |
97 |
val fold2: ('a -> 'b -> 'c -> 'c) -> 'a list -> 'b list -> 'c -> 'c |
|
46891 | 98 |
val map_split: ('a -> 'b * 'c) -> 'a list -> 'b list * 'c list |
19799 | 99 |
val zip_options: 'a list -> 'b option list -> ('a * 'b) list |
18330 | 100 |
val ~~ : 'a list * 'b list -> ('a * 'b) list |
101 |
val split_list: ('a * 'b) list -> 'a list * 'b list |
|
46891 | 102 |
val burrow_fst: ('a list -> 'b list) -> ('a * 'c) list -> ('b * 'c) list |
18441 | 103 |
val is_prefix: ('a * 'a -> bool) -> 'a list -> 'a list -> bool |
4621 | 104 |
val take_prefix: ('a -> bool) -> 'a list -> 'a list * 'a list |
20108 | 105 |
val chop_prefix: ('a * 'b -> bool) -> 'a list * 'b list -> 'a list * ('a list * 'b list) |
4621 | 106 |
val take_suffix: ('a -> bool) -> 'a list -> 'a list * 'a list |
12249 | 107 |
val prefixes1: 'a list -> 'a list list |
19011 | 108 |
val prefixes: 'a list -> 'a list list |
12249 | 109 |
val suffixes1: 'a list -> 'a list list |
19011 | 110 |
val suffixes: 'a list -> 'a list list |
61707 | 111 |
val trim: ('a -> bool) -> 'a list -> 'a list |
4621 | 112 |
|
113 |
(*integers*) |
|
114 |
val upto: int * int -> int list |
|
115 |
val downto: int * int -> int list |
|
116 |
val radixpand: int * int -> int list |
|
117 |
val radixstring: int * string * int -> string |
|
118 |
val string_of_int: int -> string |
|
21942
d6218d0f9ec3
added signed_string_of_int (pruduces proper - instead of SML's ~);
wenzelm
parents:
21920
diff
changeset
|
119 |
val signed_string_of_int: int -> string |
4621 | 120 |
val string_of_indexname: string * int -> string |
24630
351a308ab58d
simplified type int (eliminated IntInf.int, integer);
wenzelm
parents:
24593
diff
changeset
|
121 |
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
|
122 |
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
|
123 |
val oct_char: string -> string |
4621 | 124 |
|
125 |
(*strings*) |
|
18011
685d95c793ff
cleaned up nth, nth_update, nth_map and nth_string functions
haftmann
parents:
17952
diff
changeset
|
126 |
val nth_string: string -> int -> string |
16188 | 127 |
val fold_string: (string -> 'a -> 'a) -> string -> 'a -> 'a |
6312 | 128 |
val exists_string: (string -> bool) -> string -> bool |
16188 | 129 |
val forall_string: (string -> bool) -> string -> bool |
28025 | 130 |
val first_field: string -> string -> (string * string) option |
4621 | 131 |
val enclose: string -> string -> string -> string |
6642 | 132 |
val unenclose: string -> string |
4621 | 133 |
val quote: string -> string |
55033 | 134 |
val cartouche: string -> string |
4621 | 135 |
val space_implode: string -> string list -> string |
136 |
val commas: string list -> string |
|
137 |
val commas_quote: string list -> string |
|
138 |
val cat_lines: string list -> string |
|
139 |
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
|
140 |
val split_lines: string -> string list |
56038
0e2dec666152
tuned messages -- in accordance to Isabelle/Scala;
wenzelm
parents:
55033
diff
changeset
|
141 |
val plain_words: string -> string |
5942 | 142 |
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
|
143 |
val prefix: string -> string -> string |
5285 | 144 |
val suffix: string -> string -> string |
18681
3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset
|
145 |
val unprefix: string -> string -> string |
5285 | 146 |
val unsuffix: string -> string -> string |
47499
4b0daca2bf88
redirect bash stderr to Isabelle warning as appropriate -- avoid raw process error output which may either get ignored or overload PIDE syslog in extreme cases;
wenzelm
parents:
47060
diff
changeset
|
147 |
val trim_line: string -> string |
10951 | 148 |
val replicate_string: int -> string -> string |
14926 | 149 |
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
|
150 |
val match_string: string -> string -> bool |
4621 | 151 |
|
41516
3a70387b5e01
smart_string_of_real: print integer values without fractional part;
wenzelm
parents:
41494
diff
changeset
|
152 |
(*reals*) |
3a70387b5e01
smart_string_of_real: print integer values without fractional part;
wenzelm
parents:
41494
diff
changeset
|
153 |
val string_of_real: real -> string |
3a70387b5e01
smart_string_of_real: print integer values without fractional part;
wenzelm
parents:
41494
diff
changeset
|
154 |
val signed_string_of_real: real -> string |
3a70387b5e01
smart_string_of_real: print integer values without fractional part;
wenzelm
parents:
41494
diff
changeset
|
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 |
33042 | 161 |
val union: ('a * 'a -> bool) -> 'a list -> 'a list -> 'a list |
19301 | 162 |
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
|
163 |
val inter: ('a * 'b -> bool) -> 'b list -> 'a list -> 'a list |
18923 | 164 |
val merge: ('a * 'a -> bool) -> 'a list * 'a list -> 'a list |
33038 | 165 |
val subset: ('a * 'b -> bool) -> 'a list * 'b list -> bool |
42403
38b29c9fc742
slightly more special eq_list/eq_set, with shortcut involving pointer_eq;
wenzelm
parents:
41516
diff
changeset
|
166 |
val eq_set: ('a * 'a -> bool) -> 'a list * 'a list -> bool |
19046
bc5c6c9b114e
removed distinct, renamed gen_distinct to distinct;
wenzelm
parents:
19011
diff
changeset
|
167 |
val distinct: ('a * 'a -> bool) -> 'a list -> 'a list |
18966 | 168 |
val duplicates: ('a * 'a -> bool) -> 'a list -> 'a list |
16878 | 169 |
val has_duplicates: ('a * 'a -> bool) -> 'a list -> bool |
46891 | 170 |
val map_transpose: ('a list -> 'b) -> 'a list list -> 'b list |
4621 | 171 |
|
23220 | 172 |
(*lists as multisets*) |
22142 | 173 |
val remove1: ('b * 'a -> bool) -> 'b -> 'a list -> 'a list |
33078
3aea60ca3900
multiset operations with canonical argument order
haftmann
parents:
33063
diff
changeset
|
174 |
val combine: ('a * 'a -> bool) -> 'a list -> 'a list -> 'a list |
33079 | 175 |
val submultiset: ('a * 'b -> bool) -> 'a list * 'b list -> bool |
4621 | 176 |
|
177 |
(*orders*) |
|
18966 | 178 |
val is_equal: order -> bool |
4621 | 179 |
val rev_order: order -> order |
180 |
val make_ord: ('a * 'a -> bool) -> 'a * 'a -> order |
|
25224 | 181 |
val bool_ord: bool * bool -> order |
4621 | 182 |
val int_ord: int * int -> order |
183 |
val string_ord: string * string -> order |
|
16676 | 184 |
val fast_string_ord: string * string -> order |
16492 | 185 |
val option_ord: ('a * 'b -> order) -> 'a option * 'b option -> order |
4621 | 186 |
val prod_ord: ('a * 'b -> order) -> ('c * 'd -> order) -> ('a * 'c) * ('b * 'd) -> order |
187 |
val dict_ord: ('a * 'b -> order) -> 'a list * 'b list -> order |
|
188 |
val list_ord: ('a * 'b -> order) -> 'a list * 'b list -> order |
|
189 |
val sort: ('a * 'a -> order) -> 'a list -> 'a list |
|
18427 | 190 |
val sort_distinct: ('a * 'a -> order) -> 'a list -> 'a list |
4621 | 191 |
val sort_strings: string list -> string list |
60924
610794dff23c
tuned signature, in accordance to sortBy in Scala;
wenzelm
parents:
59469
diff
changeset
|
192 |
val sort_by: ('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
|
193 |
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
|
194 |
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
|
195 |
val order_list: (int * 'a) list -> 'a list |
4621 | 196 |
|
197 |
(*misc*) |
|
19644
0b01436e1843
added divide_and_conquer combinator (by Amine Chaieb);
wenzelm
parents:
19596
diff
changeset
|
198 |
val divide_and_conquer: ('a -> 'a list * ('b list -> 'b)) -> 'a -> 'b |
32978 | 199 |
val divide_and_conquer': ('a -> 'b -> ('a list * ('c list * 'b -> 'c * 'b)) * 'b) -> |
200 |
'a -> 'b -> 'c * 'b |
|
4621 | 201 |
val partition_eq: ('a * 'a -> bool) -> 'a list -> 'a list list |
202 |
val partition_list: (int -> 'a -> bool) -> int -> int -> 'a list -> 'a list list |
|
40509 | 203 |
type serial = int |
16439 | 204 |
val serial: unit -> serial |
19512 | 205 |
val serial_string: unit -> string |
45626
b4f374a45668
more abstract datatype stamp, which avoids pointless allocation of mutable cells;
wenzelm
parents:
44617
diff
changeset
|
206 |
eqtype stamp |
b4f374a45668
more abstract datatype stamp, which avoids pointless allocation of mutable cells;
wenzelm
parents:
44617
diff
changeset
|
207 |
val stamp: unit -> stamp |
51368
2ea5c7c2d825
tuned signature -- prefer terminology of Scala and Axiom;
wenzelm
parents:
50913
diff
changeset
|
208 |
structure Any: sig type T = exn end |
43603 | 209 |
val cd: string -> unit |
210 |
val pwd: unit -> string |
|
211 |
val getenv: string -> string |
|
212 |
val getenv_strict: string -> string |
|
4621 | 213 |
end; |
214 |
||
15745 | 215 |
signature LIBRARY = |
15570 | 216 |
sig |
15745 | 217 |
include BASIC_LIBRARY |
15570 | 218 |
val foldl: ('a * 'b -> 'a) -> 'a * 'b list -> 'a |
219 |
val foldr: ('a * 'b -> 'b) -> 'a list * 'b -> 'b |
|
220 |
end; |
|
221 |
||
15745 | 222 |
structure Library: LIBRARY = |
1364
8ea1a962ad72
files now define a structure to allow SML/NJ to optimize the code
clasohm
parents:
1290
diff
changeset
|
223 |
struct |
0 | 224 |
|
21395
f34ac19659ae
moved some fundamental concepts to General/basics.ML;
wenzelm
parents:
21335
diff
changeset
|
225 |
(* functions *) |
0 | 226 |
|
23860 | 227 |
fun undefined _ = raise Match; |
228 |
||
16842 | 229 |
fun I x = x; |
230 |
fun K x = fn _ => x; |
|
233 | 231 |
fun curry f x y = f (x, y); |
232 |
fun uncurry f (x, y) = f x y; |
|
0 | 233 |
|
17141
4b0dc89de43b
added ? combinator for conditional transformations
haftmann
parents:
17101
diff
changeset
|
234 |
(*conditional application*) |
21565 | 235 |
fun b ? f = fn x => if b then f x else x; |
17141
4b0dc89de43b
added ? combinator for conditional transformations
haftmann
parents:
17101
diff
changeset
|
236 |
|
16721 | 237 |
(*composition with multiple args*) |
238 |
fun (f oo g) x y = f (g x y); |
|
239 |
fun (f ooo g) x y z = f (g x y z); |
|
240 |
fun (f oooo g) x y z w = f (g x y z w); |
|
241 |
||
31250 | 242 |
(*function exponentiation: f (... (f x) ...) with n applications of f*) |
243 |
fun funpow (0 : int) _ = I |
|
244 |
| funpow n f = f #> funpow (n - 1) f; |
|
160 | 245 |
|
31250 | 246 |
fun funpow_yield (0 : int) _ x = ([], x) |
247 |
| funpow_yield n f x = x |> f ||>> funpow_yield (n - 1) f |>> op ::; |
|
160 | 248 |
|
40318
035b2afbeb2e
discontinued obsolete function sys_error and exception SYS_ERROR;
wenzelm
parents:
40291
diff
changeset
|
249 |
|
21395
f34ac19659ae
moved some fundamental concepts to General/basics.ML;
wenzelm
parents:
21335
diff
changeset
|
250 |
(* pairs *) |
233 | 251 |
|
252 |
fun pair x y = (x, y); |
|
253 |
fun rpair x y = (y, x); |
|
254 |
||
255 |
fun fst (x, y) = x; |
|
256 |
fun snd (x, y) = y; |
|
257 |
||
17498
d83af87bbdc5
improved eq_fst and eq_snd, removed some deprecated stuff
haftmann
parents:
17486
diff
changeset
|
258 |
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
|
259 |
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
|
260 |
fun eq_pair eqx eqy ((x1, y1), (x2, y2)) = eqx (x1, x2) andalso eqy (y1, y2); |
233 | 261 |
|
262 |
fun swap (x, y) = (y, x); |
|
263 |
||
264 |
fun apfst f (x, y) = (f x, y); |
|
265 |
fun apsnd f (x, y) = (x, f y); |
|
59058
a78612c67ec0
renamed "pairself" to "apply2", in accordance to @{apply 2};
wenzelm
parents:
58635
diff
changeset
|
266 |
fun apply2 f (x, y) = (f x, f y); |
233 | 267 |
|
268 |
||
21395
f34ac19659ae
moved some fundamental concepts to General/basics.ML;
wenzelm
parents:
21335
diff
changeset
|
269 |
(* booleans *) |
233 | 270 |
|
21395
f34ac19659ae
moved some fundamental concepts to General/basics.ML;
wenzelm
parents:
21335
diff
changeset
|
271 |
(*polymorphic equality*) |
233 | 272 |
fun equal x y = x = y; |
273 |
fun not_equal x y = x <> y; |
|
274 |
||
21395
f34ac19659ae
moved some fundamental concepts to General/basics.ML;
wenzelm
parents:
21335
diff
changeset
|
275 |
(*combining predicates*) |
16721 | 276 |
fun p orf q = fn x => p x orelse q x; |
277 |
fun p andf q = fn x => p x andalso q x; |
|
233 | 278 |
|
25752 | 279 |
val exists = List.exists; |
280 |
val forall = List.all; |
|
0 | 281 |
|
19644
0b01436e1843
added divide_and_conquer combinator (by Amine Chaieb);
wenzelm
parents:
19596
diff
changeset
|
282 |
|
59176 | 283 |
(* thread data *) |
23932 | 284 |
|
25797 | 285 |
fun setmp_thread_data tag orig_data data f x = |
26079 | 286 |
uninterruptible (fn restore_attributes => fn () => |
287 |
let |
|
28122 | 288 |
val _ = Thread.setLocal (tag, data); |
26079 | 289 |
val result = Exn.capture (restore_attributes f) x; |
28122 | 290 |
val _ = Thread.setLocal (tag, orig_data); |
26079 | 291 |
in Exn.release result end) (); |
25797 | 292 |
|
19644
0b01436e1843
added divide_and_conquer combinator (by Amine Chaieb);
wenzelm
parents:
19596
diff
changeset
|
293 |
|
21395
f34ac19659ae
moved some fundamental concepts to General/basics.ML;
wenzelm
parents:
21335
diff
changeset
|
294 |
|
233 | 295 |
(** lists **) |
296 |
||
5285 | 297 |
fun single x = [x]; |
233 | 298 |
|
20882 | 299 |
fun the_single [x] = x |
47060
e2741ec9ae36
prefer explicitly qualified exception List.Empty;
wenzelm
parents:
47023
diff
changeset
|
300 |
| the_single _ = raise List.Empty; |
20882 | 301 |
|
302 |
fun singleton f x = the_single (f [x]); |
|
19273 | 303 |
|
25061 | 304 |
fun yield_singleton f x = f [x] #>> the_single; |
305 |
||
25058 | 306 |
fun perhaps_apply funs arg = |
307 |
let |
|
308 |
fun app [] res = res |
|
309 |
| app (f :: fs) (changed, x) = |
|
310 |
(case f x of |
|
311 |
NONE => app fs (changed, x) |
|
312 |
| SOME x' => app fs (true, x')); |
|
313 |
in (case app funs (false, arg) of (false, _) => NONE | (true, arg') => SOME arg') end; |
|
314 |
||
315 |
fun perhaps_loop f arg = |
|
316 |
let |
|
317 |
fun loop (changed, x) = |
|
318 |
(case f x of |
|
319 |
NONE => (changed, x) |
|
320 |
| SOME x' => loop (true, x')); |
|
321 |
in (case loop (false, arg) of (false, _) => NONE | (true, arg') => SOME arg') end; |
|
322 |
||
233 | 323 |
|
21395
f34ac19659ae
moved some fundamental concepts to General/basics.ML;
wenzelm
parents:
21335
diff
changeset
|
324 |
(* fold -- old versions *) |
16691
539b9cc282fa
added combinatros '||>' and '||>>' and fold_map fitting nicely to ST combinator '|->'
haftmann
parents:
16688
diff
changeset
|
325 |
|
233 | 326 |
(*the following versions of fold are designed to fit nicely with infixes*) |
0 | 327 |
|
233 | 328 |
(* (op @) (e, [x1, ..., xn]) ===> ((e @ x1) @ x2) ... @ xn |
329 |
for operators that associate to the left (TAIL RECURSIVE)*) |
|
330 |
fun foldl (f: 'a * 'b -> 'a) : 'a * 'b list -> 'a = |
|
331 |
let fun itl (e, []) = e |
|
332 |
| itl (e, a::l) = itl (f(e, a), l) |
|
333 |
in itl end; |
|
334 |
||
335 |
(* (op @) ([x1, ..., xn], e) ===> x1 @ (x2 ... @ (xn @ e)) |
|
336 |
for operators that associate to the right (not tail recursive)*) |
|
337 |
fun foldr f (l, e) = |
|
338 |
let fun itr [] = e |
|
339 |
| itr (a::l) = f(a, itr l) |
|
340 |
in itr l end; |
|
341 |
||
25681 | 342 |
(* (op @) [x1, ..., xn] ===> ((x1 @ x2) @ x3) ... @ xn |
343 |
for operators that associate to the left (TAIL RECURSIVE)*) |
|
47060
e2741ec9ae36
prefer explicitly qualified exception List.Empty;
wenzelm
parents:
47023
diff
changeset
|
344 |
fun foldl1 f [] = raise List.Empty |
25681 | 345 |
| foldl1 f (x :: xs) = foldl f (x, xs); |
346 |
||
233 | 347 |
(* (op @) [x1, ..., xn] ===> x1 @ (x2 ... @ (x[n-1] @ xn)) |
348 |
for n > 0, operators that associate to the right (not tail recursive)*) |
|
47060
e2741ec9ae36
prefer explicitly qualified exception List.Empty;
wenzelm
parents:
47023
diff
changeset
|
349 |
fun foldr1 f [] = raise List.Empty |
20510 | 350 |
| foldr1 f l = |
20443 | 351 |
let fun itr [x] = x |
20510 | 352 |
| itr (x::l) = f(x, itr l) |
20443 | 353 |
in itr l end; |
233 | 354 |
|
355 |
||
356 |
(* basic list functions *) |
|
357 |
||
20510 | 358 |
fun eq_list eq (list1, list2) = |
42403
38b29c9fc742
slightly more special eq_list/eq_set, with shortcut involving pointer_eq;
wenzelm
parents:
41516
diff
changeset
|
359 |
pointer_eq (list1, list2) orelse |
38b29c9fc742
slightly more special eq_list/eq_set, with shortcut involving pointer_eq;
wenzelm
parents:
41516
diff
changeset
|
360 |
let |
38b29c9fc742
slightly more special eq_list/eq_set, with shortcut involving pointer_eq;
wenzelm
parents:
41516
diff
changeset
|
361 |
fun eq_lst (x :: xs, y :: ys) = eq (x, y) andalso eq_lst (xs, ys) |
38b29c9fc742
slightly more special eq_list/eq_set, with shortcut involving pointer_eq;
wenzelm
parents:
41516
diff
changeset
|
362 |
| eq_lst _ = true; |
38b29c9fc742
slightly more special eq_list/eq_set, with shortcut involving pointer_eq;
wenzelm
parents:
41516
diff
changeset
|
363 |
in length list1 = length list2 andalso eq_lst (list1, list2) end; |
20348 | 364 |
|
19483
55ee839198bd
renamed mapfilter to map_filter, made pervasive (again);
wenzelm
parents:
19474
diff
changeset
|
365 |
fun maps f [] = [] |
55ee839198bd
renamed mapfilter to map_filter, made pervasive (again);
wenzelm
parents:
19474
diff
changeset
|
366 |
| maps f (x :: xs) = f x @ maps f xs; |
55ee839198bd
renamed mapfilter to map_filter, made pervasive (again);
wenzelm
parents:
19474
diff
changeset
|
367 |
|
25538 | 368 |
val filter = List.filter; |
369 |
fun filter_out f = filter (not o f); |
|
370 |
val map_filter = List.mapPartial; |
|
371 |
||
33955 | 372 |
fun take (0: int) xs = [] |
373 |
| take _ [] = [] |
|
34059 | 374 |
| take n (x :: xs) = x :: take (n - 1) xs; |
33955 | 375 |
|
376 |
fun drop (0: int) xs = xs |
|
377 |
| drop _ [] = [] |
|
34059 | 378 |
| drop n (x :: xs) = drop (n - 1) xs; |
33955 | 379 |
|
24593
1547ea587f5a
added some int constraints (ML_Parse.fix_ints not active here);
wenzelm
parents:
24148
diff
changeset
|
380 |
fun chop (0: int) xs = ([], xs) |
23220 | 381 |
| chop _ [] = ([], []) |
382 |
| chop n (x :: xs) = chop (n - 1) xs |>> cons x; |
|
19011 | 383 |
|
46891 | 384 |
fun chop_groups n list = |
385 |
(case chop (Int.max (n, 1)) list of |
|
386 |
([], _) => [] |
|
387 |
| (g, rest) => g :: chop_groups n rest); |
|
388 |
||
389 |
||
233 | 390 |
(*return nth element of a list, where 0 designates the first element; |
18461 | 391 |
raise Subscript if list too short*) |
18011
685d95c793ff
cleaned up nth, nth_update, nth_map and nth_string functions
haftmann
parents:
17952
diff
changeset
|
392 |
fun nth xs i = List.nth (xs, i); |
233 | 393 |
|
43278 | 394 |
fun nth_list xss i = nth xss i handle General.Subscript => []; |
18461 | 395 |
|
18011
685d95c793ff
cleaned up nth, nth_update, nth_map and nth_string functions
haftmann
parents:
17952
diff
changeset
|
396 |
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
|
397 |
| 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
|
398 |
| nth_map (_: int) _ [] = raise Subscript; |
11773 | 399 |
|
24846 | 400 |
fun nth_drop n xs = |
401 |
List.take (xs, n) @ List.drop (xs, n + 1); |
|
402 |
||
18514 | 403 |
fun map_index f = |
404 |
let |
|
52271
6f3771c00280
combinator fold_range, corresponding to map_range
haftmann
parents:
51990
diff
changeset
|
405 |
fun map_aux (_: int) [] = [] |
6f3771c00280
combinator fold_range, corresponding to map_range
haftmann
parents:
51990
diff
changeset
|
406 |
| map_aux i (x :: xs) = f (i, x) :: map_aux (i + 1) xs |
6f3771c00280
combinator fold_range, corresponding to map_range
haftmann
parents:
51990
diff
changeset
|
407 |
in map_aux 0 end; |
18514 | 408 |
|
21118 | 409 |
fun fold_index f = |
410 |
let |
|
24593
1547ea587f5a
added some int constraints (ML_Parse.fix_ints not active here);
wenzelm
parents:
24148
diff
changeset
|
411 |
fun fold_aux (_: int) [] y = y |
52271
6f3771c00280
combinator fold_range, corresponding to map_range
haftmann
parents:
51990
diff
changeset
|
412 |
| fold_aux i (x :: xs) y = fold_aux (i + 1) xs (f (i, x) y) |
21118 | 413 |
in fold_aux 0 end; |
414 |
||
33063 | 415 |
fun map_range f i = |
416 |
let |
|
52271
6f3771c00280
combinator fold_range, corresponding to map_range
haftmann
parents:
51990
diff
changeset
|
417 |
fun map_aux (k: int) = |
6f3771c00280
combinator fold_range, corresponding to map_range
haftmann
parents:
51990
diff
changeset
|
418 |
if k < i then f k :: map_aux (k + 1) else [] |
6f3771c00280
combinator fold_range, corresponding to map_range
haftmann
parents:
51990
diff
changeset
|
419 |
in map_aux 0 end; |
6f3771c00280
combinator fold_range, corresponding to map_range
haftmann
parents:
51990
diff
changeset
|
420 |
|
6f3771c00280
combinator fold_range, corresponding to map_range
haftmann
parents:
51990
diff
changeset
|
421 |
fun fold_range f i = |
6f3771c00280
combinator fold_range, corresponding to map_range
haftmann
parents:
51990
diff
changeset
|
422 |
let |
6f3771c00280
combinator fold_range, corresponding to map_range
haftmann
parents:
51990
diff
changeset
|
423 |
fun fold_aux (k: int) y = |
6f3771c00280
combinator fold_range, corresponding to map_range
haftmann
parents:
51990
diff
changeset
|
424 |
if k < i then fold_aux (k + 1) (f k y) else y |
6f3771c00280
combinator fold_range, corresponding to map_range
haftmann
parents:
51990
diff
changeset
|
425 |
in fold_aux 0 end; |
6f3771c00280
combinator fold_range, corresponding to map_range
haftmann
parents:
51990
diff
changeset
|
426 |
|
33063 | 427 |
|
3762 | 428 |
(*rear decomposition*) |
47060
e2741ec9ae36
prefer explicitly qualified exception List.Empty;
wenzelm
parents:
47023
diff
changeset
|
429 |
fun split_last [] = raise List.Empty |
3762 | 430 |
| split_last [x] = ([], x) |
431 |
| split_last (x :: xs) = apfst (cons x) (split_last xs); |
|
432 |
||
46891 | 433 |
(*find first element satisfying predicate*) |
434 |
val find_first = List.find; |
|
435 |
||
29209 | 436 |
(*find position of first element satisfying a predicate*) |
4212 | 437 |
fun find_index pred = |
24593
1547ea587f5a
added some int constraints (ML_Parse.fix_ints not active here);
wenzelm
parents:
24148
diff
changeset
|
438 |
let fun find (_: int) [] = ~1 |
4212 | 439 |
| find n (x :: xs) = if pred x then n else find (n + 1) xs; |
440 |
in find 0 end; |
|
3762 | 441 |
|
4916
fe8b0c82691b
get_first: ('a -> 'b option) -> 'a list -> 'b option;
wenzelm
parents:
4893
diff
changeset
|
442 |
(*get first element by lookup function*) |
15531 | 443 |
fun get_first _ [] = NONE |
4916
fe8b0c82691b
get_first: ('a -> 'b option) -> 'a list -> 'b option;
wenzelm
parents:
4893
diff
changeset
|
444 |
| get_first f (x :: xs) = |
fe8b0c82691b
get_first: ('a -> 'b option) -> 'a list -> 'b option;
wenzelm
parents:
4893
diff
changeset
|
445 |
(case f x of |
15531 | 446 |
NONE => get_first f xs |
4916
fe8b0c82691b
get_first: ('a -> 'b option) -> 'a list -> 'b option;
wenzelm
parents:
4893
diff
changeset
|
447 |
| some => some); |
fe8b0c82691b
get_first: ('a -> 'b option) -> 'a list -> 'b option;
wenzelm
parents:
4893
diff
changeset
|
448 |
|
19233
77ca20b0ed77
renamed HOL + - * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19119
diff
changeset
|
449 |
fun get_index f = |
77ca20b0ed77
renamed HOL + - * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19119
diff
changeset
|
450 |
let |
24593
1547ea587f5a
added some int constraints (ML_Parse.fix_ints not active here);
wenzelm
parents:
24148
diff
changeset
|
451 |
fun get (_: int) [] = NONE |
19461 | 452 |
| get i (x :: xs) = |
46838 | 453 |
(case f x of |
454 |
NONE => get (i + 1) xs |
|
455 |
| SOME y => SOME (i, y)) |
|
19233
77ca20b0ed77
renamed HOL + - * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19119
diff
changeset
|
456 |
in get 0 end; |
77ca20b0ed77
renamed HOL + - * etc. to HOL.plus HOL.minus HOL.times etc.
haftmann
parents:
19119
diff
changeset
|
457 |
|
15531 | 458 |
val flat = List.concat; |
233 | 459 |
|
12136 | 460 |
fun unflat (xs :: xss) ys = |
19424 | 461 |
let val (ps, qs) = chop (length xs) ys |
13629 | 462 |
in ps :: unflat xss qs end |
12136 | 463 |
| unflat [] [] = [] |
40722
441260986b63
make two copies (!) of Library.UnequalLengths coincide with ListPair.UnequalLengths;
wenzelm
parents:
40721
diff
changeset
|
464 |
| unflat _ _ = raise ListPair.UnequalLengths; |
12136 | 465 |
|
46891 | 466 |
fun grouped n comb f = chop_groups n #> comb (map f) #> flat; |
467 |
||
21479
63e7eb863ae6
moved string_of_pair/list/option to structure ML_Syntax;
wenzelm
parents:
21395
diff
changeset
|
468 |
fun burrow f xss = unflat xss (f (flat xss)); |
18359 | 469 |
|
24864 | 470 |
fun burrow_options f os = map (try hd) (burrow f (map the_list os)); |
471 |
||
18549
5308a6ea3b96
rearranged burrow_split to fold_burrow to allow composition with fold_map
haftmann
parents:
18514
diff
changeset
|
472 |
fun fold_burrow f xss s = |
5308a6ea3b96
rearranged burrow_split to fold_burrow to allow composition with fold_map
haftmann
parents:
18514
diff
changeset
|
473 |
apfst (unflat xss) (f (flat xss) s); |
18359 | 474 |
|
233 | 475 |
(*separate s [x1, x2, ..., xn] ===> [x1, s, x2, s, ..., s, xn]*) |
476 |
fun separate s (x :: (xs as _ :: _)) = x :: s :: separate s xs |
|
477 |
| separate _ xs = xs; |
|
478 |
||
25980 | 479 |
fun surround s (x :: xs) = s :: x :: surround s xs |
480 |
| surround s [] = [s]; |
|
481 |
||
233 | 482 |
(*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
|
483 |
fun replicate (n: int) x = |
233 | 484 |
let fun rep (0, xs) = xs |
485 |
| rep (n, xs) = rep (n - 1, x :: xs) |
|
486 |
in |
|
15570 | 487 |
if n < 0 then raise Subscript |
233 | 488 |
else rep (n, []) |
489 |
end; |
|
490 |
||
4248
5e8a31c41d44
added get_error: 'a error -> string option, get_ok: 'a error -> 'a option;
wenzelm
parents:
4224
diff
changeset
|
491 |
|
25549 | 492 |
(* direct product *) |
493 |
||
25538 | 494 |
fun map_product f _ [] = [] |
495 |
| map_product f [] _ = [] |
|
496 |
| map_product f (x :: xs) ys = map (f x) ys @ map_product f xs ys; |
|
233 | 497 |
|
25538 | 498 |
fun fold_product f _ [] z = z |
499 |
| fold_product f [] _ z = z |
|
500 |
| fold_product f (x :: xs) ys z = z |> fold (f x) ys |> fold_product f xs ys; |
|
233 | 501 |
|
25549 | 502 |
|
503 |
(* lists of pairs *) |
|
233 | 504 |
|
18330 | 505 |
fun map2 _ [] [] = [] |
506 |
| 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
|
507 |
| map2 _ _ _ = raise ListPair.UnequalLengths; |
380 | 508 |
|
58633 | 509 |
fun fold2 _ [] [] z = z |
23220 | 510 |
| fold2 f (x :: xs) (y :: ys) z = fold2 f xs ys (f x y z) |
58633 | 511 |
| fold2 _ _ _ _ = raise ListPair.UnequalLengths; |
380 | 512 |
|
58633 | 513 |
fun map_split _ [] = ([], []) |
25943 | 514 |
| map_split f (x :: xs) = |
515 |
let |
|
516 |
val (y, w) = f x; |
|
517 |
val (ys, ws) = map_split f xs; |
|
518 |
in (y :: ys, w :: ws) end; |
|
519 |
||
19799 | 520 |
fun zip_options (x :: xs) (SOME y :: ys) = (x, y) :: zip_options xs ys |
521 |
| zip_options (_ :: xs) (NONE :: ys) = zip_options xs ys |
|
522 |
| zip_options _ [] = [] |
|
40722
441260986b63
make two copies (!) of Library.UnequalLengths coincide with ListPair.UnequalLengths;
wenzelm
parents:
40721
diff
changeset
|
523 |
| 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
|
524 |
|
233 | 525 |
(*combine two lists forming a list of pairs: |
526 |
[x1, ..., xn] ~~ [y1, ..., yn] ===> [(x1, y1), ..., (xn, yn)]*) |
|
527 |
fun [] ~~ [] = [] |
|
528 |
| (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
|
529 |
| _ ~~ _ = raise ListPair.UnequalLengths; |
233 | 530 |
|
531 |
(*inverse of ~~; the old 'split': |
|
532 |
[(x1, y1), ..., (xn, yn)] ===> ([x1, ..., xn], [y1, ..., yn])*) |
|
15570 | 533 |
val split_list = ListPair.unzip; |
233 | 534 |
|
28347 | 535 |
fun burrow_fst f xs = split_list xs |>> f |> op ~~; |
536 |
||
233 | 537 |
|
538 |
(* prefixes, suffixes *) |
|
539 |
||
18441 | 540 |
fun is_prefix _ [] _ = true |
541 |
| is_prefix eq (x :: xs) (y :: ys) = eq (x, y) andalso is_prefix eq xs ys |
|
542 |
| is_prefix eq _ _ = false; |
|
233 | 543 |
|
544 |
(* [x1, ..., xi, ..., xn] ---> ([x1, ..., x(i-1)], [xi, ..., xn]) |
|
545 |
where xi is the first element that does not satisfy the predicate*) |
|
546 |
fun take_prefix (pred : 'a -> bool) (xs: 'a list) : 'a list * 'a list = |
|
547 |
let fun take (rxs, []) = (rev rxs, []) |
|
255
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset
|
548 |
| take (rxs, x :: xs) = |
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset
|
549 |
if pred x then take(x :: rxs, xs) else (rev rxs, x :: xs) |
233 | 550 |
in take([], xs) end; |
551 |
||
20108 | 552 |
fun chop_prefix eq ([], ys) = ([], ([], ys)) |
553 |
| chop_prefix eq (xs, []) = ([], (xs, [])) |
|
23220 | 554 |
| chop_prefix eq (xs as x :: xs', ys as y :: ys') = |
20108 | 555 |
if eq (x, y) then |
556 |
let val (ps', xys'') = chop_prefix eq (xs', ys') |
|
23220 | 557 |
in (x :: ps', xys'') end |
20108 | 558 |
else ([], (xs, ys)); |
559 |
||
233 | 560 |
(* [x1, ..., xi, ..., xn] ---> ([x1, ..., xi], [x(i+1), ..., xn]) |
561 |
where xi is the last element that does not satisfy the predicate*) |
|
562 |
fun take_suffix _ [] = ([], []) |
|
563 |
| take_suffix pred (x :: xs) = |
|
564 |
(case take_suffix pred xs of |
|
565 |
([], sffx) => if pred x then ([], x :: sffx) else ([x], sffx) |
|
566 |
| (prfx, sffx) => (x :: prfx, sffx)); |
|
567 |
||
12249 | 568 |
fun prefixes1 [] = [] |
569 |
| prefixes1 (x :: xs) = map (cons x) ([] :: prefixes1 xs); |
|
570 |
||
19011 | 571 |
fun prefixes xs = [] :: prefixes1 xs; |
572 |
||
12249 | 573 |
fun suffixes1 xs = map rev (prefixes1 (rev xs)); |
19011 | 574 |
fun suffixes xs = [] :: suffixes1 xs; |
233 | 575 |
|
61707 | 576 |
fun trim pred = take_prefix pred #> #2 #> take_suffix pred #> #1; |
23220 | 577 |
|
578 |
||
233 | 579 |
(** integers **) |
580 |
||
581 |
(* lists of integers *) |
|
582 |
||
583 |
(*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
|
584 |
fun ((i: int) upto j) = |
21859 | 585 |
if i > j then [] else i :: (i + 1 upto j); |
233 | 586 |
|
587 |
(*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
|
588 |
fun ((i: int) downto j) = |
21859 | 589 |
if i < j then [] else i :: (i - 1 downto j); |
233 | 590 |
|
591 |
||
592 |
(* convert integers to strings *) |
|
593 |
||
594 |
(*expand the number in the given base; |
|
595 |
example: radixpand (2, 8) gives [1, 0, 0, 0]*) |
|
596 |
fun radixpand (base, num) : int list = |
|
597 |
let |
|
598 |
fun radix (n, tail) = |
|
599 |
if n < base then n :: tail |
|
600 |
else radix (n div base, (n mod base) :: tail) |
|
601 |
in radix (num, []) end; |
|
602 |
||
603 |
(*expands a number into a string of characters starting from "zerochar"; |
|
604 |
example: radixstring (2, "0", 8) gives "1000"*) |
|
605 |
fun radixstring (base, zerochar, num) = |
|
606 |
let val offset = ord zerochar; |
|
607 |
fun chrof n = chr (offset + n) |
|
608 |
in implode (map chrof (radixpand (base, num))) end; |
|
609 |
||
610 |
||
41492
7a4138cb46db
tuned string_of_int to avoid allocation for small integers;
wenzelm
parents:
41489
diff
changeset
|
611 |
local |
7a4138cb46db
tuned string_of_int to avoid allocation for small integers;
wenzelm
parents:
41489
diff
changeset
|
612 |
val zero = ord "0"; |
57909
0fb331032f02
more compact representation of special string values;
wenzelm
parents:
57884
diff
changeset
|
613 |
val small_int = 10000: int; |
0fb331032f02
more compact representation of special string values;
wenzelm
parents:
57884
diff
changeset
|
614 |
val small_int_table = Vector.tabulate (small_int, Int.toString); |
41492
7a4138cb46db
tuned string_of_int to avoid allocation for small integers;
wenzelm
parents:
41489
diff
changeset
|
615 |
in |
7a4138cb46db
tuned string_of_int to avoid allocation for small integers;
wenzelm
parents:
41489
diff
changeset
|
616 |
|
7a4138cb46db
tuned string_of_int to avoid allocation for small integers;
wenzelm
parents:
41489
diff
changeset
|
617 |
fun string_of_int i = |
7a4138cb46db
tuned string_of_int to avoid allocation for small integers;
wenzelm
parents:
41489
diff
changeset
|
618 |
if i < 0 then Int.toString i |
7a4138cb46db
tuned string_of_int to avoid allocation for small integers;
wenzelm
parents:
41489
diff
changeset
|
619 |
else if i < 10 then chr (zero + i) |
57909
0fb331032f02
more compact representation of special string values;
wenzelm
parents:
57884
diff
changeset
|
620 |
else if i < small_int then Vector.sub (small_int_table, i) |
41492
7a4138cb46db
tuned string_of_int to avoid allocation for small integers;
wenzelm
parents:
41489
diff
changeset
|
621 |
else Int.toString i; |
7a4138cb46db
tuned string_of_int to avoid allocation for small integers;
wenzelm
parents:
41489
diff
changeset
|
622 |
|
7a4138cb46db
tuned string_of_int to avoid allocation for small integers;
wenzelm
parents:
41489
diff
changeset
|
623 |
end; |
233 | 624 |
|
21942
d6218d0f9ec3
added signed_string_of_int (pruduces proper - instead of SML's ~);
wenzelm
parents:
21920
diff
changeset
|
625 |
fun signed_string_of_int i = |
d6218d0f9ec3
added signed_string_of_int (pruduces proper - instead of SML's ~);
wenzelm
parents:
21920
diff
changeset
|
626 |
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
|
627 |
|
23220 | 628 |
fun string_of_indexname (a, 0) = a |
629 |
| string_of_indexname (a, i) = a ^ "_" ^ string_of_int i; |
|
233 | 630 |
|
631 |
||
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
|
632 |
(* 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
|
633 |
|
24630
351a308ab58d
simplified type int (eliminated IntInf.int, integer);
wenzelm
parents:
24593
diff
changeset
|
634 |
fun read_radix_int radix cs = |
20095 | 635 |
let |
636 |
val zero = ord "0"; |
|
637 |
val limit = zero + radix; |
|
638 |
fun scan (num, []) = (num, []) |
|
639 |
| scan (num, c :: cs) = |
|
50637 | 640 |
if zero <= ord c andalso ord c < limit then |
641 |
scan (radix * num + (ord c - zero), cs) |
|
642 |
else (num, c :: cs); |
|
24630
351a308ab58d
simplified type int (eliminated IntInf.int, integer);
wenzelm
parents:
24593
diff
changeset
|
643 |
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
|
644 |
|
24630
351a308ab58d
simplified type int (eliminated IntInf.int, integer);
wenzelm
parents:
24593
diff
changeset
|
645 |
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
|
646 |
|
40627
becf5d5187cc
renamed raw "explode" function to "raw_explode" to emphasize its meaning;
wenzelm
parents:
40564
diff
changeset
|
647 |
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
|
648 |
|
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
|
649 |
|
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
|
650 |
|
233 | 651 |
(** strings **) |
652 |
||
16188 | 653 |
(* functions tuned for strings, avoiding explode *) |
6312 | 654 |
|
18011
685d95c793ff
cleaned up nth, nth_update, nth_map and nth_string functions
haftmann
parents:
17952
diff
changeset
|
655 |
fun nth_string str i = |
6959 | 656 |
(case try String.substring (str, i, 1) of |
15531 | 657 |
SOME s => s |
15570 | 658 |
| NONE => raise Subscript); |
6312 | 659 |
|
16188 | 660 |
fun fold_string f str x0 = |
6282 | 661 |
let |
662 |
val n = size str; |
|
16188 | 663 |
fun iter (x, i) = |
664 |
if i < n then iter (f (String.substring (str, i, 1)) x, i + 1) else x; |
|
665 |
in iter (x0, 0) end; |
|
6282 | 666 |
|
14968 | 667 |
fun exists_string pred str = |
668 |
let |
|
669 |
val n = size str; |
|
670 |
fun ex i = i < n andalso (pred (String.substring (str, i, 1)) orelse ex (i + 1)); |
|
671 |
in ex 0 end; |
|
6312 | 672 |
|
16188 | 673 |
fun forall_string pred = not o exists_string (not o pred); |
674 |
||
28025 | 675 |
fun first_field sep str = |
28022 | 676 |
let |
28025 | 677 |
val n = size sep; |
28022 | 678 |
val len = size str; |
679 |
fun find i = |
|
680 |
if i + n > len then NONE |
|
28025 | 681 |
else if String.substring (str, i, n) = sep then SOME i |
28022 | 682 |
else find (i + 1); |
28025 | 683 |
in |
684 |
(case find 0 of |
|
685 |
NONE => NONE |
|
686 |
| SOME i => SOME (String.substring (str, 0, i), String.extract (str, i + n, NONE))) |
|
687 |
end; |
|
28022 | 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 |
|
55033 | 696 |
val cartouche = enclose "\\<open>" "\\<close>"; |
697 |
||
59469 | 698 |
val space_implode = String.concatWith; |
233 | 699 |
|
255
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset
|
700 |
val commas = space_implode ", "; |
380 | 701 |
val commas_quote = commas o map quote; |
255
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset
|
702 |
|
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 |
|
56038
0e2dec666152
tuned messages -- in accordance to Isabelle/Scala;
wenzelm
parents:
55033
diff
changeset
|
711 |
fun plain_words s = space_explode "_" s |> space_implode " "; |
0e2dec666152
tuned messages -- in accordance to Isabelle/Scala;
wenzelm
parents:
55033
diff
changeset
|
712 |
|
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
|
713 |
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
|
714 |
| 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
|
715 |
|
18681
3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset
|
716 |
fun prefix prfx s = prfx ^ s; |
16188 | 717 |
fun suffix sffx s = s ^ sffx; |
5285 | 718 |
|
18681
3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset
|
719 |
fun unprefix prfx s = |
3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset
|
720 |
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
|
721 |
else raise Fail "unprefix"; |
3020496cff28
added exception ERROR, error, cat_error, sys_error, assert, deny, assert_all;
wenzelm
parents:
18549
diff
changeset
|
722 |
|
16188 | 723 |
fun unsuffix sffx s = |
17061 | 724 |
if String.isSuffix sffx s then String.substring (s, 0, size s - size sffx) |
725 |
else raise Fail "unsuffix"; |
|
5285 | 726 |
|
47499
4b0daca2bf88
redirect bash stderr to Isabelle warning as appropriate -- avoid raw process error output which may either get ignored or overload PIDE syslog in extreme cases;
wenzelm
parents:
47060
diff
changeset
|
727 |
val trim_line = perhaps (try (unsuffix "\n")); |
4b0daca2bf88
redirect bash stderr to Isabelle warning as appropriate -- avoid raw process error output which may either get ignored or overload PIDE syslog in extreme cases;
wenzelm
parents:
47060
diff
changeset
|
728 |
|
24593
1547ea587f5a
added some int constraints (ML_Parse.fix_ints not active here);
wenzelm
parents:
24148
diff
changeset
|
729 |
fun replicate_string (0: int) _ = "" |
10951 | 730 |
| replicate_string 1 a = a |
731 |
| replicate_string k a = |
|
732 |
if k mod 2 = 0 then replicate_string (k div 2) (a ^ a) |
|
733 |
else replicate_string (k div 2) (a ^ a) ^ a; |
|
734 |
||
31250 | 735 |
fun translate_string f = String.translate (f o String.str); |
736 |
||
29882
29154e67731d
New command find_consts searching for constants by type (by Timothy Bourke).
kleing
parents:
29209
diff
changeset
|
737 |
(*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
|
738 |
fun match_string pat str = |
29154e67731d
New command find_consts searching for constants by type (by Timothy Bourke).
kleing
parents:
29209
diff
changeset
|
739 |
let |
29154e67731d
New command find_consts searching for constants by type (by Timothy Bourke).
kleing
parents:
29209
diff
changeset
|
740 |
fun match [] _ = true |
29154e67731d
New command find_consts searching for constants by type (by Timothy Bourke).
kleing
parents:
29209
diff
changeset
|
741 |
| match (p :: ps) s = |
29154e67731d
New command find_consts searching for constants by type (by Timothy Bourke).
kleing
parents:
29209
diff
changeset
|
742 |
size p <= size s andalso |
29154e67731d
New command find_consts searching for constants by type (by Timothy Bourke).
kleing
parents:
29209
diff
changeset
|
743 |
(case try (unprefix p) s of |
29154e67731d
New command find_consts searching for constants by type (by Timothy Bourke).
kleing
parents:
29209
diff
changeset
|
744 |
SOME s' => match ps s' |
29154e67731d
New command find_consts searching for constants by type (by Timothy Bourke).
kleing
parents:
29209
diff
changeset
|
745 |
| 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
|
746 |
in match (space_explode "*" pat) str end; |
23220 | 747 |
|
35976 | 748 |
|
41516
3a70387b5e01
smart_string_of_real: print integer values without fractional part;
wenzelm
parents:
41494
diff
changeset
|
749 |
(** reals **) |
3a70387b5e01
smart_string_of_real: print integer values without fractional part;
wenzelm
parents:
41494
diff
changeset
|
750 |
|
3a70387b5e01
smart_string_of_real: print integer values without fractional part;
wenzelm
parents:
41494
diff
changeset
|
751 |
val string_of_real = Real.fmt (StringCvt.GEN NONE); |
3a70387b5e01
smart_string_of_real: print integer values without fractional part;
wenzelm
parents:
41494
diff
changeset
|
752 |
|
3a70387b5e01
smart_string_of_real: print integer values without fractional part;
wenzelm
parents:
41494
diff
changeset
|
753 |
fun signed_string_of_real x = |
3a70387b5e01
smart_string_of_real: print integer values without fractional part;
wenzelm
parents:
41494
diff
changeset
|
754 |
if x < 0.0 then "-" ^ string_of_real (~ x) else string_of_real x; |
3a70387b5e01
smart_string_of_real: print integer values without fractional part;
wenzelm
parents:
41494
diff
changeset
|
755 |
|
3a70387b5e01
smart_string_of_real: print integer values without fractional part;
wenzelm
parents:
41494
diff
changeset
|
756 |
|
35976 | 757 |
|
16492 | 758 |
(** lists as sets -- see also Pure/General/ord_list.ML **) |
233 | 759 |
|
26439 | 760 |
(* canonical operations *) |
761 |
||
18923 | 762 |
fun member eq list x = |
763 |
let |
|
764 |
fun memb [] = false |
|
765 |
| memb (y :: ys) = eq (x, y) orelse memb ys; |
|
766 |
in memb list end; |
|
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
767 |
|
18923 | 768 |
fun insert eq x xs = if member eq xs x then xs else x :: xs; |
769 |
fun remove eq x xs = if member eq xs x then filter_out (fn y => eq (x, y)) xs else xs; |
|
24049 | 770 |
fun update eq x xs = cons x (remove eq x xs); |
233 | 771 |
|
33049
c38f02fdf35d
curried inter as canonical list operation (beware of argument order)
haftmann
parents:
33040
diff
changeset
|
772 |
fun inter eq xs = filter (member eq xs); |
c38f02fdf35d
curried inter as canonical list operation (beware of argument order)
haftmann
parents:
33040
diff
changeset
|
773 |
|
33042 | 774 |
fun union eq = fold (insert eq); |
19301 | 775 |
fun subtract eq = fold (remove eq); |
776 |
||
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 non-standard eq/ord notion;
wenzelm
parents:
30570
diff
changeset
|
777 |
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 non-standard eq/ord notion;
wenzelm
parents:
30570
diff
changeset
|
778 |
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 non-standard eq/ord notion;
wenzelm
parents:
30570
diff
changeset
|
779 |
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 non-standard eq/ord notion;
wenzelm
parents:
30570
diff
changeset
|
780 |
else fold_rev (insert eq) ys xs; |
0 | 781 |
|
26439 | 782 |
|
33050 | 783 |
(* subset and set equality *) |
784 |
||
33038 | 785 |
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
|
786 |
|
33038 | 787 |
fun eq_set eq (xs, ys) = |
20348 | 788 |
eq_list eq (xs, ys) orelse |
33038 | 789 |
(subset eq (xs, ys) andalso subset (eq o swap) (ys, xs)); |
19301 | 790 |
|
265 | 791 |
|
233 | 792 |
(*makes a list of the distinct members of the input; preserves order, takes |
793 |
first of equal elements*) |
|
19046
bc5c6c9b114e
removed distinct, renamed gen_distinct to distinct;
wenzelm
parents:
19011
diff
changeset
|
794 |
fun distinct eq lst = |
233 | 795 |
let |
796 |
fun dist (rev_seen, []) = rev rev_seen |
|
797 |
| dist (rev_seen, x :: xs) = |
|
18923 | 798 |
if member eq rev_seen x then dist (rev_seen, xs) |
233 | 799 |
else dist (x :: rev_seen, xs); |
19046
bc5c6c9b114e
removed distinct, renamed gen_distinct to distinct;
wenzelm
parents:
19011
diff
changeset
|
800 |
in dist ([], lst) end; |
233 | 801 |
|
255
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset
|
802 |
(*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
|
803 |
order, takes first of equal elements*) |
18966 | 804 |
fun duplicates eq lst = |
255
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset
|
805 |
let |
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset
|
806 |
fun dups (rev_dups, []) = rev rev_dups |
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset
|
807 |
| dups (rev_dups, x :: xs) = |
18923 | 808 |
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
|
809 |
dups (rev_dups, xs) |
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset
|
810 |
else dups (x :: rev_dups, xs); |
18966 | 811 |
in dups ([], lst) end; |
255
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset
|
812 |
|
16878 | 813 |
fun has_duplicates eq = |
814 |
let |
|
815 |
fun dups [] = false |
|
816 |
| dups (x :: xs) = member eq xs x orelse dups xs; |
|
817 |
in dups end; |
|
818 |
||
255
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset
|
819 |
|
32352 | 820 |
(* matrices *) |
821 |
||
822 |
fun map_transpose f xss = |
|
823 |
let |
|
40722
441260986b63
make two copies (!) of Library.UnequalLengths coincide with ListPair.UnequalLengths;
wenzelm
parents:
40721
diff
changeset
|
824 |
val n = |
441260986b63
make two copies (!) of Library.UnequalLengths coincide with ListPair.UnequalLengths;
wenzelm
parents:
40721
diff
changeset
|
825 |
(case distinct (op =) (map length xss) of |
441260986b63
make two copies (!) of Library.UnequalLengths coincide with ListPair.UnequalLengths;
wenzelm
parents:
40721
diff
changeset
|
826 |
[] => 0 |
32352 | 827 |
| [n] => n |
40722
441260986b63
make two copies (!) of Library.UnequalLengths coincide with ListPair.UnequalLengths;
wenzelm
parents:
40721
diff
changeset
|
828 |
| _ => raise ListPair.UnequalLengths); |
33206 | 829 |
in map_range (fn m => f (map (fn xs => nth xs m) xss)) n end; |
32352 | 830 |
|
831 |
||
23220 | 832 |
|
22142 | 833 |
(** lists as multisets **) |
834 |
||
33078
3aea60ca3900
multiset operations with canonical argument order
haftmann
parents:
33063
diff
changeset
|
835 |
fun remove1 eq x [] = [] |
3aea60ca3900
multiset operations with canonical argument order
haftmann
parents:
33063
diff
changeset
|
836 |
| remove1 eq x (y :: ys) = if eq (x, y) then ys else y :: remove1 eq x ys; |
22142 | 837 |
|
33078
3aea60ca3900
multiset operations with canonical argument order
haftmann
parents:
33063
diff
changeset
|
838 |
fun combine eq xs ys = fold (remove1 eq) ys xs @ ys; |
233 | 839 |
|
33079 | 840 |
fun submultiset _ ([], _) = true |
841 |
| submultiset eq (x :: xs, ys) = member eq ys x andalso submultiset eq (xs, remove1 eq x ys); |
|
842 |
||
0 | 843 |
|
844 |
||
2506 | 845 |
(** orders **) |
846 |
||
18966 | 847 |
fun is_equal EQUAL = true |
848 |
| is_equal _ = false; |
|
849 |
||
4445 | 850 |
fun rev_order LESS = GREATER |
851 |
| rev_order EQUAL = EQUAL |
|
852 |
| rev_order GREATER = LESS; |
|
853 |
||
4479 | 854 |
(*assume rel is a linear strict order*) |
4445 | 855 |
fun make_ord rel (x, y) = |
856 |
if rel (x, y) then LESS |
|
857 |
else if rel (y, x) then GREATER |
|
858 |
else EQUAL; |
|
859 |
||
25224 | 860 |
fun bool_ord (false, true) = LESS |
861 |
| bool_ord (true, false) = GREATER |
|
862 |
| bool_ord _ = EQUAL; |
|
863 |
||
15051
0dbbab9f77fe
int_ord = Int.compare, string_ord = String.compare;
wenzelm
parents:
15035
diff
changeset
|
864 |
val int_ord = Int.compare; |
0dbbab9f77fe
int_ord = Int.compare, string_ord = String.compare;
wenzelm
parents:
15035
diff
changeset
|
865 |
val string_ord = String.compare; |
2506 | 866 |
|
16676 | 867 |
fun fast_string_ord (s1, s2) = |
43793 | 868 |
if pointer_eq (s1, s2) then EQUAL |
869 |
else (case int_ord (size s1, size s2) of EQUAL => string_ord (s1, s2) | ord => ord); |
|
16676 | 870 |
|
16492 | 871 |
fun option_ord ord (SOME x, SOME y) = ord (x, y) |
872 |
| option_ord _ (NONE, NONE) = EQUAL |
|
873 |
| option_ord _ (NONE, SOME _) = LESS |
|
874 |
| option_ord _ (SOME _, NONE) = GREATER; |
|
875 |
||
4343 | 876 |
(*lexicographic product*) |
877 |
fun prod_ord a_ord b_ord ((x, y), (x', y')) = |
|
878 |
(case a_ord (x, x') of EQUAL => b_ord (y, y') | ord => ord); |
|
879 |
||
880 |
(*dictionary order -- in general NOT well-founded!*) |
|
16984 | 881 |
fun dict_ord elem_ord (x :: xs, y :: ys) = |
882 |
(case elem_ord (x, y) of EQUAL => dict_ord elem_ord (xs, ys) | ord => ord) |
|
883 |
| dict_ord _ ([], []) = EQUAL |
|
4343 | 884 |
| dict_ord _ ([], _ :: _) = LESS |
16984 | 885 |
| dict_ord _ (_ :: _, []) = GREATER; |
4343 | 886 |
|
887 |
(*lexicographic product of lists*) |
|
888 |
fun list_ord elem_ord (xs, ys) = |
|
16676 | 889 |
(case int_ord (length xs, length ys) of EQUAL => dict_ord elem_ord (xs, ys) | ord => ord); |
4343 | 890 |
|
2506 | 891 |
|
4621 | 892 |
(* sorting *) |
893 |
||
48271
b28defd0b5a5
replaced quicksort by mergesort, which might be a bit more efficient for key operations like Ord_List.make, Sorts.minimize_sort;
wenzelm
parents:
47499
diff
changeset
|
894 |
(*stable mergesort -- preserves order of equal elements*) |
b28defd0b5a5
replaced quicksort by mergesort, which might be a bit more efficient for key operations like Ord_List.make, Sorts.minimize_sort;
wenzelm
parents:
47499
diff
changeset
|
895 |
fun mergesort unique ord = |
4621 | 896 |
let |
48271
b28defd0b5a5
replaced quicksort by mergesort, which might be a bit more efficient for key operations like Ord_List.make, Sorts.minimize_sort;
wenzelm
parents:
47499
diff
changeset
|
897 |
fun merge (xs as x :: xs') (ys as y :: ys') = |
b28defd0b5a5
replaced quicksort by mergesort, which might be a bit more efficient for key operations like Ord_List.make, Sorts.minimize_sort;
wenzelm
parents:
47499
diff
changeset
|
898 |
(case ord (x, y) of |
b28defd0b5a5
replaced quicksort by mergesort, which might be a bit more efficient for key operations like Ord_List.make, Sorts.minimize_sort;
wenzelm
parents:
47499
diff
changeset
|
899 |
LESS => x :: merge xs' ys |
b28defd0b5a5
replaced quicksort by mergesort, which might be a bit more efficient for key operations like Ord_List.make, Sorts.minimize_sort;
wenzelm
parents:
47499
diff
changeset
|
900 |
| EQUAL => |
b28defd0b5a5
replaced quicksort by mergesort, which might be a bit more efficient for key operations like Ord_List.make, Sorts.minimize_sort;
wenzelm
parents:
47499
diff
changeset
|
901 |
if unique then merge xs ys' |
b28defd0b5a5
replaced quicksort by mergesort, which might be a bit more efficient for key operations like Ord_List.make, Sorts.minimize_sort;
wenzelm
parents:
47499
diff
changeset
|
902 |
else x :: merge xs' ys |
b28defd0b5a5
replaced quicksort by mergesort, which might be a bit more efficient for key operations like Ord_List.make, Sorts.minimize_sort;
wenzelm
parents:
47499
diff
changeset
|
903 |
| GREATER => y :: merge xs ys') |
b28defd0b5a5
replaced quicksort by mergesort, which might be a bit more efficient for key operations like Ord_List.make, Sorts.minimize_sort;
wenzelm
parents:
47499
diff
changeset
|
904 |
| merge [] ys = ys |
b28defd0b5a5
replaced quicksort by mergesort, which might be a bit more efficient for key operations like Ord_List.make, Sorts.minimize_sort;
wenzelm
parents:
47499
diff
changeset
|
905 |
| merge xs [] = xs; |
b28defd0b5a5
replaced quicksort by mergesort, which might be a bit more efficient for key operations like Ord_List.make, Sorts.minimize_sort;
wenzelm
parents:
47499
diff
changeset
|
906 |
|
b28defd0b5a5
replaced quicksort by mergesort, which might be a bit more efficient for key operations like Ord_List.make, Sorts.minimize_sort;
wenzelm
parents:
47499
diff
changeset
|
907 |
fun merge_all [xs] = xs |
b28defd0b5a5
replaced quicksort by mergesort, which might be a bit more efficient for key operations like Ord_List.make, Sorts.minimize_sort;
wenzelm
parents:
47499
diff
changeset
|
908 |
| merge_all xss = merge_all (merge_pairs xss) |
b28defd0b5a5
replaced quicksort by mergesort, which might be a bit more efficient for key operations like Ord_List.make, Sorts.minimize_sort;
wenzelm
parents:
47499
diff
changeset
|
909 |
and merge_pairs (xs :: ys :: xss) = merge xs ys :: merge_pairs xss |
b28defd0b5a5
replaced quicksort by mergesort, which might be a bit more efficient for key operations like Ord_List.make, Sorts.minimize_sort;
wenzelm
parents:
47499
diff
changeset
|
910 |
| merge_pairs xss = xss; |
b28defd0b5a5
replaced quicksort by mergesort, which might be a bit more efficient for key operations like Ord_List.make, Sorts.minimize_sort;
wenzelm
parents:
47499
diff
changeset
|
911 |
|
b28defd0b5a5
replaced quicksort by mergesort, which might be a bit more efficient for key operations like Ord_List.make, Sorts.minimize_sort;
wenzelm
parents:
47499
diff
changeset
|
912 |
fun runs (x :: y :: xs) = |
18427 | 913 |
(case ord (x, y) of |
48271
b28defd0b5a5
replaced quicksort by mergesort, which might be a bit more efficient for key operations like Ord_List.make, Sorts.minimize_sort;
wenzelm
parents:
47499
diff
changeset
|
914 |
LESS => ascending y [x] xs |
b28defd0b5a5
replaced quicksort by mergesort, which might be a bit more efficient for key operations like Ord_List.make, Sorts.minimize_sort;
wenzelm
parents:
47499
diff
changeset
|
915 |
| EQUAL => |
b28defd0b5a5
replaced quicksort by mergesort, which might be a bit more efficient for key operations like Ord_List.make, Sorts.minimize_sort;
wenzelm
parents:
47499
diff
changeset
|
916 |
if unique then runs (x :: xs) |
b28defd0b5a5
replaced quicksort by mergesort, which might be a bit more efficient for key operations like Ord_List.make, Sorts.minimize_sort;
wenzelm
parents:
47499
diff
changeset
|
917 |
else ascending y [x] xs |
b28defd0b5a5
replaced quicksort by mergesort, which might be a bit more efficient for key operations like Ord_List.make, Sorts.minimize_sort;
wenzelm
parents:
47499
diff
changeset
|
918 |
| GREATER => descending y [x] xs) |
b28defd0b5a5
replaced quicksort by mergesort, which might be a bit more efficient for key operations like Ord_List.make, Sorts.minimize_sort;
wenzelm
parents:
47499
diff
changeset
|
919 |
| runs xs = [xs] |
4621 | 920 |
|
48271
b28defd0b5a5
replaced quicksort by mergesort, which might be a bit more efficient for key operations like Ord_List.make, Sorts.minimize_sort;
wenzelm
parents:
47499
diff
changeset
|
921 |
and ascending x xs (zs as y :: ys) = |
b28defd0b5a5
replaced quicksort by mergesort, which might be a bit more efficient for key operations like Ord_List.make, Sorts.minimize_sort;
wenzelm
parents:
47499
diff
changeset
|
922 |
(case ord (x, y) of |
b28defd0b5a5
replaced quicksort by mergesort, which might be a bit more efficient for key operations like Ord_List.make, Sorts.minimize_sort;
wenzelm
parents:
47499
diff
changeset
|
923 |
LESS => ascending y (x :: xs) ys |
b28defd0b5a5
replaced quicksort by mergesort, which might be a bit more efficient for key operations like Ord_List.make, Sorts.minimize_sort;
wenzelm
parents:
47499
diff
changeset
|
924 |
| EQUAL => |
b28defd0b5a5
replaced quicksort by mergesort, which might be a bit more efficient for key operations like Ord_List.make, Sorts.minimize_sort;
wenzelm
parents:
47499
diff
changeset
|
925 |
if unique then ascending x xs ys |
b28defd0b5a5
replaced quicksort by mergesort, which might be a bit more efficient for key operations like Ord_List.make, Sorts.minimize_sort;
wenzelm
parents:
47499
diff
changeset
|
926 |
else ascending y (x :: xs) ys |
b28defd0b5a5
replaced quicksort by mergesort, which might be a bit more efficient for key operations like Ord_List.make, Sorts.minimize_sort;
wenzelm
parents:
47499
diff
changeset
|
927 |
| GREATER => rev (x :: xs) :: runs zs) |
b28defd0b5a5
replaced quicksort by mergesort, which might be a bit more efficient for key operations like Ord_List.make, Sorts.minimize_sort;
wenzelm
parents:
47499
diff
changeset
|
928 |
| ascending x xs [] = [rev (x :: xs)] |
b28defd0b5a5
replaced quicksort by mergesort, which might be a bit more efficient for key operations like Ord_List.make, Sorts.minimize_sort;
wenzelm
parents:
47499
diff
changeset
|
929 |
|
b28defd0b5a5
replaced quicksort by mergesort, which might be a bit more efficient for key operations like Ord_List.make, Sorts.minimize_sort;
wenzelm
parents:
47499
diff
changeset
|
930 |
and descending x xs (zs as y :: ys) = |
b28defd0b5a5
replaced quicksort by mergesort, which might be a bit more efficient for key operations like Ord_List.make, Sorts.minimize_sort;
wenzelm
parents:
47499
diff
changeset
|
931 |
(case ord (x, y) of |
b28defd0b5a5
replaced quicksort by mergesort, which might be a bit more efficient for key operations like Ord_List.make, Sorts.minimize_sort;
wenzelm
parents:
47499
diff
changeset
|
932 |
GREATER => descending y (x :: xs) ys |
b28defd0b5a5
replaced quicksort by mergesort, which might be a bit more efficient for key operations like Ord_List.make, Sorts.minimize_sort;
wenzelm
parents:
47499
diff
changeset
|
933 |
| EQUAL => |
b28defd0b5a5
replaced quicksort by mergesort, which might be a bit more efficient for key operations like Ord_List.make, Sorts.minimize_sort;
wenzelm
parents:
47499
diff
changeset
|
934 |
if unique then descending x xs ys |
b28defd0b5a5
replaced quicksort by mergesort, which might be a bit more efficient for key operations like Ord_List.make, Sorts.minimize_sort;
wenzelm
parents:
47499
diff
changeset
|
935 |
else (x :: xs) :: runs zs |
b28defd0b5a5
replaced quicksort by mergesort, which might be a bit more efficient for key operations like Ord_List.make, Sorts.minimize_sort;
wenzelm
parents:
47499
diff
changeset
|
936 |
| LESS => (x :: xs) :: runs zs) |
b28defd0b5a5
replaced quicksort by mergesort, which might be a bit more efficient for key operations like Ord_List.make, Sorts.minimize_sort;
wenzelm
parents:
47499
diff
changeset
|
937 |
| descending x xs [] = [x :: xs]; |
b28defd0b5a5
replaced quicksort by mergesort, which might be a bit more efficient for key operations like Ord_List.make, Sorts.minimize_sort;
wenzelm
parents:
47499
diff
changeset
|
938 |
|
b28defd0b5a5
replaced quicksort by mergesort, which might be a bit more efficient for key operations like Ord_List.make, Sorts.minimize_sort;
wenzelm
parents:
47499
diff
changeset
|
939 |
in merge_all o runs end; |
b28defd0b5a5
replaced quicksort by mergesort, which might be a bit more efficient for key operations like Ord_List.make, Sorts.minimize_sort;
wenzelm
parents:
47499
diff
changeset
|
940 |
|
b28defd0b5a5
replaced quicksort by mergesort, which might be a bit more efficient for key operations like Ord_List.make, Sorts.minimize_sort;
wenzelm
parents:
47499
diff
changeset
|
941 |
fun sort ord = mergesort false ord; |
b28defd0b5a5
replaced quicksort by mergesort, which might be a bit more efficient for key operations like Ord_List.make, Sorts.minimize_sort;
wenzelm
parents:
47499
diff
changeset
|
942 |
fun sort_distinct ord = mergesort true ord; |
18427 | 943 |
|
4621 | 944 |
val sort_strings = sort string_ord; |
60924
610794dff23c
tuned signature, in accordance to sortBy in Scala;
wenzelm
parents:
59469
diff
changeset
|
945 |
fun sort_by key xs = sort (string_ord o apply2 key) xs; |
4621 | 946 |
|
947 |
||
30558
2ef9892114fd
renamed Tactic.taglist/untaglist/orderlist to tag_list/untag_list/order_list (in library.ML);
wenzelm
parents:
30190
diff
changeset
|
948 |
(* 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
|
949 |
|
2ef9892114fd
renamed Tactic.taglist/untaglist/orderlist to tag_list/untag_list/order_list (in library.ML);
wenzelm
parents:
30190
diff
changeset
|
950 |
(*insert tags*) |
2ef9892114fd
renamed Tactic.taglist/untaglist/orderlist to tag_list/untag_list/order_list (in library.ML);
wenzelm
parents:
30190
diff
changeset
|
951 |
fun tag_list k [] = [] |
30570 | 952 |
| 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
|
953 |
|
2ef9892114fd
renamed Tactic.taglist/untaglist/orderlist to tag_list/untag_list/order_list (in library.ML);
wenzelm
parents:
30190
diff
changeset
|
954 |
(*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
|
955 |
fun untag_list [] = [] |
2ef9892114fd
renamed Tactic.taglist/untaglist/orderlist to tag_list/untag_list/order_list (in library.ML);
wenzelm
parents:
30190
diff
changeset
|
956 |
| 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
|
957 |
| 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
|
958 |
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
|
959 |
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
|
960 |
|
2ef9892114fd
renamed Tactic.taglist/untaglist/orderlist to tag_list/untag_list/order_list (in library.ML);
wenzelm
parents:
30190
diff
changeset
|
961 |
(*return list elements in original order*) |
59058
a78612c67ec0
renamed "pairself" to "apply2", in accordance to @{apply 2};
wenzelm
parents:
58635
diff
changeset
|
962 |
fun order_list list = untag_list (sort (int_ord o apply2 fst) list); |
30558
2ef9892114fd
renamed Tactic.taglist/untaglist/orderlist to tag_list/untag_list/order_list (in library.ML);
wenzelm
parents:
30190
diff
changeset
|
963 |
|
2ef9892114fd
renamed Tactic.taglist/untaglist/orderlist to tag_list/untag_list/order_list (in library.ML);
wenzelm
parents:
30190
diff
changeset
|
964 |
|
2506 | 965 |
|
4621 | 966 |
(** misc **) |
233 | 967 |
|
19644
0b01436e1843
added divide_and_conquer combinator (by Amine Chaieb);
wenzelm
parents:
19596
diff
changeset
|
968 |
fun divide_and_conquer decomp x = |
0b01436e1843
added divide_and_conquer combinator (by Amine Chaieb);
wenzelm
parents:
19596
diff
changeset
|
969 |
let val (ys, recomb) = decomp x |
0b01436e1843
added divide_and_conquer combinator (by Amine Chaieb);
wenzelm
parents:
19596
diff
changeset
|
970 |
in recomb (map (divide_and_conquer decomp) ys) end; |
0b01436e1843
added divide_and_conquer combinator (by Amine Chaieb);
wenzelm
parents:
19596
diff
changeset
|
971 |
|
32978 | 972 |
fun divide_and_conquer' decomp x s = |
973 |
let val ((ys, recomb), s') = decomp x s |
|
974 |
in recomb (fold_map (divide_and_conquer' decomp) ys s') end; |
|
975 |
||
0 | 976 |
|
233 | 977 |
(*Partition a list into buckets [ bi, b(i+1), ..., bj ] |
0 | 978 |
putting x in bk if p(k)(x) holds. Preserve order of elements if possible.*) |
979 |
fun partition_list p i j = |
|
37851 | 980 |
let |
981 |
fun part (k: int) xs = |
|
982 |
if k > j then |
|
983 |
(case xs of |
|
984 |
[] => [] |
|
985 |
| _ => raise Fail "partition_list") |
|
986 |
else |
|
987 |
let val (ns, rest) = List.partition (p k) xs |
|
988 |
in ns :: part (k + 1) rest end; |
|
989 |
in part (i: int) end; |
|
0 | 990 |
|
37851 | 991 |
fun partition_eq (eq: 'a * 'a -> bool) = |
19691 | 992 |
let |
993 |
fun part [] = [] |
|
994 |
| part (x :: ys) = |
|
995 |
let val (xs, xs') = List.partition (fn y => eq (x, y)) ys |
|
37851 | 996 |
in (x :: xs) :: part xs' end; |
19691 | 997 |
in part end; |
998 |
||
999 |
||
45626
b4f374a45668
more abstract datatype stamp, which avoids pointless allocation of mutable cells;
wenzelm
parents:
44617
diff
changeset
|
1000 |
(* serial numbers and abstract stamps *) |
16439 | 1001 |
|
1002 |
type serial = int; |
|
25702
a61554b1e7a9
serial: now based on specific version in structure Multithreading;
wenzelm
parents:
25681
diff
changeset
|
1003 |
val serial = Multithreading.serial; |
19512 | 1004 |
val serial_string = string_of_int o serial; |
1005 |
||
45626
b4f374a45668
more abstract datatype stamp, which avoids pointless allocation of mutable cells;
wenzelm
parents:
44617
diff
changeset
|
1006 |
datatype stamp = Stamp of serial; |
b4f374a45668
more abstract datatype stamp, which avoids pointless allocation of mutable cells;
wenzelm
parents:
44617
diff
changeset
|
1007 |
fun stamp () = Stamp (serial ()); |
b4f374a45668
more abstract datatype stamp, which avoids pointless allocation of mutable cells;
wenzelm
parents:
44617
diff
changeset
|
1008 |
|
16535
86c9eada525b
added structure Object (from Pure/General/object.ML);
wenzelm
parents:
16492
diff
changeset
|
1009 |
|
51368
2ea5c7c2d825
tuned signature -- prefer terminology of Scala and Axiom;
wenzelm
parents:
50913
diff
changeset
|
1010 |
(* values of any type *) |
16535
86c9eada525b
added structure Object (from Pure/General/object.ML);
wenzelm
parents:
16492
diff
changeset
|
1011 |
|
86c9eada525b
added structure Object (from Pure/General/object.ML);
wenzelm
parents:
16492
diff
changeset
|
1012 |
(*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
|
1013 |
constructors at any time*) |
51368
2ea5c7c2d825
tuned signature -- prefer terminology of Scala and Axiom;
wenzelm
parents:
50913
diff
changeset
|
1014 |
structure Any = struct type T = exn end; |
16535
86c9eada525b
added structure Object (from Pure/General/object.ML);
wenzelm
parents:
16492
diff
changeset
|
1015 |
|
43603 | 1016 |
|
1017 |
(* current directory *) |
|
1018 |
||
62468 | 1019 |
val cd = OS.FileSys.chDir o ML_System.platform_path; |
1020 |
val pwd = ML_System.standard_path o OS.FileSys.getDir; |
|
43603 | 1021 |
|
1022 |
||
1023 |
(* getenv *) |
|
1024 |
||
1025 |
fun getenv x = |
|
1026 |
(case OS.Process.getEnv x of |
|
1027 |
NONE => "" |
|
1028 |
| SOME y => y); |
|
1029 |
||
1030 |
fun getenv_strict x = |
|
1031 |
(case getenv x of |
|
1032 |
"" => error ("Undefined Isabelle environment variable: " ^ quote x) |
|
1033 |
| y => y); |
|
1034 |
||
1364
8ea1a962ad72
files now define a structure to allow SML/NJ to optimize the code
clasohm
parents:
1290
diff
changeset
|
1035 |
end; |
8ea1a962ad72
files now define a structure to allow SML/NJ to optimize the code
clasohm
parents:
1290
diff
changeset
|
1036 |
|
32188 | 1037 |
structure Basic_Library: BASIC_LIBRARY = Library; |
1038 |
open Basic_Library; |
|
40722
441260986b63
make two copies (!) of Library.UnequalLengths coincide with ListPair.UnequalLengths;
wenzelm
parents:
40721
diff
changeset
|
1039 |