MCPcopy
hub / github.com/ndleah/python-mini-project / o

Function o

digit-recognizer/app/static/js/jquery-3.3.1.min.js:624–648  ·  view source on GitHub ↗
(o, a, s, u, c)

Source from the content-addressed store, hash-verified

622
623 function Ee(e, t) {
624 var n = t.length > 0, i = e.length > 0, o = function (o, a, s, u, c) {
625 var f, h, y, v = 0, m = "0", x = o && [], b = [], w = l, C = o || i && r.find.TAG("*", c),
626 E = T += null == w ? 1 : Math.random() || .1, k = C.length;
627 for (c && (l = a === d || a || c); m !== k && null != (f = C[m]); m++) {
628 if (i && f) {
629 h = 0, a || f.ownerDocument === d || (p(f), s = !g);
630 while (y = e[h++]) if (y(f, a || d, s)) {
631 u.push(f);
632 break
633 }
634 c && (T = E)
635 }
636 n && ((f = !y && f) && v--, o && x.push(f))
637 }
638 if (v += m, n && m !== v) {
639 h = 0;
640 while (y = t[h++]) y(x, b, a, s);
641 if (o) {
642 if (v > 0) while (m--) x[m] || b[m] || (b[m] = j.call(u));
643 b = we(b)
644 }
645 L.apply(u, b), c && !o && b.length > 0 && v + t.length > 1 && oe.uniqueSort(u)
646 }
647 return c && (T = E, l = w), x
648 };
649 return n ? se(o) : o
650 }
651

Callers 1

Calls 3

yFunction · 0.85
weFunction · 0.85
pushMethod · 0.45

Tested by

no test coverage detected