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