Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $
You can buy this project and download/modify it how often you want.
com.simplaex.bedrock.SeqSimpleView Maven / Gradle / Ivy
package com.simplaex.bedrock;
import javax.annotation.Nonnegative;
import javax.annotation.Nonnull;
import java.lang.reflect.Array;
import java.util.Arrays;
import java.util.Comparator;
import java.util.Objects;
class SeqSimpleView extends Seq {
private final int beginOffset;
private final int endOffset;
private final Object[] backingArray;
SeqSimpleView(
@Nonnull final Object[] array,
@Nonnegative final int beginOffset,
@Nonnegative final int endOffset
) {
this.backingArray = array;
this.beginOffset = beginOffset;
this.endOffset = endOffset;
}
@SuppressWarnings("unchecked")
@Override
public E get(@Nonnegative final int index) {
checkBounds(index);
return (E) backingArray[beginOffset + index];
}
@Nonnull
@Override
public Seq reversed() {
return new SeqReversedView<>(backingArray, beginOffset, endOffset);
}
@SuppressWarnings("unchecked")
@Nonnull
@Override
public Seq sorted() {
final Object[] array = new Object[length()];
System.arraycopy(backingArray, beginOffset, array, 0, length());
Arrays.sort(array, NULL_ACCEPTING_COMPARATOR);
return new SeqSimpleSorted(array);
}
@SuppressWarnings("unchecked")
@Nonnull
@Override
public Seq sortedBy(@Nonnull final Comparator comparator) {
Objects.requireNonNull(comparator);
final Object[] array = new Object[length()];
System.arraycopy(backingArray, beginOffset, array, 0, length());
Arrays.sort(array, (Comparator) comparator);
return new SeqSimple<>(array);
}
@Nonnull
@Override
public Seq trimmedToSize() {
final Object[] array = new Object[length()];
System.arraycopy(backingArray, beginOffset, array, 0, length());
return new SeqSimple<>(array);
}
@Nonnull
@Override
public Object[] toArray() {
final int len = length();
final Object[] array = new Object[len];
System.arraycopy(backingArray, beginOffset, array, 0, len);
return array;
}
@Nonnull
@Override
public Seq subSequence(@Nonnegative final int beginOffset, @Nonnegative final int endOffset) {
final int begin = Math.max(0, beginOffset);
final int end = Math.min(length(), endOffset);
final int len = end - begin;
if (len <= 0) {
return empty();
}
final Object[] array = new Object[len];
System.arraycopy(backingArray, this.beginOffset + begin, array, 0, len);
return new SeqSimple<>(array);
}
@Nonnull
@Override
public Seq subSequenceView(@Nonnegative final int beginOffset, @Nonnegative final int endOffset) {
final int begin = Math.max(0, beginOffset);
final int end = Math.min(length(), endOffset);
final int len = end - begin;
if (len <= 0) {
return empty();
}
return new SeqSimpleView<>(backingArray, this.beginOffset + begin, this.beginOffset + end);
}
@Nonnull
@Override
public E[] toArray(@Nonnull final Class evidence) {
Objects.requireNonNull(evidence);
final int len = length();
@SuppressWarnings("unchecked") final E[] array = (E[]) Array.newInstance(evidence, len);
//noinspection SuspiciousSystemArraycopy
System.arraycopy(backingArray, beginOffset, array, 0, len);
return array;
}
@Nonnegative
@Override
public int length() {
return endOffset - beginOffset;
}
}
