return (this.contains(el)); }, this); if (n){ for (var o = 0, p = children.length; o < p; o++){ if (o % is[0] == is[1]) found.push(children[o]); 
return ($type(el) == 'element'); }); if (nth){ for (var k = 0, l = children.length; k < l; k++){ if ((k % ab[0] == ab[1]) && (this.contains(children[k]))) found.push(children[k]); 
	filterByNth: function(interval, n, start, nocash){		var found = [];		var parents = [];		var is = [];		switch(n){			case 'n': is = [interval, start]; break;			case 'odd': is = [2, 1]; break;			case 'even': is = [2, 0];		}		for (var i = 0, l = this.length; i < l; i++){			var parent = this[i].parentNode;			if (!parent || parent.$included) continue;			parent.$included = true;			parents.push(parent);			var children = Array.filter(parent.childNodes, function(el){				return (this.contains(el));			}, this);			if (n){				for (var o = 0, p = children.length; o < p; o++){					if (o % is[0] == is[1]) found.push(children[o]);				}			} else {				found.push(children[interval]);			}		}		for (var r = 0, s = parents.length; r < s; r++) parents[r].$included = null;		return (nocash) ? found : new Elements(found);	}
7087	/local1/tlutelli/issta_data/temp/all_js/javascript/2007_temp/2007/7087/65a9f70d359930b4cfdd505d1447cd6f11210b7e/Element.Filters.js/buggy/Element/Element.Filters.js