package org.eclipse.collections.impl.list.mutable.primitive;
import java.io.Externalizable;
import java.io.IOException;
import java.io.ObjectInput;
import java.io.ObjectOutput;
import java.util.Arrays;
import java.util.Collection;
import java.util.Iterator;
import java.util.NoSuchElementException;
import org.eclipse.collections.api.ShortIterable;
import org.eclipse.collections.api.LazyShortIterable;
import org.eclipse.collections.api.RichIterable;
import org.eclipse.collections.api.block.comparator.primitive.ShortComparator;
import org.eclipse.collections.api.block.function.primitive.ObjectShortIntToObjectFunction;
import org.eclipse.collections.api.block.function.primitive.ObjectShortToObjectFunction;
import org.eclipse.collections.api.block.function.primitive.ShortToObjectFunction;
import org.eclipse.collections.api.block.predicate.primitive.ShortPredicate;
import org.eclipse.collections.api.block.procedure.primitive.ShortIntProcedure;
import org.eclipse.collections.api.block.procedure.primitive.ShortProcedure;
import org.eclipse.collections.api.collection.primitive.MutableShortCollection;
import org.eclipse.collections.api.iterator.MutableShortIterator;
import org.eclipse.collections.api.iterator.ShortIterator;
import org.eclipse.collections.api.list.MutableList;
import org.eclipse.collections.api.list.primitive.ShortList;
import org.eclipse.collections.api.list.primitive.ImmutableShortList;
import org.eclipse.collections.api.list.primitive.MutableShortList;
import org.eclipse.collections.api.set.primitive.ShortSet;
import org.eclipse.collections.api.set.primitive.MutableShortSet;
import org.eclipse.collections.api.tuple.primitive.ShortShortPair;
import org.eclipse.collections.api.tuple.primitive.ShortObjectPair;
import org.eclipse.collections.impl.factory.Lists;
import org.eclipse.collections.impl.factory.primitive.ShortLists;
import org.eclipse.collections.impl.lazy.primitive.ReverseShortIterable;
import org.eclipse.collections.impl.list.mutable.FastList;
import org.eclipse.collections.impl.primitive.AbstractShortIterable;
import org.eclipse.collections.impl.set.mutable.primitive.ShortHashSet;
import org.eclipse.collections.impl.tuple.primitive.PrimitiveTuples;
import org.eclipse.collections.impl.utility.Iterate;
import org.eclipse.collections.impl.utility.primitive.ShortQuickSort;
public class ShortArrayList extends AbstractShortIterable
implements MutableShortList, Externalizable
{
private static final long serialVersionUID = 1L;
private static final short[] DEFAULT_SIZED_EMPTY_ARRAY = {};
private static final short[] ZERO_SIZED_ARRAY = {};
private static final int MAXIMUM_ARRAY_SIZE = Integer.MAX_VALUE - 8;
protected int size;
protected transient short[] items = DEFAULT_SIZED_EMPTY_ARRAY;
public ShortArrayList()
{
}
public ShortArrayList(int initialCapacity)
{
this.items = initialCapacity == 0 ? ZERO_SIZED_ARRAY : new short[initialCapacity];
}
public ShortArrayList(short... array)
{
this.size = array.length;
this.items = array;
}
public static ShortArrayList newListWith(short... elements)
{
return new ShortArrayList(elements);
}
public static ShortArrayList newList(ShortIterable source)
{
return ShortArrayList.newListWith(source.toArray());
}
public static ShortArrayList newWithNValues(int size, short value)
{
ShortArrayList newList = new ShortArrayList(size);
newList.size = size;
Arrays.fill(newList.items, value);
return newList;
}
public static ShortArrayList wrapCopy(short... array)
{
short[] newArray = new short[array.length];
System.arraycopy(array, 0, newArray, 0, array.length);
return new ShortArrayList(newArray);
}
@Override
public int size()
{
return this.size;
}
@Override
public void clear()
{
Arrays.fill(this.items, 0, size, (short) 0);
this.size = 0;
}
@Override
public boolean contains(short value)
{
for (int i = 0; i < this.size; i++)
{
if (this.items[i] == value)
{
return true;
}
}
return false;
}
@Override
public short get(int index)
{
if (index < this.size)
{
return this.items[index];
}
throw this.newIndexOutOfBoundsException(index);
}
private IndexOutOfBoundsException newIndexOutOfBoundsException(int index)
{
return new IndexOutOfBoundsException("Index: " + index + " Size: " + this.size);
}
@Override
public short getFirst()
{
this.checkEmpty();
return this.items[0];
}
@Override
public short getLast()
{
this.checkEmpty();
return this.items[this.size() - 1];
}
private void checkEmpty()
{
if (this.isEmpty())
{
throw this.newIndexOutOfBoundsException(0);
}
}
@Override
public int indexOf(short value)
{
for (int i = 0; i < this.size; i++)
{
if (this.items[i] == value)
{
return i;
}
}
return -1;
}
@Override
public int lastIndexOf(short value)
{
for (int i = this.size - 1; i >= 0; i--)
{
if (this.items[i] == value)
{
return i;
}
}
return -1;
}
public void trimToSize()
{
if (this.size < this.items.length)
{
this.transferItemsToNewArrayWithCapacity(this.size);
}
}
private void transferItemsToNewArrayWithCapacity(int newCapacity)
{
this.items = this.copyItemsWithNewCapacity(newCapacity);
}
private short[] copyItemsWithNewCapacity(int newCapacity)
{
short[] newItems = new short[newCapacity];
System.arraycopy(this.items, 0, newItems, 0, Math.min(this.size, newCapacity));
return newItems;
}
private int sizePlusFiftyPercent(int oldSize)
{
int result = oldSize + (oldSize >> 1) + 1;
return result < oldSize ? MAXIMUM_ARRAY_SIZE : result;
}
public void ensureCapacity(int minCapacity)
{
int oldCapacity = this.items.length;
if (minCapacity > oldCapacity)
{
int newCapacity = Math.max(this.sizePlusFiftyPercent(oldCapacity), minCapacity);
this.transferItemsToNewArrayWithCapacity(newCapacity);
}
}
private void ensureCapacityForAdd()
{
if (this.items == DEFAULT_SIZED_EMPTY_ARRAY)
{
this.items = new short[10];
}
else
{
this.transferItemsToNewArrayWithCapacity(this.sizePlusFiftyPercent(this.size));
}
}
@Override
public boolean add(short newItem)
{
if (this.items.length == this.size)
{
this.ensureCapacityForAdd();
}
this.items[this.size] = newItem;
this.size++;
return true;
}
@Override
public boolean addAll(short... source)
{
if (source.length < 1)
{
return false;
}
this.copyItems(source.length, source);
return true;
}
@Override
public boolean addAll(ShortIterable source)
{
if (source instanceof ShortArrayList)
{
if (source.isEmpty())
{
return false;
}
ShortArrayList other = (ShortArrayList) source;
this.copyItems(other.size(), other.items);
return true;
}
return this.addAll(source.toArray());
}
private void copyItems(int sourceSize, short[] source)
{
int newSize = this.size + sourceSize;
this.ensureCapacity(newSize);
System.arraycopy(source, 0, this.items, this.size, sourceSize);
this.size = newSize;
}
private void throwOutOfBounds(int index)
{
throw this.newIndexOutOfBoundsException(index);
}
@Override
public void addAtIndex(int index, short element)
{
if (index > -1 && index < this.size)
{
this.addAtIndexLessThanSize(index, element);
}
else if (index == this.size)
{
this.add(element);
}
else
{
this.throwOutOfBounds(index);
}
}
private void addAtIndexLessThanSize(int index, short element)
{
int oldSize = this.size;
this.size++;
if (this.items.length == oldSize)
{
short[] newItems = new short[this.sizePlusFiftyPercent(oldSize)];
if (index > 0)
{
System.arraycopy(this.items, 0, newItems, 0, index);
}
System.arraycopy(this.items, index, newItems, index + 1, oldSize - index);
this.items = newItems;
}
else
{
System.arraycopy(this.items, index, this.items, index + 1, oldSize - index);
}
this.items[index] = element;
}
@Override
public boolean addAllAtIndex(int index, short... source)
{
if (index > this.size || index < 0)
{
this.throwOutOfBounds(index);
}
if (source.length == 0)
{
return false;
}
int sourceSize = source.length;
int newSize = this.size + sourceSize;
this.ensureCapacity(newSize);
this.shiftElementsAtIndex(index, sourceSize);
System.arraycopy(source, 0, this.items, index, sourceSize);
this.size = newSize;
return true;
}
@Override
public boolean addAllAtIndex(int index, ShortIterable source)
{
return this.addAllAtIndex(index, source.toArray());
}
private void shiftElementsAtIndex(int index, int sourceSize)
{
int numberToMove = this.size - index;
if (numberToMove > 0)
{
System.arraycopy(this.items, index, this.items, index + sourceSize, numberToMove);
}
}
@Override
public boolean remove(short value)
{
int index = this.indexOf(value);
if (index >= 0)
{
this.removeAtIndex(index);
return true;
}
return false;
}
@Override
public boolean removeIf(ShortPredicate predicate)
{
int currentFilledIndex = 0;
for (int i = 0; i < this.size; i++)
{
short item = this.items[i];
if (!predicate.accept(item))
{
if (currentFilledIndex != i)
{
this.items[currentFilledIndex] = item;
}
currentFilledIndex++;
}
}
boolean changed = currentFilledIndex < this.size;
this.wipeAndResetTheEnd(currentFilledIndex);
return changed;
}
private void wipeAndResetTheEnd(int newCurrentFilledIndex)
{
for (int i = newCurrentFilledIndex; i < this.size; i++)
{
this.items[i] = (short) 0;
}
this.size = newCurrentFilledIndex;
}
@Override
public boolean removeAll(ShortIterable source)
{
boolean modified = false;
for (int index = 0; index < this.size; index++)
{
if (source.contains(this.get(index)))
{
this.removeAtIndex(index);
index--;
modified = true;
}
}
return modified;
}
@Override
public boolean removeAll(short... source)
{
ShortHashSet set = ShortHashSet.newSetWith(source);
short[] newItems = new short[this.size];
int count = 0;
int oldSize = this.size;
for (int index = 0; index < this.size; index++)
{
if (!set.contains(this.items[index]))
{
newItems[count] = this.items[index];
count++;
}
}
this.items = newItems;
this.size = count;
return oldSize != this.size;
}
@Override
public boolean retainAll(ShortIterable source)
{
int oldSize = this.size();
final ShortSet sourceSet = source instanceof ShortSet ? (ShortSet) source : source.toSet();
ShortArrayList retained = this.select(sourceSet::contains);
this.size = retained.size;
this.items = retained.items;
return oldSize != this.size();
}
@Override
public boolean retainAll(short... source)
{
return this.retainAll(ShortHashSet.newSetWith(source));
}
@Override
public short removeAtIndex(int index)
{
short previous = this.get(index);
int totalOffset = this.size - index - 1;
if (totalOffset > 0)
{
System.arraycopy(this.items, index + 1, this.items, index, totalOffset);
}
--this.size;
this.items[this.size] = (short) 0;
return previous;
}
@Override
public short set(int index, short element)
{
short previous = this.get(index);
this.items[index] = element;
return previous;
}
@Override
public void swap(int index1, int index2)
{
short value = this.get(index1);
this.items[index1] = this.items[index2];
this.items[index2] = value;
}
@Override
public ShortArrayList with(short element)
{
this.add(element);
return this;
}
@Override
public ShortArrayList without(short element)
{
this.remove(element);
return this;
}
@Override
public ShortArrayList withAll(ShortIterable elements)
{
this.addAll(elements.toArray());
return this;
}
@Override
public ShortArrayList withoutAll(ShortIterable elements)
{
this.removeAll(elements);
return this;
}
public ShortArrayList with(short element1, short element2)
{
this.add(element1);
this.add(element2);
return this;
}
public ShortArrayList with(short element1, short element2, short element3)
{
this.add(element1);
this.add(element2);
this.add(element3);
return this;
}
public ShortArrayList with(short element1, short element2, short element3, short... elements)
{
this.add(element1);
this.add(element2);
this.add(element3);
return this.withArrayCopy(elements, 0, elements.length);
}
private ShortArrayList withArrayCopy(short[] elements, int begin, int length)
{
this.ensureCapacity(this.size + length);
System.arraycopy(elements, begin, this.items, this.size, length);
this.size += length;
return this;
}
@Override
public MutableShortIterator shortIterator()
{
return new InternalShortIterator();
}
@Override
public void forEach(ShortProcedure procedure)
{
this.each(procedure);
}
@Override
public void each(ShortProcedure procedure)
{
for (int i = 0; i < this.size; i++)
{
procedure.value(this.items[i]);
}
}
@Override
public void forEachWithIndex(ShortIntProcedure procedure)
{
for (int i = 0; i < this.size; i++)
{
procedure.value(this.items[i], i);
}
}
@Override
public <T> T injectInto(T injectedValue, ObjectShortToObjectFunction<? super T, ? extends T> function)
{
T result = injectedValue;
for (int i = 0; i < this.size; i++)
{
result = function.valueOf(result, this.items[i]);
}
return result;
}
@Override
public <T> T injectIntoWithIndex(T injectedValue, ObjectShortIntToObjectFunction<? super T, ? extends T> function)
{
T result = injectedValue;
for (int i = 0; i < this.size; i++)
{
result = function.valueOf(result, this.items[i], i);
}
return result;
}
@Override
public RichIterable<ShortIterable> chunk(int size)
{
if (size <= 0)
{
throw new IllegalArgumentException("Size for groups must be positive but was: " + size);
}
MutableList<ShortIterable> result = Lists.mutable.empty();
if (this.notEmpty())
{
if (this.size() <= size)
{
result.add(ShortLists.mutable.withAll(this));
}
else
{
ShortIterator iterator = this.shortIterator();
while (iterator.hasNext())
{
MutableShortList batch = ShortLists.mutable.empty();
for (int i = 0; i < size && iterator.hasNext(); i++)
{
batch.add(iterator.next());
}
result.add(batch);
}
}
}
return result;
}
@Override
public int count(ShortPredicate predicate)
{
int count = 0;
for (int i = 0; i < this.size; i++)
{
if (predicate.accept(this.items[i]))
{
count++;
}
}
return count;
}
@Override
public boolean anySatisfy(ShortPredicate predicate)
{
for (int i = 0; i < this.size; i++)
{
if (predicate.accept(this.items[i]))
{
return true;
}
}
return false;
}
@Override
public boolean allSatisfy(ShortPredicate predicate)
{
for (int i = 0; i < this.size; i++)
{
if (!predicate.accept(this.items[i]))
{
return false;
}
}
return true;
}
@Override
public boolean noneSatisfy(ShortPredicate predicate)
{
return !this.anySatisfy(predicate);
}
@Override
public ShortArrayList select(ShortPredicate predicate)
{
return this.select(predicate, new ShortArrayList());
}
@Override
public <R extends MutableShortCollection> R select(ShortPredicate predicate, R target)
{
for (int i = 0; i < this.size; i++)
{
short item = this.items[i];
if (predicate.accept(item))
{
target.add(item);
}
}
return target;
}
@Override
public ShortArrayList reject(ShortPredicate predicate)
{
return this.reject(predicate, new ShortArrayList());
}
@Override
public <R extends MutableShortCollection> R reject(ShortPredicate predicate, R target)
{
for (int i = 0; i < this.size; i++)
{
short item = this.items[i];
if (!predicate.accept(item))
{
target.add(item);
}
}
return target;
}
@Override
public short detectIfNone(ShortPredicate predicate, short ifNone)
{
for (int i = 0; i < this.size; i++)
{
short item = this.items[i];
if (predicate.accept(item))
{
return item;
}
}
return ifNone;
}
@Override
public <V> MutableList<V> collect(ShortToObjectFunction<? extends V> function)
{
return this.collect(function, FastList.newList(this.size));
}
@Override
public <V, R extends Collection<V>> R collect(ShortToObjectFunction<? extends V> function, R target)
{
for (int i = 0; i < this.size; i++)
{
target.add(function.valueOf(this.items[i]));
}
return target;
}
@Override
public short max()
{
if (this.isEmpty())
{
throw new NoSuchElementException();
}
short max = this.items[0];
for (int i = 1; i < this.size; i++)
{
short value = this.items[i];
if (max < value)
{
max = value;
}
}
return max;
}
@Override
public short min()
{
if (this.isEmpty())
{
throw new NoSuchElementException();
}
short min = this.items[0];
for (int i = 1; i < this.size; i++)
{
short value = this.items[i];
if (value < min)
{
min = value;
}
}
return min;
}
@Override
public long sum()
{
long result = 0L;
for (int i = 0; i < this.size; i++)
{
result += this.items[i];
}
return result;
}
@Override
public long dotProduct(ShortList list)
{
if (this.size != list.size())
{
throw new IllegalArgumentException("Lists used in dotProduct must be the same size");
}
long sum = 0L;
for (int i = 0; i < this.size; i++)
{
sum += (long) this.items[i] * list.get(i);
}
return sum;
}
@Override
public short[] toArray()
{
short[] newItems = new short[this.size];
System.arraycopy(this.items, 0, newItems, 0, this.size);
return newItems;
}
@Override
public short[] toArray(short[] target)
{
if (target.length < this.size)
{
target = new short[this.size];
}
System.arraycopy(this.items, 0, target, 0, this.size);
return target;
}
@Override
public boolean equals(Object otherList)
{
if (otherList == this)
{
return true;
}
if (!(otherList instanceof ShortList))
{
return false;
}
ShortList list = (ShortList) otherList;
if (this.size != list.size())
{
return false;
}
for (int i = 0; i < this.size; i++)
{
if (this.items[i] != list.get(i))
{
return false;
}
}
return true;
}
@Override
public int hashCode()
{
int hashCode = 1;
for (int i = 0; i < this.size; i++)
{
short item = this.items[i];
hashCode = 31 * hashCode + (int) item;
}
return hashCode;
}
@Override
public void appendString(
Appendable appendable,
String start,
String separator,
String end)
{
try
{
appendable.append(start);
for (int i = 0; i < this.size; i++)
{
if (i > 0)
{
appendable.append(separator);
}
short value = this.items[i];
appendable.append(String.valueOf(value));
}
appendable.append(end);
}
catch (IOException e)
{
throw new RuntimeException(e);
}
}
@Override
public MutableShortList asUnmodifiable()
{
return new UnmodifiableShortList(this);
}
@Override
public MutableShortList asSynchronized()
{
return new SynchronizedShortList(this);
}
@Override
public ImmutableShortList toImmutable()
{
return ShortLists.immutable.withAll(this);
}
@Override
public void writeExternal(ObjectOutput out) throws IOException
{
out.writeInt(this.size);
for (int i = 0; i < this.size; i++)
{
out.writeShort(this.items[i]);
}
}
@Override
public void readExternal(ObjectInput in) throws IOException
{
this.size = in.readInt();
this.items = new short[this.size];
for (int i = 0; i < this.size; i++)
{
this.items[i] = in.readShort();
}
}
@Override
public LazyShortIterable asReversed()
{
return ReverseShortIterable.adapt(this);
}
@Override
public ShortArrayList reverseThis()
{
int endIndex = this.size - 1;
for (int i = 0; i < this.size / 2; i++)
{
short tempSwapValue = this.items[i];
this.items[i] = this.items[endIndex - i];
this.items[endIndex - i] = tempSwapValue;
}
return this;
}
@Override
public ShortArrayList sortThis()
{
Arrays.sort(this.items, 0, this.size);
return this;
}
@Override
public ShortArrayList sortThis(ShortComparator comparator)
{
ShortQuickSort.sort(this.items, 0, this.size() - 1, comparator);
return this;
}
@Override
public ShortArrayList toReversed()
{
return ShortArrayList.newList(this.asReversed());
}
@Override
public int binarySearch(short value)
{
return Arrays.binarySearch(this.items, 0, this.size, value);
}
@Override
public MutableShortList distinct()
{
ShortArrayList target = new ShortArrayList();
MutableShortSet seenSoFar = new ShortHashSet(this.size());
for (int i = 0; i < this.size; i++)
{
short each = this.items[i];
if (seenSoFar.add(each))
{
target.add(each);
}
}
return target;
}
@Override
public MutableShortList subList(int fromIndex, int toIndex)
{
throw new UnsupportedOperationException("subList not yet implemented!");
}
@Override
public MutableList<ShortShortPair> zipShort(ShortIterable iterable)
{
int size = this.size();
int otherSize = iterable.size();
MutableList<ShortShortPair> target = Lists.mutable.withInitialCapacity(Math.min(size, otherSize));
ShortIterator iterator = iterable.shortIterator();
for (int i = 0; i < size && i < otherSize; i++)
{
target.add(PrimitiveTuples.pair(this.items[i], iterator.next()));
}
return target;
}
public ShortArrayList newEmpty()
{
return new ShortArrayList();
}
@Override
public <T> MutableList<ShortObjectPair<T>> zip(Iterable<T> iterable)
{
int size = this.size();
int otherSize = Iterate.sizeOf(iterable);
MutableList<ShortObjectPair<T>> target = Lists.mutable.withInitialCapacity(Math.min(size, otherSize));
Iterator<T> iterator = iterable.iterator();
for (int i = 0; i < size && iterator.hasNext(); i++)
{
target.add(PrimitiveTuples.pair(this.items[i], iterator.next()));
}
return target;
}
private class InternalShortIterator implements MutableShortIterator
{
private int currentIndex;
private int lastIndex = -1;
@Override
public boolean hasNext()
{
return this.currentIndex != ShortArrayList.this.size();
}
@Override
public short next()
{
if (!this.hasNext())
{
throw new NoSuchElementException();
}
short next = ShortArrayList.this.items[this.currentIndex];
this.lastIndex = this.currentIndex++;
return next;
}
@Override
public void remove()
{
if (this.lastIndex == -1)
{
throw new IllegalStateException();
}
ShortArrayList.this.removeAtIndex(this.lastIndex);
this.currentIndex--;
this.lastIndex = -1;
}
}
}
ShortArrayList
serialVersionUID: long
size: int
https://github.com/eclipse/eclipse-collections/eclipse-collections: Eclipse Collections is a collections framework for Java. It has JDK-compatible List, Set and Map
implementations with a rich API and set of utility classes that work with any JDK compatible Collections,
Arrays, Maps or Strings. The iteration protocol was inspired by the Smalltalk collection framework.