com.landawn.abacus.util.stream.ArrayShortStream Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of abacus-android Show documentation
Show all versions of abacus-android Show documentation
A general and simple library for Android
/*
* Copyright (C) 2016, 2017, 2018, 2019 HaiYang Li
*
* Licensed 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 com.landawn.abacus.util.stream;
import java.util.ArrayList;
import java.util.Collection;
import java.util.Comparator;
import java.util.Deque;
import java.util.HashSet;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.NoSuchElementException;
import java.util.Set;
import java.util.concurrent.Executor;
import com.landawn.abacus.exception.DuplicatedResultException;
import com.landawn.abacus.util.IntIterator;
import com.landawn.abacus.util.LongMultiset;
import com.landawn.abacus.util.Multiset;
import com.landawn.abacus.util.N;
import com.landawn.abacus.util.ShortIterator;
import com.landawn.abacus.util.ShortList;
import com.landawn.abacus.util.ShortSummaryStatistics;
import com.landawn.abacus.util.StringUtil.Strings;
import com.landawn.abacus.util.Try;
import com.landawn.abacus.util.u.OptionalDouble;
import com.landawn.abacus.util.u.OptionalShort;
import com.landawn.abacus.util.function.BiConsumer;
import com.landawn.abacus.util.function.BiFunction;
import com.landawn.abacus.util.function.BinaryOperator;
import com.landawn.abacus.util.function.ObjShortConsumer;
import com.landawn.abacus.util.function.ShortBinaryOperator;
import com.landawn.abacus.util.function.ShortConsumer;
import com.landawn.abacus.util.function.ShortFunction;
import com.landawn.abacus.util.function.ShortPredicate;
import com.landawn.abacus.util.function.ShortToIntFunction;
import com.landawn.abacus.util.function.ShortUnaryOperator;
import com.landawn.abacus.util.function.Supplier;
/**
*
*/
class ArrayShortStream extends AbstractShortStream {
final short[] elements;
final int fromIndex;
final int toIndex;
ArrayShortStream(final short[] values) {
this(values, 0, values.length);
}
ArrayShortStream(final short[] values, final Collection closeHandlers) {
this(values, 0, values.length, closeHandlers);
}
ArrayShortStream(final short[] values, final boolean sorted, final Collection closeHandlers) {
this(values, 0, values.length, sorted, closeHandlers);
}
ArrayShortStream(final short[] values, final int fromIndex, final int toIndex) {
this(values, fromIndex, toIndex, null);
}
ArrayShortStream(final short[] values, final int fromIndex, final int toIndex, final Collection closeHandlers) {
this(values, fromIndex, toIndex, false, closeHandlers);
}
ArrayShortStream(final short[] values, final int fromIndex, final int toIndex, final boolean sorted, final Collection closeHandlers) {
super(sorted, closeHandlers);
checkFromToIndex(fromIndex, toIndex, N.len(values));
this.elements = values;
this.fromIndex = fromIndex;
this.toIndex = toIndex;
}
@Override
public ShortStream filter(final ShortPredicate predicate) {
return newStream(new ShortIteratorEx() {
private boolean hasNext = false;
private int cursor = fromIndex;
@Override
public boolean hasNext() {
if (hasNext == false && cursor < toIndex) {
do {
if (predicate.test(elements[cursor])) {
hasNext = true;
break;
}
} while (++cursor < toIndex);
}
return hasNext;
}
@Override
public short nextShort() {
if (hasNext == false && hasNext() == false) {
throw new NoSuchElementException();
}
hasNext = false;
return elements[cursor++];
}
}, sorted);
}
@Override
public ShortStream takeWhile(final ShortPredicate predicate) {
return newStream(new ShortIteratorEx() {
private boolean hasMore = true;
private boolean hasNext = false;
private int cursor = fromIndex;
@Override
public boolean hasNext() {
if (hasNext == false && hasMore && cursor < toIndex) {
if (predicate.test(elements[cursor])) {
hasNext = true;
} else {
hasMore = false;
}
}
return hasNext;
}
@Override
public short nextShort() {
if (hasNext == false && hasNext() == false) {
throw new NoSuchElementException();
}
hasNext = false;
return elements[cursor++];
}
}, sorted);
}
@Override
public ShortStream dropWhile(final ShortPredicate predicate) {
return newStream(new ShortIteratorEx() {
private boolean hasNext = false;
private int cursor = fromIndex;
private boolean dropped = false;
@Override
public boolean hasNext() {
if (hasNext == false && cursor < toIndex) {
if (dropped == false) {
dropped = true;
do {
if (predicate.test(elements[cursor]) == false) {
hasNext = true;
break;
}
} while (++cursor < toIndex);
} else {
hasNext = true;
}
}
return hasNext;
}
@Override
public short nextShort() {
if (hasNext == false && hasNext() == false) {
throw new NoSuchElementException();
}
hasNext = false;
return elements[cursor++];
}
}, sorted);
}
@Override
public ShortStream step(final long step) {
checkArgPositive(step, "step");
if (step == 1 || fromIndex == toIndex) {
return newStream(elements, fromIndex, toIndex, sorted);
}
return newStream(new ShortIteratorEx() {
private final int stepp = (int) N.min(step, Integer.MAX_VALUE);
private int cursor = fromIndex;
@Override
public boolean hasNext() {
return cursor < toIndex;
}
@Override
public short nextShort() {
if (cursor >= toIndex) {
throw new NoSuchElementException();
}
final short res = elements[cursor];
cursor = cursor > toIndex - stepp ? toIndex : cursor + stepp;
return res;
}
@Override
public long count() {
return (toIndex - cursor) % stepp == 0 ? (toIndex - cursor) / stepp : ((toIndex - cursor) / stepp) + 1;
}
@Override
public void skip(long n) {
cursor = n <= (toIndex - cursor) / stepp ? cursor + (int) (n * stepp) : toIndex;
}
@Override
public short[] toArray() {
final short[] a = new short[(int) count()];
for (int i = 0, len = a.length; i < len; i++, cursor += stepp) {
a[i] = elements[cursor];
}
return a;
}
}, sorted);
}
@Override
public ShortStream map(final ShortUnaryOperator mapper) {
return newStream(new ShortIteratorEx() {
private int cursor = fromIndex;
@Override
public boolean hasNext() {
return cursor < toIndex;
}
@Override
public short nextShort() {
if (cursor >= toIndex) {
throw new NoSuchElementException();
}
return mapper.applyAsShort(elements[cursor++]);
}
// @Override
// public long count() {
// return toIndex - cursor;
// }
//
// @Override
// public void skip(long n) {
// checkArgNotNegative(n, "n");
//
// cursor = n < toIndex - cursor ? cursor + (int) n : toIndex;
// }
@Override
public short[] toArray() {
final short[] a = new short[toIndex - cursor];
for (int i = 0, len = toIndex - cursor; i < len; i++) {
a[i] = mapper.applyAsShort(elements[cursor++]);
}
return a;
}
}, false);
}
@Override
public IntStream mapToInt(final ShortToIntFunction mapper) {
return newStream(new IntIteratorEx() {
private int cursor = fromIndex;
@Override
public boolean hasNext() {
return cursor < toIndex;
}
@Override
public int nextInt() {
if (cursor >= toIndex) {
throw new NoSuchElementException();
}
return mapper.applyAsInt(elements[cursor++]);
}
// @Override
// public long count() {
// return toIndex - cursor;
// }
//
// @Override
// public void skip(long n) {
// checkArgNotNegative(n, "n");
//
// cursor = n < toIndex - cursor ? cursor + (int) n : toIndex;
// }
@Override
public int[] toArray() {
final int[] a = new int[toIndex - cursor];
for (int i = 0, len = toIndex - cursor; i < len; i++) {
a[i] = mapper.applyAsInt(elements[cursor++]);
}
return a;
}
}, false);
}
@Override
public Stream mapToObj(final ShortFunction mapper) {
return newStream(new ObjIteratorEx() {
private int cursor = fromIndex;
@Override
public boolean hasNext() {
return cursor < toIndex;
}
@Override
public U next() {
if (cursor >= toIndex) {
throw new NoSuchElementException();
}
return mapper.apply(elements[cursor++]);
}
// @Override
// public long count() {
// return toIndex - cursor;
// }
//
// @Override
// public void skip(long n) {
// checkArgNotNegative(n, "n");
//
// cursor = n < toIndex - cursor ? cursor + (int) n : toIndex;
// }
@Override
public A[] toArray(A[] a) {
a = a.length >= toIndex - cursor ? a : (A[]) N.newArray(a.getClass().getComponentType(), toIndex - cursor);
for (int i = 0, len = toIndex - cursor; i < len; i++) {
a[i] = (A) mapper.apply(elements[cursor++]);
}
return a;
}
}, false, null);
}
@Override
public ShortStream flatMap(final ShortFunction mapper) {
final ShortIteratorEx iter = new ShortIteratorEx() {
private int cursor = fromIndex;
private ShortIterator cur = null;
private ShortStream s = null;
private Runnable closeHandle = null;
@Override
public boolean hasNext() {
while ((cur == null || cur.hasNext() == false) && cursor < toIndex) {
if (closeHandle != null) {
final Runnable tmp = closeHandle;
closeHandle = null;
tmp.run();
}
s = mapper.apply(elements[cursor++]);
if (N.notNullOrEmpty(s.closeHandlers)) {
final Deque tmp = s.closeHandlers;
closeHandle = new Runnable() {
@Override
public void run() {
Stream.close(tmp);
}
};
}
cur = s.iterator();
}
return cur != null && cur.hasNext();
}
@Override
public short nextShort() {
if ((cur == null || cur.hasNext() == false) && hasNext() == false) {
throw new NoSuchElementException();
}
return cur.nextShort();
}
@Override
public void close() {
if (closeHandle != null) {
final Runnable tmp = closeHandle;
closeHandle = null;
tmp.run();
}
}
};
final Deque newCloseHandlers = N.isNullOrEmpty(closeHandlers) ? new LocalArrayDeque(1)
: new LocalArrayDeque(closeHandlers);
newCloseHandlers.add(new Runnable() {
@Override
public void run() {
iter.close();
}
});
return new IteratorShortStream(iter, newCloseHandlers);
}
@Override
public IntStream flatMapToInt(final ShortFunction mapper) {
final IntIteratorEx iter = new IntIteratorEx() {
private int cursor = fromIndex;
private IntIterator cur = null;
private IntStream s = null;
private Runnable closeHandle = null;
@Override
public boolean hasNext() {
while ((cur == null || cur.hasNext() == false) && cursor < toIndex) {
if (closeHandle != null) {
final Runnable tmp = closeHandle;
closeHandle = null;
tmp.run();
}
s = mapper.apply(elements[cursor++]);
if (N.notNullOrEmpty(s.closeHandlers)) {
final Deque tmp = s.closeHandlers;
closeHandle = new Runnable() {
@Override
public void run() {
Stream.close(tmp);
}
};
}
cur = s.iterator();
}
return cur != null && cur.hasNext();
}
@Override
public int nextInt() {
if ((cur == null || cur.hasNext() == false) && hasNext() == false) {
throw new NoSuchElementException();
}
return cur.nextInt();
}
@Override
public void close() {
if (closeHandle != null) {
final Runnable tmp = closeHandle;
closeHandle = null;
tmp.run();
}
}
};
final Deque newCloseHandlers = N.isNullOrEmpty(closeHandlers) ? new LocalArrayDeque(1)
: new LocalArrayDeque(closeHandlers);
newCloseHandlers.add(new Runnable() {
@Override
public void run() {
iter.close();
}
});
return new IteratorIntStream(iter, newCloseHandlers);
}
@Override
public Stream flatMapToObj(final ShortFunction> mapper) {
final ObjIteratorEx iter = new ObjIteratorEx() {
private int cursor = fromIndex;
private Iterator cur = null;
private Stream s = null;
private Runnable closeHandle = null;
@Override
public boolean hasNext() {
while ((cur == null || cur.hasNext() == false) && cursor < toIndex) {
if (closeHandle != null) {
final Runnable tmp = closeHandle;
closeHandle = null;
tmp.run();
}
s = mapper.apply(elements[cursor++]);
if (N.notNullOrEmpty(s.closeHandlers)) {
final Deque tmp = s.closeHandlers;
closeHandle = new Runnable() {
@Override
public void run() {
Stream.close(tmp);
}
};
}
cur = s.iterator();
}
return cur != null && cur.hasNext();
}
@Override
public T next() {
if ((cur == null || cur.hasNext() == false) && hasNext() == false) {
throw new NoSuchElementException();
}
return cur.next();
}
@Override
public void close() {
if (closeHandle != null) {
final Runnable tmp = closeHandle;
closeHandle = null;
tmp.run();
}
}
};
final Deque newCloseHandlers = N.isNullOrEmpty(closeHandlers) ? new LocalArrayDeque(1)
: new LocalArrayDeque(closeHandlers);
newCloseHandlers.add(new Runnable() {
@Override
public void run() {
iter.close();
}
});
return new IteratorStream<>(iter, newCloseHandlers);
}
@Override
public Stream split(final int chunkSize) {
checkArgPositive(chunkSize, "chunkSize");
return newStream(new ObjIteratorEx() {
private int cursor = fromIndex;
@Override
public boolean hasNext() {
return cursor < toIndex;
}
@Override
public ShortStream next() {
if (cursor >= toIndex) {
throw new NoSuchElementException();
}
return new ArrayShortStream(elements, cursor, (cursor = chunkSize < toIndex - cursor ? cursor + chunkSize : toIndex), sorted, null);
}
@Override
public long count() {
final long len = toIndex - cursor;
return len % chunkSize == 0 ? len / chunkSize : len / chunkSize + 1;
}
@Override
public void skip(long n) {
final long len = toIndex - cursor;
cursor = n <= len / chunkSize ? cursor + (int) n * chunkSize : toIndex;
}
}, false, null);
}
@Override
public Stream splitToList(final int chunkSize) {
checkArgPositive(chunkSize, "chunkSize");
return newStream(new ObjIteratorEx() {
private int cursor = fromIndex;
@Override
public boolean hasNext() {
return cursor < toIndex;
}
@Override
public ShortList next() {
if (cursor >= toIndex) {
throw new NoSuchElementException();
}
return new ShortList(N.copyOfRange(elements, cursor, (cursor = chunkSize < toIndex - cursor ? cursor + chunkSize : toIndex)));
}
@Override
public long count() {
final long len = toIndex - cursor;
return len % chunkSize == 0 ? len / chunkSize : len / chunkSize + 1;
}
@Override
public void skip(long n) {
final long len = toIndex - cursor;
cursor = n <= len / chunkSize ? cursor + (int) n * chunkSize : toIndex;
}
}, false, null);
}
@Override
public Stream split(final ShortPredicate predicate) {
return newStream(new ObjIteratorEx() {
private int cursor = fromIndex;
private boolean preCondition = false;
@Override
public boolean hasNext() {
return cursor < toIndex;
}
@Override
public ShortStream next() {
if (cursor >= toIndex) {
throw new NoSuchElementException();
}
final int from = cursor;
while (cursor < toIndex) {
if (from == cursor) {
preCondition = predicate.test(elements[cursor]);
cursor++;
} else if (predicate.test(elements[cursor]) == preCondition) {
cursor++;
} else {
break;
}
}
return new ArrayShortStream(elements, from, cursor, sorted, null);
}
}, false, null);
}
@Override
public Stream splitToList(final ShortPredicate predicate) {
return newStream(new ObjIteratorEx() {
private int cursor = fromIndex;
private boolean preCondition = false;
@Override
public boolean hasNext() {
return cursor < toIndex;
}
@Override
public ShortList next() {
if (cursor >= toIndex) {
throw new NoSuchElementException();
}
final int from = cursor;
while (cursor < toIndex) {
if (from == cursor) {
preCondition = predicate.test(elements[cursor]);
cursor++;
} else if (predicate.test(elements[cursor]) == preCondition) {
cursor++;
} else {
break;
}
}
return new ShortList(N.copyOfRange(elements, from, cursor));
}
}, false, null);
}
@Override
public Stream splitAt(final int where) {
checkArgNotNegative(where, "where");
final ShortStream[] a = new ShortStream[2];
final int middleIndex = where < toIndex - fromIndex ? fromIndex + where : toIndex;
a[0] = middleIndex == fromIndex ? ShortStream.empty() : new ArrayShortStream(elements, fromIndex, middleIndex, sorted, null);
a[1] = middleIndex == toIndex ? ShortStream.empty() : new ArrayShortStream(elements, middleIndex, toIndex, sorted, null);
return newStream(a, false, null);
}
@Override
public Stream sliding(final int windowSize, final int increment) {
checkArgument(windowSize > 0 && increment > 0, "windowSize=%s and increment=%s must be bigger than 0", windowSize, increment);
return newStream(new ObjIteratorEx() {
private int cursor = fromIndex;
@Override
public boolean hasNext() {
return cursor < toIndex;
}
@Override
public ShortStream next() {
if (cursor >= toIndex) {
throw new NoSuchElementException();
}
final ArrayShortStream result = new ArrayShortStream(elements, cursor, windowSize < toIndex - cursor ? cursor + windowSize : toIndex, sorted,
null);
cursor = increment < toIndex - cursor && windowSize < toIndex - cursor ? cursor + increment : toIndex;
return result;
}
@Override
public long count() {
if (toIndex - cursor == 0) {
return 0;
} else if (toIndex - cursor <= windowSize) {
return 1;
} else {
final long len = (toIndex - cursor) - windowSize;
return 1 + (len % increment == 0 ? len / increment : len / increment + 1);
}
}
@Override
public void skip(long n) {
if (n >= count()) {
cursor = toIndex;
} else {
cursor += n * increment;
}
}
}, false, null);
}
@Override
public Stream slidingToList(final int windowSize, final int increment) {
checkArgument(windowSize > 0 && increment > 0, "windowSize=%s and increment=%s must be bigger than 0", windowSize, increment);
return newStream(new ObjIteratorEx() {
private int cursor = fromIndex;
@Override
public boolean hasNext() {
return cursor < toIndex;
}
@Override
public ShortList next() {
if (cursor >= toIndex) {
throw new NoSuchElementException();
}
final ShortList result = ShortList.of(N.copyOfRange(elements, cursor, windowSize < toIndex - cursor ? cursor + windowSize : toIndex));
cursor = increment < toIndex - cursor && windowSize < toIndex - cursor ? cursor + increment : toIndex;
return result;
}
@Override
public long count() {
if (toIndex - cursor == 0) {
return 0;
} else if (toIndex - cursor <= windowSize) {
return 1;
} else {
final long len = (toIndex - cursor) - windowSize;
return 1 + (len % increment == 0 ? len / increment : len / increment + 1);
}
}
@Override
public void skip(long n) {
if (n >= count()) {
cursor = toIndex;
} else {
cursor += n * increment;
}
}
}, false, null);
}
@Override
public ShortStream top(final int n, final Comparator comparator) {
checkArgPositive(n, "n");
if (n >= toIndex - fromIndex) {
return newStream(elements, fromIndex, toIndex, sorted);
} else if (sorted && isSameComparator(comparator, cmp)) {
return newStream(elements, toIndex - n, toIndex, sorted);
}
return newStream(new ShortIteratorEx() {
private boolean initialized = false;
private short[] aar;
private int cursor = 0;
private int to;
@Override
public boolean hasNext() {
if (initialized == false) {
init();
}
return cursor < to;
}
@Override
public short nextShort() {
if (initialized == false) {
init();
}
if (cursor >= to) {
throw new NoSuchElementException();
}
return aar[cursor++];
}
@Override
public long count() {
if (initialized == false) {
init();
}
return to - cursor;
}
@Override
public void skip(long n) {
if (initialized == false) {
init();
}
cursor = n > to - cursor ? to : cursor + (int) n;
}
@Override
public short[] toArray() {
if (initialized == false) {
init();
}
final short[] a = new short[to - cursor];
N.copy(aar, cursor, a, 0, to - cursor);
return a;
}
@Override
public ShortList toList() {
return ShortList.of(toArray());
}
private void init() {
if (initialized == false) {
initialized = true;
aar = N.top(elements, fromIndex, toIndex, n, comparator);
to = aar.length;
}
}
}, false);
}
@Override
public ShortStream peek(final ShortConsumer action) {
return newStream(new ShortIteratorEx() {
private int cursor = fromIndex;
@Override
public boolean hasNext() {
return cursor < toIndex;
}
@Override
public short nextShort() {
if (cursor >= toIndex) {
throw new NoSuchElementException();
}
action.accept(elements[cursor]);
return elements[cursor++];
}
@Override
public short[] toArray() {
final short[] a = new short[toIndex - cursor];
for (int i = 0, len = toIndex - cursor; i < len; i++) {
action.accept(elements[cursor]);
a[i] = elements[cursor++];
}
return a;
}
}, sorted);
}
@Override
public ShortStream limit(final long maxSize) {
checkArgNotNegative(maxSize, "maxSize");
return newStream(elements, fromIndex, (int) (fromIndex + maxSize), sorted);
}
@Override
public ShortStream skip(long n) {
checkArgNotNegative(n, "n");
if (n >= toIndex - fromIndex) {
return newStream(elements, toIndex, toIndex, sorted);
} else {
return newStream(elements, (int) (fromIndex + n), toIndex, sorted);
}
}
@Override
public void forEach(final Try.ShortConsumer action) throws E {
assertNotClosed();
try {
for (int i = fromIndex; i < toIndex; i++) {
action.accept(elements[i]);
}
} finally {
close();
}
}
@Override
public short[] toArray() {
assertNotClosed();
try {
return N.copyOfRange(elements, fromIndex, toIndex);
} finally {
close();
}
}
@Override
public ShortList toShortList() {
assertNotClosed();
try {
return ShortList.of(N.copyOfRange(elements, fromIndex, toIndex));
} finally {
close();
}
}
@Override
public List toList() {
assertNotClosed();
try {
final List result = new ArrayList<>(toIndex - fromIndex);
for (int i = fromIndex; i < toIndex; i++) {
result.add(elements[i]);
}
return result;
} finally {
close();
}
}
@Override
public Set toSet() {
assertNotClosed();
try {
final Set result = new HashSet<>(N.initHashCapacity(toIndex - fromIndex));
for (int i = fromIndex; i < toIndex; i++) {
result.add(elements[i]);
}
return result;
} finally {
close();
}
}
@Override
public > C toCollection(Supplier supplier) {
assertNotClosed();
try {
final C result = supplier.get();
for (int i = fromIndex; i < toIndex; i++) {
result.add(elements[i]);
}
return result;
} finally {
close();
}
}
@Override
public Multiset toMultiset() {
assertNotClosed();
try {
final Multiset result = new Multiset<>(N.initHashCapacity(toIndex - fromIndex));
for (int i = fromIndex; i < toIndex; i++) {
result.add(elements[i]);
}
return result;
} finally {
close();
}
}
@Override
public Multiset toMultiset(Supplier> supplier) {
assertNotClosed();
try {
final Multiset result = supplier.get();
for (int i = fromIndex; i < toIndex; i++) {
result.add(elements[i]);
}
return result;
} finally {
close();
}
}
@Override
public LongMultiset toLongMultiset() {
assertNotClosed();
try {
final LongMultiset result = new LongMultiset<>(N.initHashCapacity(toIndex - fromIndex));
for (int i = fromIndex; i < toIndex; i++) {
result.add(elements[i]);
}
return result;
} finally {
close();
}
}
@Override
public LongMultiset toLongMultiset(Supplier> supplier) {
assertNotClosed();
try {
final LongMultiset result = supplier.get();
for (int i = fromIndex; i < toIndex; i++) {
result.add(elements[i]);
}
return result;
} finally {
close();
}
}
@Override
public > M toMap(ShortFunction keyMapper, ShortFunction valueMapper, BinaryOperator mergeFunction,
Supplier mapFactory) {
assertNotClosed();
try {
final M result = mapFactory.get();
for (int i = fromIndex; i < toIndex; i++) {
Collectors.merge(result, keyMapper.apply(elements[i]), valueMapper.apply(elements[i]), mergeFunction);
}
return result;
} finally {
close();
}
}
@Override
public > M toMap(final ShortFunction keyMapper, final Collector downstream,
final Supplier mapFactory) {
assertNotClosed();
try {
final M result = mapFactory.get();
final Supplier downstreamSupplier = downstream.supplier();
final BiConsumer downstreamAccumulator = downstream.accumulator();
final Map intermediate = (Map) result;
K key = null;
A v = null;
for (int i = fromIndex; i < toIndex; i++) {
key = checkArgNotNull(keyMapper.apply(elements[i]), "element cannot be mapped to a null key");
if ((v = intermediate.get(key)) == null) {
if ((v = downstreamSupplier.get()) != null) {
intermediate.put(key, v);
}
}
downstreamAccumulator.accept(v, elements[i]);
}
final BiFunction function = new BiFunction() {
@Override
public A apply(K k, A v) {
return (A) downstream.finisher().apply(v);
}
};
Collectors.replaceAll(intermediate, function);
return result;
} finally {
close();
}
}
@Override
public OptionalShort first() {
assertNotClosed();
try {
return fromIndex < toIndex ? OptionalShort.of(elements[fromIndex]) : OptionalShort.empty();
} finally {
close();
}
}
@Override
public OptionalShort last() {
assertNotClosed();
try {
return fromIndex < toIndex ? OptionalShort.of(elements[toIndex - 1]) : OptionalShort.empty();
} finally {
close();
}
}
@Override
public OptionalShort onlyOne() throws DuplicatedResultException {
assertNotClosed();
try {
final int size = toIndex - fromIndex;
if (size == 0) {
return OptionalShort.empty();
} else if (size == 1) {
return OptionalShort.of(elements[fromIndex]);
} else {
throw new DuplicatedResultException("There are at least two elements: " + Strings.concat(elements[fromIndex], ", ", elements[fromIndex + 1]));
}
} finally {
close();
}
}
@Override
public short reduce(short identity, ShortBinaryOperator op) {
assertNotClosed();
try {
short result = identity;
for (int i = fromIndex; i < toIndex; i++) {
result = op.applyAsShort(result, elements[i]);
}
return result;
} finally {
close();
}
}
@Override
public OptionalShort reduce(ShortBinaryOperator op) {
assertNotClosed();
try {
if (fromIndex == toIndex) {
return OptionalShort.empty();
}
short result = elements[fromIndex];
for (int i = fromIndex + 1; i < toIndex; i++) {
result = op.applyAsShort(result, elements[i]);
}
return OptionalShort.of(result);
} finally {
close();
}
}
@Override
public R collect(Supplier supplier, ObjShortConsumer accumulator, BiConsumer combiner) {
assertNotClosed();
try {
final R result = supplier.get();
for (int i = fromIndex; i < toIndex; i++) {
accumulator.accept(result, elements[i]);
}
return result;
} finally {
close();
}
}
@Override
public OptionalShort min() {
assertNotClosed();
try {
if (fromIndex == toIndex) {
return OptionalShort.empty();
} else if (sorted) {
return OptionalShort.of(elements[fromIndex]);
}
return OptionalShort.of(N.min(elements, fromIndex, toIndex));
} finally {
close();
}
}
@Override
public OptionalShort max() {
assertNotClosed();
try {
if (fromIndex == toIndex) {
return OptionalShort.empty();
} else if (sorted) {
return OptionalShort.of(elements[toIndex - 1]);
}
return OptionalShort.of(N.max(elements, fromIndex, toIndex));
} finally {
close();
}
}
@Override
public OptionalShort kthLargest(int k) {
checkArgPositive(k, "k");
assertNotClosed();
try {
if (k > toIndex - fromIndex) {
return OptionalShort.empty();
} else if (sorted) {
return OptionalShort.of(elements[toIndex - k]);
}
return OptionalShort.of(N.kthLargest(elements, fromIndex, toIndex, k));
} finally {
close();
}
}
@Override
public int sum() {
assertNotClosed();
try {
return sum(elements, fromIndex, toIndex);
} finally {
close();
}
}
@Override
public OptionalDouble average() {
assertNotClosed();
try {
if (fromIndex == toIndex) {
return OptionalDouble.empty();
}
return OptionalDouble.of(sum() / toIndex - fromIndex);
} finally {
close();
}
}
@Override
public long count() {
assertNotClosed();
try {
return toIndex - fromIndex;
} finally {
close();
}
}
@Override
public ShortStream reversed() {
return newStream(new ShortIteratorEx() {
private int cursor = toIndex;
@Override
public boolean hasNext() {
return cursor > fromIndex;
}
@Override
public short nextShort() {
if (cursor <= fromIndex) {
throw new NoSuchElementException();
}
return elements[--cursor];
}
@Override
public long count() {
return cursor - fromIndex;
}
@Override
public void skip(long n) {
cursor = n < cursor - fromIndex ? cursor - (int) n : fromIndex;
}
@Override
public short[] toArray() {
final short[] a = new short[cursor - fromIndex];
for (int i = 0, len = cursor - fromIndex; i < len; i++) {
a[i] = elements[cursor - i - 1];
}
return a;
}
}, false);
}
@Override
public ShortStream rotated(final int distance) {
if (distance == 0 || toIndex - fromIndex <= 1 || distance % (toIndex - fromIndex) == 0) {
return newStream(elements, fromIndex, toIndex, sorted);
}
return newStream(new ShortIteratorEx() {
private final int len = toIndex - fromIndex;
private int start;
private int cnt = 0;
{
start = distance % len;
if (start < 0) {
start += len;
}
start = len - start;
}
@Override
public boolean hasNext() {
return cnt < len;
}
@Override
public short nextShort() {
if (hasNext() == false) {
throw new NoSuchElementException();
}
return elements[((start + cnt++) % len) + fromIndex];
}
@Override
public long count() {
return len - cnt;
}
@Override
public void skip(long n) {
cnt = n < len - cnt ? cnt + (int) n : len;
}
@Override
public short[] toArray() {
final short[] a = new short[len - cnt];
for (int i = cnt; i < len; i++) {
a[i - cnt] = elements[((start + i) % len) + fromIndex];
}
return a;
}
}, false);
}
@Override
public ShortSummaryStatistics summarize() {
assertNotClosed();
try {
final ShortSummaryStatistics result = new ShortSummaryStatistics();
for (int i = fromIndex; i < toIndex; i++) {
result.accept(elements[i]);
}
return result;
} finally {
close();
}
}
@Override
public boolean anyMatch(final Try.ShortPredicate predicate) throws E {
assertNotClosed();
try {
for (int i = fromIndex; i < toIndex; i++) {
if (predicate.test(elements[i])) {
return true;
}
}
return false;
} finally {
close();
}
}
@Override
public boolean allMatch(final Try.ShortPredicate predicate) throws E {
assertNotClosed();
try {
for (int i = fromIndex; i < toIndex; i++) {
if (predicate.test(elements[i]) == false) {
return false;
}
}
return true;
} finally {
close();
}
}
@Override
public boolean noneMatch(final Try.ShortPredicate predicate) throws E {
assertNotClosed();
try {
for (int i = fromIndex; i < toIndex; i++) {
if (predicate.test(elements[i])) {
return false;
}
}
return true;
} finally {
close();
}
}
@Override
public OptionalShort findFirst(final Try.ShortPredicate predicate) throws E {
assertNotClosed();
try {
for (int i = fromIndex; i < toIndex; i++) {
if (predicate.test(elements[i])) {
return OptionalShort.of(elements[i]);
}
}
return OptionalShort.empty();
} finally {
close();
}
}
@Override
public OptionalShort findLast(final Try.ShortPredicate predicate) throws E {
assertNotClosed();
try {
for (int i = toIndex - 1; i >= fromIndex; i--) {
if (predicate.test(elements[i])) {
return OptionalShort.of(elements[i]);
}
}
return OptionalShort.empty();
} finally {
close();
}
}
@Override
public IntStream asIntStream() {
return newStream(new IntIteratorEx() {
private int cursor = fromIndex;
@Override
public boolean hasNext() {
return cursor < toIndex;
}
@Override
public int nextInt() {
if (cursor >= toIndex) {
throw new NoSuchElementException();
}
return elements[cursor++];
}
@Override
public long count() {
return toIndex - cursor;
}
@Override
public void skip(long n) {
cursor = n < toIndex - cursor ? cursor + (int) n : toIndex;
}
@Override
public int[] toArray() {
final int[] a = new int[toIndex - cursor];
for (int i = 0, len = toIndex - cursor; i < len; i++) {
a[i] = elements[cursor++];
}
return a;
}
}, sorted);
}
@Override
public Stream boxed() {
return new IteratorStream<>(iterator(), sorted, sorted ? SHORT_COMPARATOR : null, closeHandlers);
}
// @Override
// public ShortStream cached() {
// return this;
// }
@Override
ShortIteratorEx iteratorEx() {
return ShortIteratorEx.of(elements, fromIndex, toIndex);
}
@Override
public ShortStream appendIfEmpty(final Supplier supplier) {
if (fromIndex == toIndex) {
return append(supplier.get());
} else {
return this;
}
}
@Override
public ShortStream parallel(final int maxThreadNum, final Splitor splitor) {
return new ParallelArrayShortStream(elements, fromIndex, toIndex, sorted, checkMaxThreadNum(maxThreadNum), checkSplitor(splitor), asyncExecutor(),
closeHandlers);
}
@Override
public ShortStream parallel(final int maxThreadNum, final Executor executor) {
return new ParallelArrayShortStream(elements, fromIndex, toIndex, sorted, checkMaxThreadNum(maxThreadNum), splitor(), createAsyncExecutor(executor),
closeHandlers);
}
@Override
public ShortStream onClose(Runnable closeHandler) {
final Deque newCloseHandlers = new LocalArrayDeque<>(N.isNullOrEmpty(this.closeHandlers) ? 1 : this.closeHandlers.size() + 1);
newCloseHandlers.add(wrapCloseHandlers(closeHandler));
if (N.notNullOrEmpty(this.closeHandlers)) {
newCloseHandlers.addAll(this.closeHandlers);
}
return new ArrayShortStream(elements, fromIndex, toIndex, sorted, newCloseHandlers);
}
}