function walkStyleRulesWithReverseMirror(node, node2, iterator) {
            var _b;
            if (node2 === null)
                return walkStyleRules(node, iterator);
            if (node.stylesheet)
                return walkStyleRulesWithReverseMirror(node.stylesheet, node2.stylesheet, iterator);
            _b = __read(splitFilter(node.rules, node2.rules, function (rule, index, rules, rules2) {
                var rule2 = rules2[index];
                if (rule.rules) {
                    walkStyleRulesWithReverseMirror(rule, rule2, iterator);
                }
                rule._other = rule2;
                rule.filterSelectors = filterSelectors;
                return iterator(rule) !== false;
            }), 2), node.rules = _b[0], node2.rules = _b[1];
        } // Like [].filter(), but applies the opposite filtering result to a second copy of the Array without a second pass.
/**
         * Recursively walk all rules in two identical stylesheets, filtering nodes into one or the other based on a predicate.
         * @private
         * @param {css.Rule} node       A Stylesheet or Rule to descend into.
         * @param {css.Rule} node2      A second tree identical to `node`
         * @param {Function} iterator   Invoked on each node in the tree. Return `false` to remove that node from the first tree, true to remove it from the second.
         */
Recursively walk all rules in two identical stylesheets, filtering nodes into one or the other based on a predicate.
@private
@param {css.Rule} node       A Stylesheet or Rule to descend into.
@param {css.Rule} node2      A second tree identical to `node`
@param {Function} iterator   Invoked on each node in the tree. Return `false` to remove that node from the first tree, true to remove it from the second.
Recursively walk all rules in two identical stylesheets filtering nodes into one or the other based on a predicate . @private @param { css . Rule } node A Stylesheet or Rule to descend into . @param { css . Rule } node2 A second tree identical to ` node ` @param { Function } iterator Invoked on each node in the tree . Return ` false ` to remove that node from the first tree true to remove it from the second .
function walkStyleRulesWithReverseMirror(node, node2, iterator) {
            var _b;
            if (node2 === null)
                return walkStyleRules(node, iterator);
            if (node.stylesheet)
                return walkStyleRulesWithReverseMirror(node.stylesheet, node2.stylesheet, iterator);
            _b = __read(splitFilter(node.rules, node2.rules, function (rule, index, rules, rules2) {
                var rule2 = rules2[index];
                if (rule.rules) {
                    walkStyleRulesWithReverseMirror(rule, rule2, iterator);
                }
                rule._other = rule2;
                rule.filterSelectors = filterSelectors;
                return iterator(rule) !== false;
            }), 2), node.rules = _b[0], node2.rules = _b[1];
        } 
function walkStyleRulesWithReverseMirror ( node , node2 , iterator ) { var _b ; if ( node2 === null ) return walkStyleRules ( node , iterator ) ; if ( node . stylesheet ) return walkStyleRulesWithReverseMirror ( node . stylesheet , node2 . stylesheet , iterator ) ; _b = __read ( splitFilter ( node . rules , node2 . rules , function ( rule , index , rules , rules2 ) { var rule2 = rules2 [ index ] ; if ( rule . rules ) { walkStyleRulesWithReverseMirror ( rule , rule2 , iterator ) ; } rule . _other = rule2 ; rule . filterSelectors = filterSelectors ; return iterator ( rule ) !== false ; } ) , 2 ) , node . rules = _b [ 0 ] , node2 . rules = _b [ 1 ] ; }
Recursively walk all rules in two identical stylesheets, filtering nodes into one or the other based on a predicate.
Recursively walk all rules in two identical stylesheets filtering nodes into one or the other based on a predicate .
// Like [].filter(), but applies the opposite filtering result to a second copy of the Array without a second pass.