Consider simplifying this complex logical expression.

Open

      if (this[0]) {
        i = v.buildFragment(e, this, l), o = i.fragment, s = o.firstChild, o.childNodes.length === 1 && (o = s);
        if (s) {
          n = n && v.nodeName(s, "tr");
          for (u = i.cacheable || c - 1; a < c; a++) r.call(n && v.nodeName(this[a], "table") ? Lt(this[a], "tbody") : this[a], a === u ? o : v.clone(o, !0, !0))

Function needsSignature has a Cognitive Complexity of 9 (exceeds 5 allowed). Consider refactoring.

Open

function needsSignature( doclet ) {
    var needsSig = false;

    // function and class definitions always get a signature
    if ( doclet.kind === 'function' || doclet.kind === 'class' ) {

• Read up
  Read up

Function exports has a Cognitive Complexity of 9 (exceeds 5 allowed). Consider refactoring.

Open

module.exports = (function() {
  "use strict";

  var cluster = master.cluster;

• Read up
  Read up

Function access has 7 arguments (exceeds 4 allowed). Consider refactoring.

Open

    access: function(e, n, r, i, s, o, u) {

Function access has 7 arguments (exceeds 4 allowed). Consider refactoring.

Open

    access: function(e, n, r, i, s, o, u) {

Avoid deeply nested control flow statements.

Open

            if (one_map[key][i] !== two_map[key][i]) {
              return false;
            }

Avoid deeply nested control flow statements.

Open

        if (!n) for (r in a) {
          s = r.split(" ");
          if (s[1] === i) {
            n = a[u + " " + s[0]] || a["* " + s[0]];
            if (n) {

Avoid deeply nested control flow statements.

Open

            if (!e) return S.apply(n, x.call(r, 0)), n;

Avoid deeply nested control flow statements.

Open

            if (data[key][i] !== undefined && unique[data[key][i] + ""] === undefined) {
              t += "&" + URI.buildQueryParameter(key, data[key][i]);
              if (duplicates !== true) {
                unique[data[key][i] + ""] = true;
              }

Avoid deeply nested control flow statements.

Open

          for (; r < s; r++) if (i.relative[e[r].type]) break;

Avoid deeply nested control flow statements.

Open

            for (o = p.length - 1; o >= 0; --o) v.nodeName(p[o], "tbody") && !p[o].childNodes.length && p[o].parentNode.removeChild(p[o])

Function ct has 6 arguments (exceeds 4 allowed). Consider refactoring.

Open

    function ct(e, t, n, r, i, s) {

Avoid deeply nested control flow statements.

Open

          if (!s || !s.parentNode) return n;

Avoid deeply nested control flow statements.

Open

          if (s.id === f) return n.push(s), n

Avoid deeply nested control flow statements.

Open

            for (c = 0; c < t; ++c) if (i = m[c], o = f.match(i[1])) {
              b = i[0];
              break
            }

Function kn has 6 arguments (exceeds 4 allowed). Consider refactoring.

Open

  function kn(e, n, r, i, s, o) {

Avoid deeply nested control flow statements.

Open

              if (e(t, r, u)) return t.sizset = !0, t;

Avoid deeply nested control flow statements.

Open

          if (n.events) for (s in n.events) l[s] ? v.event.remove(i, s) : v.removeEvent(i, s, n.handle);

Avoid deeply nested control flow statements.

Open

            for (s = 0, o = n.length; s < o; s++) while (r.indexOf(" " + n[s] + " ") >= 0) r = r.replace(" " + n[s] + " ", " ");

Avoid deeply nested control flow statements.

Open

              if (t.sizset) return t