return newUnmatched;

[2500] Fix | Delete

}

[2501] Fix | Delete

[2502] Fix | Delete

function setMatcher( preFilter, selector, matcher, postFilter, postFinder, postSelector ) {

[2503] Fix | Delete

if ( postFilter && !postFilter[ expando ] ) {

[2504] Fix | Delete

postFilter = setMatcher( postFilter );

[2505] Fix | Delete

}

[2506] Fix | Delete

if ( postFinder && !postFinder[ expando ] ) {

[2507] Fix | Delete

postFinder = setMatcher( postFinder, postSelector );

[2508] Fix | Delete

}

[2509] Fix | Delete

return markFunction( function( seed, results, context, xml ) {

[2510] Fix | Delete

var temp, i, elem,

[2511] Fix | Delete

preMap = [],

[2512] Fix | Delete

postMap = [],

[2513] Fix | Delete

preexisting = results.length,

[2514] Fix | Delete

[2515] Fix | Delete

// Get initial elements from seed or context

[2516] Fix | Delete

elems = seed || multipleContexts(

[2517] Fix | Delete

selector || "*",

[2518] Fix | Delete

context.nodeType ? [ context ] : context,

[2519] Fix | Delete

[]

[2520] Fix | Delete

),

[2521] Fix | Delete

[2522] Fix | Delete

// Prefilter to get matcher input, preserving a map for seed-results synchronization

[2523] Fix | Delete

matcherIn = preFilter && ( seed || !selector ) ?

[2524] Fix | Delete

condense( elems, preMap, preFilter, context, xml ) :

[2525] Fix | Delete

elems,

[2526] Fix | Delete

[2527] Fix | Delete

matcherOut = matcher ?

[2528] Fix | Delete

[2529] Fix | Delete

// If we have a postFinder, or filtered seed, or non-seed postFilter or preexisting results,

[2530] Fix | Delete

postFinder || ( seed ? preFilter : preexisting || postFilter ) ?

[2531] Fix | Delete

[2532] Fix | Delete

// ...intermediate processing is necessary

[2533] Fix | Delete

[] :

[2534] Fix | Delete

[2535] Fix | Delete

// ...otherwise use results directly

[2536] Fix | Delete

results :

[2537] Fix | Delete

matcherIn;

[2538] Fix | Delete

[2539] Fix | Delete

// Find primary matches

[2540] Fix | Delete

if ( matcher ) {

[2541] Fix | Delete

matcher( matcherIn, matcherOut, context, xml );

[2542] Fix | Delete

}

[2543] Fix | Delete

[2544] Fix | Delete

// Apply postFilter

[2545] Fix | Delete

if ( postFilter ) {

[2546] Fix | Delete

temp = condense( matcherOut, postMap );

[2547] Fix | Delete

postFilter( temp, [], context, xml );

[2548] Fix | Delete

[2549] Fix | Delete

// Un-match failing elements by moving them back to matcherIn

[2550] Fix | Delete

i = temp.length;

[2551] Fix | Delete

while ( i-- ) {

[2552] Fix | Delete

if ( ( elem = temp[ i ] ) ) {

[2553] Fix | Delete

matcherOut[ postMap[ i ] ] = !( matcherIn[ postMap[ i ] ] = elem );

[2554] Fix | Delete

}

[2555] Fix | Delete

}

[2556] Fix | Delete

}

[2557] Fix | Delete

[2558] Fix | Delete

if ( seed ) {

[2559] Fix | Delete

if ( postFinder || preFilter ) {

[2560] Fix | Delete

if ( postFinder ) {

[2561] Fix | Delete

[2562] Fix | Delete

// Get the final matcherOut by condensing this intermediate into postFinder contexts

[2563] Fix | Delete

temp = [];

[2564] Fix | Delete

i = matcherOut.length;

[2565] Fix | Delete

while ( i-- ) {

[2566] Fix | Delete

if ( ( elem = matcherOut[ i ] ) ) {

[2567] Fix | Delete

[2568] Fix | Delete

// Restore matcherIn since elem is not yet a final match

[2569] Fix | Delete

temp.push( ( matcherIn[ i ] = elem ) );

[2570] Fix | Delete

}

[2571] Fix | Delete

}

[2572] Fix | Delete

postFinder( null, ( matcherOut = [] ), temp, xml );

[2573] Fix | Delete

}

[2574] Fix | Delete

[2575] Fix | Delete

// Move matched elements from seed to results to keep them synchronized

[2576] Fix | Delete

i = matcherOut.length;

[2577] Fix | Delete

while ( i-- ) {

[2578] Fix | Delete

if ( ( elem = matcherOut[ i ] ) &&

[2579] Fix | Delete

( temp = postFinder ? indexOf( seed, elem ) : preMap[ i ] ) > -1 ) {

[2580] Fix | Delete

[2581] Fix | Delete

seed[ temp ] = !( results[ temp ] = elem );

[2582] Fix | Delete

}

[2583] Fix | Delete

}

[2584] Fix | Delete

}

[2585] Fix | Delete

[2586] Fix | Delete

// Add elements to results, through postFinder if defined

[2587] Fix | Delete

} else {

[2588] Fix | Delete

matcherOut = condense(

[2589] Fix | Delete

matcherOut === results ?

[2590] Fix | Delete

matcherOut.splice( preexisting, matcherOut.length ) :

[2591] Fix | Delete

matcherOut

[2592] Fix | Delete

);

[2593] Fix | Delete

if ( postFinder ) {

[2594] Fix | Delete

postFinder( null, results, matcherOut, xml );

[2595] Fix | Delete

} else {

[2596] Fix | Delete

push.apply( results, matcherOut );

[2597] Fix | Delete

}

[2598] Fix | Delete

}

[2599] Fix | Delete

} );

[2600] Fix | Delete

}

[2601] Fix | Delete

[2602] Fix | Delete

function matcherFromTokens( tokens ) {

[2603] Fix | Delete

var checkContext, matcher, j,

[2604] Fix | Delete

len = tokens.length,

[2605] Fix | Delete

leadingRelative = Expr.relative[ tokens[ 0 ].type ],

[2606] Fix | Delete

implicitRelative = leadingRelative || Expr.relative[ " " ],

[2607] Fix | Delete

i = leadingRelative ? 1 : 0,

[2608] Fix | Delete

[2609] Fix | Delete

// The foundational matcher ensures that elements are reachable from top-level context(s)

[2610] Fix | Delete

matchContext = addCombinator( function( elem ) {

[2611] Fix | Delete

return elem === checkContext;

[2612] Fix | Delete

}, implicitRelative, true ),

[2613] Fix | Delete

matchAnyContext = addCombinator( function( elem ) {

[2614] Fix | Delete

return indexOf( checkContext, elem ) > -1;

[2615] Fix | Delete

}, implicitRelative, true ),

[2616] Fix | Delete

matchers = [ function( elem, context, xml ) {

[2617] Fix | Delete

var ret = ( !leadingRelative && ( xml || context !== outermostContext ) ) || (

[2618] Fix | Delete

( checkContext = context ).nodeType ?

[2619] Fix | Delete

matchContext( elem, context, xml ) :

[2620] Fix | Delete

matchAnyContext( elem, context, xml ) );

[2621] Fix | Delete

[2622] Fix | Delete

// Avoid hanging onto element (issue #299)

[2623] Fix | Delete

checkContext = null;

[2624] Fix | Delete

return ret;

[2625] Fix | Delete

} ];

[2626] Fix | Delete

[2627] Fix | Delete

for ( ; i < len; i++ ) {

[2628] Fix | Delete

if ( ( matcher = Expr.relative[ tokens[ i ].type ] ) ) {

[2629] Fix | Delete

matchers = [ addCombinator( elementMatcher( matchers ), matcher ) ];

[2630] Fix | Delete

} else {

[2631] Fix | Delete

matcher = Expr.filter[ tokens[ i ].type ].apply( null, tokens[ i ].matches );

[2632] Fix | Delete

[2633] Fix | Delete

// Return special upon seeing a positional matcher

[2634] Fix | Delete

if ( matcher[ expando ] ) {

[2635] Fix | Delete

[2636] Fix | Delete

// Find the next relative operator (if any) for proper handling

[2637] Fix | Delete

j = ++i;

[2638] Fix | Delete

for ( ; j < len; j++ ) {

[2639] Fix | Delete

if ( Expr.relative[ tokens[ j ].type ] ) {

[2640] Fix | Delete

break;

[2641] Fix | Delete

}

[2642] Fix | Delete

}

[2643] Fix | Delete

return setMatcher(

[2644] Fix | Delete

i > 1 && elementMatcher( matchers ),

[2645] Fix | Delete

i > 1 && toSelector(

[2646] Fix | Delete

[2647] Fix | Delete

// If the preceding token was a descendant combinator, insert an implicit any-element `*`

[2648] Fix | Delete

tokens

[2649] Fix | Delete

.slice( 0, i - 1 )

[2650] Fix | Delete

.concat( { value: tokens[ i - 2 ].type === " " ? "*" : "" } )

[2651] Fix | Delete

).replace( rtrim, "$1" ),

[2652] Fix | Delete

matcher,

[2653] Fix | Delete

i < j && matcherFromTokens( tokens.slice( i, j ) ),

[2654] Fix | Delete

j < len && matcherFromTokens( ( tokens = tokens.slice( j ) ) ),

[2655] Fix | Delete

j < len && toSelector( tokens )

[2656] Fix | Delete

);

[2657] Fix | Delete

}

[2658] Fix | Delete

matchers.push( matcher );

[2659] Fix | Delete

}

[2660] Fix | Delete

}

[2661] Fix | Delete

[2662] Fix | Delete

return elementMatcher( matchers );

[2663] Fix | Delete

}

[2664] Fix | Delete

[2665] Fix | Delete

function matcherFromGroupMatchers( elementMatchers, setMatchers ) {

[2666] Fix | Delete

var bySet = setMatchers.length > 0,

[2667] Fix | Delete

byElement = elementMatchers.length > 0,

[2668] Fix | Delete

superMatcher = function( seed, context, xml, results, outermost ) {

[2669] Fix | Delete

var elem, j, matcher,

[2670] Fix | Delete

matchedCount = 0,

[2671] Fix | Delete

i = "0",

[2672] Fix | Delete

unmatched = seed && [],

[2673] Fix | Delete

setMatched = [],

[2674] Fix | Delete

contextBackup = outermostContext,

[2675] Fix | Delete

[2676] Fix | Delete

// We must always have either seed elements or outermost context

[2677] Fix | Delete

elems = seed || byElement && Expr.find[ "TAG" ]( "*", outermost ),

[2678] Fix | Delete

[2679] Fix | Delete

// Use integer dirruns iff this is the outermost matcher

[2680] Fix | Delete

dirrunsUnique = ( dirruns += contextBackup == null ? 1 : Math.random() || 0.1 ),

[2681] Fix | Delete

len = elems.length;

[2682] Fix | Delete

[2683] Fix | Delete

if ( outermost ) {

[2684] Fix | Delete

[2685] Fix | Delete

// Support: IE 11+, Edge 17 - 18+

[2686] Fix | Delete

// IE/Edge sometimes throw a "Permission denied" error when strict-comparing

[2687] Fix | Delete

// two documents; shallow comparisons work.

[2688] Fix | Delete

// eslint-disable-next-line eqeqeq

[2689] Fix | Delete

outermostContext = context == document || context || outermost;

[2690] Fix | Delete

}

[2691] Fix | Delete

[2692] Fix | Delete

// Add elements passing elementMatchers directly to results

[2693] Fix | Delete

// Support: IE<9, Safari

[2694] Fix | Delete

// Tolerate NodeList properties (IE: "length"; Safari: <number>) matching elements by id

[2695] Fix | Delete

for ( ; i !== len && ( elem = elems[ i ] ) != null; i++ ) {

[2696] Fix | Delete

if ( byElement && elem ) {

[2697] Fix | Delete

j = 0;

[2698] Fix | Delete

[2699] Fix | Delete

// Support: IE 11+, Edge 17 - 18+

[2700] Fix | Delete

// IE/Edge sometimes throw a "Permission denied" error when strict-comparing

[2701] Fix | Delete

// two documents; shallow comparisons work.

[2702] Fix | Delete

// eslint-disable-next-line eqeqeq

[2703] Fix | Delete

if ( !context && elem.ownerDocument != document ) {

[2704] Fix | Delete

setDocument( elem );

[2705] Fix | Delete

xml = !documentIsHTML;

[2706] Fix | Delete

}

[2707] Fix | Delete

while ( ( matcher = elementMatchers[ j++ ] ) ) {

[2708] Fix | Delete

if ( matcher( elem, context || document, xml ) ) {

[2709] Fix | Delete

results.push( elem );

[2710] Fix | Delete

break;

[2711] Fix | Delete

}

[2712] Fix | Delete

}

[2713] Fix | Delete

if ( outermost ) {

[2714] Fix | Delete

dirruns = dirrunsUnique;

[2715] Fix | Delete

}

[2716] Fix | Delete

}

[2717] Fix | Delete

[2718] Fix | Delete

// Track unmatched elements for set filters

[2719] Fix | Delete

if ( bySet ) {

[2720] Fix | Delete

[2721] Fix | Delete

// They will have gone through all possible matchers

[2722] Fix | Delete

if ( ( elem = !matcher && elem ) ) {

[2723] Fix | Delete

matchedCount--;

[2724] Fix | Delete

}

[2725] Fix | Delete

[2726] Fix | Delete

// Lengthen the array for every element, matched or not

[2727] Fix | Delete

if ( seed ) {

[2728] Fix | Delete

unmatched.push( elem );

[2729] Fix | Delete

}

[2730] Fix | Delete

}

[2731] Fix | Delete

}

[2732] Fix | Delete

[2733] Fix | Delete

// `i` is now the count of elements visited above, and adding it to `matchedCount`

[2734] Fix | Delete

// makes the latter nonnegative.

[2735] Fix | Delete

matchedCount += i;

[2736] Fix | Delete

[2737] Fix | Delete

// Apply set filters to unmatched elements

[2738] Fix | Delete

// NOTE: This can be skipped if there are no unmatched elements (i.e., `matchedCount`

[2739] Fix | Delete

// equals `i`), unless we didn't visit _any_ elements in the above loop because we have

[2740] Fix | Delete

// no element matchers and no seed.

[2741] Fix | Delete

// Incrementing an initially-string "0" `i` allows `i` to remain a string only in that

[2742] Fix | Delete

// case, which will result in a "00" `matchedCount` that differs from `i` but is also

[2743] Fix | Delete

// numerically zero.

[2744] Fix | Delete

if ( bySet && i !== matchedCount ) {

[2745] Fix | Delete

j = 0;

[2746] Fix | Delete

while ( ( matcher = setMatchers[ j++ ] ) ) {

[2747] Fix | Delete

matcher( unmatched, setMatched, context, xml );

[2748] Fix | Delete

}

[2749] Fix | Delete

[2750] Fix | Delete

if ( seed ) {

[2751] Fix | Delete

[2752] Fix | Delete

// Reintegrate element matches to eliminate the need for sorting

[2753] Fix | Delete

if ( matchedCount > 0 ) {

[2754] Fix | Delete

while ( i-- ) {

[2755] Fix | Delete

if ( !( unmatched[ i ] || setMatched[ i ] ) ) {

[2756] Fix | Delete

setMatched[ i ] = pop.call( results );

[2757] Fix | Delete

}

[2758] Fix | Delete

}

[2759] Fix | Delete

}

[2760] Fix | Delete

[2761] Fix | Delete

// Discard index placeholder values to get only actual matches

[2762] Fix | Delete

setMatched = condense( setMatched );

[2763] Fix | Delete

}

[2764] Fix | Delete

[2765] Fix | Delete

// Add matches to results

[2766] Fix | Delete

push.apply( results, setMatched );

[2767] Fix | Delete

[2768] Fix | Delete

// Seedless set matches succeeding multiple successful matchers stipulate sorting

[2769] Fix | Delete

if ( outermost && !seed && setMatched.length > 0 &&

[2770] Fix | Delete

( matchedCount + setMatchers.length ) > 1 ) {

[2771] Fix | Delete

[2772] Fix | Delete

Sizzle.uniqueSort( results );

[2773] Fix | Delete

}

[2774] Fix | Delete

}

[2775] Fix | Delete

[2776] Fix | Delete

// Override manipulation of globals by nested matchers

[2777] Fix | Delete

if ( outermost ) {

[2778] Fix | Delete

dirruns = dirrunsUnique;

[2779] Fix | Delete

outermostContext = contextBackup;

[2780] Fix | Delete

}

[2781] Fix | Delete

[2782] Fix | Delete

return unmatched;

[2783] Fix | Delete

};

[2784] Fix | Delete

[2785] Fix | Delete

return bySet ?

[2786] Fix | Delete

markFunction( superMatcher ) :

[2787] Fix | Delete

superMatcher;

[2788] Fix | Delete

}

[2789] Fix | Delete

[2790] Fix | Delete

compile = Sizzle.compile = function( selector, match /* Internal Use Only */ ) {

[2791] Fix | Delete

var i,

[2792] Fix | Delete

setMatchers = [],

[2793] Fix | Delete

elementMatchers = [],

[2794] Fix | Delete

cached = compilerCache[ selector + " " ];

[2795] Fix | Delete

[2796] Fix | Delete

if ( !cached ) {

[2797] Fix | Delete

[2798] Fix | Delete

// Generate a function of recursive functions that can be used to check each element

[2799] Fix | Delete

if ( !match ) {

[2800] Fix | Delete

match = tokenize( selector );

[2801] Fix | Delete

}

[2802] Fix | Delete

i = match.length;

[2803] Fix | Delete

while ( i-- ) {

[2804] Fix | Delete

cached = matcherFromTokens( match[ i ] );

[2805] Fix | Delete

if ( cached[ expando ] ) {

[2806] Fix | Delete

setMatchers.push( cached );

[2807] Fix | Delete

} else {

[2808] Fix | Delete

elementMatchers.push( cached );

[2809] Fix | Delete

}

[2810] Fix | Delete

}

[2811] Fix | Delete

[2812] Fix | Delete

// Cache the compiled function

[2813] Fix | Delete

cached = compilerCache(

[2814] Fix | Delete

selector,

[2815] Fix | Delete

matcherFromGroupMatchers( elementMatchers, setMatchers )

[2816] Fix | Delete

);

[2817] Fix | Delete

[2818] Fix | Delete

// Save selector and tokenization

[2819] Fix | Delete

cached.selector = selector;

[2820] Fix | Delete

}

[2821] Fix | Delete

return cached;

[2822] Fix | Delete

};

[2823] Fix | Delete

[2824] Fix | Delete

/**

[2825] Fix | Delete

* A low-level selection function that works with Sizzle's compiled

[2826] Fix | Delete

* selector functions

[2827] Fix | Delete

* @param {String|Function} selector A selector or a pre-compiled

[2828] Fix | Delete

* selector function built with Sizzle.compile

[2829] Fix | Delete

* @param {Element} context

[2830] Fix | Delete

* @param {Array} [results]

[2831] Fix | Delete

* @param {Array} [seed] A set of elements to match against

[2832] Fix | Delete

*/

[2833] Fix | Delete

select = Sizzle.select = function( selector, context, results, seed ) {

[2834] Fix | Delete

var i, tokens, token, type, find,

[2835] Fix | Delete

compiled = typeof selector === "function" && selector,

[2836] Fix | Delete

match = !seed && tokenize( ( selector = compiled.selector || selector ) );

[2837] Fix | Delete

[2838] Fix | Delete

results = results || [];

[2839] Fix | Delete

[2840] Fix | Delete

// Try to minimize operations if there is only one selector in the list and no seed

[2841] Fix | Delete

// (the latter of which guarantees us context)

[2842] Fix | Delete

if ( match.length === 1 ) {

[2843] Fix | Delete

[2844] Fix | Delete

// Reduce context if the leading compound selector is an ID

[2845] Fix | Delete

tokens = match[ 0 ] = match[ 0 ].slice( 0 );

[2846] Fix | Delete

if ( tokens.length > 2 && ( token = tokens[ 0 ] ).type === "ID" &&

[2847] Fix | Delete

context.nodeType === 9 && documentIsHTML && Expr.relative[ tokens[ 1 ].type ] ) {

[2848] Fix | Delete

[2849] Fix | Delete

context = ( Expr.find[ "ID" ]( token.matches[ 0 ]

[2850] Fix | Delete

.replace( runescape, funescape ), context ) || [] )[ 0 ];

[2851] Fix | Delete

if ( !context ) {

[2852] Fix | Delete

return results;

[2853] Fix | Delete

[2854] Fix | Delete

// Precompiled matchers will still verify ancestry, so step up a level

[2855] Fix | Delete

} else if ( compiled ) {

[2856] Fix | Delete

context = context.parentNode;

[2857] Fix | Delete

}

[2858] Fix | Delete

[2859] Fix | Delete

selector = selector.slice( tokens.shift().value.length );

[2860] Fix | Delete

}

[2861] Fix | Delete

[2862] Fix | Delete

// Fetch a seed set for right-to-left matching

[2863] Fix | Delete

i = matchExpr[ "needsContext" ].test( selector ) ? 0 : tokens.length;

[2864] Fix | Delete

while ( i-- ) {

[2865] Fix | Delete

token = tokens[ i ];

[2866] Fix | Delete

[2867] Fix | Delete

// Abort if we hit a combinator

[2868] Fix | Delete

if ( Expr.relative[ ( type = token.type ) ] ) {

[2869] Fix | Delete

break;

[2870] Fix | Delete

}

[2871] Fix | Delete

if ( ( find = Expr.find[ type ] ) ) {

[2872] Fix | Delete

[2873] Fix | Delete

// Search, expanding context for leading sibling combinators

[2874] Fix | Delete

if ( ( seed = find(

[2875] Fix | Delete

token.matches[ 0 ].replace( runescape, funescape ),

[2876] Fix | Delete

rsibling.test( tokens[ 0 ].type ) && testContext( context.parentNode ) ||

[2877] Fix | Delete

context

[2878] Fix | Delete

) ) ) {

[2879] Fix | Delete

[2880] Fix | Delete

// If seed is empty or no tokens remain, we can return early

[2881] Fix | Delete

tokens.splice( i, 1 );

[2882] Fix | Delete

selector = seed.length && toSelector( tokens );

[2883] Fix | Delete

if ( !selector ) {

[2884] Fix | Delete

push.apply( results, seed );

[2885] Fix | Delete

return results;

[2886] Fix | Delete

}

[2887] Fix | Delete

[2888] Fix | Delete

break;

[2889] Fix | Delete

}

[2890] Fix | Delete

}

[2891] Fix | Delete

}

[2892] Fix | Delete

}

[2893] Fix | Delete

[2894] Fix | Delete

// Compile and execute a filtering function if one is not provided

[2895] Fix | Delete

// Provide `match` to avoid retokenization if we modified the selector above

[2896] Fix | Delete

( compiled || compile( selector, match ) )(

[2897] Fix | Delete

seed,

[2898] Fix | Delete

context,

[2899] Fix | Delete

!documentIsHTML,

[2900] Fix | Delete

results,

[2901] Fix | Delete

!context || rsibling.test( selector ) && testContext( context.parentNode ) || context

[2902] Fix | Delete

);

[2903] Fix | Delete

return results;

[2904] Fix | Delete

};

[2905] Fix | Delete

[2906] Fix | Delete

// One-time assignments

[2907] Fix | Delete

[2908] Fix | Delete

// Sort stability

[2909] Fix | Delete

support.sortStable = expando.split( "" ).sort( sortOrder ).join( "" ) === expando;

[2910] Fix | Delete

[2911] Fix | Delete

// Support: Chrome 14-35+

[2912] Fix | Delete

// Always assume duplicates if they aren't passed to the comparison function

[2913] Fix | Delete

support.detectDuplicates = !!hasDuplicate;

[2914] Fix | Delete

[2915] Fix | Delete

// Initialize against the default document

[2916] Fix | Delete

setDocument();

[2917] Fix | Delete

[2918] Fix | Delete

// Support: Webkit<537.32 - Safari 6.0.3/Chrome 25 (fixed in Chrome 27)

[2919] Fix | Delete

// Detached nodes confoundingly follow *each other*

[2920] Fix | Delete

support.sortDetached = assert( function( el ) {

[2921] Fix | Delete

[2922] Fix | Delete

// Should return 1, but returns 4 (following)

[2923] Fix | Delete

return el.compareDocumentPosition( document.createElement( "fieldset" ) ) & 1;

[2924] Fix | Delete

} );

[2925] Fix | Delete

[2926] Fix | Delete

// Support: IE<8

[2927] Fix | Delete

// Prevent attribute/property "interpolation"

[2928] Fix | Delete

// https://msdn.microsoft.com/en-us/library/ms536429%28VS.85%29.aspx

[2929] Fix | Delete

if ( !assert( function( el ) {

[2930] Fix | Delete

el.innerHTML = "<a href='#'></a>";

[2931] Fix | Delete

return el.firstChild.getAttribute( "href" ) === "#";

[2932] Fix | Delete

} ) ) {

[2933] Fix | Delete

addHandle( "type|href|height|width", function( elem, name, isXML ) {

[2934] Fix | Delete

if ( !isXML ) {

[2935] Fix | Delete

return elem.getAttribute( name, name.toLowerCase() === "type" ? 1 : 2 );

[2936] Fix | Delete

}

[2937] Fix | Delete

} );

[2938] Fix | Delete

}

[2939] Fix | Delete

[2940] Fix | Delete

// Support: IE<9

[2941] Fix | Delete

// Use defaultValue in place of getAttribute("value")

[2942] Fix | Delete

if ( !support.attributes || !assert( function( el ) {

[2943] Fix | Delete

el.innerHTML = "<input/>";

[2944] Fix | Delete

el.firstChild.setAttribute( "value", "" );

[2945] Fix | Delete

return el.firstChild.getAttribute( "value" ) === "";

[2946] Fix | Delete

} ) ) {

[2947] Fix | Delete

addHandle( "value", function( elem, _name, isXML ) {

[2948] Fix | Delete

if ( !isXML && elem.nodeName.toLowerCase() === "input" ) {

[2949] Fix | Delete

return elem.defaultValue;

[2950] Fix | Delete

}

[2951] Fix | Delete

} );

[2952] Fix | Delete

}

[2953] Fix | Delete

[2954] Fix | Delete

// Support: IE<9

[2955] Fix | Delete

// Use getAttributeNode to fetch booleans when getAttribute lies

[2956] Fix | Delete

if ( !assert( function( el ) {

[2957] Fix | Delete

return el.getAttribute( "disabled" ) == null;

[2958] Fix | Delete

} ) ) {

[2959] Fix | Delete

addHandle( booleans, function( elem, name, isXML ) {

[2960] Fix | Delete

var val;

[2961] Fix | Delete

if ( !isXML ) {

[2962] Fix | Delete

return elem[ name ] === true ? name.toLowerCase() :

[2963] Fix | Delete

( val = elem.getAttributeNode( name ) ) && val.specified ?

[2964] Fix | Delete

val.value :

[2965] Fix | Delete

null;

[2966] Fix | Delete

}

[2967] Fix | Delete

} );

[2968] Fix | Delete

}

[2969] Fix | Delete

[2970] Fix | Delete

return Sizzle;

[2971] Fix | Delete

[2972] Fix | Delete

} )( window );

[2973] Fix | Delete

[2974] Fix | Delete

[2975] Fix | Delete

[2976] Fix | Delete

jQuery.find = Sizzle;

[2977] Fix | Delete

jQuery.expr = Sizzle.selectors;

[2978] Fix | Delete

[2979] Fix | Delete

// Deprecated

[2980] Fix | Delete

jQuery.expr[ ":" ] = jQuery.expr.pseudos;

[2981] Fix | Delete

jQuery.uniqueSort = jQuery.unique = Sizzle.uniqueSort;

[2982] Fix | Delete

jQuery.text = Sizzle.getText;

[2983] Fix | Delete

jQuery.isXMLDoc = Sizzle.isXML;

[2984] Fix | Delete

jQuery.contains = Sizzle.contains;

[2985] Fix | Delete

jQuery.escapeSelector = Sizzle.escape;

[2986] Fix | Delete

[2987] Fix | Delete

[2988] Fix | Delete

[2989] Fix | Delete

[2990] Fix | Delete

var dir = function( elem, dir, until ) {

[2991] Fix | Delete

var matched = [],

[2992] Fix | Delete

truncate = until !== undefined;

[2993] Fix | Delete

[2994] Fix | Delete

while ( ( elem = elem[ dir ] ) && elem.nodeType !== 9 ) {

[2995] Fix | Delete

if ( elem.nodeType === 1 ) {

[2996] Fix | Delete

if ( truncate && jQuery( elem ).is( until ) ) {

[2997] Fix | Delete

break;

[2998] Fix | Delete

}

[2999] Fix | Delete