author | wenzelm |
Sat, 12 Nov 2011 12:21:42 +0100 | |
changeset 45468 | 33e946d3f449 |
parent 45467 | 3f290b6288cf |
child 45469 | 25306d92f4ad |
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 |
|
e628da370072
more efficient Markup_Tree, based on branches sorted by quasi-order;
wenzelm
parents:
38478
diff
changeset
|
23 |
object Branches |
e628da370072
more efficient Markup_Tree, based on branches sorted by quasi-order;
wenzelm
parents:
38478
diff
changeset
|
24 |
{ |
45455 | 25 |
type Entry = (Text.Markup, Markup_Tree) |
38578 | 26 |
type T = SortedMap[Text.Range, Entry] |
38479
e628da370072
more efficient Markup_Tree, based on branches sorted by quasi-order;
wenzelm
parents:
38478
diff
changeset
|
27 |
|
45456 | 28 |
val empty: T = SortedMap.empty(Text.Range.Ordering) |
38578 | 29 |
def update(branches: T, entry: Entry): T = branches + (entry._1.range -> entry) |
38657 | 30 |
def single(entry: Entry): T = update(empty, entry) |
38479
e628da370072
more efficient Markup_Tree, based on branches sorted by quasi-order;
wenzelm
parents:
38478
diff
changeset
|
31 |
} |
e628da370072
more efficient Markup_Tree, based on branches sorted by quasi-order;
wenzelm
parents:
38478
diff
changeset
|
32 |
} |
34554
7dc6c231da40
abs. stops, markup nodes depend on doc-version;
immler@in.tum.de
parents:
34517
diff
changeset
|
33 |
|
34393 | 34 |
|
45456 | 35 |
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
|
36 |
{ |
38479
e628da370072
more efficient Markup_Tree, based on branches sorted by quasi-order;
wenzelm
parents:
38478
diff
changeset
|
37 |
import Markup_Tree._ |
34557 | 38 |
|
38563 | 39 |
override def toString = |
40 |
branches.toList.map(_._2) match { |
|
41 |
case Nil => "Empty" |
|
42 |
case list => list.mkString("Tree(", ",", ")") |
|
43 |
} |
|
44 |
||
45457 | 45 |
private def overlapping(range: Text.Range): Branches.T = // FIXME special cases!? |
46 |
{ |
|
47 |
val start = Text.Range(range.start) |
|
48 |
val stop = Text.Range(range.stop) |
|
49 |
val bs = branches.range(start, stop) |
|
50 |
// FIXME check after Scala 2.8.x |
|
51 |
branches.get(stop) match { |
|
52 |
case Some(end) if range overlaps end._1.range => Branches.update(bs, end) |
|
53 |
case _ => bs |
|
54 |
} |
|
55 |
} |
|
56 |
||
45455 | 57 |
def + (new_info: Text.Markup): Markup_Tree = |
34703 | 58 |
{ |
38578 | 59 |
val new_range = new_info.range |
60 |
branches.get(new_range) match { |
|
38482
7b6ee937b75f
tuned Markup_Tree, using SortedMap more carefully;
wenzelm
parents:
38479
diff
changeset
|
61 |
case None => |
38577 | 62 |
new Markup_Tree(Branches.update(branches, new_info -> empty)) |
63 |
case Some((info, subtree)) => |
|
38578 | 64 |
val range = info.range |
38661
f1ba2ae8e58a
Markup_Tree.+: new info tends to sink to bottom, where it is prefered by select;
wenzelm
parents:
38659
diff
changeset
|
65 |
if (range.contains(new_range)) |
38577 | 66 |
new Markup_Tree(Branches.update(branches, info -> (subtree + new_info))) |
38578 | 67 |
else if (new_range.contains(branches.head._1) && new_range.contains(branches.last._1)) |
38657 | 68 |
new Markup_Tree(Branches.single(new_info -> this)) |
38482
7b6ee937b75f
tuned Markup_Tree, using SortedMap more carefully;
wenzelm
parents:
38479
diff
changeset
|
69 |
else { |
45457 | 70 |
val body = overlapping(new_range) |
38578 | 71 |
if (body.forall(e => new_range.contains(e._1))) { |
38659
afac51977705
Markup_Tree.select: more straight-forward recursion producing one main stream, avoid fragmentation of parent info due to ignored subtree;
wenzelm
parents:
38657
diff
changeset
|
72 |
val rest = // branches -- body, modulo workarounds for Redblack in Scala 2.8.0 |
38657 | 73 |
if (body.size > 1) |
74 |
(Branches.empty /: branches)((rest, entry) => |
|
75 |
if (body.isDefinedAt(entry._1)) rest else rest + entry) |
|
76 |
else branches |
|
38577 | 77 |
new Markup_Tree(Branches.update(rest, new_info -> new Markup_Tree(body))) |
38482
7b6ee937b75f
tuned Markup_Tree, using SortedMap more carefully;
wenzelm
parents:
38479
diff
changeset
|
78 |
} |
7b6ee937b75f
tuned Markup_Tree, using SortedMap more carefully;
wenzelm
parents:
38479
diff
changeset
|
79 |
else { // FIXME split markup!? |
38577 | 80 |
System.err.println("Ignored overlapping markup information: " + new_info) |
38482
7b6ee937b75f
tuned Markup_Tree, using SortedMap more carefully;
wenzelm
parents:
38479
diff
changeset
|
81 |
this |
7b6ee937b75f
tuned Markup_Tree, using SortedMap more carefully;
wenzelm
parents:
38479
diff
changeset
|
82 |
} |
7b6ee937b75f
tuned Markup_Tree, using SortedMap more carefully;
wenzelm
parents:
38479
diff
changeset
|
83 |
} |
34703 | 84 |
} |
85 |
} |
|
86 |
||
45467 | 87 |
def cumulate[A](root_range: Text.Range)(body: Cumulate[A]): Stream[Text.Info[A]] = |
45459 | 88 |
{ |
45467 | 89 |
val root_info = body.info |
90 |
val result = body.result |
|
91 |
||
45459 | 92 |
def stream( |
93 |
last: Text.Offset, |
|
94 |
stack: List[(Text.Info[A], Stream[(Text.Range, Branches.Entry)])]): Stream[Text.Info[A]] = |
|
95 |
{ |
|
96 |
stack match { |
|
97 |
case (parent, (range, (info, tree)) #:: more) :: rest => |
|
45467 | 98 |
val subrange = range.restrict(root_range) |
45459 | 99 |
val subtree = tree.overlapping(subrange).toStream |
100 |
val start = subrange.start |
|
101 |
||
102 |
val arg = (parent.info, info) |
|
103 |
if (result.isDefinedAt(arg)) { |
|
104 |
val next = Text.Info(subrange, result(arg)) |
|
105 |
val nexts = stream(start, (next, subtree) :: (parent, more) :: rest) |
|
106 |
if (last < start) parent.restrict(Text.Range(last, start)) #:: nexts |
|
107 |
else nexts |
|
108 |
} |
|
109 |
else stream(last, (parent, subtree #::: more) :: rest) |
|
110 |
||
111 |
case (parent, Stream.Empty) :: rest => |
|
112 |
val stop = parent.range.stop |
|
113 |
val nexts = stream(stop, rest) |
|
114 |
if (last < stop) parent.restrict(Text.Range(last, stop)) #:: nexts |
|
115 |
else nexts |
|
116 |
||
117 |
case Nil => |
|
45467 | 118 |
val stop = root_range.stop |
119 |
if (last < stop) Stream(Text.Info(Text.Range(last, stop), root_info)) |
|
45459 | 120 |
else Stream.empty |
121 |
} |
|
122 |
} |
|
45467 | 123 |
stream(root_range.start, |
124 |
List((Text.Info(root_range, root_info), overlapping(root_range).toStream))) |
|
45459 | 125 |
} |
126 |
||
38577 | 127 |
def swing_tree(parent: DefaultMutableTreeNode) |
45455 | 128 |
(swing_node: Text.Markup => DefaultMutableTreeNode) |
38479
e628da370072
more efficient Markup_Tree, based on branches sorted by quasi-order;
wenzelm
parents:
38478
diff
changeset
|
129 |
{ |
38577 | 130 |
for ((_, (info, subtree)) <- branches) { |
131 |
val current = swing_node(info) |
|
38479
e628da370072
more efficient Markup_Tree, based on branches sorted by quasi-order;
wenzelm
parents:
38478
diff
changeset
|
132 |
subtree.swing_tree(current)(swing_node) |
e628da370072
more efficient Markup_Tree, based on branches sorted by quasi-order;
wenzelm
parents:
38478
diff
changeset
|
133 |
parent.add(current) |
34514
2104a836b415
renamed fields of MarkupNode; implemented flatten and leafs
immler@in.tum.de
parents:
34503
diff
changeset
|
134 |
} |
2104a836b415
renamed fields of MarkupNode; implemented flatten and leafs
immler@in.tum.de
parents:
34503
diff
changeset
|
135 |
} |
34717
3f32e08bbb6c
sidekick root data: set buffer length to avoid crash of initial caret move;
wenzelm
parents:
34708
diff
changeset
|
136 |
} |
34514
2104a836b415
renamed fields of MarkupNode; implemented flatten and leafs
immler@in.tum.de
parents:
34503
diff
changeset
|
137 |