2 rparentsprev = /^(?:parents|prevUntil|prevAll)/,
3 // Note: This RegExp should be improved, or likely pulled from Sizzle
5 slice = Array.prototype.slice;
7 // Implement the identical functionality for filter and not
8 var winnow = function( elements, qualifier, keep ) {
9 if ( jQuery.isFunction( qualifier ) ) {
10 return jQuery.grep(elements, function(elem, i) {
11 return !!qualifier.call( elem, i, elem ) === keep;
14 } else if ( qualifier.nodeType ) {
15 return jQuery.grep(elements, function(elem, i) {
16 return (elem === qualifier) === keep;
19 } else if ( typeof qualifier === "string" ) {
20 var filtered = jQuery.grep(elements, function(elem) {
21 return elem.nodeType === 1;
24 if ( isSimple.test( qualifier ) ) {
25 return jQuery.filter(qualifier, filtered, !keep);
27 qualifier = jQuery.filter( qualifier, elements );
31 return jQuery.grep(elements, function(elem, i) {
32 return (jQuery.inArray( elem, qualifier ) >= 0) === keep;
37 find: function( selector ) {
38 var ret = this.pushStack( "", "find", selector ), length = 0;
40 for ( var i = 0, l = this.length; i < l; i++ ) {
42 jQuery.find( selector, this[i], ret );
45 // Make sure that the results are unique
46 for ( var n = length; n < ret.length; n++ ) {
47 for ( var r = 0; r < length; r++ ) {
48 if ( ret[r] === ret[n] ) {
60 has: function( target ) {
61 var targets = jQuery( target );
62 return this.filter(function() {
63 for ( var i = 0, l = targets.length; i < l; i++ ) {
64 if ( jQuery.contains( this, targets[i] ) ) {
71 contains: function( target ) {
72 return this.has( target ).length > 0;
75 not: function( selector ) {
76 return this.pushStack( winnow(this, selector, false), "not", selector);
79 filter: function( selector ) {
80 return this.pushStack( winnow(this, selector, true), "filter", selector );
83 closest: function( selectors, context ) {
84 if ( jQuery.isArray( selectors ) ) {
85 var ret = [], cur = this[0], match, matches = {}, selector;
87 if ( cur && selectors.length ) {
88 for ( var i = 0, l = selectors.length; i < l; i++ ) {
89 selector = selectors[i];
91 if ( !matches[selector] ) {
92 matches[selector] = jQuery.expr.match.POS.test( selector ) ?
93 jQuery( selector, context || this.context ) :
98 while ( cur && cur.ownerDocument && cur !== context ) {
99 for ( selector in matches ) {
100 match = matches[selector];
102 if ( match.jquery ? match.index(cur) > -1 : jQuery(cur).is(match) ) {
103 ret.push({ selector: selector, elem: cur });
104 delete matches[selector];
107 cur = cur.parentNode;
114 var pos = jQuery.expr.match.POS.test( selectors ) ?
115 jQuery( selectors, context || this.context ) : null;
117 return this.map(function(i, cur){
118 while ( cur && cur.ownerDocument && cur !== context ) {
119 if ( pos ? pos.index(cur) > -1 : jQuery(cur).is(selectors) ) {
122 cur = cur.parentNode;
128 add: function( selector, context ) {
129 var set = typeof selector === "string" ?
130 jQuery( selector, context || this.context ) :
131 jQuery.makeArray( selector ),
132 all = jQuery.merge( this.get(), set );
134 return this.pushStack( set[0] && (set[0].setInterval || set[0].nodeType === 9 || (set[0].parentNode && set[0].parentNode.nodeType !== 11)) ?
135 jQuery.unique( all ) :
142 this.slice( i, +i + 1 );
150 return this.eq( -1 );
154 return this.pushStack( slice.apply( this, arguments ),
155 "slice", slice.call(arguments).join(",") );
158 map: function( callback ) {
159 return this.pushStack( jQuery.map(this, function(elem, i){
160 return callback.call( elem, i, elem );
164 andSelf: function() {
165 return this.add( this.prevObject );
169 return this.prevObject || jQuery(null);
174 parent: function(elem){return elem.parentNode;},
175 parents: function(elem){return jQuery.dir(elem,"parentNode");},
176 parentsUntil: function(elem,i,until){return jQuery.dir(elem,"parentNode",until);},
177 next: function(elem){return jQuery.nth(elem,2,"nextSibling");},
178 prev: function(elem){return jQuery.nth(elem,2,"previousSibling");},
179 nextAll: function(elem){return jQuery.dir(elem,"nextSibling");},
180 prevAll: function(elem){return jQuery.dir(elem,"previousSibling");},
181 nextUntil: function(elem,i,until){return jQuery.dir(elem,"nextSibling",until);},
182 prevUntil: function(elem,i,until){return jQuery.dir(elem,"previousSibling",until);},
183 siblings: function(elem){return jQuery.sibling(elem.parentNode.firstChild,elem);},
184 children: function(elem){return jQuery.sibling(elem.firstChild);},
185 contents: function(elem){return jQuery.nodeName(elem,"iframe")?elem.contentDocument||elem.contentWindow.document:jQuery.makeArray(elem.childNodes);}
186 }, function(name, fn){
187 jQuery.fn[ name ] = function( until, selector ) {
188 var ret = jQuery.map( this, fn, until );
190 if ( !runtil.test( name ) ) {
194 if ( selector && typeof selector === "string" ) {
195 ret = jQuery.filter( selector, ret );
198 ret = this.length > 1 ? jQuery.unique( ret ) : ret;
200 if ( (this.length > 1 || rmultiselector.test( selector )) && rparentsprev.test( name ) ) {
204 return this.pushStack( ret, name, slice.call(arguments).join(",") );
209 filter: function( expr, elems, not ) {
211 expr = ":not(" + expr + ")";
214 return jQuery.find.matches(expr, elems);
217 dir: function( elem, dir, until ) {
218 var matched = [], cur = elem[dir];
219 while ( cur && cur.nodeType !== 9 && (until === undefined || !jQuery( cur ).is( until )) ) {
220 if ( cur.nodeType === 1 ) {
228 nth: function( cur, result, dir, elem ) {
229 result = result || 1;
232 for ( ; cur; cur = cur[dir] ) {
233 if ( cur.nodeType === 1 && ++num === result ) {
241 sibling: function( n, elem ) {
244 for ( ; n; n = n.nextSibling ) {
245 if ( n.nodeType === 1 && n !== elem ) {