My XmlToList procedure is based upon the XmlToTree example in the wiki. There are no memory leaks in my code (checked it with heaptrace).
Bart On 6/14/11, Marcos Douglas <m...@delfire.net> wrote: > On Tue, Jun 14, 2011 at 10:12 AM, Felipe Monteiro de Carvalho > <felipemonteiro.carva...@gmail.com> wrote: >> The Wiki has some XML tutorials: >> >> http://wiki.lazarus.freepascal.org/XML_Tutorial > > Yes, I saw that. > My doubt is how use a safe algorithm to parse my XML. See the first > example "Printing the names of nodes and attributes" in link that you > posted: > with Child.ChildNodes do > try > //.. > finally > Free; > end; > > I have to know which functions create a new object. That is not clear > if we use Child.ChildNodes, right? > > Marcos Douglas > _______________________________________________ > fpc-pascal maillist - fpc-pascal@lists.freepascal.org > http://lists.freepascal.org/mailman/listinfo/fpc-pascal > _______________________________________________ fpc-pascal maillist - fpc-pascal@lists.freepascal.org http://lists.freepascal.org/mailman/listinfo/fpc-pascal
