rem: if(tqp == ">"){ var ecn = element.childNodes; 
add: if(tqp.oper == ">"){ var ecn = element[childNodesName]; 
context: 	var _filterDown = function(element, queryParts, matchArr, idx){		var nidx = idx+1;		var isFinal = (queryParts.length == nidx);		var tqp = queryParts[idx];		// see if we can constrain our next level to direct children		if(tqp == ">"){			var ecn = element.childNodes;			if(!ecn.length){				return;			}			nidx++;			isFinal = (queryParts.length == nidx);			// kinda janky, too much array alloc			var tf = getFilterFunc(queryParts[idx+1]);			// for(var x=ecn.length-1, te; x>=0, te=ecn[x]; x--){			for(var x=0, te; x<ecn.length, te=ecn[x]; x++){				if(tf(te)){					if(isFinal){						matchArr.push(te);					}else{						_filterDown(te, queryParts, matchArr, nidx);					}				}				/*				if(x==0){					break;				}				*/			}		}		// otherwise, keep going down, unless we'er at the end		var candidates = getElementsFunc(tqp)(element);		if(isFinal){			while(candidates.length){				matchArr.push(candidates.shift());			}			/*			candidates.unshift(0, matchArr.length-1);			matchArr.splice.apply(matchArr, candidates);			*/		}else{			// if we're not yet at the bottom, keep going!			while(candidates.length){				_filterDown(candidates.shift(), queryParts, matchArr, nidx);			}		}	}
meta: 4497	/local1/tlutelli/issta_data/temp/all_js/javascript/2007_temp/2007/4497/9d2d8b07235702c69fc064ab917871332f42d825/query.js/clean/_base/query.js