Avoid deeply nested control flow statements.

Open

                    if (name == "div") {
                        types.push(XPathParser.DIV);
                        values.push(name);
                        continue;
                    }

Avoid deeply nested control flow statements.

Open

                        while (st.length > 0) {
                            for (var m = st.pop(); m != null; ) {
                                if (step.nodeTest.matches(m, xpc)) {
                                    newNodes.push(m);
                                }

Avoid deeply nested control flow statements.

Open

                        do {
                            for (var m = st.pop(); m != null; ) {
                                if (step.nodeTest.matches(m, xpc)) {
                                    newNodes.push(m);
                                }

Avoid deeply nested control flow statements.

Open

            if (!e.selector) {
              problems.push('element ' + k + ' has no selector');
            }

Function resolveQName has a Cognitive Complexity of 8 (exceeds 5 allowed). Consider refactoring.

Open

Utilities.resolveQName = function(qn, nr, n, useDefault) {
    var parts = Utilities.splitQName(qn);
    if (parts[0] != null) {
        parts[0] = nr.getNamespace(parts[0], n);
    } else {

• Read up
  Read up

Avoid deeply nested control flow statements.

Open

                        while (m != null) {
                            if (step.nodeTest.matches(m, xpc)) {
                                newNodes.push(m);
                            }
                            if (m === xpc.virtualRoot) {

Avoid deeply nested control flow statements.

Open

                        for (var m = xpc.contextNode; m != null; m = m.nodeType == 2 /*Node.ATTRIBUTE_NODE*/ ? this.getOwnerElement(m) : m.parentNode) {
                            if (step.nodeTest.matches(m, xpc)) {
                                newNodes.push(m);
                            }
                            if (m === xpc.virtualRoot) {

Avoid deeply nested control flow statements.

Open

                        if (nnm != null) {
                            for (var k = 0; k < nnm.length; k++) {
                                var m = nnm.item(k);
                                if (step.nodeTest.matches(m, xpc)) {
                                    newNodes.push(m);

Avoid deeply nested control flow statements.

Open

                    if (name == "or") {
                        types.push(XPathParser.OR);
                        values.push(name);
                        continue;
                    }

Avoid deeply nested control flow statements.

Open

                        if (xpc.contextNode.nodeType == 2 /*Node.ATTRIBUTE_NODE*/) {
                            m = this.getOwnerElement(xpc.contextNode);
                        } else {
                            m = xpc.contextNode.parentNode;
                        }

Avoid deeply nested control flow statements.

Open

                        for (var m = xpc.contextNode.firstChild; m != null; m = m.nextSibling) {
                            if (step.nodeTest.matches(m, xpc)) {
                                newNodes.push(m);
                            }
                        }

Function addElement has a Cognitive Complexity of 8 (exceeds 5 allowed). Consider refactoring.

Open

ElementQueue.prototype.addElement = function(e) {
  var eq = this;
  // We keep track of which elements
  // are followed by others, so we can rapidly
  // decide which ones needs adjusting in the queue

• Read up
  Read up

Avoid deeply nested control flow statements.

Open

            if (keywords.indexOf(j) == -1) {
              // this element has child[ren]
              isLeaf = false;
              checkLeaves(e);
            }

Avoid deeply nested control flow statements.

Open

                    if (this.predicateMatches(pred, xpc)) {
                        newNodes.push(xpc.contextNode);
                    } else {
                    }

Avoid deeply nested control flow statements.

Open

                    if (name == "and") {
                        types.push(XPathParser.AND);
                        values.push(name);
                        continue;
                    }

Avoid deeply nested control flow statements.

Open

                    while (Utilities.isNCNameChar(c.charCodeAt(0))) {
                        name += c;
                        c = s.charAt(pos++);
                    }

Avoid deeply nested control flow statements.

Open

                        if (xpc.contextNode === xpc.virtualRoot) {
                            break;
                        }

Avoid deeply nested control flow statements.

Open

                        if (step.nodeTest.matches(xpc.contextNode, xpc)) {
                            newNodes.push(xpc.contextNode);
                        }

Avoid deeply nested control flow statements.

Open

                        if (xpc.contextNode !== xpc.virtualRoot) {
                            if (xpc.contextNode.nodeType == 2 /*Node.ATTRIBUTE_NODE*/) {
                                m = this.getOwnerElement(xpc.contextNode);
                            } else {
                                m = xpc.contextNode.parentNode;

Avoid deeply nested control flow statements.

Open

                        if (m != null && step.nodeTest.matches(m, xpc)) {
                            newNodes.push(m);
                        }