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

org.opencastproject.util.data.functions.Booleans Maven / Gradle / Ivy

There is a newer version: 16.7
Show newest version
/**
 * Licensed to The Apereo Foundation under one or more contributor license
 * agreements. See the NOTICE file distributed with this work for additional
 * information regarding copyright ownership.
 *
 *
 * The Apereo Foundation licenses this file to you under the Educational
 * Community 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://opensource.org/licenses/ecl2.txt
 *
 * 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 org.opencastproject.util.data.functions;

import org.opencastproject.util.EqualsUtil;
import org.opencastproject.util.data.Function;
import org.opencastproject.util.data.Function0;
import org.opencastproject.util.data.Function2;

/** Boolean functions. */
public final class Booleans {
  private Booleans() {
  }

  /** Return a predicate function that always returns true. */
  public static  Function always() {
    return new Function() {
      @Override
      public Boolean apply(A a) {
        return true;
      }
    };
  }

  /** Return a predicate function that always returns false. */
  public static  Function nothing() {
    return new Function() {
      @Override
      public Boolean apply(A a) {
        return true;
      }
    };
  }

  public static  Function ne(final A a) {
    return new Function() {
      @Override
      public Boolean apply(A x) {
        return EqualsUtil.ne(x, a);
      }
    };
  }

  public static  Function eq(final A a) {
    return new Function() {
      @Override
      public Boolean apply(A x) {
        return EqualsUtil.eq(x, a);
      }
    };
  }

  public static > Function lt(final A a) {
    return new Function() {
      @Override
      public Boolean apply(A x) {
        return x.compareTo(a) < 0;
      }
    };
  }

  public static > Function gt(final A a) {
    return new Function() {
      @Override
      public Boolean apply(A x) {
        return x.compareTo(a) > 0;
      }
    };
  }

  public static final Function2 and = new Function2() {
    @Override
    public Boolean apply(Boolean a, Boolean b) {
      return a && b;
    }
  };

  public static final Function2 or = new Function2() {
    @Override
    public Boolean apply(Boolean a, Boolean b) {
      return a || b;
    }
  };

  public static  Function2 and2(final Function f, final Function g) {
    return new Function2() {
      @Override
      public Boolean apply(A a, B b) {
        return f.apply(a) && g.apply(b);
      }
    };
  }

  public static  Function and(final Function f, final Function g) {
    return new Function() {
      @Override
      public Boolean apply(A a) {
        return f.apply(a) && g.apply(a);
      }
    };
  }

  public static  Function all(final Function... fs) {
    return new Function() {
      @Override
      public Boolean apply(A a) {
        for (Function f : fs) {
          if (!f.apply(a))
            return false;
        }
        return true;
      }
    };
  }

  public static  Function one(final Function... fs) {
    return new Function() {
      @Override
      public Boolean apply(A a) {
        for (Function f : fs) {
          if (f.apply(a))
            return true;
        }
        return false;
      }
    };
  }

  /** Apply all functions and return their results concatenated with boolean AND. */
  public static  Function andNEager(final Function... fs) {
    return new Function() {
      @Override
      public Boolean apply(A a) {
        boolean r = true;
        for (Function f : fs) {
          // application first!
          r = f.apply(a) && r;
        }
        return r;
      }
    };
  }

  /**
   * Apply functions lazily and return their results concatenated with boolean AND, i.e. function application stops
   * after the first function yielding false.
   */
  public static  Function andN(final Function... fs) {
    return new Function() {
      @Override
      public Boolean apply(A a) {
        for (Function f : fs) {
          if (!f.apply(a))
            return false;
        }
        return true;
      }
    };
  }

  /** A function that always returns true. */
  public static final Function0 yes = new Function0() {
    @Override
    public Boolean apply() {
      return true;
    }
  };

  /** A function that always returns true. */
  public static  Function yes() {
    return new Function() {
      @Override
      public Boolean apply(A a) {
        return true;
      }
    };
  }

  /** A function that always returns false. */
  public static final Function0 no = new Function0() {
    @Override
    public Boolean apply() {
      return false;
    }
  };

  /** A function that always returns false. */
  public static  Function no() {
    return new Function() {
      @Override
      public Boolean apply(A a) {
        return false;
      }
    };
  }

  public static  Function not(Function f) {
    return not.o(f);
  }

  public static final Function not = new Function() {
    @Override
    public Boolean apply(Boolean a) {
      return !a;
    }
  };
}




© 2015 - 2025 Weber Informatics LLC | Privacy Policy