function n()

in js/rough-notation.js [17:31]

• 15 lines of code
• 6 McCabe index (conditional complexity)

  function n(t, e, s) {
    const n = (t || []).length;
    if (n > 2) {
      const i = [];
      for (let e = 0; e < n - 1; e++)
        i.push(...u(t[e][0], t[e][1], t[e + 1][0], t[e + 1][1], s));
      return (
        e && i.push(...u(t[n - 1][0], t[n - 1][1], t[0][0], t[0][1], s)),
        { type: "path", ops: i }
      );
    }
    return 2 === n
      ? i(t[0][0], t[0][1], t[1][0], t[1][1], s)
      : { type: "path", ops: [] };
  }