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

com.google.ical.util.Predicates Maven / Gradle / Ivy

Go to download

There is a newer version: 7.4.3.112-ga112
Show newest version
// CopyrightGoogle Inc. All rights reserved.

package com.google.ical.util;

import java.io.Serializable;
import java.util.Collection;

/**
 * static methods for creating the standard set of {@link Predicate} objects.
 */
public class Predicates {

  private Predicates() {
    // uninstantiable
  }

  /*
   * For constant Predicates a single instance will suffice; we'll cast it to
   * the right parameterized type on demand.
   */

  private static final Predicate ALWAYS_TRUE =
      new AlwaysTruePredicate();
  private static final Predicate ALWAYS_FALSE =
      new AlwaysFalsePredicate();

  /**
   * Returns a Predicate that always evaluates to true.
   */
  @SuppressWarnings("unchecked")
  public static  Predicate alwaysTrue() {
    return (Predicate) ALWAYS_TRUE;
  }

  /**
   * Returns a Predicate that always evaluates to false.
   */
  @SuppressWarnings("unchecked")
  public static  Predicate alwaysFalse() {
    return (Predicate) ALWAYS_FALSE;
  }

  /**
   * Returns a Predicate that evaluates to true iff the given Predicate
   * evaluates to false.
   */
  public static  Predicate not(Predicate predicate) {
    assert null != predicate;
    return new NotPredicate(predicate);
  }

  /**
   * Returns a Predicate that evaluates to true iff each of its components
   * evaluates to true.  The components are evaluated in order, and evaluation
   * will be "short-circuited" as soon as the answer is determined.  Does not
   * defensively copy the array passed in, so future changes to it will alter
   * the behavior of this Predicate.
   */
  public static  Predicate and(Predicate... components) {
    assert null != components;
    components = components.clone();
    int n = components.length;
    for (int i = 0; i < n; ++i) {
      Predicate p = components[i];
      if (p == ALWAYS_FALSE) { return alwaysFalse(); }
      if (p == ALWAYS_TRUE) {
        components[i] = components[n - 1];
        --i; --n;
      }
    }
    if (n == 0) { return alwaysTrue(); }
    if (n != components.length) {
      @SuppressWarnings("unchecked")
      Predicate[] newComponents = new Predicate[n];
      System.arraycopy(newComponents, 0, components, 0, n);
      components = newComponents;
    }
    return new AndPredicate(components);
  }

  /**
   * Returns a Predicate that evaluates to true iff each of its components
   * evaluates to true.  The components are evaluated in order, and evaluation
   * will be "short-circuited" as soon as the answer is determined.  Does not
   * defensively copy the array passed in, so future changes to it will alter
   * the behavior of this Predicate.
   */
  public static  Predicate and(
      Collection> components) {
    int n = components.size();
    @SuppressWarnings("unchecked")
    Predicate[] arr = new Predicate[n];
    components.toArray(arr);
    return and(arr);
  }

  /**
   * Returns a Predicate that evaluates to true iff any one of its components
   * evaluates to true.  The components are evaluated in order, and evaluation
   * will be "short-circuited" as soon as the answer is determined.  Does not
   * defensively copy the array passed in, so future changes to it will alter
   * the behavior of this Predicate.
   */
  public static  Predicate or(Predicate... components) {
    assert components != null;
    components = components.clone();
    int n = components.length;
    for (int i = 0; i < n; ++i) {
      Predicate p = components[i];
      if (p == ALWAYS_TRUE) { return alwaysTrue(); }
      if (p == ALWAYS_FALSE) {
        components[i] = components[n - 1];
        --i; --n;
      }
    }
    if (components.length == 0) { return alwaysFalse(); }
    if (n != components.length) {
      @SuppressWarnings("unchecked")
      Predicate[] newComponents = new Predicate[n];
      System.arraycopy(newComponents, 0, components, 0, n);
      components = newComponents;
    }
    return new OrPredicate(components);
  }

  /** @see Predicates#alwaysTrue */
  private static class AlwaysTruePredicate implements Predicate,
      Serializable {
    private static final long serialVersionUID = 8759914710239461322L;
    public boolean apply(T t) {
      return true;
    }
    @Override
    public String toString() { return "true"; }
  }

  /** @see Predicates#alwaysFalse */
  private static class AlwaysFalsePredicate implements Predicate,
      Serializable {
    private static final long serialVersionUID = -565481022115659695L;
    public boolean apply(T t) {
      return false;
    }
    @Override
    public String toString() { return "false"; }
  }

  /** @see Predicates#not */
  private static class NotPredicate implements Predicate, Serializable {
    private static final long serialVersionUID = -5113445916422049953L;
    private final Predicate predicate;

    private NotPredicate(Predicate predicate) {
      this.predicate = predicate;
    }
    public boolean apply(T t) {
      return !predicate.apply(t);
    }
  }

  /** @see Predicates#and */
  private static class AndPredicate implements Predicate, Serializable {
    private static final long serialVersionUID = 1022358602593297546L;
    private final Predicate[] components;

    private AndPredicate(Predicate... components) {
      this.components = components;
    }
    public boolean apply(T t) {
      for (Predicate predicate : components) {
        if (!predicate.apply(t)) {
          return false;
        }
      }
      return true;
    }
  }

  /** @see Predicates#or */
  private static class OrPredicate implements Predicate, Serializable {
    private static final long serialVersionUID = -7942366790698074803L;
    private final Predicate[] components;

    private OrPredicate(Predicate... components) {
      this.components = components;
    }
    public boolean apply(T t) {
      for (Predicate predicate : components) {
        if (predicate.apply(t)) {
          return true;
       }
     }
       return false;
    }
  }

}
 















© 2015 - 2024 Weber Informatics LLC | Privacy Policy