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