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