[Home] [By Thread] [By Date] [Recent Entries]
Dear Robby,
I imagine they will tell you the normal way to do this is to acquire or construct a (temporary) tree, and then query that. It's much more powerful than a hashmap because it can be arbitrarily complex. Whether it performs as well in XQuery, where xsl:key is not available to indicate that an index is called for, will be an interesting question. (But not on topic for this list. Unless it's threaded as a comparison between the sisters.) In theory I suppose it should, inasmuch as this sort of thing is what XQuery is for, but there are likely to be devils in the details. I have heard rumors of a hash-like data structure for 3.0. Cheers, Wendell On 3/28/2012 7:50 AM, Robby Pelssers wrote: Hi Wolfgang, -- ====================================================================== Wendell Piez mailto:wapiez@xxxxxxxxxxxxxxxx Mulberry Technologies, Inc. http://www.mulberrytech.com 17 West Jefferson Street Direct Phone: 301/315-9635 Suite 207 Phone: 301/315-9631 Rockville, MD 20850 Fax: 301/315-8285 ---------------------------------------------------------------------- Mulberry Technologies: A Consultancy Specializing in SGML and XML ======================================================================
|

Cart



