Should improve performance of closest considerably. Benchmark proof in speed/closest...
[jquery.git] / src / traversing.js
1 (function( jQuery ) {
2
3 var runtil = /Until$/,
4         rparentsprev = /^(?:parents|prevUntil|prevAll)/,
5         // Note: This RegExp should be improved, or likely pulled from Sizzle
6         rmultiselector = /,/,
7         rchild = /^\s*>/,
8         isSimple = /^.[^:#\[\.,]*$/,
9         slice = Array.prototype.slice;
10
11 var POS = jQuery.expr.match.POS;
12
13 jQuery.fn.extend({
14         find: function( selector ) {
15                 // Handle "> div" child selectors and pass them to .children()
16                 if ( typeof selector === "string" && rchild.test( selector ) ) {
17                         return this.children( selector.replace( rchild, "" ) );
18                 }
19
20                 var ret = this.pushStack( "", "find", selector ), length = 0;
21
22                 for ( var i = 0, l = this.length; i < l; i++ ) {
23                         length = ret.length;
24                         jQuery.find( selector, this[i], ret );
25
26                         if ( i > 0 ) {
27                                 // Make sure that the results are unique
28                                 for ( var n = length; n < ret.length; n++ ) {
29                                         for ( var r = 0; r < length; r++ ) {
30                                                 if ( ret[r] === ret[n] ) {
31                                                         ret.splice(n--, 1);
32                                                         break;
33                                                 }
34                                         }
35                                 }
36                         }
37                 }
38
39                 return ret;
40         },
41
42         has: function( target ) {
43                 var targets = jQuery( target );
44                 return this.filter(function() {
45                         for ( var i = 0, l = targets.length; i < l; i++ ) {
46                                 if ( jQuery.contains( this, targets[i] ) ) {
47                                         return true;
48                                 }
49                         }
50                 });
51         },
52
53         not: function( selector ) {
54                 return this.pushStack( winnow(this, selector, false), "not", selector);
55         },
56
57         filter: function( selector ) {
58                 return this.pushStack( winnow(this, selector, true), "filter", selector );
59         },
60         
61         is: function( selector ) {
62                 return !!selector && jQuery.filter( selector, this ).length > 0;
63         },
64
65         closest: function( selectors, context ) {
66                 var ret;
67
68                 if ( jQuery.isArray( selectors ) ) {
69                         var cur = this[0], match, matches = {}, selector, level = 1;
70                         ret = [];
71
72                         if ( cur && selectors.length ) {
73                                 for ( var i = 0, l = selectors.length; i < l; i++ ) {
74                                         selector = selectors[i];
75
76                                         if ( !matches[selector] ) {
77                                                 matches[selector] = jQuery.expr.match.POS.test( selector ) ? 
78                                                         jQuery( selector, context || this.context ) :
79                                                         selector;
80                                         }
81                                 }
82
83                                 while ( cur && cur.ownerDocument && cur !== context ) {
84                                         for ( selector in matches ) {
85                                                 match = matches[selector];
86
87                                                 if ( match.jquery ? match.index(cur) > -1 : jQuery(cur).is(match) ) {
88                                                         ret.push({ selector: selector, elem: cur, level: level });
89                                                 }
90                                         }
91
92                                         cur = cur.parentNode;
93                                         level++;
94                                 }
95                         }
96
97                         return ret;
98                 }
99
100                 var pos = POS.test( selectors ) ? 
101                         jQuery( selectors, context || this.context ) : null;
102
103     var ret = [];
104
105     for ( var i=0,j=this.length; i<j; i++ ) {
106       var cur = this[i];
107
108       while ( cur ) {
109         if ( pos ? pos.index(cur) > -1 : jQuery.find.matches(selectors, [cur]).length ) {
110                                         ret.push( cur );
111           break;
112                                 } else {
113           cur = cur.parentNode;
114           if ( !cur.ownerDocument || cur === context ) {
115             break;
116           }
117         }
118       }
119     }
120
121                 ret = ret.length > 1 ? jQuery.unique(ret) : ret;
122                 
123                 return this.pushStack( ret, "closest", selectors );
124         },
125         
126         // Determine the position of an element within
127         // the matched set of elements
128         index: function( elem ) {
129                 if ( !elem || typeof elem === "string" ) {
130                         return jQuery.inArray( this[0],
131                                 // If it receives a string, the selector is used
132                                 // If it receives nothing, the siblings are used
133                                 elem ? jQuery( elem ) : this.parent().children() );
134                 }
135                 // Locate the position of the desired element
136                 return jQuery.inArray(
137                         // If it receives a jQuery object, the first element is used
138                         elem.jquery ? elem[0] : elem, this );
139         },
140
141         add: function( selector, context ) {
142                 var set = typeof selector === "string" ?
143                                 jQuery( selector, context || this.context ) :
144                                 jQuery.makeArray( selector ),
145                         all = jQuery.merge( this.get(), set );
146
147                 return this.pushStack( isDisconnected( set[0] ) || isDisconnected( all[0] ) ?
148                         all :
149                         jQuery.unique( all ) );
150         },
151
152         andSelf: function() {
153                 return this.add( this.prevObject );
154         }
155 });
156
157 // A painfully simple check to see if an element is disconnected
158 // from a document (should be improved, where feasible).
159 function isDisconnected( node ) {
160         return !node || !node.parentNode || node.parentNode.nodeType === 11;
161 }
162
163 jQuery.each({
164         parent: function( elem ) {
165                 var parent = elem.parentNode;
166                 return parent && parent.nodeType !== 11 ? parent : null;
167         },
168         parents: function( elem ) {
169                 return jQuery.dir( elem, "parentNode" );
170         },
171         parentsUntil: function( elem, i, until ) {
172                 return jQuery.dir( elem, "parentNode", until );
173         },
174         next: function( elem ) {
175                 return jQuery.nth( elem, 2, "nextSibling" );
176         },
177         prev: function( elem ) {
178                 return jQuery.nth( elem, 2, "previousSibling" );
179         },
180         nextAll: function( elem ) {
181                 return jQuery.dir( elem, "nextSibling" );
182         },
183         prevAll: function( elem ) {
184                 return jQuery.dir( elem, "previousSibling" );
185         },
186         nextUntil: function( elem, i, until ) {
187                 return jQuery.dir( elem, "nextSibling", until );
188         },
189         prevUntil: function( elem, i, until ) {
190                 return jQuery.dir( elem, "previousSibling", until );
191         },
192         siblings: function( elem ) {
193                 return jQuery.sibling( elem.parentNode.firstChild, elem );
194         },
195         children: function( elem ) {
196                 return jQuery.sibling( elem.firstChild );
197         },
198         contents: function( elem ) {
199                 return jQuery.nodeName( elem, "iframe" ) ?
200                         elem.contentDocument || elem.contentWindow.document :
201                         jQuery.makeArray( elem.childNodes );
202         }
203 }, function( name, fn ) {
204         jQuery.fn[ name ] = function( until, selector ) {
205                 var ret = jQuery.map( this, fn, until );
206                 
207                 if ( !runtil.test( name ) ) {
208                         selector = until;
209                 }
210
211                 if ( selector && typeof selector === "string" ) {
212                         ret = jQuery.filter( selector, ret );
213                 }
214
215                 ret = this.length > 1 ? jQuery.unique( ret ) : ret;
216
217                 if ( (this.length > 1 || rmultiselector.test( selector )) && rparentsprev.test( name ) ) {
218                         ret = ret.reverse();
219                 }
220
221                 return this.pushStack( ret, name, slice.call(arguments).join(",") );
222         };
223 });
224
225 jQuery.extend({
226         filter: function( expr, elems, not ) {
227                 if ( not ) {
228                         expr = ":not(" + expr + ")";
229                 }
230
231                 return jQuery.find.matches(expr, elems);
232         },
233         
234         dir: function( elem, dir, until ) {
235                 var matched = [], cur = elem[dir];
236                 while ( cur && cur.nodeType !== 9 && (until === undefined || cur.nodeType !== 1 || !jQuery( cur ).is( until )) ) {
237                         if ( cur.nodeType === 1 ) {
238                                 matched.push( cur );
239                         }
240                         cur = cur[dir];
241                 }
242                 return matched;
243         },
244
245         nth: function( cur, result, dir, elem ) {
246                 result = result || 1;
247                 var num = 0;
248
249                 for ( ; cur; cur = cur[dir] ) {
250                         if ( cur.nodeType === 1 && ++num === result ) {
251                                 break;
252                         }
253                 }
254
255                 return cur;
256         },
257
258         sibling: function( n, elem ) {
259                 var r = [];
260
261                 for ( ; n; n = n.nextSibling ) {
262                         if ( n.nodeType === 1 && n !== elem ) {
263                                 r.push( n );
264                         }
265                 }
266
267                 return r;
268         }
269 });
270
271 // Implement the identical functionality for filter and not
272 function winnow( elements, qualifier, keep ) {
273         if ( jQuery.isFunction( qualifier ) ) {
274                 return jQuery.grep(elements, function( elem, i ) {
275                         var retVal = !!qualifier.call( elem, i, elem );
276                         return retVal === keep;
277                 });
278
279         } else if ( qualifier.nodeType ) {
280                 return jQuery.grep(elements, function( elem, i ) {
281                         return (elem === qualifier) === keep;
282                 });
283
284         } else if ( typeof qualifier === "string" ) {
285                 var filtered = jQuery.grep(elements, function( elem ) {
286                         return elem.nodeType === 1;
287                 });
288
289                 if ( isSimple.test( qualifier ) ) {
290                         return jQuery.filter(qualifier, filtered, !keep);
291                 } else {
292                         qualifier = jQuery.filter( qualifier, filtered );
293                 }
294         }
295
296         return jQuery.grep(elements, function( elem, i ) {
297                 return (jQuery.inArray( elem, qualifier ) >= 0) === keep;
298         });
299 }
300
301 })( jQuery );