From: Daniel Veillard (Daniel.Veillard@w3.org)
Date: Sat Oct 14 2000 - 08:46:00 EDT
On Sat, Oct 14, 2000 at 12:13:21PM +0000, Bjorn Reese wrote:
> My intension is not to build a SAX version of XPath per se. My
> intension is to optimize the typical case on our documents, and
> provide a fallback solution for the non-typical case.
>
> I have not investigated this in any detail, but my current idea is
> to take the set of XPath expressions and convert these into state
> machines. When I discover that ancestry axes are used by any of the
> expressions I will fall back to the DOM solution instead.
Yeah, libxml coding principle is Keep It Simple Stupid. There
is a zillion of places where one could optimize things but this
has serious costs too. Naive code is easier to write and understand
sometimes it's just not good enough, I'm targetting at the 80% audience
who will find this acceptable, if the threshold drop for some part
of the implemetation then I will insert specific optimizations,
possibly left as configure time options if they generate too much
troubles (like --with-buffers !).
Daniel
-- Daniel.Veillard@w3.org | W3C, INRIA Rhone-Alpes | Today's Bookmarks : Tel : +33 476 615 257 | 655, avenue de l'Europe | Linux XML libxml WWW Fax : +33 476 615 207 | 38330 Montbonnot FRANCE | Gnome rpm2html rpmfind http://www.w3.org/People/all#veillard%40w3.org | RPM badminton Kaffe ---- Message from the list xml@rpmfind.net Archived at : http://xmlsoft.org/messages/ to unsubscribe: echo "unsubscribe xml" | mail majordomo@rpmfind.net
This archive was generated by hypermail 2b29 : Sat Oct 14 2000 - 09:43:39 EDT