Greetings and Happy New Year to all,
This is my second attempt to learn and embrace Xerces-C, I hope it will
be a successful one this time. It is a New Year resolution. ;-)
Some time ago I incorporated Xerces into my applications, but the code I
wrote seemed a very complex way to achieve simple results. I then
decided that all that work and frustration was not worth the trouble,
and switched to Java+XPath. It works great, but some of my XML-related
apps must be written in C/C++.
To further complicate matters, the hard disk where I had all my Xerces
code died at the worst possible time.
I would like to start with a fresh look at Xerces again. Could any of
you nice fellows provide a simple, tutorial-like code to traverse a tree
like the one attached? All what is needed are those numerical values. I
am sure I can write some sort of code, but like I said I believe I am
failing to write it in the best/simplest way.
TIA,
-Ramon
<?xml version="1.0" ?>
<line-segments>
<vertical>
<distance>215.826</distance>
<distance>1146.03</distance>
<distance>2284.03</distance>
<distance>3532.03</distance>
<distance>4844.53</distance>
</vertical>
<horizontal>
<distance>3335.6</distance>
<distance>3533.82</distance>
<distance>3728.67</distance>
<distance>3934.67</distance>
<distance>4132.67</distance>
<distance>4328.67</distance>
<distance>4530.67</distance>
<distance>4728.67</distance>
<distance>4924.67</distance>
<distance>5130</distance>
</horizontal>
</line-segments>
