| 2589 | return i; |
| 2590 | } |
| 2591 | function wt(t, e, n, s) { |
| 2592 | var o, |
| 2593 | a, |
| 2594 | h, |
| 2595 | u, |
| 2596 | l, |
| 2597 | g = pt(t); |
| 2598 | if (!s && 1 === g.length) { |
| 2599 | if ( |
| 2600 | (a = g[0] = g[0].slice(0)).length > 2 && |
| 2601 | 'ID' === (h = a[0]).type && |
| 2602 | i.getById && |
| 2603 | 9 === e.nodeType && |
| 2604 | p && |
| 2605 | r.relative[a[1].type] |
| 2606 | ) { |
| 2607 | if (!(e = (r.find.ID(h.matches[0].replace(et, it), e) || [])[0])) return n; |
| 2608 | t = t.slice(a.shift().value.length); |
| 2609 | } |
| 2610 | o = Y.needsContext.test(t) ? 0 : a.length; |
| 2611 | for (; o--; ) { |
| 2612 | h = a[o]; |
| 2613 | if (r.relative[(u = h.type)]) break; |
| 2614 | if ( |
| 2615 | (l = r.find[u]) && |
| 2616 | (s = l(h.matches[0].replace(et, it), (V.test(a[0].type) && e.parentNode) || e)) |
| 2617 | ) { |
| 2618 | a.splice(o, 1); |
| 2619 | if (!(t = s.length && ft(a))) { |
| 2620 | O.apply(n, s); |
| 2621 | return n; |
| 2622 | } |
| 2623 | break; |
| 2624 | } |
| 2625 | } |
| 2626 | } |
| 2627 | c(t, g)(s, e, !p, n, V.test(t)); |
| 2628 | return n; |
| 2629 | } |
| 2630 | i.sortStable = y.split('').sort(b).join('') === y; |
| 2631 | i.detectDuplicates = S; |
| 2632 | u(); |