org.elasticsearch.common.util.SlicedLongList Maven / Gradle / Ivy

Show more of this group Show more artifacts with this name
Show all versions of elasticsearch
ElasticSearch - Open Source, Distributed, RESTful Search Engine
There is a newer version: 8.14.1
/*
 * Licensed to ElasticSearch and Shay Banon under one
 * or more contributor license agreements.  See the NOTICE file
 * distributed with this work for additional information
 * regarding copyright ownership. ElasticSearch 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.elasticsearch.common.util;

import java.util.AbstractList;
import java.util.RandomAccess;

import org.apache.lucene.util.ArrayUtil;
import org.apache.lucene.util.LongsRef;

import com.google.common.primitives.Longs;

public final class SlicedLongList extends AbstractList implements RandomAccess {

    public static final SlicedLongList EMPTY = new SlicedLongList(LongsRef.EMPTY_LONGS, 0, 0);

    public long[] values;
    public int offset;
    public int length;

    public SlicedLongList(int capacity) {
        this(new long[capacity], 0, capacity);
    }

    public SlicedLongList(long[] values, int offset, int length) {
        this.values = values;
        this.offset = offset;
        this.length = length;
    }

    @Override
    public int size() {
        return length;
    }

    @Override
    public boolean isEmpty() {
        return size() == 0;
    }

    @Override
    public Long get(int index) {
        assert index < size();
        return values[offset + index];
    }

    @Override
    public boolean contains(Object target) {
        // Overridden to prevent a ton of boxing
        return (target instanceof Long)
                && indexOf(values, (Long) target, offset, offset+length) != -1;
    }

    @Override
    public int indexOf(Object target) {
        // Overridden to prevent a ton of boxing
        if (target instanceof Long) {
            int i = indexOf(values, (Long) target, offset, offset+length);
            if (i >= 0) {
                return i - offset;
            }
        }
        return -1;
    }

    @Override
    public int lastIndexOf(Object target) {
        // Overridden to prevent a ton of boxing
        if (target instanceof Long) {
            int i = lastIndexOf(values, (Long) target, offset, offset+length);
            if (i >= 0) {
                return i - offset;
            }
        }
        return -1;
    }

    @Override
    public Long set(int index, Long element) {
        throw new UnsupportedOperationException("modifying list opertations are not implemented");
    }

    @Override
    public boolean equals(Object object) {
        if (object == this) {
            return true;
        }
        if (object instanceof SlicedLongList) {
            SlicedLongList that = (SlicedLongList) object;
            int size = size();
            if (that.size() != size) {
                return false;
            }
            for (int i = 0; i < size; i++) {
                if (values[offset + i] != that.values[that.offset + i]) {
                    return false;
                }
            }
            return true;
        }
        return super.equals(object);
    }

    @Override
    public int hashCode() {
        int result = 1;
        for (int i = 0; i < length; i++) {
            result = 31 * result + Longs.hashCode(values[offset+i]);
        }
        return result;
    }

    @Override
    public String toString() {
        StringBuilder builder = new StringBuilder(size() * 10);
        builder.append('[');
        if (length > 0) {
          builder.append(values[offset]);
            for (int i = 1; i < length; i++) {
                builder.append(", ").append(values[offset+i]);
            }
        }
        return builder.append(']').toString();
    }

    private static int indexOf(long[] array, long target, int start, int end) {
        for (int i = start; i < end; i++) {
            if (array[i] == target) {
                return i;
            }
        }
        return -1;
    }

    private static int lastIndexOf(long[] array, long target, int start, int end) {
        for (int i = end - 1; i >= start; i--) {
            if (array[i] == target) {
                return i;
            }
        }
        return -1;
    }

    public void grow(int newLength) {
        assert offset == 0;
        values = ArrayUtil.grow(values, newLength);
    }
}