The 5Ws of Outsourcing - O2I (2024)

";// Support: Safari<4// Catch class over-cachingdiv.firstChild.className = "i";// Support: Opera<10// Catch gEBCN failure to find non-leading classesreturn div.getElementsByClassName("i").length === 2;});// Support: IE<10// Check if getElementById returns elements by name// The broken getElementById methods don't pick up programatically-set names,// so use a roundabout getElementsByName testsupport.getById = assert(function( div ) {docElem.appendChild( div ).id = expando;return !doc.getElementsByName || !doc.getElementsByName( expando ).length;});// ID find and filterif ( support.getById ) {Expr.find["ID"] = function( id, context ) {if ( typeof context.getElementById !== strundefined && documentIsHTML ) {var m = context.getElementById( id );// Check parentNode to catch when Blackberry 4.6 returns// nodes that are no longer in the document #6963return m && m.parentNode ? [m] : [];}};Expr.filter["ID"] = function( id ) {var attrId = id.replace( runescape, funescape );return function( elem ) {return elem.getAttribute("id") === attrId;};};} else {// Support: IE6/7// getElementById is not reliable as a find shortcutdelete Expr.find["ID"];Expr.filter["ID"] = function( id ) {var attrId = id.replace( runescape, funescape );return function( elem ) {var node = typeof elem.getAttributeNode !== strundefined && elem.getAttributeNode("id");return node && node.value === attrId;};};}// TagExpr.find["TAG"] = support.getElementsByTagName ?function( tag, context ) {if ( typeof context.getElementsByTagName !== strundefined ) {return context.getElementsByTagName( tag );}} :function( tag, context ) {var elem,tmp = [],i = 0,results = context.getElementsByTagName( tag );// Filter out possible commentsif ( tag === "*" ) {while ( (elem = results[i++]) ) {if ( elem.nodeType === 1 ) {tmp.push( elem );}}return tmp;}return results;};// ClassExpr.find["CLASS"] = support.getElementsByClassName && function( className, context ) {if ( typeof context.getElementsByClassName !== strundefined && documentIsHTML ) {return context.getElementsByClassName( className );}};/* QSA/matchesSelector---------------------------------------------------------------------- */// QSA and matchesSelector support// matchesSelector(:active) reports false when true (IE9/Opera 11.5)rbuggyMatches = [];// qSa(:focus) reports false when true (Chrome 21)// We allow this because of a bug in IE8/9 that throws an error// whenever `document.activeElement` is accessed on an iframe// So, we allow :focus to pass through QSA all the time to avoid the IE error// See http://bugs.jquery.com/ticket/13378rbuggyQSA = [];if ( (support.qsa = rnative.test( doc.querySelectorAll )) ) {// Build QSA regex// Regex strategy adopted from Diego Periniassert(function( div ) {// Select is set to empty string on purpose// This is to test IE's treatment of not explicitly// setting a boolean content attribute,// since its presence should be enough// http://bugs.jquery.com/ticket/12359div.innerHTML = "";// Support: IE8, Opera 10-12// Nothing should be selected when empty strings follow ^= or $= or *=if ( div.querySelectorAll("[t^='']").length ) {rbuggyQSA.push( "[*^$]=" + whitespace + "*(?:''|\"\")" );}// Support: IE8// Boolean attributes and "value" are not treated correctlyif ( !div.querySelectorAll("[selected]").length ) {rbuggyQSA.push( "\\[" + whitespace + "*(?:value|" + booleans + ")" );}// Webkit/Opera - :checked should return selected option elements// http://www.w3.org/TR/2011/REC-css3-selectors-20110929/#checked// IE8 throws error here and will not see later testsif ( !div.querySelectorAll(":checked").length ) {rbuggyQSA.push(":checked");}});assert(function( div ) {// Support: Windows 8 Native Apps// The type and name attributes are restricted during .innerHTML assignmentvar input = doc.createElement("input");input.setAttribute( "type", "hidden" );div.appendChild( input ).setAttribute( "name", "D" );// Support: IE8// Enforce case-sensitivity of name attributeif ( div.querySelectorAll("[name=d]").length ) {rbuggyQSA.push( "name" + whitespace + "*[*^$|!~]?=" );}// FF 3.5 - :enabled/:disabled and hidden elements (hidden elements are still enabled)// IE8 throws error here and will not see later testsif ( !div.querySelectorAll(":enabled").length ) {rbuggyQSA.push( ":enabled", ":disabled" );}// Opera 10-11 does not throw on post-comma invalid pseudosdiv.querySelectorAll("*,:x");rbuggyQSA.push(",.*:");});}if ( (support.matchesSelector = rnative.test( (matches = docElem.webkitMatchesSelector ||docElem.mozMatchesSelector ||docElem.oMatchesSelector ||docElem.msMatchesSelector) )) ) {assert(function( div ) {// Check to see if it's possible to do matchesSelector// on a disconnected node (IE 9)support.disconnectedMatch = matches.call( div, "div" );// This should fail with an exception// Gecko does not error, returns false insteadmatches.call( div, "[s!='']:x" );rbuggyMatches.push( "!=", pseudos );});}rbuggyQSA = rbuggyQSA.length && new RegExp( rbuggyQSA.join("|") );rbuggyMatches = rbuggyMatches.length && new RegExp( rbuggyMatches.join("|") );/* Contains---------------------------------------------------------------------- */hasCompare = rnative.test( docElem.compareDocumentPosition );// Element contains another// Purposefully does not implement inclusive descendent// As in, an element does not contain itselfcontains = hasCompare || rnative.test( docElem.contains ) ?function( a, b ) {var adown = a.nodeType === 9 ? a.documentElement : a,bup = b && b.parentNode;return a === bup || !!( bup && bup.nodeType === 1 && (adown.contains ?adown.contains( bup ) :a.compareDocumentPosition && a.compareDocumentPosition( bup ) & 16));} :function( a, b ) {if ( b ) {while ( (b = b.parentNode) ) {if ( b === a ) {return true;}}}return false;};/* Sorting---------------------------------------------------------------------- */// Document order sortingsortOrder = hasCompare ?function( a, b ) {// Flag for duplicate removalif ( a === b ) {hasDuplicate = true;return 0;}// Sort on method existence if only one input has compareDocumentPositionvar compare = !a.compareDocumentPosition - !b.compareDocumentPosition;if ( compare ) {return compare;}// Calculate position if both inputs belong to the same documentcompare = ( a.ownerDocument || a ) === ( b.ownerDocument || b ) ?a.compareDocumentPosition( b ) :// Otherwise we know they are disconnected1;// Disconnected nodesif ( compare & 1 ||(!support.sortDetached && b.compareDocumentPosition( a ) === compare) ) {// Choose the first element that is related to our preferred documentif ( a === doc || a.ownerDocument === preferredDoc && contains(preferredDoc, a) ) {return -1;}if ( b === doc || b.ownerDocument === preferredDoc && contains(preferredDoc, b) ) {return 1;}// Maintain original orderreturn sortInput ?( indexOf.call( sortInput, a ) - indexOf.call( sortInput, b ) ) :0;}return compare & 4 ? -1 : 1;} :function( a, b ) {// Exit early if the nodes are identicalif ( a === b ) {hasDuplicate = true;return 0;}var cur,i = 0,aup = a.parentNode,bup = b.parentNode,ap = [ a ],bp = [ b ];// Parentless nodes are either documents or disconnectedif ( !aup || !bup ) {return a === doc ? -1 :b === doc ? 1 :aup ? -1 :bup ? 1 :sortInput ?( indexOf.call( sortInput, a ) - indexOf.call( sortInput, b ) ) :0;// If the nodes are siblings, we can do a quick check} else if ( aup === bup ) {return siblingCheck( a, b );}// Otherwise we need full lists of their ancestors for comparisoncur = a;while ( (cur = cur.parentNode) ) {ap.unshift( cur );}cur = b;while ( (cur = cur.parentNode) ) {bp.unshift( cur );}// Walk down the tree looking for a discrepancywhile ( ap[i] === bp[i] ) {i++;}return i ?// Do a sibling check if the nodes have a common ancestorsiblingCheck( ap[i], bp[i] ) :// Otherwise nodes in our document sort firstap[i] === preferredDoc ? -1 :bp[i] === preferredDoc ? 1 :0;};return doc;};Sizzle.matches = function( expr, elements ) {return Sizzle( expr, null, null, elements );};Sizzle.matchesSelector = function( elem, expr ) {// Set document vars if neededif ( ( elem.ownerDocument || elem ) !== document ) {setDocument( elem );}// Make sure that attribute selectors are quotedexpr = expr.replace( rattributeQuotes, "='$1']" );if ( support.matchesSelector && documentIsHTML &&( !rbuggyMatches || !rbuggyMatches.test( expr ) ) &&( !rbuggyQSA || !rbuggyQSA.test( expr ) ) ) {try {var ret = matches.call( elem, expr );// IE 9's matchesSelector returns false on disconnected nodesif ( ret || support.disconnectedMatch ||// As well, disconnected nodes are said to be in a document// fragment in IE 9elem.document && elem.document.nodeType !== 11 ) {return ret;}} catch(e) {}}return Sizzle( expr, document, null, [elem] ).length > 0;};Sizzle.contains = function( context, elem ) {// Set document vars if neededif ( ( context.ownerDocument || context ) !== document ) {setDocument( context );}return contains( context, elem );};Sizzle.attr = function( elem, name ) {// Set document vars if neededif ( ( elem.ownerDocument || elem ) !== document ) {setDocument( elem );}var fn = Expr.attrHandle[ name.toLowerCase() ],// Don't get fooled by Object.prototype properties (jQuery #13807)val = fn && hasOwn.call( Expr.attrHandle, name.toLowerCase() ) ?fn( elem, name, !documentIsHTML ) :undefined;return val !== undefined ?val :support.attributes || !documentIsHTML ?elem.getAttribute( name ) :(val = elem.getAttributeNode(name)) && val.specified ?val.value :null;};Sizzle.error = function( msg ) {throw new Error( "Syntax error, unrecognized expression: " + msg );};/** * Document sorting and removing duplicates * @param {ArrayLike} results */Sizzle.uniqueSort = function( results ) {var elem,duplicates = [],j = 0,i = 0;// Unless we *know* we can detect duplicates, assume their presencehasDuplicate = !support.detectDuplicates;sortInput = !support.sortStable && results.slice( 0 );results.sort( sortOrder );if ( hasDuplicate ) {while ( (elem = results[i++]) ) {if ( elem === results[ i ] ) {j = duplicates.push( i );}}while ( j-- ) {results.splice( duplicates[ j ], 1 );}}// Clear input after sorting to release objects// See https://github.com/jquery/sizzle/pull/225sortInput = null;return results;};/** * Utility function for retrieving the text value of an array of DOM nodes * @param {Array|Element} elem */getText = Sizzle.getText = function( elem ) {var node,ret = "",i = 0,nodeType = elem.nodeType;if ( !nodeType ) {// If no nodeType, this is expected to be an arraywhile ( (node = elem[i++]) ) {// Do not traverse comment nodesret += getText( node );}} else if ( nodeType === 1 || nodeType === 9 || nodeType === 11 ) {// Use textContent for elements// innerText usage removed for consistency of new lines (jQuery #11153)if ( typeof elem.textContent === "string" ) {return elem.textContent;} else {// Traverse its childrenfor ( elem = elem.firstChild; elem; elem = elem.nextSibling ) {ret += getText( elem );}}} else if ( nodeType === 3 || nodeType === 4 ) {return elem.nodeValue;}// Do not include comment or processing instruction nodesreturn ret;};Expr = Sizzle.selectors = {// Can be adjusted by the usercacheLength: 50,createPseudo: markFunction,match: matchExpr,attrHandle: {},find: {},relative: {">": { dir: "parentNode", first: true }," ": { dir: "parentNode" },"+": { dir: "previousSibling", first: true },"~": { dir: "previousSibling" }},preFilter: {"ATTR": function( match ) {match[1] = match[1].replace( runescape, funescape );// Move the given value to match[3] whether quoted or unquotedmatch[3] = ( match[4] || match[5] || "" ).replace( runescape, funescape );if ( match[2] === "~=" ) {match[3] = " " + match[3] + " ";}return match.slice( 0, 4 );},"CHILD": function( match ) {/* matches from matchExpr["CHILD"]1 type (only|nth|...)2 what (child|of-type)3 argument (even|odd|\d*|\d*n([+-]\d+)?|...)4 xn-component of xn+y argument ([+-]?\d*n|)5 sign of xn-component6 x of xn-component7 sign of y-component8 y of y-component*/match[1] = match[1].toLowerCase();if ( match[1].slice( 0, 3 ) === "nth" ) {// nth-* requires argumentif ( !match[3] ) {Sizzle.error( match[0] );}// numeric x and y parameters for Expr.filter.CHILD// remember that false/true cast respectively to 0/1match[4] = +( match[4] ? match[5] + (match[6] || 1) : 2 * ( match[3] === "even" || match[3] === "odd" ) );match[5] = +( ( match[7] + match[8] ) || match[3] === "odd" );// other types prohibit arguments} else if ( match[3] ) {Sizzle.error( match[0] );}return match;},"PSEUDO": function( match ) {var excess,unquoted = !match[5] && match[2];if ( matchExpr["CHILD"].test( match[0] ) ) {return null;}// Accept quoted arguments as-isif ( match[3] && match[4] !== undefined ) {match[2] = match[4];// Strip excess characters from unquoted arguments} else if ( unquoted && rpseudo.test( unquoted ) &&// Get excess from tokenize (recursively)(excess = tokenize( unquoted, true )) &&// advance to the next closing parenthesis(excess = unquoted.indexOf( ")", unquoted.length - excess ) - unquoted.length) ) {// excess is a negative indexmatch[0] = match[0].slice( 0, excess );match[2] = unquoted.slice( 0, excess );}// Return only captures needed by the pseudo filter method (type and argument)return match.slice( 0, 3 );}},filter: {"TAG": function( nodeNameSelector ) {var nodeName = nodeNameSelector.replace( runescape, funescape ).toLowerCase();return nodeNameSelector === "*" ?function() { return true; } :function( elem ) {return elem.nodeName && elem.nodeName.toLowerCase() === nodeName;};},"CLASS": function( className ) {var pattern = classCache[ className + " " ];return pattern ||(pattern = new RegExp( "(^|" + whitespace + ")" + className + "(" + whitespace + "|$)" )) &&classCache( className, function( elem ) {return pattern.test( typeof elem.className === "string" && elem.className || typeof elem.getAttribute !== strundefined && elem.getAttribute("class") || "" );});},"ATTR": function( name, operator, check ) {return function( elem ) {var result = Sizzle.attr( elem, name );if ( result == null ) {return operator === "!=";}if ( !operator ) {return true;}result += "";return operator === "=" ? result === check :operator === "!=" ? result !== check :operator === "^=" ? check && result.indexOf( check ) === 0 :operator === "*=" ? check && result.indexOf( check ) > -1 :operator === "$=" ? check && result.slice( -check.length ) === check :operator === "~=" ? ( " " + result + " " ).indexOf( check ) > -1 :operator === "|=" ? result === check || result.slice( 0, check.length + 1 ) === check + "-" :false;};},"CHILD": function( type, what, argument, first, last ) {var simple = type.slice( 0, 3 ) !== "nth",forward = type.slice( -4 ) !== "last",ofType = what === "of-type";return first === 1 && last === 0 ?// Shortcut for :nth-*(n)function( elem ) {return !!elem.parentNode;} :function( elem, context, xml ) {var cache, outerCache, node, diff, nodeIndex, start,dir = simple !== forward ? "nextSibling" : "previousSibling",parent = elem.parentNode,name = ofType && elem.nodeName.toLowerCase(),useCache = !xml && !ofType;if ( parent ) {// :(first|last|only)-(child|of-type)if ( simple ) {while ( dir ) {node = elem;while ( (node = node[ dir ]) ) {if ( ofType ? node.nodeName.toLowerCase() === name : node.nodeType === 1 ) {return false;}}// Reverse direction for :only-* (if we haven't yet done so)start = dir = type === "only" && !start && "nextSibling";}return true;}start = [ forward ? parent.firstChild : parent.lastChild ];// non-xml :nth-child(...) stores cache data on `parent`if ( forward && useCache ) {// Seek `elem` from a previously-cached indexouterCache = parent[ expando ] || (parent[ expando ] = {});cache = outerCache[ type ] || [];nodeIndex = cache[0] === dirruns && cache[1];diff = cache[0] === dirruns && cache[2];node = nodeIndex && parent.childNodes[ nodeIndex ];while ( (node = ++nodeIndex && node && node[ dir ] ||// Fallback to seeking `elem` from the start(diff = nodeIndex = 0) || start.pop()) ) {// When found, cache indexes on `parent` and breakif ( node.nodeType === 1 && ++diff && node === elem ) {outerCache[ type ] = [ dirruns, nodeIndex, diff ];break;}}// Use previously-cached element index if available} else if ( useCache && (cache = (elem[ expando ] || (elem[ expando ] = {}))[ type ]) && cache[0] === dirruns ) {diff = cache[1];// xml :nth-child(...) or :nth-last-child(...) or :nth(-last)?-of-type(...)} else {// Use the same loop as above to seek `elem` from the startwhile ( (node = ++nodeIndex && node && node[ dir ] ||(diff = nodeIndex = 0) || start.pop()) ) {if ( ( ofType ? node.nodeName.toLowerCase() === name : node.nodeType === 1 ) && ++diff ) {// Cache the index of each encountered elementif ( useCache ) {(node[ expando ] || (node[ expando ] = {}))[ type ] = [ dirruns, diff ];}if ( node === elem ) {break;}}}}// Incorporate the offset, then check against cycle sizediff -= last;return diff === first || ( diff % first === 0 && diff / first >= 0 );}};},"PSEUDO": function( pseudo, argument ) {// pseudo-class names are case-insensitive// http://www.w3.org/TR/selectors/#pseudo-classes// Prioritize by case sensitivity in case custom pseudos are added with uppercase letters// Remember that setFilters inherits from pseudosvar args,fn = Expr.pseudos[ pseudo ] || Expr.setFilters[ pseudo.toLowerCase() ] ||Sizzle.error( "unsupported pseudo: " + pseudo );// The user may use createPseudo to indicate that// arguments are needed to create the filter function// just as Sizzle doesif ( fn[ expando ] ) {return fn( argument );}// But maintain support for old signaturesif ( fn.length > 1 ) {args = [ pseudo, pseudo, "", argument ];return Expr.setFilters.hasOwnProperty( pseudo.toLowerCase() ) ?markFunction(function( seed, matches ) {var idx,matched = fn( seed, argument ),i = matched.length;while ( i-- ) {idx = indexOf.call( seed, matched[i] );seed[ idx ] = !( matches[ idx ] = matched[i] );}}) :function( elem ) {return fn( elem, 0, args );};}return fn;}},pseudos: {// Potentially complex pseudos"not": markFunction(function( selector ) {// Trim the selector passed to compile// to avoid treating leading and trailing// spaces as combinatorsvar input = [],results = [],matcher = compile( selector.replace( rtrim, "$1" ) );return matcher[ expando ] ?markFunction(function( seed, matches, context, xml ) {var elem,unmatched = matcher( seed, null, xml, [] ),i = seed.length;// Match elements unmatched by `matcher`while ( i-- ) {if ( (elem = unmatched[i]) ) {seed[i] = !(matches[i] = elem);}}}) :function( elem, context, xml ) {input[0] = elem;matcher( input, null, xml, results );return !results.pop();};}),"has": markFunction(function( selector ) {return function( elem ) {return Sizzle( selector, elem ).length > 0;};}),"contains": markFunction(function( text ) {return function( elem ) {return ( elem.textContent || elem.innerText || getText( elem ) ).indexOf( text ) > -1;};}),// "Whether an element is represented by a :lang() selector// is based solely on the element's language value// being equal to the identifier C,// or beginning with the identifier C immediately followed by "-".// The matching of C against the element's language value is performed case-insensitively.// The identifier C does not have to be a valid language name."// http://www.w3.org/TR/selectors/#lang-pseudo"lang": markFunction( function( lang ) {// lang value must be a valid identifierif ( !ridentifier.test(lang || "") ) {Sizzle.error( "unsupported lang: " + lang );}lang = lang.replace( runescape, funescape ).toLowerCase();return function( elem ) {var elemLang;do {if ( (elemLang = documentIsHTML ?elem.lang :elem.getAttribute("xml:lang") || elem.getAttribute("lang")) ) {elemLang = elemLang.toLowerCase();return elemLang === lang || elemLang.indexOf( lang + "-" ) === 0;}} while ( (elem = elem.parentNode) && elem.nodeType === 1 );return false;};}),// Miscellaneous"target": function( elem ) {var hash = window.location && window.location.hash;return hash && hash.slice( 1 ) === elem.id;},"root": function( elem ) {return elem === docElem;},"focus": function( elem ) {return elem === document.activeElement && (!document.hasFocus || document.hasFocus()) && !!(elem.type || elem.href || ~elem.tabIndex);},// Boolean properties"enabled": function( elem ) {return elem.disabled === false;},"disabled": function( elem ) {return elem.disabled === true;},"checked": function( elem ) {// In CSS3, :checked should return both checked and selected elements// http://www.w3.org/TR/2011/REC-css3-selectors-20110929/#checkedvar nodeName = elem.nodeName.toLowerCase();return (nodeName === "input" && !!elem.checked) || (nodeName === "option" && !!elem.selected);},"selected": function( elem ) {// Accessing this property makes selected-by-default// options in Safari work properlyif ( elem.parentNode ) {elem.parentNode.selectedIndex;}return elem.selected === true;},// Contents"empty": function( elem ) {// http://www.w3.org/TR/selectors/#empty-pseudo// :empty is negated by element (1) or content nodes (text: 3; cdata: 4; entity ref: 5),// but not by others (comment: 8; processing instruction: 7; etc.)// nodeType < 6 works because attributes (2) do not appear as childrenfor ( elem = elem.firstChild; elem; elem = elem.nextSibling ) {if ( elem.nodeType < 6 ) {return false;}}return true;},"parent": function( elem ) {return !Expr.pseudos["empty"]( elem );},// Element/input types"header": function( elem ) {return rheader.test( elem.nodeName );},"input": function( elem ) {return rinputs.test( elem.nodeName );},"button": function( elem ) {var name = elem.nodeName.toLowerCase();return name === "input" && elem.type === "button" || name === "button";},"text": function( elem ) {var attr;return elem.nodeName.toLowerCase() === "input" &&elem.type === "text" &&// Support: IE<8// New HTML5 attribute values (e.g., "search") appear with elem.type === "text"( (attr = elem.getAttribute("type")) == null || attr.toLowerCase() === "text" );},// Position-in-collection"first": createPositionalPseudo(function() {return [ 0 ];}),"last": createPositionalPseudo(function( matchIndexes, length ) {return [ length - 1 ];}),"eq": createPositionalPseudo(function( matchIndexes, length, argument ) {return [ argument < 0 ? argument + length : argument ];}),"even": createPositionalPseudo(function( matchIndexes, length ) {var i = 0;for ( ; i < length; i += 2 ) {matchIndexes.push( i );}return matchIndexes;}),"odd": createPositionalPseudo(function( matchIndexes, length ) {var i = 1;for ( ; i < length; i += 2 ) {matchIndexes.push( i );}return matchIndexes;}),"lt": createPositionalPseudo(function( matchIndexes, length, argument ) {var i = argument < 0 ? argument + length : argument;for ( ; --i >= 0; ) {matchIndexes.push( i );}return matchIndexes;}),"gt": createPositionalPseudo(function( matchIndexes, length, argument ) {var i = argument < 0 ? argument + length : argument;for ( ; ++i < length; ) {matchIndexes.push( i );}return matchIndexes;})}};Expr.pseudos["nth"] = Expr.pseudos["eq"];// Add button/input type pseudosfor ( i in { radio: true, checkbox: true, file: true, password: true, image: true } ) {Expr.pseudos[ i ] = createInputPseudo( i );}for ( i in { submit: true, reset: true } ) {Expr.pseudos[ i ] = createButtonPseudo( i );}// Easy API for creating new setFiltersfunction setFilters() {}setFilters.prototype = Expr.filters = Expr.pseudos;Expr.setFilters = new setFilters();function tokenize( selector, parseOnly ) {var matched, match, tokens, type,soFar, groups, preFilters,cached = tokenCache[ selector + " " ];if ( cached ) {return parseOnly ? 0 : cached.slice( 0 );}soFar = selector;groups = [];preFilters = Expr.preFilter;while ( soFar ) {// Comma and first runif ( !matched || (match = rcomma.exec( soFar )) ) {if ( match ) {// Don't consume trailing commas as validsoFar = soFar.slice( match[0].length ) || soFar;}groups.push( (tokens = []) );}matched = false;// Combinatorsif ( (match = rcombinators.exec( soFar )) ) {matched = match.shift();tokens.push({value: matched,// Cast descendant combinators to spacetype: match[0].replace( rtrim, " " )});soFar = soFar.slice( matched.length );}// Filtersfor ( type in Expr.filter ) {if ( (match = matchExpr[ type ].exec( soFar )) && (!preFilters[ type ] ||(match = preFilters[ type ]( match ))) ) {matched = match.shift();tokens.push({value: matched,type: type,matches: match});soFar = soFar.slice( matched.length );}}if ( !matched ) {break;}}// Return the length of the invalid excess// if we're just parsing// Otherwise, throw an error or return tokensreturn parseOnly ?soFar.length :soFar ?Sizzle.error( selector ) :// Cache the tokenstokenCache( selector, groups ).slice( 0 );}function toSelector( tokens ) {var i = 0,len = tokens.length,selector = "";for ( ; i < len; i++ ) {selector += tokens[i].value;}return selector;}function addCombinator( matcher, combinator, base ) {var dir = combinator.dir,checkNonElements = base && dir === "parentNode",doneName = done++;return combinator.first ?// Check against closest ancestor/preceding elementfunction( elem, context, xml ) {while ( (elem = elem[ dir ]) ) {if ( elem.nodeType === 1 || checkNonElements ) {return matcher( elem, context, xml );}}} :// Check against all ancestor/preceding elementsfunction( elem, context, xml ) {var oldCache, outerCache,newCache = [ dirruns, doneName ];// We can't set arbitrary data on XML nodes, so they don't benefit from dir cachingif ( xml ) {while ( (elem = elem[ dir ]) ) {if ( elem.nodeType === 1 || checkNonElements ) {if ( matcher( elem, context, xml ) ) {return true;}}}} else {while ( (elem = elem[ dir ]) ) {if ( elem.nodeType === 1 || checkNonElements ) {outerCache = elem[ expando ] || (elem[ expando ] = {});if ( (oldCache = outerCache[ dir ]) &&oldCache[ 0 ] === dirruns && oldCache[ 1 ] === doneName ) {// Assign to newCache so results back-propagate to previous elementsreturn (newCache[ 2 ] = oldCache[ 2 ]);} else {// Reuse newcache so results back-propagate to previous elementsouterCache[ dir ] = newCache;// A match means we're done; a fail means we have to keep checkingif ( (newCache[ 2 ] = matcher( elem, context, xml )) ) {return true;}}}}}};}function elementMatcher( matchers ) {return matchers.length > 1 ?function( elem, context, xml ) {var i = matchers.length;while ( i-- ) {if ( !matchers[i]( elem, context, xml ) ) {return false;}}return true;} :matchers[0];}function condense( unmatched, map, filter, context, xml ) {var elem,newUnmatched = [],i = 0,len = unmatched.length,mapped = map != null;for ( ; i < len; i++ ) {if ( (elem = unmatched[i]) ) {if ( !filter || filter( elem, context, xml ) ) {newUnmatched.push( elem );if ( mapped ) {map.push( i );}}}}return newUnmatched;}function setMatcher( preFilter, selector, matcher, postFilter, postFinder, postSelector ) {if ( postFilter && !postFilter[ expando ] ) {postFilter = setMatcher( postFilter );}if ( postFinder && !postFinder[ expando ] ) {postFinder = setMatcher( postFinder, postSelector );}return markFunction(function( seed, results, context, xml ) {var temp, i, elem,preMap = [],postMap = [],preexisting = results.length,// Get initial elements from seed or contextelems = seed || multipleContexts( selector || "*", context.nodeType ? [ context ] : context, [] ),// Prefilter to get matcher input, preserving a map for seed-results synchronizationmatcherIn = preFilter && ( seed || !selector ) ?condense( elems, preMap, preFilter, context, xml ) :elems,matcherOut = matcher ?// If we have a postFinder, or filtered seed, or non-seed postFilter or preexisting results,postFinder || ( seed ? preFilter : preexisting || postFilter ) ?// ...intermediate processing is necessary[] :// ...otherwise use results directlyresults :matcherIn;// Find primary matchesif ( matcher ) {matcher( matcherIn, matcherOut, context, xml );}// Apply postFilterif ( postFilter ) {temp = condense( matcherOut, postMap );postFilter( temp, [], context, xml );// Un-match failing elements by moving them back to matcherIni = temp.length;while ( i-- ) {if ( (elem = temp[i]) ) {matcherOut[ postMap[i] ] = !(matcherIn[ postMap[i] ] = elem);}}}if ( seed ) {if ( postFinder || preFilter ) {if ( postFinder ) {// Get the final matcherOut by condensing this intermediate into postFinder contextstemp = [];i = matcherOut.length;while ( i-- ) {if ( (elem = matcherOut[i]) ) {// Restore matcherIn since elem is not yet a final matchtemp.push( (matcherIn[i] = elem) );}}postFinder( null, (matcherOut = []), temp, xml );}// Move matched elements from seed to results to keep them synchronizedi = matcherOut.length;while ( i-- ) {if ( (elem = matcherOut[i]) &&(temp = postFinder ? indexOf.call( seed, elem ) : preMap[i]) > -1 ) {seed[temp] = !(results[temp] = elem);}}}// Add elements to results, through postFinder if defined} else {matcherOut = condense(matcherOut === results ?matcherOut.splice( preexisting, matcherOut.length ) :matcherOut);if ( postFinder ) {postFinder( null, results, matcherOut, xml );} else {push.apply( results, matcherOut );}}});}function matcherFromTokens( tokens ) {var checkContext, matcher, j,len = tokens.length,leadingRelative = Expr.relative[ tokens[0].type ],implicitRelative = leadingRelative || Expr.relative[" "],i = leadingRelative ? 1 : 0,// The foundational matcher ensures that elements are reachable from top-level context(s)matchContext = addCombinator( function( elem ) {return elem === checkContext;}, implicitRelative, true ),matchAnyContext = addCombinator( function( elem ) {return indexOf.call( checkContext, elem ) > -1;}, implicitRelative, true ),matchers = [ function( elem, context, xml ) {return ( !leadingRelative && ( xml || context !== outermostContext ) ) || ((checkContext = context).nodeType ?matchContext( elem, context, xml ) :matchAnyContext( elem, context, xml ) );} ];for ( ; i < len; i++ ) {if ( (matcher = Expr.relative[ tokens[i].type ]) ) {matchers = [ addCombinator(elementMatcher( matchers ), matcher) ];} else {matcher = Expr.filter[ tokens[i].type ].apply( null, tokens[i].matches );// Return special upon seeing a positional matcherif ( matcher[ expando ] ) {// Find the next relative operator (if any) for proper handlingj = ++i;for ( ; j < len; j++ ) {if ( Expr.relative[ tokens[j].type ] ) {break;}}return setMatcher(i > 1 && elementMatcher( matchers ),i > 1 && toSelector(// If the preceding token was a descendant combinator, insert an implicit any-element `*`tokens.slice( 0, i - 1 ).concat({ value: tokens[ i - 2 ].type === " " ? "*" : "" })).replace( rtrim, "$1" ),matcher,i < j && matcherFromTokens( tokens.slice( i, j ) ),j < len && matcherFromTokens( (tokens = tokens.slice( j )) ),j < len && toSelector( tokens ));}matchers.push( matcher );}}return elementMatcher( matchers );}function matcherFromGroupMatchers( elementMatchers, setMatchers ) {var bySet = setMatchers.length > 0,byElement = elementMatchers.length > 0,superMatcher = function( seed, context, xml, results, outermost ) {var elem, j, matcher,matchedCount = 0,i = "0",unmatched = seed && [],setMatched = [],contextBackup = outermostContext,// We must always have either seed elements or outermost contextelems = seed || byElement && Expr.find["TAG"]( "*", outermost ),// Use integer dirruns iff this is the outermost matcherdirrunsUnique = (dirruns += contextBackup == null ? 1 : Math.random() || 0.1),len = elems.length;if ( outermost ) {outermostContext = context !== document && context;}// Add elements passing elementMatchers directly to results// Keep `i` a string if there are no elements so `matchedCount` will be "00" below// Support: IE<9, Safari// Tolerate NodeList properties (IE: "length"; Safari: