Fast filter support in SAX2

[Bill la Forge]

From: David Megginson <david at megginson.com>
>Yes, but as someone (James Clark?) pointed out during the last round,
>with most serious applications you're going to end up doing hash
>lookups anyway, so the == doesn't buy you much.


At first blush, I had to agree with you. But consider the more interesting
pattern matching scenarios. Its not always reasonable to have to map
all processing into a hash lookup. 

I'm really just suggesting a capability here. Just another way to tune an
application. If interned strings are used by the parser, why not share
that capability with filters/applicaitons?

Suppose we have a parser-kernel that we want to use with some new 
wonderful schema that has been implemented in a filter? Something that
allows content validation based on ancestor patterns? Unless you are
willing to right some pretty convoluted code, interned strings would be helpful.

Bill


xml-dev: A list for W3C XML Developers. To post, mailto:xml-dev at ic.ac.uk
Archived as: http://www.lists.ic.ac.uk/hypermail/xml-dev/ and on CD-ROM/ISBN 981-02-3594-1
To (un)subscribe, mailto:majordomo at ic.ac.uk the following message;
(un)subscribe xml-dev
To subscribe to the digests, mailto:majordomo at ic.ac.uk the following message;
subscribe xml-dev-digest
List coordinator, Henry Rzepa (mailto:rzepa at ic.ac.uk)