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

org.spf4j.base.Comparables Maven / Gradle / Ivy

Go to download

A continuously growing collection of utilities to measure performance, get better diagnostics, improve performance, or do things more reliably, faster that other open source libraries...

The newest version!
/*
 * Copyright (c) 2001-2017, Zoltan Farkas All Rights Reserved.
 *
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either
 * version 2.1 of the License, or (at your option) any later version.
 *
 * This library is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public
 * License along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
 *
 * Additionally licensed with:
 *
 * 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 org.spf4j.base;

import javax.annotation.Nonnull;

/**
 *
 * @author zoly
 */
public final class Comparables {

  private Comparables() {
  }

  public static  Comparable min(@Nonnull final Object... nrs) {
    if (nrs.length == 0) {
      throw new IllegalArgumentException("cannot calc min of empty array" + java.util.Arrays.toString(nrs));
    }
    Comparable min = (Comparable) nrs[0];
    for (int i = 1; i < nrs.length; i++) {
      Comparable c = (Comparable) nrs[i];
      if (c.compareTo((T) min) < 0) {
        min = c;
      }
    }
    return min;
  }

  public static  Comparable max(@Nonnull final Object... nrs) {
    if (nrs.length == 0) {
      throw new IllegalArgumentException("cannot calc max of empty array: " + java.util.Arrays.toString(nrs));
    }
    Comparable max = (Comparable) nrs[0];
    for (int i = 1; i < nrs.length; i++) {
      Comparable c = (Comparable) nrs[i];
      if (c.compareTo((T) max) > 0) {
        max = c;
      }
    }
    return max;
  }

  public static > int compare(final T first, final T second) {
    if (first == null) {
      return (second == null) ? 0 : 1;
    } else {
      return (second == null) ? -1 : first.compareTo(second);
    }
  }

  public static > int compareArrays(final T[] first, final T[] second) {
    int result = 0;
    if (first == second) {
      return result;
    }
    int i = 0;
    int l1 = first.length;
    int l2 = second.length;
    int n = Math.min(l1, l2);
    if (n == 0) {
      return (l1 < l2) ? -1 : (l1 > l2) ? 1 : 0;
    }
    do {
      result = Comparables.compare(first[i], second[i]);
      i++;
    } while (result == 0 && i < n);
    if (result == 0 && l1 != l2) {
      return (l1 < l2) ? -1 : 1;
    }
    return result;
  }

  public static > int compareArrays(final T[] first, final T[] second,
          final int from, final int to) {
    int result = 0;
    if (first == second) {
      return result;
    }
    int i = from;
    int n = to;
    if (n == i) {
      return 0;
    }
    do {
      result = Comparables.compare(first[i], second[i]);
      i++;
    } while (result == 0 && i < n);
    return result;
  }




}




© 2015 - 2025 Weber Informatics LLC | Privacy Policy