RE: Nodes and counting, a solution

["Pawson, David" <DPawson@xxxxxxxxxxx>]

Thanks for the help folks.

Final version, working: Implements the 'if a sibling exists called
'name'
boolean.
[ Tony, is this a candidate for the cookbook?]

;;
;; sibling-with-name (name)
;;

(define (sibling-with-name  name)
(not (node-list-empty? 
	(select-elements(children (parent (current-node))) name))))


(element title (make paragraph
	use: para-style
	quadding: 'center
	space-after: (if (sibling-with-name "child2") 0pt 2em) 
	(process-children)))


Getting to like dsssl. 
(Even got a scheme programmers manual on order!)

Is it just me, but there would appear to be about a million and one ways
of doing a job a la Jade. C would have left far fewer sensible choices.

Regards, DaveP

 DSSSList info and archive:  http://www.mulberrytech.com/dsssl/dssslist