com.landawn.abacus.util.stream.IteratorShortStream 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 programming library in Java
/*
* Copyright (C) 2016 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.Collection;
import java.util.Comparator;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;
import java.util.NoSuchElementException;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.Set;
import com.landawn.abacus.util.Array;
import com.landawn.abacus.util.Fn;
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.Optional;
import com.landawn.abacus.util.OptionalDouble;
import com.landawn.abacus.util.OptionalShort;
import com.landawn.abacus.util.ShortIterator;
import com.landawn.abacus.util.ShortList;
import com.landawn.abacus.util.ShortSummaryStatistics;
import com.landawn.abacus.util.Try;
import com.landawn.abacus.util.function.BiConsumer;
import com.landawn.abacus.util.function.BiFunction;
import com.landawn.abacus.util.function.BiPredicate;
import com.landawn.abacus.util.function.BinaryOperator;
import com.landawn.abacus.util.function.Consumer;
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;
/**
* This class is a sequential, stateful and immutable stream implementation.
*
* @since 0.8
*
* @author Haiyang Li
*/
class IteratorShortStream extends AbstractShortStream {
final ShortIteratorEx elements;
OptionalShort head;
ShortStream tail;
// ShortStream head2;
// OptionalShort tail2;
IteratorShortStream(final ShortIterator values) {
this(values, null);
}
IteratorShortStream(final ShortIterator values, final Collection closeHandlers) {
this(values, false, closeHandlers);
}
IteratorShortStream(final ShortIterator values, final boolean sorted, final Collection closeHandlers) {
super(sorted, closeHandlers);
ShortIteratorEx tmp = null;
if (values instanceof ShortIteratorEx) {
tmp = (ShortIteratorEx) values;
} else {
tmp = new ShortIteratorEx() {
@Override
public boolean hasNext() {
return values.hasNext();
}
@Override
public short nextShort() {
return values.nextShort();
}
};
}
this.elements = tmp;
}
@Override
public ShortStream filter(final ShortPredicate predicate) {
return newStream(new ShortIteratorEx() {
private boolean hasNext = false;
private short next = 0;
@Override
public boolean hasNext() {
if (hasNext == false) {
while (elements.hasNext()) {
next = elements.nextShort();
if (predicate.test(next)) {
hasNext = true;
break;
}
}
}
return hasNext;
}
@Override
public short nextShort() {
if (hasNext == false && hasNext() == false) {
throw new NoSuchElementException();
}
hasNext = false;
return next;
}
}, sorted);
}
@Override
public ShortStream takeWhile(final ShortPredicate predicate) {
return newStream(new ShortIteratorEx() {
private boolean hasMore = true;
private boolean hasNext = false;
private short next = 0;
@Override
public boolean hasNext() {
if (hasNext == false && hasMore && elements.hasNext()) {
next = elements.nextShort();
if (predicate.test(next)) {
hasNext = true;
} else {
hasMore = false;
}
}
return hasNext;
}
@Override
public short nextShort() {
if (hasNext == false && hasNext() == false) {
throw new NoSuchElementException();
}
hasNext = false;
return next;
}
}, sorted);
}
@Override
public ShortStream dropWhile(final ShortPredicate predicate) {
return newStream(new ShortIteratorEx() {
private boolean hasNext = false;
private short next = 0;
private boolean dropped = false;
@Override
public boolean hasNext() {
if (hasNext == false) {
if (dropped == false) {
while (elements.hasNext()) {
next = elements.nextShort();
if (predicate.test(next) == false) {
hasNext = true;
break;
}
}
dropped = true;
} else if (elements.hasNext()) {
next = elements.nextShort();
hasNext = true;
}
}
return hasNext;
}
@Override
public short nextShort() {
if (hasNext == false && hasNext() == false) {
throw new NoSuchElementException();
}
hasNext = false;
return next;
}
}, sorted);
}
@Override
public ShortStream map(final ShortUnaryOperator mapper) {
return newStream(new ShortIteratorEx() {
@Override
public boolean hasNext() {
return elements.hasNext();
}
@Override
public short nextShort() {
return mapper.applyAsShort(elements.nextShort());
}
// @Override
// public long count() {
// return elements.count();
// }
//
// @Override
// public void skip(long n) {
// elements.skip(n);
// }
}, false);
}
@Override
public IntStream mapToInt(final ShortToIntFunction mapper) {
return newStream(new IntIteratorEx() {
@Override
public boolean hasNext() {
return elements.hasNext();
}
@Override
public int nextInt() {
return mapper.applyAsInt(elements.nextShort());
}
// @Override
// public long count() {
// return elements.count();
// }
//
// @Override
// public void skip(long n) {
// elements.skip(n);
// }
}, false);
}
@Override
public Stream mapToObj(final ShortFunction mapper) {
return newStream(new ObjIteratorEx() {
@Override
public boolean hasNext() {
return elements.hasNext();
}
@Override
public U next() {
return mapper.apply(elements.nextShort());
}
// @Override
// public long count() {
// return elements.count();
// }
//
// @Override
// public void skip(long n) {
// elements.skip(n);
// }
}, false, null);
}
@Override
public ShortStream flatMap(final ShortFunction mapper) {
final ShortIteratorEx iter = new ShortIteratorEx() {
private ShortIterator cur = null;
private ShortStream s = null;
private Runnable closeHandle = null;
@Override
public boolean hasNext() {
while ((cur == null || cur.hasNext() == false) && elements.hasNext()) {
if (closeHandle != null) {
final Runnable tmp = closeHandle;
closeHandle = null;
tmp.run();
}
s = mapper.apply(elements.nextShort());
if (N.notNullOrEmpty(s.closeHandlers)) {
final Set 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 Set newCloseHandlers = N.isNullOrEmpty(closeHandlers) ? new LocalLinkedHashSet(1)
: new LocalLinkedHashSet(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 IntIterator cur = null;
private IntStream s = null;
private Runnable closeHandle = null;
@Override
public boolean hasNext() {
while ((cur == null || cur.hasNext() == false) && elements.hasNext()) {
if (closeHandle != null) {
final Runnable tmp = closeHandle;
closeHandle = null;
tmp.run();
}
s = mapper.apply(elements.nextShort());
if (N.notNullOrEmpty(s.closeHandlers)) {
final Set 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 Set newCloseHandlers = N.isNullOrEmpty(closeHandlers) ? new LocalLinkedHashSet(1)
: new LocalLinkedHashSet(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 Iterator cur = null;
private Stream s = null;
private Runnable closeHandle = null;
@Override
public boolean hasNext() {
while ((cur == null || cur.hasNext() == false) && elements.hasNext()) {
if (closeHandle != null) {
final Runnable tmp = closeHandle;
closeHandle = null;
tmp.run();
}
s = mapper.apply(elements.nextShort());
if (N.notNullOrEmpty(s.closeHandlers)) {
final Set 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 Set newCloseHandlers = N.isNullOrEmpty(closeHandlers) ? new LocalLinkedHashSet(1)
: new LocalLinkedHashSet(closeHandlers);
newCloseHandlers.add(new Runnable() {
@Override
public void run() {
iter.close();
}
});
return new IteratorStream<>(iter, newCloseHandlers);
}
@Override
public Stream splitToList(final int size) {
N.checkArgPositive(size, "size");
return newStream(new ObjIteratorEx() {
@Override
public boolean hasNext() {
return elements.hasNext();
}
@Override
public ShortList next() {
if (hasNext() == false) {
throw new NoSuchElementException();
}
final ShortList result = new ShortList(size);
while (result.size() < size && elements.hasNext()) {
result.add(elements.nextShort());
}
return result;
}
@Override
public long count() {
final long len = elements.count();
return len % size == 0 ? len / size : len / size + 1;
}
@Override
public void skip(long n) {
elements.skip(n >= Long.MAX_VALUE / size ? Long.MAX_VALUE : n * size);
}
}, false, null);
}
@Override
public Stream splitToList(final ShortPredicate predicate) {
return newStream(new ObjIteratorEx() {
private short next;
private boolean hasNext = false;
private boolean preCondition = false;
@Override
public boolean hasNext() {
return hasNext == true || elements.hasNext();
}
@Override
public ShortList next() {
if (hasNext() == false) {
throw new NoSuchElementException();
}
final ShortList result = new ShortList();
if (hasNext == false) {
next = elements.nextShort();
hasNext = true;
}
while (hasNext) {
if (result.size() == 0) {
result.add(next);
preCondition = predicate.test(next);
next = (hasNext = elements.hasNext()) ? elements.nextShort() : 0;
} else if (predicate.test(next) == preCondition) {
result.add(next);
next = (hasNext = elements.hasNext()) ? elements.nextShort() : 0;
} else {
break;
}
}
return result;
}
}, false, null);
}
@Override
public Stream splitToList(final U seed, final BiPredicate predicate, final Consumer seedUpdate) {
return newStream(new ObjIteratorEx() {
private short next;
private boolean hasNext = false;
private boolean preCondition = false;
@Override
public boolean hasNext() {
return hasNext == true || elements.hasNext();
}
@Override
public ShortList next() {
if (hasNext() == false) {
throw new NoSuchElementException();
}
final ShortList result = new ShortList();
if (hasNext == false) {
next = elements.nextShort();
hasNext = true;
}
while (hasNext) {
if (result.size() == 0) {
result.add(next);
preCondition = predicate.test(next, seed);
next = (hasNext = elements.hasNext()) ? elements.nextShort() : 0;
} else if (predicate.test(next, seed) == preCondition) {
result.add(next);
next = (hasNext = elements.hasNext()) ? elements.nextShort() : 0;
} else {
if (seedUpdate != null) {
seedUpdate.accept(seed);
}
break;
}
}
return result;
}
}, false, null);
}
@Override
public Stream slidingToList(final int windowSize, final int increment) {
N.checkArgument(windowSize > 0 && increment > 0, "'windowSize'=%s and 'increment'=%s must not be less than 1", windowSize, increment);
return newStream(new ObjIteratorEx() {
private ShortList prev = null;
@Override
public boolean hasNext() {
if (prev != null && increment > windowSize) {
int skipNum = increment - windowSize;
while (skipNum-- > 0 && elements.hasNext()) {
elements.nextShort();
}
prev = null;
}
return elements.hasNext();
}
@Override
public ShortList next() {
if (hasNext() == false) {
throw new NoSuchElementException();
}
ShortList result = null;
int cnt = 0;
if (prev != null && increment < windowSize) {
cnt = windowSize - increment;
if (cnt <= 8) {
result = new ShortList(windowSize);
for (int i = windowSize - cnt; i < windowSize; i++) {
result.add(prev.get(i));
}
} else {
final short[] dest = new short[windowSize];
N.copy(prev.trimToSize().array(), windowSize - cnt, dest, 0, cnt);
result = ShortList.of(dest, cnt);
}
} else {
result = new ShortList(windowSize);
}
while (cnt++ < windowSize && elements.hasNext()) {
result.add(elements.nextShort());
}
return prev = result;
}
}, false, null);
}
@Override
public ShortStream top(int n) {
return top(n, SHORT_COMPARATOR);
}
@Override
public ShortStream top(final int n, final Comparator comparator) {
N.checkArgument(n > 0, "'n' must be bigger than 0");
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;
if (sorted && isSameComparator(comparator, cmp)) {
final LinkedList queue = new LinkedList<>();
while (elements.hasNext()) {
if (queue.size() >= n) {
queue.poll();
}
queue.offer(elements.nextShort());
}
aar = Array.unbox(N.EMPTY_SHORT_OBJ_ARRAY);
} else {
final Queue heap = new PriorityQueue<>(n, comparator);
Short next = null;
while (elements.hasNext()) {
next = elements.nextShort();
if (heap.size() >= n) {
if (comparator.compare(next, heap.peek()) > 0) {
heap.poll();
heap.offer(next);
}
} else {
heap.offer(next);
}
}
aar = Array.unbox(heap.toArray(N.EMPTY_SHORT_OBJ_ARRAY));
}
to = aar.length;
}
}
}, false);
}
@Override
public ShortStream peek(final ShortConsumer action) {
return newStream(new ShortIteratorEx() {
@Override
public boolean hasNext() {
return elements.hasNext();
}
@Override
public short nextShort() {
final short next = elements.nextShort();
action.accept(next);
return next;
}
}, sorted);
}
@Override
public ShortStream limit(final long maxSize) {
N.checkArgNotNegative(maxSize, "maxSize");
return newStream(new ShortIteratorEx() {
private long cnt = 0;
@Override
public boolean hasNext() {
return cnt < maxSize && elements.hasNext();
}
@Override
public short nextShort() {
if (cnt >= maxSize) {
throw new NoSuchElementException();
}
cnt++;
return elements.nextShort();
}
@Override
public void skip(long n) {
elements.skip(n);
}
}, sorted);
}
@Override
public ShortStream skip(final long n) {
N.checkArgNotNegative(n, "n");
if (n == 0) {
return this;
}
return newStream(new ShortIteratorEx() {
private boolean skipped = false;
@Override
public boolean hasNext() {
if (skipped == false) {
elements.skip(n);
skipped = true;
}
return elements.hasNext();
}
@Override
public short nextShort() {
if (skipped == false) {
elements.skip(n);
skipped = true;
}
return elements.nextShort();
}
@Override
public long count() {
if (skipped == false) {
elements.skip(n);
skipped = true;
}
return elements.count();
}
@Override
public void skip(long n2) {
if (skipped == false) {
elements.skip(n);
skipped = true;
}
elements.skip(n2);
}
@Override
public short[] toArray() {
if (skipped == false) {
elements.skip(n);
skipped = true;
}
return elements.toArray();
}
}, sorted);
}
@Override
public void forEach(final Try.ShortConsumer action) throws E {
while (elements.hasNext()) {
action.accept(elements.nextShort());
}
}
@Override
public short[] toArray() {
return elements.toArray();
}
@Override
public ShortList toShortList() {
return elements.toList();
}
@Override
public List toList() {
return toCollection(Fn.Suppliers. ofList());
}
@Override
public Set toSet() {
return toCollection(Fn.Suppliers. ofSet());
}
@Override
public > C toCollection(Supplier supplier) {
final C result = supplier.get();
while (elements.hasNext()) {
result.add(elements.nextShort());
}
return result;
}
@Override
public Multiset toMultiset() {
return toMultiset(Fn.Suppliers. ofMultiset());
}
@Override
public Multiset toMultiset(Supplier> supplier) {
final Multiset result = supplier.get();
while (elements.hasNext()) {
result.add(elements.nextShort());
}
return result;
}
@Override
public LongMultiset toLongMultiset() {
return toLongMultiset(Fn.Suppliers. ofLongMultiset());
}
@Override
public LongMultiset toLongMultiset(Supplier> supplier) {
final LongMultiset result = supplier.get();
while (elements.hasNext()) {
result.add(elements.nextShort());
}
return result;
}
@Override
public > M toMap(ShortFunction keyExtractor, ShortFunction valueMapper, BinaryOperator mergeFunction,
Supplier mapFactory) {
final M result = mapFactory.get();
short element = 0;
while (elements.hasNext()) {
element = elements.nextShort();
Collectors.merge(result, keyExtractor.apply(element), valueMapper.apply(element), mergeFunction);
}
return result;
}
@Override
public > M toMap(final ShortFunction classifier, final Collector downstream,
final Supplier mapFactory) {
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;
short element = 0;
while (elements.hasNext()) {
element = elements.nextShort();
key = N.checkArgNotNull(classifier.apply(element), "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, element);
}
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;
}
@Override
public short reduce(short identity, ShortBinaryOperator op) {
short result = identity;
while (elements.hasNext()) {
result = op.applyAsShort(result, elements.nextShort());
}
return result;
}
@Override
public OptionalShort reduce(ShortBinaryOperator op) {
if (elements.hasNext() == false) {
return OptionalShort.empty();
}
short result = elements.nextShort();
while (elements.hasNext()) {
result = op.applyAsShort(result, elements.nextShort());
}
return OptionalShort.of(result);
}
@Override
public R collect(Supplier supplier, ObjShortConsumer accumulator, BiConsumer combiner) {
final R result = supplier.get();
while (elements.hasNext()) {
accumulator.accept(result, elements.nextShort());
}
return result;
}
@Override
public OptionalShort head() {
if (head == null) {
head = elements.hasNext() ? OptionalShort.of(elements.nextShort()) : OptionalShort.empty();
tail = newStream(elements, sorted);
}
return head;
}
@Override
public ShortStream tail() {
if (tail == null) {
head = elements.hasNext() ? OptionalShort.of(elements.nextShort()) : OptionalShort.empty();
tail = newStream(elements, sorted);
}
return tail;
}
// @Override
// public ShortStream headd() {
// if (head2 == null) {
// final short[] a = elements.toArray();
// head2 = newStream(a, 0, a.length == 0 ? 0 : a.length - 1, sorted);
// tail2 = a.length == 0 ? OptionalShort.empty() : OptionalShort.of(a[a.length - 1]);
// }
//
// return head2;
// }
//
// @Override
// public OptionalShort taill() {
// if (tail2 == null) {
// final short[] a = elements.toArray();
// head2 = newStream(a, 0, a.length == 0 ? 0 : a.length - 1, sorted);
// tail2 = a.length == 0 ? OptionalShort.empty() : OptionalShort.of(a[a.length - 1]);
// }
//
// return tail2;
// }
@Override
public OptionalShort min() {
if (elements.hasNext() == false) {
return OptionalShort.empty();
} else if (sorted) {
return OptionalShort.of(elements.nextShort());
}
short candidate = elements.nextShort();
short next = 0;
while (elements.hasNext()) {
next = elements.nextShort();
if (next < candidate) {
candidate = next;
}
}
return OptionalShort.of(candidate);
}
@Override
public OptionalShort max() {
if (elements.hasNext() == false) {
return OptionalShort.empty();
} else if (sorted) {
short next = 0;
while (elements.hasNext()) {
next = elements.nextShort();
}
return OptionalShort.of(next);
}
short candidate = elements.nextShort();
short next = 0;
while (elements.hasNext()) {
next = elements.nextShort();
if (next > candidate) {
candidate = next;
}
}
return OptionalShort.of(candidate);
}
@Override
public OptionalShort kthLargest(int k) {
N.checkArgPositive(k, "k");
if (elements.hasNext() == false) {
return OptionalShort.empty();
}
final Optional optional = boxed().kthLargest(k, SHORT_COMPARATOR);
return optional.isPresent() ? OptionalShort.of(optional.get()) : OptionalShort.empty();
}
@Override
public long sum() {
long result = 0;
while (elements.hasNext()) {
result += elements.nextShort();
}
return result;
}
@Override
public OptionalDouble average() {
if (elements.hasNext() == false) {
return OptionalDouble.empty();
}
long sum = 0;
long count = 0;
while (elements.hasNext()) {
sum += elements.nextShort();
count++;
}
return OptionalDouble.of(((double) sum) / count);
}
@Override
public long count() {
return elements.count();
}
@Override
public ShortSummaryStatistics summarize() {
final ShortSummaryStatistics result = new ShortSummaryStatistics();
while (elements.hasNext()) {
result.accept(elements.nextShort());
}
return result;
}
@Override
public boolean anyMatch(final Try.ShortPredicate predicate) throws E {
while (elements.hasNext()) {
if (predicate.test(elements.nextShort())) {
return true;
}
}
return false;
}
@Override
public boolean allMatch(final Try.ShortPredicate predicate) throws E {
while (elements.hasNext()) {
if (predicate.test(elements.nextShort()) == false) {
return false;
}
}
return true;
}
@Override
public boolean noneMatch(final Try.ShortPredicate predicate) throws E {
while (elements.hasNext()) {
if (predicate.test(elements.nextShort())) {
return false;
}
}
return true;
}
@Override
public OptionalShort findFirst(final Try.ShortPredicate predicate) throws E {
while (elements.hasNext()) {
short e = elements.nextShort();
if (predicate.test(e)) {
return OptionalShort.of(e);
}
}
return OptionalShort.empty();
}
@Override
public OptionalShort findLast(final Try.ShortPredicate predicate) throws E {
if (elements.hasNext() == false) {
return OptionalShort.empty();
}
boolean hasResult = false;
short e = 0;
short result = 0;
while (elements.hasNext()) {
e = elements.nextShort();
if (predicate.test(e)) {
result = e;
hasResult = true;
}
}
return hasResult ? OptionalShort.of(result) : OptionalShort.empty();
}
@Override
public IntStream asIntStream() {
return newStream(new IntIteratorEx() {
@Override
public boolean hasNext() {
return elements.hasNext();
}
@Override
public int nextInt() {
return elements.nextShort();
}
@Override
public long count() {
return elements.count();
}
@Override
public void skip(long n) {
elements.skip(n);
}
}, sorted);
}
@Override
public Stream boxed() {
return new IteratorStream<>(iterator(), sorted, sorted ? SHORT_COMPARATOR : null, closeHandlers);
}
@Override
ShortIteratorEx iteratorEx() {
return elements;
}
@Override
public ShortStream parallel(int maxThreadNum, Splitor splitor) {
return new ParallelIteratorShortStream(elements, sorted, maxThreadNum, splitor, closeHandlers);
}
@Override
public ShortStream onClose(Runnable closeHandler) {
final Set newCloseHandlers = new AbstractStream.LocalLinkedHashSet<>(N.isNullOrEmpty(this.closeHandlers) ? 1 : this.closeHandlers.size() + 1);
if (N.notNullOrEmpty(this.closeHandlers)) {
newCloseHandlers.addAll(this.closeHandlers);
}
newCloseHandlers.add(closeHandler);
return new IteratorShortStream(elements, sorted, newCloseHandlers);
}
}
© 2015 - 2025 Weber Informatics LLC | Privacy Policy