author  wenzelm 
Sat, 12 Nov 2011 19:44:56 +0100  
changeset 45474  f793dd5d84b2 
parent 45473  66395afbd915 
child 45667  546d78f0d81f 
permissions  rwrr 
38479
e628da370072
more efficient Markup_Tree, based on branches sorted by quasiorder;
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 quasiorder;
wenzelm
parents:
38478
diff
changeset

5 
Markup trees over nested / nonoverlapping 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 quasiorder;
wenzelm
parents:
38478
diff
changeset

13 
import scala.collection.immutable.SortedMap 
e628da370072
more efficient Markup_Tree, based on branches sorted by quasiorder;
wenzelm
parents:
38478
diff
changeset

14 

e628da370072
more efficient Markup_Tree, based on branches sorted by quasiorder;
wenzelm
parents:
38478
diff
changeset

15 

e628da370072
more efficient Markup_Tree, based on branches sorted by quasiorder;
wenzelm
parents:
38478
diff
changeset

16 
object Markup_Tree 
e628da370072
more efficient Markup_Tree, based on branches sorted by quasiorder;
wenzelm
parents:
38478
diff
changeset

17 
{ 
45474
f793dd5d84b2
index markup elements for more efficient cumulate/select operations;
wenzelm
parents:
45473
diff
changeset

18 
sealed case class Cumulate[A]( 
f793dd5d84b2
index markup elements for more efficient cumulate/select operations;
wenzelm
parents:
45473
diff
changeset

19 
info: A, result: PartialFunction[(A, Text.Markup), A], elements: Option[Set[String]]) 
f793dd5d84b2
index markup elements for more efficient cumulate/select operations;
wenzelm
parents:
45473
diff
changeset

20 
sealed case class Select[A]( 
f793dd5d84b2
index markup elements for more efficient cumulate/select operations;
wenzelm
parents:
45473
diff
changeset

21 
result: PartialFunction[Text.Markup, A], elements: Option[Set[String]]) 
45456  22 

23 
val empty: Markup_Tree = new Markup_Tree(Branches.empty) 

38479
e628da370072
more efficient Markup_Tree, based on branches sorted by quasiorder;
wenzelm
parents:
38478
diff
changeset

24 

45473  25 
object Entry 
26 
{ 

27 
def apply(markup: Text.Markup, subtree: Markup_Tree): Entry = 

45474
f793dd5d84b2
index markup elements for more efficient cumulate/select operations;
wenzelm
parents:
45473
diff
changeset

28 
Entry(markup.range, List(markup.info), Set(markup.info.markup.name), subtree) 
45473  29 
} 
30 

45474
f793dd5d84b2
index markup elements for more efficient cumulate/select operations;
wenzelm
parents:
45473
diff
changeset

31 
sealed case class Entry( 
f793dd5d84b2
index markup elements for more efficient cumulate/select operations;
wenzelm
parents:
45473
diff
changeset

32 
range: Text.Range, 
f793dd5d84b2
index markup elements for more efficient cumulate/select operations;
wenzelm
parents:
45473
diff
changeset

33 
rev_markup: List[XML.Elem], 
f793dd5d84b2
index markup elements for more efficient cumulate/select operations;
wenzelm
parents:
45473
diff
changeset

34 
elements: Set[String], 
f793dd5d84b2
index markup elements for more efficient cumulate/select operations;
wenzelm
parents:
45473
diff
changeset

35 
subtree: Markup_Tree) 
45469
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset

36 
{ 
45474
f793dd5d84b2
index markup elements for more efficient cumulate/select operations;
wenzelm
parents:
45473
diff
changeset

37 
def + (info: XML.Elem): Entry = 
f793dd5d84b2
index markup elements for more efficient cumulate/select operations;
wenzelm
parents:
45473
diff
changeset

38 
if (elements(info.markup.name)) copy(rev_markup = info :: rev_markup) 
f793dd5d84b2
index markup elements for more efficient cumulate/select operations;
wenzelm
parents:
45473
diff
changeset

39 
else copy(rev_markup = info :: rev_markup, elements = elements + info.markup.name) 
f793dd5d84b2
index markup elements for more efficient cumulate/select operations;
wenzelm
parents:
45473
diff
changeset

40 

45470  41 
def markup: List[XML.Elem] = rev_markup.reverse 
45469
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset

42 
} 
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset

43 

38479
e628da370072
more efficient Markup_Tree, based on branches sorted by quasiorder;
wenzelm
parents:
38478
diff
changeset

44 
object Branches 
e628da370072
more efficient Markup_Tree, based on branches sorted by quasiorder;
wenzelm
parents:
38478
diff
changeset

45 
{ 
38578  46 
type T = SortedMap[Text.Range, Entry] 
45456  47 
val empty: T = SortedMap.empty(Text.Range.Ordering) 
38479
e628da370072
more efficient Markup_Tree, based on branches sorted by quasiorder;
wenzelm
parents:
38478
diff
changeset

48 
} 
e628da370072
more efficient Markup_Tree, based on branches sorted by quasiorder;
wenzelm
parents:
38478
diff
changeset

49 
} 
34554
7dc6c231da40
abs. stops, markup nodes depend on docversion;
immler@in.tum.de
parents:
34517
diff
changeset

50 

34393  51 

45456  52 
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

53 
{ 
45469
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset

54 
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

55 
this(branches + (entry.range > entry)) 
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset

56 

25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset

57 

38479
e628da370072
more efficient Markup_Tree, based on branches sorted by quasiorder;
wenzelm
parents:
38478
diff
changeset

58 
import Markup_Tree._ 
34557  59 

38563  60 
override def toString = 
61 
branches.toList.map(_._2) match { 

62 
case Nil => "Empty" 

63 
case list => list.mkString("Tree(", ",", ")") 

64 
} 

65 

45469
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset

66 
private def overlapping(range: Text.Range): Branches.T = 
45457  67 
{ 
68 
val start = Text.Range(range.start) 

69 
val stop = Text.Range(range.stop) 

70 
val bs = branches.range(start, stop) 

71 
// FIXME check after Scala 2.8.x 

72 
branches.get(stop) match { 

45469
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset

73 
case Some(end) if range overlaps end.range => bs + (end.range > end) 
45457  74 
case _ => bs 
75 
} 

76 
} 

77 

45469
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset

78 
def + (new_markup: Text.Markup): Markup_Tree = 
34703  79 
{ 
45469
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset

80 
val new_range = new_markup.range 
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset

81 

38578  82 
branches.get(new_range) match { 
45473  83 
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

84 
case Some(entry) => 
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset

85 
if (entry.range == new_range) 
45473  86 
new Markup_Tree(branches, entry + new_markup.info) 
45469
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset

87 
else if (entry.range.contains(new_range)) 
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset

88 
new Markup_Tree(branches, entry.copy(subtree = entry.subtree + new_markup)) 
38578  89 
else if (new_range.contains(branches.head._1) && new_range.contains(branches.last._1)) 
45473  90 
new Markup_Tree(Branches.empty, Entry(new_markup, this)) 
38482
7b6ee937b75f
tuned Markup_Tree, using SortedMap more carefully;
wenzelm
parents:
38479
diff
changeset

91 
else { 
45457  92 
val body = overlapping(new_range) 
38578  93 
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

94 
val rest = // branches  body, modulo workarounds for Redblack in Scala 2.8.0 FIXME 
38657  95 
if (body.size > 1) 
96 
(Branches.empty /: branches)((rest, entry) => 

97 
if (body.isDefinedAt(entry._1)) rest else rest + entry) 

98 
else branches 

45473  99 
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

100 
} 
7b6ee937b75f
tuned Markup_Tree, using SortedMap more carefully;
wenzelm
parents:
38479
diff
changeset

101 
else { // FIXME split markup!? 
45469
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset

102 
System.err.println("Ignored overlapping markup information: " + new_markup) 
38482
7b6ee937b75f
tuned Markup_Tree, using SortedMap more carefully;
wenzelm
parents:
38479
diff
changeset

103 
this 
7b6ee937b75f
tuned Markup_Tree, using SortedMap more carefully;
wenzelm
parents:
38479
diff
changeset

104 
} 
7b6ee937b75f
tuned Markup_Tree, using SortedMap more carefully;
wenzelm
parents:
38479
diff
changeset

105 
} 
34703  106 
} 
107 
} 

108 

45467  109 
def cumulate[A](root_range: Text.Range)(body: Cumulate[A]): Stream[Text.Info[A]] = 
45459  110 
{ 
45467  111 
val root_info = body.info 
45469
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset

112 

25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset

113 
def result(x: A, entry: Entry): Option[A] = 
45474
f793dd5d84b2
index markup elements for more efficient cumulate/select operations;
wenzelm
parents:
45473
diff
changeset

114 
if (body.elements match { case Some(es) => es.exists(entry.elements) case None => true }) { 
f793dd5d84b2
index markup elements for more efficient cumulate/select operations;
wenzelm
parents:
45473
diff
changeset

115 
val (y, changed) = 
f793dd5d84b2
index markup elements for more efficient cumulate/select operations;
wenzelm
parents:
45473
diff
changeset

116 
(entry.markup :\ (x, false))((info, res) => 
f793dd5d84b2
index markup elements for more efficient cumulate/select operations;
wenzelm
parents:
45473
diff
changeset

117 
{ 
f793dd5d84b2
index markup elements for more efficient cumulate/select operations;
wenzelm
parents:
45473
diff
changeset

118 
val (y, changed) = res 
f793dd5d84b2
index markup elements for more efficient cumulate/select operations;
wenzelm
parents:
45473
diff
changeset

119 
val arg = (x, Text.Info(entry.range, info)) 
f793dd5d84b2
index markup elements for more efficient cumulate/select operations;
wenzelm
parents:
45473
diff
changeset

120 
if (body.result.isDefinedAt(arg)) (body.result(arg), true) 
f793dd5d84b2
index markup elements for more efficient cumulate/select operations;
wenzelm
parents:
45473
diff
changeset

121 
else res 
f793dd5d84b2
index markup elements for more efficient cumulate/select operations;
wenzelm
parents:
45473
diff
changeset

122 
}) 
f793dd5d84b2
index markup elements for more efficient cumulate/select operations;
wenzelm
parents:
45473
diff
changeset

123 
if (changed) Some(y) else None 
f793dd5d84b2
index markup elements for more efficient cumulate/select operations;
wenzelm
parents:
45473
diff
changeset

124 
} 
f793dd5d84b2
index markup elements for more efficient cumulate/select operations;
wenzelm
parents:
45473
diff
changeset

125 
else None 
45467  126 

45459  127 
def stream( 
128 
last: Text.Offset, 

45469
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset

129 
stack: List[(Text.Info[A], Stream[(Text.Range, Entry)])]): Stream[Text.Info[A]] = 
45459  130 
{ 
131 
stack match { 

45469
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset

132 
case (parent, (range, entry) #:: more) :: rest => 
45467  133 
val subrange = range.restrict(root_range) 
45469
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset

134 
val subtree = entry.subtree.overlapping(subrange).toStream 
45459  135 
val start = subrange.start 
136 

45469
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset

137 
result(parent.info, entry) match { 
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset

138 
case Some(res) => 
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset

139 
val next = Text.Info(subrange, res) 
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset

140 
val nexts = stream(start, (next, subtree) :: (parent, more) :: rest) 
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset

141 
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

142 
else nexts 
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset

143 
case None => stream(last, (parent, subtree #::: more) :: rest) 
45459  144 
} 
145 

146 
case (parent, Stream.Empty) :: rest => 

147 
val stop = parent.range.stop 

148 
val nexts = stream(stop, rest) 

149 
if (last < stop) parent.restrict(Text.Range(last, stop)) #:: nexts 

150 
else nexts 

151 

152 
case Nil => 

45467  153 
val stop = root_range.stop 
154 
if (last < stop) Stream(Text.Info(Text.Range(last, stop), root_info)) 

45459  155 
else Stream.empty 
156 
} 

157 
} 

45467  158 
stream(root_range.start, 
159 
List((Text.Info(root_range, root_info), overlapping(root_range).toStream))) 

45459  160 
} 
161 

38577  162 
def swing_tree(parent: DefaultMutableTreeNode) 
45455  163 
(swing_node: Text.Markup => DefaultMutableTreeNode) 
38479
e628da370072
more efficient Markup_Tree, based on branches sorted by quasiorder;
wenzelm
parents:
38478
diff
changeset

164 
{ 
45469
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset

165 
for ((_, entry) < branches) { 
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset

166 
var current = parent 
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset

167 
for (info < entry.markup) { 
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset

168 
val node = swing_node(Text.Info(entry.range, info)) 
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset

169 
current.add(node) 
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset

170 
current = node 
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset

171 
} 
25306d92f4ad
refined Markup_Tree implementation: stacked markup within each entry;
wenzelm
parents:
45468
diff
changeset

172 
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

173 
} 
2104a836b415
renamed fields of MarkupNode; implemented flatten and leafs
immler@in.tum.de
parents:
34503
diff
changeset

174 
} 
34717
3f32e08bbb6c
sidekick root data: set buffer length to avoid crash of initial caret move;
wenzelm
parents:
34708
diff
changeset

175 
} 
34514
2104a836b415
renamed fields of MarkupNode; implemented flatten and leafs
immler@in.tum.de
parents:
34503
diff
changeset

176 