author | wenzelm |
Tue, 31 May 2005 11:53:20 +0200 | |
changeset 16129 | 6fa9ace50240 |
parent 15970 | b8855873d234 |
child 16188 | 841342a7c41c |
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 |
12284 | 4 |
Author: Markus Wenzel, TU Munich |
0 | 5 |
|
233 | 6 |
Basic library: functions, options, pairs, booleans, lists, integers, |
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
|
7 |
rational numbers, strings, lists as sets, association lists, generic |
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
|
8 |
tables, balanced trees, orders, current directory, misc. |
0 | 9 |
*) |
10 |
||
8418 | 11 |
infix |> |>> |>>> ~~ \ \\ ins ins_string ins_int orf andf prefix upto downto |
4212 | 12 |
mem mem_int mem_string union union_int union_string inter inter_int |
13 |
inter_string subset subset_int subset_string; |
|
1364
8ea1a962ad72
files now define a structure to allow SML/NJ to optimize the code
clasohm
parents:
1290
diff
changeset
|
14 |
|
6510 | 15 |
infix 3 oo ooo oooo; |
5893 | 16 |
|
15745 | 17 |
signature BASIC_LIBRARY = |
4621 | 18 |
sig |
19 |
(*functions*) |
|
20 |
val curry: ('a * 'b -> 'c) -> 'a -> 'b -> 'c |
|
21 |
val uncurry: ('a -> 'b -> 'c) -> 'a * 'b -> 'c |
|
22 |
val I: 'a -> 'a |
|
23 |
val K: 'a -> 'b -> 'a |
|
24 |
val |> : 'a * ('a -> 'b) -> 'b |
|
8418 | 25 |
val |>> : ('a * 'b) * ('a -> 'c) -> 'c * 'b |
26 |
val |>>> : ('a * 'b) * ('a -> 'c * 'd) -> 'c * ('b * 'd) |
|
4621 | 27 |
val apl: 'a * ('a * 'b -> 'c) -> 'b -> 'c |
28 |
val apr: ('a * 'b -> 'c) * 'b -> 'a -> 'c |
|
29 |
val funpow: int -> ('a -> 'a) -> 'a -> 'a |
|
5893 | 30 |
val oo: ('a -> 'b) * ('c -> 'd -> 'a) -> 'c -> 'd -> 'b |
31 |
val ooo: ('a -> 'b) * ('c -> 'd -> 'e -> 'a) -> 'c -> 'd -> 'e -> 'b |
|
6510 | 32 |
val oooo: ('a -> 'b) * ('c -> 'd -> 'e -> 'f -> 'a) -> 'c -> 'd -> 'e -> 'f -> 'b |
1364
8ea1a962ad72
files now define a structure to allow SML/NJ to optimize the code
clasohm
parents:
1290
diff
changeset
|
33 |
|
4621 | 34 |
(*stamps*) |
35 |
type stamp |
|
36 |
val stamp: unit -> stamp |
|
37 |
||
15670
963cd3f7976c
invalidated former constructors None/OPTION to prevent accidental use as match-all patterns!
wenzelm
parents:
15570
diff
changeset
|
38 |
(*old options -- invalidated*) |
963cd3f7976c
invalidated former constructors None/OPTION to prevent accidental use as match-all patterns!
wenzelm
parents:
15570
diff
changeset
|
39 |
datatype invalid = None of invalid |
963cd3f7976c
invalidated former constructors None/OPTION to prevent accidental use as match-all patterns!
wenzelm
parents:
15570
diff
changeset
|
40 |
exception OPTION of invalid |
963cd3f7976c
invalidated former constructors None/OPTION to prevent accidental use as match-all patterns!
wenzelm
parents:
15570
diff
changeset
|
41 |
|
15970 | 42 |
(*options*) |
43 |
val the: 'a option -> 'a |
|
44 |
val if_none: 'a option -> 'a -> 'a |
|
45 |
val is_some: 'a option -> bool |
|
46 |
val is_none: 'a option -> bool |
|
47 |
||
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
|
48 |
exception ERROR |
6959 | 49 |
val try: ('a -> 'b) -> 'a -> 'b option |
4621 | 50 |
val can: ('a -> 'b) -> 'a -> bool |
14868 | 51 |
datatype 'a result = Result of 'a | Exn of exn |
52 |
val capture: ('a -> 'b) -> 'a -> 'b result |
|
53 |
val release: 'a result -> 'a |
|
54 |
val get_result: 'a result -> 'a option |
|
55 |
val get_exn: 'a result -> exn option |
|
4621 | 56 |
|
57 |
(*pairs*) |
|
58 |
val pair: 'a -> 'b -> 'a * 'b |
|
59 |
val rpair: 'a -> 'b -> 'b * 'a |
|
60 |
val fst: 'a * 'b -> 'a |
|
61 |
val snd: 'a * 'b -> 'b |
|
62 |
val eq_fst: (''a * 'b) * (''a * 'c) -> bool |
|
63 |
val eq_snd: ('a * ''b) * ('c * ''b) -> bool |
|
64 |
val swap: 'a * 'b -> 'b * 'a |
|
65 |
val apfst: ('a -> 'b) -> 'a * 'c -> 'b * 'c |
|
66 |
val apsnd: ('a -> 'b) -> 'c * 'a -> 'c * 'b |
|
67 |
val pairself: ('a -> 'b) -> 'a * 'a -> 'b * 'b |
|
68 |
||
69 |
(*booleans*) |
|
70 |
val equal: ''a -> ''a -> bool |
|
71 |
val not_equal: ''a -> ''a -> bool |
|
72 |
val orf: ('a -> bool) * ('a -> bool) -> 'a -> bool |
|
73 |
val andf: ('a -> bool) * ('a -> bool) -> 'a -> bool |
|
74 |
val exists: ('a -> bool) -> 'a list -> bool |
|
75 |
val forall: ('a -> bool) -> 'a list -> bool |
|
76 |
val set: bool ref -> bool |
|
77 |
val reset: bool ref -> bool |
|
78 |
val toggle: bool ref -> bool |
|
9118 | 79 |
val change: 'a ref -> ('a -> 'a) -> unit |
4621 | 80 |
val setmp: 'a ref -> 'a -> ('b -> 'c) -> 'b -> 'c |
11853 | 81 |
val conditional: bool -> (unit -> unit) -> unit |
4621 | 82 |
|
83 |
(*lists*) |
|
15570 | 84 |
exception UnequalLengths |
4621 | 85 |
val cons: 'a -> 'a list -> 'a list |
5285 | 86 |
val single: 'a -> 'a list |
4629 | 87 |
val append: 'a list -> 'a list -> 'a list |
5904 | 88 |
val apply: ('a -> 'a) list -> 'a -> 'a |
14792 | 89 |
val fold: ('a -> 'b -> 'b) -> 'a list -> 'b -> 'b |
15035
8c57751cd43f
added fold_rev: ('a -> 'b -> 'b) -> 'a list -> 'b -> 'b;
wenzelm
parents:
14981
diff
changeset
|
90 |
val fold_rev: ('a -> 'b -> 'b) -> 'a list -> 'b -> 'b |
4956
a7538e43896e
added foldl_map: ('a * 'b -> 'a * 'c) -> 'a * 'b list -> 'a * 'c list;
wenzelm
parents:
4945
diff
changeset
|
91 |
val foldl_map: ('a * 'b -> 'a * 'c) -> 'a * 'b list -> 'a * 'c list |
15760 | 92 |
val foldr1: ('a * 'a -> 'a) -> 'a list -> 'a |
11002 | 93 |
val foldln: ('a * int -> 'b -> 'b) -> 'a list -> 'b -> 'b |
15570 | 94 |
val unflat: 'a list list -> 'b list -> 'b list list |
13629 | 95 |
val splitAt: int * 'a list -> 'a list * 'a list |
4713 | 96 |
val dropwhile: ('a -> bool) -> 'a list -> 'a list |
11773 | 97 |
val map_nth_elem: int -> ('a -> 'a) -> 'a list -> 'a list |
4621 | 98 |
val split_last: 'a list -> 'a list * 'a |
4893 | 99 |
val nth_update: 'a -> int * 'a list -> 'a list |
4621 | 100 |
val find_index: ('a -> bool) -> 'a list -> int |
101 |
val find_index_eq: ''a -> ''a list -> int |
|
102 |
val find_first: ('a -> bool) -> 'a list -> 'a option |
|
4916
fe8b0c82691b
get_first: ('a -> 'b option) -> 'a list -> 'b option;
wenzelm
parents:
4893
diff
changeset
|
103 |
val get_first: ('a -> 'b option) -> 'a list -> 'b option |
4621 | 104 |
val separate: 'a -> 'a list -> 'a list |
105 |
val replicate: int -> 'a -> 'a list |
|
106 |
val multiply: 'a list * 'a list list -> 'a list list |
|
14792 | 107 |
val product: 'a list -> 'b list -> ('a * 'b) list |
16129 | 108 |
val filter: ('a -> bool) -> 'a list -> 'a list |
4621 | 109 |
val filter_out: ('a -> bool) -> 'a list -> 'a list |
110 |
val map2: ('a * 'b -> 'c) -> 'a list * 'b list -> 'c list |
|
111 |
val exists2: ('a * 'b -> bool) -> 'a list * 'b list -> bool |
|
112 |
val forall2: ('a * 'b -> bool) -> 'a list * 'b list -> bool |
|
4956
a7538e43896e
added foldl_map: ('a * 'b -> 'a * 'c) -> 'a * 'b list -> 'a * 'c list;
wenzelm
parents:
4945
diff
changeset
|
113 |
val seq2: ('a * 'b -> unit) -> 'a list * 'b list -> unit |
4621 | 114 |
val ~~ : 'a list * 'b list -> ('a * 'b) list |
115 |
val split_list: ('a * 'b) list -> 'a list * 'b list |
|
7468
6ce03d2f7d91
equal_lists: ('a * 'b -> bool) -> 'a list * 'b list -> bool;
wenzelm
parents:
7090
diff
changeset
|
116 |
val equal_lists: ('a * 'b -> bool) -> 'a list * 'b list -> bool |
4621 | 117 |
val prefix: ''a list * ''a list -> bool |
118 |
val take_prefix: ('a -> bool) -> 'a list -> 'a list * 'a list |
|
119 |
val take_suffix: ('a -> bool) -> 'a list -> 'a list * 'a list |
|
12249 | 120 |
val prefixes1: 'a list -> 'a list list |
121 |
val suffixes1: 'a list -> 'a list list |
|
4621 | 122 |
|
123 |
(*integers*) |
|
15965
f422f8283491
Use of IntInf.int instead of int in most numeric simprocs; avoids
paulson
parents:
15760
diff
changeset
|
124 |
val gcd: IntInf.int * IntInf.int -> IntInf.int |
f422f8283491
Use of IntInf.int instead of int in most numeric simprocs; avoids
paulson
parents:
15760
diff
changeset
|
125 |
val lcm: IntInf.int * IntInf.int -> IntInf.int |
4621 | 126 |
val inc: int ref -> int |
127 |
val dec: int ref -> int |
|
128 |
val upto: int * int -> int list |
|
129 |
val downto: int * int -> int list |
|
130 |
val downto0: int list * int -> bool |
|
131 |
val radixpand: int * int -> int list |
|
132 |
val radixstring: int * string * int -> string |
|
133 |
val string_of_int: int -> string |
|
134 |
val string_of_indexname: string * int -> string |
|
15696 | 135 |
(* CB: note alternative Syntax.string_of_vname has nicer syntax *) |
14826
48cfe0fe53e2
output channels and diagnostics moved to General/output.ML; added read_int etc. from term.ML; removed obsolete mtree; type rat uses exception RAT;
wenzelm
parents:
14797
diff
changeset
|
136 |
val read_radixint: int * string list -> int * string list |
48cfe0fe53e2
output channels and diagnostics moved to General/output.ML; added read_int etc. from term.ML; removed obsolete mtree; type rat uses exception RAT;
wenzelm
parents:
14797
diff
changeset
|
137 |
val 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
|
138 |
val oct_char: string -> string |
4621 | 139 |
|
10692 | 140 |
(*rational numbers*) |
141 |
type rat |
|
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
|
142 |
exception RAT of string |
15965
f422f8283491
Use of IntInf.int instead of int in most numeric simprocs; avoids
paulson
parents:
15760
diff
changeset
|
143 |
val rep_rat: rat -> IntInf.int * IntInf.int |
10692 | 144 |
val ratadd: rat * rat -> rat |
145 |
val ratmul: rat * rat -> rat |
|
146 |
val ratinv: rat -> rat |
|
15965
f422f8283491
Use of IntInf.int instead of int in most numeric simprocs; avoids
paulson
parents:
15760
diff
changeset
|
147 |
val int_ratdiv: IntInf.int * IntInf.int -> rat |
10692 | 148 |
val ratneg: rat -> rat |
149 |
val rat_of_int: int -> rat |
|
15965
f422f8283491
Use of IntInf.int instead of int in most numeric simprocs; avoids
paulson
parents:
15760
diff
changeset
|
150 |
val rat_of_intinf: IntInf.int -> rat |
10692 | 151 |
|
4621 | 152 |
(*strings*) |
6312 | 153 |
val nth_elem_string: int * string -> string |
6282 | 154 |
val foldl_string: ('a * string -> 'a) -> 'a * string -> 'a |
6312 | 155 |
val exists_string: (string -> bool) -> string -> bool |
4621 | 156 |
val enclose: string -> string -> string -> string |
6642 | 157 |
val unenclose: string -> string |
4621 | 158 |
val quote: string -> string |
159 |
val space_implode: string -> string list -> string |
|
160 |
val commas: string list -> string |
|
161 |
val commas_quote: string list -> string |
|
162 |
val cat_lines: string list -> string |
|
163 |
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
|
164 |
val split_lines: string -> string list |
5942 | 165 |
val prefix_lines: string -> string -> string |
7712 | 166 |
val untabify: string list -> string list |
5285 | 167 |
val suffix: string -> string -> string |
168 |
val unsuffix: string -> string -> string |
|
15060 | 169 |
val unprefix: string -> string -> string |
10951 | 170 |
val replicate_string: int -> string -> string |
14926 | 171 |
val translate_string: (string -> string) -> string -> string |
4621 | 172 |
|
173 |
(*lists as sets*) |
|
174 |
val mem: ''a * ''a list -> bool |
|
175 |
val mem_int: int * int list -> bool |
|
176 |
val mem_string: string * string list -> bool |
|
177 |
val gen_mem: ('a * 'b -> bool) -> 'a * 'b list -> bool |
|
178 |
val ins: ''a * ''a list -> ''a list |
|
179 |
val ins_int: int * int list -> int list |
|
180 |
val ins_string: string * string list -> string list |
|
181 |
val gen_ins: ('a * 'a -> bool) -> 'a * 'a list -> 'a list |
|
15760 | 182 |
val insert: ('a * 'a -> bool) -> 'a -> 'a list -> 'a list |
16129 | 183 |
val remove: ('b * 'a -> bool) -> 'b -> 'a list -> 'a list |
4621 | 184 |
val union: ''a list * ''a list -> ''a list |
185 |
val union_int: int list * int list -> int list |
|
186 |
val union_string: string list * string list -> string list |
|
187 |
val gen_union: ('a * 'a -> bool) -> 'a list * 'a list -> 'a list |
|
7090 | 188 |
val gen_inter: ('a * 'b -> bool) -> 'a list * 'b list -> 'a list |
4621 | 189 |
val inter: ''a list * ''a list -> ''a list |
190 |
val inter_int: int list * int list -> int list |
|
191 |
val inter_string: string list * string list -> string list |
|
192 |
val subset: ''a list * ''a list -> bool |
|
193 |
val subset_int: int list * int list -> bool |
|
194 |
val subset_string: string list * string list -> bool |
|
195 |
val eq_set: ''a list * ''a list -> bool |
|
196 |
val eq_set_string: string list * string list -> bool |
|
197 |
val gen_subset: ('a * 'b -> bool) -> 'a list * 'b list -> bool |
|
198 |
val \ : ''a list * ''a -> ''a list |
|
199 |
val \\ : ''a list * ''a list -> ''a list |
|
200 |
val gen_rem: ('a * 'b -> bool) -> 'a list * 'b -> 'a list |
|
201 |
val gen_rems: ('a * 'b -> bool) -> 'a list * 'b list -> 'a list |
|
202 |
val gen_distinct: ('a * 'a -> bool) -> 'a list -> 'a list |
|
203 |
val distinct: ''a list -> ''a list |
|
204 |
val findrep: ''a list -> ''a list |
|
205 |
val gen_duplicates: ('a * 'a -> bool) -> 'a list -> 'a list |
|
206 |
val duplicates: ''a list -> ''a list |
|
207 |
||
208 |
(*association lists*) |
|
209 |
val assoc: (''a * 'b) list * ''a -> 'b option |
|
210 |
val assoc_int: (int * 'a) list * int -> 'a option |
|
211 |
val assoc_string: (string * 'a) list * string -> 'a option |
|
212 |
val assoc_string_int: ((string * int) * 'a) list * (string * int) -> 'a option |
|
213 |
val assocs: (''a * 'b list) list -> ''a -> 'b list |
|
214 |
val assoc2: (''a * (''b * 'c) list) list * (''a * ''b) -> 'c option |
|
215 |
val gen_assoc: ('a * 'b -> bool) -> ('b * 'c) list * 'a -> 'c option |
|
216 |
val overwrite: (''a * 'b) list * (''a * 'b) -> (''a * 'b) list |
|
217 |
val gen_overwrite: ('a * 'a -> bool) -> ('a * 'b) list * ('a * 'b) -> ('a * 'b) list |
|
218 |
||
12284 | 219 |
(*lists as tables*) |
220 |
val gen_merge_lists: ('a * 'a -> bool) -> 'a list -> 'a list -> 'a list |
|
221 |
val gen_merge_lists': ('a * 'a -> bool) -> 'a list -> 'a list -> 'a list |
|
4621 | 222 |
val merge_lists: ''a list -> ''a list -> ''a list |
12284 | 223 |
val merge_lists': ''a list -> ''a list -> ''a list |
4692 | 224 |
val merge_alists: (''a * 'b) list -> (''a * 'b) list -> (''a * 'b) list |
15263 | 225 |
val merge_alists': (''a * 'b) list -> (''a * 'b) list -> (''a * 'b) list |
4621 | 226 |
|
227 |
(*balanced trees*) |
|
228 |
exception Balance |
|
229 |
val fold_bal: ('a * 'a -> 'a) -> 'a list -> 'a |
|
230 |
val access_bal: ('a -> 'a) * ('a -> 'a) * 'a -> int -> int -> 'a |
|
231 |
val accesses_bal: ('a -> 'a) * ('a -> 'a) * 'a -> int -> 'a list |
|
232 |
||
233 |
(*orders*) |
|
234 |
val rev_order: order -> order |
|
235 |
val make_ord: ('a * 'a -> bool) -> 'a * 'a -> order |
|
236 |
val int_ord: int * int -> order |
|
237 |
val string_ord: string * string -> order |
|
238 |
val prod_ord: ('a * 'b -> order) -> ('c * 'd -> order) -> ('a * 'c) * ('b * 'd) -> order |
|
239 |
val dict_ord: ('a * 'b -> order) -> 'a list * 'b list -> order |
|
240 |
val list_ord: ('a * 'b -> order) -> 'a list * 'b list -> order |
|
241 |
val sort: ('a * 'a -> order) -> 'a list -> 'a list |
|
242 |
val sort_strings: string list -> string list |
|
243 |
val sort_wrt: ('a -> string) -> 'a list -> 'a list |
|
11514 | 244 |
val unique_strings: string list -> string list |
4621 | 245 |
|
14106
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
246 |
(*random numbers*) |
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
247 |
exception RANDOM |
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
248 |
val random: unit -> real |
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
249 |
val random_range: int -> int -> int |
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
250 |
val one_of: 'a list -> 'a |
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
251 |
val frequency: (int * 'a) list -> 'a |
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
252 |
|
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
|
253 |
(*current directory*) |
4621 | 254 |
val cd: string -> unit |
255 |
val pwd: unit -> string |
|
256 |
||
257 |
(*misc*) |
|
258 |
val make_keylist: ('a -> 'b) -> 'a list -> ('a * 'b) list |
|
259 |
val keyfilter: ('a * ''b) list -> ''b -> 'a list |
|
260 |
val partition_eq: ('a * 'a -> bool) -> 'a list -> 'a list list |
|
261 |
val partition_list: (int -> 'a -> bool) -> int -> int -> 'a list -> 'a list list |
|
262 |
val gensym: string -> string |
|
263 |
val scanwords: (string -> bool) -> string list -> string list |
|
264 |
end; |
|
265 |
||
15745 | 266 |
signature LIBRARY = |
15570 | 267 |
sig |
15745 | 268 |
include BASIC_LIBRARY |
15570 | 269 |
val foldl: ('a * 'b -> 'a) -> 'a * 'b list -> 'a |
270 |
val foldr: ('a * 'b -> 'b) -> 'a list * 'b -> 'b |
|
271 |
val take: int * 'a list -> 'a list |
|
272 |
val drop: int * 'a list -> 'a list |
|
273 |
val nth_elem: int * 'a list -> 'a |
|
274 |
val last_elem: 'a list -> 'a |
|
275 |
val flat: 'a list list -> 'a list |
|
276 |
val seq: ('a -> unit) -> 'a list -> unit |
|
277 |
val partition: ('a -> bool) -> 'a list -> 'a list * 'a list |
|
278 |
val mapfilter: ('a -> 'b option) -> 'a list -> 'b list |
|
279 |
end; |
|
280 |
||
15745 | 281 |
structure Library: LIBRARY = |
1364
8ea1a962ad72
files now define a structure to allow SML/NJ to optimize the code
clasohm
parents:
1290
diff
changeset
|
282 |
struct |
0 | 283 |
|
4995 | 284 |
|
233 | 285 |
(** functions **) |
0 | 286 |
|
233 | 287 |
(*handy combinators*) |
288 |
fun curry f x y = f (x, y); |
|
289 |
fun uncurry f (x, y) = f x y; |
|
290 |
fun I x = x; |
|
291 |
fun K x y = x; |
|
0 | 292 |
|
380 | 293 |
(*reverse apply*) |
410 | 294 |
fun (x |> f) = f x; |
8418 | 295 |
fun ((x, y) |>> f) = (f x, y); |
296 |
fun ((x, y) |>>> f) = let val (x', z) = f x in (x', (y, z)) end; |
|
380 | 297 |
|
233 | 298 |
(*application of (infix) operator to its left or right argument*) |
299 |
fun apl (x, f) y = f (x, y); |
|
300 |
fun apr (f, y) x = f (x, y); |
|
0 | 301 |
|
233 | 302 |
(*function exponentiation: f(...(f x)...) with n applications of f*) |
303 |
fun funpow n f x = |
|
304 |
let fun rep (0, x) = x |
|
305 |
| rep (n, x) = rep (n - 1, f x) |
|
306 |
in rep (n, x) end; |
|
160 | 307 |
|
5893 | 308 |
(*concatenation: 2 and 3 args*) |
309 |
fun (f oo g) x y = f (g x y); |
|
310 |
fun (f ooo g) x y z = f (g x y z); |
|
6510 | 311 |
fun (f oooo g) x y z w = f (g x y z w); |
312 |
||
160 | 313 |
|
314 |
||
2471 | 315 |
(** stamps **) |
316 |
||
317 |
type stamp = unit ref; |
|
318 |
val stamp: unit -> stamp = ref; |
|
319 |
||
320 |
||
321 |
||
233 | 322 |
(** options **) |
0 | 323 |
|
15670
963cd3f7976c
invalidated former constructors None/OPTION to prevent accidental use as match-all patterns!
wenzelm
parents:
15570
diff
changeset
|
324 |
(*invalidate former constructors to prevent accidental use as match-all patterns!*) |
963cd3f7976c
invalidated former constructors None/OPTION to prevent accidental use as match-all patterns!
wenzelm
parents:
15570
diff
changeset
|
325 |
datatype invalid = None of invalid; |
963cd3f7976c
invalidated former constructors None/OPTION to prevent accidental use as match-all patterns!
wenzelm
parents:
15570
diff
changeset
|
326 |
exception OPTION of invalid; |
0 | 327 |
|
15970 | 328 |
val the = Option.valOf; |
329 |
||
330 |
(*strict!*) |
|
331 |
fun if_none NONE y = y |
|
332 |
| if_none (SOME x) _ = x; |
|
333 |
||
334 |
fun is_some (SOME _) = true |
|
335 |
| is_some NONE = false; |
|
336 |
||
337 |
fun is_none (SOME _) = false |
|
338 |
| is_none NONE = true; |
|
339 |
||
6959 | 340 |
|
341 |
(* exception handling *) |
|
342 |
||
343 |
exception ERROR; |
|
344 |
||
15531 | 345 |
fun try f x = SOME (f x) |
346 |
handle Interrupt => raise Interrupt | ERROR => raise ERROR | _ => NONE; |
|
6959 | 347 |
|
348 |
fun can f x = is_some (try f x); |
|
4139 | 349 |
|
350 |
||
14868 | 351 |
datatype 'a result = |
352 |
Result of 'a | |
|
353 |
Exn of exn; |
|
354 |
||
355 |
fun capture f x = Result (f x) handle e => Exn e; |
|
356 |
||
357 |
fun release (Result y) = y |
|
358 |
| release (Exn e) = raise e; |
|
359 |
||
15531 | 360 |
fun get_result (Result x) = SOME x |
361 |
| get_result _ = NONE; |
|
14868 | 362 |
|
15531 | 363 |
fun get_exn (Exn exn) = SOME exn |
364 |
| get_exn _ = NONE; |
|
14868 | 365 |
|
366 |
||
4139 | 367 |
|
233 | 368 |
(** pairs **) |
369 |
||
370 |
fun pair x y = (x, y); |
|
371 |
fun rpair x y = (y, x); |
|
372 |
||
373 |
fun fst (x, y) = x; |
|
374 |
fun snd (x, y) = y; |
|
375 |
||
376 |
fun eq_fst ((x1, _), (x2, _)) = x1 = x2; |
|
377 |
fun eq_snd ((_, y1), (_, y2)) = y1 = y2; |
|
378 |
||
379 |
fun swap (x, y) = (y, x); |
|
380 |
||
4212 | 381 |
(*apply function to components*) |
233 | 382 |
fun apfst f (x, y) = (f x, y); |
383 |
fun apsnd f (x, y) = (x, f y); |
|
4212 | 384 |
fun pairself f (x, y) = (f x, f y); |
233 | 385 |
|
386 |
||
387 |
||
388 |
(** booleans **) |
|
389 |
||
390 |
(* equality *) |
|
391 |
||
392 |
fun equal x y = x = y; |
|
393 |
fun not_equal x y = x <> y; |
|
394 |
||
395 |
||
396 |
(* operators for combining predicates *) |
|
397 |
||
2175
21fde76bc742
Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents:
2157
diff
changeset
|
398 |
fun (p orf q) = fn x => p x orelse q x; |
21fde76bc742
Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents:
2157
diff
changeset
|
399 |
fun (p andf q) = fn x => p x andalso q x; |
233 | 400 |
|
401 |
||
402 |
(* predicates on lists *) |
|
403 |
||
404 |
(*exists pred [x1, ..., xn] ===> pred x1 orelse ... orelse pred xn*) |
|
405 |
fun exists (pred: 'a -> bool) : 'a list -> bool = |
|
406 |
let fun boolf [] = false |
|
407 |
| boolf (x :: xs) = pred x orelse boolf xs |
|
408 |
in boolf end; |
|
409 |
||
410 |
(*forall pred [x1, ..., xn] ===> pred x1 andalso ... andalso pred xn*) |
|
411 |
fun forall (pred: 'a -> bool) : 'a list -> bool = |
|
412 |
let fun boolf [] = true |
|
413 |
| boolf (x :: xs) = pred x andalso boolf xs |
|
414 |
in boolf end; |
|
0 | 415 |
|
233 | 416 |
|
380 | 417 |
(* flags *) |
418 |
||
419 |
fun set flag = (flag := true; true); |
|
420 |
fun reset flag = (flag := false; false); |
|
421 |
fun toggle flag = (flag := not (! flag); ! flag); |
|
422 |
||
9118 | 423 |
fun change r f = r := f (! r); |
424 |
||
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
|
425 |
(*temporarily set flag, handling exceptions*) |
2978 | 426 |
fun setmp flag value f x = |
2958 | 427 |
let |
428 |
val orig_value = ! flag; |
|
429 |
fun return y = (flag := orig_value; y); |
|
430 |
in |
|
431 |
flag := value; |
|
432 |
return (f x handle exn => (return (); raise exn)) |
|
433 |
end; |
|
434 |
||
380 | 435 |
|
11853 | 436 |
(* conditional execution *) |
437 |
||
438 |
fun conditional b f = if b then f () else (); |
|
439 |
||
440 |
||
233 | 441 |
|
442 |
(** lists **) |
|
443 |
||
15570 | 444 |
exception UnequalLengths; |
233 | 445 |
|
446 |
fun cons x xs = x :: xs; |
|
5285 | 447 |
fun single x = [x]; |
233 | 448 |
|
4629 | 449 |
fun append xs ys = xs @ ys; |
450 |
||
5904 | 451 |
fun apply [] x = x |
452 |
| apply (f :: fs) x = apply fs (f x); |
|
453 |
||
233 | 454 |
|
455 |
(* fold *) |
|
456 |
||
15760 | 457 |
fun fold _ [] y = y |
458 |
| fold f (x :: xs) y = fold f xs (f x y); |
|
459 |
||
460 |
fun fold_rev _ [] y = y |
|
461 |
| fold_rev f (x :: xs) y = f x (fold_rev f xs y); |
|
462 |
||
463 |
fun foldl_map _ (x, []) = (x, []) |
|
464 |
| foldl_map f (x, y :: ys) = |
|
465 |
let |
|
466 |
val (x', y') = f (x, y); |
|
467 |
val (x'', ys') = foldl_map f (x', ys); |
|
468 |
in (x'', y' :: ys') end; |
|
469 |
||
233 | 470 |
(*the following versions of fold are designed to fit nicely with infixes*) |
0 | 471 |
|
233 | 472 |
(* (op @) (e, [x1, ..., xn]) ===> ((e @ x1) @ x2) ... @ xn |
473 |
for operators that associate to the left (TAIL RECURSIVE)*) |
|
474 |
fun foldl (f: 'a * 'b -> 'a) : 'a * 'b list -> 'a = |
|
475 |
let fun itl (e, []) = e |
|
476 |
| itl (e, a::l) = itl (f(e, a), l) |
|
477 |
in itl end; |
|
478 |
||
479 |
(* (op @) ([x1, ..., xn], e) ===> x1 @ (x2 ... @ (xn @ e)) |
|
480 |
for operators that associate to the right (not tail recursive)*) |
|
481 |
fun foldr f (l, e) = |
|
482 |
let fun itr [] = e |
|
483 |
| itr (a::l) = f(a, itr l) |
|
484 |
in itr l end; |
|
485 |
||
486 |
(* (op @) [x1, ..., xn] ===> x1 @ (x2 ... @ (x[n-1] @ xn)) |
|
487 |
for n > 0, operators that associate to the right (not tail recursive)*) |
|
488 |
fun foldr1 f l = |
|
4181 | 489 |
let fun itr [x] = x |
233 | 490 |
| itr (x::l) = f(x, itr l) |
491 |
in itr l end; |
|
492 |
||
15760 | 493 |
fun foldln f xs e = fst (foldl (fn ((e,i), x) => (f (x,i) e, i+1)) ((e,1),xs)); |
14792 | 494 |
|
233 | 495 |
|
496 |
(* basic list functions *) |
|
497 |
||
498 |
(*take the first n elements from a list*) |
|
499 |
fun take (n, []) = [] |
|
500 |
| take (n, x :: xs) = |
|
501 |
if n > 0 then x :: take (n - 1, xs) else []; |
|
502 |
||
503 |
(*drop the first n elements from a list*) |
|
504 |
fun drop (n, []) = [] |
|
505 |
| drop (n, x :: xs) = |
|
506 |
if n > 0 then drop (n - 1, xs) else x :: xs; |
|
0 | 507 |
|
13629 | 508 |
fun splitAt(n,[]) = ([],[]) |
509 |
| splitAt(n,xs as x::ys) = |
|
510 |
if n>0 then let val (ps,qs) = splitAt(n-1,ys) in (x::ps,qs) end |
|
511 |
else ([],xs) |
|
512 |
||
4713 | 513 |
fun dropwhile P [] = [] |
514 |
| dropwhile P (ys as x::xs) = if P x then dropwhile P xs else ys; |
|
515 |
||
233 | 516 |
(*return nth element of a list, where 0 designates the first element; |
517 |
raise EXCEPTION if list too short*) |
|
15570 | 518 |
fun nth_elem (i,xs) = List.nth(xs,i); |
233 | 519 |
|
11773 | 520 |
fun map_nth_elem 0 f (x :: xs) = f x :: xs |
521 |
| map_nth_elem n f (x :: xs) = x :: map_nth_elem (n - 1) f xs |
|
15570 | 522 |
| map_nth_elem _ _ [] = raise Subscript; |
11773 | 523 |
|
233 | 524 |
(*last element of a list*) |
15570 | 525 |
val last_elem = List.last; |
233 | 526 |
|
3762 | 527 |
(*rear decomposition*) |
15570 | 528 |
fun split_last [] = raise Empty |
3762 | 529 |
| split_last [x] = ([], x) |
530 |
| split_last (x :: xs) = apfst (cons x) (split_last xs); |
|
531 |
||
4893 | 532 |
(*update nth element*) |
13629 | 533 |
fun nth_update x n_xs = |
534 |
(case splitAt n_xs of |
|
15570 | 535 |
(_,[]) => raise Subscript |
13629 | 536 |
| (prfx, _ :: sffx') => prfx @ (x :: sffx')) |
4893 | 537 |
|
4212 | 538 |
(*find the position of an element in a list*) |
539 |
fun find_index pred = |
|
540 |
let fun find _ [] = ~1 |
|
541 |
| find n (x :: xs) = if pred x then n else find (n + 1) xs; |
|
542 |
in find 0 end; |
|
3762 | 543 |
|
4224 | 544 |
fun find_index_eq x = find_index (equal x); |
4212 | 545 |
|
546 |
(*find first element satisfying predicate*) |
|
15531 | 547 |
fun find_first _ [] = NONE |
4212 | 548 |
| find_first pred (x :: xs) = |
15531 | 549 |
if pred x then SOME x else find_first pred xs; |
233 | 550 |
|
4916
fe8b0c82691b
get_first: ('a -> 'b option) -> 'a list -> 'b option;
wenzelm
parents:
4893
diff
changeset
|
551 |
(*get first element by lookup function*) |
15531 | 552 |
fun get_first _ [] = NONE |
4916
fe8b0c82691b
get_first: ('a -> 'b option) -> 'a list -> 'b option;
wenzelm
parents:
4893
diff
changeset
|
553 |
| get_first f (x :: xs) = |
fe8b0c82691b
get_first: ('a -> 'b option) -> 'a list -> 'b option;
wenzelm
parents:
4893
diff
changeset
|
554 |
(case f x of |
15531 | 555 |
NONE => get_first f xs |
4916
fe8b0c82691b
get_first: ('a -> 'b option) -> 'a list -> 'b option;
wenzelm
parents:
4893
diff
changeset
|
556 |
| some => some); |
fe8b0c82691b
get_first: ('a -> 'b option) -> 'a list -> 'b option;
wenzelm
parents:
4893
diff
changeset
|
557 |
|
233 | 558 |
(*flatten a list of lists to a list*) |
15531 | 559 |
val flat = List.concat; |
233 | 560 |
|
12136 | 561 |
fun unflat (xs :: xss) ys = |
13629 | 562 |
let val (ps,qs) = splitAt(length xs,ys) |
563 |
in ps :: unflat xss qs end |
|
12136 | 564 |
| unflat [] [] = [] |
15570 | 565 |
| unflat _ _ = raise UnequalLengths; |
12136 | 566 |
|
233 | 567 |
(*like Lisp's MAPC -- seq proc [x1, ..., xn] evaluates |
568 |
(proc x1; ...; proc xn) for side effects*) |
|
15570 | 569 |
val seq = List.app; |
233 | 570 |
|
571 |
(*separate s [x1, x2, ..., xn] ===> [x1, s, x2, s, ..., s, xn]*) |
|
572 |
fun separate s (x :: (xs as _ :: _)) = x :: s :: separate s xs |
|
573 |
| separate _ xs = xs; |
|
574 |
||
575 |
(*make the list [x, x, ..., x] of length n*) |
|
576 |
fun replicate n (x: 'a) : 'a list = |
|
577 |
let fun rep (0, xs) = xs |
|
578 |
| rep (n, xs) = rep (n - 1, x :: xs) |
|
579 |
in |
|
15570 | 580 |
if n < 0 then raise Subscript |
233 | 581 |
else rep (n, []) |
582 |
end; |
|
583 |
||
14926 | 584 |
fun translate_string f = String.translate (f o String.str); |
585 |
||
4248
5e8a31c41d44
added get_error: 'a error -> string option, get_ok: 'a error -> 'a option;
wenzelm
parents:
4224
diff
changeset
|
586 |
(*multiply [a, b, c, ...] * [xs, ys, zs, ...]*) |
5e8a31c41d44
added get_error: 'a error -> string option, get_ok: 'a error -> 'a option;
wenzelm
parents:
4224
diff
changeset
|
587 |
fun multiply ([], _) = [] |
5e8a31c41d44
added get_error: 'a error -> string option, get_ok: 'a error -> 'a option;
wenzelm
parents:
4224
diff
changeset
|
588 |
| multiply (x :: xs, yss) = map (cons x) yss @ multiply (xs, yss); |
5e8a31c41d44
added get_error: 'a error -> string option, get_ok: 'a error -> 'a option;
wenzelm
parents:
4224
diff
changeset
|
589 |
|
14792 | 590 |
(*direct product*) |
591 |
fun product _ [] = [] |
|
592 |
| product [] _ = [] |
|
593 |
| product (x :: xs) ys = map (pair x) ys @ product xs ys; |
|
594 |
||
233 | 595 |
|
596 |
(* filter *) |
|
597 |
||
598 |
(*copy the list preserving elements that satisfy the predicate*) |
|
15531 | 599 |
val filter = List.filter; |
0 | 600 |
fun filter_out f = filter (not o f); |
15570 | 601 |
val mapfilter = List.mapPartial; |
233 | 602 |
|
603 |
||
604 |
(* lists of pairs *) |
|
605 |
||
15570 | 606 |
exception UnequalLengths; |
607 |
||
380 | 608 |
fun map2 _ ([], []) = [] |
609 |
| map2 f (x :: xs, y :: ys) = (f (x, y) :: map2 f (xs, ys)) |
|
15570 | 610 |
| map2 _ _ = raise UnequalLengths; |
380 | 611 |
|
612 |
fun exists2 _ ([], []) = false |
|
613 |
| exists2 pred (x :: xs, y :: ys) = pred (x, y) orelse exists2 pred (xs, ys) |
|
15570 | 614 |
| exists2 _ _ = raise UnequalLengths; |
380 | 615 |
|
616 |
fun forall2 _ ([], []) = true |
|
617 |
| forall2 pred (x :: xs, y :: ys) = pred (x, y) andalso forall2 pred (xs, ys) |
|
15570 | 618 |
| forall2 _ _ = raise UnequalLengths; |
380 | 619 |
|
4956
a7538e43896e
added foldl_map: ('a * 'b -> 'a * 'c) -> 'a * 'b list -> 'a * 'c list;
wenzelm
parents:
4945
diff
changeset
|
620 |
fun seq2 _ ([], []) = () |
a7538e43896e
added foldl_map: ('a * 'b -> 'a * 'c) -> 'a * 'b list -> 'a * 'c list;
wenzelm
parents:
4945
diff
changeset
|
621 |
| seq2 f (x :: xs, y :: ys) = (f (x, y); seq2 f (xs, ys)) |
15570 | 622 |
| seq2 _ _ = raise UnequalLengths; |
4956
a7538e43896e
added foldl_map: ('a * 'b -> 'a * 'c) -> 'a * 'b list -> 'a * 'c list;
wenzelm
parents:
4945
diff
changeset
|
623 |
|
233 | 624 |
(*combine two lists forming a list of pairs: |
625 |
[x1, ..., xn] ~~ [y1, ..., yn] ===> [(x1, y1), ..., (xn, yn)]*) |
|
626 |
fun [] ~~ [] = [] |
|
627 |
| (x :: xs) ~~ (y :: ys) = (x, y) :: (xs ~~ ys) |
|
15570 | 628 |
| _ ~~ _ = raise UnequalLengths; |
233 | 629 |
|
630 |
(*inverse of ~~; the old 'split': |
|
631 |
[(x1, y1), ..., (xn, yn)] ===> ([x1, ..., xn], [y1, ..., yn])*) |
|
15570 | 632 |
val split_list = ListPair.unzip; |
233 | 633 |
|
7468
6ce03d2f7d91
equal_lists: ('a * 'b -> bool) -> 'a list * 'b list -> bool;
wenzelm
parents:
7090
diff
changeset
|
634 |
fun equal_lists eq (xs, ys) = length xs = length ys andalso forall2 eq (xs, ys); |
6ce03d2f7d91
equal_lists: ('a * 'b -> bool) -> 'a list * 'b list -> bool;
wenzelm
parents:
7090
diff
changeset
|
635 |
|
233 | 636 |
|
637 |
(* prefixes, suffixes *) |
|
638 |
||
639 |
fun [] prefix _ = true |
|
640 |
| (x :: xs) prefix (y :: ys) = x = y andalso (xs prefix ys) |
|
641 |
| _ prefix _ = false; |
|
642 |
||
643 |
(* [x1, ..., xi, ..., xn] ---> ([x1, ..., x(i-1)], [xi, ..., xn]) |
|
644 |
where xi is the first element that does not satisfy the predicate*) |
|
645 |
fun take_prefix (pred : 'a -> bool) (xs: 'a list) : 'a list * 'a list = |
|
646 |
let fun take (rxs, []) = (rev rxs, []) |
|
255
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset
|
647 |
| take (rxs, x :: xs) = |
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset
|
648 |
if pred x then take(x :: rxs, xs) else (rev rxs, x :: xs) |
233 | 649 |
in take([], xs) end; |
650 |
||
651 |
(* [x1, ..., xi, ..., xn] ---> ([x1, ..., xi], [x(i+1), ..., xn]) |
|
652 |
where xi is the last element that does not satisfy the predicate*) |
|
653 |
fun take_suffix _ [] = ([], []) |
|
654 |
| take_suffix pred (x :: xs) = |
|
655 |
(case take_suffix pred xs of |
|
656 |
([], sffx) => if pred x then ([], x :: sffx) else ([x], sffx) |
|
657 |
| (prfx, sffx) => (x :: prfx, sffx)); |
|
658 |
||
12249 | 659 |
fun prefixes1 [] = [] |
660 |
| prefixes1 (x :: xs) = map (cons x) ([] :: prefixes1 xs); |
|
661 |
||
662 |
fun suffixes1 xs = map rev (prefixes1 (rev xs)); |
|
663 |
||
233 | 664 |
|
665 |
||
666 |
(** integers **) |
|
667 |
||
10692 | 668 |
fun gcd(x,y) = |
15965
f422f8283491
Use of IntInf.int instead of int in most numeric simprocs; avoids
paulson
parents:
15760
diff
changeset
|
669 |
let fun gxd x y : IntInf.int = |
10692 | 670 |
if y = 0 then x else gxd y (x mod y) |
671 |
in if x < y then gxd y x else gxd x y end; |
|
672 |
||
673 |
fun lcm(x,y) = (x * y) div gcd(x,y); |
|
674 |
||
2958 | 675 |
fun inc i = (i := ! i + 1; ! i); |
676 |
fun dec i = (i := ! i - 1; ! i); |
|
233 | 677 |
|
678 |
||
679 |
(* lists of integers *) |
|
680 |
||
681 |
(*make the list [from, from + 1, ..., to]*) |
|
2175
21fde76bc742
Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents:
2157
diff
changeset
|
682 |
fun (from upto to) = |
233 | 683 |
if from > to then [] else from :: ((from + 1) upto to); |
684 |
||
685 |
(*make the list [from, from - 1, ..., to]*) |
|
2175
21fde76bc742
Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents:
2157
diff
changeset
|
686 |
fun (from downto to) = |
233 | 687 |
if from < to then [] else from :: ((from - 1) downto to); |
688 |
||
689 |
(*predicate: downto0 (is, n) <=> is = [n, n - 1, ..., 0]*) |
|
690 |
fun downto0 (i :: is, n) = i = n andalso downto0 (is, n - 1) |
|
691 |
| downto0 ([], n) = n = ~1; |
|
692 |
||
693 |
||
694 |
(* convert integers to strings *) |
|
695 |
||
696 |
(*expand the number in the given base; |
|
697 |
example: radixpand (2, 8) gives [1, 0, 0, 0]*) |
|
698 |
fun radixpand (base, num) : int list = |
|
699 |
let |
|
700 |
fun radix (n, tail) = |
|
701 |
if n < base then n :: tail |
|
702 |
else radix (n div base, (n mod base) :: tail) |
|
703 |
in radix (num, []) end; |
|
704 |
||
705 |
(*expands a number into a string of characters starting from "zerochar"; |
|
706 |
example: radixstring (2, "0", 8) gives "1000"*) |
|
707 |
fun radixstring (base, zerochar, num) = |
|
708 |
let val offset = ord zerochar; |
|
709 |
fun chrof n = chr (offset + n) |
|
710 |
in implode (map chrof (radixpand (base, num))) end; |
|
711 |
||
712 |
||
3407
afd288caf573
Removal of radixstring from string_of_int; addition of string_of_indexname
paulson
parents:
3393
diff
changeset
|
713 |
val string_of_int = Int.toString; |
233 | 714 |
|
3407
afd288caf573
Removal of radixstring from string_of_int; addition of string_of_indexname
paulson
parents:
3393
diff
changeset
|
715 |
fun string_of_indexname (a,0) = a |
afd288caf573
Removal of radixstring from string_of_int; addition of string_of_indexname
paulson
parents:
3393
diff
changeset
|
716 |
| string_of_indexname (a,i) = a ^ "_" ^ Int.toString i; |
233 | 717 |
|
718 |
||
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
|
719 |
(* 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
|
720 |
|
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
|
721 |
fun read_radixint (radix: int, cs) : 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
|
722 |
let val zero = ord"0" |
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
|
723 |
val limit = zero+radix |
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
|
724 |
fun scan (num,[]) = (num,[]) |
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
|
725 |
| scan (num, c::cs) = |
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
|
726 |
if zero <= ord c andalso ord c < limit |
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
|
727 |
then scan(radix*num + ord c - zero, cs) |
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
|
728 |
else (num, c::cs) |
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
|
729 |
in scan(0,cs) end; |
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
|
730 |
|
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
|
731 |
fun read_int cs = read_radixint (10, cs); |
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
|
732 |
|
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
|
733 |
fun oct_char s = chr (#1 (read_radixint (8, explode s))); |
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
|
734 |
|
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
|
735 |
|
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
|
736 |
|
233 | 737 |
(** strings **) |
738 |
||
6312 | 739 |
(*functions tuned for strings, avoiding explode*) |
740 |
||
741 |
fun nth_elem_string (i, str) = |
|
6959 | 742 |
(case try String.substring (str, i, 1) of |
15531 | 743 |
SOME s => s |
15570 | 744 |
| NONE => raise Subscript); |
6312 | 745 |
|
6282 | 746 |
fun foldl_string f (x0, str) = |
747 |
let |
|
748 |
val n = size str; |
|
14968 | 749 |
fun fold (x, i) = |
750 |
if i < n then fold (f (x, String.substring (str, i, 1)), i + 1) else x; |
|
6282 | 751 |
in fold (x0, 0) end; |
752 |
||
14968 | 753 |
fun exists_string pred str = |
754 |
let |
|
755 |
val n = size str; |
|
756 |
fun ex i = i < n andalso (pred (String.substring (str, i, 1)) orelse ex (i + 1)); |
|
757 |
in ex 0 end; |
|
6312 | 758 |
|
512
55755ed9fab9
Pure/library/enclose, Pure/Syntax/pretty/enclose: renamed from parents
lcp
parents:
410
diff
changeset
|
759 |
(*enclose in brackets*) |
55755ed9fab9
Pure/library/enclose, Pure/Syntax/pretty/enclose: renamed from parents
lcp
parents:
410
diff
changeset
|
760 |
fun enclose lpar rpar str = lpar ^ str ^ rpar; |
6642 | 761 |
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
|
762 |
|
233 | 763 |
(*simple quoting (does not escape special chars)*) |
512
55755ed9fab9
Pure/library/enclose, Pure/Syntax/pretty/enclose: renamed from parents
lcp
parents:
410
diff
changeset
|
764 |
val quote = enclose "\"" "\""; |
233 | 765 |
|
4212 | 766 |
(*space_implode "..." (explode "hello") = "h...e...l...l...o"*) |
233 | 767 |
fun space_implode a bs = implode (separate a bs); |
768 |
||
255
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset
|
769 |
val commas = space_implode ", "; |
380 | 770 |
val commas_quote = commas o map quote; |
255
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset
|
771 |
|
233 | 772 |
(*concatenate messages, one per line, into a string*) |
255
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset
|
773 |
val cat_lines = space_implode "\n"; |
233 | 774 |
|
4212 | 775 |
(*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
|
776 |
fun space_explode _ "" = [] |
17a20a2af8f5
fixed space_explode, old one retained as BAD_space_explode;
wenzelm
parents:
3762
diff
changeset
|
777 |
| space_explode sep str = |
17a20a2af8f5
fixed space_explode, old one retained as BAD_space_explode;
wenzelm
parents:
3762
diff
changeset
|
778 |
let |
17a20a2af8f5
fixed space_explode, old one retained as BAD_space_explode;
wenzelm
parents:
3762
diff
changeset
|
779 |
fun expl chs = |
17a20a2af8f5
fixed space_explode, old one retained as BAD_space_explode;
wenzelm
parents:
3762
diff
changeset
|
780 |
(case take_prefix (not_equal sep) chs of |
17a20a2af8f5
fixed space_explode, old one retained as BAD_space_explode;
wenzelm
parents:
3762
diff
changeset
|
781 |
(cs, []) => [implode cs] |
17a20a2af8f5
fixed space_explode, old one retained as BAD_space_explode;
wenzelm
parents:
3762
diff
changeset
|
782 |
| (cs, _ :: cs') => implode cs :: expl cs'); |
17a20a2af8f5
fixed space_explode, old one retained as BAD_space_explode;
wenzelm
parents:
3762
diff
changeset
|
783 |
in expl (explode str) end; |
17a20a2af8f5
fixed space_explode, old one retained as BAD_space_explode;
wenzelm
parents:
3762
diff
changeset
|
784 |
|
17a20a2af8f5
fixed space_explode, old one retained as BAD_space_explode;
wenzelm
parents:
3762
diff
changeset
|
785 |
val split_lines = space_explode "\n"; |
17a20a2af8f5
fixed space_explode, old one retained as BAD_space_explode;
wenzelm
parents:
3762
diff
changeset
|
786 |
|
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
|
787 |
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
|
788 |
| 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
|
789 |
|
7712 | 790 |
(*untabify*) |
791 |
fun untabify chs = |
|
792 |
let |
|
793 |
val tab_width = 8; |
|
794 |
||
795 |
fun untab (_, "\n") = (0, ["\n"]) |
|
9118 | 796 |
| untab (pos, "\t") = |
797 |
let val d = tab_width - (pos mod tab_width) in (pos + d, replicate d " ") end |
|
7712 | 798 |
| untab (pos, c) = (pos + 1, [c]); |
799 |
in |
|
800 |
if not (exists (equal "\t") chs) then chs |
|
801 |
else flat (#2 (foldl_map untab (0, chs))) |
|
802 |
end; |
|
803 |
||
5285 | 804 |
(*append suffix*) |
805 |
fun suffix sfx s = s ^ sfx; |
|
806 |
||
807 |
(*remove suffix*) |
|
808 |
fun unsuffix sfx s = |
|
809 |
let |
|
810 |
val cs = explode s; |
|
811 |
val prfx_len = size s - size sfx; |
|
812 |
in |
|
813 |
if prfx_len >= 0 andalso implode (drop (prfx_len, cs)) = sfx then |
|
814 |
implode (take (prfx_len, cs)) |
|
15570 | 815 |
else raise Fail "unsuffix" |
5285 | 816 |
end; |
817 |
||
15060 | 818 |
(*remove prefix*) |
819 |
fun unprefix prfx s = |
|
820 |
let val (prfx', sfx) = splitAt (size prfx, explode s) |
|
821 |
in |
|
822 |
if implode prfx' = prfx then implode sfx |
|
15570 | 823 |
else raise Fail "unprefix" |
15060 | 824 |
end; |
825 |
||
10951 | 826 |
fun replicate_string 0 _ = "" |
827 |
| replicate_string 1 a = a |
|
828 |
| replicate_string k a = |
|
829 |
if k mod 2 = 0 then replicate_string (k div 2) (a ^ a) |
|
830 |
else replicate_string (k div 2) (a ^ a) ^ a; |
|
831 |
||
3832
17a20a2af8f5
fixed space_explode, old one retained as BAD_space_explode;
wenzelm
parents:
3762
diff
changeset
|
832 |
|
233 | 833 |
|
834 |
(** lists as sets **) |
|
835 |
||
836 |
(*membership in a list*) |
|
837 |
fun x mem [] = false |
|
838 |
| x mem (y :: ys) = x = y orelse x mem ys; |
|
0 | 839 |
|
2175
21fde76bc742
Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents:
2157
diff
changeset
|
840 |
(*membership in a list, optimized version for ints*) |
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
841 |
fun (x:int) mem_int [] = false |
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
842 |
| x mem_int (y :: ys) = x = y orelse x mem_int ys; |
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
843 |
|
2175
21fde76bc742
Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents:
2157
diff
changeset
|
844 |
(*membership in a list, optimized version for strings*) |
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
845 |
fun (x:string) mem_string [] = false |
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
846 |
| x mem_string (y :: ys) = x = y orelse x mem_string ys; |
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
847 |
|
0 | 848 |
(*generalized membership test*) |
233 | 849 |
fun gen_mem eq (x, []) = false |
850 |
| gen_mem eq (x, y :: ys) = eq (x, y) orelse gen_mem eq (x, ys); |
|
851 |
||
15760 | 852 |
(*insert and remove*) |
853 |
fun insert eq x xs = if gen_mem eq (x, xs) then xs else x :: xs; |
|
854 |
fun remove eq x xs = if gen_mem eq (x, xs) then filter_out (fn y => eq (x, y)) xs else xs; |
|
233 | 855 |
|
856 |
(*insertion into list if not already there*) |
|
2175
21fde76bc742
Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents:
2157
diff
changeset
|
857 |
fun (x ins xs) = if x mem xs then xs else x :: xs; |
0 | 858 |
|
2175
21fde76bc742
Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents:
2157
diff
changeset
|
859 |
(*insertion into list, optimized version for ints*) |
21fde76bc742
Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents:
2157
diff
changeset
|
860 |
fun (x ins_int xs) = if x mem_int xs then xs else x :: xs; |
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
861 |
|
2175
21fde76bc742
Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents:
2157
diff
changeset
|
862 |
(*insertion into list, optimized version for strings*) |
21fde76bc742
Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents:
2157
diff
changeset
|
863 |
fun (x ins_string xs) = if x mem_string xs then xs else x :: xs; |
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
864 |
|
0 | 865 |
(*generalized insertion*) |
15760 | 866 |
fun gen_ins eq (x, xs) = insert eq x xs; |
233 | 867 |
|
868 |
(*union of sets represented as lists: no repetitions*) |
|
869 |
fun xs union [] = xs |
|
870 |
| [] union ys = ys |
|
871 |
| (x :: xs) union ys = xs union (x ins ys); |
|
0 | 872 |
|
2175
21fde76bc742
Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents:
2157
diff
changeset
|
873 |
(*union of sets, optimized version for ints*) |
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
874 |
fun (xs:int list) union_int [] = xs |
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
875 |
| [] union_int ys = ys |
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
876 |
| (x :: xs) union_int ys = xs union_int (x ins_int ys); |
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
877 |
|
2175
21fde76bc742
Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents:
2157
diff
changeset
|
878 |
(*union of sets, optimized version for strings*) |
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
879 |
fun (xs:string list) union_string [] = xs |
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
880 |
| [] union_string ys = ys |
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
881 |
| (x :: xs) union_string ys = xs union_string (x ins_string ys); |
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
882 |
|
0 | 883 |
(*generalized union*) |
233 | 884 |
fun gen_union eq (xs, []) = xs |
885 |
| gen_union eq ([], ys) = ys |
|
886 |
| gen_union eq (x :: xs, ys) = gen_union eq (xs, gen_ins eq (x, ys)); |
|
887 |
||
888 |
||
889 |
(*intersection*) |
|
890 |
fun [] inter ys = [] |
|
891 |
| (x :: xs) inter ys = |
|
892 |
if x mem ys then x :: (xs inter ys) else xs inter ys; |
|
893 |
||
2175
21fde76bc742
Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents:
2157
diff
changeset
|
894 |
(*intersection, optimized version for ints*) |
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
895 |
fun ([]:int list) inter_int ys = [] |
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
896 |
| (x :: xs) inter_int ys = |
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
897 |
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
|
898 |
|
2175
21fde76bc742
Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents:
2157
diff
changeset
|
899 |
(*intersection, optimized version for strings *) |
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
900 |
fun ([]:string list) inter_string ys = [] |
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
901 |
| (x :: xs) inter_string ys = |
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
902 |
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
|
903 |
|
7090 | 904 |
(*generalized intersection*) |
905 |
fun gen_inter eq ([], ys) = [] |
|
12284 | 906 |
| gen_inter eq (x::xs, ys) = |
7090 | 907 |
if gen_mem eq (x,ys) then x :: gen_inter eq (xs, ys) |
12284 | 908 |
else gen_inter eq (xs, ys); |
7090 | 909 |
|
233 | 910 |
|
911 |
(*subset*) |
|
912 |
fun [] subset ys = true |
|
913 |
| (x :: xs) subset ys = x mem ys andalso xs subset ys; |
|
914 |
||
2175
21fde76bc742
Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents:
2157
diff
changeset
|
915 |
(*subset, optimized version for ints*) |
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
916 |
fun ([]:int list) subset_int ys = true |
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
917 |
| (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
|
918 |
|
2175
21fde76bc742
Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents:
2157
diff
changeset
|
919 |
(*subset, optimized version for strings*) |
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
920 |
fun ([]:string list) subset_string ys = true |
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
921 |
| (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
|
922 |
|
4363 | 923 |
(*set equality*) |
924 |
fun eq_set (xs, ys) = |
|
925 |
xs = ys orelse (xs subset ys andalso ys subset xs); |
|
926 |
||
2182
29e56f003599
Removal of polymorphic equality via mem, subset, eq_set, etc
paulson
parents:
2175
diff
changeset
|
927 |
(*set equality for strings*) |
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
928 |
fun eq_set_string ((xs:string list), ys) = |
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
929 |
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
|
930 |
|
2182
29e56f003599
Removal of polymorphic equality via mem, subset, eq_set, etc
paulson
parents:
2175
diff
changeset
|
931 |
fun gen_subset eq (xs, ys) = forall (fn x => gen_mem eq (x, ys)) xs; |
29e56f003599
Removal of polymorphic equality via mem, subset, eq_set, etc
paulson
parents:
2175
diff
changeset
|
932 |
|
265 | 933 |
|
233 | 934 |
(*removing an element from a list WITHOUT duplicates*) |
935 |
fun (y :: ys) \ x = if x = y then ys else y :: (ys \ x) |
|
936 |
| [] \ x = []; |
|
937 |
||
2243
3ebeaaacfbd1
Eta-expanded some declarations that are illegal under value polymorphism
paulson
parents:
2196
diff
changeset
|
938 |
fun ys \\ xs = foldl (op \) (ys,xs); |
0 | 939 |
|
233 | 940 |
(*removing an element from a list -- possibly WITH duplicates*) |
941 |
fun gen_rem eq (xs, y) = filter_out (fn x => eq (x, y)) xs; |
|
12295 | 942 |
fun gen_rems eq (xs, ys) = filter_out (fn x => gen_mem eq (x, ys)) xs; |
233 | 943 |
|
944 |
(*makes a list of the distinct members of the input; preserves order, takes |
|
945 |
first of equal elements*) |
|
946 |
fun gen_distinct eq lst = |
|
947 |
let |
|
948 |
val memb = gen_mem eq; |
|
0 | 949 |
|
233 | 950 |
fun dist (rev_seen, []) = rev rev_seen |
951 |
| dist (rev_seen, x :: xs) = |
|
952 |
if memb (x, rev_seen) then dist (rev_seen, xs) |
|
953 |
else dist (x :: rev_seen, xs); |
|
954 |
in |
|
955 |
dist ([], lst) |
|
956 |
end; |
|
957 |
||
2243
3ebeaaacfbd1
Eta-expanded some declarations that are illegal under value polymorphism
paulson
parents:
2196
diff
changeset
|
958 |
fun distinct l = gen_distinct (op =) l; |
233 | 959 |
|
960 |
||
961 |
(*returns the tail beginning with the first repeated element, or []*) |
|
962 |
fun findrep [] = [] |
|
963 |
| findrep (x :: xs) = if x mem xs then x :: xs else findrep xs; |
|
964 |
||
965 |
||
255
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset
|
966 |
(*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
|
967 |
order, takes first of equal elements*) |
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset
|
968 |
fun gen_duplicates eq lst = |
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset
|
969 |
let |
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset
|
970 |
val memb = gen_mem eq; |
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset
|
971 |
|
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset
|
972 |
fun dups (rev_dups, []) = rev rev_dups |
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset
|
973 |
| dups (rev_dups, x :: xs) = |
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset
|
974 |
if memb (x, rev_dups) orelse not (memb (x, xs)) then |
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset
|
975 |
dups (rev_dups, xs) |
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset
|
976 |
else dups (x :: rev_dups, xs); |
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset
|
977 |
in |
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset
|
978 |
dups ([], lst) |
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset
|
979 |
end; |
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset
|
980 |
|
2243
3ebeaaacfbd1
Eta-expanded some declarations that are illegal under value polymorphism
paulson
parents:
2196
diff
changeset
|
981 |
fun duplicates l = gen_duplicates (op =) l; |
255
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset
|
982 |
|
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset
|
983 |
|
233 | 984 |
|
985 |
(** association lists **) |
|
0 | 986 |
|
233 | 987 |
(*association list lookup*) |
15531 | 988 |
fun assoc ([], key) = NONE |
233 | 989 |
| assoc ((keyi, xi) :: pairs, key) = |
15531 | 990 |
if key = keyi then SOME xi else assoc (pairs, key); |
233 | 991 |
|
2175
21fde76bc742
Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents:
2157
diff
changeset
|
992 |
(*association list lookup, optimized version for ints*) |
15531 | 993 |
fun assoc_int ([], (key:int)) = NONE |
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
994 |
| assoc_int ((keyi, xi) :: pairs, key) = |
15531 | 995 |
if key = keyi then SOME xi else assoc_int (pairs, key); |
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
996 |
|
2175
21fde76bc742
Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents:
2157
diff
changeset
|
997 |
(*association list lookup, optimized version for strings*) |
15531 | 998 |
fun assoc_string ([], (key:string)) = NONE |
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
999 |
| assoc_string ((keyi, xi) :: pairs, key) = |
15531 | 1000 |
if key = keyi then SOME xi else assoc_string (pairs, key); |
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
1001 |
|
2175
21fde76bc742
Updated syntax; shortened comments; put in monomorphic versions of ins
paulson
parents:
2157
diff
changeset
|
1002 |
(*association list lookup, optimized version for string*ints*) |
15531 | 1003 |
fun assoc_string_int ([], (key:string*int)) = NONE |
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
1004 |
| assoc_string_int ((keyi, xi) :: pairs, key) = |
15531 | 1005 |
if key = keyi then SOME xi else assoc_string_int (pairs, key); |
1576
af8f43f742a0
Added some optimized versions of functions dealing with sets
berghofe
parents:
1460
diff
changeset
|
1006 |
|
233 | 1007 |
fun assocs ps x = |
1008 |
(case assoc (ps, x) of |
|
15531 | 1009 |
NONE => [] |
1010 |
| SOME ys => ys); |
|
233 | 1011 |
|
255
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset
|
1012 |
(*two-fold association list lookup*) |
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset
|
1013 |
fun assoc2 (aal, (key1, key2)) = |
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset
|
1014 |
(case assoc (aal, key1) of |
15531 | 1015 |
SOME al => assoc (al, key2) |
1016 |
| NONE => NONE); |
|
255
ee132db91681
added if_none, parents, commas, gen_duplicates, duplicates, assoc2;
wenzelm
parents:
245
diff
changeset
|
1017 |
|
233 | 1018 |
(*generalized association list lookup*) |
15531 | 1019 |
fun gen_assoc eq ([], key) = NONE |
233 | 1020 |
| gen_assoc eq ((keyi, xi) :: pairs, key) = |
15531 | 1021 |
if eq (key, keyi) then SOME xi else gen_assoc eq (pairs, key); |
233 | 1022 |
|
1023 |
(*association list update*) |
|
1024 |
fun overwrite (al, p as (key, _)) = |
|
1025 |
let fun over ((q as (keyi, _)) :: pairs) = |
|
1026 |
if keyi = key then p :: pairs else q :: (over pairs) |
|
1027 |
| over [] = [p] |
|
1028 |
in over al end; |
|
1029 |
||
2522 | 1030 |
fun gen_overwrite eq (al, p as (key, _)) = |
1031 |
let fun over ((q as (keyi, _)) :: pairs) = |
|
1032 |
if eq (keyi, key) then p :: pairs else q :: (over pairs) |
|
1033 |
| over [] = [p] |
|
1034 |
in over al end; |
|
1035 |
||
233 | 1036 |
|
12284 | 1037 |
(* lists as tables *) |
233 | 1038 |
|
12284 | 1039 |
fun gen_merge_lists _ xs [] = xs |
1040 |
| gen_merge_lists _ [] ys = ys |
|
1041 |
| gen_merge_lists eq xs ys = xs @ gen_rems eq (ys, xs); |
|
0 | 1042 |
|
12284 | 1043 |
fun gen_merge_lists' _ xs [] = xs |
1044 |
| gen_merge_lists' _ [] ys = ys |
|
12295 | 1045 |
| gen_merge_lists' eq xs ys = gen_rems eq (ys, xs) @ xs; |
0 | 1046 |
|
12284 | 1047 |
fun merge_lists xs ys = gen_merge_lists (op =) xs ys; |
1048 |
fun merge_lists' xs ys = gen_merge_lists' (op =) xs ys; |
|
1049 |
fun merge_alists al = gen_merge_lists eq_fst al; |
|
15263 | 1050 |
fun merge_alists' al = gen_merge_lists' eq_fst al; |
380 | 1051 |
|
0 | 1052 |
|
1053 |
||
233 | 1054 |
(** balanced trees **) |
1055 |
||
1056 |
exception Balance; (*indicates non-positive argument to balancing fun*) |
|
1057 |
||
1058 |
(*balanced folding; avoids deep nesting*) |
|
1059 |
fun fold_bal f [x] = x |
|
1060 |
| fold_bal f [] = raise Balance |
|
1061 |
| fold_bal f xs = |
|
13629 | 1062 |
let val (ps,qs) = splitAt(length xs div 2, xs) |
1063 |
in f (fold_bal f ps, fold_bal f qs) end; |
|
233 | 1064 |
|
1065 |
(*construct something of the form f(...g(...(x)...)) for balanced access*) |
|
1066 |
fun access_bal (f, g, x) n i = |
|
1067 |
let fun acc n i = (*1<=i<=n*) |
|
1068 |
if n=1 then x else |
|
1069 |
let val n2 = n div 2 |
|
1070 |
in if i<=n2 then f (acc n2 i) |
|
1071 |
else g (acc (n-n2) (i-n2)) |
|
1072 |
end |
|
1073 |
in if 1<=i andalso i<=n then acc n i else raise Balance end; |
|
1074 |
||
1075 |
(*construct ALL such accesses; could try harder to share recursive calls!*) |
|
1076 |
fun accesses_bal (f, g, x) n = |
|
1077 |
let fun acc n = |
|
1078 |
if n=1 then [x] else |
|
1079 |
let val n2 = n div 2 |
|
1080 |
val acc2 = acc n2 |
|
1081 |
in if n-n2=n2 then map f acc2 @ map g acc2 |
|
1082 |
else map f acc2 @ map g (acc (n-n2)) end |
|
1083 |
in if 1<=n then acc n else raise Balance end; |
|
1084 |
||
1085 |
||
1086 |
||
2506 | 1087 |
(** orders **) |
1088 |
||
4445 | 1089 |
fun rev_order LESS = GREATER |
1090 |
| rev_order EQUAL = EQUAL |
|
1091 |
| rev_order GREATER = LESS; |
|
1092 |
||
4479 | 1093 |
(*assume rel is a linear strict order*) |
4445 | 1094 |
fun make_ord rel (x, y) = |
1095 |
if rel (x, y) then LESS |
|
1096 |
else if rel (y, x) then GREATER |
|
1097 |
else EQUAL; |
|
1098 |
||
15051
0dbbab9f77fe
int_ord = Int.compare, string_ord = String.compare;
wenzelm
parents:
15035
diff
changeset
|
1099 |
val int_ord = Int.compare; |
0dbbab9f77fe
int_ord = Int.compare, string_ord = String.compare;
wenzelm
parents:
15035
diff
changeset
|
1100 |
val string_ord = String.compare; |
2506 | 1101 |
|
4343 | 1102 |
(*lexicographic product*) |
1103 |
fun prod_ord a_ord b_ord ((x, y), (x', y')) = |
|
1104 |
(case a_ord (x, x') of EQUAL => b_ord (y, y') | ord => ord); |
|
1105 |
||
1106 |
(*dictionary order -- in general NOT well-founded!*) |
|
1107 |
fun dict_ord _ ([], []) = EQUAL |
|
1108 |
| dict_ord _ ([], _ :: _) = LESS |
|
1109 |
| dict_ord _ (_ :: _, []) = GREATER |
|
1110 |
| dict_ord elem_ord (x :: xs, y :: ys) = |
|
1111 |
(case elem_ord (x, y) of EQUAL => dict_ord elem_ord (xs, ys) | ord => ord); |
|
1112 |
||
1113 |
(*lexicographic product of lists*) |
|
1114 |
fun list_ord elem_ord (xs, ys) = |
|
1115 |
prod_ord int_ord (dict_ord elem_ord) ((length xs, xs), (length ys, ys)); |
|
1116 |
||
2506 | 1117 |
|
4621 | 1118 |
(* sorting *) |
1119 |
||
1120 |
(*quicksort (stable, i.e. does not reorder equal elements)*) |
|
1121 |
fun sort ord = |
|
1122 |
let |
|
1123 |
fun qsort xs = |
|
1124 |
let val len = length xs in |
|
1125 |
if len <= 1 then xs |
|
1126 |
else |
|
1127 |
let val (lts, eqs, gts) = part (nth_elem (len div 2, xs)) xs in |
|
1128 |
qsort lts @ eqs @ qsort gts |
|
1129 |
end |
|
1130 |
end |
|
1131 |
and part _ [] = ([], [], []) |
|
1132 |
| part pivot (x :: xs) = add (ord (x, pivot)) x (part pivot xs) |
|
1133 |
and add LESS x (lts, eqs, gts) = (x :: lts, eqs, gts) |
|
1134 |
| add EQUAL x (lts, eqs, gts) = (lts, x :: eqs, gts) |
|
1135 |
| add GREATER x (lts, eqs, gts) = (lts, eqs, x :: gts); |
|
1136 |
in qsort end; |
|
1137 |
||
1138 |
(*sort strings*) |
|
1139 |
val sort_strings = sort string_ord; |
|
1140 |
fun sort_wrt sel xs = sort (string_ord o pairself sel) xs; |
|
1141 |
||
11514 | 1142 |
fun unique_strings ([]: string list) = [] |
1143 |
| unique_strings [x] = [x] |
|
1144 |
| unique_strings (x :: y :: ys) = |
|
1145 |
if x = y then unique_strings (y :: ys) |
|
1146 |
else x :: unique_strings (y :: ys); |
|
4621 | 1147 |
|
2506 | 1148 |
|
14106
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
1149 |
(** random numbers **) |
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
1150 |
|
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
1151 |
exception RANDOM; |
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
1152 |
|
14618
068bb99f3ebd
Fixed bug in rmod that caused an overflow exception in SML/NJ.
berghofe
parents:
14472
diff
changeset
|
1153 |
fun rmod x y = x - y * Real.realFloor (x / y); |
14106
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
1154 |
|
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
1155 |
local |
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
1156 |
val a = 16807.0; |
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
1157 |
val m = 2147483647.0; |
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
1158 |
val random_seed = ref 1.0; |
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
1159 |
in |
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
1160 |
|
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
1161 |
fun random () = |
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
1162 |
let val r = rmod (a * !random_seed) m |
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
1163 |
in (random_seed := r; r) end; |
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
1164 |
|
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
1165 |
end; |
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
1166 |
|
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
1167 |
fun random_range l h = |
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
1168 |
if h < l orelse l < 0 then raise RANDOM |
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
1169 |
else l + Real.floor (rmod (random ()) (real (h - l + 1))); |
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
1170 |
|
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
1171 |
fun one_of xs = nth_elem (random_range 0 (length xs - 1), xs); |
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
1172 |
|
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
1173 |
fun frequency xs = |
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
1174 |
let |
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
1175 |
val sum = foldl op + (0, map fst xs); |
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
1176 |
fun pick n ((k, x) :: xs) = |
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
1177 |
if n <= k then x else pick (n - k) xs |
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
1178 |
in pick (random_range 1 sum) xs end; |
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
1179 |
|
bbf708a7e27f
Added several functions for producing random numbers.
berghofe
parents:
13794
diff
changeset
|
1180 |
|
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
|
1181 |
(** current directory **) |
233 | 1182 |
|
2243
3ebeaaacfbd1
Eta-expanded some declarations that are illegal under value polymorphism
paulson
parents:
2196
diff
changeset
|
1183 |
val cd = OS.FileSys.chDir; |
2317 | 1184 |
val pwd = OS.FileSys.getDir; |
2243
3ebeaaacfbd1
Eta-expanded some declarations that are illegal under value polymorphism
paulson
parents:
2196
diff
changeset
|
1185 |
|
3606 | 1186 |
|
233 | 1187 |
|
10692 | 1188 |
(** rational numbers **) |
1189 |
||
15965
f422f8283491
Use of IntInf.int instead of int in most numeric simprocs; avoids
paulson
parents:
15760
diff
changeset
|
1190 |
datatype rat = Rat of bool * IntInf.int * IntInf.int |
10692 | 1191 |
|
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
|
1192 |
exception RAT of string; |
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
|
1193 |
|
10692 | 1194 |
fun rep_rat(Rat(a,p,q)) = (if a then p else ~p,q) |
1195 |
||
1196 |
fun ratnorm(a,p,q) = if p=0 then Rat(a,0,1) else |
|
1197 |
let val absp = abs p |
|
1198 |
val m = gcd(absp,q) |
|
1199 |
in Rat(a = (0 <= p), absp div m, q div m) end; |
|
1200 |
||
1201 |
fun ratadd(Rat(a,p,q),Rat(b,r,s)) = |
|
1202 |
let val den = lcm(q,s) |
|
1203 |
val p = p*(den div q) and r = r*(den div s) |
|
1204 |
val num = (if a then p else ~p) + (if b then r else ~r) |
|
1205 |
in ratnorm(true,num,den) end; |
|
1206 |
||
1207 |
fun ratmul(Rat(a,p,q),Rat(b,r,s)) = ratnorm(a=b,p*r,q*s) |
|
1208 |
||
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
|
1209 |
fun ratinv(Rat(a,p,q)) = if p=0 then raise RAT "ratinv" else Rat(a,q,p) |
10692 | 1210 |
|
1211 |
fun int_ratdiv(p,q) = |
|
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
|
1212 |
if q=0 then raise RAT "int_ratdiv" else ratnorm(0<=q, p, abs q) |
10692 | 1213 |
|
1214 |
fun ratneg(Rat(b,p,q)) = Rat(not b,p,q); |
|
1215 |
||
15965
f422f8283491
Use of IntInf.int instead of int in most numeric simprocs; avoids
paulson
parents:
15760
diff
changeset
|
1216 |
fun rat_of_intinf i = if i < 0 then Rat(false,abs i,1) else Rat(true,i,1); |
f422f8283491
Use of IntInf.int instead of int in most numeric simprocs; avoids
paulson
parents:
15760
diff
changeset
|
1217 |
|
f422f8283491
Use of IntInf.int instead of int in most numeric simprocs; avoids
paulson
parents:
15760
diff
changeset
|
1218 |
fun rat_of_int i = rat_of_intinf (IntInf.fromInt i); |
10692 | 1219 |
|
1220 |
||
4621 | 1221 |
(** misc **) |
233 | 1222 |
|
1223 |
(*use the keyfun to make a list of (x, key) pairs*) |
|
0 | 1224 |
fun make_keylist (keyfun: 'a->'b) : 'a list -> ('a * 'b) list = |
233 | 1225 |
let fun keypair x = (x, keyfun x) |
1226 |
in map keypair end; |
|
0 | 1227 |
|
233 | 1228 |
(*given a list of (x, key) pairs and a searchkey |
0 | 1229 |
return the list of xs from each pair whose key equals searchkey*) |
1230 |
fun keyfilter [] searchkey = [] |
|
233 | 1231 |
| keyfilter ((x, key) :: pairs) searchkey = |
1232 |
if key = searchkey then x :: keyfilter pairs searchkey |
|
1233 |
else keyfilter pairs searchkey; |
|
0 | 1234 |
|
1235 |
||
1236 |
(*Partition list into elements that satisfy predicate and those that don't. |
|
233 | 1237 |
Preserves order of elements in both lists.*) |
15570 | 1238 |
val partition = List.partition; |
0 | 1239 |
|
1240 |
||
1241 |
fun partition_eq (eq:'a * 'a -> bool) = |
|
1242 |
let fun part [] = [] |
|
233 | 1243 |
| part (x::ys) = let val (xs, xs') = partition (apl(x, eq)) ys |
1244 |
in (x::xs)::(part xs') end |
|
0 | 1245 |
in part end; |
1246 |
||
1247 |
||
233 | 1248 |
(*Partition a list into buckets [ bi, b(i+1), ..., bj ] |
0 | 1249 |
putting x in bk if p(k)(x) holds. Preserve order of elements if possible.*) |
1250 |
fun partition_list p i j = |
|
233 | 1251 |
let fun part k xs = |
1252 |
if k>j then |
|
0 | 1253 |
(case xs of [] => [] |
15570 | 1254 |
| _ => raise Fail "partition_list") |
0 | 1255 |
else |
233 | 1256 |
let val (ns, rest) = partition (p k) xs; |
1257 |
in ns :: part(k+1)rest end |
|
0 | 1258 |
in part i end; |
1259 |
||
1260 |
||
233 | 1261 |
(* generating identifiers *) |
0 | 1262 |
|
4063 | 1263 |
(** Freshly generated identifiers; supplied prefix MUST start with a letter **) |
0 | 1264 |
local |
4063 | 1265 |
(*Maps 0-63 to A-Z, a-z, 0-9 or _ or ' for generating random identifiers*) |
1266 |
fun char i = if i<26 then chr (ord "A" + i) |
|
5904 | 1267 |
else if i<52 then chr (ord "a" + i - 26) |
1268 |
else if i<62 then chr (ord"0" + i - 52) |
|
1269 |
else if i=62 then "_" |
|
1270 |
else (*i=63*) "'"; |
|
4063 | 1271 |
|
1272 |
val charVec = Vector.tabulate (64, char); |
|
1273 |
||
5904 | 1274 |
fun newid n = |
1275 |
let |
|
4284 | 1276 |
in implode (map (fn i => Vector.sub(charVec,i)) (radixpand (64,n))) end; |
2003 | 1277 |
|
4284 | 1278 |
val seedr = ref 0; |
0 | 1279 |
|
4063 | 1280 |
in |
4284 | 1281 |
|
12346 | 1282 |
fun gensym pre = pre ^ (#1(newid (!seedr), inc seedr)); |
2003 | 1283 |
|
4063 | 1284 |
end; |
1285 |
||
1286 |
||
233 | 1287 |
(* lexical scanning *) |
0 | 1288 |
|
233 | 1289 |
(*scan a list of characters into "words" composed of "letters" (recognized by |
1290 |
is_let) and separated by any number of non-"letters"*) |
|
1291 |
fun scanwords is_let cs = |
|
0 | 1292 |
let fun scan1 [] = [] |
233 | 1293 |
| scan1 cs = |
1294 |
let val (lets, rest) = take_prefix is_let cs |
|
1295 |
in implode lets :: scanwords is_let rest end; |
|
1296 |
in scan1 (#2 (take_prefix (not o is_let) cs)) end; |
|
24
f3d4ff75d9f2
added functions that operate on filenames: split_filename (originally located
clasohm
parents:
0
diff
changeset
|
1297 |
|
4212 | 1298 |
|
1364
8ea1a962ad72
files now define a structure to allow SML/NJ to optimize the code
clasohm
parents:
1290
diff
changeset
|
1299 |
end; |
8ea1a962ad72
files now define a structure to allow SML/NJ to optimize the code
clasohm
parents:
1290
diff
changeset
|
1300 |
|
15745 | 1301 |
structure BasicLibrary: BASIC_LIBRARY = Library; |
1302 |
open BasicLibrary; |