From: Daniel Veillard (Daniel.Veillard@w3.org)
Date: Tue Oct 24 2000 - 13:15:20 EDT
On Tue, Oct 24, 2000 at 02:19:37PM +0200, TOM wrote:
>
>
> Hi,
> While coding the document() XSLT function I thought about XML Base. So I
> wonder how to implement it.
> - xml:base is just one attribute between others. But when we want the
> base URI of an element, we must go through all of it's parents and for
> each of them go through their attributes (and the through their names into
> xmlStrEqual()).
Already done:
xmlNodeGetBase() in tree.c
> With the first method (that's what we must do for now) we gain memory
> but we loose time, with the second it's the contrary.
> What would be the best ?
the simplest until someone proves that the KISS approach is too
costly performance wise.
> We can have an xmlNodeGetBase() or xmlNodeGetBaseURI() function that
> we'll change implementation when we decide to add something to the xmlNode
> struct. There will be nothing to change then in parts that use XML Base
> and this function.
>
> Any remark ?
- What's wrong with current code ?
- One should add some convenience code to get an IO handler
from a string representing an URI reference. Should go in uri.c
of xmlIO.c, but this is not urgent (and I need to think a bit more
about the interface).
Daniel
-- Daniel.Veillard@w3.org | W3C, INRIA Rhone-Alpes | libxml Gnome XML toolkit Tel : +33 476 615 257 | 655, avenue de l'Europe | http://xmlsoft.org/ Fax : +33 476 615 207 | 38330 Montbonnot FRANCE | Rpmfind search site http://www.w3.org/People/all#veillard%40w3.org | http://rpmfind.net/ ---- 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 : Tue Oct 24 2000 - 13:43:37 EDT