MCPcopy Create free account
hub / github.com/alignoth/alignoth / sC

Function sC

resources/vega.min.js:22638–22715  ·  view source on GitHub ↗
(t, e)

Source from the content-addressed store, hash-verified

22636 ((this._ = t), (this.next = null), (this.previous = null));
22637 }
22638 function sC(t, e) {
22639 if (
22640 !(o = (t = (function (t) {
22641 return "object" == typeof t && "length" in t ? t : Array.from(t);
22642 })(t)).length)
22643 )
22644 return 0;
22645 var n, r, i, o, a, s, u, l, c, f, h;
22646 if ((((n = t[0]).x = 0), (n.y = 0), !(o > 1))) return n.r;
22647 if (((r = t[1]), (n.x = -r.r), (r.x = n.r), (r.y = 0), !(o > 2)))
22648 return n.r + r.r;
22649 (rC(r, n, (i = t[2])),
22650 (n = new aC(n)),
22651 (r = new aC(r)),
22652 (i = new aC(i)),
22653 (n.next = i.previous = r),
22654 (r.next = n.previous = i),
22655 (i.next = r.previous = n));
22656 t: for (u = 3; u < o; ++u) {
22657 (rC(n._, r._, (i = t[u])),
22658 (i = new aC(i)),
22659 (l = r.next),
22660 (c = n.previous),
22661 (f = r._.r),
22662 (h = n._.r));
22663 do {
22664 if (f <= h) {
22665 if (iC(l._, i._)) {
22666 ((r = l), (n.next = r), (r.previous = n), --u);
22667 continue t;
22668 }
22669 ((f += l._.r), (l = l.next));
22670 } else {
22671 if (iC(c._, i._)) {
22672 (((n = c).next = r), (r.previous = n), --u);
22673 continue t;
22674 }
22675 ((h += c._.r), (c = c.previous));
22676 }
22677 } while (l !== c.next);
22678 for (
22679 i.previous = n, i.next = r, n.next = r.previous = r = i, a = oC(n);
22680 (i = i.next) !== r;
22681
22682 )
22683 (s = oC(i)) < a && ((n = i), (a = s));
22684 r = n.next;
22685 }
22686 for (n = [r._], i = r; (i = i.next) !== r; ) n.push(i._);
22687 for (
22688 i = (function (t, e) {
22689 for (
22690 var n,
22691 r,
22692 i = 0,
22693 o = (t = (function (t, e) {
22694 let n,
22695 r,

Callers 1

cCFunction · 0.85

Calls 8

rCFunction · 0.85
iCFunction · 0.85
oCFunction · 0.85
eFunction · 0.85
QDFunction · 0.85
tCFunction · 0.85
JDFunction · 0.85
fromMethod · 0.45

Tested by

no test coverage detected