/usr/share/sgml/OpenJade/builtins.dsl is in openjade 1.4devel1-21.1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 | ;; clause 8.5.3.5
(define (caar x) (car (car x)) )
(define (cadr x) (list-ref x 1) )
(define (cdar x) (cdr (car x)) )
(define (cddr x) (cdr (cdr x)) )
(define (caaar x) (car (car (car x))) )
(define (caadr x) (car (car (cdr x))) )
(define (cadar x) (car (cdr (car x))) )
(define (caddr x) (list-ref x 2) )
(define (cdaar x) (cdr (car (car x))) )
(define (cdadr x) (cdr (car (cdr x))) )
(define (cddar x) (cdr (cdr (car x))) )
(define (cdddr x) (cdr (cdr (cdr x))) )
(define (caaaar x) (car (car (car (car x)))) )
(define (caaadr x) (car (car (car (cdr x)))) )
(define (caadar x) (car (car (cdr (car x)))) )
(define (cadaar x) (car (cdr (car (car x)))) )
(define (cadadr x) (car (cdr (car (cdr x)))) )
(define (caddar x) (car (cdr (cdr (car x)))) )
(define (cadddr x) (list-ref x 3) )
(define (cdaaar x) (cdr (car (car (car x)))) )
(define (cdaadr x) (cdr (car (car (cdr x)))) )
(define (cdadar x) (cdr (car (cdr (car x)))) )
(define (cddaar x) (cdr (cdr (car (car x)))) )
(define (cddadr x) (cdr (cdr (car (cdr x)))) )
(define (cdddar x) (cdr (cdr (cdr (car x)))) )
(define (cddddr x) (cdr (cdr (cdr (cdr x)))) )
;; clause 8.5.8.4
(define (char>? c1 c2) (char<? c2 c1))
(define (char>=? c1 c2) (char<=? c2 c1))
;; clause 8.5.8.5
(define internal: (ci-equiv proc)
(lambda (c1 c2)
(proc (char-upcase c1) (char-upcase c2))
)
)
(define char-ci=? (ci-equiv char=?))
(define char-ci<? (ci-equiv char<?))
(define char-ci>? (ci-equiv char>?))
(define char-ci<=? (ci-equiv char<=?))
(define char-ci>=? (ci-equiv char>=?))
;; clause 8.5.9.6
(define internal: (upcase-string s)
(list->string
(map char-upcase
(string->list s)
)
)
)
(define internal: (ci-string-equiv proc)
(lambda (s1 s2)
(proc (upcase-string s1) (upcase-string s2))
)
)
(define (string>? s1 s2) (string<? s2 s1))
(define (string>=? s1 s2) (string<=? s2 s1))
(define string-ci=? (ci-string-equiv string=?))
(define string-ci<? (ci-string-equiv string<?))
(define string-ci>? (ci-string-equiv string>?))
(define string-ci<=? (ci-string-equiv string<=?))
(define string-ci>=? (ci-string-equiv string>=?))
;; clause 8.5.10.3
(define (map f #!rest xs)
(let ((map1 (lambda (f xs)
(let loop ((xs xs))
(if (null? xs)
'()
(cons (f (car xs))
(loop (cdr xs))))))))
(cond ((null? xs)
'())
((null? (cdr xs))
(map1 f (car xs)))
(else
(let loop ((xs xs))
(if (null? (car xs))
'()
(cons (apply f (map1 car xs))
(loop (map1 cdr xs)))))))))
;; clause 10.1.1
(define (current-root) (node-property 'grove-root (current-node)))
;; clause 10.2.2
(define (node-list-reduce nl combine init)
(if (node-list-empty? nl)
init
(node-list-reduce (node-list-rest nl)
combine
(combine init (node-list-first nl)))))
(define (node-list-remove-duplicates nl)
(node-list-reduce nl
(lambda (result snl)
(if (node-list-contains? result snl)
result
(node-list result snl)))
(empty-node-list)))
(define internal: (reduce list combine init)
(let loop ((result init)
(list list))
(if (null? list)
result
(loop (combine result (car list))
(cdr list)))))
(define (node-list-union #!rest args)
(reduce args
(lambda (nl1 nl2)
(node-list-reduce nl2
(lambda (result snl)
(if (node-list-contains? result
snl)
result
(node-list result snl)))
nl1))
(empty-node-list)))
(define (node-list-intersection #!rest args)
(if (null? args)
(empty-node-list)
(reduce (cdr args)
(lambda (nl1 nl2)
(node-list-reduce nl1
(lambda (result snl)
(if (node-list-contains? nl2 snl)
(node-list result snl)
result))
(empty-node-list)))
(node-list-remove-duplicates (car args)))))
(define (node-list-difference #!rest args)
(if (null? args)
(empty-node-list)
(reduce (cdr args)
(lambda (nl1 nl2)
(node-list-reduce nl1
(lambda (result snl)
(if (node-list-contains? nl2 snl)
result
(node-list result snl)))
(empty-node-list)))
(node-list-remove-duplicates (car args)))))
(define (node-list-symmetric-difference #!rest args)
(if (null? args)
(empty-node-list)
(reduce (cdr args)
(lambda (nl1 nl2)
(node-list-difference (node-list-union nl1 nl2)
(node-list-intersection nl1 nl2)))
(node-list-remove-duplicates (car args)))))
(define (node-list-union-map proc nl)
(node-list-reduce nl
(lambda (result snl)
(node-list-union (proc snl)
result))
(empty-node-list)))
(define (node-list-some? proc nl)
(node-list-reduce nl
(lambda (result snl)
(if (or result (proc snl))
#t
#f))
#f))
(define (node-list-every? proc nl)
(node-list-reduce nl
(lambda (result snl)
(if (and result (proc snl))
#t
#f))
#t))
(define (node-list->list nl)
(reverse (node-list-reduce nl
(lambda (result snl)
(cons snl result))
'())))
(define (node-list-tail nl k)
(cond
((< k 0) (empty-node-list))
((zero? k) nl)
(else
(node-list-tail (node-list-rest nl) (- k 1)))))
(define (node-list-head nl k)
(if (zero? k)
(empty-node-list)
(node-list (node-list-first nl)
(node-list-head (node-list-rest nl) (- k 1)))))
;; ^^^^^^^
;; missing in standard
(define (node-list-sublist nl i j)
(node-list-head (node-list-tail nl i) (- j i)))
(define (node-list-count nl)
(node-list-length (node-list-remove-duplicates nl)))
(define (node-list-last nl)
(node-list-ref nl
(- (node-list-length nl) 1)))
;; clause 10.2.3
(define (node-list-property prop nl)
(node-list-map (lambda (snl)
(node-property prop snl default: (empty-node-list)))
nl))
(define (origin nl)
(node-list-property 'origin nl))
(define (origin-to-subnode-rel snl)
(node-property 'origin-to-subnode-rel-property-name snl default: #f))
(define (tree-root nl)
(node-list-property 'tree-root nl))
(define (grove-root nl)
(node-list-property 'grove-root nl))
(define (source nl)
(node-list-property 'source nl))
(define (ancestors nl)
(node-list-map (lambda (snl)
(let loop ((cur (parent snl))
(result (empty-node-list)))
(if (node-list-empty? cur)
result
(loop (parent cur)
(node-list cur result)))))
nl))
(define (grove-root-path nl)
(node-list-map (lambda (snl)
(let loop ((cur (origin snl))
(result (empty-node-list)))
(if (node-list-empty? cur)
result
(loop (origin cur)
(node-list cur result)))))
nl))
(define (rsiblings nl)
(node-list-map (lambda (snl)
(let ((rel (origin-to-subnode-rel snl)))
(if rel
(node-property rel
(origin snl)
default: (empty-node-list))
snl)))
nl))
(define (ipreced nl)
(node-list-map (lambda (snl)
(let loop ((prev (empty-node-list))
(rest (rsiblings snl)))
(cond ((node-list-empty? rest)
(empty-node-list))
((node-list=? (node-list-first rest) snl)
prev)
(else
(loop (node-list-first rest)
(node-list-rest rest))))))
nl))
(define (ifollow nl)
(node-list-map (lambda (snl)
(let loop ((rest (rsiblings snl)))
(cond ((node-list-empty? rest)
(empty-node-list))
((node-list=? (node-list-first rest) snl)
(node-list-first (node-list-rest rest)))
(else
(loop (node-list-rest rest))))))
nl))
(define (grove-before? snl1 snl2)
(let ((sorted
(node-list-intersection (subgrove (grove-root snl1))
(node-list snl1 snl2))))
(and (= (node-list-length sorted) 2)
(node-list=? (node-list-first sorted) snl1))))
(define (sort-in-tree-order nl)
(node-list-intersection (subtree (tree-root nl))
nl))
(define (tree-before? snl1 snl2)
(let ((sorted
(sort-in-tree-order (node-list snl1 snl2))))
(and (= (node-list-length sorted) 2)
(node-list=? (node-list-first sorted) snl1))))
(define (tree-before nl)
(node-list-map (lambda (snl)
(node-list-filter (lambda (x)
(tree-before? x snl))
(subtree (tree-root snl))))
nl))
(define (property-lookup prop snl if-present if-not-present)
(let ((val (node-property prop snl default: #f)))
(cond
(val (if-present val))
((node-property prop snl default: #t) (if-not-present val))
(else (if-present val)))))
(define (select-by-property nl prop proc)
(node-list-filter (lambda (snl)
(let ((val (node-property prop snl default: #f)))
(and (not (node-list? val))
(proc val))))
nl))
(define (select-by-null-property nl prop)
(node-list-filter (lambda (snl)
(let ((val1 (node-property prop snl null: #f))
(val2 (node-property prop snl null: #t)))
(and (not val1) val2)))
nl))
(define (select-by-missing-property nl prop)
(node-list-filter (lambda (snl)
(let ((val1 (node-property prop snl
default: #f
null: #t))
(val2 (node-property prop snl
default: #t
null: #f)))
(and (not val1) val2)))
nl))
;; clause 10.2.5
(define (attribute name nl)
(node-list-map (lambda (snl)
(named-node name (attributes snl)))
nl))
(define (referent nl)
(node-list-property 'referent nl))
(define (q-element pattern #!optional (nl (current-node)))
(select-elements (subgrove nl) pattern))
(define (q-class sym #!optional (nl (current-node)))
(node-list-filter (lambda (snl)
(equal? (node-property 'class-name snl) sym))
(subgrove nl)))
(define (q-sdata string #!optional (nl (current-node)))
(node-list-filter (lambda (snl)
(and (equal? (node-property 'class-name snl) 'sdata)
(equal? (node-property 'system-data snl) string)))
(subgrove nl)))
|