• To: John Cowan <jcowan@r...>
• Subject: Re: Quick Xpath
• From: Uche Ogbuji <uche.ogbuji@f...>
• Date: Wed, 17 Jul 2002 21:17:18 -0600
• Cc: jgreif@a... (Jeff Greif), bob@w... (bob mcwhirter), jeni@j... (Jeni Tennison), xml-dev@l...
• In-reply-to: Message from John Cowan <jcowan@r...> of "Wed, 17 Jul 2002 20:45:39 EDT." <200207180057.UAA02998@m...>
• Sender: uche.ogbuji@f...

> Jeff Greif scripsit:
> 
> > If it's your own flavor of DOM to which XPath processing is
> > applied, and the DOM can be assumed to be read-only, each node can be
> > constructed to carry its index in document order, allowing a trivial sort
> > after nodes were found by the Xpath processor, using the DOM implementation
> > secret sauce.  You could relax the read-only assumption at the cost of a
> > major renumbering each time the DOM was modified.
> 
> You can also use the ancient BASIC programmer trick, and leave lots of
> gaps between the index numbers, so that you can insert plenty of nodes
> before you have to, er, RESEQ.

Or you can use floats.  This is what 4XPath does.


-- 
Uche Ogbuji                                    Fourthought, Inc.
http://uche.ogbuji.net    http://4Suite.org    http://fourthought.com
Track chair, XML/Web Services One Boston: http://www.xmlconference.com/
The many heads of XML modeling - http://adtmag.com/article.asp?id=6393
Will XML live up to its promise? - http://www-106.ibm.com/developerworks/xml/library/x-think11.html

• References:
  • Re: Quick Xpath
    • From: John Cowan <jcowan@r...>

• Prev by Date: Re: Quick Xpath
• Next by Date: Re: Quick Xpath
• Previous by thread: Re: Quick Xpath
• Next by thread: RE: Quick Xpath
• Index(es):
  • Date
  • Thread