XML sorting

A

anilbisen

I am working on an application which requires merging of XML documents
and then reorder/sort them based on elements in the XML. This needs to
be done in C++ and requires very high performance.
I read about sorting using XSLT but it is memory intensive and
performance is low and may not be useful to me.

Is there any other way I can achieve this?
Please guide me on this.
 
J

Joseph J. Kesselman

Is there any other way I can achieve this?

If performance is hypercritical, get an XML parser, use it to build your
own data structures which are optimized for your task, manipulate them
appropriately, and write the result out as XML (probably using the
serializer that came with the parser).
 

Ask a Question

Want to reply to this thread or ask your own question?

You'll need to choose a username for the site, which only take a couple of moments. After that, you can post your question and our members will help you out.

Ask a Question

Members online

No members online now.

Forum statistics

Threads
474,172
Messages
2,570,934
Members
47,478
Latest member
ReginaldVi

Latest Threads

Top