author | wenzelm |
Thu, 25 Jul 2024 10:30:22 +0200 | |
changeset 80616 | 94703573e0af |
parent 80461 | 38d020af64aa |
permissions | -rw-r--r-- |
44698 | 1 |
/* Title: Pure/PIDE/xml.scala |
27931 | 2 |
Author: Makarius |
3 |
||
44698 | 4 |
Untyped XML trees and basic data representation. |
27931 | 5 |
*/ |
6 |
||
7 |
package isabelle |
|
8 |
||
80430 | 9 |
import scala.annotation.tailrec |
10 |
||
55618 | 11 |
|
75393 | 12 |
object XML { |
43767 | 13 |
/** XML trees **/ |
14 |
||
27947 | 15 |
/* datatype representation */ |
16 |
||
65753 | 17 |
type Attribute = Properties.Entry |
43780 | 18 |
type Attributes = Properties.T |
27931 | 19 |
|
80430 | 20 |
trait Trav |
21 |
case class End(name: String) extends Trav |
|
22 |
||
23 |
sealed abstract class Tree extends Trav { |
|
24 |
override def toString: String = string_of_tree(this) |
|
25 |
} |
|
64354 | 26 |
type Body = List[Tree] |
80430 | 27 |
case class Elem(markup: Markup, body: Body) extends Tree with Trav { |
73032 | 28 |
private lazy val hash: Int = (markup, body).hashCode() |
29 |
override def hashCode(): Int = hash |
|
30 |
||
52890 | 31 |
def name: String = markup.name |
65753 | 32 |
|
64358 | 33 |
def update_attributes(more_attributes: Attributes): Elem = |
34 |
if (more_attributes.isEmpty) this |
|
35 |
else Elem(markup.update_properties(more_attributes), body) |
|
65753 | 36 |
|
65772 | 37 |
def + (att: Attribute): Elem = Elem(markup + att, body) |
52890 | 38 |
} |
80430 | 39 |
case class Text(content: String) extends Tree with Trav { |
73032 | 40 |
private lazy val hash: Int = content.hashCode() |
41 |
override def hashCode(): Int = hash |
|
42 |
} |
|
29203 | 43 |
|
80429 | 44 |
trait Traversal { |
45 |
def text(s: String): Unit |
|
46 |
def elem(markup: Markup, end: Boolean = false): Unit |
|
47 |
def end_elem(name: String): Unit |
|
48 |
||
80430 | 49 |
def traverse(trees: List[Tree]): Unit = { |
80454 | 50 |
@tailrec def trav_atomic(list: List[Trav]): List[Trav] = |
51 |
list match { |
|
52 |
case Text(s) :: rest => text(s); trav_atomic(rest) |
|
53 |
case Elem(markup, Nil) :: rest => |
|
54 |
if (!markup.is_empty) elem(markup, end = true) |
|
55 |
trav_atomic(rest) |
|
56 |
case End(name) :: rest => end_elem(name); trav_atomic(rest) |
|
57 |
case _ => list |
|
58 |
} |
|
59 |
||
80430 | 60 |
@tailrec def trav(list: List[Trav]): Unit = |
80454 | 61 |
(trav_atomic(list) : @unchecked) match { |
80430 | 62 |
case Nil => |
80454 | 63 |
case Elem(markup, body) :: rest if body.nonEmpty => |
64 |
if (markup.is_empty) trav(trav_atomic(body) ::: rest) |
|
65 |
else { elem(markup); trav(trav_atomic(body) ::: End(markup.name) :: rest) } |
|
80430 | 66 |
} |
80454 | 67 |
|
80430 | 68 |
trav(trees) |
69 |
} |
|
80429 | 70 |
} |
71 |
||
80434 | 72 |
def elem(markup: Markup): XML.Elem = XML.Elem(markup, Nil) |
73 |
def elem(name: String, body: Body): XML.Elem = XML.Elem(Markup(name, Nil), body) |
|
74 |
def elem(name: String): XML.Elem = XML.Elem(Markup(name, Nil), Nil) |
|
75 |
||
76 |
val no_text: Text = Text("") |
|
77 |
val newline: Text = Text("\n") |
|
78 |
||
79 |
def string(s: String): Body = if (s.isEmpty) Nil else List(Text(s)) |
|
80 |
||
81 |
def enclose(bg: String, en:String, body: Body): Body = |
|
82 |
string(bg) ::: body ::: string(en) |
|
83 |
||
29203 | 84 |
|
69805 | 85 |
/* name space */ |
86 |
||
75393 | 87 |
object Namespace { |
69805 | 88 |
def apply(prefix: String, target: String): Namespace = |
89 |
new Namespace(prefix, target) |
|
90 |
} |
|
91 |
||
75393 | 92 |
final class Namespace private(prefix: String, target: String) { |
69805 | 93 |
def apply(name: String): String = prefix + ":" + name |
94 |
val attribute: XML.Attribute = ("xmlns:" + prefix, target) |
|
95 |
||
96 |
override def toString: String = attribute.toString |
|
97 |
} |
|
98 |
||
99 |
||
49650
9fad6480300d
support for wrapped XML elements, which allows to preserve full markup tree information in to_XML/from_XML conversion;
wenzelm
parents:
49613
diff
changeset
|
100 |
/* wrapped elements */ |
9fad6480300d
support for wrapped XML elements, which allows to preserve full markup tree information in to_XML/from_XML conversion;
wenzelm
parents:
49613
diff
changeset
|
101 |
|
60215 | 102 |
val XML_ELEM = "xml_elem" |
103 |
val XML_NAME = "xml_name" |
|
104 |
val XML_BODY = "xml_body" |
|
49650
9fad6480300d
support for wrapped XML elements, which allows to preserve full markup tree information in to_XML/from_XML conversion;
wenzelm
parents:
49613
diff
changeset
|
105 |
|
75393 | 106 |
object Wrapped_Elem { |
49650
9fad6480300d
support for wrapped XML elements, which allows to preserve full markup tree information in to_XML/from_XML conversion;
wenzelm
parents:
49613
diff
changeset
|
107 |
def apply(markup: Markup, body1: Body, body2: Body): XML.Elem = |
61026 | 108 |
XML.Elem(Markup(XML_ELEM, (XML_NAME, markup.name) :: markup.properties), |
109 |
XML.Elem(Markup(XML_BODY, Nil), body1) :: body2) |
|
49650
9fad6480300d
support for wrapped XML elements, which allows to preserve full markup tree information in to_XML/from_XML conversion;
wenzelm
parents:
49613
diff
changeset
|
110 |
|
9fad6480300d
support for wrapped XML elements, which allows to preserve full markup tree information in to_XML/from_XML conversion;
wenzelm
parents:
49613
diff
changeset
|
111 |
def unapply(tree: Tree): Option[(Markup, Body, Body)] = |
9fad6480300d
support for wrapped XML elements, which allows to preserve full markup tree information in to_XML/from_XML conversion;
wenzelm
parents:
49613
diff
changeset
|
112 |
tree match { |
9fad6480300d
support for wrapped XML elements, which allows to preserve full markup tree information in to_XML/from_XML conversion;
wenzelm
parents:
49613
diff
changeset
|
113 |
case |
61026 | 114 |
XML.Elem(Markup(XML_ELEM, (XML_NAME, name) :: props), |
115 |
XML.Elem(Markup(XML_BODY, Nil), body1) :: body2) => |
|
49650
9fad6480300d
support for wrapped XML elements, which allows to preserve full markup tree information in to_XML/from_XML conversion;
wenzelm
parents:
49613
diff
changeset
|
116 |
Some(Markup(name, props), body1, body2) |
9fad6480300d
support for wrapped XML elements, which allows to preserve full markup tree information in to_XML/from_XML conversion;
wenzelm
parents:
49613
diff
changeset
|
117 |
case _ => None |
9fad6480300d
support for wrapped XML elements, which allows to preserve full markup tree information in to_XML/from_XML conversion;
wenzelm
parents:
49613
diff
changeset
|
118 |
} |
9fad6480300d
support for wrapped XML elements, which allows to preserve full markup tree information in to_XML/from_XML conversion;
wenzelm
parents:
49613
diff
changeset
|
119 |
} |
9fad6480300d
support for wrapped XML elements, which allows to preserve full markup tree information in to_XML/from_XML conversion;
wenzelm
parents:
49613
diff
changeset
|
120 |
|
80455 | 121 |
object Wrapped_Elem_Body { |
122 |
def unapply(tree: Tree): Option[Body] = |
|
123 |
tree match { |
|
124 |
case |
|
125 |
XML.Elem(Markup(XML_ELEM, (XML_NAME, _) :: _), |
|
126 |
XML.Elem(Markup(XML_BODY, Nil), _) :: body) => |
|
127 |
Some(body) |
|
128 |
case _ => None |
|
129 |
} |
|
130 |
} |
|
131 |
||
75393 | 132 |
object Root_Elem { |
67818
2457bea123e4
convenience to represent XML.Body as single XML.Elem;
wenzelm
parents:
67113
diff
changeset
|
133 |
def apply(body: Body): XML.Elem = XML.Elem(Markup(XML_ELEM, Nil), body) |
2457bea123e4
convenience to represent XML.Body as single XML.Elem;
wenzelm
parents:
67113
diff
changeset
|
134 |
def unapply(tree: Tree): Option[Body] = |
2457bea123e4
convenience to represent XML.Body as single XML.Elem;
wenzelm
parents:
67113
diff
changeset
|
135 |
tree match { |
2457bea123e4
convenience to represent XML.Body as single XML.Elem;
wenzelm
parents:
67113
diff
changeset
|
136 |
case XML.Elem(Markup(XML_ELEM, Nil), body) => Some(body) |
2457bea123e4
convenience to represent XML.Body as single XML.Elem;
wenzelm
parents:
67113
diff
changeset
|
137 |
case _ => None |
2457bea123e4
convenience to represent XML.Body as single XML.Elem;
wenzelm
parents:
67113
diff
changeset
|
138 |
} |
2457bea123e4
convenience to represent XML.Body as single XML.Elem;
wenzelm
parents:
67113
diff
changeset
|
139 |
} |
2457bea123e4
convenience to represent XML.Body as single XML.Elem;
wenzelm
parents:
67113
diff
changeset
|
140 |
|
49650
9fad6480300d
support for wrapped XML elements, which allows to preserve full markup tree information in to_XML/from_XML conversion;
wenzelm
parents:
49613
diff
changeset
|
141 |
|
9fad6480300d
support for wrapped XML elements, which allows to preserve full markup tree information in to_XML/from_XML conversion;
wenzelm
parents:
49613
diff
changeset
|
142 |
/* traverse text */ |
9fad6480300d
support for wrapped XML elements, which allows to preserve full markup tree information in to_XML/from_XML conversion;
wenzelm
parents:
49613
diff
changeset
|
143 |
|
80439 | 144 |
def traverse_text[A](body: Body, a: A, op: (A, String) => A): A = { |
80435 | 145 |
@tailrec def trav(x: A, list: List[Tree]): A = |
146 |
list match { |
|
147 |
case Nil => x |
|
80455 | 148 |
case XML.Wrapped_Elem_Body(body) :: rest => trav(x, body ::: rest) |
80435 | 149 |
case XML.Elem(_, body) :: rest => trav(x, body ::: rest) |
150 |
case XML.Text(s) :: rest => trav(op(x, s), rest) |
|
49650
9fad6480300d
support for wrapped XML elements, which allows to preserve full markup tree information in to_XML/from_XML conversion;
wenzelm
parents:
49613
diff
changeset
|
151 |
} |
80435 | 152 |
trav(a, body) |
49650
9fad6480300d
support for wrapped XML elements, which allows to preserve full markup tree information in to_XML/from_XML conversion;
wenzelm
parents:
49613
diff
changeset
|
153 |
} |
9fad6480300d
support for wrapped XML elements, which allows to preserve full markup tree information in to_XML/from_XML conversion;
wenzelm
parents:
49613
diff
changeset
|
154 |
|
80439 | 155 |
def text_length(body: Body): Int = traverse_text(body, 0, (n, s) => n + s.length) |
156 |
def symbol_length(body: Body): Int = traverse_text(body, 0, (n, s) => n + Symbol.length(s)) |
|
49650
9fad6480300d
support for wrapped XML elements, which allows to preserve full markup tree information in to_XML/from_XML conversion;
wenzelm
parents:
49613
diff
changeset
|
157 |
|
80457 | 158 |
def content_is_empty(body: Body): Boolean = |
159 |
traverse_text(body, true, (b, s) => b && s.isEmpty) |
|
160 |
||
161 |
def content_lines(body: Body): Int = { |
|
162 |
val n = traverse_text(body, 0, (n, s) => n + Library.count_newlines(s)) |
|
163 |
if (n == 0 && content_is_empty(body)) 0 else n + 1 |
|
164 |
} |
|
80456 | 165 |
|
80441 | 166 |
def content(body: Body): String = |
167 |
Library.string_builder(hint = text_length(body)) { text => |
|
168 |
traverse_text(body, (), (_, s) => text.append(s)) |
|
169 |
} |
|
49650
9fad6480300d
support for wrapped XML elements, which allows to preserve full markup tree information in to_XML/from_XML conversion;
wenzelm
parents:
49613
diff
changeset
|
170 |
|
9fad6480300d
support for wrapped XML elements, which allows to preserve full markup tree information in to_XML/from_XML conversion;
wenzelm
parents:
49613
diff
changeset
|
171 |
def content(tree: Tree): String = content(List(tree)) |
9fad6480300d
support for wrapped XML elements, which allows to preserve full markup tree information in to_XML/from_XML conversion;
wenzelm
parents:
49613
diff
changeset
|
172 |
|
9fad6480300d
support for wrapped XML elements, which allows to preserve full markup tree information in to_XML/from_XML conversion;
wenzelm
parents:
49613
diff
changeset
|
173 |
|
9fad6480300d
support for wrapped XML elements, which allows to preserve full markup tree information in to_XML/from_XML conversion;
wenzelm
parents:
49613
diff
changeset
|
174 |
|
9fad6480300d
support for wrapped XML elements, which allows to preserve full markup tree information in to_XML/from_XML conversion;
wenzelm
parents:
49613
diff
changeset
|
175 |
/** string representation **/ |
29203 | 176 |
|
69804 | 177 |
val header: String = "<?xml version=\"1.0\" encoding=\"utf-8\"?>\n" |
178 |
||
80429 | 179 |
class Output(builder: StringBuilder) extends Traversal { |
180 |
def string(str: String, permissive: Boolean = false): Unit = { |
|
181 |
if (str == null) { builder ++= str } |
|
182 |
else { |
|
80432 | 183 |
str foreach { |
184 |
case '<' => builder ++= "<" |
|
185 |
case '>' => builder ++= ">" |
|
186 |
case '&' => builder ++= "&" |
|
187 |
case '"' if !permissive => builder ++= """ |
|
188 |
case '\'' if !permissive => builder ++= "'" |
|
189 |
case c => builder += c |
|
80429 | 190 |
} |
191 |
} |
|
65990 | 192 |
} |
80429 | 193 |
|
194 |
override def text(str: String): Unit = string(str) |
|
65990 | 195 |
|
80429 | 196 |
override def elem(markup: Markup, end: Boolean = false): Unit = { |
197 |
builder += '<' |
|
198 |
builder ++= markup.name |
|
199 |
for ((a, b) <- markup.properties) { |
|
200 |
builder += ' ' |
|
201 |
builder ++= a |
|
202 |
builder += '=' |
|
203 |
builder += '"' |
|
204 |
string(b) |
|
205 |
builder += '"' |
|
206 |
} |
|
207 |
if (end) builder += '/' |
|
208 |
builder += '>' |
|
209 |
} |
|
210 |
||
211 |
def end_elem(name: String): Unit = { |
|
212 |
builder += '<' |
|
213 |
builder += '/' |
|
214 |
builder ++= name |
|
215 |
builder += '>' |
|
216 |
} |
|
217 |
||
80430 | 218 |
def result(ts: List[Tree]): String = { traverse(ts); builder.toString } |
65990 | 219 |
} |
220 |
||
80429 | 221 |
def string_of_body(body: Body): String = |
222 |
if (body.isEmpty) "" |
|
223 |
else new Output(new StringBuilder).result(body) |
|
29203 | 224 |
|
38268
beb86b805590
more uniform XML/YXML string_of_body/string_of_tree;
wenzelm
parents:
38267
diff
changeset
|
225 |
def string_of_tree(tree: XML.Tree): String = string_of_body(List(tree)) |
27941 | 226 |
|
73528
c337c798f64c
clarified HTML template (see also 04cb7e02ca38): avoid odd patching of sources;
wenzelm
parents:
73359
diff
changeset
|
227 |
def text(s: String): String = string_of_tree(XML.Text(s)) |
27941 | 228 |
|
44808 | 229 |
|
80429 | 230 |
|
68265 | 231 |
/** cache **/ |
34108 | 232 |
|
75393 | 233 |
object Cache { |
73024 | 234 |
def make( |
76351
2cee31cd92f0
generic support for XZ and Zstd compression in Isabelle/Scala;
wenzelm
parents:
75436
diff
changeset
|
235 |
compress: Compress.Cache = Compress.Cache.make(), |
74731
161e84e6b40a
just one cache, via HTML_Context, via Sessions.Store or Session;
wenzelm
parents:
74683
diff
changeset
|
236 |
max_string: Int = isabelle.Cache.default_max_string, |
73024 | 237 |
initial_size: Int = isabelle.Cache.default_initial_size): Cache = |
76351
2cee31cd92f0
generic support for XZ and Zstd compression in Isabelle/Scala;
wenzelm
parents:
75436
diff
changeset
|
238 |
new Cache(compress, max_string, initial_size) |
68169 | 239 |
|
76351
2cee31cd92f0
generic support for XZ and Zstd compression in Isabelle/Scala;
wenzelm
parents:
75436
diff
changeset
|
240 |
val none: Cache = make(Compress.Cache.none, max_string = 0) |
73024 | 241 |
} |
242 |
||
76351
2cee31cd92f0
generic support for XZ and Zstd compression in Isabelle/Scala;
wenzelm
parents:
75436
diff
changeset
|
243 |
class Cache(val compress: Compress.Cache, max_string: Int, initial_size: Int) |
75393 | 244 |
extends isabelle.Cache(max_string, initial_size) { |
245 |
protected def cache_props(x: Properties.T): Properties.T = { |
|
44704
528d635ef6f0
synchronous XML.Cache without actor -- potentially more efficient on machines with few cores;
wenzelm
parents:
44698
diff
changeset
|
246 |
if (x.isEmpty) x |
528d635ef6f0
synchronous XML.Cache without actor -- potentially more efficient on machines with few cores;
wenzelm
parents:
44698
diff
changeset
|
247 |
else |
34133 | 248 |
lookup(x) match { |
249 |
case Some(y) => y |
|
65903 | 250 |
case None => store(x.map(p => (Library.isolate_substring(p._1).intern, cache_string(p._2)))) |
34133 | 251 |
} |
68265 | 252 |
} |
253 |
||
75393 | 254 |
protected def cache_markup(x: Markup): Markup = { |
44704
528d635ef6f0
synchronous XML.Cache without actor -- potentially more efficient on machines with few cores;
wenzelm
parents:
44698
diff
changeset
|
255 |
lookup(x) match { |
528d635ef6f0
synchronous XML.Cache without actor -- potentially more efficient on machines with few cores;
wenzelm
parents:
44698
diff
changeset
|
256 |
case Some(y) => y |
528d635ef6f0
synchronous XML.Cache without actor -- potentially more efficient on machines with few cores;
wenzelm
parents:
44698
diff
changeset
|
257 |
case None => |
528d635ef6f0
synchronous XML.Cache without actor -- potentially more efficient on machines with few cores;
wenzelm
parents:
44698
diff
changeset
|
258 |
x match { |
528d635ef6f0
synchronous XML.Cache without actor -- potentially more efficient on machines with few cores;
wenzelm
parents:
44698
diff
changeset
|
259 |
case Markup(name, props) => |
51663 | 260 |
store(Markup(cache_string(name), cache_props(props))) |
44704
528d635ef6f0
synchronous XML.Cache without actor -- potentially more efficient on machines with few cores;
wenzelm
parents:
44698
diff
changeset
|
261 |
} |
528d635ef6f0
synchronous XML.Cache without actor -- potentially more efficient on machines with few cores;
wenzelm
parents:
44698
diff
changeset
|
262 |
} |
68265 | 263 |
} |
264 |
||
75393 | 265 |
protected def cache_tree(x: XML.Tree): XML.Tree = { |
44704
528d635ef6f0
synchronous XML.Cache without actor -- potentially more efficient on machines with few cores;
wenzelm
parents:
44698
diff
changeset
|
266 |
lookup(x) match { |
528d635ef6f0
synchronous XML.Cache without actor -- potentially more efficient on machines with few cores;
wenzelm
parents:
44698
diff
changeset
|
267 |
case Some(y) => y |
528d635ef6f0
synchronous XML.Cache without actor -- potentially more efficient on machines with few cores;
wenzelm
parents:
44698
diff
changeset
|
268 |
case None => |
528d635ef6f0
synchronous XML.Cache without actor -- potentially more efficient on machines with few cores;
wenzelm
parents:
44698
diff
changeset
|
269 |
x match { |
528d635ef6f0
synchronous XML.Cache without actor -- potentially more efficient on machines with few cores;
wenzelm
parents:
44698
diff
changeset
|
270 |
case XML.Elem(markup, body) => |
51663 | 271 |
store(XML.Elem(cache_markup(markup), cache_body(body))) |
272 |
case XML.Text(text) => store(XML.Text(cache_string(text))) |
|
44704
528d635ef6f0
synchronous XML.Cache without actor -- potentially more efficient on machines with few cores;
wenzelm
parents:
44698
diff
changeset
|
273 |
} |
528d635ef6f0
synchronous XML.Cache without actor -- potentially more efficient on machines with few cores;
wenzelm
parents:
44698
diff
changeset
|
274 |
} |
68265 | 275 |
} |
276 |
||
75393 | 277 |
protected def cache_body(x: XML.Body): XML.Body = { |
44704
528d635ef6f0
synchronous XML.Cache without actor -- potentially more efficient on machines with few cores;
wenzelm
parents:
44698
diff
changeset
|
278 |
if (x.isEmpty) x |
528d635ef6f0
synchronous XML.Cache without actor -- potentially more efficient on machines with few cores;
wenzelm
parents:
44698
diff
changeset
|
279 |
else |
34133 | 280 |
lookup(x) match { |
281 |
case Some(y) => y |
|
71601 | 282 |
case None => x.map(cache_tree) |
34133 | 283 |
} |
68265 | 284 |
} |
38446
9d59dab38fef
XML.Cache: pipe-lined (thread-safe) version using actor;
wenzelm
parents:
38268
diff
changeset
|
285 |
|
73030 | 286 |
// support hash-consing |
287 |
def tree0(x: XML.Tree): XML.Tree = |
|
288 |
if (no_cache) x else synchronized { lookup(x) getOrElse store(x) } |
|
289 |
||
38446
9d59dab38fef
XML.Cache: pipe-lined (thread-safe) version using actor;
wenzelm
parents:
38268
diff
changeset
|
290 |
// main methods |
73024 | 291 |
def props(x: Properties.T): Properties.T = |
292 |
if (no_cache) x else synchronized { cache_props(x) } |
|
293 |
def markup(x: Markup): Markup = |
|
294 |
if (no_cache) x else synchronized { cache_markup(x) } |
|
295 |
def tree(x: XML.Tree): XML.Tree = |
|
296 |
if (no_cache) x else synchronized { cache_tree(x) } |
|
297 |
def body(x: XML.Body): XML.Body = |
|
298 |
if (no_cache) x else synchronized { cache_body(x) } |
|
299 |
def elem(x: XML.Elem): XML.Elem = |
|
300 |
if (no_cache) x else synchronized { cache_tree(x).asInstanceOf[XML.Elem] } |
|
34108 | 301 |
} |
302 |
||
303 |
||
43767 | 304 |
|
305 |
/** XML as data representation language **/ |
|
306 |
||
51987 | 307 |
abstract class Error(s: String) extends Exception(s) |
308 |
class XML_Atom(s: String) extends Error(s) |
|
309 |
class XML_Body(body: XML.Body) extends Error("") |
|
43767 | 310 |
|
75393 | 311 |
object Encode { |
43767 | 312 |
type T[A] = A => XML.Body |
65334 | 313 |
type V[A] = PartialFunction[A, (List[String], XML.Body)] |
70828 | 314 |
type P[A] = PartialFunction[A, List[String]] |
43767 | 315 |
|
316 |
||
43778
ce9189450447
more compact representation of XML data (notably sort/typ/term), using properties as vector of atomic values;
wenzelm
parents:
43768
diff
changeset
|
317 |
/* atomic values */ |
43767 | 318 |
|
57909
0fb331032f02
more compact representation of special string values;
wenzelm
parents:
55618
diff
changeset
|
319 |
def long_atom(i: Long): String = Library.signed_string_of_long(i) |
43767 | 320 |
|
57909
0fb331032f02
more compact representation of special string values;
wenzelm
parents:
55618
diff
changeset
|
321 |
def int_atom(i: Int): String = Library.signed_string_of_int(i) |
43767 | 322 |
|
43778
ce9189450447
more compact representation of XML data (notably sort/typ/term), using properties as vector of atomic values;
wenzelm
parents:
43768
diff
changeset
|
323 |
def bool_atom(b: Boolean): String = if (b) "1" else "0" |
43767 | 324 |
|
43778
ce9189450447
more compact representation of XML data (notably sort/typ/term), using properties as vector of atomic values;
wenzelm
parents:
43768
diff
changeset
|
325 |
def unit_atom(u: Unit) = "" |
43767 | 326 |
|
327 |
||
328 |
/* structural nodes */ |
|
329 |
||
330 |
private def node(ts: XML.Body): XML.Tree = XML.Elem(Markup(":", Nil), ts) |
|
331 |
||
43781 | 332 |
private def vector(xs: List[String]): XML.Attributes = |
46839
f7232c078fa5
simplified -- plain map_index is sufficient (pointed out by Enrico Tassi);
wenzelm
parents:
45673
diff
changeset
|
333 |
xs.zipWithIndex.map({ case (x, i) => (int_atom(i), x) }) |
43778
ce9189450447
more compact representation of XML data (notably sort/typ/term), using properties as vector of atomic values;
wenzelm
parents:
43768
diff
changeset
|
334 |
|
ce9189450447
more compact representation of XML data (notably sort/typ/term), using properties as vector of atomic values;
wenzelm
parents:
43768
diff
changeset
|
335 |
private def tagged(tag: Int, data: (List[String], XML.Body)): XML.Tree = |
ce9189450447
more compact representation of XML data (notably sort/typ/term), using properties as vector of atomic values;
wenzelm
parents:
43768
diff
changeset
|
336 |
XML.Elem(Markup(int_atom(tag), vector(data._1)), data._2) |
43767 | 337 |
|
338 |
||
339 |
/* representation of standard types */ |
|
340 |
||
80461 | 341 |
val self: T[XML.Body] = identity |
342 |
||
65333 | 343 |
val tree: T[XML.Tree] = (t => List(t)) |
344 |
||
43780 | 345 |
val properties: T[Properties.T] = |
43767 | 346 |
(props => List(XML.Elem(Markup(":", props), Nil))) |
347 |
||
80458 | 348 |
val string: T[String] = XML.string |
43767 | 349 |
|
350 |
val long: T[Long] = (x => string(long_atom(x))) |
|
351 |
||
352 |
val int: T[Int] = (x => string(int_atom(x))) |
|
353 |
||
354 |
val bool: T[Boolean] = (x => string(bool_atom(x))) |
|
355 |
||
356 |
val unit: T[Unit] = (x => string(unit_atom(x))) |
|
357 |
||
358 |
def pair[A, B](f: T[A], g: T[B]): T[(A, B)] = |
|
359 |
(x => List(node(f(x._1)), node(g(x._2)))) |
|
360 |
||
361 |
def triple[A, B, C](f: T[A], g: T[B], h: T[C]): T[(A, B, C)] = |
|
362 |
(x => List(node(f(x._1)), node(g(x._2)), node(h(x._3)))) |
|
363 |
||
364 |
def list[A](f: T[A]): T[List[A]] = |
|
365 |
(xs => xs.map((x: A) => node(f(x)))) |
|
366 |
||
75393 | 367 |
def option[A](f: T[A]): T[Option[A]] = { |
43767 | 368 |
case None => Nil |
369 |
case Some(x) => List(node(f(x))) |
|
370 |
} |
|
371 |
||
75393 | 372 |
def variant[A](fs: List[V[A]]): T[A] = { |
43767 | 373 |
case x => |
374 |
val (f, tag) = fs.iterator.zipWithIndex.find(p => p._1.isDefinedAt(x)).get |
|
375 |
List(tagged(tag, f(x))) |
|
376 |
} |
|
377 |
} |
|
378 |
||
75393 | 379 |
object Decode { |
43767 | 380 |
type T[A] = XML.Body => A |
75436 | 381 |
type V[A] = PartialFunction[(List[String], XML.Body), A] |
70828 | 382 |
type P[A] = PartialFunction[List[String], A] |
43767 | 383 |
|
384 |
||
43778
ce9189450447
more compact representation of XML data (notably sort/typ/term), using properties as vector of atomic values;
wenzelm
parents:
43768
diff
changeset
|
385 |
/* atomic values */ |
43767 | 386 |
|
43778
ce9189450447
more compact representation of XML data (notably sort/typ/term), using properties as vector of atomic values;
wenzelm
parents:
43768
diff
changeset
|
387 |
def long_atom(s: String): Long = |
43767 | 388 |
try { java.lang.Long.parseLong(s) } |
389 |
catch { case e: NumberFormatException => throw new XML_Atom(s) } |
|
390 |
||
43778
ce9189450447
more compact representation of XML data (notably sort/typ/term), using properties as vector of atomic values;
wenzelm
parents:
43768
diff
changeset
|
391 |
def int_atom(s: String): Int = |
43767 | 392 |
try { Integer.parseInt(s) } |
393 |
catch { case e: NumberFormatException => throw new XML_Atom(s) } |
|
394 |
||
43778
ce9189450447
more compact representation of XML data (notably sort/typ/term), using properties as vector of atomic values;
wenzelm
parents:
43768
diff
changeset
|
395 |
def bool_atom(s: String): Boolean = |
43767 | 396 |
if (s == "1") true |
397 |
else if (s == "0") false |
|
398 |
else throw new XML_Atom(s) |
|
399 |
||
43778
ce9189450447
more compact representation of XML data (notably sort/typ/term), using properties as vector of atomic values;
wenzelm
parents:
43768
diff
changeset
|
400 |
def unit_atom(s: String): Unit = |
43767 | 401 |
if (s == "") () else throw new XML_Atom(s) |
402 |
||
403 |
||
404 |
/* structural nodes */ |
|
405 |
||
406 |
private def node(t: XML.Tree): XML.Body = |
|
407 |
t match { |
|
408 |
case XML.Elem(Markup(":", Nil), ts) => ts |
|
409 |
case _ => throw new XML_Body(List(t)) |
|
410 |
} |
|
411 |
||
43781 | 412 |
private def vector(atts: XML.Attributes): List[String] = |
46839
f7232c078fa5
simplified -- plain map_index is sufficient (pointed out by Enrico Tassi);
wenzelm
parents:
45673
diff
changeset
|
413 |
atts.iterator.zipWithIndex.map( |
f7232c078fa5
simplified -- plain map_index is sufficient (pointed out by Enrico Tassi);
wenzelm
parents:
45673
diff
changeset
|
414 |
{ case ((a, x), i) => if (int_atom(a) == i) x else throw new XML_Atom(a) }).toList |
43778
ce9189450447
more compact representation of XML data (notably sort/typ/term), using properties as vector of atomic values;
wenzelm
parents:
43768
diff
changeset
|
415 |
|
ce9189450447
more compact representation of XML data (notably sort/typ/term), using properties as vector of atomic values;
wenzelm
parents:
43768
diff
changeset
|
416 |
private def tagged(t: XML.Tree): (Int, (List[String], XML.Body)) = |
43767 | 417 |
t match { |
43781 | 418 |
case XML.Elem(Markup(name, atts), ts) => (int_atom(name), (vector(atts), ts)) |
43767 | 419 |
case _ => throw new XML_Body(List(t)) |
420 |
} |
|
421 |
||
422 |
||
423 |
/* representation of standard types */ |
|
424 |
||
80461 | 425 |
val self: T[XML.Body] = identity |
426 |
||
75393 | 427 |
val tree: T[XML.Tree] = { |
65333 | 428 |
case List(t) => t |
429 |
case ts => throw new XML_Body(ts) |
|
430 |
} |
|
431 |
||
75393 | 432 |
val properties: T[Properties.T] = { |
43767 | 433 |
case List(XML.Elem(Markup(":", props), Nil)) => props |
434 |
case ts => throw new XML_Body(ts) |
|
435 |
} |
|
436 |
||
75393 | 437 |
val string: T[String] = { |
43767 | 438 |
case Nil => "" |
439 |
case List(XML.Text(s)) => s |
|
440 |
case ts => throw new XML_Body(ts) |
|
441 |
} |
|
442 |
||
443 |
val long: T[Long] = (x => long_atom(string(x))) |
|
444 |
||
445 |
val int: T[Int] = (x => int_atom(string(x))) |
|
446 |
||
447 |
val bool: T[Boolean] = (x => bool_atom(string(x))) |
|
448 |
||
449 |
val unit: T[Unit] = (x => unit_atom(string(x))) |
|
450 |
||
75393 | 451 |
def pair[A, B](f: T[A], g: T[B]): T[(A, B)] = { |
43767 | 452 |
case List(t1, t2) => (f(node(t1)), g(node(t2))) |
453 |
case ts => throw new XML_Body(ts) |
|
454 |
} |
|
455 |
||
75393 | 456 |
def triple[A, B, C](f: T[A], g: T[B], h: T[C]): T[(A, B, C)] = { |
43767 | 457 |
case List(t1, t2, t3) => (f(node(t1)), g(node(t2)), h(node(t3))) |
458 |
case ts => throw new XML_Body(ts) |
|
459 |
} |
|
460 |
||
461 |
def list[A](f: T[A]): T[List[A]] = |
|
462 |
(ts => ts.map(t => f(node(t)))) |
|
463 |
||
75393 | 464 |
def option[A](f: T[A]): T[Option[A]] = { |
43767 | 465 |
case Nil => None |
466 |
case List(t) => Some(f(node(t))) |
|
467 |
case ts => throw new XML_Body(ts) |
|
468 |
} |
|
469 |
||
75393 | 470 |
def variant[A](fs: List[V[A]]): T[A] = { |
43767 | 471 |
case List(t) => |
43778
ce9189450447
more compact representation of XML data (notably sort/typ/term), using properties as vector of atomic values;
wenzelm
parents:
43768
diff
changeset
|
472 |
val (tag, (xs, ts)) = tagged(t) |
43768 | 473 |
val f = |
474 |
try { fs(tag) } |
|
475 |
catch { case _: IndexOutOfBoundsException => throw new XML_Body(List(t)) } |
|
43778
ce9189450447
more compact representation of XML data (notably sort/typ/term), using properties as vector of atomic values;
wenzelm
parents:
43768
diff
changeset
|
476 |
f(xs, ts) |
43767 | 477 |
case ts => throw new XML_Body(ts) |
478 |
} |
|
479 |
} |
|
27931 | 480 |
} |