Reorganzing the jQuery source (first phase).
This commit is contained in:
parent
13b66c8ba9
commit
b4e23b5af0
29 changed files with 16 additions and 16 deletions
432
src/selector.js
Normal file
432
src/selector.js
Normal file
|
@ -0,0 +1,432 @@
|
|||
|
||||
var chars = jQuery.browser.safari && parseInt(jQuery.browser.version) < 417 ?
|
||||
"(?:[\\w*_-]|\\\\.)" :
|
||||
"(?:[\\w\u0128-\uFFFF*_-]|\\\\.)",
|
||||
quickChild = new RegExp("^>\\s*(" + chars + "+)"),
|
||||
quickID = new RegExp("^(" + chars + "+)(#)(" + chars + "+)"),
|
||||
quickClass = new RegExp("^([#.]?)(" + chars + "*)");
|
||||
|
||||
jQuery.extend({
|
||||
expr: {
|
||||
"": "m[2]=='*'||jQuery.nodeName(a,m[2])",
|
||||
"#": "a.getAttribute('id')==m[2]",
|
||||
":": {
|
||||
// Position Checks
|
||||
lt: "i<m[3]-0",
|
||||
gt: "i>m[3]-0",
|
||||
nth: "m[3]-0==i",
|
||||
eq: "m[3]-0==i",
|
||||
first: "i==0",
|
||||
last: "i==r.length-1",
|
||||
even: "i%2==0",
|
||||
odd: "i%2",
|
||||
|
||||
// Child Checks
|
||||
"first-child": "a.parentNode.getElementsByTagName('*')[0]==a",
|
||||
"last-child": "jQuery.nth(a.parentNode.lastChild,1,'previousSibling')==a",
|
||||
"only-child": "!jQuery.nth(a.parentNode.lastChild,2,'previousSibling')",
|
||||
|
||||
// Parent Checks
|
||||
parent: "a.firstChild",
|
||||
empty: "!a.firstChild",
|
||||
|
||||
// Text Check
|
||||
contains: "(a.textContent||a.innerText||'').indexOf(m[3])>=0",
|
||||
|
||||
// Visibility
|
||||
visible: '"hidden"!=a.type&&jQuery.css(a,"display")!="none"&&jQuery.css(a,"visibility")!="hidden"',
|
||||
hidden: '"hidden"==a.type||jQuery.css(a,"display")=="none"||jQuery.css(a,"visibility")=="hidden"',
|
||||
|
||||
// Form attributes
|
||||
enabled: "!a.disabled",
|
||||
disabled: "a.disabled",
|
||||
checked: "a.checked",
|
||||
selected: "a.selected||jQuery.attr(a,'selected')",
|
||||
|
||||
// Form elements
|
||||
text: "'text'==a.type",
|
||||
radio: "'radio'==a.type",
|
||||
checkbox: "'checkbox'==a.type",
|
||||
file: "'file'==a.type",
|
||||
password: "'password'==a.type",
|
||||
submit: "'submit'==a.type",
|
||||
image: "'image'==a.type",
|
||||
reset: "'reset'==a.type",
|
||||
button: '"button"==a.type||jQuery.nodeName(a,"button")',
|
||||
input: "/input|select|textarea|button/i.test(a.nodeName)",
|
||||
|
||||
// :has()
|
||||
has: "jQuery.find(m[3],a).length",
|
||||
|
||||
// :header
|
||||
header: "/h\\d/i.test(a.nodeName)",
|
||||
|
||||
// :animated
|
||||
animated: "jQuery.grep(jQuery.timers,function(fn){return a==fn.elem;}).length"
|
||||
}
|
||||
},
|
||||
|
||||
// The regular expressions that power the parsing engine
|
||||
parse: [
|
||||
// Match: [@value='test'], [@foo]
|
||||
/^(\[) *@?([\w-]+) *([!*$^~=]*) *('?"?)(.*?)\4 *\]/,
|
||||
|
||||
// Match: :contains('foo')
|
||||
/^(:)([\w-]+)\("?'?(.*?(\(.*?\))?[^(]*?)"?'?\)/,
|
||||
|
||||
// Match: :even, :last-chlid, #id, .class
|
||||
new RegExp("^([:.#]*)(" + chars + "+)")
|
||||
],
|
||||
|
||||
multiFilter: function( expr, elems, not ) {
|
||||
var old, cur = [];
|
||||
|
||||
while ( expr && expr != old ) {
|
||||
old = expr;
|
||||
var f = jQuery.filter( expr, elems, not );
|
||||
expr = f.t.replace(/^\s*,\s*/, "" );
|
||||
cur = not ? elems = f.r : jQuery.merge( cur, f.r );
|
||||
}
|
||||
|
||||
return cur;
|
||||
},
|
||||
|
||||
find: function( t, context ) {
|
||||
// Quickly handle non-string expressions
|
||||
if ( typeof t != "string" )
|
||||
return [ t ];
|
||||
|
||||
// Make sure that the context is a DOM Element
|
||||
if ( context && !context.nodeType )
|
||||
context = null;
|
||||
|
||||
// Set the correct context (if none is provided)
|
||||
context = context || document;
|
||||
|
||||
// Initialize the search
|
||||
var ret = [context], done = [], last;
|
||||
|
||||
// Continue while a selector expression exists, and while
|
||||
// we're no longer looping upon ourselves
|
||||
while ( t && last != t ) {
|
||||
var r = [];
|
||||
last = t;
|
||||
|
||||
t = jQuery.trim(t);
|
||||
|
||||
var foundToken = false;
|
||||
|
||||
// An attempt at speeding up child selectors that
|
||||
// point to a specific element tag
|
||||
var re = quickChild;
|
||||
var m = re.exec(t);
|
||||
|
||||
if ( m ) {
|
||||
var nodeName = m[1].toUpperCase();
|
||||
|
||||
// Perform our own iteration and filter
|
||||
for ( var i = 0; ret[i]; i++ )
|
||||
for ( var c = ret[i].firstChild; c; c = c.nextSibling )
|
||||
if ( c.nodeType == 1 && (nodeName == "*" || c.nodeName.toUpperCase() == nodeName.toUpperCase()) )
|
||||
r.push( c );
|
||||
|
||||
ret = r;
|
||||
t = t.replace( re, "" );
|
||||
if ( t.indexOf(" ") == 0 ) continue;
|
||||
foundToken = true;
|
||||
} else {
|
||||
re = /^([>+~])\s*(\w*)/i;
|
||||
|
||||
if ( (m = re.exec(t)) != null ) {
|
||||
r = [];
|
||||
|
||||
var nodeName = m[2], mergeNum = jQuery.mergeNum++;
|
||||
m = m[1];
|
||||
|
||||
for ( var j = 0, rl = ret.length; j < rl; j++ ) {
|
||||
var n = m == "~" || m == "+" ? ret[j].nextSibling : ret[j].firstChild;
|
||||
for ( ; n; n = n.nextSibling )
|
||||
if ( n.nodeType == 1 ) {
|
||||
if ( m == "~" && n.mergeNum == mergeNum ) break;
|
||||
|
||||
if (!nodeName || n.nodeName.toUpperCase() == nodeName.toUpperCase() ) {
|
||||
if ( m == "~" ) n.mergeNum = mergeNum;
|
||||
r.push( n );
|
||||
}
|
||||
|
||||
if ( m == "+" ) break;
|
||||
}
|
||||
}
|
||||
|
||||
ret = r;
|
||||
|
||||
// And remove the token
|
||||
t = jQuery.trim( t.replace( re, "" ) );
|
||||
foundToken = true;
|
||||
}
|
||||
}
|
||||
|
||||
// See if there's still an expression, and that we haven't already
|
||||
// matched a token
|
||||
if ( t && !foundToken ) {
|
||||
// Handle multiple expressions
|
||||
if ( !t.indexOf(",") ) {
|
||||
// Clean the result set
|
||||
if ( context == ret[0] ) ret.shift();
|
||||
|
||||
// Merge the result sets
|
||||
done = jQuery.merge( done, ret );
|
||||
|
||||
// Reset the context
|
||||
r = ret = [context];
|
||||
|
||||
// Touch up the selector string
|
||||
t = " " + t.substr(1,t.length);
|
||||
|
||||
} else {
|
||||
// Optimize for the case nodeName#idName
|
||||
var re2 = quickID;
|
||||
var m = re2.exec(t);
|
||||
|
||||
// Re-organize the results, so that they're consistent
|
||||
if ( m ) {
|
||||
m = [ 0, m[2], m[3], m[1] ];
|
||||
|
||||
} else {
|
||||
// Otherwise, do a traditional filter check for
|
||||
// ID, class, and element selectors
|
||||
re2 = quickClass;
|
||||
m = re2.exec(t);
|
||||
}
|
||||
|
||||
m[2] = m[2].replace(/\\/g, "");
|
||||
|
||||
var elem = ret[ret.length-1];
|
||||
|
||||
// Try to do a global search by ID, where we can
|
||||
if ( m[1] == "#" && elem && elem.getElementById && !jQuery.isXMLDoc(elem) ) {
|
||||
// Optimization for HTML document case
|
||||
var oid = elem.getElementById(m[2]);
|
||||
|
||||
// Do a quick check for the existence of the actual ID attribute
|
||||
// to avoid selecting by the name attribute in IE
|
||||
// also check to insure id is a string to avoid selecting an element with the name of 'id' inside a form
|
||||
if ( (jQuery.browser.msie||jQuery.browser.opera) && oid && typeof oid.id == "string" && oid.id != m[2] )
|
||||
oid = jQuery('[@id="'+m[2]+'"]', elem)[0];
|
||||
|
||||
// Do a quick check for node name (where applicable) so
|
||||
// that div#foo searches will be really fast
|
||||
ret = r = oid && (!m[3] || jQuery.nodeName(oid, m[3])) ? [oid] : [];
|
||||
} else {
|
||||
// We need to find all descendant elements
|
||||
for ( var i = 0; ret[i]; i++ ) {
|
||||
// Grab the tag name being searched for
|
||||
var tag = m[1] == "#" && m[3] ? m[3] : m[1] != "" || m[0] == "" ? "*" : m[2];
|
||||
|
||||
// Handle IE7 being really dumb about <object>s
|
||||
if ( tag == "*" && ret[i].nodeName.toLowerCase() == "object" )
|
||||
tag = "param";
|
||||
|
||||
r = jQuery.merge( r, ret[i].getElementsByTagName( tag ));
|
||||
}
|
||||
|
||||
// It's faster to filter by class and be done with it
|
||||
if ( m[1] == "." )
|
||||
r = jQuery.classFilter( r, m[2] );
|
||||
|
||||
// Same with ID filtering
|
||||
if ( m[1] == "#" ) {
|
||||
var tmp = [];
|
||||
|
||||
// Try to find the element with the ID
|
||||
for ( var i = 0; r[i]; i++ )
|
||||
if ( r[i].getAttribute("id") == m[2] ) {
|
||||
tmp = [ r[i] ];
|
||||
break;
|
||||
}
|
||||
|
||||
r = tmp;
|
||||
}
|
||||
|
||||
ret = r;
|
||||
}
|
||||
|
||||
t = t.replace( re2, "" );
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
// If a selector string still exists
|
||||
if ( t ) {
|
||||
// Attempt to filter it
|
||||
var val = jQuery.filter(t,r);
|
||||
ret = r = val.r;
|
||||
t = jQuery.trim(val.t);
|
||||
}
|
||||
}
|
||||
|
||||
// An error occurred with the selector;
|
||||
// just return an empty set instead
|
||||
if ( t )
|
||||
ret = [];
|
||||
|
||||
// Remove the root context
|
||||
if ( ret && context == ret[0] )
|
||||
ret.shift();
|
||||
|
||||
// And combine the results
|
||||
done = jQuery.merge( done, ret );
|
||||
|
||||
return done;
|
||||
},
|
||||
|
||||
classFilter: function(r,m,not){
|
||||
m = " " + m + " ";
|
||||
var tmp = [];
|
||||
for ( var i = 0; r[i]; i++ ) {
|
||||
var pass = (" " + r[i].className + " ").indexOf( m ) >= 0;
|
||||
if ( !not && pass || not && !pass )
|
||||
tmp.push( r[i] );
|
||||
}
|
||||
return tmp;
|
||||
},
|
||||
|
||||
filter: function(t,r,not) {
|
||||
var last;
|
||||
|
||||
// Look for common filter expressions
|
||||
while ( t && t != last ) {
|
||||
last = t;
|
||||
|
||||
var p = jQuery.parse, m;
|
||||
|
||||
for ( var i = 0; p[i]; i++ ) {
|
||||
m = p[i].exec( t );
|
||||
|
||||
if ( m ) {
|
||||
// Remove what we just matched
|
||||
t = t.substring( m[0].length );
|
||||
|
||||
m[2] = m[2].replace(/\\/g, "");
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
if ( !m )
|
||||
break;
|
||||
|
||||
// :not() is a special case that can be optimized by
|
||||
// keeping it out of the expression list
|
||||
if ( m[1] == ":" && m[2] == "not" )
|
||||
r = jQuery.filter(m[3], r, true).r;
|
||||
|
||||
// We can get a big speed boost by filtering by class here
|
||||
else if ( m[1] == "." )
|
||||
r = jQuery.classFilter(r, m[2], not);
|
||||
|
||||
else if ( m[1] == "[" ) {
|
||||
var tmp = [], type = m[3];
|
||||
|
||||
for ( var i = 0, rl = r.length; i < rl; i++ ) {
|
||||
var a = r[i], z = a[ jQuery.props[m[2]] || m[2] ];
|
||||
|
||||
if ( z == null || /href|src|selected/.test(m[2]) )
|
||||
z = jQuery.attr(a,m[2]) || '';
|
||||
|
||||
if ( (type == "" && !!z ||
|
||||
type == "=" && z == m[5] ||
|
||||
type == "!=" && z != m[5] ||
|
||||
type == "^=" && z && !z.indexOf(m[5]) ||
|
||||
type == "$=" && z.substr(z.length - m[5].length) == m[5] ||
|
||||
(type == "*=" || type == "~=") && z.indexOf(m[5]) >= 0) ^ not )
|
||||
tmp.push( a );
|
||||
}
|
||||
|
||||
r = tmp;
|
||||
|
||||
// We can get a speed boost by handling nth-child here
|
||||
} else if ( m[1] == ":" && m[2] == "nth-child" ) {
|
||||
var num = jQuery.mergeNum++, tmp = [],
|
||||
test = /(\d*)n\+?(\d*)/.exec(
|
||||
m[3] == "even" && "2n" || m[3] == "odd" && "2n+1" ||
|
||||
!/\D/.test(m[3]) && "n+" + m[3] || m[3]),
|
||||
first = (test[1] || 1) - 0, last = test[2] - 0;
|
||||
|
||||
for ( var i = 0, rl = r.length; i < rl; i++ ) {
|
||||
var node = r[i], parentNode = node.parentNode;
|
||||
|
||||
if ( num != parentNode.mergeNum ) {
|
||||
var c = 1;
|
||||
|
||||
for ( var n = parentNode.firstChild; n; n = n.nextSibling )
|
||||
if ( n.nodeType == 1 )
|
||||
n.nodeIndex = c++;
|
||||
|
||||
parentNode.mergeNum = num;
|
||||
}
|
||||
|
||||
var add = false;
|
||||
|
||||
if ( first == 1 ) {
|
||||
if ( last == 0 || node.nodeIndex == last )
|
||||
add = true;
|
||||
} else if ( (node.nodeIndex + last) % first == 0 )
|
||||
add = true;
|
||||
|
||||
if ( add ^ not )
|
||||
tmp.push( node );
|
||||
}
|
||||
|
||||
r = tmp;
|
||||
|
||||
// Otherwise, find the expression to execute
|
||||
} else {
|
||||
var f = jQuery.expr[m[1]];
|
||||
if ( typeof f != "string" )
|
||||
f = jQuery.expr[m[1]][m[2]];
|
||||
|
||||
// Build a custom macro to enclose it
|
||||
f = eval("false||function(a,i){return " + f + "}");
|
||||
|
||||
// Execute it against the current filter
|
||||
r = jQuery.grep( r, f, not );
|
||||
}
|
||||
}
|
||||
|
||||
// Return an array of filtered elements (r)
|
||||
// and the modified expression string (t)
|
||||
return { r: r, t: t };
|
||||
},
|
||||
|
||||
parents: function( elem ){
|
||||
var matched = [];
|
||||
var cur = elem.parentNode;
|
||||
while ( cur && cur != document ) {
|
||||
matched.push( cur );
|
||||
cur = cur.parentNode;
|
||||
}
|
||||
return matched;
|
||||
},
|
||||
|
||||
nth: function(cur,result,dir,elem){
|
||||
result = result || 1;
|
||||
var num = 0;
|
||||
|
||||
for ( ; cur; cur = cur[dir] )
|
||||
if ( cur.nodeType == 1 && ++num == result )
|
||||
break;
|
||||
|
||||
return cur;
|
||||
},
|
||||
|
||||
sibling: function( n, elem ) {
|
||||
var r = [];
|
||||
|
||||
for ( ; n; n = n.nextSibling ) {
|
||||
if ( n.nodeType == 1 && (!elem || n != elem) )
|
||||
r.push( n );
|
||||
}
|
||||
|
||||
return r;
|
||||
}
|
||||
});
|
Loading…
Add table
Add a link
Reference in a new issue