Showing 297 of 342 total issues
Avoid deeply nested control flow statements. Open
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
Open
if (e(t, r, u)) return t.sizset = !0, t;Avoid deeply nested control flow statements. Open
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
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
Open
if (s.id === f) return n.push(s), nFunction ct has 6 arguments (exceeds 4 allowed). Consider refactoring. Open
Open
function ct(e, t, n, r, i, s) {Avoid deeply nested control flow statements. Open
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
Open
if (n !== !0) if (n && e["throws"]) t = n(t);
else try {
t = n(t)
} catch (l) {
return {Avoid deeply nested control flow statements. Open
Open
if (t.sizset) return tConsider simplifying this complex logical expression. Open
Open
if ((!c || !l[c] || !i && !l[c].data) && a && r === t) return;Consider simplifying this complex logical expression. Open
Open
if (i || !n.readyState || /loaded|complete/.test(n.readyState)) n.onload = n.onreadystatechange = null, r && n.parentNode && r.removeChild(n), n = t, i || o(200, "success")Consider simplifying this complex logical expression. Open
Open
if (typeof u == "string") if (!gt.test(u)) u = t.createTextNode(u);
else {
y = y || lt(t), c = t.createElement("div"), y.appendChild(c), u = u.replace(dt, "<$1></$2>"), a = (vt.exec(u) || ["", ""])[1].toLowerCase(), f = Nt[a] || Nt._default, l = f[0], c.innerHTML = f[1] + u + f[2];
while (l--) c = c.lastChild;
if (!v.support.tbody) {Consider simplifying this complex logical expression. Open
Open
if (n) o[n] && o[n].stop && i(o[n]);
else for (n in o) o[n] && o[n].stop && Wn.test(n) && i(o[n]);Consider simplifying this complex logical expression. Open
Open
if (e >= 200 && e < 300 || e === 304) c.ifModified && (S = x.getResponseHeader("Last-Modified"), S && (v.lastModified[r] = S), S = x.getResponseHeader("Etag"), S && (v.etag[r] = S)), e === 304 ? (T = "notmodified", l = !0) : (l = On(c, w), T = l.state, y = l.data, b = l.error, l = !b);
else {
b = T;
if (!T || e) T = "error", e < 0 && (e = 0)
}Consider simplifying this complex logical expression. Open
Open
if (k.indexOf("prettyprint") >= 0) {
var k = k.match(g),
f, b;
if (b = !k) {
b = n;Consider simplifying this complex logical expression. Open
Open
if (k.indexOf("prettyprint") >= 0) {
var k = k.match(g),
f, b;
if (b = !k) {
b = n;Consider simplifying this complex logical expression. Open
Open
if (r && w !== y) {
for (d = 0; v = t[d]; d++) v(x, m, a, f);
if (u) {
if (y > 0) while (w--)!x[w] && !m[w] && (m[w] = E.call(l));
m = lt(m)Consider simplifying this complex logical expression. Open
Open
if (!v.support.tbody) {
h = mt.test(u), p = a === "table" && !h ? c.firstChild && c.firstChild.childNodes : f[1] === "<table>" && !h ? c.childNodes : [];
for (o = p.length - 1; o >= 0; --o) v.nodeName(p[o], "tbody") && !p[o].childNodes.length && p[o].parentNode.removeChild(p[o])
}!v.support.leadingWhitespace && pt.test(u) && c.insertBefore(t.createTextNode(pt.exec(u)[0]), c.firstChild), u = c.childNodes, c.parentNode.removeChild(c)Consider simplifying this complex logical expression. Open
Open
if (this._parts.hostname) {
relative = false;
ip4 = URI.ip4_expression.test(this._parts.hostname);
ip6 = URI.ip6_expression.test(this._parts.hostname);
ip = ip4 || ip6;Consider simplifying this complex logical expression. Open
Open
if ((!v.support.noCloneEvent || !v.support.noCloneChecked) && (e.nodeType === 1 || e.nodeType === 11) && !v.isXMLDoc(e)) {
Ot(e, o), r = Mt(e), i = Mt(o);
for (s = 0; r[s]; ++s) i[s] && Ot(r[s], i[s])
}