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