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