All Downloads are FREE. Search and download functionalities are using the official Maven repository.

com.squarespace.less.model.Selectors Maven / Gradle / Ivy

There is a newer version: 1.7.2
Show newest version
/**
 * Copyright (c) 2014 SQUARESPACE, 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.squarespace.less.model;

import java.util.List;

import com.squarespace.less.LessException;
import com.squarespace.less.core.Buffer;
import com.squarespace.less.core.CharClass;
import com.squarespace.less.core.LessUtils;
import com.squarespace.less.exec.ExecEnv;


/**
 * Represents a comma-separated list of Selector nodes that forms
 * the header of a {@link Ruleset}.
 */
public class Selectors extends BaseNode {

  /**
   * List of {@link Selector} nodes in this set.
   */
  protected List selectors;

  /**
   * Indicates whether one or more of the selectors requires evaluation.
   */
  protected boolean evaluate;

  /**
   * Indicates that at least one of the child selectors is "mixin-friendly".
   */
  protected boolean hasMixinPath;

  /**
   * Constructs an empty selector set.
   */
  public Selectors() {
  }

  /**
   * Constructs a selector set with the given starting selectors.
   */
  public Selectors(List selectors) {
    this.selectors = selectors;
  }

  /**
   * Indicates whether this selector set is empty.
   */
  public boolean isEmpty() {
    return selectors == null ? true : selectors.isEmpty();
  }

  /**
   * Adds a selector to the set.
   */
  public void add(Selector selector) {
    selectors = LessUtils.initList(selectors, 2);
    selectors.add(selector);
    evaluate |= selector.needsEval();
    hasMixinPath |= selector.hasMixinPath();
  }

  /**
   * Returns the list of selectors in the set.
   */
  public List selectors() {
    return LessUtils.safeList(selectors);
  }

  /**
   * Indicates that at least one of the child selectors is "mixin-friendly".
   */
  public boolean hasMixinPath() {
    return hasMixinPath;
  }

  /**
   * See {@link Node#needsEval()}
   */
  @Override
  public boolean needsEval() {
    return evaluate;
  }

  /**
   * See {@link Node#eval(ExecEnv)}
   */
  @Override
  public Node eval(ExecEnv env) throws LessException {
    if (!evaluate) {
      return this;
    }
    Selectors result = new Selectors();
    for (Selector selector : selectors) {
      result.add((Selector)selector.eval(env));
    }
    return result;
  }

  /**
   * See {@link Node#type()}
   */
  @Override
  public NodeType type() {
    return NodeType.SELECTORS;
  }

  /**
   * See {@link Node#repr(Buffer)}
   */
  @Override
  public void repr(Buffer buf) {
    int size = selectors.size();
    boolean emitted = false;
    for (int i = 0; i < size; i++) {
      if (emitted) {
        buf.append(',');
        if (!buf.compress()) {
          buf.append('\n').indent();
        }
      }
      Selector selector = selectors.get(i);
      if (selector != null) {
        emitted = true;
        reprSelector(buf, selector);
      }
    }
  }

  /**
   * Renders the {@link Node#repr()} for the list of elements in the selector.
   */
  public static void reprSelector(Buffer buf, Selector selector) {
    List elements = selector.elements();
    int size = elements.size();
    for (int i = 0; i < size; i++) {
      reprElement(buf, elements.get(i), i == 0);
    }
  }

  /**
   * Renders the {@link Element}'s {@link Node#repr()} to the buffer.
   */
  private static void reprElement(Buffer buf, Element element, boolean isFirst) {
    Combinator combinator = element.combinator();
    if (combinator != null) {
      boolean isDescendant = combinator == Combinator.DESC;
      char ch = combinator.getChar();
      if (isFirst) {
        if (!isDescendant) {
          buf.append(ch);
        }
      } else {
        if (!buf.compress() && !isDescendant) {
          buf.append(' ');
        }
        if (!isDescendant || !CharClass.whitespace(buf.prevChar())) {
          buf.append(ch);
        }
      }
      if (!buf.compress() && !element.isWildcard() && !CharClass.whitespace(buf.prevChar())) {
        buf.append(' ');
      }
    }
    element.repr(buf);
  }

  /**
   * See {@link Node#modelRepr(Buffer)}
   */
  @Override
  public void modelRepr(Buffer buf) {
    typeRepr(buf);
    posRepr(buf);
    buf.append('\n');
    buf.incrIndent();
    ReprUtils.modelRepr(buf, "\n", true, selectors);
    buf.decrIndent();
  }

  @Override
  public boolean equals(Object obj) {
    return (obj instanceof Selectors) ? LessUtils.safeEquals(selectors, ((Selectors)obj).selectors) : false;
  }

  @Override
  public int hashCode() {
    return super.hashCode();
  }

}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy