Speedy XML parsing

[BigBadDave]

I built this function to parse and render my XML:

stop ();
var mySort = new Array();
var pXML = new XML();
pXML.onLoad = readXML;
pXML.load("file.xml");
function chkDup (hts, qry) {
	for (var i = 0; i<mySort.length; i++) {
		if (mySort[i][1] == qry) {
			mySort[i] = [mySort[i][0]+hts, qry, mySort[i][2]];
			return true;
		}
	}
	return false;
}
function readXML () {
	if (pXML.loaded) {
		for (var x = 0; x<pXML.childNodes[2].childNodes[0].childNodes[1].childNodes[0].childNodes[1].childNodes.length; x++) {
			for (var y = 0; y<pXML.childNodes[2].childNodes[0].childNodes[1].childNodes[0].childNodes[1].childNodes[x].childNodes[2].childNodes.length; y++) {
				Query = new String(pXML.childNodes[2].childNodes[0].childNodes[1].childNodes[0].childNodes[1].childNodes[x].childNodes[2].childNodes[y].childNodes);
				Hits = parseFloat(pXML.childNodes[2].childNodes[0].childNodes[1].childNodes[0].childNodes[1].childNodes[x].childNodes[2].childNodes[y].attributes.Hits);
				Av = pXML.childNodes[2].childNodes[0].childNodes[1].childNodes[0].childNodes[1].childNodes[x].childNodes[2].childNodes[y].attributes.AvgRank;
				if (chkDup(Hits, Query) != true) {
					mySort[mySort.length] = [Hits, Query, Av];
				}
			}
		}
		renderXML();
	} else {
		readXML();
	}
}

function renderXML () {
	mySort.sort();
	var tt = mySort.length-11;
	i = 0;
	for (var p = mySort.length-1; p>tt; p--) {
		i++;
		_root[&quot;query&quot;+i] = mySort[p][1];
		_root[&quot;hits&quot;+i] = mySort[p][0];
		_root[&quot;av&quot;+i] = mySort[p][2];
	}
	_root.loadt._visible = 0;
}

It works fine but I'm wondering if there is a faster way (It may just be the length of the XML document!) to parse the XML Regards
David Byng

http://www.byngdesigns.co.uk

davidbyng@hotmail.com

 

[billwatson]

Flash 5 is quite slow when loading XML. Not sure but i seem to remember in another post you said you still had flash 5

If so the smart guys at figleaf have a better way: XMLNitro 1.3 beta

http://chattyfig.figleaf.com/~bhall/code/xmlnitro.as

might be worth having a look