-});
-/*!\r
- * Sizzle CSS Selector Engine\r
- * Copyright 2012 jQuery Foundation and other contributors\r
- * Released under the MIT license\r
- * http://sizzlejs.com/\r
- */\r
-(function( window, undefined ) {\r
-\r
-var cachedruns,\r
- assertGetIdNotName,\r
- Expr,\r
- getText,\r
- isXML,\r
- contains,\r
- compile,\r
- sortOrder,\r
- hasDuplicate,\r
- outermostContext,\r
-\r
- baseHasDuplicate = true,\r
- strundefined = "undefined",\r
-\r
- expando = ( "sizcache" + Math.random() ).replace( ".", "" ),\r
-\r
- Token = String,\r
- document = window.document,\r
- docElem = document.documentElement,\r
- dirruns = 0,\r
- done = 0,\r
- pop = [].pop,\r
- push = [].push,\r
- slice = [].slice,\r
- // Use a stripped-down indexOf if a native one is unavailable\r
- indexOf = [].indexOf || function( elem ) {\r
- var i = 0,\r
- len = this.length;\r
- for ( ; i < len; i++ ) {\r
- if ( this[i] === elem ) {\r
- return i;\r
- }\r
- }\r
- return -1;\r
- },\r
-\r
- // Augment a function for special use by Sizzle\r
- markFunction = function( fn, value ) {\r
- fn[ expando ] = value == null || value;\r
- return fn;\r
- },\r
-\r
- createCache = function() {\r
- var cache = {},\r
- keys = [];\r
-\r
- return markFunction(function( key, value ) {\r
- // Only keep the most recent entries\r
- if ( keys.push( key ) > Expr.cacheLength ) {\r
- delete cache[ keys.shift() ];\r
- }\r
-\r
- // Retrieve with (key + " ") to avoid collision with native Object.prototype properties (see Issue #157)\r
- return (cache[ key + " " ] = value);\r
- }, cache );\r
- },\r
-\r
- classCache = createCache(),\r
- tokenCache = createCache(),\r
- compilerCache = createCache(),\r
-\r
- // Regex\r
-\r
- // Whitespace characters http://www.w3.org/TR/css3-selectors/#whitespace\r
- whitespace = "[\\x20\\t\\r\\n\\f]",\r
- // http://www.w3.org/TR/css3-syntax/#characters\r
- characterEncoding = "(?:\\\\.|[-\\w]|[^\\x00-\\xa0])+",\r
-\r
- // Loosely modeled on CSS identifier characters\r
- // An unquoted value should be a CSS identifier (http://www.w3.org/TR/css3-selectors/#attribute-selectors)\r
- // Proper syntax: http://www.w3.org/TR/CSS21/syndata.html#value-def-identifier\r
- identifier = characterEncoding.replace( "w", "w#" ),\r
-\r
- // Acceptable operators http://www.w3.org/TR/selectors/#attribute-selectors\r
- operators = "([*^$|!~]?=)",\r
- attributes = "\\[" + whitespace + "*(" + characterEncoding + ")" + whitespace +\r
- "*(?:" + operators + whitespace + "*(?:(['\"])((?:\\\\.|[^\\\\])*?)\\3|(" + identifier + ")|)|)" + whitespace + "*\\]",\r
-\r
- // Prefer arguments not in parens/brackets,\r
- // then attribute selectors and non-pseudos (denoted by :),\r
- // then anything else\r
- // These preferences are here to reduce the number of selectors\r
- // needing tokenize in the PSEUDO preFilter\r
- pseudos = ":(" + characterEncoding + ")(?:\\((?:(['\"])((?:\\\\.|[^\\\\])*?)\\2|([^()[\\]]*|(?:(?:" + attributes + ")|[^:]|\\\\.)*|.*))\\)|)",\r
-\r
- // For matchExpr.POS and matchExpr.needsContext\r
- pos = ":(even|odd|eq|gt|lt|nth|first|last)(?:\\(" + whitespace +\r
- "*((?:-\\d)?\\d*)" + whitespace + "*\\)|)(?=[^-]|$)",\r
-\r
- // Leading and non-escaped trailing whitespace, capturing some non-whitespace characters preceding the latter\r
- rtrim = new RegExp( "^" + whitespace + "+|((?:^|[^\\\\])(?:\\\\.)*)" + whitespace + "+$", "g" ),\r
-\r
- rcomma = new RegExp( "^" + whitespace + "*," + whitespace + "*" ),\r
- rcombinators = new RegExp( "^" + whitespace + "*([\\x20\\t\\r\\n\\f>+~])" + whitespace + "*" ),\r
- rpseudo = new RegExp( pseudos ),\r
-\r
- // Easily-parseable/retrievable ID or TAG or CLASS selectors\r
- rquickExpr = /^(?:#([\w\-]+)|(\w+)|\.([\w\-]+))$/,\r
-\r
- rnot = /^:not/,\r
- rsibling = /[\x20\t\r\n\f]*[+~]/,\r
- rendsWithNot = /:not\($/,\r
-\r
- rheader = /h\d/i,\r
- rinputs = /input|select|textarea|button/i,\r
-\r
- rbackslash = /\\(?!\\)/g,\r
-\r
- matchExpr = {\r
- "ID": new RegExp( "^#(" + characterEncoding + ")" ),\r
- "CLASS": new RegExp( "^\\.(" + characterEncoding + ")" ),\r
- "NAME": new RegExp( "^\\[name=['\"]?(" + characterEncoding + ")['\"]?\\]" ),\r
- "TAG": new RegExp( "^(" + characterEncoding.replace( "w", "w*" ) + ")" ),\r
- "ATTR": new RegExp( "^" + attributes ),\r
- "PSEUDO": new RegExp( "^" + pseudos ),\r
- "POS": new RegExp( pos, "i" ),\r
- "CHILD": new RegExp( "^:(only|nth|first|last)-child(?:\\(" + whitespace +\r
- "*(even|odd|(([+-]|)(\\d*)n|)" + whitespace + "*(?:([+-]|)" + whitespace +\r
- "*(\\d+)|))" + whitespace + "*\\)|)", "i" ),\r
- // For use in libraries implementing .is()\r
- "needsContext": new RegExp( "^" + whitespace + "*[>+~]|" + pos, "i" )\r
- },\r
-\r
- // Support\r
-\r
- // Used for testing something on an element\r
- assert = function( fn ) {\r
- var div = document.createElement("div");\r
-\r
- try {\r
- return fn( div );\r
- } catch (e) {\r
- return false;\r
- } finally {\r
- // release memory in IE\r
- div = null;\r
- }\r
- },\r
-\r
- // Check if getElementsByTagName("*") returns only elements\r
- assertTagNameNoComments = assert(function( div ) {\r
- div.appendChild( document.createComment("") );\r
- return !div.getElementsByTagName("*").length;\r
- }),\r
-\r
- // Check if getAttribute returns normalized href attributes\r
- assertHrefNotNormalized = assert(function( div ) {\r
- div.innerHTML = "<a href='#'></a>";\r
- return div.firstChild && typeof div.firstChild.getAttribute !== strundefined &&\r
- div.firstChild.getAttribute("href") === "#";\r
- }),\r
-\r
- // Check if attributes should be retrieved by attribute nodes\r
- assertAttributes = assert(function( div ) {\r
- div.innerHTML = "<select></select>";\r
- var type = typeof div.lastChild.getAttribute("multiple");\r
- // IE8 returns a string for some attributes even when not present\r
- return type !== "boolean" && type !== "string";\r
- }),\r
-\r
- // Check if getElementsByClassName can be trusted\r
- assertUsableClassName = assert(function( div ) {\r
- // Opera can't find a second classname (in 9.6)\r
- div.innerHTML = "<div class='hidden e'></div><div class='hidden'></div>";\r
- if ( !div.getElementsByClassName || !div.getElementsByClassName("e").length ) {\r
- return false;\r
- }\r
-\r
- // Safari 3.2 caches class attributes and doesn't catch changes\r
- div.lastChild.className = "e";\r
- return div.getElementsByClassName("e").length === 2;\r
- }),\r
-\r
- // Check if getElementById returns elements by name\r
- // Check if getElementsByName privileges form controls or returns elements by ID\r
- assertUsableName = assert(function( div ) {\r
- // Inject content\r
- div.id = expando + 0;\r
- div.innerHTML = "<a name='" + expando + "'></a><div name='" + expando + "'></div>";\r
- docElem.insertBefore( div, docElem.firstChild );\r
-\r
- // Test\r
- var pass = document.getElementsByName &&\r
- // buggy browsers will return fewer than the correct 2\r
- document.getElementsByName( expando ).length === 2 +\r
- // buggy browsers will return more than the correct 0\r
- document.getElementsByName( expando + 0 ).length;\r
- assertGetIdNotName = !document.getElementById( expando );\r
-\r
- // Cleanup\r
- docElem.removeChild( div );\r
-\r
- return pass;\r
- });\r
-\r
-// If slice is not available, provide a backup\r
-try {\r
- slice.call( docElem.childNodes, 0 )[0].nodeType;\r
-} catch ( e ) {\r
- slice = function( i ) {\r
- var elem,\r
- results = [];\r
- for ( ; (elem = this[i]); i++ ) {\r
- results.push( elem );\r
- }\r
- return results;\r
- };\r
-}\r
-\r
-function Sizzle( selector, context, results, seed ) {\r
- results = results || [];\r
- context = context || document;\r
- var match, elem, xml, m,\r
- nodeType = context.nodeType;\r
-\r
- if ( !selector || typeof selector !== "string" ) {\r
- return results;\r
- }\r
-\r
- if ( nodeType !== 1 && nodeType !== 9 ) {\r
- return [];\r
- }\r
-\r
- xml = isXML( context );\r
-\r
- if ( !xml && !seed ) {\r
- if ( (match = rquickExpr.exec( selector )) ) {\r
- // Speed-up: Sizzle("#ID")\r
- if ( (m = match[1]) ) {\r
- if ( nodeType === 9 ) {\r
- elem = context.getElementById( m );\r
- // Check parentNode to catch when Blackberry 4.6 returns\r
- // nodes that are no longer in the document #6963\r
- if ( elem && elem.parentNode ) {\r
- // Handle the case where IE, Opera, and Webkit return items\r
- // by name instead of ID\r
- if ( elem.id === m ) {\r
- results.push( elem );\r
- return results;\r
- }\r
- } else {\r
- return results;\r
- }\r
- } else {\r
- // Context is not a document\r
- if ( context.ownerDocument && (elem = context.ownerDocument.getElementById( m )) &&\r
- contains( context, elem ) && elem.id === m ) {\r
- results.push( elem );\r
- return results;\r
- }\r
- }\r
-\r
- // Speed-up: Sizzle("TAG")\r
- } else if ( match[2] ) {\r
- push.apply( results, slice.call(context.getElementsByTagName( selector ), 0) );\r
- return results;\r
-\r
- // Speed-up: Sizzle(".CLASS")\r
- } else if ( (m = match[3]) && assertUsableClassName && context.getElementsByClassName ) {\r
- push.apply( results, slice.call(context.getElementsByClassName( m ), 0) );\r
- return results;\r
- }\r
- }\r
- }\r
-\r
- // All others\r
- return select( selector.replace( rtrim, "$1" ), context, results, seed, xml );\r
-}\r
-\r
-Sizzle.matches = function( expr, elements ) {\r
- return Sizzle( expr, null, null, elements );\r
-};\r
-\r
-Sizzle.matchesSelector = function( elem, expr ) {\r
- return Sizzle( expr, null, null, [ elem ] ).length > 0;\r
-};\r
-\r
-// Returns a function to use in pseudos for input types\r
-function createInputPseudo( type ) {\r
- return function( elem ) {\r
- var name = elem.nodeName.toLowerCase();\r
- return name === "input" && elem.type === type;\r
- };\r
-}\r
-\r
-// Returns a function to use in pseudos for buttons\r
-function createButtonPseudo( type ) {\r
- return function( elem ) {\r
- var name = elem.nodeName.toLowerCase();\r
- return (name === "input" || name === "button") && elem.type === type;\r
- };\r
-}\r
-\r
-// Returns a function to use in pseudos for positionals\r
-function createPositionalPseudo( fn ) {\r
- return markFunction(function( argument ) {\r
- argument = +argument;\r
- return markFunction(function( seed, matches ) {\r
- var j,\r
- matchIndexes = fn( [], seed.length, argument ),\r
- i = matchIndexes.length;\r
-\r
- // Match elements found at the specified indexes\r
- while ( i-- ) {\r
- if ( seed[ (j = matchIndexes[i]) ] ) {\r
- seed[j] = !(matches[j] = seed[j]);\r
- }\r
- }\r
- });\r
- });\r
-}\r
-\r
-/**\r
- * Utility function for retrieving the text value of an array of DOM nodes\r
- * @param {Array|Element} elem\r
- */\r
-getText = Sizzle.getText = function( elem ) {\r
- var node,\r
- ret = "",\r
- i = 0,\r
- nodeType = elem.nodeType;\r
-\r
- if ( nodeType ) {\r
- if ( nodeType === 1 || nodeType === 9 || nodeType === 11 ) {\r
- // Use textContent for elements\r
- // innerText usage removed for consistency of new lines (see #11153)\r
- if ( typeof elem.textContent === "string" ) {\r
- return elem.textContent;\r
- } else {\r
- // Traverse its children\r
- for ( elem = elem.firstChild; elem; elem = elem.nextSibling ) {\r
- ret += getText( elem );\r
- }\r
- }\r
- } else if ( nodeType === 3 || nodeType === 4 ) {\r
- return elem.nodeValue;\r
- }\r
- // Do not include comment or processing instruction nodes\r
- } else {\r
-\r
- // If no nodeType, this is expected to be an array\r
- for ( ; (node = elem[i]); i++ ) {\r
- // Do not traverse comment nodes\r
- ret += getText( node );\r
- }\r
- }\r
- return ret;\r
-};\r
-\r
-isXML = Sizzle.isXML = function( elem ) {\r
- // documentElement is verified for cases where it doesn't yet exist\r
- // (such as loading iframes in IE - #4833)\r
- var documentElement = elem && (elem.ownerDocument || elem).documentElement;\r
- return documentElement ? documentElement.nodeName !== "HTML" : false;\r
-};\r
-\r
-// Element contains another\r
-contains = Sizzle.contains = docElem.contains ?\r
- function( a, b ) {\r
- var adown = a.nodeType === 9 ? a.documentElement : a,\r
- bup = b && b.parentNode;\r
- return a === bup || !!( bup && bup.nodeType === 1 && adown.contains && adown.contains(bup) );\r
- } :\r
- docElem.compareDocumentPosition ?\r
- function( a, b ) {\r
- return b && !!( a.compareDocumentPosition( b ) & 16 );\r
- } :\r
- function( a, b ) {\r
- while ( (b = b.parentNode) ) {\r
- if ( b === a ) {\r
- return true;\r
- }\r
- }\r
- return false;\r
- };\r
-\r
-Sizzle.attr = function( elem, name ) {\r
- var val,\r
- xml = isXML( elem );\r
-\r
- if ( !xml ) {\r
- name = name.toLowerCase();\r
- }\r
- if ( (val = Expr.attrHandle[ name ]) ) {\r
- return val( elem );\r
- }\r
- if ( xml || assertAttributes ) {\r
- return elem.getAttribute( name );\r
- }\r
- val = elem.getAttributeNode( name );\r
- return val ?\r
- typeof elem[ name ] === "boolean" ?\r
- elem[ name ] ? name : null :\r
- val.specified ? val.value : null :\r
- null;\r
-};\r
-\r
-Expr = Sizzle.selectors = {\r
-\r
- // Can be adjusted by the user\r
- cacheLength: 50,\r
-\r
- createPseudo: markFunction,\r
-\r
- match: matchExpr,\r
-\r
- // IE6/7 return a modified href\r
- attrHandle: assertHrefNotNormalized ?\r
- {} :\r
- {\r
- "href": function( elem ) {\r
- return elem.getAttribute( "href", 2 );\r
- },\r
- "type": function( elem ) {\r
- return elem.getAttribute("type");\r
- }\r
- },\r
-\r
- find: {\r
- "ID": assertGetIdNotName ?\r
- function( id, context, xml ) {\r
- if ( typeof context.getElementById !== strundefined && !xml ) {\r
- var m = context.getElementById( id );\r
- // Check parentNode to catch when Blackberry 4.6 returns\r
- // nodes that are no longer in the document #6963\r
- return m && m.parentNode ? [m] : [];\r
- }\r
- } :\r
- function( id, context, xml ) {\r
- if ( typeof context.getElementById !== strundefined && !xml ) {\r
- var m = context.getElementById( id );\r
-\r
- return m ?\r
- m.id === id || typeof m.getAttributeNode !== strundefined && m.getAttributeNode("id").value === id ?\r
- [m] :\r
- undefined :\r
- [];\r
- }\r
- },\r
-\r
- "TAG": assertTagNameNoComments ?\r
- function( tag, context ) {\r
- if ( typeof context.getElementsByTagName !== strundefined ) {\r
- return context.getElementsByTagName( tag );\r
- }\r
- } :\r
- function( tag, context ) {\r
- var results = context.getElementsByTagName( tag );\r
-\r
- // Filter out possible comments\r
- if ( tag === "*" ) {\r
- var elem,\r
- tmp = [],\r
- i = 0;\r
-\r
- for ( ; (elem = results[i]); i++ ) {\r
- if ( elem.nodeType === 1 ) {\r
- tmp.push( elem );\r
- }\r
- }\r
-\r
- return tmp;\r
- }\r
- return results;\r
- },\r
-\r
- "NAME": assertUsableName && function( tag, context ) {\r
- if ( typeof context.getElementsByName !== strundefined ) {\r
- return context.getElementsByName( name );\r
- }\r
- },\r
-\r
- "CLASS": assertUsableClassName && function( className, context, xml ) {\r
- if ( typeof context.getElementsByClassName !== strundefined && !xml ) {\r
- return context.getElementsByClassName( className );\r
- }\r
- }\r
- },\r
-\r
- relative: {\r
- ">": { dir: "parentNode", first: true },\r
- " ": { dir: "parentNode" },\r
- "+": { dir: "previousSibling", first: true },\r
- "~": { dir: "previousSibling" }\r
- },\r
-\r
- preFilter: {\r
- "ATTR": function( match ) {\r
- match[1] = match[1].replace( rbackslash, "" );\r
-\r
- // Move the given value to match[3] whether quoted or unquoted\r
- match[3] = ( match[4] || match[5] || "" ).replace( rbackslash, "" );\r
-\r
- if ( match[2] === "~=" ) {\r
- match[3] = " " + match[3] + " ";\r
- }\r
-\r
- return match.slice( 0, 4 );\r
- },\r
-\r
- "CHILD": function( match ) {\r
- /* matches from matchExpr["CHILD"]\r
- 1 type (only|nth|...)\r
- 2 argument (even|odd|\d*|\d*n([+-]\d+)?|...)\r
- 3 xn-component of xn+y argument ([+-]?\d*n|)\r
- 4 sign of xn-component\r
- 5 x of xn-component\r
- 6 sign of y-component\r
- 7 y of y-component\r
- */\r
- match[1] = match[1].toLowerCase();\r
-\r
- if ( match[1] === "nth" ) {\r
- // nth-child requires argument\r
- if ( !match[2] ) {\r
- Sizzle.error( match[0] );\r
- }\r
-\r
- // numeric x and y parameters for Expr.filter.CHILD\r
- // remember that false/true cast respectively to 0/1\r
- match[3] = +( match[3] ? match[4] + (match[5] || 1) : 2 * ( match[2] === "even" || match[2] === "odd" ) );\r
- match[4] = +( ( match[6] + match[7] ) || match[2] === "odd" );\r
-\r
- // other types prohibit arguments\r
- } else if ( match[2] ) {\r
- Sizzle.error( match[0] );\r
- }\r
-\r
- return match;\r
- },\r
-\r
- "PSEUDO": function( match ) {\r
- var unquoted, excess;\r
- if ( matchExpr["CHILD"].test( match[0] ) ) {\r
- return null;\r
- }\r
-\r
- if ( match[3] ) {\r
- match[2] = match[3];\r
- } else if ( (unquoted = match[4]) ) {\r
- // Only check arguments that contain a pseudo\r
- if ( rpseudo.test(unquoted) &&\r
- // Get excess from tokenize (recursively)\r
- (excess = tokenize( unquoted, true )) &&\r
- // advance to the next closing parenthesis\r
- (excess = unquoted.indexOf( ")", unquoted.length - excess ) - unquoted.length) ) {\r
-\r
- // excess is a negative index\r
- unquoted = unquoted.slice( 0, excess );\r
- match[0] = match[0].slice( 0, excess );\r
- }\r
- match[2] = unquoted;\r
- }\r
-\r
- // Return only captures needed by the pseudo filter method (type and argument)\r
- return match.slice( 0, 3 );\r
- }\r
- },\r
-\r
- filter: {\r
- "ID": assertGetIdNotName ?\r
- function( id ) {\r
- id = id.replace( rbackslash, "" );\r
- return function( elem ) {\r
- return elem.getAttribute("id") === id;\r
- };\r
- } :\r
- function( id ) {\r
- id = id.replace( rbackslash, "" );\r
- return function( elem ) {\r
- var node = typeof elem.getAttributeNode !== strundefined && elem.getAttributeNode("id");\r
- return node && node.value === id;\r
- };\r
- },\r
-\r
- "TAG": function( nodeName ) {\r
- if ( nodeName === "*" ) {\r
- return function() { return true; };\r
- }\r
- nodeName = nodeName.replace( rbackslash, "" ).toLowerCase();\r
-\r
- return function( elem ) {\r
- return elem.nodeName && elem.nodeName.toLowerCase() === nodeName;\r
- };\r
- },\r
-\r
- "CLASS": function( className ) {\r
- var pattern = classCache[ expando ][ className + " " ];\r
-\r
- return pattern ||\r
- (pattern = new RegExp( "(^|" + whitespace + ")" + className + "(" + whitespace + "|$)" )) &&\r
- classCache( className, function( elem ) {\r
- return pattern.test( elem.className || (typeof elem.getAttribute !== strundefined && elem.getAttribute("class")) || "" );\r
- });\r
- },\r
-\r
- "ATTR": function( name, operator, check ) {\r
- return function( elem, context ) {\r
- var result = Sizzle.attr( elem, name );\r
-\r
- if ( result == null ) {\r
- return operator === "!=";\r
- }\r
- if ( !operator ) {\r
- return true;\r
- }\r
-\r
- result += "";\r
-\r
- return operator === "=" ? result === check :\r
- operator === "!=" ? result !== check :\r
- operator === "^=" ? check && result.indexOf( check ) === 0 :\r
- operator === "*=" ? check && result.indexOf( check ) > -1 :\r
- operator === "$=" ? check && result.substr( result.length - check.length ) === check :\r
- operator === "~=" ? ( " " + result + " " ).indexOf( check ) > -1 :\r
- operator === "|=" ? result === check || result.substr( 0, check.length + 1 ) === check + "-" :\r
- false;\r
- };\r
- },\r
-\r
- "CHILD": function( type, argument, first, last ) {\r
-\r
- if ( type === "nth" ) {\r
- return function( elem ) {\r
- var node, diff,\r
- parent = elem.parentNode;\r
-\r
- if ( first === 1 && last === 0 ) {\r
- return true;\r
- }\r
-\r
- if ( parent ) {\r
- diff = 0;\r
- for ( node = parent.firstChild; node; node = node.nextSibling ) {\r
- if ( node.nodeType === 1 ) {\r
- diff++;\r
- if ( elem === node ) {\r
- break;\r
- }\r
- }\r
- }\r
- }\r
-\r
- // Incorporate the offset (or cast to NaN), then check against cycle size\r
- diff -= last;\r
- return diff === first || ( diff % first === 0 && diff / first >= 0 );\r
- };\r
- }\r
-\r
- return function( elem ) {\r
- var node = elem;\r
-\r
- switch ( type ) {\r
- case "only":\r
- case "first":\r
- while ( (node = node.previousSibling) ) {\r
- if ( node.nodeType === 1 ) {\r
- return false;\r
- }\r
- }\r
-\r
- if ( type === "first" ) {\r
- return true;\r
- }\r
-\r
- node = elem;\r
-\r
- /* falls through */\r
- case "last":\r
- while ( (node = node.nextSibling) ) {\r
- if ( node.nodeType === 1 ) {\r
- return false;\r
- }\r
- }\r
-\r
- return true;\r
- }\r
- };\r
- },\r
-\r
- "PSEUDO": function( pseudo, argument ) {\r
- // pseudo-class names are case-insensitive\r
- // http://www.w3.org/TR/selectors/#pseudo-classes\r
- // Prioritize by case sensitivity in case custom pseudos are added with uppercase letters\r
- // Remember that setFilters inherits from pseudos\r
- var args,\r
- fn = Expr.pseudos[ pseudo ] || Expr.setFilters[ pseudo.toLowerCase() ] ||\r
- Sizzle.error( "unsupported pseudo: " + pseudo );\r
-\r
- // The user may use createPseudo to indicate that\r
- // arguments are needed to create the filter function\r
- // just as Sizzle does\r
- if ( fn[ expando ] ) {\r
- return fn( argument );\r
- }\r
-\r
- // But maintain support for old signatures\r
- if ( fn.length > 1 ) {\r
- args = [ pseudo, pseudo, "", argument ];\r
- return Expr.setFilters.hasOwnProperty( pseudo.toLowerCase() ) ?\r
- markFunction(function( seed, matches ) {\r
- var idx,\r
- matched = fn( seed, argument ),\r
- i = matched.length;\r
- while ( i-- ) {\r
- idx = indexOf.call( seed, matched[i] );\r
- seed[ idx ] = !( matches[ idx ] = matched[i] );\r
- }\r
- }) :\r
- function( elem ) {\r
- return fn( elem, 0, args );\r
- };\r
- }\r
-\r
- return fn;\r
- }\r
- },\r
-\r
- pseudos: {\r
- "not": markFunction(function( selector ) {\r
- // Trim the selector passed to compile\r
- // to avoid treating leading and trailing\r
- // spaces as combinators\r
- var input = [],\r
- results = [],\r
- matcher = compile( selector.replace( rtrim, "$1" ) );\r
-\r
- return matcher[ expando ] ?\r
- markFunction(function( seed, matches, context, xml ) {\r
- var elem,\r
- unmatched = matcher( seed, null, xml, [] ),\r
- i = seed.length;\r
-\r
- // Match elements unmatched by `matcher`\r
- while ( i-- ) {\r
- if ( (elem = unmatched[i]) ) {\r
- seed[i] = !(matches[i] = elem);\r
- }\r
- }\r
- }) :\r
- function( elem, context, xml ) {\r
- input[0] = elem;\r
- matcher( input, null, xml, results );\r
- return !results.pop();\r
- };\r
- }),\r
-\r
- "has": markFunction(function( selector ) {\r
- return function( elem ) {\r
- return Sizzle( selector, elem ).length > 0;\r
- };\r
- }),\r
-\r
- "contains": markFunction(function( text ) {\r
- return function( elem ) {\r
- return ( elem.textContent || elem.innerText || getText( elem ) ).indexOf( text ) > -1;\r
- };\r
- }),\r
-\r
- "enabled": function( elem ) {\r
- return elem.disabled === false;\r
- },\r
-\r
- "disabled": function( elem ) {\r
- return elem.disabled === true;\r
- },\r
-\r
- "checked": function( elem ) {\r
- // In CSS3, :checked should return both checked and selected elements\r
- // http://www.w3.org/TR/2011/REC-css3-selectors-20110929/#checked\r
- var nodeName = elem.nodeName.toLowerCase();\r
- return (nodeName === "input" && !!elem.checked) || (nodeName === "option" && !!elem.selected);\r
- },\r
-\r
- "selected": function( elem ) {\r
- // Accessing this property makes selected-by-default\r
- // options in Safari work properly\r
- if ( elem.parentNode ) {\r
- elem.parentNode.selectedIndex;\r
- }\r
-\r
- return elem.selected === true;\r
- },\r
-\r
- "parent": function( elem ) {\r
- return !Expr.pseudos["empty"]( elem );\r
- },\r
-\r
- "empty": function( elem ) {\r
- // http://www.w3.org/TR/selectors/#empty-pseudo\r
- // :empty is only affected by element nodes and content nodes(including text(3), cdata(4)),\r
- // not comment, processing instructions, or others\r
- // Thanks to Diego Perini for the nodeName shortcut\r
- // Greater than "@" means alpha characters (specifically not starting with "#" or "?")\r
- var nodeType;\r
- elem = elem.firstChild;\r
- while ( elem ) {\r
- if ( elem.nodeName > "@" || (nodeType = elem.nodeType) === 3 || nodeType === 4 ) {\r
- return false;\r
- }\r
- elem = elem.nextSibling;\r
- }\r
- return true;\r
- },\r
-\r
- "header": function( elem ) {\r
- return rheader.test( elem.nodeName );\r
- },\r
-\r
- "text": function( elem ) {\r
- var type, attr;\r
- // IE6 and 7 will map elem.type to 'text' for new HTML5 types (search, etc)\r
- // use getAttribute instead to test this case\r
- return elem.nodeName.toLowerCase() === "input" &&\r
- (type = elem.type) === "text" &&\r
- ( (attr = elem.getAttribute("type")) == null || attr.toLowerCase() === type );\r
- },\r
-\r
- // Input types\r
- "radio": createInputPseudo("radio"),\r
- "checkbox": createInputPseudo("checkbox"),\r
- "file": createInputPseudo("file"),\r
- "password": createInputPseudo("password"),\r
- "image": createInputPseudo("image"),\r
-\r
- "submit": createButtonPseudo("submit"),\r
- "reset": createButtonPseudo("reset"),\r
-\r
- "button": function( elem ) {\r
- var name = elem.nodeName.toLowerCase();\r
- return name === "input" && elem.type === "button" || name === "button";\r
- },\r
-\r
- "input": function( elem ) {\r
- return rinputs.test( elem.nodeName );\r
- },\r
-\r
- "focus": function( elem ) {\r
- var doc = elem.ownerDocument;\r
- return elem === doc.activeElement && (!doc.hasFocus || doc.hasFocus()) && !!(elem.type || elem.href || ~elem.tabIndex);\r
- },\r
-\r
- "active": function( elem ) {\r
- return elem === elem.ownerDocument.activeElement;\r
- },\r
-\r
- // Positional types\r
- "first": createPositionalPseudo(function() {\r
- return [ 0 ];\r
- }),\r
-\r
- "last": createPositionalPseudo(function( matchIndexes, length ) {\r
- return [ length - 1 ];\r
- }),\r
-\r
- "eq": createPositionalPseudo(function( matchIndexes, length, argument ) {\r
- return [ argument < 0 ? argument + length : argument ];\r
- }),\r
-\r
- "even": createPositionalPseudo(function( matchIndexes, length ) {\r
- for ( var i = 0; i < length; i += 2 ) {\r
- matchIndexes.push( i );\r
- }\r
- return matchIndexes;\r
- }),\r
-\r
- "odd": createPositionalPseudo(function( matchIndexes, length ) {\r
- for ( var i = 1; i < length; i += 2 ) {\r
- matchIndexes.push( i );\r
- }\r
- return matchIndexes;\r
- }),\r
-\r
- "lt": createPositionalPseudo(function( matchIndexes, length, argument ) {\r
- for ( var i = argument < 0 ? argument + length : argument; --i >= 0; ) {\r
- matchIndexes.push( i );\r
- }\r
- return matchIndexes;\r
- }),\r
-\r
- "gt": createPositionalPseudo(function( matchIndexes, length, argument ) {\r
- for ( var i = argument < 0 ? argument + length : argument; ++i < length; ) {\r
- matchIndexes.push( i );\r
- }\r
- return matchIndexes;\r
- })\r
- }\r
-};\r
-\r
-function siblingCheck( a, b, ret ) {\r
- if ( a === b ) {\r
- return ret;\r
- }\r
-\r
- var cur = a.nextSibling;\r
-\r
- while ( cur ) {\r
- if ( cur === b ) {\r
- return -1;\r
- }\r
-\r
- cur = cur.nextSibling;\r
- }\r
-\r
- return 1;\r
-}\r
-\r
-sortOrder = docElem.compareDocumentPosition ?\r
- function( a, b ) {\r
- if ( a === b ) {\r
- hasDuplicate = true;\r
- return 0;\r
- }\r
-\r
- return ( !a.compareDocumentPosition || !b.compareDocumentPosition ?\r
- a.compareDocumentPosition :\r
- a.compareDocumentPosition(b) & 4\r
- ) ? -1 : 1;\r
- } :\r
- function( a, b ) {\r
- // The nodes are identical, we can exit early\r
- if ( a === b ) {\r
- hasDuplicate = true;\r
- return 0;\r
-\r
- // Fallback to using sourceIndex (in IE) if it's available on both nodes\r
- } else if ( a.sourceIndex && b.sourceIndex ) {\r
- return a.sourceIndex - b.sourceIndex;\r
- }\r
-\r
- var al, bl,\r
- ap = [],\r
- bp = [],\r
- aup = a.parentNode,\r
- bup = b.parentNode,\r
- cur = aup;\r
-\r
- // If the nodes are siblings (or identical) we can do a quick check\r
- if ( aup === bup ) {\r
- return siblingCheck( a, b );\r
-\r
- // If no parents were found then the nodes are disconnected\r
- } else if ( !aup ) {\r
- return -1;\r
-\r
- } else if ( !bup ) {\r
- return 1;\r
- }\r
-\r
- // Otherwise they're somewhere else in the tree so we need\r
- // to build up a full list of the parentNodes for comparison\r
- while ( cur ) {\r
- ap.unshift( cur );\r
- cur = cur.parentNode;\r
- }\r
-\r
- cur = bup;\r
-\r
- while ( cur ) {\r
- bp.unshift( cur );\r
- cur = cur.parentNode;\r
- }\r
-\r
- al = ap.length;\r
- bl = bp.length;\r
-\r
- // Start walking down the tree looking for a discrepancy\r
- for ( var i = 0; i < al && i < bl; i++ ) {\r
- if ( ap[i] !== bp[i] ) {\r
- return siblingCheck( ap[i], bp[i] );\r
- }\r
- }\r
-\r
- // We ended someplace up the tree so do a sibling check\r
- return i === al ?\r
- siblingCheck( a, bp[i], -1 ) :\r
- siblingCheck( ap[i], b, 1 );\r
- };\r
-\r
-// Always assume the presence of duplicates if sort doesn't\r
-// pass them to our comparison function (as in Google Chrome).\r
-[0, 0].sort( sortOrder );\r
-baseHasDuplicate = !hasDuplicate;\r
-\r
-// Document sorting and removing duplicates\r
-Sizzle.uniqueSort = function( results ) {\r
- var elem,\r
- duplicates = [],\r
- i = 1,\r
- j = 0;\r
-\r
- hasDuplicate = baseHasDuplicate;\r
- results.sort( sortOrder );\r
-\r
- if ( hasDuplicate ) {\r
- for ( ; (elem = results[i]); i++ ) {\r
- if ( elem === results[ i - 1 ] ) {\r
- j = duplicates.push( i );\r
- }\r
- }\r
- while ( j-- ) {\r
- results.splice( duplicates[ j ], 1 );\r
- }\r
- }\r
-\r
- return results;\r
-};\r
-\r
-Sizzle.error = function( msg ) {\r
- throw new Error( "Syntax error, unrecognized expression: " + msg );\r
-};\r
-\r
-function tokenize( selector, parseOnly ) {\r
- var matched, match, tokens, type,\r
- soFar, groups, preFilters,\r
- cached = tokenCache[ expando ][ selector + " " ];\r
-\r
- if ( cached ) {\r
- return parseOnly ? 0 : cached.slice( 0 );\r
- }\r
-\r
- soFar = selector;\r
- groups = [];\r
- preFilters = Expr.preFilter;\r
-\r
- while ( soFar ) {\r
-\r
- // Comma and first run\r
- if ( !matched || (match = rcomma.exec( soFar )) ) {\r
- if ( match ) {\r
- // Don't consume trailing commas as valid\r
- soFar = soFar.slice( match[0].length ) || soFar;\r
- }\r
- groups.push( tokens = [] );\r
- }\r
-\r
- matched = false;\r
-\r
- // Combinators\r
- if ( (match = rcombinators.exec( soFar )) ) {\r
- tokens.push( matched = new Token( match.shift() ) );\r
- soFar = soFar.slice( matched.length );\r
-\r
- // Cast descendant combinators to space\r
- matched.type = match[0].replace( rtrim, " " );\r
- }\r
-\r
- // Filters\r
- for ( type in Expr.filter ) {\r
- if ( (match = matchExpr[ type ].exec( soFar )) && (!preFilters[ type ] ||\r
- (match = preFilters[ type ]( match ))) ) {\r
-\r
- tokens.push( matched = new Token( match.shift() ) );\r
- soFar = soFar.slice( matched.length );\r
- matched.type = type;\r
- matched.matches = match;\r
- }\r
- }\r
-\r
- if ( !matched ) {\r
- break;\r
- }\r
- }\r
-\r
- // Return the length of the invalid excess\r
- // if we're just parsing\r
- // Otherwise, throw an error or return tokens\r
- return parseOnly ?\r
- soFar.length :\r
- soFar ?\r
- Sizzle.error( selector ) :\r
- // Cache the tokens\r
- tokenCache( selector, groups ).slice( 0 );\r
-}\r
-\r
-function addCombinator( matcher, combinator, base ) {\r
- var dir = combinator.dir,\r
- checkNonElements = base && combinator.dir === "parentNode",\r
- doneName = done++;\r
-\r
- return combinator.first ?\r
- // Check against closest ancestor/preceding element\r
- function( elem, context, xml ) {\r
- while ( (elem = elem[ dir ]) ) {\r
- if ( checkNonElements || elem.nodeType === 1 ) {\r
- return matcher( elem, context, xml );\r
- }\r
- }\r
- } :\r
-\r
- // Check against all ancestor/preceding elements\r
- function( elem, context, xml ) {\r
- // We can't set arbitrary data on XML nodes, so they don't benefit from dir caching\r
- if ( !xml ) {\r
- var cache,\r
- dirkey = dirruns + " " + doneName + " ",\r
- cachedkey = dirkey + cachedruns;\r
- while ( (elem = elem[ dir ]) ) {\r
- if ( checkNonElements || elem.nodeType === 1 ) {\r
- if ( (cache = elem[ expando ]) === cachedkey ) {\r
- return elem.sizset;\r
- } else if ( typeof cache === "string" && cache.indexOf(dirkey) === 0 ) {\r
- if ( elem.sizset ) {\r
- return elem;\r
- }\r
- } else {\r
- elem[ expando ] = cachedkey;\r
- if ( matcher( elem, context, xml ) ) {\r
- elem.sizset = true;\r
- return elem;\r
- }\r
- elem.sizset = false;\r
- }\r
- }\r
- }\r
- } else {\r
- while ( (elem = elem[ dir ]) ) {\r
- if ( checkNonElements || elem.nodeType === 1 ) {\r
- if ( matcher( elem, context, xml ) ) {\r
- return elem;\r
- }\r
- }\r
- }\r
- }\r
- };\r
-}\r
-\r
-function elementMatcher( matchers ) {\r
- return matchers.length > 1 ?\r
- function( elem, context, xml ) {\r
- var i = matchers.length;\r
- while ( i-- ) {\r
- if ( !matchers[i]( elem, context, xml ) ) {\r
- return false;\r
- }\r
- }\r
- return true;\r
- } :\r
- matchers[0];\r
-}\r
-\r
-function condense( unmatched, map, filter, context, xml ) {\r
- var elem,\r
- newUnmatched = [],\r
- i = 0,\r
- len = unmatched.length,\r
- mapped = map != null;\r
-\r
- for ( ; i < len; i++ ) {\r
- if ( (elem = unmatched[i]) ) {\r
- if ( !filter || filter( elem, context, xml ) ) {\r
- newUnmatched.push( elem );\r
- if ( mapped ) {\r
- map.push( i );\r
- }\r
- }\r
- }\r
- }\r
-\r
- return newUnmatched;\r
-}\r
-\r
-function setMatcher( preFilter, selector, matcher, postFilter, postFinder, postSelector ) {\r
- if ( postFilter && !postFilter[ expando ] ) {\r
- postFilter = setMatcher( postFilter );\r
- }\r
- if ( postFinder && !postFinder[ expando ] ) {\r
- postFinder = setMatcher( postFinder, postSelector );\r
- }\r
- return markFunction(function( seed, results, context, xml ) {\r
- var temp, i, elem,\r
- preMap = [],\r
- postMap = [],\r
- preexisting = results.length,\r
-\r
- // Get initial elements from seed or context\r
- elems = seed || multipleContexts( selector || "*", context.nodeType ? [ context ] : context, [] ),\r
-\r
- // Prefilter to get matcher input, preserving a map for seed-results synchronization\r
- matcherIn = preFilter && ( seed || !selector ) ?\r
- condense( elems, preMap, preFilter, context, xml ) :\r
- elems,\r
-\r
- matcherOut = matcher ?\r
- // If we have a postFinder, or filtered seed, or non-seed postFilter or preexisting results,\r
- postFinder || ( seed ? preFilter : preexisting || postFilter ) ?\r
-\r
- // ...intermediate processing is necessary\r
- [] :\r
-\r
- // ...otherwise use results directly\r
- results :\r
- matcherIn;\r
-\r
- // Find primary matches\r
- if ( matcher ) {\r
- matcher( matcherIn, matcherOut, context, xml );\r
- }\r
-\r
- // Apply postFilter\r
- if ( postFilter ) {\r
- temp = condense( matcherOut, postMap );\r
- postFilter( temp, [], context, xml );\r
-\r
- // Un-match failing elements by moving them back to matcherIn\r
- i = temp.length;\r
- while ( i-- ) {\r
- if ( (elem = temp[i]) ) {\r
- matcherOut[ postMap[i] ] = !(matcherIn[ postMap[i] ] = elem);\r
- }\r
- }\r
- }\r
-\r
- if ( seed ) {\r
- if ( postFinder || preFilter ) {\r
- if ( postFinder ) {\r
- // Get the final matcherOut by condensing this intermediate into postFinder contexts\r
- temp = [];\r
- i = matcherOut.length;\r
- while ( i-- ) {\r
- if ( (elem = matcherOut[i]) ) {\r
- // Restore matcherIn since elem is not yet a final match\r
- temp.push( (matcherIn[i] = elem) );\r
- }\r
- }\r
- postFinder( null, (matcherOut = []), temp, xml );\r
- }\r
-\r
- // Move matched elements from seed to results to keep them synchronized\r
- i = matcherOut.length;\r
- while ( i-- ) {\r
- if ( (elem = matcherOut[i]) &&\r
- (temp = postFinder ? indexOf.call( seed, elem ) : preMap[i]) > -1 ) {\r
-\r
- seed[temp] = !(results[temp] = elem);\r
- }\r
- }\r
- }\r
-\r
- // Add elements to results, through postFinder if defined\r
- } else {\r
- matcherOut = condense(\r
- matcherOut === results ?\r
- matcherOut.splice( preexisting, matcherOut.length ) :\r
- matcherOut\r
- );\r
- if ( postFinder ) {\r
- postFinder( null, results, matcherOut, xml );\r
- } else {\r
- push.apply( results, matcherOut );\r
- }\r
- }\r
- });\r
-}\r
-\r
-function matcherFromTokens( tokens ) {\r
- var checkContext, matcher, j,\r
- len = tokens.length,\r
- leadingRelative = Expr.relative[ tokens[0].type ],\r
- implicitRelative = leadingRelative || Expr.relative[" "],\r
- i = leadingRelative ? 1 : 0,\r
-\r
- // The foundational matcher ensures that elements are reachable from top-level context(s)\r
- matchContext = addCombinator( function( elem ) {\r
- return elem === checkContext;\r
- }, implicitRelative, true ),\r
- matchAnyContext = addCombinator( function( elem ) {\r
- return indexOf.call( checkContext, elem ) > -1;\r
- }, implicitRelative, true ),\r
- matchers = [ function( elem, context, xml ) {\r
- return ( !leadingRelative && ( xml || context !== outermostContext ) ) || (\r
- (checkContext = context).nodeType ?\r
- matchContext( elem, context, xml ) :\r
- matchAnyContext( elem, context, xml ) );\r
- } ];\r
-\r
- for ( ; i < len; i++ ) {\r
- if ( (matcher = Expr.relative[ tokens[i].type ]) ) {\r
- matchers = [ addCombinator( elementMatcher( matchers ), matcher ) ];\r
- } else {\r
- matcher = Expr.filter[ tokens[i].type ].apply( null, tokens[i].matches );\r
-\r
- // Return special upon seeing a positional matcher\r
- if ( matcher[ expando ] ) {\r
- // Find the next relative operator (if any) for proper handling\r
- j = ++i;\r
- for ( ; j < len; j++ ) {\r
- if ( Expr.relative[ tokens[j].type ] ) {\r
- break;\r
- }\r
- }\r
- return setMatcher(\r
- i > 1 && elementMatcher( matchers ),\r
- i > 1 && tokens.slice( 0, i - 1 ).join("").replace( rtrim, "$1" ),\r
- matcher,\r
- i < j && matcherFromTokens( tokens.slice( i, j ) ),\r
- j < len && matcherFromTokens( (tokens = tokens.slice( j )) ),\r
- j < len && tokens.join("")\r
- );\r
- }\r
- matchers.push( matcher );\r
- }\r
- }\r
-\r
- return elementMatcher( matchers );\r
-}\r
-\r
-function matcherFromGroupMatchers( elementMatchers, setMatchers ) {\r
- var bySet = setMatchers.length > 0,\r
- byElement = elementMatchers.length > 0,\r
- superMatcher = function( seed, context, xml, results, expandContext ) {\r
- var elem, j, matcher,\r
- setMatched = [],\r
- matchedCount = 0,\r
- i = "0",\r
- unmatched = seed && [],\r
- outermost = expandContext != null,\r
- contextBackup = outermostContext,\r
- // We must always have either seed elements or context\r
- elems = seed || byElement && Expr.find["TAG"]( "*", expandContext && context.parentNode || context ),\r
- // Nested matchers should use non-integer dirruns\r
- dirrunsUnique = (dirruns += contextBackup == null ? 1 : Math.E);\r
-\r
- if ( outermost ) {\r
- outermostContext = context !== document && context;\r
- cachedruns = superMatcher.el;\r
- }\r
-\r
- // Add elements passing elementMatchers directly to results\r
- for ( ; (elem = elems[i]) != null; i++ ) {\r
- if ( byElement && elem ) {\r
- for ( j = 0; (matcher = elementMatchers[j]); j++ ) {\r
- if ( matcher( elem, context, xml ) ) {\r
- results.push( elem );\r
- break;\r
- }\r
- }\r
- if ( outermost ) {\r
- dirruns = dirrunsUnique;\r
- cachedruns = ++superMatcher.el;\r
- }\r
- }\r
-\r
- // Track unmatched elements for set filters\r
- if ( bySet ) {\r
- // They will have gone through all possible matchers\r
- if ( (elem = !matcher && elem) ) {\r
- matchedCount--;\r
- }\r
-\r
- // Lengthen the array for every element, matched or not\r
- if ( seed ) {\r
- unmatched.push( elem );\r
- }\r
- }\r
- }\r
-\r
- // Apply set filters to unmatched elements\r
- matchedCount += i;\r
- if ( bySet && i !== matchedCount ) {\r
- for ( j = 0; (matcher = setMatchers[j]); j++ ) {\r
- matcher( unmatched, setMatched, context, xml );\r
- }\r
-\r
- if ( seed ) {\r
- // Reintegrate element matches to eliminate the need for sorting\r
- if ( matchedCount > 0 ) {\r
- while ( i-- ) {\r
- if ( !(unmatched[i] || setMatched[i]) ) {\r
- setMatched[i] = pop.call( results );\r
- }\r
- }\r
- }\r
-\r
- // Discard index placeholder values to get only actual matches\r
- setMatched = condense( setMatched );\r
- }\r
-\r
- // Add matches to results\r
- push.apply( results, setMatched );\r
-\r
- // Seedless set matches succeeding multiple successful matchers stipulate sorting\r
- if ( outermost && !seed && setMatched.length > 0 &&\r
- ( matchedCount + setMatchers.length ) > 1 ) {\r
-\r
- Sizzle.uniqueSort( results );\r
- }\r
- }\r
-\r
- // Override manipulation of globals by nested matchers\r
- if ( outermost ) {\r
- dirruns = dirrunsUnique;\r
- outermostContext = contextBackup;\r
- }\r
-\r
- return unmatched;\r
- };\r
-\r
- superMatcher.el = 0;\r
- return bySet ?\r
- markFunction( superMatcher ) :\r
- superMatcher;\r
-}\r
-\r
-compile = Sizzle.compile = function( selector, group /* Internal Use Only */ ) {\r
- var i,\r
- setMatchers = [],\r
- elementMatchers = [],\r
- cached = compilerCache[ expando ][ selector + " " ];\r
-\r
- if ( !cached ) {\r
- // Generate a function of recursive functions that can be used to check each element\r
- if ( !group ) {\r
- group = tokenize( selector );\r
- }\r
- i = group.length;\r
- while ( i-- ) {\r
- cached = matcherFromTokens( group[i] );\r
- if ( cached[ expando ] ) {\r
- setMatchers.push( cached );\r
- } else {\r
- elementMatchers.push( cached );\r
- }\r
- }\r
-\r
- // Cache the compiled function\r
- cached = compilerCache( selector, matcherFromGroupMatchers( elementMatchers, setMatchers ) );\r
- }\r
- return cached;\r
-};\r
-\r
-function multipleContexts( selector, contexts, results ) {\r
- var i = 0,\r
- len = contexts.length;\r
- for ( ; i < len; i++ ) {\r
- Sizzle( selector, contexts[i], results );\r
- }\r
- return results;\r
-}\r
-\r
-function select( selector, context, results, seed, xml ) {\r
- var i, tokens, token, type, find,\r
- match = tokenize( selector ),\r
- j = match.length;\r
-\r
- if ( !seed ) {\r
- // Try to minimize operations if there is only one group\r
- if ( match.length === 1 ) {\r
-\r
- // Take a shortcut and set the context if the root selector is an ID\r
- tokens = match[0] = match[0].slice( 0 );\r
- if ( tokens.length > 2 && (token = tokens[0]).type === "ID" &&\r
- context.nodeType === 9 && !xml &&\r
- Expr.relative[ tokens[1].type ] ) {\r
-\r
- context = Expr.find["ID"]( token.matches[0].replace( rbackslash, "" ), context, xml )[0];\r
- if ( !context ) {\r
- return results;\r
- }\r
-\r
- selector = selector.slice( tokens.shift().length );\r
- }\r
-\r
- // Fetch a seed set for right-to-left matching\r
- for ( i = matchExpr["POS"].test( selector ) ? -1 : tokens.length - 1; i >= 0; i-- ) {\r
- token = tokens[i];\r
-\r
- // Abort if we hit a combinator\r
- if ( Expr.relative[ (type = token.type) ] ) {\r
- break;\r
- }\r
- if ( (find = Expr.find[ type ]) ) {\r
- // Search, expanding context for leading sibling combinators\r
- if ( (seed = find(\r
- token.matches[0].replace( rbackslash, "" ),\r
- rsibling.test( tokens[0].type ) && context.parentNode || context,\r
- xml\r
- )) ) {\r
-\r
- // If seed is empty or no tokens remain, we can return early\r
- tokens.splice( i, 1 );\r
- selector = seed.length && tokens.join("");\r
- if ( !selector ) {\r
- push.apply( results, slice.call( seed, 0 ) );\r
- return results;\r
- }\r
-\r
- break;\r
- }\r
- }\r
- }\r
- }\r
- }\r
-\r
- // Compile and execute a filtering function\r
- // Provide `match` to avoid retokenization if we modified the selector above\r
- compile( selector, match )(\r
- seed,\r
- context,\r
- xml,\r
- results,\r
- rsibling.test( selector )\r
- );\r
- return results;\r
-}\r
-\r
-if ( document.querySelectorAll ) {\r
- (function() {\r
- var disconnectedMatch,\r
- oldSelect = select,\r
- rescape = /'|\\/g,\r
- rattributeQuotes = /\=[\x20\t\r\n\f]*([^'"\]]*)[\x20\t\r\n\f]*\]/g,\r
-\r
- // qSa(:focus) reports false when true (Chrome 21), no need to also add to buggyMatches since matches checks buggyQSA\r
- // A support test would require too much code (would include document ready)\r
- rbuggyQSA = [ ":focus" ],\r
-\r
- // matchesSelector(:active) reports false when true (IE9/Opera 11.5)\r
- // A support test would require too much code (would include document ready)\r
- // just skip matchesSelector for :active\r
- rbuggyMatches = [ ":active" ],\r
- matches = docElem.matchesSelector ||\r
- docElem.mozMatchesSelector ||\r
- docElem.webkitMatchesSelector ||\r
- docElem.oMatchesSelector ||\r
- docElem.msMatchesSelector;\r
-\r
- // Build QSA regex\r
- // Regex strategy adopted from Diego Perini\r
- assert(function( div ) {\r
- // Select is set to empty string on purpose\r
- // This is to test IE's treatment of not explictly\r
- // setting a boolean content attribute,\r
- // since its presence should be enough\r
- // http://bugs.jquery.com/ticket/12359\r
- div.innerHTML = "<select><option selected=''></option></select>";\r
-\r
- // IE8 - Some boolean attributes are not treated correctly\r
- if ( !div.querySelectorAll("[selected]").length ) {\r
- rbuggyQSA.push( "\\[" + whitespace + "*(?:checked|disabled|ismap|multiple|readonly|selected|value)" );\r
- }\r
-\r
- // Webkit/Opera - :checked should return selected option elements\r
- // http://www.w3.org/TR/2011/REC-css3-selectors-20110929/#checked\r
- // IE8 throws error here (do not put tests after this one)\r
- if ( !div.querySelectorAll(":checked").length ) {\r
- rbuggyQSA.push(":checked");\r
- }\r
- });\r
-\r
- assert(function( div ) {\r
-\r
- // Opera 10-12/IE9 - ^= $= *= and empty values\r
- // Should not select anything\r
- div.innerHTML = "<p test=''></p>";\r
- if ( div.querySelectorAll("[test^='']").length ) {\r
- rbuggyQSA.push( "[*^$]=" + whitespace + "*(?:\"\"|'')" );\r
- }\r
-\r
- // FF 3.5 - :enabled/:disabled and hidden elements (hidden elements are still enabled)\r
- // IE8 throws error here (do not put tests after this one)\r
- div.innerHTML = "<input type='hidden'/>";\r
- if ( !div.querySelectorAll(":enabled").length ) {\r
- rbuggyQSA.push(":enabled", ":disabled");\r
- }\r
- });\r
-\r
- // rbuggyQSA always contains :focus, so no need for a length check\r
- rbuggyQSA = /* rbuggyQSA.length && */ new RegExp( rbuggyQSA.join("|") );\r
-\r
- select = function( selector, context, results, seed, xml ) {\r
- // Only use querySelectorAll when not filtering,\r
- // when this is not xml,\r
- // and when no QSA bugs apply\r
- if ( !seed && !xml && !rbuggyQSA.test( selector ) ) {\r
- var groups, i,\r
- old = true,\r
- nid = expando,\r
- newContext = context,\r
- newSelector = context.nodeType === 9 && selector;\r
-\r
- // qSA works strangely on Element-rooted queries\r
- // We can work around this by specifying an extra ID on the root\r
- // and working up from there (Thanks to Andrew Dupont for the technique)\r
- // IE 8 doesn't work on object elements\r
- if ( context.nodeType === 1 && context.nodeName.toLowerCase() !== "object" ) {\r
- groups = tokenize( selector );\r
-\r
- if ( (old = context.getAttribute("id")) ) {\r
- nid = old.replace( rescape, "\\$&" );\r
- } else {\r
- context.setAttribute( "id", nid );\r
- }\r
- nid = "[id='" + nid + "'] ";\r
-\r
- i = groups.length;\r
- while ( i-- ) {\r
- groups[i] = nid + groups[i].join("");\r
- }\r
- newContext = rsibling.test( selector ) && context.parentNode || context;\r
- newSelector = groups.join(",");\r
- }\r
-\r
- if ( newSelector ) {\r
- try {\r
- push.apply( results, slice.call( newContext.querySelectorAll(\r
- newSelector\r
- ), 0 ) );\r
- return results;\r
- } catch(qsaError) {\r
- } finally {\r
- if ( !old ) {\r
- context.removeAttribute("id");\r
- }\r
- }\r
- }\r
- }\r
-\r
- return oldSelect( selector, context, results, seed, xml );\r
- };\r
-\r
- if ( matches ) {\r
- assert(function( div ) {\r
- // Check to see if it's possible to do matchesSelector\r
- // on a disconnected node (IE 9)\r
- disconnectedMatch = matches.call( div, "div" );\r
-\r
- // This should fail with an exception\r
- // Gecko does not error, returns false instead\r
- try {\r
- matches.call( div, "[test!='']:sizzle" );\r
- rbuggyMatches.push( "!=", pseudos );\r
- } catch ( e ) {}\r
- });\r
-\r
- // rbuggyMatches always contains :active and :focus, so no need for a length check\r
- rbuggyMatches = /* rbuggyMatches.length && */ new RegExp( rbuggyMatches.join("|") );\r
-\r
- Sizzle.matchesSelector = function( elem, expr ) {\r
- // Make sure that attribute selectors are quoted\r
- expr = expr.replace( rattributeQuotes, "='$1']" );\r
-\r
- // rbuggyMatches always contains :active, so no need for an existence check\r
- if ( !isXML( elem ) && !rbuggyMatches.test( expr ) && !rbuggyQSA.test( expr ) ) {\r
- try {\r
- var ret = matches.call( elem, expr );\r
-\r
- // IE 9's matchesSelector returns false on disconnected nodes\r
- if ( ret || disconnectedMatch ||\r
- // As well, disconnected nodes are said to be in a document\r
- // fragment in IE 9\r
- elem.document && elem.document.nodeType !== 11 ) {\r
- return ret;\r
- }\r
- } catch(e) {}\r
- }\r
-\r
- return Sizzle( expr, null, null, [ elem ] ).length > 0;\r
- };\r
- }\r
- })();\r
-}\r
-\r
-// Deprecated\r
-Expr.pseudos["nth"] = Expr.pseudos["eq"];\r
-\r
-// Back-compat\r
-function setFilters() {}\r
-Expr.filters = setFilters.prototype = Expr.pseudos;\r
-Expr.setFilters = new setFilters();\r
-\r
-// Override sizzle attribute retrieval
-Sizzle.attr = jQuery.attr;
-jQuery.find = Sizzle;
-jQuery.expr = Sizzle.selectors;
-jQuery.expr[":"] = jQuery.expr.pseudos;
-jQuery.unique = Sizzle.uniqueSort;
-jQuery.text = Sizzle.getText;
-jQuery.isXMLDoc = Sizzle.isXML;
-jQuery.contains = Sizzle.contains;
-\r
-\r
-})( window );\r
-var runtil = /Until$/,
- rparentsprev = /^(?:parents|prev(?:Until|All))/,
- isSimple = /^.[^:#\[\.,]*$/,
- rneedsContext = jQuery.expr.match.needsContext,
- // methods guaranteed to produce a unique set when starting from a unique set
- guaranteedUnique = {
- children: true,
- contents: true,
- next: true,
- prev: true
- };