src/Pure/PIDE/document.scala
author wenzelm
Wed Feb 29 23:09:06 2012 +0100 (2012-02-29 ago)
changeset 46737 09ab89658a5d
parent 46723 54ea872b60ea
child 46739 6024353549ca
permissions -rw-r--r--
clarified module Thy_Load;
more precise graph based on Document.Node.Deps with actual Node.Name dependencies;
wenzelm@36676
     1
/*  Title:      Pure/PIDE/document.scala
wenzelm@36676
     2
    Author:     Makarius
wenzelm@36676
     3
wenzelm@38150
     4
Document as collection of named nodes, each consisting of an editable
wenzelm@38418
     5
list of commands, associated with asynchronous execution process.
wenzelm@36676
     6
*/
wenzelm@34407
     7
wenzelm@34871
     8
package isabelle
wenzelm@34318
     9
wenzelm@34760
    10
wenzelm@38150
    11
import scala.collection.mutable
wenzelm@37073
    12
wenzelm@37073
    13
wenzelm@34823
    14
object Document
wenzelm@34483
    15
{
wenzelm@38227
    16
  /* formal identifiers */
wenzelm@38150
    17
wenzelm@38363
    18
  type ID = Long
wenzelm@43780
    19
  val ID = Properties.Value.Long
wenzelm@38414
    20
wenzelm@38373
    21
  type Version_ID = ID
wenzelm@38363
    22
  type Command_ID = ID
wenzelm@38373
    23
  type Exec_ID = ID
wenzelm@38150
    24
wenzelm@43662
    25
  val no_id: ID = 0
wenzelm@45243
    26
  val new_id = Counter()
wenzelm@38355
    27
wenzelm@38150
    28
wenzelm@34818
    29
wenzelm@38424
    30
  /** document structure **/
wenzelm@38424
    31
wenzelm@46723
    32
  /* individual nodes */
wenzelm@38424
    33
wenzelm@44615
    34
  type Edit[A, B] = (Node.Name, Node.Edit[A, B])
wenzelm@44384
    35
  type Edit_Text = Edit[Text.Edit, Text.Perspective]
wenzelm@44384
    36
  type Edit_Command = Edit[(Option[Command], Option[Command]), Command.Perspective]
wenzelm@38151
    37
wenzelm@46737
    38
  type Node_Header = Exn.Result[Node.Deps]
wenzelm@44182
    39
wenzelm@38151
    40
  object Node
wenzelm@38151
    41
  {
wenzelm@46737
    42
    sealed case class Deps(imports: List[Name], uses: List[(String, Boolean)])
wenzelm@46737
    43
wenzelm@44957
    44
    object Name
wenzelm@44957
    45
    {
wenzelm@44957
    46
      val empty = Name("", "", "")
wenzelm@44959
    47
      def apply(path: Path): Name =
wenzelm@44959
    48
      {
wenzelm@44959
    49
        val node = path.implode
wenzelm@44959
    50
        val dir = path.dir.implode
wenzelm@44959
    51
        val theory = Thy_Header.thy_name(node) getOrElse error("Bad theory file name: " + path)
wenzelm@44959
    52
        Name(node, dir, theory)
wenzelm@44959
    53
      }
wenzelm@46723
    54
wenzelm@46723
    55
      object Ordering extends scala.math.Ordering[Name]
wenzelm@46723
    56
      {
wenzelm@46723
    57
        def compare(name1: Name, name2: Name): Int = name1.node compare name2.node
wenzelm@46723
    58
      }
wenzelm@44957
    59
    }
wenzelm@44616
    60
    sealed case class Name(node: String, dir: String, theory: String)
wenzelm@44615
    61
    {
wenzelm@44615
    62
      override def hashCode: Int = node.hashCode
wenzelm@44615
    63
      override def equals(that: Any): Boolean =
wenzelm@44615
    64
        that match {
wenzelm@44615
    65
          case other: Name => node == other.node
wenzelm@44615
    66
          case _ => false
wenzelm@44615
    67
        }
wenzelm@44642
    68
      override def toString: String = theory
wenzelm@44615
    69
    }
wenzelm@44615
    70
wenzelm@44384
    71
    sealed abstract class Edit[A, B]
wenzelm@44156
    72
    {
wenzelm@44383
    73
      def foreach(f: A => Unit)
wenzelm@44383
    74
      {
wenzelm@44156
    75
        this match {
wenzelm@44383
    76
          case Edits(es) => es.foreach(f)
wenzelm@44383
    77
          case _ =>
wenzelm@44156
    78
        }
wenzelm@44383
    79
      }
wenzelm@44156
    80
    }
wenzelm@44384
    81
    case class Clear[A, B]() extends Edit[A, B]
wenzelm@44384
    82
    case class Edits[A, B](edits: List[A]) extends Edit[A, B]
wenzelm@44384
    83
    case class Header[A, B](header: Node_Header) extends Edit[A, B]
wenzelm@44384
    84
    case class Perspective[A, B](perspective: B) extends Edit[A, B]
wenzelm@44156
    85
wenzelm@38426
    86
    def command_starts(commands: Iterator[Command], offset: Text.Offset = 0)
wenzelm@38426
    87
      : Iterator[(Command, Text.Offset)] =
wenzelm@38227
    88
    {
wenzelm@38227
    89
      var i = offset
wenzelm@38227
    90
      for (command <- commands) yield {
wenzelm@38227
    91
        val start = i
wenzelm@38227
    92
        i += command.length
wenzelm@38227
    93
        (command, start)
wenzelm@38227
    94
      }
wenzelm@38227
    95
    }
wenzelm@46680
    96
wenzelm@46680
    97
    private val block_size = 1024
wenzelm@46680
    98
wenzelm@46680
    99
    val empty: Node = new Node()
wenzelm@38151
   100
  }
wenzelm@38151
   101
wenzelm@46712
   102
  final class Node private(
wenzelm@46677
   103
    val header: Node_Header = Exn.Exn(ERROR("Bad theory header")),
wenzelm@46677
   104
    val perspective: Command.Perspective = Command.Perspective.empty,
wenzelm@46677
   105
    val blobs: Map[String, Blob] = Map.empty,
wenzelm@46677
   106
    val commands: Linear_Set[Command] = Linear_Set.empty)
wenzelm@38151
   107
  {
wenzelm@46680
   108
    def clear: Node = new Node(header = header)
wenzelm@46680
   109
wenzelm@46680
   110
    def update_header(new_header: Node_Header): Node =
wenzelm@46680
   111
      new Node(new_header, perspective, blobs, commands)
wenzelm@46680
   112
wenzelm@46680
   113
    def update_perspective(new_perspective: Command.Perspective): Node =
wenzelm@46680
   114
      new Node(header, new_perspective, blobs, commands)
wenzelm@46680
   115
wenzelm@46680
   116
    def update_blobs(new_blobs: Map[String, Blob]): Node =
wenzelm@46680
   117
      new Node(header, perspective, new_blobs, commands)
wenzelm@46680
   118
wenzelm@46680
   119
    def update_commands(new_commands: Linear_Set[Command]): Node =
wenzelm@46680
   120
      new Node(header, perspective, blobs, new_commands)
wenzelm@44443
   121
wenzelm@44443
   122
wenzelm@43697
   123
    /* commands */
wenzelm@43697
   124
wenzelm@38879
   125
    private lazy val full_index: (Array[(Command, Text.Offset)], Text.Range) =
wenzelm@38879
   126
    {
wenzelm@38879
   127
      val blocks = new mutable.ListBuffer[(Command, Text.Offset)]
wenzelm@38879
   128
      var next_block = 0
wenzelm@38879
   129
      var last_stop = 0
wenzelm@38879
   130
      for ((command, start) <- Node.command_starts(commands.iterator)) {
wenzelm@38879
   131
        last_stop = start + command.length
wenzelm@38885
   132
        while (last_stop + 1 > next_block) {
wenzelm@38879
   133
          blocks += (command -> start)
wenzelm@46680
   134
          next_block += Node.block_size
wenzelm@38879
   135
        }
wenzelm@38879
   136
      }
wenzelm@38879
   137
      (blocks.toArray, Text.Range(0, last_stop))
wenzelm@38879
   138
    }
wenzelm@38151
   139
wenzelm@38879
   140
    def full_range: Text.Range = full_index._2
wenzelm@38151
   141
wenzelm@38569
   142
    def command_range(i: Text.Offset = 0): Iterator[(Command, Text.Offset)] =
wenzelm@38879
   143
    {
wenzelm@38879
   144
      if (!commands.isEmpty && full_range.contains(i)) {
wenzelm@46680
   145
        val (cmd0, start0) = full_index._1(i / Node.block_size)
wenzelm@38879
   146
        Node.command_starts(commands.iterator(cmd0), start0) dropWhile {
wenzelm@38879
   147
          case (cmd, start) => start + cmd.length <= i }
wenzelm@38879
   148
      }
wenzelm@38879
   149
      else Iterator.empty
wenzelm@38879
   150
    }
wenzelm@38151
   151
wenzelm@38569
   152
    def command_range(range: Text.Range): Iterator[(Command, Text.Offset)] =
wenzelm@38569
   153
      command_range(range.start) takeWhile { case (_, start) => start < range.stop }
wenzelm@38151
   154
wenzelm@38426
   155
    def command_at(i: Text.Offset): Option[(Command, Text.Offset)] =
wenzelm@38151
   156
    {
wenzelm@38151
   157
      val range = command_range(i)
wenzelm@38151
   158
      if (range.hasNext) Some(range.next) else None
wenzelm@38151
   159
    }
wenzelm@38151
   160
wenzelm@38426
   161
    def proper_command_at(i: Text.Offset): Option[Command] =
wenzelm@38151
   162
      command_at(i) match {
wenzelm@38151
   163
        case Some((command, _)) =>
wenzelm@38151
   164
          commands.reverse_iterator(command).find(cmd => !cmd.is_ignored)
wenzelm@38151
   165
        case None => None
wenzelm@38151
   166
      }
wenzelm@38879
   167
wenzelm@38879
   168
    def command_start(cmd: Command): Option[Text.Offset] =
wenzelm@46677
   169
      Node.command_starts(commands.iterator).find(_._1 == cmd).map(_._2)
wenzelm@38151
   170
  }
wenzelm@38151
   171
wenzelm@38151
   172
wenzelm@46723
   173
  /* development graph */
wenzelm@46723
   174
wenzelm@46723
   175
  object Nodes
wenzelm@46723
   176
  {
wenzelm@46723
   177
    val empty: Nodes = new Nodes(Graph.empty(Node.Name.Ordering))
wenzelm@46723
   178
  }
wenzelm@46723
   179
wenzelm@46723
   180
  final class Nodes private(graph: Graph[Node.Name, Node])
wenzelm@46723
   181
  {
wenzelm@46723
   182
    def get_name(s: String): Option[Node.Name] =
wenzelm@46723
   183
      graph.keys.find(name => name.node == s)
wenzelm@46723
   184
wenzelm@46723
   185
    def apply(name: Node.Name): Node =
wenzelm@46723
   186
      graph.default_node(name, Node.empty).get_node(name)
wenzelm@46723
   187
wenzelm@46723
   188
    def + (entry: (Node.Name, Node)): Nodes =
wenzelm@46723
   189
    {
wenzelm@46723
   190
      val (name, node) = entry
wenzelm@46723
   191
      val parents =
wenzelm@46723
   192
        node.header match {
wenzelm@46737
   193
          case Exn.Res(deps) => deps.imports.filter(_.dir != "")  // FIXME more specific filter
wenzelm@46723
   194
          case _ => Nil
wenzelm@46723
   195
        }
wenzelm@46723
   196
      val graph1 =
wenzelm@46723
   197
        (graph.default_node(name, Node.empty) /: parents)((g, p) => g.default_node(p, Node.empty))
wenzelm@46723
   198
      val graph2 = (graph1 /: graph1.imm_preds(name))((g, dep) => g.del_edge(dep, name))
wenzelm@46723
   199
      val graph3 = (graph2 /: parents)((g, dep) => g.add_edge(dep, name))
wenzelm@46723
   200
      new Nodes(graph3.map_node(name, _ => node))
wenzelm@46723
   201
    }
wenzelm@46723
   202
wenzelm@46723
   203
    def entries: Iterator[(Node.Name, Node)] =
wenzelm@46723
   204
      graph.entries.map({ case (name, (node, _)) => (name, node) })
wenzelm@46723
   205
wenzelm@46723
   206
    def topological_order: List[Node.Name] = graph.topological_order
wenzelm@46723
   207
  }
wenzelm@46723
   208
wenzelm@46723
   209
wenzelm@38424
   210
wenzelm@38424
   211
  /** versioning **/
wenzelm@38424
   212
wenzelm@38424
   213
  /* particular document versions */
wenzelm@34485
   214
wenzelm@38417
   215
  object Version
wenzelm@38417
   216
  {
wenzelm@46681
   217
    val init: Version = new Version()
wenzelm@46681
   218
wenzelm@46681
   219
    def make(nodes: Nodes): Version = new Version(new_id(), nodes)
wenzelm@38417
   220
  }
wenzelm@38417
   221
wenzelm@46712
   222
  final class Version private(
wenzelm@46677
   223
    val id: Version_ID = no_id,
wenzelm@46723
   224
    val nodes: Nodes = Nodes.empty)
immler@34660
   225
wenzelm@34859
   226
wenzelm@38424
   227
  /* changes of plain text, eventually resulting in document edits */
wenzelm@38227
   228
wenzelm@38227
   229
  object Change
wenzelm@38227
   230
  {
wenzelm@46678
   231
    val init: Change = new Change()
wenzelm@46678
   232
wenzelm@46678
   233
    def make(previous: Future[Version], edits: List[Edit_Text], version: Future[Version]): Change =
wenzelm@46678
   234
      new Change(Some(previous), edits, version)
wenzelm@38227
   235
  }
wenzelm@38227
   236
wenzelm@46712
   237
  final class Change private(
wenzelm@46677
   238
    val previous: Option[Future[Version]] = Some(Future.value(Version.init)),
wenzelm@46677
   239
    val edits: List[Edit_Text] = Nil,
wenzelm@46677
   240
    val version: Future[Version] = Future.value(Version.init))
wenzelm@38227
   241
  {
wenzelm@44672
   242
    def is_finished: Boolean =
wenzelm@44672
   243
      (previous match { case None => true case Some(future) => future.is_finished }) &&
wenzelm@44672
   244
      version.is_finished
wenzelm@44672
   245
wenzelm@46678
   246
    def truncate: Change = new Change(None, Nil, version)
wenzelm@38227
   247
  }
wenzelm@38227
   248
wenzelm@38227
   249
wenzelm@38841
   250
  /* history navigation */
wenzelm@38841
   251
wenzelm@38841
   252
  object History
wenzelm@38841
   253
  {
wenzelm@46679
   254
    val init: History = new History()
wenzelm@38841
   255
  }
wenzelm@38841
   256
wenzelm@46712
   257
  final class History private(
wenzelm@46679
   258
    val undo_list: List[Change] = List(Change.init))  // non-empty list
wenzelm@38841
   259
  {
wenzelm@46679
   260
    def tip: Change = undo_list.head
wenzelm@46679
   261
    def + (change: Change): History = new History(change :: undo_list)
wenzelm@38841
   262
wenzelm@46679
   263
    def prune(check: Change => Boolean, retain: Int): Option[(List[Change], History)] =
wenzelm@46679
   264
    {
wenzelm@46679
   265
      val n = undo_list.iterator.zipWithIndex.find(p => check(p._1)).get._2 + 1
wenzelm@46679
   266
      val (retained, dropped) = undo_list.splitAt(n max retain)
wenzelm@46679
   267
wenzelm@46679
   268
      retained.splitAt(retained.length - 1) match {
wenzelm@46679
   269
        case (prefix, List(last)) => Some(dropped, new History(prefix ::: List(last.truncate)))
wenzelm@46679
   270
        case _ => None
wenzelm@46679
   271
      }
wenzelm@46679
   272
    }
wenzelm@38841
   273
  }
wenzelm@38841
   274
wenzelm@38841
   275
wenzelm@38841
   276
wenzelm@38841
   277
  /** global state -- document structure, execution process, editing history **/
wenzelm@38424
   278
wenzelm@38424
   279
  abstract class Snapshot
wenzelm@38424
   280
  {
wenzelm@44582
   281
    val state: State
wenzelm@38424
   282
    val version: Version
wenzelm@38424
   283
    val node: Node
wenzelm@38424
   284
    val is_outdated: Boolean
wenzelm@38427
   285
    def convert(i: Text.Offset): Text.Offset
wenzelm@39177
   286
    def convert(range: Text.Range): Text.Range
wenzelm@38427
   287
    def revert(i: Text.Offset): Text.Offset
wenzelm@39177
   288
    def revert(range: Text.Range): Text.Range
wenzelm@46178
   289
    def cumulate_markup[A](range: Text.Range, info: A, elements: Option[Set[String]],
wenzelm@46178
   290
      result: PartialFunction[(A, Text.Markup), A]): Stream[Text.Info[A]]
wenzelm@46178
   291
    def select_markup[A](range: Text.Range, elements: Option[Set[String]],
wenzelm@46198
   292
      result: PartialFunction[Text.Markup, A]): Stream[Text.Info[A]]
wenzelm@38424
   293
  }
wenzelm@38424
   294
wenzelm@44476
   295
  type Assign =
wenzelm@44479
   296
   (List[(Document.Command_ID, Option[Document.Exec_ID])],  // exec state assignment
wenzelm@44476
   297
    List[(String, Option[Document.Command_ID])])  // last exec
wenzelm@44476
   298
wenzelm@38370
   299
  object State
wenzelm@38370
   300
  {
wenzelm@38373
   301
    class Fail(state: State) extends Exception
wenzelm@38373
   302
wenzelm@44479
   303
    object Assignment
wenzelm@44479
   304
    {
wenzelm@46683
   305
      val init: Assignment = new Assignment()
wenzelm@44479
   306
    }
wenzelm@38370
   307
wenzelm@46712
   308
    final class Assignment private(
wenzelm@46677
   309
      val command_execs: Map[Command_ID, Exec_ID] = Map.empty,
wenzelm@46677
   310
      val last_execs: Map[String, Option[Command_ID]] = Map.empty,
wenzelm@46677
   311
      val is_finished: Boolean = false)
wenzelm@38370
   312
    {
wenzelm@44477
   313
      def check_finished: Assignment = { require(is_finished); this }
wenzelm@46683
   314
      def unfinished: Assignment = new Assignment(command_execs, last_execs, false)
wenzelm@44479
   315
wenzelm@44479
   316
      def assign(add_command_execs: List[(Command_ID, Option[Exec_ID])],
wenzelm@44477
   317
        add_last_execs: List[(String, Option[Command_ID])]): Assignment =
wenzelm@38370
   318
      {
wenzelm@38976
   319
        require(!is_finished)
wenzelm@44479
   320
        val command_execs1 =
wenzelm@44479
   321
          (command_execs /: add_command_execs) {
wenzelm@44479
   322
            case (res, (command_id, None)) => res - command_id
wenzelm@44479
   323
            case (res, (command_id, Some(exec_id))) => res + (command_id -> exec_id)
wenzelm@44479
   324
          }
wenzelm@46683
   325
        new Assignment(command_execs1, last_execs ++ add_last_execs, true)
wenzelm@38150
   326
      }
wenzelm@38370
   327
    }
wenzelm@46682
   328
wenzelm@46682
   329
    val init: State =
wenzelm@46682
   330
      State().define_version(Version.init, Assignment.init).assign(Version.init.id)._2
wenzelm@38370
   331
  }
wenzelm@38370
   332
wenzelm@46712
   333
  final case class State private(
wenzelm@46677
   334
    val versions: Map[Version_ID, Version] = Map.empty,
wenzelm@46677
   335
    val commands: Map[Command_ID, Command.State] = Map.empty,  // static markup from define_command
wenzelm@46677
   336
    val execs: Map[Exec_ID, Command.State] = Map.empty,  // dynamic markup from execution
wenzelm@46677
   337
    val assignments: Map[Version_ID, State.Assignment] = Map.empty,
wenzelm@38841
   338
    val history: History = History.init)
wenzelm@38370
   339
  {
wenzelm@38373
   340
    private def fail[A]: A = throw new State.Fail(this)
wenzelm@38370
   341
wenzelm@44479
   342
    def define_version(version: Version, assignment: State.Assignment): State =
wenzelm@38370
   343
    {
wenzelm@38417
   344
      val id = version.id
wenzelm@38417
   345
      copy(versions = versions + (id -> version),
wenzelm@44479
   346
        assignments = assignments + (id -> assignment.unfinished))
wenzelm@38370
   347
    }
wenzelm@38370
   348
wenzelm@38373
   349
    def define_command(command: Command): State =
wenzelm@38373
   350
    {
wenzelm@38373
   351
      val id = command.id
wenzelm@38373
   352
      copy(commands = commands + (id -> command.empty_state))
wenzelm@38373
   353
    }
wenzelm@38373
   354
wenzelm@44582
   355
    def defined_command(id: Command_ID): Boolean = commands.isDefinedAt(id)
wenzelm@44582
   356
wenzelm@44607
   357
    def find_command(version: Version, id: ID): Option[(Node, Command)] =
wenzelm@44582
   358
      commands.get(id) orElse execs.get(id) match {
wenzelm@44582
   359
        case None => None
wenzelm@44582
   360
        case Some(st) =>
wenzelm@44582
   361
          val command = st.command
wenzelm@46681
   362
          val node = version.nodes(command.node_name)
wenzelm@46681
   363
          Some((node, command))
wenzelm@44582
   364
      }
wenzelm@38373
   365
wenzelm@38417
   366
    def the_version(id: Version_ID): Version = versions.getOrElse(id, fail)
wenzelm@44479
   367
    def the_command(id: Command_ID): Command.State = commands.getOrElse(id, fail)  // FIXME rename
wenzelm@44446
   368
    def the_exec(id: Exec_ID): Command.State = execs.getOrElse(id, fail)
wenzelm@43722
   369
    def the_assignment(version: Version): State.Assignment =
wenzelm@43722
   370
      assignments.getOrElse(version.id, fail)
wenzelm@38370
   371
wenzelm@38872
   372
    def accumulate(id: ID, message: XML.Elem): (Command.State, State) =
wenzelm@38370
   373
      execs.get(id) match {
wenzelm@44446
   374
        case Some(st) =>
wenzelm@46152
   375
          val new_st = st + message
wenzelm@44446
   376
          (new_st, copy(execs = execs + (id -> new_st)))
wenzelm@38370
   377
        case None =>
wenzelm@38370
   378
          commands.get(id) match {
wenzelm@38370
   379
            case Some(st) =>
wenzelm@46152
   380
              val new_st = st + message
wenzelm@38370
   381
              (new_st, copy(commands = commands + (id -> new_st)))
wenzelm@38370
   382
            case None => fail
wenzelm@38370
   383
          }
wenzelm@38370
   384
      }
wenzelm@38370
   385
wenzelm@46682
   386
    def assign(id: Version_ID, arg: Assign = (Nil, Nil)): (List[Command], State) =
wenzelm@38370
   387
    {
wenzelm@38417
   388
      val version = the_version(id)
wenzelm@44477
   389
      val (command_execs, last_execs) = arg
wenzelm@38370
   390
wenzelm@44543
   391
      val (changed_commands, new_execs) =
wenzelm@44479
   392
        ((Nil: List[Command], execs) /: command_execs) {
wenzelm@44543
   393
          case ((commands1, execs1), (cmd_id, exec)) =>
wenzelm@44479
   394
            val st = the_command(cmd_id)
wenzelm@44543
   395
            val commands2 = st.command :: commands1
wenzelm@44543
   396
            val execs2 =
wenzelm@44543
   397
              exec match {
wenzelm@44543
   398
                case None => execs1
wenzelm@44543
   399
                case Some(exec_id) => execs1 + (exec_id -> st)
wenzelm@44543
   400
              }
wenzelm@44543
   401
            (commands2, execs2)
wenzelm@38370
   402
        }
wenzelm@44477
   403
      val new_assignment = the_assignment(version).assign(command_execs, last_execs)
wenzelm@43722
   404
      val new_state = copy(assignments = assignments + (id -> new_assignment), execs = new_execs)
wenzelm@44476
   405
wenzelm@44543
   406
      (changed_commands, new_state)
wenzelm@38370
   407
    }
wenzelm@38370
   408
wenzelm@38417
   409
    def is_assigned(version: Version): Boolean =
wenzelm@43722
   410
      assignments.get(version.id) match {
wenzelm@38370
   411
        case Some(assgn) => assgn.is_finished
wenzelm@38370
   412
        case None => false
wenzelm@38370
   413
      }
wenzelm@38370
   414
wenzelm@44436
   415
    def is_stable(change: Change): Boolean =
wenzelm@44436
   416
      change.is_finished && is_assigned(change.version.get_finished)
wenzelm@44436
   417
wenzelm@44672
   418
    def recent_stable: Change = history.undo_list.find(is_stable) getOrElse fail
wenzelm@44436
   419
    def tip_stable: Boolean = is_stable(history.tip)
wenzelm@44475
   420
    def tip_version: Version = history.tip.version.get_finished
wenzelm@44436
   421
wenzelm@44615
   422
    def last_exec_offset(name: Node.Name): Text.Offset =
wenzelm@44484
   423
    {
wenzelm@44484
   424
      val version = tip_version
wenzelm@44615
   425
      the_assignment(version).last_execs.get(name.node) match {
wenzelm@44484
   426
        case Some(Some(id)) =>
wenzelm@44484
   427
          val node = version.nodes(name)
wenzelm@44484
   428
          val cmd = the_command(id).command
wenzelm@44484
   429
          node.command_start(cmd) match {
wenzelm@44484
   430
            case None => 0
wenzelm@44484
   431
            case Some(start) => start + cmd.length
wenzelm@44484
   432
          }
wenzelm@44484
   433
        case _ => 0
wenzelm@44484
   434
      }
wenzelm@44484
   435
    }
wenzelm@44484
   436
wenzelm@44446
   437
    def continue_history(
wenzelm@44446
   438
        previous: Future[Version],
wenzelm@40479
   439
        edits: List[Edit_Text],
wenzelm@43722
   440
        version: Future[Version]): (Change, State) =
wenzelm@38841
   441
    {
wenzelm@46678
   442
      val change = Change.make(previous, edits, version)
wenzelm@38841
   443
      (change, copy(history = history + change))
wenzelm@38841
   444
    }
wenzelm@38841
   445
wenzelm@44672
   446
    def prune_history(retain: Int = 0): (List[Version], State) =
wenzelm@44672
   447
    {
wenzelm@46679
   448
      history.prune(is_stable, retain) match {
wenzelm@46679
   449
        case Some((dropped, history1)) =>
wenzelm@44672
   450
          val dropped_versions = dropped.map(change => change.version.get_finished)
wenzelm@46679
   451
          val state1 = copy(history = history1)
wenzelm@44672
   452
          (dropped_versions, state1)
wenzelm@46679
   453
        case None => fail
wenzelm@44672
   454
      }
wenzelm@44672
   455
    }
wenzelm@44672
   456
wenzelm@44676
   457
    def removed_versions(removed: List[Version_ID]): State =
wenzelm@44676
   458
    {
wenzelm@44676
   459
      val versions1 = versions -- removed
wenzelm@44676
   460
      val assignments1 = assignments -- removed
wenzelm@44676
   461
      var commands1 = Map.empty[Command_ID, Command.State]
wenzelm@44676
   462
      var execs1 = Map.empty[Exec_ID, Command.State]
wenzelm@44676
   463
      for {
wenzelm@44676
   464
        (version_id, version) <- versions1.iterator
wenzelm@44676
   465
        val command_execs = assignments1(version_id).command_execs
wenzelm@46723
   466
        (_, node) <- version.nodes.entries
wenzelm@44676
   467
        command <- node.commands.iterator
wenzelm@44676
   468
      } {
wenzelm@44676
   469
        val id = command.id
wenzelm@44676
   470
        if (!commands1.isDefinedAt(id) && commands.isDefinedAt(id))
wenzelm@44676
   471
          commands1 += (id -> commands(id))
wenzelm@44676
   472
        if (command_execs.isDefinedAt(id)) {
wenzelm@44676
   473
          val exec_id = command_execs(id)
wenzelm@44676
   474
          if (!execs1.isDefinedAt(exec_id) && execs.isDefinedAt(exec_id))
wenzelm@44676
   475
            execs1 += (exec_id -> execs(exec_id))
wenzelm@44676
   476
        }
wenzelm@44676
   477
      }
wenzelm@44676
   478
      copy(versions = versions1, commands = commands1, execs = execs1, assignments = assignments1)
wenzelm@44676
   479
    }
wenzelm@44676
   480
wenzelm@44613
   481
    def command_state(version: Version, command: Command): Command.State =
wenzelm@44613
   482
    {
wenzelm@44613
   483
      require(is_assigned(version))
wenzelm@44613
   484
      try {
wenzelm@44613
   485
        the_exec(the_assignment(version).check_finished.command_execs
wenzelm@44613
   486
          .getOrElse(command.id, fail))
wenzelm@44613
   487
      }
wenzelm@44613
   488
      catch { case _: State.Fail => command.empty_state }
wenzelm@44613
   489
    }
wenzelm@44613
   490
wenzelm@38841
   491
wenzelm@38841
   492
    // persistent user-view
wenzelm@44615
   493
    def snapshot(name: Node.Name, pending_edits: List[Text.Edit]): Snapshot =
wenzelm@38370
   494
    {
wenzelm@44672
   495
      val stable = recent_stable
wenzelm@44436
   496
      val latest = history.tip
wenzelm@38841
   497
wenzelm@44156
   498
      // FIXME proper treatment of removed nodes
wenzelm@38841
   499
      val edits =
wenzelm@38841
   500
        (pending_edits /: history.undo_list.takeWhile(_ != stable))((edits, change) =>
wenzelm@44156
   501
            (for ((a, Node.Edits(es)) <- change.edits if a == name) yield es).flatten ::: edits)
wenzelm@38841
   502
      lazy val reverse_edits = edits.reverse
wenzelm@38841
   503
wenzelm@38841
   504
      new Snapshot
wenzelm@38841
   505
      {
wenzelm@44582
   506
        val state = State.this
wenzelm@39698
   507
        val version = stable.version.get_finished
wenzelm@38841
   508
        val node = version.nodes(name)
wenzelm@38841
   509
        val is_outdated = !(pending_edits.isEmpty && latest == stable)
wenzelm@38841
   510
wenzelm@38841
   511
        def convert(offset: Text.Offset) = (offset /: edits)((i, edit) => edit.convert(i))
wenzelm@38841
   512
        def revert(offset: Text.Offset) = (offset /: reverse_edits)((i, edit) => edit.revert(i))
wenzelm@43425
   513
        def convert(range: Text.Range) = (range /: edits)((r, edit) => edit.convert(r))
wenzelm@43425
   514
        def revert(range: Text.Range) = (range /: reverse_edits)((r, edit) => edit.revert(r))
wenzelm@39177
   515
wenzelm@46178
   516
        def cumulate_markup[A](range: Text.Range, info: A, elements: Option[Set[String]],
wenzelm@46178
   517
          result: PartialFunction[(A, Text.Markup), A]): Stream[Text.Info[A]] =
wenzelm@45459
   518
        {
wenzelm@45467
   519
          val former_range = revert(range)
wenzelm@45459
   520
          for {
wenzelm@45459
   521
            (command, command_start) <- node.command_range(former_range).toStream
wenzelm@46208
   522
            Text.Info(r0, a) <- state.command_state(version, command).markup.
wenzelm@46178
   523
              cumulate[A]((former_range - command_start).restrict(command.range), info, elements,
wenzelm@46178
   524
                {
wenzelm@46178
   525
                  case (a, Text.Info(r0, b))
wenzelm@46178
   526
                  if result.isDefinedAt((a, Text.Info(convert(r0 + command_start), b))) =>
wenzelm@46178
   527
                    result((a, Text.Info(convert(r0 + command_start), b)))
wenzelm@46178
   528
                })
wenzelm@45459
   529
          } yield Text.Info(convert(r0 + command_start), a)
wenzelm@45459
   530
        }
wenzelm@45459
   531
wenzelm@46178
   532
        def select_markup[A](range: Text.Range, elements: Option[Set[String]],
wenzelm@46198
   533
          result: PartialFunction[Text.Markup, A]): Stream[Text.Info[A]] =
wenzelm@38845
   534
        {
wenzelm@45468
   535
          val result1 =
wenzelm@45468
   536
            new PartialFunction[(Option[A], Text.Markup), Option[A]] {
wenzelm@45468
   537
              def isDefinedAt(arg: (Option[A], Text.Markup)): Boolean = result.isDefinedAt(arg._2)
wenzelm@45468
   538
              def apply(arg: (Option[A], Text.Markup)): Option[A] = Some(result(arg._2))
wenzelm@45468
   539
            }
wenzelm@46198
   540
          for (Text.Info(r, Some(x)) <- cumulate_markup(range, None, elements, result1))
wenzelm@46198
   541
            yield Text.Info(r, x)
wenzelm@38845
   542
        }
wenzelm@38841
   543
      }
wenzelm@38150
   544
    }
wenzelm@34485
   545
  }
wenzelm@34840
   546
}
wenzelm@34840
   547