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