116 lines
3.3 KiB
Factor
Executable File
116 lines
3.3 KiB
Factor
Executable File
! Copyright (C) 2005, 2006 Daniel Ehrenberg
|
|
! See http://factorcode.org/license.txt for BSD license.
|
|
USING: kernel namespaces sequences words io assocs
|
|
quotations strings parser arrays xml.data xml.writer debugger
|
|
splitting vectors sequences.deep ;
|
|
IN: xml.utilities
|
|
|
|
! * System for words specialized on tag names
|
|
|
|
TUPLE: process-missing process tag ;
|
|
M: process-missing error.
|
|
"Tag <" write
|
|
dup process-missing-tag print-name
|
|
"> not implemented on process process " write
|
|
process-missing-process word-name print ;
|
|
|
|
: run-process ( tag word -- )
|
|
2dup "xtable" word-prop
|
|
>r dup name-tag r> at* [ 2nip call ] [
|
|
drop \ process-missing construct-boa throw
|
|
] if ;
|
|
|
|
: PROCESS:
|
|
CREATE
|
|
dup H{ } clone "xtable" set-word-prop
|
|
dup [ run-process ] curry define ; parsing
|
|
|
|
: TAG:
|
|
scan scan-word
|
|
parse-definition
|
|
swap "xtable" word-prop
|
|
rot "/" split [ >r 2dup r> swap set-at ] each 2drop ;
|
|
parsing
|
|
|
|
|
|
! * Common utility functions
|
|
|
|
: build-tag* ( items name -- tag )
|
|
assure-name swap >r f r> <tag> ;
|
|
|
|
: build-tag ( item name -- tag )
|
|
>r 1array r> build-tag* ;
|
|
|
|
: standard-prolog ( -- prolog )
|
|
T{ prolog f "1.0" "iso-8859-1" f } ;
|
|
|
|
: build-xml ( tag -- xml )
|
|
standard-prolog { } rot { } <xml> ;
|
|
|
|
: children>string ( tag -- string )
|
|
tag-children
|
|
dup [ string? ] all?
|
|
[ "XML tag unexpectedly contains non-text children" throw ] unless
|
|
concat ;
|
|
|
|
: children-tags ( tag -- sequence )
|
|
tag-children [ tag? ] subset ;
|
|
|
|
: first-child-tag ( tag -- tag )
|
|
tag-children [ tag? ] find nip ;
|
|
|
|
! * Accessing part of an XML document
|
|
! for tag- words, a start means that it searches all children
|
|
! and no star searches only direct children
|
|
|
|
: tag-named? ( name elem -- ? )
|
|
dup tag? [ names-match? ] [ 2drop f ] if ;
|
|
|
|
: tags@ ( tag name -- children name )
|
|
>r { } like r> assure-name ;
|
|
|
|
: deep-tag-named ( tag name/string -- matching-tag )
|
|
assure-name [ swap tag-named? ] curry deep-find ;
|
|
|
|
: deep-tags-named ( tag name/string -- tags-seq )
|
|
tags@ [ swap tag-named? ] curry deep-subset ;
|
|
|
|
: tag-named ( tag name/string -- matching-tag )
|
|
! like get-name-tag but only looks at direct children,
|
|
! not all the children down the tree.
|
|
assure-name swap [ tag-named? ] with find nip ;
|
|
|
|
: tags-named ( tag name/string -- tags-seq )
|
|
tags@ swap [ tag-named? ] with subset ;
|
|
|
|
: tag-with-attr? ( elem attr-value attr-name -- ? )
|
|
rot dup tag? [ at = ] [ 3drop f ] if ;
|
|
|
|
: tag-with-attr ( tag attr-value attr-name -- matching-tag )
|
|
assure-name [ tag-with-attr? ] 2curry find nip ;
|
|
|
|
: tags-with-attr ( tag attr-value attr-name -- tags-seq )
|
|
tags@ [ tag-with-attr? ] 2curry subset tag-children ;
|
|
|
|
: deep-tag-with-attr ( tag attr-value attr-name -- matching-tag )
|
|
assure-name [ tag-with-attr? ] 2curry deep-find ;
|
|
|
|
: deep-tags-with-attr ( tag attr-value attr-name -- tags-seq )
|
|
tags@ [ tag-with-attr? ] 2curry deep-subset ;
|
|
|
|
: get-id ( tag id -- elem ) ! elem=tag.getElementById(id)
|
|
"id" deep-tag-with-attr ;
|
|
|
|
: deep-tags-named-with-attr ( tag tag-name attr-value attr-name -- tags )
|
|
>r >r deep-tags-named r> r> tags-with-attr ;
|
|
|
|
: assert-tag ( name name -- )
|
|
names-match? [ "Unexpected XML tag found" throw ] unless ;
|
|
|
|
: insert-children ( children tag -- )
|
|
dup tag-children [ push-all ]
|
|
[ >r V{ } like r> set-tag-children ] if ;
|
|
|
|
: insert-child ( child tag -- )
|
|
>r 1vector r> insert-children ;
|