wenzelm@38150: (*  Title:      Pure/PIDE/document.ML
wenzelm@38150:     Author:     Makarius
wenzelm@38150: 
wenzelm@38150: Document as collection of named nodes, each consisting of an editable
wenzelm@44478: list of commands, with asynchronous read/eval/print processes.
wenzelm@38150: *)
wenzelm@38150: 
wenzelm@38150: signature DOCUMENT =
wenzelm@38150: sig
wenzelm@38363:   type id = int
wenzelm@38373:   type version_id = id
wenzelm@38363:   type command_id = id
wenzelm@38373:   type exec_id = id
wenzelm@38363:   val no_id: id
wenzelm@38419:   val new_id: unit -> id
wenzelm@38363:   val parse_id: string -> id
wenzelm@38363:   val print_id: id -> string
wenzelm@44185:   type node_header = (string * string list * (string * bool) list) Exn.result
wenzelm@44157:   datatype node_edit =
wenzelm@44185:     Clear |
wenzelm@44157:     Edits of (command_id option * command_id option) list |
wenzelm@44384:     Header of node_header |
wenzelm@44385:     Perspective of command_id list
wenzelm@44156:   type edit = string * node_edit
wenzelm@38418:   type state
wenzelm@38418:   val init_state: state
wenzelm@44441:   val define_command: command_id -> string -> state -> state
wenzelm@44610:   val join_commands: state -> state
wenzelm@44301:   val cancel_execution: state -> Future.task list
wenzelm@44436:   val update_perspective: version_id -> version_id -> string -> command_id list -> state -> state
wenzelm@44481:   val update: version_id -> version_id -> edit list -> state ->
wenzelm@44479:     ((command_id * exec_id option) list * (string * command_id option) list) * state
wenzelm@38418:   val execute: version_id -> state -> state
wenzelm@43713:   val state: unit -> state
wenzelm@43713:   val change_state: (state -> state) -> unit
wenzelm@38150: end;
wenzelm@38150: 
wenzelm@38150: structure Document: DOCUMENT =
wenzelm@38150: struct
wenzelm@38150: 
wenzelm@38150: (* unique identifiers *)
wenzelm@38150: 
wenzelm@38363: type id = int;
wenzelm@38373: type version_id = id;
wenzelm@38363: type command_id = id;
wenzelm@38373: type exec_id = id;
wenzelm@38355: 
wenzelm@38355: val no_id = 0;
wenzelm@40449: val new_id = Synchronized.counter ();
wenzelm@38418: 
wenzelm@38414: val parse_id = Markup.parse_int;
wenzelm@38414: val print_id = Markup.print_int;
wenzelm@38150: 
wenzelm@38418: fun err_dup kind id = error ("Duplicate " ^ kind ^ ": " ^ print_id id);
wenzelm@38418: fun err_undef kind id = error ("Undefined " ^ kind ^ ": " ^ print_id id);
wenzelm@38150: 
wenzelm@38418: 
wenzelm@38418: 
wenzelm@38418: (** document structure **)
wenzelm@38418: 
wenzelm@44185: type node_header = (string * string list * (string * bool) list) Exn.result;
wenzelm@44476: type perspective = (command_id -> bool) * command_id option; (*visible commands, last*)
wenzelm@38448: structure Entries = Linear_Set(type key = command_id val ord = int_ord);
wenzelm@38448: 
wenzelm@43668: abstype node = Node of
wenzelm@44444:  {touched: bool,
wenzelm@44444:   header: node_header,
wenzelm@44386:   perspective: perspective,
wenzelm@44180:   entries: exec_id option Entries.T,  (*command entries with excecutions*)
wenzelm@44476:   last_exec: command_id option,  (*last command with exec state assignment*)
wenzelm@44197:   result: Toplevel.state lazy}
wenzelm@43668: and version = Version of node Graph.T  (*development graph wrt. static imports*)
wenzelm@38418: with
wenzelm@38418: 
wenzelm@44476: fun make_node (touched, header, perspective, entries, last_exec, result) =
wenzelm@44444:   Node {touched = touched, header = header, perspective = perspective,
wenzelm@44476:     entries = entries, last_exec = last_exec, result = result};
wenzelm@43668: 
wenzelm@44476: fun map_node f (Node {touched, header, perspective, entries, last_exec, result}) =
wenzelm@44476:   make_node (f (touched, header, perspective, entries, last_exec, result));
wenzelm@38418: 
wenzelm@44476: fun make_perspective command_ids : perspective =
wenzelm@44476:   (Inttab.defined (Inttab.make (map (rpair ()) command_ids)), try List.last command_ids);
wenzelm@44441: 
wenzelm@44476: val no_header = Exn.Exn (ERROR "Bad theory header");
wenzelm@44441: val no_perspective = make_perspective [];
wenzelm@44386: val no_print = Lazy.value ();
wenzelm@44386: val no_result = Lazy.value Toplevel.toplevel;
wenzelm@44386: 
wenzelm@44476: val empty_node = make_node (false, no_header, no_perspective, Entries.empty, NONE, no_result);
wenzelm@44476: val clear_node = map_node (fn (_, header, _, _, _, _) =>
wenzelm@44476:   (false, header, no_perspective, Entries.empty, NONE, no_result));
wenzelm@44386: 
wenzelm@44386: 
wenzelm@44386: (* basic components *)
wenzelm@44386: 
wenzelm@44446: fun is_touched (Node {touched, ...}) = touched;
wenzelm@44444: fun set_touched touched =
wenzelm@44476:   map_node (fn (_, header, perspective, entries, last_exec, result) =>
wenzelm@44476:     (touched, header, perspective, entries, last_exec, result));
wenzelm@44444: 
wenzelm@44180: fun get_header (Node {header, ...}) = header;
wenzelm@44385: fun set_header header =
wenzelm@44476:   map_node (fn (touched, _, perspective, entries, last_exec, result) =>
wenzelm@44476:     (touched, header, perspective, entries, last_exec, result));
wenzelm@44180: 
wenzelm@44385: fun get_perspective (Node {perspective, ...}) = perspective;
wenzelm@44441: fun set_perspective ids =
wenzelm@44476:   map_node (fn (touched, header, _, entries, last_exec, result) =>
wenzelm@44476:     (touched, header, make_perspective ids, entries, last_exec, result));
wenzelm@44385: 
wenzelm@44444: fun map_entries f =
wenzelm@44476:   map_node (fn (touched, header, perspective, entries, last_exec, result) =>
wenzelm@44476:     (touched, header, perspective, f entries, last_exec, result));
wenzelm@44643: fun get_entries (Node {entries, ...}) = entries;
wenzelm@44643: fun iterate_entries start f = Entries.iterate start f o get_entries;
wenzelm@43668: 
wenzelm@44476: fun get_last_exec (Node {last_exec, ...}) = last_exec;
wenzelm@44476: fun set_last_exec last_exec =
wenzelm@44476:   map_node (fn (touched, header, perspective, entries, _, result) =>
wenzelm@44476:     (touched, header, perspective, entries, last_exec, result));
wenzelm@44476: 
wenzelm@44386: fun get_theory pos (Node {result, ...}) = Toplevel.end_theory pos (Lazy.force result);
wenzelm@44385: fun set_result result =
wenzelm@44476:   map_node (fn (touched, header, perspective, entries, last_exec, _) =>
wenzelm@44476:     (touched, header, perspective, entries, last_exec, result));
wenzelm@44180: 
wenzelm@44185: fun get_node nodes name = Graph.get_node nodes name handle Graph.UNDEF _ => empty_node;
wenzelm@44202: fun default_node name = Graph.default_node (name, empty_node);
wenzelm@44202: fun update_node name f = default_node name #> Graph.map_node name f;
wenzelm@38418: 
wenzelm@38418: 
wenzelm@38448: (* node edits and associated executions *)
wenzelm@38150: 
wenzelm@44157: datatype node_edit =
wenzelm@44185:   Clear |
wenzelm@44157:   Edits of (command_id option * command_id option) list |
wenzelm@44384:   Header of node_header |
wenzelm@44385:   Perspective of command_id list;
wenzelm@44157: 
wenzelm@44156: type edit = string * node_edit;
wenzelm@38448: 
wenzelm@44482: fun after_entry (Node {entries, ...}) = Entries.get_after entries;
wenzelm@44479: 
wenzelm@44480: fun lookup_entry (Node {entries, ...}) id =
wenzelm@44480:   (case Entries.lookup entries id of
wenzelm@44480:     NONE => NONE
wenzelm@44480:   | SOME (exec, _) => exec);
wenzelm@44480: 
wenzelm@43668: fun the_entry (Node {entries, ...}) id =
wenzelm@38448:   (case Entries.lookup entries id of
wenzelm@38448:     NONE => err_undef "command entry" id
wenzelm@44476:   | SOME (exec, _) => exec);
wenzelm@38150: 
wenzelm@44479: fun the_default_entry node (SOME id) = the_default no_id (the_entry node id)
wenzelm@44479:   | the_default_entry _ NONE = no_id;
wenzelm@44476: 
wenzelm@44482: fun update_entry id exec =
wenzelm@44482:   map_entries (Entries.update (id, exec));
wenzelm@44482: 
wenzelm@44482: fun reset_entry id node =
wenzelm@44482:   if is_some (lookup_entry node id) then update_entry id NONE node else node;
wenzelm@38418: 
wenzelm@38448: fun reset_after id entries =
wenzelm@38448:   (case Entries.get_after entries id of
wenzelm@38448:     NONE => entries
wenzelm@38448:   | SOME next => Entries.update (next, NONE) entries);
wenzelm@38448: 
wenzelm@43668: val edit_node = map_entries o fold
wenzelm@43668:   (fn (id, SOME id2) => Entries.insert_after id (id2, NONE)
wenzelm@43668:     | (id, NONE) => Entries.delete_after id #> reset_after id);
wenzelm@38418: 
wenzelm@38418: 
wenzelm@38418: (* version operations *)
wenzelm@38418: 
wenzelm@44185: val empty_version = Version Graph.empty;
wenzelm@44185: 
wenzelm@38418: fun nodes_of (Version nodes) = nodes;
wenzelm@44185: val node_of = get_node o nodes_of;
wenzelm@38418: 
wenzelm@44444: local
wenzelm@44444: 
wenzelm@44185: fun cycle_msg names = "Cyclic dependency of " ^ space_implode " via " (map quote names);
wenzelm@44180: 
wenzelm@44444: fun touch_node name nodes =
wenzelm@44444:   fold (fn desc =>
wenzelm@44643:       update_node desc
wenzelm@44643:         (set_touched true #>
wenzelm@44643:           desc <> name ? (map_entries (reset_after NONE) #> set_result no_result)))
wenzelm@44202:     (Graph.all_succs nodes [name]) nodes;
wenzelm@44202: 
wenzelm@44444: in
wenzelm@44444: 
wenzelm@44157: fun edit_nodes (name, node_edit) (Version nodes) =
wenzelm@44157:   Version
wenzelm@44436:     (case node_edit of
wenzelm@44436:       Clear =>
wenzelm@44436:         nodes
wenzelm@44436:         |> update_node name clear_node
wenzelm@44444:         |> touch_node name
wenzelm@44436:     | Edits edits =>
wenzelm@44436:         nodes
wenzelm@44436:         |> update_node name (edit_node edits)
wenzelm@44444:         |> touch_node name
wenzelm@44436:     | Header header =>
wenzelm@44436:         let
wenzelm@44436:           val parents = (case header of Exn.Res (_, parents, _) => parents | _ => []);
wenzelm@44436:           val nodes1 = nodes
wenzelm@44436:             |> default_node name
wenzelm@44436:             |> fold default_node parents;
wenzelm@44436:           val nodes2 = nodes1
wenzelm@44436:             |> Graph.Keys.fold
wenzelm@44436:                 (fn dep => Graph.del_edge (dep, name)) (Graph.imm_preds nodes1 name);
wenzelm@44436:           val (header', nodes3) =
wenzelm@44436:             (header, Graph.add_deps_acyclic (name, parents) nodes2)
wenzelm@44436:               handle Graph.CYCLES cs => (Exn.Exn (ERROR (cat_lines (map cycle_msg cs))), nodes2);
wenzelm@44436:         in Graph.map_node name (set_header header') nodes3 end
wenzelm@44444:         |> touch_node name
wenzelm@44436:     | Perspective perspective =>
wenzelm@44544:         update_node name (set_perspective perspective) nodes);
wenzelm@38418: 
wenzelm@44444: end;
wenzelm@44444: 
wenzelm@44222: fun put_node (name, node) (Version nodes) =
wenzelm@44222:   Version (update_node name (K node) nodes);
wenzelm@38418: 
wenzelm@38150: end;
wenzelm@38150: 
wenzelm@38418: 
wenzelm@38418: 
wenzelm@38418: (** global state -- document structure and execution process **)
wenzelm@38418: 
wenzelm@38418: abstype state = State of
wenzelm@40398:  {versions: version Inttab.table,  (*version_id -> document content*)
wenzelm@44610:   commands:
wenzelm@44610:     Toplevel.transition future Inttab.table *  (*command_id -> transition (future parsing)*)
wenzelm@44610:     Toplevel.transition future list,  (*recent commands to be joined*)
wenzelm@44386:   execs: (command_id * (Toplevel.state * unit lazy) lazy) Inttab.table,
wenzelm@44386:     (*exec_id -> command_id with eval/print process*)
wenzelm@44300:   execution: Future.group}  (*global execution process*)
wenzelm@38418: with
wenzelm@38418: 
wenzelm@38418: fun make_state (versions, commands, execs, execution) =
wenzelm@38418:   State {versions = versions, commands = commands, execs = execs, execution = execution};
wenzelm@38418: 
wenzelm@38418: fun map_state f (State {versions, commands, execs, execution}) =
wenzelm@38418:   make_state (f (versions, commands, execs, execution));
wenzelm@38418: 
wenzelm@38418: val init_state =
wenzelm@38418:   make_state (Inttab.make [(no_id, empty_version)],
wenzelm@44610:     (Inttab.make [(no_id, Future.value Toplevel.empty)], []),
wenzelm@44386:     Inttab.make [(no_id, (no_id, Lazy.value (Toplevel.toplevel, no_print)))],
wenzelm@44300:     Future.new_group NONE);
wenzelm@38418: 
wenzelm@38418: 
wenzelm@38418: (* document versions *)
wenzelm@38418: 
wenzelm@38418: fun define_version (id: version_id) version =
wenzelm@38418:   map_state (fn (versions, commands, execs, execution) =>
wenzelm@38418:     let val versions' = Inttab.update_new (id, version) versions
wenzelm@38418:       handle Inttab.DUP dup => err_dup "document version" dup
wenzelm@38418:     in (versions', commands, execs, execution) end);
wenzelm@38418: 
wenzelm@38418: fun the_version (State {versions, ...}) (id: version_id) =
wenzelm@38418:   (case Inttab.lookup versions id of
wenzelm@38418:     NONE => err_undef "document version" id
wenzelm@38418:   | SOME version => version);
wenzelm@38418: 
wenzelm@38418: 
wenzelm@38418: (* commands *)
wenzelm@38418: 
wenzelm@38418: fun define_command (id: command_id) text =
wenzelm@44610:   map_state (fn (versions, (commands, recent), execs, execution) =>
wenzelm@38418:     let
wenzelm@38418:       val id_string = print_id id;
wenzelm@44302:       val tr =
wenzelm@44302:         Future.fork_pri 2 (fn () =>
wenzelm@44302:           Position.setmp_thread_data (Position.id_only id_string)
wenzelm@44478:             (fn () => Outer_Syntax.read_command (Position.id id_string) text) ());
wenzelm@38418:       val commands' =
wenzelm@38421:         Inttab.update_new (id, tr) commands
wenzelm@38418:           handle Inttab.DUP dup => err_dup "command" dup;
wenzelm@44610:     in (versions, (commands', tr :: recent), execs, execution) end);
wenzelm@38418: 
wenzelm@38418: fun the_command (State {commands, ...}) (id: command_id) =
wenzelm@44610:   (case Inttab.lookup (#1 commands) id of
wenzelm@38418:     NONE => err_undef "command" id
wenzelm@38418:   | SOME tr => tr);
wenzelm@38418: 
wenzelm@44610: val join_commands =
wenzelm@44610:     map_state (fn (versions, (commands, recent), execs, execution) =>
wenzelm@44610:       (Future.join_results recent; (versions, (commands, []), execs, execution)));
wenzelm@38421: 
wenzelm@38418: 
wenzelm@38418: (* command executions *)
wenzelm@38418: 
wenzelm@44197: fun define_exec (exec_id, exec) =
wenzelm@38418:   map_state (fn (versions, commands, execs, execution) =>
wenzelm@44197:     let val execs' = Inttab.update_new (exec_id, exec) execs
wenzelm@38418:       handle Inttab.DUP dup => err_dup "command execution" dup
wenzelm@38418:     in (versions, commands, execs', execution) end);
wenzelm@38418: 
wenzelm@44197: fun the_exec (State {execs, ...}) exec_id =
wenzelm@44197:   (case Inttab.lookup execs exec_id of
wenzelm@44197:     NONE => err_undef "command execution" exec_id
wenzelm@38418:   | SOME exec => exec);
wenzelm@38418: 
wenzelm@41634: 
wenzelm@41634: (* document execution *)
wenzelm@41634: 
wenzelm@44299: fun cancel_execution (State {execution, ...}) = Future.cancel_group execution;
wenzelm@41634: 
wenzelm@38418: end;
wenzelm@38418: 
wenzelm@38418: 
wenzelm@38418: 
wenzelm@38888: (* toplevel transactions *)
wenzelm@38888: 
wenzelm@38888: local
wenzelm@38888: 
wenzelm@44440: fun timing tr t =
wenzelm@44440:   if Timing.is_relevant t then Toplevel.status tr (Markup.timing t) else ();
wenzelm@40391: 
wenzelm@38888: fun proof_status tr st =
wenzelm@38888:   (case try Toplevel.proof_of st of
wenzelm@38888:     SOME prf => Toplevel.status tr (Proof.status_markup prf)
wenzelm@38888:   | NONE => ());
wenzelm@38888: 
wenzelm@44386: fun print_state tr st =
wenzelm@44386:   (Lazy.lazy o Toplevel.setmp_thread_position tr)
wenzelm@44386:     (fn () => Toplevel.print_state false st);
wenzelm@38888: 
wenzelm@40390: fun run int tr st =
wenzelm@40390:   (case Toplevel.transition int tr st of
wenzelm@40390:     SOME (st', NONE) => ([], SOME st')
wenzelm@44614:   | SOME (_, SOME (exn, _)) => (ML_Compiler.exn_messages exn, NONE)
wenzelm@44270:   | NONE => ([(serial (), ML_Compiler.exn_message Runtime.TERMINATE)], NONE));
wenzelm@40390: 
wenzelm@38888: in
wenzelm@38888: 
wenzelm@44199: fun run_command tr st =
wenzelm@44185:   let
wenzelm@44199:     val is_init = Toplevel.is_init tr;
wenzelm@44185:     val is_proof = Keyword.is_proof (Toplevel.name_of tr);
wenzelm@44185:     val do_print = not is_init andalso (Toplevel.print_of tr orelse is_proof);
wenzelm@44185: 
wenzelm@44614:     val _ = Multithreading.interrupted ();
wenzelm@44611:     val _ = Toplevel.status tr Markup.forked;
wenzelm@44185:     val start = Timing.start ();
wenzelm@44185:     val (errs, result) =
wenzelm@44185:       if Toplevel.is_toplevel st andalso not is_init then ([], SOME st)
wenzelm@44185:       else run (is_init orelse is_proof) (Toplevel.set_print false tr) st;
wenzelm@44185:     val _ = timing tr (Timing.result start);
wenzelm@44611:     val _ = Toplevel.status tr Markup.joined;
wenzelm@44185:     val _ = List.app (Toplevel.error_msg tr) errs;
wenzelm@44185:   in
wenzelm@44185:     (case result of
wenzelm@44614:       NONE =>
wenzelm@44614:        (if null errs then Exn.interrupt () else ();
wenzelm@44614:         Toplevel.status tr Markup.failed;
wenzelm@44614:         (st, no_print))
wenzelm@44185:     | SOME st' =>
wenzelm@44185:        (Toplevel.status tr Markup.finished;
wenzelm@44185:         proof_status tr st';
wenzelm@44386:         (st', if do_print then print_state tr st' else no_print)))
wenzelm@44185:   end;
wenzelm@38888: 
wenzelm@38888: end;
wenzelm@38888: 
wenzelm@38888: 
wenzelm@38888: 
wenzelm@38888: 
wenzelm@44481: (** update **)
wenzelm@38418: 
wenzelm@44436: (* perspective *)
wenzelm@44436: 
wenzelm@44436: fun update_perspective (old_id: version_id) (new_id: version_id) name perspective state =
wenzelm@44436:   let
wenzelm@44436:     val old_version = the_version state old_id;
wenzelm@44436:     val _ = Time.now ();  (* FIXME odd workaround for polyml-5.4.0/x86_64 -- needed? *)
wenzelm@44436:     val new_version = edit_nodes (name, Perspective perspective) old_version;
wenzelm@44436:   in define_version new_id new_version state end;
wenzelm@44436: 
wenzelm@44436: 
wenzelm@44481: (* edits *)
wenzelm@38418: 
wenzelm@38418: local
wenzelm@38418: 
wenzelm@44482: fun last_common last_visible node0 node =
wenzelm@44482:   let
wenzelm@44544:     fun get_common ((prev, id), exec) (found, (_, visible)) =
wenzelm@44482:       if found then NONE
wenzelm@44482:       else
wenzelm@44482:         let val found' = is_none exec orelse exec <> lookup_entry node0 id
wenzelm@44482:         in SOME (found', (prev, visible andalso prev <> last_visible)) end;
wenzelm@44643:     val (found, (common, visible)) = iterate_entries NONE get_common node (false, (NONE, true));
wenzelm@44643:     val common' = if found then common else Entries.get_after (get_entries node) common;
wenzelm@44643:     val visible' = visible andalso common' <> last_visible;
wenzelm@44643:   in (common', visible') end;
wenzelm@44482: 
wenzelm@44482: fun new_exec state init command_id' (execs, exec) =
wenzelm@44482:   let
wenzelm@44482:     val command' = the_command state command_id';
wenzelm@44482:     val exec_id' = new_id ();
wenzelm@44482:     val exec' =
wenzelm@44482:       snd exec |> Lazy.map (fn (st, _) =>
wenzelm@44482:         let val tr =
wenzelm@44482:           Future.join command'
wenzelm@44482:           |> Toplevel.modify_init init
wenzelm@44482:           |> Toplevel.put_id (print_id exec_id');
wenzelm@44482:         in run_command tr st end)
wenzelm@44482:       |> pair command_id';
wenzelm@44482:   in ((exec_id', exec') :: execs, exec') end;
wenzelm@44482: 
wenzelm@44544: fun make_required nodes =
wenzelm@44544:   let
wenzelm@44544:     val all_visible =
wenzelm@44544:       Graph.fold (fn (a, (node, _)) => is_some (#2 (get_perspective node)) ? cons a) nodes []
wenzelm@44544:       |> Graph.all_preds nodes;
wenzelm@44544:     val required =
wenzelm@44544:       fold (fn a => exists (fn b => Graph.is_edge nodes (a, b)) all_visible ? Symtab.update (a, ()))
wenzelm@44544:         all_visible Symtab.empty;
wenzelm@44544:   in Symtab.defined required end;
wenzelm@44544: 
wenzelm@44441: fun init_theory deps name node =
wenzelm@44435:   let
wenzelm@44435:     val (thy_name, imports, uses) = Exn.release (get_header node);
wenzelm@44435:     (* FIXME provide files via Scala layer *)
wenzelm@44435:     val (dir, files) =
wenzelm@44435:       if ML_System.platform_is_cygwin then (Path.current, [])
wenzelm@44435:       else (Path.dir (Path.explode name), map (apfst Path.explode) uses);
wenzelm@44435: 
wenzelm@44435:     val parents =
wenzelm@44435:       imports |> map (fn import =>
wenzelm@44441:         (case Thy_Info.lookup_theory import of  (* FIXME more robust!? *)
wenzelm@44435:           SOME thy => thy
wenzelm@44435:         | NONE =>
wenzelm@44435:             get_theory (Position.file_only import)
wenzelm@44482:               (snd (Future.join (the (AList.lookup (op =) deps import))))));
wenzelm@44435:   in Thy_Load.begin_theory dir thy_name imports files parents end;
wenzelm@44435: 
wenzelm@38418: in
wenzelm@38418: 
wenzelm@44481: fun update (old_id: version_id) (new_id: version_id) edits state =
wenzelm@38418:   let
wenzelm@38418:     val old_version = the_version state old_id;
wenzelm@44180:     val _ = Time.now ();  (* FIXME odd workaround for polyml-5.4.0/x86_64 *)
wenzelm@44222:     val new_version = fold edit_nodes edits old_version;
wenzelm@38418: 
wenzelm@44544:     val nodes = nodes_of new_version;
wenzelm@44544:     val is_required = make_required nodes;
wenzelm@44544: 
wenzelm@44476:     val updated =
wenzelm@44544:       nodes |> Graph.schedule
wenzelm@44199:         (fn deps => fn (name, node) =>
wenzelm@44544:           if not (is_touched node orelse is_required name)
wenzelm@44544:           then Future.value (([], [], []), node)
wenzelm@44444:           else
wenzelm@44479:             let
wenzelm@44479:               val node0 = node_of old_version name;
wenzelm@44479:               fun init () = init_theory deps name node;
wenzelm@44479:             in
wenzelm@44482:               (singleton o Future.forks)
wenzelm@44482:                 {name = "Document.update", group = NONE,
wenzelm@44482:                   deps = map (Future.task_of o #2) deps, pri = 0, interrupts = false}
wenzelm@44482:                 (fn () =>
wenzelm@44482:                   let
wenzelm@44544:                     val required = is_required name;
wenzelm@44482:                     val last_visible = #2 (get_perspective node);
wenzelm@44482:                     val (common, visible) = last_common last_visible node0 node;
wenzelm@44482:                     val common_exec = the_exec state (the_default_entry node common);
wenzelm@44479: 
wenzelm@44482:                     val (execs, exec) = ([], common_exec) |>
wenzelm@44544:                       (visible orelse required) ?
wenzelm@44483:                         iterate_entries (after_entry node common)
wenzelm@44482:                           (fn ((prev, id), _) => fn res =>
wenzelm@44544:                             if not required andalso prev = last_visible then NONE
wenzelm@44482:                             else SOME (new_exec state init id res)) node;
wenzelm@44479: 
wenzelm@44482:                     val no_execs =
wenzelm@44483:                       iterate_entries (after_entry node0 common)
wenzelm@44482:                         (fn ((_, id0), exec0) => fn res =>
wenzelm@44482:                           if is_none exec0 then NONE
wenzelm@44482:                           else if exists (fn (_, (id, _)) => id0 = id) execs then SOME res
wenzelm@44482:                           else SOME (id0 :: res)) node0 [];
wenzelm@44480: 
wenzelm@44482:                     val last_exec = if #1 exec = no_id then NONE else SOME (#1 exec);
wenzelm@44482:                     val result =
wenzelm@44482:                       if is_some (after_entry node last_exec) then no_result
wenzelm@44482:                       else Lazy.map #1 (#2 exec);
wenzelm@44480: 
wenzelm@44482:                     val node' = node
wenzelm@44482:                       |> fold reset_entry no_execs
wenzelm@44482:                       |> fold (fn (exec_id, (id, _)) => update_entry id (SOME exec_id)) execs
wenzelm@44482:                       |> set_last_exec last_exec
wenzelm@44482:                       |> set_result result
wenzelm@44482:                       |> set_touched false;
wenzelm@44482:                   in ((no_execs, execs, [(name, node')]), node') end)
wenzelm@44479:             end)
wenzelm@44479:       |> Future.joins |> map #1;
wenzelm@44476: 
wenzelm@44479:     val command_execs =
wenzelm@44479:       map (rpair NONE) (maps #1 updated) @
wenzelm@44479:       map (fn (exec_id, (command_id, _)) => (command_id, SOME exec_id)) (maps #2 updated);
wenzelm@44479:     val updated_nodes = maps #3 updated;
wenzelm@44476:     val last_execs = map (fn (name, node) => (name, get_last_exec node)) updated_nodes;
wenzelm@38418: 
wenzelm@44197:     val state' = state
wenzelm@44479:       |> fold (fold define_exec o #2) updated
wenzelm@44476:       |> define_version new_id (fold put_node updated_nodes new_version);
wenzelm@44479:   in ((command_execs, last_execs), state') end;
wenzelm@38418: 
wenzelm@38418: end;
wenzelm@38418: 
wenzelm@38418: 
wenzelm@38418: (* execute *)
wenzelm@38418: 
wenzelm@38418: fun execute version_id state =
wenzelm@41673:   state |> map_state (fn (versions, commands, execs, _) =>
wenzelm@38418:     let
wenzelm@38418:       val version = the_version state version_id;
wenzelm@38418: 
wenzelm@44386:       fun force_exec _ NONE = ()
wenzelm@44386:         | force_exec node (SOME exec_id) =
wenzelm@44386:             let
wenzelm@44386:               val (command_id, exec) = the_exec state exec_id;
wenzelm@44386:               val (_, print) = Lazy.force exec;
wenzelm@44386:               val _ =
wenzelm@44439:                 if #1 (get_perspective node) command_id
wenzelm@44386:                 then ignore (Lazy.future Future.default_params print)
wenzelm@44386:                 else ();
wenzelm@44386:             in () end;
wenzelm@38418: 
wenzelm@44300:       val execution = Future.new_group NONE;
wenzelm@44299:       val _ =
wenzelm@44201:         nodes_of version |> Graph.schedule
wenzelm@44201:           (fn deps => fn (name, node) =>
wenzelm@44302:             (singleton o Future.forks)
wenzelm@44302:               {name = "theory:" ^ name, group = SOME (Future.new_group (SOME execution)),
wenzelm@44614:                 deps = map (Future.task_of o #2) deps, pri = 1, interrupts = false}
wenzelm@44483:               (iterate_entries NONE (fn (_, exec) => fn () => SOME (force_exec node exec)) node));
wenzelm@40520: 
wenzelm@44299:     in (versions, commands, execs, execution) end);
wenzelm@38418: 
wenzelm@43713: 
wenzelm@43713: 
wenzelm@43713: (** global state **)
wenzelm@43713: 
wenzelm@43713: val global_state = Synchronized.var "Document" init_state;
wenzelm@43713: 
wenzelm@43713: fun state () = Synchronized.value global_state;
wenzelm@43713: val change_state = Synchronized.change global_state;
wenzelm@43713: 
wenzelm@38418: end;
wenzelm@38418: