author | wenzelm |
Sat, 12 Nov 2011 18:56:49 +0100 | |
changeset 45473 | 66395afbd915 |
parent 45470 | 81b85d4ed269 |
child 45474 | f793dd5d84b2 |
permissions | -rw-r--r-- |
38479
e628da370072
more efficient Markup_Tree, based on branches sorted by quasi-order;
wenzelm
parents:
38478
diff
changeset
|
1 |
/* Title: Pure/PIDE/markup_tree.scala |
36676 | 2 |
Author: Fabian Immler, TU Munich |
3 |
Author: Makarius |
|
4 |
||
38479
e628da370072
more efficient Markup_Tree, based on branches sorted by quasi-order;
wenzelm
parents:
38478
diff
changeset
|
5 |
Markup trees over nested / non-overlapping text ranges. |
36676 | 6 |
*/ |
34393 | 7 |
|
34871
e596a0b71f3c
incorporate "proofdocument" part into main Isabelle/Pure.jar -- except for html_panel.scala, which depends on external library (Lobo/Cobra browser);
wenzelm
parents:
34760
diff
changeset
|
8 |
package isabelle |
34393 | 9 |
|
43520
cec9b95fa35d
explicit import java.lang.System to prevent odd scope problems;
wenzelm
parents:
39178
diff
changeset
|
10 |
import java.lang.System |
34701
80b0add08eef
IsabelleSideKickParser: incorporate former MarkupNode.markup2default_node, observe stopped flag;
wenzelm
parents:
34676
diff
changeset
|
11 |
import javax.swing.tree.DefaultMutableTreeNode |
80b0add08eef
IsabelleSideKickParser: incorporate former MarkupNode.markup2default_node, observe stopped flag;
wenzelm
parents:
34676
diff
changeset
|
12 |
|
38479
e628da370072
more efficient Markup_Tree, based on branches sorted by quasi-order;
wenzelm
parents:
38478
diff
changeset
|
13 |
import scala.collection.immutable.SortedMap |
e628da370072
more efficient Markup_Tree, based on branches sorted by quasi-order;
wenzelm
parents:
38478
diff
changeset
|
14 |
|
e628da370072
more efficient Markup_Tree, based on branches sorted by quasi-order;
wenzelm
parents:
38478
diff
changeset
|
15 |
|
e628da370072
more efficient Markup_Tree, based on branches sorted by quasi-order;
wenzelm
parents:
38478
diff
changeset
|
16 |
object Markup_Tree |
e628da370072
more efficient Markup_Tree, based on branches sorted by quasi-order;
wenzelm
parents:
38478
diff
changeset
|
17 |
{ |
45467 | 18 |
sealed case class Cumulate[A](info: A, result: PartialFunction[(A, Text.Markup), A]) |
45468 | 19 |
sealed case class Select[A](result: PartialFunction[Text.Markup, A]) |
45456 | 20 |
|
21 |
val empty: Markup_Tree = new Markup_Tree(Branches.empty) |
|
38479
e628da370072
more efficient Markup_Tree, based on branches sorted by quasi-order;
wenzelm
parents:
38478
diff
changeset
|
22 |
|
45473 | 23 |
object Entry |
24 |
{ |
|
25 |
def apply(markup: Text.Markup, subtree: Markup_Tree): Entry = |
|
26 |
Entry(markup.range, List(markup.info), subtree) |
|
27 |
} |
|
28 |
||
45470 | 29 |
sealed case class Entry(range: Text.Range, rev_markup: List[XML.Elem], subtree: Markup_Tree) |
45469
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset
|
30 |
{ |
45470 | 31 |
def + (m: XML.Elem): Entry = copy(rev_markup = m :: rev_markup) |
32 |
def markup: List[XML.Elem] = rev_markup.reverse |
|
45469
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset
|
33 |
} |
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset
|
34 |
|
38479
e628da370072
more efficient Markup_Tree, based on branches sorted by quasi-order;
wenzelm
parents:
38478
diff
changeset
|
35 |
object Branches |
e628da370072
more efficient Markup_Tree, based on branches sorted by quasi-order;
wenzelm
parents:
38478
diff
changeset
|
36 |
{ |
38578 | 37 |
type T = SortedMap[Text.Range, Entry] |
45456 | 38 |
val empty: T = SortedMap.empty(Text.Range.Ordering) |
38479
e628da370072
more efficient Markup_Tree, based on branches sorted by quasi-order;
wenzelm
parents:
38478
diff
changeset
|
39 |
} |
e628da370072
more efficient Markup_Tree, based on branches sorted by quasi-order;
wenzelm
parents:
38478
diff
changeset
|
40 |
} |
34554
7dc6c231da40
abs. stops, markup nodes depend on doc-version;
immler@in.tum.de
parents:
34517
diff
changeset
|
41 |
|
34393 | 42 |
|
45456 | 43 |
class Markup_Tree private(branches: Markup_Tree.Branches.T) |
34717
3f32e08bbb6c
sidekick root data: set buffer length to avoid crash of initial caret move;
wenzelm
parents:
34708
diff
changeset
|
44 |
{ |
45469
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset
|
45 |
private def this(branches: Markup_Tree.Branches.T, entry: Markup_Tree.Entry) = |
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset
|
46 |
this(branches + (entry.range -> entry)) |
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset
|
47 |
|
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset
|
48 |
|
38479
e628da370072
more efficient Markup_Tree, based on branches sorted by quasi-order;
wenzelm
parents:
38478
diff
changeset
|
49 |
import Markup_Tree._ |
34557 | 50 |
|
38563 | 51 |
override def toString = |
52 |
branches.toList.map(_._2) match { |
|
53 |
case Nil => "Empty" |
|
54 |
case list => list.mkString("Tree(", ",", ")") |
|
55 |
} |
|
56 |
||
45469
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset
|
57 |
private def overlapping(range: Text.Range): Branches.T = |
45457 | 58 |
{ |
59 |
val start = Text.Range(range.start) |
|
60 |
val stop = Text.Range(range.stop) |
|
61 |
val bs = branches.range(start, stop) |
|
62 |
// FIXME check after Scala 2.8.x |
|
63 |
branches.get(stop) match { |
|
45469
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset
|
64 |
case Some(end) if range overlaps end.range => bs + (end.range -> end) |
45457 | 65 |
case _ => bs |
66 |
} |
|
67 |
} |
|
68 |
||
45469
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset
|
69 |
def + (new_markup: Text.Markup): Markup_Tree = |
34703 | 70 |
{ |
45469
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset
|
71 |
val new_range = new_markup.range |
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset
|
72 |
|
38578 | 73 |
branches.get(new_range) match { |
45473 | 74 |
case None => new Markup_Tree(branches, Entry(new_markup, empty)) |
45469
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset
|
75 |
case Some(entry) => |
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset
|
76 |
if (entry.range == new_range) |
45473 | 77 |
new Markup_Tree(branches, entry + new_markup.info) |
45469
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset
|
78 |
else if (entry.range.contains(new_range)) |
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset
|
79 |
new Markup_Tree(branches, entry.copy(subtree = entry.subtree + new_markup)) |
38578 | 80 |
else if (new_range.contains(branches.head._1) && new_range.contains(branches.last._1)) |
45473 | 81 |
new Markup_Tree(Branches.empty, Entry(new_markup, this)) |
38482
7b6ee937b75f
tuned Markup_Tree, using SortedMap more carefully;
wenzelm
parents:
38479
diff
changeset
|
82 |
else { |
45457 | 83 |
val body = overlapping(new_range) |
38578 | 84 |
if (body.forall(e => new_range.contains(e._1))) { |
45469
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset
|
85 |
val rest = // branches -- body, modulo workarounds for Redblack in Scala 2.8.0 FIXME |
38657 | 86 |
if (body.size > 1) |
87 |
(Branches.empty /: branches)((rest, entry) => |
|
88 |
if (body.isDefinedAt(entry._1)) rest else rest + entry) |
|
89 |
else branches |
|
45473 | 90 |
new Markup_Tree(rest, Entry(new_markup, new Markup_Tree(body))) |
38482
7b6ee937b75f
tuned Markup_Tree, using SortedMap more carefully;
wenzelm
parents:
38479
diff
changeset
|
91 |
} |
7b6ee937b75f
tuned Markup_Tree, using SortedMap more carefully;
wenzelm
parents:
38479
diff
changeset
|
92 |
else { // FIXME split markup!? |
45469
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset
|
93 |
System.err.println("Ignored overlapping markup information: " + new_markup) |
38482
7b6ee937b75f
tuned Markup_Tree, using SortedMap more carefully;
wenzelm
parents:
38479
diff
changeset
|
94 |
this |
7b6ee937b75f
tuned Markup_Tree, using SortedMap more carefully;
wenzelm
parents:
38479
diff
changeset
|
95 |
} |
7b6ee937b75f
tuned Markup_Tree, using SortedMap more carefully;
wenzelm
parents:
38479
diff
changeset
|
96 |
} |
34703 | 97 |
} |
98 |
} |
|
99 |
||
45467 | 100 |
def cumulate[A](root_range: Text.Range)(body: Cumulate[A]): Stream[Text.Info[A]] = |
45459 | 101 |
{ |
45467 | 102 |
val root_info = body.info |
45469
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset
|
103 |
|
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset
|
104 |
def result(x: A, entry: Entry): Option[A] = |
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset
|
105 |
{ |
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset
|
106 |
val (y, changed) = |
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset
|
107 |
(entry.markup :\ (x, false))((info, res) => |
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset
|
108 |
{ |
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset
|
109 |
val (y, changed) = res |
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset
|
110 |
val arg = (x, Text.Info(entry.range, info)) |
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset
|
111 |
if (body.result.isDefinedAt(arg)) (body.result(arg), true) |
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset
|
112 |
else res |
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset
|
113 |
}) |
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset
|
114 |
if (changed) Some(y) else None |
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset
|
115 |
} |
45467 | 116 |
|
45459 | 117 |
def stream( |
118 |
last: Text.Offset, |
|
45469
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset
|
119 |
stack: List[(Text.Info[A], Stream[(Text.Range, Entry)])]): Stream[Text.Info[A]] = |
45459 | 120 |
{ |
121 |
stack match { |
|
45469
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset
|
122 |
case (parent, (range, entry) #:: more) :: rest => |
45467 | 123 |
val subrange = range.restrict(root_range) |
45469
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset
|
124 |
val subtree = entry.subtree.overlapping(subrange).toStream |
45459 | 125 |
val start = subrange.start |
126 |
||
45469
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset
|
127 |
result(parent.info, entry) match { |
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset
|
128 |
case Some(res) => |
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset
|
129 |
val next = Text.Info(subrange, res) |
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset
|
130 |
val nexts = stream(start, (next, subtree) :: (parent, more) :: rest) |
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset
|
131 |
if (last < start) parent.restrict(Text.Range(last, start)) #:: nexts |
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset
|
132 |
else nexts |
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset
|
133 |
case None => stream(last, (parent, subtree #::: more) :: rest) |
45459 | 134 |
} |
135 |
||
136 |
case (parent, Stream.Empty) :: rest => |
|
137 |
val stop = parent.range.stop |
|
138 |
val nexts = stream(stop, rest) |
|
139 |
if (last < stop) parent.restrict(Text.Range(last, stop)) #:: nexts |
|
140 |
else nexts |
|
141 |
||
142 |
case Nil => |
|
45467 | 143 |
val stop = root_range.stop |
144 |
if (last < stop) Stream(Text.Info(Text.Range(last, stop), root_info)) |
|
45459 | 145 |
else Stream.empty |
146 |
} |
|
147 |
} |
|
45467 | 148 |
stream(root_range.start, |
149 |
List((Text.Info(root_range, root_info), overlapping(root_range).toStream))) |
|
45459 | 150 |
} |
151 |
||
38577 | 152 |
def swing_tree(parent: DefaultMutableTreeNode) |
45455 | 153 |
(swing_node: Text.Markup => DefaultMutableTreeNode) |
38479
e628da370072
more efficient Markup_Tree, based on branches sorted by quasi-order;
wenzelm
parents:
38478
diff
changeset
|
154 |
{ |
45469
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset
|
155 |
for ((_, entry) <- branches) { |
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset
|
156 |
var current = parent |
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset
|
157 |
for (info <- entry.markup) { |
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset
|
158 |
val node = swing_node(Text.Info(entry.range, info)) |
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset
|
159 |
current.add(node) |
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset
|
160 |
current = node |
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset
|
161 |
} |
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset
|
162 |
entry.subtree.swing_tree(current)(swing_node) |
34514
2104a836b415
renamed fields of MarkupNode; implemented flatten and leafs
immler@in.tum.de
parents:
34503
diff
changeset
|
163 |
} |
2104a836b415
renamed fields of MarkupNode; implemented flatten and leafs
immler@in.tum.de
parents:
34503
diff
changeset
|
164 |
} |
34717
3f32e08bbb6c
sidekick root data: set buffer length to avoid crash of initial caret move;
wenzelm
parents:
34708
diff
changeset
|
165 |
} |
34514
2104a836b415
renamed fields of MarkupNode; implemented flatten and leafs
immler@in.tum.de
parents:
34503
diff
changeset
|
166 |