Subject: Re: searching for closest previous element From: Norman Walsh <norm@xxxxxxxxxxxxx> Date: Wed, 18 Mar 1998 12:38:27 -0500 |
| | "Reverse" takes a lot of time with many elements. But there seems no | way around it: there's no quick way to access the last node in a node | list, so that I can walk the tree list backwards. From dblib.dsl: (define (node-list-last nl) ;; REFENTRY ;; PURP Implements node-list-last as per ISO/IEC 10179:1996 ;; DESC ;; Implements 'node-list-last' as per ISO/IEC 10179:1996 ;; /DESC ;; AUTHOR From ISO/IEC 10179:1996 ;; /REFENTRY (node-list-ref nl (- (node-list-length nl) 1))) --norm DSSSList info and archive: http://www.mulberrytech.com/dsssl/dssslist
Current Thread |
---|
|
<- Previous | Index | Next -> |
---|---|---|
searching for closest previous elem, stephenng | Thread | Re: searching for closest previous , Paul Prescod |
Re: modular docbook stylesheets spe, Christian Leutloff | Date | Re: searching for closest previous , stephenng |
Month |