com.google.common.css.compiler.passes.MergeAdjacentRulesetNodesWithSameSelector Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of closure-stylesheets Show documentation
Closure Stylesheets is an extension to CSS that adds variables, functions, conditionals, and mixins to standard CSS. The tool also supports minification, linting, RTL flipping, and CSS class renaming.
The newest version!
/*
 * Copyright 2009 Google Inc.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

package com.google.common.css.compiler.passes;

import com.google.common.base.Preconditions;
import com.google.common.css.compiler.ast.CssBlockNode;
import com.google.common.css.compiler.ast.CssCompilerPass;
import com.google.common.css.compiler.ast.CssNode;
import com.google.common.css.compiler.ast.CssRootNode;
import com.google.common.css.compiler.ast.CssRulesetNode;
import com.google.common.css.compiler.ast.CssSelectorListNode;
import com.google.common.css.compiler.ast.CssTree;
import com.google.common.css.compiler.ast.MutatingVisitController;
import com.google.common.css.compiler.ast.SkippingTreeVisitor;

import java.util.Iterator;

/**
 * Compiler pass that merges adjacent ruleset nodes that have the same selector.
 *
 * @author [email protected] (Oana Florescu)
 */
public class MergeAdjacentRulesetNodesWithSameSelector
    extends SkippingTreeVisitor implements CssCompilerPass  {

  private final CssTree tree;
  private final MutatingVisitController visitController;

  public MergeAdjacentRulesetNodesWithSameSelector(CssTree tree) {
    this(tree, false);
  }

  public MergeAdjacentRulesetNodesWithSameSelector(CssTree tree,
        boolean skipping) {
    super(skipping);
    this.tree = tree;
    this.visitController = tree.getMutatingVisitController();
  }

  @Override
  public boolean enterTree(CssRootNode root) {
    tree.resetRulesetNodesToRemove();
    return true;
  }

  @Override
  public boolean enterBlock(CssBlockNode block) {
    if (block.numChildren() <= 1) {
      return true;  // There is nothing to merge.
    }

    Iterator iterator = block.getChildIterator();
    CssNode node = iterator.next();

    node = skipNonRulesetNode(node, iterator);
    if (node == null) {
      return true;
    }

    CssRulesetNode ruleToMergeTo = (CssRulesetNode) node;

    while (iterator.hasNext()) {
      node = iterator.next();

      if (!(node instanceof CssRulesetNode)) {
        node = skipNonRulesetNode(node, iterator);
        if (node == null) {
          return true;
        }
        ruleToMergeTo = (CssRulesetNode) node;
        continue;
      }

      CssRulesetNode currentRule = (CssRulesetNode) node;

      // if skipping is on and the rule contains a property from the set : skip
      if (canModifyRuleset(currentRule)) {
        if (sameSelectors(ruleToMergeTo.getSelectors(),
                          currentRule.getSelectors())) {
          for (CssNode decl : currentRule.getDeclarations().childIterable()) {
            ruleToMergeTo.addDeclaration(decl);
          }
          tree.getRulesetNodesToRemove().addRulesetNode(currentRule);
        } else {
          ruleToMergeTo = currentRule;
        }
      }
    }

    return true;
  }

  @Override
  public void runPass() {
    visitController.startVisit(this);
  }

  /**
   * Checks that the two lists of selectors are identical, and that
   * their modules (if available) match pairwise.
   */
  private boolean sameSelectors(
      CssSelectorListNode s1, CssSelectorListNode s2) {
    if (!PassUtil.printSelectorList(s1).equals(
        PassUtil.printSelectorList(s2))) {
      return false;
    }
    int n = s1.numChildren();
    Preconditions.checkArgument(n == s2.numChildren());
    for (int i = 0; i < n; i++) {
      Object m1 = s1.getChildAt(i).getChunk();
      Object m2 = s2.getChildAt(i).getChunk();
      if ((m1 == null) != (m2 == null)) {
        throw new IllegalStateException();
      }
      if (m1 != null && !m1.equals(m2)) {
        return false;
      }
    }
    return true;
  }
  
  private CssNode skipNonRulesetNode(CssNode node, Iterator iterator) {
    while (!(node instanceof CssRulesetNode)) {
      if (iterator.hasNext()) {
        node = iterator.next();
      } else {
        return null;
      }
    }
    return node;
  }
}