wenzelm@38479: /* Title: Pure/PIDE/markup_tree.scala wenzelm@36676: Author: Fabian Immler, TU Munich wenzelm@36676: Author: Makarius wenzelm@36676: wenzelm@38479: Markup trees over nested / non-overlapping text ranges. wenzelm@36676: */ immler@34393: wenzelm@34871: package isabelle immler@34393: wenzelm@43520: import java.lang.System wenzelm@34701: import javax.swing.tree.DefaultMutableTreeNode wenzelm@34701: wenzelm@38479: import scala.collection.immutable.SortedMap wenzelm@38479: wenzelm@38479: wenzelm@38479: object Markup_Tree wenzelm@38479: { wenzelm@38566: /* branches sorted by quasi-order -- overlapping ranges appear as equivalent */ wenzelm@38479: wenzelm@38479: object Branches wenzelm@38479: { wenzelm@38577: type Entry = (Text.Info[Any], Markup_Tree) wenzelm@38578: type T = SortedMap[Text.Range, Entry] wenzelm@38479: wenzelm@44379: val empty = SortedMap.empty[Text.Range, Entry](Text.Range.Ordering) wenzelm@38562: wenzelm@38578: def update(branches: T, entry: Entry): T = branches + (entry._1.range -> entry) wenzelm@38657: def single(entry: Entry): T = update(empty, entry) wenzelm@38562: wenzelm@38659: def overlapping(range: Text.Range, branches: T): T = // FIXME special cases!? wenzelm@38566: { wenzelm@38578: val start = Text.Range(range.start) wenzelm@38578: val stop = Text.Range(range.stop) wenzelm@38659: val bs = branches.range(start, stop) wenzelm@38566: branches.get(stop) match { wenzelm@38659: case Some(end) if range overlaps end._1.range => update(bs, end) wenzelm@38659: case _ => bs wenzelm@38566: } wenzelm@38566: } wenzelm@38479: } wenzelm@38479: wenzelm@38479: val empty = new Markup_Tree(Branches.empty) wenzelm@39178: wenzelm@39178: type Select[A] = PartialFunction[Text.Info[Any], A] wenzelm@38479: } immler@34554: immler@34393: wenzelm@43714: sealed case class Markup_Tree(val branches: Markup_Tree.Branches.T) wenzelm@34717: { wenzelm@38479: import Markup_Tree._ immler@34557: wenzelm@38563: override def toString = wenzelm@38563: branches.toList.map(_._2) match { wenzelm@38563: case Nil => "Empty" wenzelm@38563: case list => list.mkString("Tree(", ",", ")") wenzelm@38563: } wenzelm@38563: wenzelm@38577: def + (new_info: Text.Info[Any]): Markup_Tree = wenzelm@34703: { wenzelm@38578: val new_range = new_info.range wenzelm@38578: branches.get(new_range) match { wenzelm@38482: case None => wenzelm@38577: new Markup_Tree(Branches.update(branches, new_info -> empty)) wenzelm@38577: case Some((info, subtree)) => wenzelm@38578: val range = info.range wenzelm@38661: if (range.contains(new_range)) wenzelm@38577: new Markup_Tree(Branches.update(branches, info -> (subtree + new_info))) wenzelm@38578: else if (new_range.contains(branches.head._1) && new_range.contains(branches.last._1)) wenzelm@38657: new Markup_Tree(Branches.single(new_info -> this)) wenzelm@38482: else { wenzelm@38578: val body = Branches.overlapping(new_range, branches) wenzelm@38578: if (body.forall(e => new_range.contains(e._1))) { wenzelm@38659: val rest = // branches -- body, modulo workarounds for Redblack in Scala 2.8.0 wenzelm@38657: if (body.size > 1) wenzelm@38657: (Branches.empty /: branches)((rest, entry) => wenzelm@38657: if (body.isDefinedAt(entry._1)) rest else rest + entry) wenzelm@38657: else branches wenzelm@38577: new Markup_Tree(Branches.update(rest, new_info -> new Markup_Tree(body))) wenzelm@38482: } wenzelm@38482: else { // FIXME split markup!? wenzelm@38577: System.err.println("Ignored overlapping markup information: " + new_info) wenzelm@38482: this wenzelm@38482: } wenzelm@38482: } wenzelm@34703: } wenzelm@34703: } wenzelm@34703: wenzelm@38659: private def overlapping(range: Text.Range): Stream[(Text.Range, Branches.Entry)] = wenzelm@38659: Branches.overlapping(range, branches).toStream wenzelm@38659: wenzelm@39178: def select[A](root_range: Text.Range)(result: Markup_Tree.Select[A]) wenzelm@39177: : Stream[Text.Info[Option[A]]] = wenzelm@38486: { wenzelm@39177: def stream( wenzelm@39177: last: Text.Offset, wenzelm@39177: stack: List[(Text.Info[Option[A]], Stream[(Text.Range, Branches.Entry)])]) wenzelm@39177: : Stream[Text.Info[Option[A]]] = wenzelm@38486: { wenzelm@38659: stack match { wenzelm@38659: case (parent, (range, (info, tree)) #:: more) :: rest => wenzelm@38659: val subrange = range.restrict(root_range) wenzelm@38659: val subtree = tree.overlapping(subrange) wenzelm@38659: val start = subrange.start wenzelm@38486: wenzelm@38659: if (result.isDefinedAt(info)) { wenzelm@39177: val next = Text.Info[Option[A]](subrange, Some(result(info))) wenzelm@38659: val nexts = stream(start, (next, subtree) :: (parent, more) :: rest) wenzelm@38659: if (last < start) parent.restrict(Text.Range(last, start)) #:: nexts wenzelm@38659: else nexts wenzelm@38659: } wenzelm@38659: else stream(last, (parent, subtree #::: more) :: rest) wenzelm@38659: wenzelm@38659: case (parent, Stream.Empty) :: rest => wenzelm@38659: val stop = parent.range.stop wenzelm@38659: val nexts = stream(stop, rest) wenzelm@38659: if (last < stop) parent.restrict(Text.Range(last, stop)) #:: nexts wenzelm@38659: else nexts wenzelm@38659: wenzelm@38726: case Nil => wenzelm@38726: val stop = root_range.stop wenzelm@39177: if (last < stop) Stream(Text.Info(Text.Range(last, stop), None)) wenzelm@38726: else Stream.empty wenzelm@38659: } wenzelm@38486: } wenzelm@39177: stream(root_range.start, List((Text.Info(root_range, None), overlapping(root_range)))) wenzelm@38486: } wenzelm@38486: wenzelm@38577: def swing_tree(parent: DefaultMutableTreeNode) wenzelm@38577: (swing_node: Text.Info[Any] => DefaultMutableTreeNode) wenzelm@38479: { wenzelm@38577: for ((_, (info, subtree)) <- branches) { wenzelm@38577: val current = swing_node(info) wenzelm@38479: subtree.swing_tree(current)(swing_node) wenzelm@38479: parent.add(current) immler@34514: } immler@34514: } wenzelm@34717: } immler@34514: