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 ) ? jQuery(selector) : null;
57 return this.map(function(){
58 var cur = this, closer = 0;
59 while ( cur && cur.ownerDocument && cur !== context ) {
60 if ( pos ? pos.index(cur) > -1 : jQuery(cur).is(selector) ) {
61 jQuery.lastCloser = closer;
67 jQuery.lastCloser = -1;
72 add: function( selector, context ) {
73 var set = typeof selector === "string" ?
74 jQuery( selector, context || this.context ) :
75 jQuery.makeArray( selector ),
76 all = jQuery.merge( this.get(), set );
78 return this.pushStack( set[0] && (set[0].setInterval || set[0].nodeType === 9 || (set[0].parentNode && set[0].parentNode.nodeType !== 11)) ?
79 jQuery.unique( all ) :
86 this.slice( i, +i + 1 );
98 return this.pushStack( Array.prototype.slice.apply( this, arguments ),
99 "slice", Array.prototype.slice.call(arguments).join(",") );
102 map: function( callback ) {
103 return this.pushStack( jQuery.map(this, function(elem, i){
104 return callback.call( elem, i, elem );
108 andSelf: function() {
109 return this.add( this.prevObject );
113 return this.prevObject || jQuery(null);
118 parent: function(elem){return elem.parentNode;},
119 parents: function(elem){return jQuery.dir(elem,"parentNode");},
120 next: function(elem){return jQuery.nth(elem,2,"nextSibling");},
121 prev: function(elem){return jQuery.nth(elem,2,"previousSibling");},
122 nextAll: function(elem){return jQuery.dir(elem,"nextSibling");},
123 prevAll: function(elem){return jQuery.dir(elem,"previousSibling");},
124 siblings: function(elem){return jQuery.sibling(elem.parentNode.firstChild,elem);},
125 children: function(elem){return jQuery.sibling(elem.firstChild);},
126 contents: function(elem){return jQuery.nodeName(elem,"iframe")?elem.contentDocument||elem.contentWindow.document:jQuery.makeArray(elem.childNodes);}
127 }, function(name, fn){
128 jQuery.fn[ name ] = function( selector ) {
129 var ret = jQuery.map( this, fn );
131 if ( selector && typeof selector === "string" ) {
132 ret = jQuery.filter( selector, ret );
135 ret = this.length > 1 ? jQuery.unique( ret ) : ret;
137 if ( name === "parents" && this.length > 1 ) {
141 return this.pushStack( ret, name, selector );
146 filter: function( expr, elems, not ) {
148 expr = ":not(" + expr + ")";
151 return jQuery.find.matches(expr, elems);
154 dir: function( elem, dir ) {
155 var matched = [], cur = elem[dir];
156 while ( cur && cur.nodeType !== 9 ) {
157 if ( cur.nodeType === 1 ) {
165 nth: function( cur, result, dir, elem ) {
166 result = result || 1;
169 for ( ; cur; cur = cur[dir] ) {
170 if ( cur.nodeType === 1 && ++num === result ) {
178 sibling: function( n, elem ) {
181 for ( ; n; n = n.nextSibling ) {
182 if ( n.nodeType === 1 && n !== elem ) {