org.apache.druid.segment.data.ComparableIntArray Maven / Gradle / Ivy

Show more of this group Show more artifacts with this name
Show all versions of druid-processing Show documentation
A module that is everything required to understands Druid Segments
There is a newer version: 30.0.1
/*
 * Licensed to the Apache Software Foundation (ASF) under one
 * or more contributor license agreements.  See the NOTICE file
 * distributed with this work for additional information
 * regarding copyright ownership.  The ASF licenses this file
 * to you 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.apache.druid.segment.data;

import com.fasterxml.jackson.annotation.JsonCreator;
import com.fasterxml.jackson.annotation.JsonValue;

import java.util.Arrays;

public class ComparableIntArray implements Comparable
{
  public static final ComparableIntArray EMPTY_ARRAY = new ComparableIntArray(new int[0]);

  final int[] delegate;
  private int hashCode;
  private boolean hashCodeComputed;

  private ComparableIntArray(int[] array)
  {
    delegate = array;
  }

  @JsonCreator
  public static ComparableIntArray of(int... array)
  {
    if (array.length == 0) {
      return EMPTY_ARRAY;
    } else {
      return new ComparableIntArray(array);
    }
  }

  @JsonValue
  public int[] getDelegate()
  {
    return delegate;
  }

  @Override
  public int hashCode()
  {
    // Check is not thread-safe, but that's fine. Even if used by multiple threads, it's ok to write these primitive
    // fields more than once.
    // As ComparableIntArray is used in hot loop caching the hashcode
    if (!hashCodeComputed) {
      hashCode = Arrays.hashCode(delegate);
      hashCodeComputed = true;
    }

    return hashCode;
  }

  @Override
  public boolean equals(Object obj)
  {
    if (this == obj) {
      return true;
    }
    if (obj == null || getClass() != obj.getClass()) {
      return false;
    }

    return Arrays.equals(delegate, ((ComparableIntArray) obj).getDelegate());
  }

  @Override
  public int compareTo(ComparableIntArray rhs)
  {
    // rhs.getDelegate() cannot be null
    if (rhs == null) {
      return 1;
    }
    final int minSize = Math.min(this.getDelegate().length, rhs.getDelegate().length);
    //noinspection ArrayEquality
    if (this.delegate == rhs.getDelegate()) {
      return 0;
    } else {
      for (int i = 0; i < minSize; i++) {
        //int's cant be null
        final int cmp = Integer.compare(delegate[i], rhs.getDelegate()[i]);
        if (cmp == 0) {
          continue;
        }
        return cmp;
      }
      if (this.getDelegate().length == rhs.getDelegate().length) {
        return 0;
      } else if (this.getDelegate().length < rhs.getDelegate().length) {
        return -1;
      } else {
        return 1;
      }
    }
  }

  @Override
  public String toString()
  {
    return Arrays.toString(delegate);
  }
}