com.facebook.collectionsbase.Arrays Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of collections-foundation Show documentation

There is a newer version: 0.1.32

Show newest version

/*
 * Copyright (C) 2012 Facebook, 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.facebook.collectionsbase;

import java.util.Comparator;

public class Arrays {
  private Arrays() {
    throw new AssertionError();
  }

  /**
   * sorts in ocmparator order, usually ascending
   *
   * @param array1
   * @param array2
   * @param 
   * @return
   */
  public static > int compareArrays(T[] array1, T[] array2) {
    Comparator comparator = new Comparator() {
      @Override
      public int compare(T o1, T o2) {
        return o1.compareTo(o2);
      }
    };

    return compareArrays(array1, array2, comparator);
  }


  public static  int comparPrimitiveArrays(
    T[] array1, T[] array2, Comparator comparator
  ) {

    int compare = comparator.compare(array1, array2);

    return compare;
  }

  /**
   * compares arrays by the specified comparator
   *
   * @param array1
   * @param array2
   * @param 
   * @return
   */
  public static  int compareArrays(
    T[] array1, T[] array2, Comparator comparator

  ) {
    // null < all other values
    if (array1 == null) {
      if (array2 == null) {
        return 0;
      } else {
        return -1;
      }
    } else if (array2 == null) {
      return 1;
    } else {

      int len = Math.min(array1.length, array2.length);

      for (int i = 0; i < len; i++) {
        int compareValue = comparator.compare(array1[i], array2[i]);

        if (compareValue != 0) {
          return compareValue;
        }
      }

      if (array1.length > array2.length) {
        return 1;
      } else if (array1.length < array2.length) {
        return -1;
      } else {
        return 0;
      }
    }
  }
}