Edit File by line

return nodeName( elem, "input" ) && elem.type === "button" ||

[2000] Fix | Delete

nodeName( elem, "button" );

[2001] Fix | Delete

[2002] Fix | Delete

[2003] Fix | Delete

text: function( elem ) {

[2004] Fix | Delete

var attr;

[2005] Fix | Delete

return nodeName( elem, "input" ) && elem.type === "text" &&

[2006] Fix | Delete

[2007] Fix | Delete

// Support: IE <10 only

[2008] Fix | Delete

// New HTML5 attribute values (e.g., "search") appear

[2009] Fix | Delete

// with elem.type === "text"

[2010] Fix | Delete

( ( attr = elem.getAttribute( "type" ) ) == null ||

[2011] Fix | Delete

attr.toLowerCase() === "text" );

[2012] Fix | Delete

[2013] Fix | Delete

[2014] Fix | Delete

// Position-in-collection

[2015] Fix | Delete

first: createPositionalPseudo( function() {

[2016] Fix | Delete

return [ 0 ];

[2017] Fix | Delete

} ),

[2018] Fix | Delete

[2019] Fix | Delete

last: createPositionalPseudo( function( _matchIndexes, length ) {

[2020] Fix | Delete

return [ length - 1 ];

[2021] Fix | Delete

} ),

[2022] Fix | Delete

[2023] Fix | Delete

eq: createPositionalPseudo( function( _matchIndexes, length, argument ) {

[2024] Fix | Delete

return [ argument < 0 ? argument + length : argument ];

[2025] Fix | Delete

} ),

[2026] Fix | Delete

[2027] Fix | Delete

even: createPositionalPseudo( function( matchIndexes, length ) {

[2028] Fix | Delete

var i = 0;

[2029] Fix | Delete

for ( ; i < length; i += 2 ) {

[2030] Fix | Delete

matchIndexes.push( i );

[2031] Fix | Delete

}

[2032] Fix | Delete

return matchIndexes;

[2033] Fix | Delete

} ),

[2034] Fix | Delete

[2035] Fix | Delete

odd: createPositionalPseudo( function( matchIndexes, length ) {

[2036] Fix | Delete

var i = 1;

[2037] Fix | Delete

for ( ; i < length; i += 2 ) {

[2038] Fix | Delete

matchIndexes.push( i );

[2039] Fix | Delete

}

[2040] Fix | Delete

return matchIndexes;

[2041] Fix | Delete

} ),

[2042] Fix | Delete

[2043] Fix | Delete

lt: createPositionalPseudo( function( matchIndexes, length, argument ) {

[2044] Fix | Delete

var i;

[2045] Fix | Delete

[2046] Fix | Delete

if ( argument < 0 ) {

[2047] Fix | Delete

i = argument + length;

[2048] Fix | Delete

} else if ( argument > length ) {

[2049] Fix | Delete

i = length;

[2050] Fix | Delete

} else {

[2051] Fix | Delete

i = argument;

[2052] Fix | Delete

}

[2053] Fix | Delete

[2054] Fix | Delete

for ( ; --i >= 0; ) {

[2055] Fix | Delete

matchIndexes.push( i );

[2056] Fix | Delete

}

[2057] Fix | Delete

return matchIndexes;

[2058] Fix | Delete

} ),

[2059] Fix | Delete

[2060] Fix | Delete

gt: createPositionalPseudo( function( matchIndexes, length, argument ) {

[2061] Fix | Delete

var i = argument < 0 ? argument + length : argument;

[2062] Fix | Delete

for ( ; ++i < length; ) {

[2063] Fix | Delete

matchIndexes.push( i );

[2064] Fix | Delete

}

[2065] Fix | Delete

return matchIndexes;

[2066] Fix | Delete

} )

[2067] Fix | Delete

}

[2068] Fix | Delete

};

[2069] Fix | Delete

[2070] Fix | Delete

Expr.pseudos.nth = Expr.pseudos.eq;

[2071] Fix | Delete

[2072] Fix | Delete

// Add button/input type pseudos

[2073] Fix | Delete

for ( i in { radio: true, checkbox: true, file: true, password: true, image: true } ) {

[2074] Fix | Delete

Expr.pseudos[ i ] = createInputPseudo( i );

[2075] Fix | Delete

}

[2076] Fix | Delete

for ( i in { submit: true, reset: true } ) {

[2077] Fix | Delete

Expr.pseudos[ i ] = createButtonPseudo( i );

[2078] Fix | Delete

}

[2079] Fix | Delete

[2080] Fix | Delete

// Easy API for creating new setFilters

[2081] Fix | Delete

function setFilters() {}

[2082] Fix | Delete

setFilters.prototype = Expr.filters = Expr.pseudos;

[2083] Fix | Delete

Expr.setFilters = new setFilters();

[2084] Fix | Delete

[2085] Fix | Delete

function tokenize( selector, parseOnly ) {

[2086] Fix | Delete

var matched, match, tokens, type,

[2087] Fix | Delete

soFar, groups, preFilters,

[2088] Fix | Delete

cached = tokenCache[ selector + " " ];

[2089] Fix | Delete

[2090] Fix | Delete

if ( cached ) {

[2091] Fix | Delete

return parseOnly ? 0 : cached.slice( 0 );

[2092] Fix | Delete

}

[2093] Fix | Delete

[2094] Fix | Delete

soFar = selector;

[2095] Fix | Delete

groups = [];

[2096] Fix | Delete

preFilters = Expr.preFilter;

[2097] Fix | Delete

[2098] Fix | Delete

while ( soFar ) {

[2099] Fix | Delete

[2100] Fix | Delete

// Comma and first run

[2101] Fix | Delete

if ( !matched || ( match = rcomma.exec( soFar ) ) ) {

[2102] Fix | Delete

if ( match ) {

[2103] Fix | Delete

[2104] Fix | Delete

// Don't consume trailing commas as valid

[2105] Fix | Delete

soFar = soFar.slice( match[ 0 ].length ) || soFar;

[2106] Fix | Delete

}

[2107] Fix | Delete

groups.push( ( tokens = [] ) );

[2108] Fix | Delete

}

[2109] Fix | Delete

[2110] Fix | Delete

matched = false;

[2111] Fix | Delete

[2112] Fix | Delete

// Combinators

[2113] Fix | Delete

if ( ( match = rleadingCombinator.exec( soFar ) ) ) {

[2114] Fix | Delete

matched = match.shift();

[2115] Fix | Delete

tokens.push( {

[2116] Fix | Delete

value: matched,

[2117] Fix | Delete

[2118] Fix | Delete

// Cast descendant combinators to space

[2119] Fix | Delete

type: match[ 0 ].replace( rtrimCSS, " " )

[2120] Fix | Delete

} );

[2121] Fix | Delete

soFar = soFar.slice( matched.length );

[2122] Fix | Delete

}

[2123] Fix | Delete

[2124] Fix | Delete

// Filters

[2125] Fix | Delete

for ( type in Expr.filter ) {

[2126] Fix | Delete

if ( ( match = matchExpr[ type ].exec( soFar ) ) && ( !preFilters[ type ] ||

[2127] Fix | Delete

( match = preFilters[ type ]( match ) ) ) ) {

[2128] Fix | Delete

matched = match.shift();

[2129] Fix | Delete

tokens.push( {

[2130] Fix | Delete

value: matched,

[2131] Fix | Delete

type: type,

[2132] Fix | Delete

matches: match

[2133] Fix | Delete

} );

[2134] Fix | Delete

soFar = soFar.slice( matched.length );

[2135] Fix | Delete

}

[2136] Fix | Delete

}

[2137] Fix | Delete

[2138] Fix | Delete

if ( !matched ) {

[2139] Fix | Delete

break;

[2140] Fix | Delete

}

[2141] Fix | Delete

}

[2142] Fix | Delete

[2143] Fix | Delete

// Return the length of the invalid excess

[2144] Fix | Delete

// if we're just parsing

[2145] Fix | Delete

// Otherwise, throw an error or return tokens

[2146] Fix | Delete

if ( parseOnly ) {

[2147] Fix | Delete

return soFar.length;

[2148] Fix | Delete

}

[2149] Fix | Delete

[2150] Fix | Delete

return soFar ?

[2151] Fix | Delete

find.error( selector ) :

[2152] Fix | Delete

[2153] Fix | Delete

// Cache the tokens

[2154] Fix | Delete

tokenCache( selector, groups ).slice( 0 );

[2155] Fix | Delete

}

[2156] Fix | Delete

[2157] Fix | Delete

function toSelector( tokens ) {

[2158] Fix | Delete

var i = 0,

[2159] Fix | Delete

len = tokens.length,

[2160] Fix | Delete

selector = "";

[2161] Fix | Delete

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

[2162] Fix | Delete

selector += tokens[ i ].value;

[2163] Fix | Delete

}

[2164] Fix | Delete

return selector;

[2165] Fix | Delete

}

[2166] Fix | Delete

[2167] Fix | Delete

function addCombinator( matcher, combinator, base ) {

[2168] Fix | Delete

var dir = combinator.dir,

[2169] Fix | Delete

skip = combinator.next,

[2170] Fix | Delete

key = skip || dir,

[2171] Fix | Delete

checkNonElements = base && key === "parentNode",

[2172] Fix | Delete

doneName = done++;

[2173] Fix | Delete

[2174] Fix | Delete

return combinator.first ?

[2175] Fix | Delete

[2176] Fix | Delete

// Check against closest ancestor/preceding element

[2177] Fix | Delete

function( elem, context, xml ) {

[2178] Fix | Delete

while ( ( elem = elem[ dir ] ) ) {

[2179] Fix | Delete

if ( elem.nodeType === 1 || checkNonElements ) {

[2180] Fix | Delete

return matcher( elem, context, xml );

[2181] Fix | Delete

}

[2182] Fix | Delete

}

[2183] Fix | Delete

return false;

[2184] Fix | Delete

} :

[2185] Fix | Delete

[2186] Fix | Delete

// Check against all ancestor/preceding elements

[2187] Fix | Delete

function( elem, context, xml ) {

[2188] Fix | Delete

var oldCache, outerCache,

[2189] Fix | Delete

newCache = [ dirruns, doneName ];

[2190] Fix | Delete

[2191] Fix | Delete

// We can't set arbitrary data on XML nodes, so they don't benefit from combinator caching

[2192] Fix | Delete

if ( xml ) {

[2193] Fix | Delete

while ( ( elem = elem[ dir ] ) ) {

[2194] Fix | Delete

if ( elem.nodeType === 1 || checkNonElements ) {

[2195] Fix | Delete

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

[2196] Fix | Delete

return true;

[2197] Fix | Delete

}

[2198] Fix | Delete

}

[2199] Fix | Delete

}

[2200] Fix | Delete

} else {

[2201] Fix | Delete

while ( ( elem = elem[ dir ] ) ) {

[2202] Fix | Delete

if ( elem.nodeType === 1 || checkNonElements ) {

[2203] Fix | Delete

outerCache = elem[ expando ] || ( elem[ expando ] = {} );

[2204] Fix | Delete

[2205] Fix | Delete

if ( skip && nodeName( elem, skip ) ) {

[2206] Fix | Delete

elem = elem[ dir ] || elem;

[2207] Fix | Delete

} else if ( ( oldCache = outerCache[ key ] ) &&

[2208] Fix | Delete

oldCache[ 0 ] === dirruns && oldCache[ 1 ] === doneName ) {

[2209] Fix | Delete

[2210] Fix | Delete

// Assign to newCache so results back-propagate to previous elements

[2211] Fix | Delete

return ( newCache[ 2 ] = oldCache[ 2 ] );

[2212] Fix | Delete

} else {

[2213] Fix | Delete

[2214] Fix | Delete

// Reuse newcache so results back-propagate to previous elements

[2215] Fix | Delete

outerCache[ key ] = newCache;

[2216] Fix | Delete

[2217] Fix | Delete

// A match means we're done; a fail means we have to keep checking

[2218] Fix | Delete

if ( ( newCache[ 2 ] = matcher( elem, context, xml ) ) ) {

[2219] Fix | Delete

return true;

[2220] Fix | Delete

}

[2221] Fix | Delete

}

[2222] Fix | Delete

}

[2223] Fix | Delete

}

[2224] Fix | Delete

}

[2225] Fix | Delete

return false;

[2226] Fix | Delete

};

[2227] Fix | Delete

}

[2228] Fix | Delete

[2229] Fix | Delete

function elementMatcher( matchers ) {

[2230] Fix | Delete

return matchers.length > 1 ?

[2231] Fix | Delete

function( elem, context, xml ) {

[2232] Fix | Delete

var i = matchers.length;

[2233] Fix | Delete

while ( i-- ) {

[2234] Fix | Delete

if ( !matchers[ i ]( elem, context, xml ) ) {

[2235] Fix | Delete

return false;

[2236] Fix | Delete

}

[2237] Fix | Delete

}

[2238] Fix | Delete

return true;

[2239] Fix | Delete

} :

[2240] Fix | Delete

matchers[ 0 ];

[2241] Fix | Delete

}

[2242] Fix | Delete

[2243] Fix | Delete

function multipleContexts( selector, contexts, results ) {

[2244] Fix | Delete

var i = 0,

[2245] Fix | Delete

len = contexts.length;

[2246] Fix | Delete

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

[2247] Fix | Delete

find( selector, contexts[ i ], results );

[2248] Fix | Delete

}

[2249] Fix | Delete

return results;

[2250] Fix | Delete

}

[2251] Fix | Delete

[2252] Fix | Delete

function condense( unmatched, map, filter, context, xml ) {

[2253] Fix | Delete

var elem,

[2254] Fix | Delete

newUnmatched = [],

[2255] Fix | Delete

i = 0,

[2256] Fix | Delete

len = unmatched.length,

[2257] Fix | Delete

mapped = map != null;

[2258] Fix | Delete

[2259] Fix | Delete

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

[2260] Fix | Delete

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

[2261] Fix | Delete

if ( !filter || filter( elem, context, xml ) ) {

[2262] Fix | Delete

newUnmatched.push( elem );

[2263] Fix | Delete

if ( mapped ) {

[2264] Fix | Delete

map.push( i );

[2265] Fix | Delete

}

[2266] Fix | Delete

}

[2267] Fix | Delete

}

[2268] Fix | Delete

}

[2269] Fix | Delete

[2270] Fix | Delete

return newUnmatched;

[2271] Fix | Delete

}

[2272] Fix | Delete

[2273] Fix | Delete

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

[2274] Fix | Delete

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

[2275] Fix | Delete

postFilter = setMatcher( postFilter );

[2276] Fix | Delete

}

[2277] Fix | Delete

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

[2278] Fix | Delete

postFinder = setMatcher( postFinder, postSelector );

[2279] Fix | Delete

}

[2280] Fix | Delete

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

[2281] Fix | Delete

var temp, i, elem, matcherOut,

[2282] Fix | Delete

preMap = [],

[2283] Fix | Delete

postMap = [],

[2284] Fix | Delete

preexisting = results.length,

[2285] Fix | Delete

[2286] Fix | Delete

// Get initial elements from seed or context

[2287] Fix | Delete

elems = seed ||

[2288] Fix | Delete

multipleContexts( selector || "*",

[2289] Fix | Delete

context.nodeType ? [ context ] : context, [] ),

[2290] Fix | Delete

[2291] Fix | Delete

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

[2292] Fix | Delete

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

[2293] Fix | Delete

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

[2294] Fix | Delete

elems;

[2295] Fix | Delete

[2296] Fix | Delete

if ( matcher ) {

[2297] Fix | Delete

[2298] Fix | Delete

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

[2299] Fix | Delete

// or preexisting results,

[2300] Fix | Delete

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

[2301] Fix | Delete

[2302] Fix | Delete

// ...intermediate processing is necessary

[2303] Fix | Delete

[] :

[2304] Fix | Delete

[2305] Fix | Delete

// ...otherwise use results directly

[2306] Fix | Delete

results;

[2307] Fix | Delete

[2308] Fix | Delete

// Find primary matches

[2309] Fix | Delete

matcher( matcherIn, matcherOut, context, xml );

[2310] Fix | Delete

} else {

[2311] Fix | Delete

matcherOut = matcherIn;

[2312] Fix | Delete

}

[2313] Fix | Delete

[2314] Fix | Delete

// Apply postFilter

[2315] Fix | Delete

if ( postFilter ) {

[2316] Fix | Delete

temp = condense( matcherOut, postMap );

[2317] Fix | Delete

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

[2318] Fix | Delete

[2319] Fix | Delete

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

[2320] Fix | Delete

i = temp.length;

[2321] Fix | Delete

while ( i-- ) {

[2322] Fix | Delete

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

[2323] Fix | Delete

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

[2324] Fix | Delete

}

[2325] Fix | Delete

}

[2326] Fix | Delete

}

[2327] Fix | Delete

[2328] Fix | Delete

if ( seed ) {

[2329] Fix | Delete

if ( postFinder || preFilter ) {

[2330] Fix | Delete

if ( postFinder ) {

[2331] Fix | Delete

[2332] Fix | Delete

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

[2333] Fix | Delete

temp = [];

[2334] Fix | Delete

i = matcherOut.length;

[2335] Fix | Delete

while ( i-- ) {

[2336] Fix | Delete

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

[2337] Fix | Delete

[2338] Fix | Delete

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

[2339] Fix | Delete

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

[2340] Fix | Delete

}

[2341] Fix | Delete

}

[2342] Fix | Delete

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

[2343] Fix | Delete

}

[2344] Fix | Delete

[2345] Fix | Delete

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

[2346] Fix | Delete

i = matcherOut.length;

[2347] Fix | Delete

while ( i-- ) {

[2348] Fix | Delete

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

[2349] Fix | Delete

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

[2350] Fix | Delete

[2351] Fix | Delete

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

[2352] Fix | Delete

}

[2353] Fix | Delete

}

[2354] Fix | Delete

}

[2355] Fix | Delete

[2356] Fix | Delete

// Add elements to results, through postFinder if defined

[2357] Fix | Delete

} else {

[2358] Fix | Delete

matcherOut = condense(

[2359] Fix | Delete

matcherOut === results ?

[2360] Fix | Delete

matcherOut.splice( preexisting, matcherOut.length ) :

[2361] Fix | Delete

matcherOut

[2362] Fix | Delete

);

[2363] Fix | Delete

if ( postFinder ) {

[2364] Fix | Delete

postFinder( null, results, matcherOut, xml );

[2365] Fix | Delete

} else {

[2366] Fix | Delete

push.apply( results, matcherOut );

[2367] Fix | Delete

}

[2368] Fix | Delete

}

[2369] Fix | Delete

} );

[2370] Fix | Delete

}

[2371] Fix | Delete

[2372] Fix | Delete

function matcherFromTokens( tokens ) {

[2373] Fix | Delete

var checkContext, matcher, j,

[2374] Fix | Delete

len = tokens.length,

[2375] Fix | Delete

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

[2376] Fix | Delete

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

[2377] Fix | Delete

i = leadingRelative ? 1 : 0,

[2378] Fix | Delete

[2379] Fix | Delete

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

[2380] Fix | Delete

matchContext = addCombinator( function( elem ) {

[2381] Fix | Delete

return elem === checkContext;

[2382] Fix | Delete

}, implicitRelative, true ),

[2383] Fix | Delete

matchAnyContext = addCombinator( function( elem ) {

[2384] Fix | Delete

return indexOf.call( checkContext, elem ) > -1;

[2385] Fix | Delete

}, implicitRelative, true ),

[2386] Fix | Delete

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

[2387] Fix | Delete

[2388] Fix | Delete

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

[2389] Fix | Delete

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

[2390] Fix | Delete

// two documents; shallow comparisons work.

[2391] Fix | Delete

// eslint-disable-next-line eqeqeq

[2392] Fix | Delete

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

[2393] Fix | Delete

( checkContext = context ).nodeType ?

[2394] Fix | Delete

matchContext( elem, context, xml ) :

[2395] Fix | Delete

matchAnyContext( elem, context, xml ) );

[2396] Fix | Delete

[2397] Fix | Delete

// Avoid hanging onto element

[2398] Fix | Delete

// (see https://github.com/jquery/sizzle/issues/299)

[2399] Fix | Delete

checkContext = null;

[2400] Fix | Delete

return ret;

[2401] Fix | Delete

} ];

[2402] Fix | Delete

[2403] Fix | Delete

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

[2404] Fix | Delete

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

[2405] Fix | Delete

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

[2406] Fix | Delete

} else {

[2407] Fix | Delete

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

[2408] Fix | Delete

[2409] Fix | Delete

// Return special upon seeing a positional matcher

[2410] Fix | Delete

if ( matcher[ expando ] ) {

[2411] Fix | Delete

[2412] Fix | Delete

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

[2413] Fix | Delete

j = ++i;

[2414] Fix | Delete

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

[2415] Fix | Delete

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

[2416] Fix | Delete

break;

[2417] Fix | Delete

}

[2418] Fix | Delete

}

[2419] Fix | Delete

return setMatcher(

[2420] Fix | Delete

i > 1 && elementMatcher( matchers ),

[2421] Fix | Delete

i > 1 && toSelector(

[2422] Fix | Delete

[2423] Fix | Delete

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

[2424] Fix | Delete

tokens.slice( 0, i - 1 )

[2425] Fix | Delete

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

[2426] Fix | Delete

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

[2427] Fix | Delete

matcher,

[2428] Fix | Delete

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

[2429] Fix | Delete

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

[2430] Fix | Delete

j < len && toSelector( tokens )

[2431] Fix | Delete

);

[2432] Fix | Delete

}

[2433] Fix | Delete

matchers.push( matcher );

[2434] Fix | Delete

}

[2435] Fix | Delete

}

[2436] Fix | Delete

[2437] Fix | Delete

return elementMatcher( matchers );

[2438] Fix | Delete

}

[2439] Fix | Delete

[2440] Fix | Delete

function matcherFromGroupMatchers( elementMatchers, setMatchers ) {

[2441] Fix | Delete

var bySet = setMatchers.length > 0,

[2442] Fix | Delete

byElement = elementMatchers.length > 0,

[2443] Fix | Delete

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

[2444] Fix | Delete

var elem, j, matcher,

[2445] Fix | Delete

matchedCount = 0,

[2446] Fix | Delete

i = "0",

[2447] Fix | Delete

unmatched = seed && [],

[2448] Fix | Delete

setMatched = [],

[2449] Fix | Delete

contextBackup = outermostContext,

[2450] Fix | Delete

[2451] Fix | Delete

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

[2452] Fix | Delete

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

[2453] Fix | Delete

[2454] Fix | Delete

// Use integer dirruns iff this is the outermost matcher

[2455] Fix | Delete

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

[2456] Fix | Delete

len = elems.length;

[2457] Fix | Delete

[2458] Fix | Delete

if ( outermost ) {

[2459] Fix | Delete

[2460] Fix | Delete

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

[2461] Fix | Delete

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

[2462] Fix | Delete

// two documents; shallow comparisons work.

[2463] Fix | Delete

// eslint-disable-next-line eqeqeq

[2464] Fix | Delete

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

[2465] Fix | Delete

}

[2466] Fix | Delete

[2467] Fix | Delete

// Add elements passing elementMatchers directly to results

[2468] Fix | Delete

// Support: iOS <=7 - 9 only

[2469] Fix | Delete

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

[2470] Fix | Delete

// elements by id. (see trac-14142)

[2471] Fix | Delete

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

[2472] Fix | Delete

if ( byElement && elem ) {

[2473] Fix | Delete

j = 0;

[2474] Fix | Delete

[2475] Fix | Delete

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

[2476] Fix | Delete

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

[2477] Fix | Delete

// two documents; shallow comparisons work.

[2478] Fix | Delete

// eslint-disable-next-line eqeqeq

[2479] Fix | Delete

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

[2480] Fix | Delete

setDocument( elem );

[2481] Fix | Delete

xml = !documentIsHTML;

[2482] Fix | Delete

}

[2483] Fix | Delete

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

[2484] Fix | Delete

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

[2485] Fix | Delete

push.call( results, elem );

[2486] Fix | Delete

break;

[2487] Fix | Delete

}

[2488] Fix | Delete

}

[2489] Fix | Delete

if ( outermost ) {

[2490] Fix | Delete

dirruns = dirrunsUnique;

[2491] Fix | Delete

}

[2492] Fix | Delete

}

[2493] Fix | Delete

[2494] Fix | Delete

// Track unmatched elements for set filters

[2495] Fix | Delete

if ( bySet ) {

[2496] Fix | Delete

[2497] Fix | Delete

// They will have gone through all possible matchers

[2498] Fix | Delete

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

[2499] Fix | Delete

1 2 3 456 ...22