| 11248 | return c; |
| 11249 | } |
| 11250 | function va(a, b) { |
| 11251 | a = (function (a, b) { |
| 11252 | for ( |
| 11253 | var c = function (a) { |
| 11254 | var b = a.parentNode; |
| 11255 | if (!b) return -1; |
| 11256 | for (var b = b.firstChild, c = 0; b && b !== a; ) |
| 11257 | (b = b.nextSibling), (c += 1); |
| 11258 | return b === a ? c : -1; |
| 11259 | }, |
| 11260 | a = a, |
| 11261 | b = b, |
| 11262 | d = [], |
| 11263 | e = []; |
| 11264 | !a.isSameNode(b); |
| 11265 | |
| 11266 | ) { |
| 11267 | var f = ra(a, b); |
| 11268 | if (f === N) return null; |
| 11269 | var g = ''; |
| 11270 | if (f === qa && 0 === (g = oa(a, b)).length) return null; |
| 11271 | if ( |
| 11272 | (d.push({ |
| 11273 | node: a, |
| 11274 | relativeClass: g, |
| 11275 | index: c(a), |
| 11276 | }), |
| 11277 | e.push(b), |
| 11278 | (a = a.parentNode), |
| 11279 | (b = b.parentNode), |
| 11280 | !a || !b) |
| 11281 | ) |
| 11282 | return null; |
| 11283 | } |
| 11284 | return a && b && a.isSameNode(b) && d.length > 0 |
| 11285 | ? { |
| 11286 | parentNode: a, |
| 11287 | node1Tree: d.reverse(), |
| 11288 | node2Tree: e.reverse(), |
| 11289 | } |
| 11290 | : null; |
| 11291 | })(a, b); |
| 11292 | if (!a) return null; |
| 11293 | b = (function (a, b, c) { |
| 11294 | for (var d = [], a = a.firstChild; a; ) |
| 11295 | a.isSameNode(b.node) || |
| 11296 | a.isSameNode(c) || |
| 11297 | !ra(b.node, a) || |
| 11298 | d.push(a), |
| 11299 | (a = a.nextSibling); |
| 11300 | return d; |
| 11301 | })(a.parentNode, a.node1Tree[0], a.node2Tree[0]); |
| 11302 | return b && 0 !== b.length ? ua(b, a.node1Tree) : null; |
| 11303 | } |
| 11304 | function O(a) { |
| 11305 | return (O = |
| 11306 | 'function' == typeof Symbol && |