_getNoahArkConditionCandidates(newElement, neAttrs) {
        const candidates = [];
        const neAttrsLength = neAttrs.length;
        const neTagName = this.treeAdapter.getTagName(newElement);
        const neNamespaceURI = this.treeAdapter.getNamespaceURI(newElement);
        for (let i = 0; i < this.entries.length; i++) {
            const entry = this.entries[i];
            if (entry.type === EntryType.Marker) {
                break;
            }
            const { element } = entry;
            if (this.treeAdapter.getTagName(element) === neTagName &&
                this.treeAdapter.getNamespaceURI(element) === neNamespaceURI) {
                const elementAttrs = this.treeAdapter.getAttrList(element);
                if (elementAttrs.length === neAttrsLength) {
                    candidates.push({ idx: i, attrs: elementAttrs });
                }
            }
        }
        return candidates;
    }
//lightweight heuristics without thorough attributes check.
lightweight heuristics without thorough attributes check.
lightweight heuristics without thorough attributes check .
_getNoahArkConditionCandidates(newElement, neAttrs) {
        const candidates = [];
        const neAttrsLength = neAttrs.length;
        const neTagName = this.treeAdapter.getTagName(newElement);
        const neNamespaceURI = this.treeAdapter.getNamespaceURI(newElement);
        for (let i = 0; i < this.entries.length; i++) {
            const entry = this.entries[i];
            if (entry.type === EntryType.Marker) {
                break;
            }
            const { element } = entry;
            if (this.treeAdapter.getTagName(element) === neTagName &&
                this.treeAdapter.getNamespaceURI(element) === neNamespaceURI) {
                const elementAttrs = this.treeAdapter.getAttrList(element);
                if (elementAttrs.length === neAttrsLength) {
                    candidates.push({ idx: i, attrs: elementAttrs });
                }
            }
        }
        return candidates;
    }
_getNoahArkConditionCandidates ( newElement , neAttrs ) { const candidates = [ ] ; const neAttrsLength = neAttrs . length ; const neTagName = this . treeAdapter . getTagName ( newElement ) ; const neNamespaceURI = this . treeAdapter . getNamespaceURI ( newElement ) ; for ( let i = 0 ; i < this . entries . length ; i ++ ) { const entry = this . entries [ i ] ; if ( entry . type === EntryType . Marker ) { break ; } const { element } = entry ; if ( this . treeAdapter . getTagName ( element ) === neTagName && this . treeAdapter . getNamespaceURI ( element ) === neNamespaceURI ) { const elementAttrs = this . treeAdapter . getAttrList ( element ) ; if ( elementAttrs . length === neAttrsLength ) { candidates . push ( { idx : i , attrs : elementAttrs } ) ; } } } return candidates ; }
lightweight heuristics without thorough attributes check.
lightweight heuristics without thorough attributes check .