1 var winnow = function( elements, qualifier, keep ) {
2 if(jQuery.isFunction( qualifier )) {
3 return jQuery.grep(elements, function(elem, i) {
4 return !!qualifier.call( elem, i ) === keep;
6 } else if( qualifier.nodeType ) {
7 return jQuery.grep(elements, function(elem, i) {
8 return (elem === qualifier) === keep;
10 } else if( typeof qualifier === "string" ) {
11 var filtered = jQuery.grep(elements, function(elem) { return elem.nodeType === 1 });
13 if(isSimple.test( qualifier )) return jQuery.filter(qualifier, filtered, !keep);
14 else qualifier = jQuery.filter( qualifier, elements );
17 return jQuery.grep(elements, function(elem, i) {
18 return (jQuery.inArray( elem, qualifier ) >= 0) === keep;
23 find: function( selector ) {
24 var ret = this.pushStack( "", "find", selector ), length = 0;
26 for ( var i = 0, l = this.length; i < l; i++ ) {
28 jQuery.find( selector, this[i], ret );
31 // Make sure that the results are unique
32 for ( var n = length; n < ret.length; n++ ) {
33 for ( var r = 0; r < length; r++ ) {
34 if ( ret[r] === ret[n] ) {
46 not: function( selector ) {
47 return this.pushStack( winnow(this, selector, false), "not", selector);
50 filter: function( selector ) {
51 return this.pushStack( winnow(this, selector, true), "filter", selector );
54 closest: function( selector, context ) {
55 var pos = jQuery.expr.match.POS.test( selector ) ?
56 jQuery( selector, context || this.context ) : null;
58 return this.map(function(){
59 var cur = this, closer = 0;
60 while ( cur && cur.ownerDocument && cur !== context ) {
61 if ( pos ? pos.index(cur) > -1 : jQuery(cur).is(selector) ) {
62 jQuery.lastCloser = closer;
68 jQuery.lastCloser = -1;
73 add: function( selector, context ) {
74 var set = typeof selector === "string" ?
75 jQuery( selector, context || this.context ) :
76 jQuery.makeArray( selector ),
77 all = jQuery.merge( this.get(), set );
79 return this.pushStack( set[0] && (set[0].setInterval || set[0].nodeType === 9 || (set[0].parentNode && set[0].parentNode.nodeType !== 11)) ?
80 jQuery.unique( all ) :
87 this.slice( i, +i + 1 );
99 return this.pushStack( Array.prototype.slice.apply( this, arguments ),
100 "slice", Array.prototype.slice.call(arguments).join(",") );
103 map: function( callback ) {
104 return this.pushStack( jQuery.map(this, function(elem, i){
105 return callback.call( elem, i, elem );
109 andSelf: function() {
110 return this.add( this.prevObject );
114 return this.prevObject || jQuery(null);
119 parent: function(elem){return elem.parentNode;},
120 parents: function(elem){return jQuery.dir(elem,"parentNode");},
121 next: function(elem){return jQuery.nth(elem,2,"nextSibling");},
122 prev: function(elem){return jQuery.nth(elem,2,"previousSibling");},
123 nextAll: function(elem){return jQuery.dir(elem,"nextSibling");},
124 prevAll: function(elem){return jQuery.dir(elem,"previousSibling");},
125 siblings: function(elem){return jQuery.sibling(elem.parentNode.firstChild,elem);},
126 children: function(elem){return jQuery.sibling(elem.firstChild);},
127 contents: function(elem){return jQuery.nodeName(elem,"iframe")?elem.contentDocument||elem.contentWindow.document:jQuery.makeArray(elem.childNodes);}
128 }, function(name, fn){
129 jQuery.fn[ name ] = function( selector ) {
130 var ret = jQuery.map( this, fn );
132 if ( selector && typeof selector === "string" ) {
133 ret = jQuery.filter( selector, ret );
136 ret = this.length > 1 ? jQuery.unique( ret ) : ret;
138 if ( name === "parents" && this.length > 1 ) {
142 return this.pushStack( ret, name, selector );
147 filter: function( expr, elems, not ) {
149 expr = ":not(" + expr + ")";
152 return jQuery.find.matches(expr, elems);
155 dir: function( elem, dir ) {
156 var matched = [], cur = elem[dir];
157 while ( cur && cur.nodeType !== 9 ) {
158 if ( cur.nodeType === 1 ) {
166 nth: function( cur, result, dir, elem ) {
167 result = result || 1;
170 for ( ; cur; cur = cur[dir] ) {
171 if ( cur.nodeType === 1 && ++num === result ) {
179 sibling: function( n, elem ) {
182 for ( ; n; n = n.nextSibling ) {
183 if ( n.nodeType === 1 && n !== elem ) {