Re-worked the closest no-duplicate-selector code again to be more efficient.
[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], match, matches = {}, selector;
60
61                         if ( cur && selectors.length ) {
62                                 for ( var i = 0, l = selectors.length; i < l; i++ ) {
63                                         selector = selectors[i];
64
65                                         if ( !matches[selector] ) {
66                                                 matches[selector] = jQuery.expr.match.POS.test( selector ) ? 
67                                                         jQuery( selector, context || this.context ) :
68                                                         selector;
69                                         }
70                                 }
71
72                                 while ( cur && cur.ownerDocument && cur !== context ) {
73                                         for ( selector in matches ) {
74                                                 match = matches[selector];
75
76                                                 if ( match.jquery ? match.index(cur) > -1 : jQuery(cur).is(match) ) {
77                                                         ret.push({ selector: selector, elem: cur });
78                                                         delete matches[selector];
79                                                 }
80                                         }
81                                         cur = cur.parentNode;
82                                 }
83                         }
84
85                         return ret;
86                 }
87
88                 var pos = jQuery.expr.match.POS.test( selectors ) ? 
89                         jQuery( selectors, context || this.context ) : null;
90
91                 return this.map(function(i, cur){
92                         while ( cur && cur.ownerDocument && cur !== context ) {
93                                 if ( pos ? pos.index(cur) > -1 : jQuery(cur).is(selectors) ) {
94                                         return cur;
95                                 }
96                                 cur = cur.parentNode;
97                         }
98                         return null;
99                 });
100         },
101
102         add: function( selector, context ) {
103                 var set = typeof selector === "string" ?
104                                 jQuery( selector, context || this.context ) :
105                                 jQuery.makeArray( selector ),
106                         all = jQuery.merge( this.get(), set );
107
108                 return this.pushStack( set[0] && (set[0].setInterval || set[0].nodeType === 9 || (set[0].parentNode && set[0].parentNode.nodeType !== 11)) ?
109                         jQuery.unique( all ) :
110                         all );
111         },
112
113         eq: function( i ) {
114                 return i === -1 ?
115                         this.slice( i ) :
116                         this.slice( i, +i + 1 );
117         },
118
119         first: function() {
120                 return this.eq( 0 );
121         },
122
123         last: function() {
124                 return this.eq( -1 );
125         },
126
127         slice: function() {
128                 return this.pushStack( Array.prototype.slice.apply( this, arguments ),
129                         "slice", Array.prototype.slice.call(arguments).join(",") );
130         },
131
132         map: function( callback ) {
133                 return this.pushStack( jQuery.map(this, function(elem, i){
134                         return callback.call( elem, i, elem );
135                 }));
136         },
137
138         andSelf: function() {
139                 return this.add( this.prevObject );
140         },
141
142         end: function() {
143                 return this.prevObject || jQuery(null);
144         }
145 });
146
147 jQuery.each({
148         parent: function(elem){return elem.parentNode;},
149         parents: function(elem){return jQuery.dir(elem,"parentNode");},
150         next: function(elem){return jQuery.nth(elem,2,"nextSibling");},
151         prev: function(elem){return jQuery.nth(elem,2,"previousSibling");},
152         nextAll: function(elem){return jQuery.dir(elem,"nextSibling");},
153         prevAll: function(elem){return jQuery.dir(elem,"previousSibling");},
154         siblings: function(elem){return jQuery.sibling(elem.parentNode.firstChild,elem);},
155         children: function(elem){return jQuery.sibling(elem.firstChild);},
156         contents: function(elem){return jQuery.nodeName(elem,"iframe")?elem.contentDocument||elem.contentWindow.document:jQuery.makeArray(elem.childNodes);}
157 }, function(name, fn){
158         jQuery.fn[ name ] = function( selector ) {
159                 var ret = jQuery.map( this, fn );
160
161                 if ( selector && typeof selector === "string" ) {
162                         ret = jQuery.filter( selector, ret );
163                 }
164
165                 ret = this.length > 1 ? jQuery.unique( ret ) : ret;
166
167                 if ( name === "parents" && this.length > 1 ) {
168                         ret = ret.reverse();
169                 }
170
171                 return this.pushStack( ret, name, selector );
172         };
173 });
174
175 jQuery.extend({
176         filter: function( expr, elems, not ) {
177                 if ( not ) {
178                         expr = ":not(" + expr + ")";
179                 }
180
181                 return jQuery.find.matches(expr, elems);
182         },
183         
184         dir: function( elem, dir ) {
185                 var matched = [], cur = elem[dir];
186                 while ( cur && cur.nodeType !== 9 ) {
187                         if ( cur.nodeType === 1 ) {
188                                 matched.push( cur );
189                         }
190                         cur = cur[dir];
191                 }
192                 return matched;
193         },
194
195         nth: function( cur, result, dir, elem ) {
196                 result = result || 1;
197                 var num = 0;
198
199                 for ( ; cur; cur = cur[dir] ) {
200                         if ( cur.nodeType === 1 && ++num === result ) {
201                                 break;
202                         }
203                 }
204
205                 return cur;
206         },
207
208         sibling: function( n, elem ) {
209                 var r = [];
210
211                 for ( ; n; n = n.nextSibling ) {
212                         if ( n.nodeType === 1 && n !== elem ) {
213                                 r.push( n );
214                         }
215                 }
216
217                 return r;
218         }
219 });