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