23 Oct
2007
23 Oct
'07
12:40 p.m.
"Yitzchak Gale"
In some usage patterns, it can reduce the cost of processing from linear in the size of the document, to a constant (the distance into the document to find a particular element).
Oh oh - does that mean that Ketil's original case (an element containing a large quantity of CDATA) could still be a problem?
Don't know how interested you all are, but it's not just (P)CDATA, but a subsection (enclosed by a specific tag) that I need to process as a whole. HaXml on my list after TagSoup, which I'm about to get to work, I think (got distracted a bit ATM). -k -- If I haven't seen further, it is by standing in the footprints of giants