author | wenzelm |
Mon, 23 Aug 2010 20:50:00 +0200 | |
changeset 38657 | 2e0ebdaac59b |
parent 38584 | 9f63135f3cbb |
child 38659 | afac51977705 |
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 |
|
34701
80b0add08eef
IsabelleSideKickParser: incorporate former MarkupNode.markup2default_node, observe stopped flag;
wenzelm
parents:
34676
diff
changeset
|
10 |
|
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 |
import scala.collection.mutable |
e628da370072
more efficient Markup_Tree, based on branches sorted by quasi-order;
wenzelm
parents:
38478
diff
changeset
|
15 |
import scala.annotation.tailrec |
e628da370072
more efficient Markup_Tree, based on branches sorted by quasi-order;
wenzelm
parents:
38478
diff
changeset
|
16 |
|
e628da370072
more efficient Markup_Tree, based on branches sorted by quasi-order;
wenzelm
parents:
38478
diff
changeset
|
17 |
|
e628da370072
more efficient Markup_Tree, based on branches sorted by quasi-order;
wenzelm
parents:
38478
diff
changeset
|
18 |
object Markup_Tree |
e628da370072
more efficient Markup_Tree, based on branches sorted by quasi-order;
wenzelm
parents:
38478
diff
changeset
|
19 |
{ |
38566
8176107637ce
Branches.overlapping: proper treatment of stop_range that overlaps with end;
wenzelm
parents:
38564
diff
changeset
|
20 |
/* branches sorted by quasi-order -- overlapping ranges appear as equivalent */ |
38479
e628da370072
more efficient Markup_Tree, based on branches sorted by quasi-order;
wenzelm
parents:
38478
diff
changeset
|
21 |
|
e628da370072
more efficient Markup_Tree, based on branches sorted by quasi-order;
wenzelm
parents:
38478
diff
changeset
|
22 |
object Branches |
e628da370072
more efficient Markup_Tree, based on branches sorted by quasi-order;
wenzelm
parents:
38478
diff
changeset
|
23 |
{ |
38577 | 24 |
type Entry = (Text.Info[Any], Markup_Tree) |
38578 | 25 |
type T = SortedMap[Text.Range, Entry] |
38479
e628da370072
more efficient Markup_Tree, based on branches sorted by quasi-order;
wenzelm
parents:
38478
diff
changeset
|
26 |
|
38578 | 27 |
val empty = SortedMap.empty[Text.Range, Entry](new scala.math.Ordering[Text.Range] |
38479
e628da370072
more efficient Markup_Tree, based on branches sorted by quasi-order;
wenzelm
parents:
38478
diff
changeset
|
28 |
{ |
38578 | 29 |
def compare(r1: Text.Range, r2: Text.Range): Int = r1 compare r2 |
38479
e628da370072
more efficient Markup_Tree, based on branches sorted by quasi-order;
wenzelm
parents:
38478
diff
changeset
|
30 |
}) |
38562 | 31 |
|
38578 | 32 |
def update(branches: T, entry: Entry): T = branches + (entry._1.range -> entry) |
38657 | 33 |
def single(entry: Entry): T = update(empty, entry) |
38562 | 34 |
|
35 |
def overlapping(range: Text.Range, branches: T): T = |
|
38566
8176107637ce
Branches.overlapping: proper treatment of stop_range that overlaps with end;
wenzelm
parents:
38564
diff
changeset
|
36 |
{ |
38578 | 37 |
val start = Text.Range(range.start) |
38 |
val stop = Text.Range(range.stop) |
|
38566
8176107637ce
Branches.overlapping: proper treatment of stop_range that overlaps with end;
wenzelm
parents:
38564
diff
changeset
|
39 |
branches.get(stop) match { |
8176107637ce
Branches.overlapping: proper treatment of stop_range that overlaps with end;
wenzelm
parents:
38564
diff
changeset
|
40 |
case Some(end) if range overlaps end._1.range => |
8176107637ce
Branches.overlapping: proper treatment of stop_range that overlaps with end;
wenzelm
parents:
38564
diff
changeset
|
41 |
update(branches.range(start, stop), end) |
8176107637ce
Branches.overlapping: proper treatment of stop_range that overlaps with end;
wenzelm
parents:
38564
diff
changeset
|
42 |
case _ => branches.range(start, stop) |
8176107637ce
Branches.overlapping: proper treatment of stop_range that overlaps with end;
wenzelm
parents:
38564
diff
changeset
|
43 |
} |
8176107637ce
Branches.overlapping: proper treatment of stop_range that overlaps with end;
wenzelm
parents:
38564
diff
changeset
|
44 |
} |
38479
e628da370072
more efficient Markup_Tree, based on branches sorted by quasi-order;
wenzelm
parents:
38478
diff
changeset
|
45 |
} |
e628da370072
more efficient Markup_Tree, based on branches sorted by quasi-order;
wenzelm
parents:
38478
diff
changeset
|
46 |
|
e628da370072
more efficient Markup_Tree, based on branches sorted by quasi-order;
wenzelm
parents:
38478
diff
changeset
|
47 |
val empty = new Markup_Tree(Branches.empty) |
e628da370072
more efficient Markup_Tree, based on branches sorted by quasi-order;
wenzelm
parents:
38478
diff
changeset
|
48 |
} |
34554
7dc6c231da40
abs. stops, markup nodes depend on doc-version;
immler@in.tum.de
parents:
34517
diff
changeset
|
49 |
|
34393 | 50 |
|
38479
e628da370072
more efficient Markup_Tree, based on branches sorted by quasi-order;
wenzelm
parents:
38478
diff
changeset
|
51 |
case class Markup_Tree(val 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
|
52 |
{ |
38479
e628da370072
more efficient Markup_Tree, based on branches sorted by quasi-order;
wenzelm
parents:
38478
diff
changeset
|
53 |
import Markup_Tree._ |
34557 | 54 |
|
38563 | 55 |
override def toString = |
56 |
branches.toList.map(_._2) match { |
|
57 |
case Nil => "Empty" |
|
58 |
case list => list.mkString("Tree(", ",", ")") |
|
59 |
} |
|
60 |
||
38577 | 61 |
def + (new_info: Text.Info[Any]): Markup_Tree = |
34703 | 62 |
{ |
38578 | 63 |
val new_range = new_info.range |
64 |
branches.get(new_range) match { |
|
38482
7b6ee937b75f
tuned Markup_Tree, using SortedMap more carefully;
wenzelm
parents:
38479
diff
changeset
|
65 |
case None => |
38577 | 66 |
new Markup_Tree(Branches.update(branches, new_info -> empty)) |
67 |
case Some((info, subtree)) => |
|
38578 | 68 |
val range = info.range |
38657 | 69 |
if (range == new_range) |
70 |
new Markup_Tree(Branches.update(branches, |
|
71 |
new_info -> new Markup_Tree(Branches.single((info, subtree))))) |
|
72 |
else if (range.contains(new_range)) |
|
38577 | 73 |
new Markup_Tree(Branches.update(branches, info -> (subtree + new_info))) |
38578 | 74 |
else if (new_range.contains(branches.head._1) && new_range.contains(branches.last._1)) |
38657 | 75 |
new Markup_Tree(Branches.single(new_info -> this)) |
38482
7b6ee937b75f
tuned Markup_Tree, using SortedMap more carefully;
wenzelm
parents:
38479
diff
changeset
|
76 |
else { |
38578 | 77 |
val body = Branches.overlapping(new_range, branches) |
78 |
if (body.forall(e => new_range.contains(e._1))) { |
|
38657 | 79 |
val rest = // branches -- body, with workarounds for Redblack in Scala 2.8.0 |
80 |
if (body.size > 1) |
|
81 |
(Branches.empty /: branches)((rest, entry) => |
|
82 |
if (body.isDefinedAt(entry._1)) rest else rest + entry) |
|
83 |
else branches |
|
38577 | 84 |
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
|
85 |
} |
7b6ee937b75f
tuned Markup_Tree, using SortedMap more carefully;
wenzelm
parents:
38479
diff
changeset
|
86 |
else { // FIXME split markup!? |
38577 | 87 |
System.err.println("Ignored overlapping markup information: " + new_info) |
38482
7b6ee937b75f
tuned Markup_Tree, using SortedMap more carefully;
wenzelm
parents:
38479
diff
changeset
|
88 |
this |
7b6ee937b75f
tuned Markup_Tree, using SortedMap more carefully;
wenzelm
parents:
38479
diff
changeset
|
89 |
} |
7b6ee937b75f
tuned Markup_Tree, using SortedMap more carefully;
wenzelm
parents:
38479
diff
changeset
|
90 |
} |
34703 | 91 |
} |
92 |
} |
|
93 |
||
38582 | 94 |
def select[A](root_range: Text.Range) |
95 |
(result: PartialFunction[Text.Info[Any], A])(default: A): Stream[Text.Info[A]] = |
|
38486
f5bbfc019937
Markup_Tree.select: crude version of stream-based filtering;
wenzelm
parents:
38482
diff
changeset
|
96 |
{ |
38577 | 97 |
def stream(parent: Text.Info[A], bs: Branches.T): Stream[Text.Info[A]] = |
38486
f5bbfc019937
Markup_Tree.select: crude version of stream-based filtering;
wenzelm
parents:
38482
diff
changeset
|
98 |
{ |
38578 | 99 |
val range = parent.range |
38486
f5bbfc019937
Markup_Tree.select: crude version of stream-based filtering;
wenzelm
parents:
38482
diff
changeset
|
100 |
val substream = |
38578 | 101 |
(for ((info_range, (info, subtree)) <- Branches.overlapping(range, bs).toStream) yield { |
102 |
if (result.isDefinedAt(info)) { |
|
103 |
val current = Text.Info(info_range.restrict(range), result(info)) |
|
38564 | 104 |
stream(current, subtree.branches) |
105 |
} |
|
38578 | 106 |
else stream(parent.restrict(info_range), subtree.branches) |
38486
f5bbfc019937
Markup_Tree.select: crude version of stream-based filtering;
wenzelm
parents:
38482
diff
changeset
|
107 |
}).flatten |
f5bbfc019937
Markup_Tree.select: crude version of stream-based filtering;
wenzelm
parents:
38482
diff
changeset
|
108 |
|
38577 | 109 |
def padding(last: Text.Offset, s: Stream[Text.Info[A]]): Stream[Text.Info[A]] = |
38486
f5bbfc019937
Markup_Tree.select: crude version of stream-based filtering;
wenzelm
parents:
38482
diff
changeset
|
110 |
s match { |
38577 | 111 |
case info #:: rest => |
112 |
val Text.Range(start, stop) = info.range |
|
38562 | 113 |
if (last < start) |
38577 | 114 |
parent.restrict(Text.Range(last, start)) #:: info #:: padding(stop, rest) |
115 |
else info #:: padding(stop, rest) |
|
38564 | 116 |
case Stream.Empty => |
38578 | 117 |
if (last < range.stop) |
118 |
Stream(parent.restrict(Text.Range(last, range.stop))) |
|
38486
f5bbfc019937
Markup_Tree.select: crude version of stream-based filtering;
wenzelm
parents:
38482
diff
changeset
|
119 |
else Stream.Empty |
f5bbfc019937
Markup_Tree.select: crude version of stream-based filtering;
wenzelm
parents:
38482
diff
changeset
|
120 |
} |
38566
8176107637ce
Branches.overlapping: proper treatment of stop_range that overlaps with end;
wenzelm
parents:
38564
diff
changeset
|
121 |
if (substream.isEmpty) Stream(parent) |
38578 | 122 |
else padding(range.start, substream) |
38486
f5bbfc019937
Markup_Tree.select: crude version of stream-based filtering;
wenzelm
parents:
38482
diff
changeset
|
123 |
} |
38582 | 124 |
stream(Text.Info(root_range, default), branches) |
38486
f5bbfc019937
Markup_Tree.select: crude version of stream-based filtering;
wenzelm
parents:
38482
diff
changeset
|
125 |
} |
f5bbfc019937
Markup_Tree.select: crude version of stream-based filtering;
wenzelm
parents:
38482
diff
changeset
|
126 |
|
38577 | 127 |
def swing_tree(parent: DefaultMutableTreeNode) |
128 |
(swing_node: Text.Info[Any] => 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 |