io.deephaven.chunk.OrderedChunkUtils Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of deephaven-engine-chunk Show documentation

Engine Chunks: Array-like data structures for dense, efficient data movement

The newest version!

//
// Copyright (c) 2016-2024 Deephaven Data Labs and Patent Pending
//
package io.deephaven.chunk;

import io.deephaven.chunk.attributes.Any;

import java.util.Arrays;

public class OrderedChunkUtils {

    /**
     * Finds the insertion point in {@code chunk} for {@code value}.
     *
     * @param chunk to search through
     * @param value the value to find
     * @return The insertion point in {@code [0, chunk.size())}.
     */
    public static  int findInChunk(final LongChunk chunk, final long value) {
        return findInChunk(chunk, value, 0, chunk.size());
    }

    /**
     * Finds the insertion point in {@code chunk} for {@code value}.
     *
     * @param chunk to search through
     * @param value the value to find
     * @param startOffset the minimum offset allowed
     * @param endOffsetExclusive the offset just beyond the maximum allowed
     * @return The insertion point in {@code [startOffset, endOffsetExclusive)}.
     */
    public static  int findInChunk(final LongChunk chunk, final long value,
            final int startOffset, final int endOffsetExclusive) {
        int retVal = Arrays.binarySearch(chunk.data, chunk.offset + startOffset,
                chunk.offset + endOffsetExclusive, value);
        // Note that Arrays.binarySearch returns `-i + 1` if element not found.
        retVal = (retVal < 0) ? ~retVal : retVal;
        return Math.min(retVal - chunk.offset, chunk.size);
    }
}