RE: DOM performance/coding issue

2003-09-14 Thread Swaminathan A
As Mr.Alberto told if we iterate the child nodes instead of using getElementsByTagNameNS it will be efficient. Please find the code snippet for the same. Regards, Swaminathan // Get all the child nodes of the given Document's root node. XERCES_CPP_NAMESPACE::DOMNodeList* pDO

Re: DOM performance/coding issue

2003-09-14 Thread Alberto Massari
At 18.06 14/09/2003 -0400, you wrote: I have a question about how to effectively parser a large DOM document. For example, I have a lot of 'PatchData' elements. I am looking for the set of these where the child element 'CbName' matches a certain string. The following code takes 30 seconds just t

RE: DOM performance/coding issue

2003-09-14 Thread igbert
I attack this problem by doing incremental parsing such as what the Sax examples do. You are going to get a very large tree if you parse first, then process. It seems to me that that may be what is taking so long. YMMV:) Bert Williams. -Original Message- From: David Hoffer [mailto:[EM

RE: DOM performance/coding issue

2003-09-14 Thread Dean Roddey
If you aren't going to actually need the tree structure, use the SAX interface instead and just pull the elements out as you see them, and store the ones you want in your own data structures. It'll probably be far faster. - Dean Roddey The Charmed Quark Controll

DOM performance/coding issue

2003-09-14 Thread David Hoffer
I have a question about how to effectively parser a large DOM document. For example, I have a lot of 'PatchData' elements. I am looking for the set of these where the child element 'CbName' matches a certain string. The following code takes 30 seconds just to loop through the DOMNodeList before

RE: TEST

2003-09-14 Thread David Hoffer
- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]

Bug report for Xerces-C++ [2003/09/14]

2003-09-14 Thread bugzilla
+---+ | Bugzilla Bug ID | | +-+ | | Status: UNC=Unconfirmed NEW=New ASS=Assigned