Added in the new .closest(Array) method, will be used to improve the performance...
[jquery.git] / src / traversing.js
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;
5                 });
6         } else if( qualifier.nodeType ) {
7                 return jQuery.grep(elements, function(elem, i) {
8                         return (elem === qualifier) === keep;
9                 });
10         } else if( typeof qualifier === "string" ) {
11                 var filtered = jQuery.grep(elements, function(elem) { return elem.nodeType === 1; });
12
13                 if(isSimple.test( qualifier )) {
14                         return jQuery.filter(qualifier, filtered, !keep);
15                 } else {
16                         qualifier = jQuery.filter( qualifier, elements );
17                 }
18         }
19
20         return jQuery.grep(elements, function(elem, i) {
21                 return (jQuery.inArray( elem, qualifier ) >= 0) === keep;
22         });
23 };
24
25 jQuery.fn.extend({
26         find: function( selector ) {
27                 var ret = this.pushStack( "", "find", selector ), length = 0;
28
29                 for ( var i = 0, l = this.length; i < l; i++ ) {
30                         length = ret.length;
31                         jQuery.find( selector, this[i], ret );
32
33                         if ( i > 0 ) {
34                                 // Make sure that the results are unique
35                                 for ( var n = length; n < ret.length; n++ ) {
36                                         for ( var r = 0; r < length; r++ ) {
37                                                 if ( ret[r] === ret[n] ) {
38                                                         ret.splice(n--, 1);
39                                                         break;
40                                                 }
41                                         }
42                                 }
43                         }
44                 }
45
46                 return ret;
47         },
48
49         not: function( selector ) {
50                 return this.pushStack( winnow(this, selector, false), "not", selector);
51         },
52
53         filter: function( selector ) {
54                 return this.pushStack( winnow(this, selector, true), "filter", selector );
55         },
56
57         closest: function( selectors, context ) {
58                 if ( jQuery.isArray( selectors ) ) {
59                         var ret = [], cur = this[0], selector;
60
61                         if ( cur ) {
62                                 for ( var i = 0, l = selectors.length; i < l; i++ ) {
63                                         selectors[i] = jQuery.expr.match.POS.test( selector ) ? 
64                                                 jQuery( selector, context || this.context ) :
65                                                 selectors[i];
66                                 }
67
68                                 while ( cur && cur.ownerDocument && cur !== context ) {
69                                         for ( var i = 0; i < selectors.length; i++ ) {
70                                                 selector = selectors[i];
71                                                 if ( selector.jquery ? selector.index(cur) > -1 : jQuery(cur).is(selector) ) {
72                                                         selector = selector.selector || selector;
73                                                         ret.push({ selector: selector, elem: cur });
74                                                         selectors.splice(i--, 1);
75                                                 }
76                                         }
77                                         cur = cur.parentNode;
78                                 }
79                         }
80
81                         return ret;
82                 }
83
84                 var pos = jQuery.expr.match.POS.test( selectors ) ? 
85                         jQuery( selectors, context || this.context ) : null;
86
87                 return this.map(function(i, cur){
88                         while ( cur && cur.ownerDocument && cur !== context ) {
89                                 if ( pos ? pos.index(cur) > -1 : jQuery(cur).is(selectors) ) {
90                                         return cur;
91                                 }
92                                 cur = cur.parentNode;
93                         }
94                         return null;
95                 });
96         },
97
98         add: function( selector, context ) {
99                 var set = typeof selector === "string" ?
100                                 jQuery( selector, context || this.context ) :
101                                 jQuery.makeArray( selector ),
102                         all = jQuery.merge( this.get(), set );
103
104                 return this.pushStack( set[0] && (set[0].setInterval || set[0].nodeType === 9 || (set[0].parentNode && set[0].parentNode.nodeType !== 11)) ?
105                         jQuery.unique( all ) :
106                         all );
107         },
108
109         eq: function( i ) {
110                 return i === -1 ?
111                         this.slice( i ) :
112                         this.slice( i, +i + 1 );
113         },
114
115         first: function() {
116                 return this.eq( 0 );
117         },
118
119         last: function() {
120                 return this.eq( -1 );
121         },
122
123         slice: function() {
124                 return this.pushStack( Array.prototype.slice.apply( this, arguments ),
125                         "slice", Array.prototype.slice.call(arguments).join(",") );
126         },
127
128         map: function( callback ) {
129                 return this.pushStack( jQuery.map(this, function(elem, i){
130                         return callback.call( elem, i, elem );
131                 }));
132         },
133
134         andSelf: function() {
135                 return this.add( this.prevObject );
136         },
137
138         end: function() {
139                 return this.prevObject || jQuery(null);
140         }
141 });
142
143 jQuery.each({
144         parent: function(elem){return elem.parentNode;},
145         parents: function(elem){return jQuery.dir(elem,"parentNode");},
146         next: function(elem){return jQuery.nth(elem,2,"nextSibling");},
147         prev: function(elem){return jQuery.nth(elem,2,"previousSibling");},
148         nextAll: function(elem){return jQuery.dir(elem,"nextSibling");},
149         prevAll: function(elem){return jQuery.dir(elem,"previousSibling");},
150         siblings: function(elem){return jQuery.sibling(elem.parentNode.firstChild,elem);},
151         children: function(elem){return jQuery.sibling(elem.firstChild);},
152         contents: function(elem){return jQuery.nodeName(elem,"iframe")?elem.contentDocument||elem.contentWindow.document:jQuery.makeArray(elem.childNodes);}
153 }, function(name, fn){
154         jQuery.fn[ name ] = function( selector ) {
155                 var ret = jQuery.map( this, fn );
156
157                 if ( selector && typeof selector === "string" ) {
158                         ret = jQuery.filter( selector, ret );
159                 }
160
161                 ret = this.length > 1 ? jQuery.unique( ret ) : ret;
162
163                 if ( name === "parents" && this.length > 1 ) {
164                         ret = ret.reverse();
165                 }
166
167                 return this.pushStack( ret, name, selector );
168         };
169 });
170
171 jQuery.extend({
172         filter: function( expr, elems, not ) {
173                 if ( not ) {
174                         expr = ":not(" + expr + ")";
175                 }
176
177                 return jQuery.find.matches(expr, elems);
178         },
179         
180         dir: function( elem, dir ) {
181                 var matched = [], cur = elem[dir];
182                 while ( cur && cur.nodeType !== 9 ) {
183                         if ( cur.nodeType === 1 ) {
184                                 matched.push( cur );
185                         }
186                         cur = cur[dir];
187                 }
188                 return matched;
189         },
190
191         nth: function( cur, result, dir, elem ) {
192                 result = result || 1;
193                 var num = 0;
194
195                 for ( ; cur; cur = cur[dir] ) {
196                         if ( cur.nodeType === 1 && ++num === result ) {
197                                 break;
198                         }
199                 }
200
201                 return cur;
202         },
203
204         sibling: function( n, elem ) {
205                 var r = [];
206
207                 for ( ; n; n = n.nextSibling ) {
208                         if ( n.nodeType === 1 && n !== elem ) {
209                                 r.push( n );
210                         }
211                 }
212
213                 return r;
214         }
215 });