src/Pure/PIDE/document.ML
author wenzelm
Wed Jan 24 19:50:00 2018 +0100 (18 months ago)
changeset 67500 dfde99d59f6e
parent 67380 8bef51521f21
child 68184 6c693b2700b3
permissions -rw-r--r--
tuned: prefer list operations over Source.source;
approximative parsing of theory header;
wenzelm@38150
     1
(*  Title:      Pure/PIDE/document.ML
wenzelm@38150
     2
    Author:     Makarius
wenzelm@38150
     3
wenzelm@38150
     4
Document as collection of named nodes, each consisting of an editable
wenzelm@52536
     5
list of commands, associated with asynchronous execution process.
wenzelm@38150
     6
*)
wenzelm@38150
     7
wenzelm@38150
     8
signature DOCUMENT =
wenzelm@38150
     9
sig
wenzelm@52796
    10
  val timing: bool Unsynchronized.ref
wenzelm@59715
    11
  type node_header = {master: string, header: Thy_Header.header, errors: string list}
wenzelm@52862
    12
  type overlay = Document_ID.command * (string * string list)
wenzelm@44157
    13
  datatype node_edit =
wenzelm@52530
    14
    Edits of (Document_ID.command option * Document_ID.command option) list |
wenzelm@48707
    15
    Deps of node_header |
wenzelm@52849
    16
    Perspective of bool * Document_ID.command list * overlay list
wenzelm@44156
    17
  type edit = string * node_edit
wenzelm@38418
    18
  type state
wenzelm@38418
    19
  val init_state: state
wenzelm@54519
    20
  val define_blob: string -> string -> state -> state
wenzelm@56458
    21
  type blob_digest = (string * string option) Exn.result
wenzelm@59685
    22
  val define_command: Document_ID.command -> string -> blob_digest list -> int ->
wenzelm@59085
    23
    ((int * int) * string) list -> state -> state
wenzelm@60880
    24
  val command_exec: state -> string -> Document_ID.command -> Command.exec option
wenzelm@52530
    25
  val remove_versions: Document_ID.version list -> state -> state
wenzelm@52774
    26
  val start_execution: state -> state
wenzelm@66379
    27
  val consolidate_execution: state -> unit
wenzelm@52530
    28
  val update: Document_ID.version -> Document_ID.version -> edit list -> state ->
wenzelm@52655
    29
    Document_ID.exec list * (Document_ID.command * Document_ID.exec list) list * state
wenzelm@43713
    30
  val state: unit -> state
wenzelm@43713
    31
  val change_state: (state -> state) -> unit
wenzelm@38150
    32
end;
wenzelm@38150
    33
wenzelm@38150
    34
structure Document: DOCUMENT =
wenzelm@38150
    35
struct
wenzelm@38150
    36
wenzelm@52796
    37
val timing = Unsynchronized.ref false;
wenzelm@52796
    38
fun timeit msg e = cond_timeit (! timing) msg e;
wenzelm@52796
    39
wenzelm@52796
    40
wenzelm@52796
    41
wenzelm@38418
    42
(** document structure **)
wenzelm@38418
    43
wenzelm@52530
    44
fun err_dup kind id = error ("Duplicate " ^ kind ^ ": " ^ Document_ID.print id);
wenzelm@52530
    45
fun err_undef kind id = error ("Undefined " ^ kind ^ ": " ^ Document_ID.print id);
wenzelm@52530
    46
wenzelm@59715
    47
type node_header =
wenzelm@59715
    48
  {master: string, header: Thy_Header.header, errors: string list};
wenzelm@52849
    49
wenzelm@52849
    50
type perspective =
wenzelm@52849
    51
 {required: bool,  (*required node*)
wenzelm@52849
    52
  visible: Inttab.set,  (*visible commands*)
wenzelm@52849
    53
  visible_last: Document_ID.command option,  (*last visible command*)
wenzelm@57874
    54
  overlays: (string * string list) list Inttab.table};  (*command id -> print functions with args*)
wenzelm@52849
    55
wenzelm@52530
    56
structure Entries = Linear_Set(type key = Document_ID.command val ord = int_ord);
wenzelm@38448
    57
wenzelm@43668
    58
abstype node = Node of
wenzelm@48707
    59
 {header: node_header,  (*master directory, theory header, errors*)
wenzelm@59086
    60
  keywords: Keyword.keywords option,  (*outer syntax keywords*)
wenzelm@52849
    61
  perspective: perspective,  (*command perspective*)
wenzelm@66369
    62
  entries: Command.exec option Entries.T,  (*command entries with executions*)
wenzelm@66379
    63
  result: Command.eval option,  (*result of last execution*)
wenzelm@66379
    64
  consolidated: unit lazy}  (*consolidation status of eval forks*)
wenzelm@50862
    65
and version = Version of node String_Graph.T  (*development graph wrt. static imports*)
wenzelm@38418
    66
with
wenzelm@38418
    67
wenzelm@66379
    68
fun make_node (header, keywords, perspective, entries, result, consolidated) =
wenzelm@59086
    69
  Node {header = header, keywords = keywords, perspective = perspective,
wenzelm@66379
    70
    entries = entries, result = result, consolidated = consolidated};
wenzelm@43668
    71
wenzelm@66379
    72
fun map_node f (Node {header, keywords, perspective, entries, result, consolidated}) =
wenzelm@66379
    73
  make_node (f (header, keywords, perspective, entries, result, consolidated));
wenzelm@38418
    74
wenzelm@52849
    75
fun make_perspective (required, command_ids, overlays) : perspective =
wenzelm@52849
    76
 {required = required,
wenzelm@52849
    77
  visible = Inttab.make_set command_ids,
wenzelm@52849
    78
  visible_last = try List.last command_ids,
wenzelm@52862
    79
  overlays = Inttab.make_list overlays};
wenzelm@44441
    80
wenzelm@59715
    81
val no_header: node_header =
wenzelm@59715
    82
  {master = "", header = Thy_Header.make ("", Position.none) [] [], errors = []};
wenzelm@52849
    83
val no_perspective = make_perspective (false, [], []);
wenzelm@44386
    84
wenzelm@66379
    85
val empty_node = make_node (no_header, NONE, no_perspective, Entries.empty, NONE, Lazy.value ());
wenzelm@44386
    86
wenzelm@57615
    87
fun is_no_perspective ({required, visible, visible_last, overlays}: perspective) =
wenzelm@57615
    88
  not required andalso
wenzelm@57615
    89
  Inttab.is_empty visible andalso
wenzelm@57615
    90
  is_none visible_last andalso
wenzelm@57615
    91
  Inttab.is_empty overlays;
wenzelm@57615
    92
wenzelm@66379
    93
fun is_empty_node (Node {header, keywords, perspective, entries, result, consolidated}) =
wenzelm@57615
    94
  header = no_header andalso
wenzelm@59086
    95
  is_none keywords andalso
wenzelm@57615
    96
  is_no_perspective perspective andalso
wenzelm@57615
    97
  Entries.is_empty entries andalso
wenzelm@66379
    98
  is_none result andalso
wenzelm@66379
    99
  Lazy.is_finished consolidated;
wenzelm@57615
   100
wenzelm@44386
   101
wenzelm@44386
   102
(* basic components *)
wenzelm@44386
   103
wenzelm@59715
   104
fun master_directory (Node {header = {master, ...}, ...}) =
wenzelm@54558
   105
  (case try Url.explode master of
wenzelm@54558
   106
    SOME (Url.File path) => path
wenzelm@54558
   107
  | _ => Path.current);
wenzelm@54558
   108
wenzelm@59715
   109
fun set_header master header errors =
wenzelm@66379
   110
  map_node (fn (_, keywords, perspective, entries, result, consolidated) =>
wenzelm@66379
   111
    ({master = master, header = header, errors = errors},
wenzelm@66379
   112
      keywords, perspective, entries, result, consolidated));
wenzelm@59086
   113
wenzelm@59715
   114
fun get_header (Node {header, ...}) = header;
wenzelm@48707
   115
wenzelm@59086
   116
fun set_keywords keywords =
wenzelm@66379
   117
  map_node (fn (header, _, perspective, entries, result, consolidated) =>
wenzelm@66379
   118
    (header, keywords, perspective, entries, result, consolidated));
wenzelm@59086
   119
wenzelm@59086
   120
fun get_keywords (Node {keywords, ...}) = keywords;
wenzelm@59086
   121
wenzelm@48927
   122
fun read_header node span =
wenzelm@48927
   123
  let
wenzelm@59715
   124
    val {header, errors, ...} = get_header node;
wenzelm@59715
   125
    val _ =
wenzelm@59715
   126
      if null errors then ()
wenzelm@59715
   127
      else
wenzelm@59715
   128
        cat_lines errors |>
wenzelm@59715
   129
        (case Position.get_id (Position.thread_data ()) of
wenzelm@59715
   130
          NONE => I
wenzelm@59715
   131
        | SOME id => Protocol_Message.command_positions_yxml id)
wenzelm@59715
   132
        |> error;
wenzelm@59934
   133
    val {name = (name, _), imports, ...} = header;
wenzelm@67500
   134
    val {name = (_, pos), imports = imports', keywords} =
wenzelm@67500
   135
      Thy_Header.read_tokens Position.none span;
wenzelm@63022
   136
    val imports'' = (map #1 imports ~~ map #2 imports') handle ListPair.UnequalLengths => imports;
wenzelm@63022
   137
  in Thy_Header.make (name, pos) imports'' keywords end;
wenzelm@54526
   138
wenzelm@44385
   139
fun get_perspective (Node {perspective, ...}) = perspective;
wenzelm@59086
   140
wenzelm@52808
   141
fun set_perspective args =
wenzelm@66379
   142
  map_node (fn (header, keywords, _, entries, result, consolidated) =>
wenzelm@66379
   143
    (header, keywords, make_perspective args, entries, result, consolidated));
wenzelm@44385
   144
wenzelm@52849
   145
val required_node = #required o get_perspective;
wenzelm@52849
   146
val visible_command = Inttab.defined o #visible o get_perspective;
wenzelm@52849
   147
val visible_last = #visible_last o get_perspective;
wenzelm@47345
   148
val visible_node = is_some o visible_last
wenzelm@52850
   149
val overlays = Inttab.lookup_list o #overlays o get_perspective;
wenzelm@47345
   150
wenzelm@44444
   151
fun map_entries f =
wenzelm@66379
   152
  map_node (fn (header, keywords, perspective, entries, result, consolidated) =>
wenzelm@66379
   153
    (header, keywords, perspective, f entries, result, consolidated));
wenzelm@59086
   154
wenzelm@52761
   155
fun get_entries (Node {entries, ...}) = entries;
wenzelm@44645
   156
wenzelm@44645
   157
fun iterate_entries f = Entries.iterate NONE f o get_entries;
wenzelm@52761
   158
fun iterate_entries_after start f (Node {entries, ...}) =
wenzelm@44645
   159
  (case Entries.get_after entries start of
wenzelm@44645
   160
    NONE => I
wenzelm@44645
   161
  | SOME id => Entries.iterate (SOME id) f entries);
wenzelm@43668
   162
wenzelm@47339
   163
fun get_result (Node {result, ...}) = result;
wenzelm@59086
   164
wenzelm@44385
   165
fun set_result result =
wenzelm@66379
   166
  map_node (fn (header, keywords, perspective, entries, _, consolidated) =>
wenzelm@66379
   167
    (header, keywords, perspective, entries, result, consolidated));
wenzelm@52566
   168
wenzelm@52772
   169
fun pending_result node =
wenzelm@52772
   170
  (case get_result node of
wenzelm@52772
   171
    SOME eval => not (Command.eval_finished eval)
wenzelm@52772
   172
  | NONE => false);
wenzelm@52533
   173
wenzelm@59198
   174
fun finished_result node =
wenzelm@59198
   175
  (case get_result node of
wenzelm@59198
   176
    SOME eval => Command.eval_finished eval
wenzelm@59198
   177
  | NONE => false);
wenzelm@59198
   178
wenzelm@66379
   179
fun finished_result_theory node =
wenzelm@66379
   180
  finished_result node andalso
wenzelm@66379
   181
    let val st = Command.eval_result_state (the (get_result node))
wenzelm@66379
   182
    in (Toplevel.end_theory Position.none st; true) handle ERROR _ => false end;
wenzelm@66379
   183
wenzelm@66379
   184
val reset_consolidated =
wenzelm@66379
   185
  map_node (fn (header, keywords, perspective, entries, result, _) =>
wenzelm@66379
   186
    (header, keywords, perspective, entries, result, Lazy.lazy I));
wenzelm@66379
   187
wenzelm@66379
   188
fun check_consolidated (node as Node {consolidated, ...}) =
wenzelm@66379
   189
  Lazy.is_finished consolidated orelse
wenzelm@66379
   190
  finished_result_theory node andalso
wenzelm@66379
   191
    let
wenzelm@66379
   192
      val result_id = Command.eval_exec_id (the (get_result node));
wenzelm@66379
   193
      val eval_ids =
wenzelm@66379
   194
        iterate_entries (fn (_, opt_exec) => fn eval_ids =>
wenzelm@66379
   195
          (case opt_exec of
wenzelm@66379
   196
            SOME (eval, _) => SOME (cons (Command.eval_exec_id eval) eval_ids)
wenzelm@66379
   197
          | NONE => NONE)) node [];
wenzelm@66379
   198
    in
wenzelm@66379
   199
      (case Execution.snapshot eval_ids of
wenzelm@66379
   200
        [] =>
wenzelm@66379
   201
         (Lazy.force consolidated;
wenzelm@66379
   202
          Position.setmp_thread_data (Position.id_only (Document_ID.print result_id))
wenzelm@66379
   203
            (fn () => Output.status (Markup.markup_only Markup.consolidated)) ();
wenzelm@66379
   204
          true)
wenzelm@66379
   205
      | _ => false)
wenzelm@66379
   206
    end;
wenzelm@66379
   207
wenzelm@50862
   208
fun get_node nodes name = String_Graph.get_node nodes name
wenzelm@50862
   209
  handle String_Graph.UNDEF _ => empty_node;
wenzelm@50862
   210
fun default_node name = String_Graph.default_node (name, empty_node);
wenzelm@50862
   211
fun update_node name f = default_node name #> String_Graph.map_node name f;
wenzelm@38418
   212
wenzelm@38418
   213
wenzelm@38448
   214
(* node edits and associated executions *)
wenzelm@38150
   215
wenzelm@52862
   216
type overlay = Document_ID.command * (string * string list);
wenzelm@52849
   217
wenzelm@44157
   218
datatype node_edit =
wenzelm@52530
   219
  Edits of (Document_ID.command option * Document_ID.command option) list |
wenzelm@48707
   220
  Deps of node_header |
wenzelm@52849
   221
  Perspective of bool * Document_ID.command list * overlay list;
wenzelm@44157
   222
wenzelm@44156
   223
type edit = string * node_edit;
wenzelm@38448
   224
wenzelm@49064
   225
val after_entry = Entries.get_after o get_entries;
wenzelm@44479
   226
wenzelm@49064
   227
fun lookup_entry node id =
wenzelm@49064
   228
  (case Entries.lookup (get_entries node) id of
wenzelm@44480
   229
    NONE => NONE
wenzelm@44480
   230
  | SOME (exec, _) => exec);
wenzelm@44480
   231
wenzelm@49064
   232
fun the_entry node id =
wenzelm@49064
   233
  (case Entries.lookup (get_entries node) id of
wenzelm@38448
   234
    NONE => err_undef "command entry" id
wenzelm@44476
   235
  | SOME (exec, _) => exec);
wenzelm@38150
   236
wenzelm@52566
   237
fun assign_entry (command_id, exec) node =
wenzelm@52566
   238
  if is_none (Entries.lookup (get_entries node) command_id) then node
wenzelm@52566
   239
  else map_entries (Entries.update (command_id, exec)) node;
wenzelm@38418
   240
wenzelm@38448
   241
fun reset_after id entries =
wenzelm@38448
   242
  (case Entries.get_after entries id of
wenzelm@38448
   243
    NONE => entries
wenzelm@38448
   244
  | SOME next => Entries.update (next, NONE) entries);
wenzelm@38448
   245
wenzelm@43668
   246
val edit_node = map_entries o fold
wenzelm@43668
   247
  (fn (id, SOME id2) => Entries.insert_after id (id2, NONE)
wenzelm@43668
   248
    | (id, NONE) => Entries.delete_after id #> reset_after id);
wenzelm@38418
   249
wenzelm@38418
   250
wenzelm@38418
   251
(* version operations *)
wenzelm@38418
   252
wenzelm@50862
   253
val empty_version = Version String_Graph.empty;
wenzelm@44185
   254
wenzelm@38418
   255
fun nodes_of (Version nodes) = nodes;
wenzelm@44185
   256
val node_of = get_node o nodes_of;
wenzelm@38418
   257
wenzelm@44185
   258
fun cycle_msg names = "Cyclic dependency of " ^ space_implode " via " (map quote names);
wenzelm@44180
   259
wenzelm@44157
   260
fun edit_nodes (name, node_edit) (Version nodes) =
wenzelm@44157
   261
  Version
wenzelm@44436
   262
    (case node_edit of
wenzelm@54562
   263
      Edits edits => update_node name (edit_node edits) nodes
wenzelm@59715
   264
    | Deps {master, header, errors} =>
wenzelm@44436
   265
        let
wenzelm@48927
   266
          val imports = map fst (#imports header);
wenzelm@44436
   267
          val nodes1 = nodes
wenzelm@44436
   268
            |> default_node name
wenzelm@48927
   269
            |> fold default_node imports;
wenzelm@44436
   270
          val nodes2 = nodes1
wenzelm@50862
   271
            |> String_Graph.Keys.fold
wenzelm@50862
   272
                (fn dep => String_Graph.del_edge (dep, name)) (String_Graph.imm_preds nodes1 name);
wenzelm@59086
   273
          val (nodes3, errors1) =
wenzelm@59086
   274
            (String_Graph.add_deps_acyclic (name, imports) nodes2, errors)
wenzelm@59086
   275
              handle String_Graph.CYCLES cs => (nodes2, errors @ map cycle_msg cs);
wenzelm@59715
   276
        in String_Graph.map_node name (set_header master header errors1) nodes3 end
wenzelm@47406
   277
    | Perspective perspective => update_node name (set_perspective perspective) nodes);
wenzelm@44444
   278
wenzelm@59086
   279
fun update_keywords name nodes =
wenzelm@59086
   280
  nodes |> String_Graph.map_node name (fn node =>
wenzelm@59086
   281
    if is_empty_node node then node
wenzelm@59086
   282
    else
wenzelm@59086
   283
      let
wenzelm@59715
   284
        val {master, header, errors} = get_header node;
wenzelm@59086
   285
        val imports_keywords = map_filter (get_keywords o get_node nodes o #1) (#imports header);
wenzelm@59086
   286
        val keywords =
wenzelm@59086
   287
          Library.foldl Keyword.merge_keywords (Session.get_keywords (), imports_keywords);
wenzelm@59086
   288
        val (keywords', errors') =
wenzelm@59086
   289
          (Keyword.add_keywords (#keywords header) keywords, errors)
wenzelm@59086
   290
            handle ERROR msg =>
wenzelm@59086
   291
              (keywords, if member (op =) errors msg then errors else errors @ [msg]);
wenzelm@59086
   292
      in
wenzelm@59086
   293
        node
wenzelm@59715
   294
        |> set_header master header errors'
wenzelm@59086
   295
        |> set_keywords (SOME keywords')
wenzelm@59086
   296
      end);
wenzelm@59086
   297
wenzelm@59086
   298
fun edit_keywords edits (Version nodes) =
wenzelm@59086
   299
  Version
wenzelm@59086
   300
    (fold update_keywords
wenzelm@59086
   301
      (String_Graph.all_succs nodes (map_filter (fn (a, Deps _) => SOME a | _ => NONE) edits))
wenzelm@59086
   302
      nodes);
wenzelm@59086
   303
wenzelm@44222
   304
fun put_node (name, node) (Version nodes) =
wenzelm@57616
   305
  let
wenzelm@57616
   306
    val nodes1 = update_node name (K node) nodes;
wenzelm@57616
   307
    val nodes2 =
wenzelm@57616
   308
      if String_Graph.is_maximal nodes1 name andalso is_empty_node node
wenzelm@57616
   309
      then String_Graph.del_node name nodes1
wenzelm@57616
   310
      else nodes1;
wenzelm@57616
   311
  in Version nodes2 end;
wenzelm@38418
   312
wenzelm@38150
   313
end;
wenzelm@38150
   314
wenzelm@38418
   315
wenzelm@52595
   316
wenzelm@52595
   317
(** main state -- document structure and execution process **)
wenzelm@52536
   318
wenzelm@56458
   319
type blob_digest = (string * string option) Exn.result;  (*file node name, raw digest*)
wenzelm@55798
   320
wenzelm@52774
   321
type execution =
wenzelm@52774
   322
 {version_id: Document_ID.version,  (*static version id*)
wenzelm@52774
   323
  execution_id: Document_ID.execution,  (*dynamic execution id*)
wenzelm@59193
   324
  delay_request: unit future};  (*pending event timer request*)
wenzelm@52604
   325
wenzelm@52774
   326
val no_execution: execution =
wenzelm@59193
   327
  {version_id = Document_ID.none,
wenzelm@59193
   328
   execution_id = Document_ID.none,
wenzelm@59193
   329
   delay_request = Future.value ()};
wenzelm@52774
   330
wenzelm@59193
   331
fun new_execution version_id delay_request : execution =
wenzelm@59193
   332
  {version_id = version_id,
wenzelm@59193
   333
   execution_id = Execution.start (),
wenzelm@59193
   334
   delay_request = delay_request};
wenzelm@52604
   335
wenzelm@38418
   336
abstype state = State of
wenzelm@52536
   337
 {versions: version Inttab.table,  (*version id -> document content*)
wenzelm@55798
   338
  blobs: (SHA1.digest * string list) Symtab.table,  (*raw digest -> digest, lines*)
wenzelm@59689
   339
  commands: (string * blob_digest list * int * Token.T list lazy) Inttab.table,
wenzelm@59689
   340
    (*command id -> name, inlined files, token index of files, command span*)
wenzelm@52536
   341
  execution: execution}  (*current execution process*)
wenzelm@38418
   342
with
wenzelm@38418
   343
wenzelm@54519
   344
fun make_state (versions, blobs, commands, execution) =
wenzelm@54519
   345
  State {versions = versions, blobs = blobs, commands = commands, execution = execution};
wenzelm@38418
   346
wenzelm@54519
   347
fun map_state f (State {versions, blobs, commands, execution}) =
wenzelm@54519
   348
  make_state (f (versions, blobs, commands, execution));
wenzelm@38418
   349
wenzelm@38418
   350
val init_state =
wenzelm@54519
   351
  make_state (Inttab.make [(Document_ID.none, empty_version)],
wenzelm@54519
   352
    Symtab.empty, Inttab.empty, no_execution);
wenzelm@38418
   353
wenzelm@38418
   354
wenzelm@38418
   355
(* document versions *)
wenzelm@38418
   356
wenzelm@52536
   357
fun define_version version_id version =
wenzelm@59193
   358
  map_state (fn (versions, blobs, commands, {delay_request, ...}) =>
wenzelm@47420
   359
    let
wenzelm@52536
   360
      val versions' = Inttab.update_new (version_id, version) versions
wenzelm@47420
   361
        handle Inttab.DUP dup => err_dup "document version" dup;
wenzelm@59193
   362
      val execution' = new_execution version_id delay_request;
wenzelm@54519
   363
    in (versions', blobs, commands, execution') end);
wenzelm@38418
   364
wenzelm@52536
   365
fun the_version (State {versions, ...}) version_id =
wenzelm@52536
   366
  (case Inttab.lookup versions version_id of
wenzelm@52536
   367
    NONE => err_undef "document version" version_id
wenzelm@38418
   368
  | SOME version => version);
wenzelm@38418
   369
wenzelm@52536
   370
fun delete_version version_id versions =
wenzelm@52536
   371
  Inttab.delete version_id versions
wenzelm@52536
   372
    handle Inttab.UNDEF _ => err_undef "document version" version_id;
wenzelm@44673
   373
wenzelm@38418
   374
wenzelm@54519
   375
(* inlined files *)
wenzelm@54519
   376
wenzelm@54519
   377
fun define_blob digest text =
wenzelm@54519
   378
  map_state (fn (versions, blobs, commands, execution) =>
wenzelm@57638
   379
    let val blobs' = Symtab.update (digest, (SHA1.fake digest, split_lines text)) blobs
wenzelm@54519
   380
    in (versions, blobs', commands, execution) end);
wenzelm@54519
   381
wenzelm@54519
   382
fun the_blob (State {blobs, ...}) digest =
wenzelm@54519
   383
  (case Symtab.lookup blobs digest of
wenzelm@54519
   384
    NONE => error ("Undefined blob: " ^ digest)
wenzelm@55788
   385
  | SOME content => content);
wenzelm@54519
   386
wenzelm@56447
   387
fun resolve_blob state (blob_digest: blob_digest) =
wenzelm@61077
   388
  blob_digest |> Exn.map_res (fn (file_node, raw_digest) =>
wenzelm@56458
   389
    (file_node, Option.map (the_blob state) raw_digest));
wenzelm@56447
   390
wenzelm@59685
   391
fun blob_reports pos (blob_digest: blob_digest) =
wenzelm@59685
   392
  (case blob_digest of Exn.Res (file_node, _) => [(pos, Markup.path file_node)] | _ => []);
wenzelm@59685
   393
wenzelm@54519
   394
wenzelm@38418
   395
(* commands *)
wenzelm@38418
   396
wenzelm@59702
   397
fun define_command command_id name blobs_digests blobs_index toks =
wenzelm@54519
   398
  map_state (fn (versions, blobs, commands, execution) =>
wenzelm@38418
   399
    let
wenzelm@52536
   400
      val id = Document_ID.print command_id;
wenzelm@52536
   401
      val span =
wenzelm@66167
   402
        Lazy.lazy_name "Document.define_command" (fn () =>
wenzelm@52536
   403
          Position.setmp_thread_data (Position.id_only id)
wenzelm@59685
   404
            (fn () =>
wenzelm@59685
   405
              let
wenzelm@59685
   406
                val (tokens, _) = fold_map Token.make toks (Position.id id);
wenzelm@59685
   407
                val _ =
wenzelm@59702
   408
                  if blobs_index < 0
wenzelm@59702
   409
                  then (*inlined errors*)
wenzelm@59702
   410
                    map_filter Exn.get_exn blobs_digests
wenzelm@59702
   411
                    |> List.app (Output.error_message o Runtime.exn_message)
wenzelm@59702
   412
                  else (*auxiliary files*)
wenzelm@60027
   413
                    let val pos = Token.pos_of (nth tokens blobs_index)
wenzelm@60027
   414
                    in Position.reports (maps (blob_reports pos) blobs_digests) end;
wenzelm@59685
   415
              in tokens end) ());
wenzelm@59685
   416
      val commands' =
wenzelm@59702
   417
        Inttab.update_new (command_id, (name, blobs_digests, blobs_index, span)) commands
wenzelm@59685
   418
          handle Inttab.DUP dup => err_dup "command" dup;
wenzelm@47395
   419
      val _ =
wenzelm@52536
   420
        Position.setmp_thread_data (Position.id_only id)
wenzelm@50201
   421
          (fn () => Output.status (Markup.markup_only Markup.accepted)) ();
wenzelm@54519
   422
    in (versions, blobs, commands', execution) end);
wenzelm@38418
   423
wenzelm@52536
   424
fun the_command (State {commands, ...}) command_id =
wenzelm@52536
   425
  (case Inttab.lookup commands command_id of
wenzelm@52536
   426
    NONE => err_undef "command" command_id
wenzelm@44644
   427
  | SOME command => command);
wenzelm@38418
   428
wenzelm@52569
   429
val the_command_name = #1 oo the_command;
wenzelm@52569
   430
wenzelm@66379
   431
wenzelm@66379
   432
(* execution *)
wenzelm@66379
   433
wenzelm@66379
   434
fun get_execution (State {execution, ...}) = execution;
wenzelm@66379
   435
fun get_execution_version state = the_version state (#version_id (get_execution state));
wenzelm@66379
   436
wenzelm@60880
   437
fun command_exec state node_name command_id =
wenzelm@60880
   438
  let
wenzelm@66379
   439
    val version = get_execution_version state;
wenzelm@66379
   440
    val node = get_node (nodes_of version) node_name;
wenzelm@60880
   441
  in the_entry node command_id end;
wenzelm@60880
   442
wenzelm@47420
   443
end;
wenzelm@38418
   444
wenzelm@52566
   445
wenzelm@52566
   446
(* remove_versions *)
wenzelm@52566
   447
wenzelm@54519
   448
fun remove_versions version_ids state = state |> map_state (fn (versions, _, _, execution) =>
wenzelm@47420
   449
  let
wenzelm@52536
   450
    val _ =
wenzelm@52536
   451
      member (op =) version_ids (#version_id execution) andalso
wenzelm@52536
   452
        error ("Attempt to remove execution version " ^ Document_ID.print (#version_id execution));
wenzelm@47343
   453
wenzelm@52536
   454
    val versions' = fold delete_version version_ids versions;
wenzelm@47420
   455
    val commands' =
wenzelm@47420
   456
      (versions', Inttab.empty) |->
wenzelm@47420
   457
        Inttab.fold (fn (_, version) => nodes_of version |>
wenzelm@50862
   458
          String_Graph.fold (fn (_, (node, _)) => node |>
wenzelm@52536
   459
            iterate_entries (fn ((_, command_id), _) =>
wenzelm@52536
   460
              SOME o Inttab.insert (K true) (command_id, the_command state command_id))));
wenzelm@54519
   461
    val blobs' =
wenzelm@54519
   462
      (commands', Symtab.empty) |->
wenzelm@59689
   463
        Inttab.fold (fn (_, (_, blobs, _, _)) => blobs |>
wenzelm@56458
   464
          fold (fn Exn.Res (_, SOME b) => Symtab.update (b, the_blob state b) | _ => I));
wenzelm@54519
   465
wenzelm@54519
   466
  in (versions', blobs', commands', execution) end);
wenzelm@38418
   467
wenzelm@38418
   468
wenzelm@52604
   469
(* document execution *)
wenzelm@47389
   470
wenzelm@60198
   471
fun make_required nodes =
wenzelm@60198
   472
  let
wenzelm@60198
   473
    fun all_preds P =
wenzelm@60198
   474
      String_Graph.fold (fn (a, (node, _)) => P node ? cons a) nodes []
wenzelm@60198
   475
      |> String_Graph.all_preds nodes
wenzelm@60198
   476
      |> Symtab.make_set;
wenzelm@60198
   477
wenzelm@60198
   478
    val all_visible = all_preds visible_node;
wenzelm@60198
   479
    val all_required = all_preds required_node;
wenzelm@60198
   480
  in
wenzelm@60198
   481
    Symtab.fold (fn (a, ()) =>
wenzelm@60198
   482
      exists (Symtab.defined all_visible) (String_Graph.immediate_succs nodes a) ?
wenzelm@60198
   483
        Symtab.update (a, ())) all_visible all_required
wenzelm@60198
   484
  end;
wenzelm@60198
   485
wenzelm@54519
   486
fun start_execution state = state |> map_state (fn (versions, blobs, commands, execution) =>
wenzelm@52796
   487
  timeit "Document.start_execution" (fn () =>
wenzelm@52796
   488
    let
wenzelm@59193
   489
      val {version_id, execution_id, delay_request} = execution;
wenzelm@52798
   490
wenzelm@52798
   491
      val delay = seconds (Options.default_real "editor_execution_delay");
wenzelm@52774
   492
wenzelm@52798
   493
      val _ = Future.cancel delay_request;
wenzelm@62826
   494
      val delay_request' = Event_Timer.future (Time.now () + delay);
wenzelm@52798
   495
wenzelm@59198
   496
      fun finished_import (name, (node, _)) =
wenzelm@65445
   497
        finished_result node orelse is_some (Thy_Info.lookup_theory name);
wenzelm@60198
   498
wenzelm@60198
   499
      val nodes = nodes_of (the_version state version_id);
wenzelm@60198
   500
      val required = make_required nodes;
wenzelm@59193
   501
      val _ =
wenzelm@60198
   502
        nodes |> String_Graph.schedule
wenzelm@52573
   503
          (fn deps => fn (name, node) =>
wenzelm@60198
   504
            if Symtab.defined required name orelse visible_node node orelse pending_result node then
wenzelm@52774
   505
              let
wenzelm@52775
   506
                fun body () =
wenzelm@59347
   507
                  (if forall finished_import deps then
wenzelm@59198
   508
                    iterate_entries (fn (_, opt_exec) => fn () =>
wenzelm@59198
   509
                      (case opt_exec of
wenzelm@59198
   510
                        SOME exec =>
wenzelm@59198
   511
                          if Execution.is_running execution_id
wenzelm@59198
   512
                          then SOME (Command.exec execution_id exec)
wenzelm@59198
   513
                          else NONE
wenzelm@59198
   514
                      | NONE => NONE)) node ()
wenzelm@59347
   515
                   else ())
wenzelm@62505
   516
                   handle exn => (Output.system_message (Runtime.exn_message exn); Exn.reraise exn);
wenzelm@52774
   517
                val future =
wenzelm@52774
   518
                  (singleton o Future.forks)
wenzelm@59193
   519
                   {name = "theory:" ^ name,
wenzelm@59193
   520
                    group = SOME (Future.new_group NONE),
wenzelm@59198
   521
                    deps = Future.task_of delay_request' :: maps (the_list o #2 o #2) deps,
wenzelm@59193
   522
                    pri = 0, interrupts = false} body;
wenzelm@59198
   523
              in (node, SOME (Future.task_of future)) end
wenzelm@59198
   524
            else (node, NONE));
wenzelm@52798
   525
      val execution' =
wenzelm@59193
   526
        {version_id = version_id, execution_id = execution_id, delay_request = delay_request'};
wenzelm@54519
   527
    in (versions, blobs, commands, execution') end));
wenzelm@47345
   528
wenzelm@66379
   529
fun consolidate_execution state =
wenzelm@66379
   530
  String_Graph.fold (fn (_, (node, _)) => fn () => ignore (check_consolidated node))
wenzelm@66379
   531
    (nodes_of (get_execution_version state)) ();
wenzelm@66379
   532
wenzelm@47345
   533
wenzelm@47420
   534
wenzelm@47420
   535
(** document update **)
wenzelm@38418
   536
wenzelm@52566
   537
(* exec state assignment *)
wenzelm@52566
   538
wenzelm@52566
   539
type assign_update = Command.exec option Inttab.table;  (*command id -> exec*)
wenzelm@52566
   540
wenzelm@52566
   541
val assign_update_empty: assign_update = Inttab.empty;
wenzelm@52566
   542
fun assign_update_defined (tab: assign_update) command_id = Inttab.defined tab command_id;
wenzelm@52566
   543
fun assign_update_apply (tab: assign_update) node = Inttab.fold assign_entry tab node;
wenzelm@52566
   544
wenzelm@52566
   545
fun assign_update_new upd (tab: assign_update) =
wenzelm@52566
   546
  Inttab.update_new upd tab
wenzelm@52566
   547
    handle Inttab.DUP dup => err_dup "exec state assignment" dup;
wenzelm@52566
   548
wenzelm@52566
   549
fun assign_update_result (tab: assign_update) =
wenzelm@52566
   550
  Inttab.fold (fn (command_id, exec) => cons (command_id, Command.exec_ids exec)) tab [];
wenzelm@52566
   551
wenzelm@52566
   552
wenzelm@52566
   553
(* update *)
wenzelm@52566
   554
wenzelm@38418
   555
local
wenzelm@38418
   556
wenzelm@48927
   557
fun init_theory deps node span =
wenzelm@47335
   558
  let
wenzelm@54526
   559
    val master_dir = master_directory node;
wenzelm@54526
   560
    val header = read_header node span;
wenzelm@48927
   561
    val imports = #imports header;
wenzelm@59716
   562
wenzelm@59716
   563
    fun maybe_end_theory pos st =
wenzelm@59716
   564
      SOME (Toplevel.end_theory pos st)
wenzelm@59716
   565
        handle ERROR msg => (Output.error_message msg; NONE);
wenzelm@59716
   566
    val parents_reports =
wenzelm@59716
   567
      imports |> map_filter (fn (import, pos) =>
wenzelm@65445
   568
        (case Thy_Info.lookup_theory import of
wenzelm@59716
   569
          NONE =>
wenzelm@59716
   570
            maybe_end_theory pos
wenzelm@52536
   571
              (case get_result (snd (the (AList.lookup (op =) deps import))) of
wenzelm@52536
   572
                NONE => Toplevel.toplevel
wenzelm@59716
   573
              | SOME eval => Command.eval_result_state eval)
wenzelm@59716
   574
        | some => some)
wenzelm@59716
   575
        |> Option.map (fn thy => (thy, (pos, Theory.get_markup thy))));
wenzelm@59716
   576
wenzelm@59716
   577
    val parents =
wenzelm@67380
   578
      if null parents_reports then [Theory.get_pure ()] else map #1 parents_reports;
wenzelm@59716
   579
    val _ = Position.reports (map #2 parents_reports);
wenzelm@56208
   580
  in Resources.begin_theory master_dir header parents end;
wenzelm@47335
   581
wenzelm@67215
   582
fun check_root_theory node =
wenzelm@67215
   583
  let
wenzelm@67215
   584
    val master_dir = master_directory node;
wenzelm@67215
   585
    val header = #header (get_header node);
wenzelm@67215
   586
    val header_name = #1 (#name header);
wenzelm@67215
   587
    val parent =
wenzelm@67215
   588
      if header_name = Sessions.root_name then
wenzelm@67215
   589
        SOME (Thy_Info.get_theory Sessions.theory_name)
wenzelm@67215
   590
      else if member (op =) Thy_Header.ml_roots header_name then
wenzelm@67215
   591
        SOME (Thy_Info.get_theory Thy_Header.ml_bootstrapN)
wenzelm@67215
   592
      else NONE;
wenzelm@67215
   593
  in parent |> Option.map (fn thy => Resources.begin_theory master_dir header [thy]) end;
wenzelm@62895
   594
wenzelm@47407
   595
fun check_theory full name node =
wenzelm@65445
   596
  is_some (Thy_Info.lookup_theory name) orelse
wenzelm@59715
   597
  null (#errors (get_header node)) andalso (not full orelse is_some (get_result node));
wenzelm@47335
   598
wenzelm@58923
   599
fun last_common keywords state node_required node0 node =
wenzelm@44482
   600
  let
wenzelm@44645
   601
    fun update_flags prev (visible, initial) =
wenzelm@44645
   602
      let
wenzelm@52569
   603
        val visible' = visible andalso prev <> visible_last node;
wenzelm@44645
   604
        val initial' = initial andalso
wenzelm@44645
   605
          (case prev of
wenzelm@44645
   606
            NONE => true
wenzelm@59735
   607
          | SOME command_id => the_command_name state command_id <> Thy_Header.theoryN);
wenzelm@44645
   608
      in (visible', initial') end;
wenzelm@52569
   609
wenzelm@52784
   610
    fun get_common ((prev, command_id), opt_exec) (_, ok, flags, assign_update) =
wenzelm@52784
   611
      if ok then
wenzelm@47630
   612
        let
wenzelm@52784
   613
          val flags' as (visible', _) = update_flags prev flags;
wenzelm@52784
   614
          val ok' =
wenzelm@52586
   615
            (case (lookup_entry node0 command_id, opt_exec) of
wenzelm@52784
   616
              (SOME (eval0, _), SOME (eval, _)) =>
wenzelm@52784
   617
                Command.eval_eq (eval0, eval) andalso
wenzelm@52784
   618
                  (visible' orelse node_required orelse Command.eval_running eval)
wenzelm@52586
   619
            | _ => false);
wenzelm@52784
   620
          val assign_update' = assign_update |> ok' ?
wenzelm@52569
   621
            (case opt_exec of
wenzelm@52569
   622
              SOME (eval, prints) =>
wenzelm@52569
   623
                let
wenzelm@52569
   624
                  val command_visible = visible_command node command_id;
wenzelm@52850
   625
                  val command_overlays = overlays node command_id;
wenzelm@52569
   626
                  val command_name = the_command_name state command_id;
wenzelm@52569
   627
                in
wenzelm@58923
   628
                  (case
wenzelm@58923
   629
                    Command.print command_visible command_overlays keywords command_name eval prints
wenzelm@58923
   630
                   of
wenzelm@52569
   631
                    SOME prints' => assign_update_new (command_id, SOME (eval, prints'))
wenzelm@52569
   632
                  | NONE => I)
wenzelm@52569
   633
                end
wenzelm@52569
   634
            | NONE => I);
wenzelm@52784
   635
        in SOME (prev, ok', flags', assign_update') end
wenzelm@47630
   636
      else NONE;
wenzelm@52784
   637
    val (common, ok, flags, assign_update') =
wenzelm@52569
   638
      iterate_entries get_common node (NONE, true, (true, true), assign_update_empty);
wenzelm@52569
   639
    val (common', flags') =
wenzelm@52784
   640
      if ok then
wenzelm@52569
   641
        let val last = Entries.get_after (get_entries node) common
wenzelm@52569
   642
        in (last, update_flags last flags) end
wenzelm@52569
   643
      else (common, flags);
wenzelm@52569
   644
  in (assign_update', common', flags') end;
wenzelm@44645
   645
wenzelm@62895
   646
fun illegal_init _ = error "Illegal theory header";
wenzelm@52534
   647
wenzelm@58923
   648
fun new_exec keywords state node proper_init command_id' (assign_update, command_exec, init) =
wenzelm@47407
   649
  if not proper_init andalso is_none init then NONE
wenzelm@44645
   650
  else
wenzelm@44645
   651
    let
wenzelm@52850
   652
      val command_visible = visible_command node command_id';
wenzelm@52850
   653
      val command_overlays = overlays node command_id';
wenzelm@59689
   654
      val (command_name, blob_digests, blobs_index, span0) = the_command state command_id';
wenzelm@56447
   655
      val blobs = map (resolve_blob state) blob_digests;
wenzelm@54519
   656
      val span = Lazy.force span0;
wenzelm@52566
   657
wenzelm@54519
   658
      val eval' =
wenzelm@66367
   659
        Command.eval keywords (master_directory node) (fn () => the_default illegal_init init span)
wenzelm@66367
   660
          (blobs, blobs_index) span (#1 (#2 command_exec));
wenzelm@58923
   661
      val prints' =
wenzelm@58923
   662
        perhaps (Command.print command_visible command_overlays keywords command_name eval') [];
wenzelm@52566
   663
      val exec' = (eval', prints');
wenzelm@44482
   664
wenzelm@52566
   665
      val assign_update' = assign_update_new (command_id', SOME exec') assign_update;
wenzelm@59735
   666
      val init' = if command_name = Thy_Header.theoryN then NONE else init;
wenzelm@66367
   667
    in SOME (assign_update', (command_id', exec'), init') end;
wenzelm@52602
   668
wenzelm@52655
   669
fun removed_execs node0 (command_id, exec_ids) =
wenzelm@52655
   670
  subtract (op =) exec_ids (Command.exec_ids (lookup_entry node0 command_id));
wenzelm@52602
   671
wenzelm@38418
   672
in
wenzelm@38418
   673
wenzelm@59056
   674
fun update old_version_id new_version_id edits state = Runtime.exn_trace_system (fn () =>
wenzelm@38418
   675
  let
wenzelm@52536
   676
    val old_version = the_version state old_version_id;
wenzelm@59086
   677
    val new_version =
wenzelm@59086
   678
      timeit "Document.edit_nodes"
wenzelm@59086
   679
        (fn () => old_version |> fold edit_nodes edits |> edit_keywords edits);
wenzelm@38418
   680
wenzelm@44544
   681
    val nodes = nodes_of new_version;
wenzelm@52776
   682
    val required = make_required nodes;
wenzelm@52776
   683
    val required0 = make_required (nodes_of old_version);
wenzelm@52772
   684
    val edited = fold (fn (name, _) => Symtab.update (name, ())) edits Symtab.empty;
wenzelm@44544
   685
wenzelm@47628
   686
    val updated = timeit "Document.update" (fn () =>
wenzelm@50862
   687
      nodes |> String_Graph.schedule
wenzelm@44199
   688
        (fn deps => fn (name, node) =>
wenzelm@47406
   689
          (singleton o Future.forks)
wenzelm@47406
   690
            {name = "Document.update", group = NONE,
wenzelm@52716
   691
              deps = map (Future.task_of o #2) deps, pri = 1, interrupts = false}
wenzelm@59056
   692
            (fn () =>
wenzelm@59056
   693
              timeit ("Document.update " ^ name) (fn () =>
wenzelm@59056
   694
                Runtime.exn_trace_system (fn () =>
wenzelm@44482
   695
                  let
wenzelm@67215
   696
                    val root_theory = check_root_theory node;
wenzelm@59086
   697
                    val keywords = the_default (Session.get_keywords ()) (get_keywords node);
wenzelm@59056
   698
                    val imports = map (apsnd Future.join) deps;
wenzelm@59056
   699
                    val imports_result_changed = exists (#4 o #1 o #2) imports;
wenzelm@59056
   700
                    val node_required = Symtab.defined required name;
wenzelm@59056
   701
                  in
wenzelm@59056
   702
                    if Symtab.defined edited name orelse visible_node node orelse
wenzelm@59056
   703
                      imports_result_changed orelse Symtab.defined required0 name <> node_required
wenzelm@59056
   704
                    then
wenzelm@59056
   705
                      let
wenzelm@59056
   706
                        val node0 = node_of old_version name;
wenzelm@59056
   707
                        val init = init_theory imports node;
wenzelm@59056
   708
                        val proper_init =
wenzelm@67215
   709
                          is_some root_theory orelse
wenzelm@62895
   710
                            check_theory false name node andalso
wenzelm@62895
   711
                            forall (fn (name, (_, node)) => check_theory true name node) imports;
wenzelm@47406
   712
wenzelm@59056
   713
                        val (print_execs, common, (still_visible, initial)) =
wenzelm@59056
   714
                          if imports_result_changed then (assign_update_empty, NONE, (true, true))
wenzelm@59056
   715
                          else last_common keywords state node_required node0 node;
wenzelm@62895
   716
wenzelm@62895
   717
                        val common_command_exec =
wenzelm@62895
   718
                          (case common of
wenzelm@62895
   719
                            SOME id => (id, the_default Command.no_exec (the_entry node id))
wenzelm@67215
   720
                          | NONE => (Document_ID.none, Command.init_exec root_theory));
wenzelm@44479
   721
wenzelm@66367
   722
                        val (updated_execs, (command_id', exec'), _) =
wenzelm@59056
   723
                          (print_execs, common_command_exec, if initial then SOME init else NONE)
wenzelm@59056
   724
                          |> (still_visible orelse node_required) ?
wenzelm@59056
   725
                            iterate_entries_after common
wenzelm@59056
   726
                              (fn ((prev, id), _) => fn res =>
wenzelm@59056
   727
                                if not node_required andalso prev = visible_last node then NONE
wenzelm@59056
   728
                                else new_exec keywords state node proper_init id res) node;
wenzelm@44479
   729
wenzelm@59056
   730
                        val assigned_execs =
wenzelm@59056
   731
                          (node0, updated_execs) |-> iterate_entries_after common
wenzelm@59056
   732
                            (fn ((_, command_id0), exec0) => fn res =>
wenzelm@59056
   733
                              if is_none exec0 then NONE
wenzelm@59056
   734
                              else if assign_update_defined updated_execs command_id0 then SOME res
wenzelm@59056
   735
                              else SOME (assign_update_new (command_id0, NONE) res));
wenzelm@44480
   736
wenzelm@59056
   737
                        val last_exec =
wenzelm@59056
   738
                          if command_id' = Document_ID.none then NONE else SOME command_id';
wenzelm@59056
   739
                        val result =
wenzelm@59056
   740
                          if is_none last_exec orelse is_some (after_entry node last_exec) then NONE
wenzelm@66367
   741
                          else SOME (#1 exec');
wenzelm@44480
   742
wenzelm@59056
   743
                        val assign_update = assign_update_result assigned_execs;
wenzelm@59056
   744
                        val removed = maps (removed_execs node0) assign_update;
wenzelm@59056
   745
                        val _ = List.app Execution.cancel removed;
wenzelm@52602
   746
wenzelm@66379
   747
                        val result_changed =
wenzelm@66379
   748
                          not (eq_option Command.eval_eq (get_result node0, result));
wenzelm@59056
   749
                        val node' = node
wenzelm@59056
   750
                          |> assign_update_apply assigned_execs
wenzelm@66379
   751
                          |> set_result result
wenzelm@66379
   752
                          |> result_changed ? reset_consolidated;
wenzelm@59056
   753
                        val assigned_node = SOME (name, node');
wenzelm@59056
   754
                      in ((removed, assign_update, assigned_node, result_changed), node') end
wenzelm@59056
   755
                    else (([], [], NONE, false), node)
wenzelm@59056
   756
                  end))))
wenzelm@47628
   757
      |> Future.joins |> map #1);
wenzelm@44476
   758
wenzelm@52655
   759
    val removed = maps #1 updated;
wenzelm@52655
   760
    val assign_update = maps #2 updated;
wenzelm@52602
   761
    val assigned_nodes = map_filter #3 updated;
wenzelm@52602
   762
wenzelm@44197
   763
    val state' = state
wenzelm@52602
   764
      |> define_version new_version_id (fold put_node assigned_nodes new_version);
wenzelm@52602
   765
wenzelm@59056
   766
  in (removed, assign_update, state') end);
wenzelm@38418
   767
wenzelm@38418
   768
end;
wenzelm@38418
   769
wenzelm@38418
   770
wenzelm@43713
   771
wenzelm@43713
   772
(** global state **)
wenzelm@43713
   773
wenzelm@52508
   774
val global_state = Synchronized.var "Document.global_state" init_state;
wenzelm@43713
   775
wenzelm@43713
   776
fun state () = Synchronized.value global_state;
wenzelm@43713
   777
val change_state = Synchronized.change global_state;
wenzelm@43713
   778
wenzelm@38418
   779
end;