Hi,
The parser will also make multiple calls to the characters function when it
encounters an entity reference, so your plan is likely unworkable. Also,
it's quite possible the buffer size could change in the future, or the
parser's behavior could change for some other reason.
Dave
"Vincent Finn"
<[EMAIL PROTECTED] To: <[EMAIL PROTECTED]>
omsoft.com> cc: (bcc: David N
Bertoni/Cambridge/IBM)
Subject: splits in character data
using SAX
02/23/2004 09:29
AM
Please respond to
xerces-c-dev
Hi,
I have a question about the way DefaultHandler::characters() can send to
chunks for a single text element
I found an answer of sorts in the mail archive but I am hoping for a bit
more certainty
The question is when will the characters function split data?
Are there specific rules?
What I am hoping for is to be able to make sure this will never happen
so I can ignore it rathger than having to write extra code.
The archive link is this
http://marc.theaimsgroup.com/?l=xerces-c-dev&m=100076161808793&w=2
essentially that there may be a split if the buffer is full
in which case can anyone tell me the buffer size?
then and the second reply mentions running into child nodes which has me
slightly confused
it mentions that a split may happen if a child node is found, but text
nodes don't have child nodes
have I missed the point of the function?
I was working with it as a method of getting the value of text nodes
Vin
------------------------------------------------------------------------
[EMAIL PROTECTED]
------------------------------------------------------------------------
I will find humour in my everyday life
by looking for people I can laugh at.
------------------------------------------------------------------------
---------------------------------------------------------------------
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
---------------------------------------------------------------------
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
