Function qs

resources/vega.min.js:4997–5003

(t, e, n)

    return (t = 1 - t * t * t) * t * t;
  }
  function qs(t, e, n) {
    const r = t[e];
    let i = n[0],
      o = n[1] + 1;
    if (!(o >= t.length))
      for (; e > i && t[o] - r <= r - t[i]; ) ((n[0] = ++i), (n[1] = o), ++o);
  }
  const Ps = (0.5 * Math.PI) / 180;
  function js(t, e, n, r) {
    ((n = n || 25), (r = Math.max(n, r || 200)));