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