com.landawn.abacus.util.stream.IteratorLongStream 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.Collection;
import java.util.Comparator;
import java.util.Deque;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;
import java.util.NoSuchElementException;
import java.util.PrimitiveIterator;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.Set;
import java.util.Spliterator;
import java.util.Spliterators;
import java.util.concurrent.Executor;
import java.util.stream.StreamSupport;
import com.landawn.abacus.util.DoubleIterator;
import com.landawn.abacus.util.FloatIterator;
import com.landawn.abacus.util.Fn.Suppliers;
import com.landawn.abacus.util.IntIterator;
import com.landawn.abacus.util.LongIterator;
import com.landawn.abacus.util.LongList;
import com.landawn.abacus.util.LongMultiset;
import com.landawn.abacus.util.LongSummaryStatistics;
import com.landawn.abacus.util.Multiset;
import com.landawn.abacus.util.N;
import com.landawn.abacus.util.Primitives;
import com.landawn.abacus.util.Try;
import com.landawn.abacus.util.u.Optional;
import com.landawn.abacus.util.u.OptionalDouble;
import com.landawn.abacus.util.u.OptionalLong;
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.LongBinaryOperator;
import com.landawn.abacus.util.function.LongConsumer;
import com.landawn.abacus.util.function.LongFunction;
import com.landawn.abacus.util.function.LongPredicate;
import com.landawn.abacus.util.function.LongToDoubleFunction;
import com.landawn.abacus.util.function.LongToFloatFunction;
import com.landawn.abacus.util.function.LongToIntFunction;
import com.landawn.abacus.util.function.LongUnaryOperator;
import com.landawn.abacus.util.function.ObjLongConsumer;
import com.landawn.abacus.util.function.Supplier;
/**
*
*/
class IteratorLongStream extends AbstractLongStream {
final LongIteratorEx elements;
// OptionalLong head;
// LongStream tail;
// LongStream head2;
// OptionalLong tail2;
IteratorLongStream(final LongIterator values) {
this(values, null);
}
IteratorLongStream(final LongIterator values, final Collection closeHandlers) {
this(values, false, closeHandlers);
}
IteratorLongStream(final LongIterator values, final boolean sorted, final Collection closeHandlers) {
super(sorted, closeHandlers);
LongIteratorEx tmp = null;
if (values instanceof LongIteratorEx) {
tmp = (LongIteratorEx) values;
} else {
tmp = new LongIteratorEx() {
@Override
public boolean hasNext() {
return values.hasNext();
}
@Override
public long nextLong() {
return values.nextLong();
}
};
}
this.elements = tmp;
}
@Override
public LongStream filter(final LongPredicate predicate) {
return newStream(new LongIteratorEx() {
private boolean hasNext = false;
private long next = 0;
@Override
public boolean hasNext() {
if (hasNext == false) {
while (elements.hasNext()) {
next = elements.nextLong();
if (predicate.test(next)) {
hasNext = true;
break;
}
}
}
return hasNext;
}
@Override
public long nextLong() {
if (hasNext == false && hasNext() == false) {
throw new NoSuchElementException();
}
hasNext = false;
return next;
}
}, sorted);
}
@Override
public LongStream takeWhile(final LongPredicate predicate) {
return newStream(new LongIteratorEx() {
private boolean hasMore = true;
private boolean hasNext = false;
private long next = 0;
@Override
public boolean hasNext() {
if (hasNext == false && hasMore && elements.hasNext()) {
next = elements.nextLong();
if (predicate.test(next)) {
hasNext = true;
} else {
hasMore = false;
}
}
return hasNext;
}
@Override
public long nextLong() {
if (hasNext == false && hasNext() == false) {
throw new NoSuchElementException();
}
hasNext = false;
return next;
}
}, sorted);
}
@Override
public LongStream dropWhile(final LongPredicate predicate) {
return newStream(new LongIteratorEx() {
private boolean hasNext = false;
private long next = 0;
private boolean dropped = false;
@Override
public boolean hasNext() {
if (hasNext == false) {
if (dropped == false) {
dropped = true;
while (elements.hasNext()) {
next = elements.nextLong();
if (predicate.test(next) == false) {
hasNext = true;
break;
}
}
} else if (elements.hasNext()) {
next = elements.nextLong();
hasNext = true;
}
}
return hasNext;
}
@Override
public long nextLong() {
if (hasNext == false && hasNext() == false) {
throw new NoSuchElementException();
}
hasNext = false;
return next;
}
}, sorted);
}
@Override
public LongStream map(final LongUnaryOperator mapper) {
return newStream(new LongIteratorEx() {
@Override
public boolean hasNext() {
return elements.hasNext();
}
@Override
public long nextLong() {
return mapper.applyAsLong(elements.nextLong());
}
// @Override
// public long count() {
// return elements.count();
// }
//
// @Override
// public void skip(long n) {
// checkArgNotNegative(n, "n");
//
// elements.skip(n);
// }
}, false);
}
@Override
public IntStream mapToInt(final LongToIntFunction mapper) {
return newStream(new IntIteratorEx() {
@Override
public boolean hasNext() {
return elements.hasNext();
}
@Override
public int nextInt() {
return mapper.applyAsInt(elements.nextLong());
}
// @Override
// public long count() {
// return elements.count();
// }
//
// @Override
// public void skip(long n) {
// checkArgNotNegative(n, "n");
//
// elements.skip(n);
// }
}, false);
}
@Override
public FloatStream mapToFloat(final LongToFloatFunction mapper) {
return newStream(new FloatIteratorEx() {
@Override
public boolean hasNext() {
return elements.hasNext();
}
@Override
public float nextFloat() {
return mapper.applyAsFloat(elements.nextLong());
}
// @Override
// public long count() {
// return elements.count();
// }
//
// @Override
// public void skip(long n) {
// checkArgNotNegative(n, "n");
//
// elements.skip(n);
// }
}, false);
}
@Override
public DoubleStream mapToDouble(final LongToDoubleFunction mapper) {
return newStream(new DoubleIteratorEx() {
@Override
public boolean hasNext() {
return elements.hasNext();
}
@Override
public double nextDouble() {
return mapper.applyAsDouble(elements.nextLong());
}
// @Override
// public long count() {
// return elements.count();
// }
//
// @Override
// public void skip(long n) {
// checkArgNotNegative(n, "n");
//
// elements.skip(n);
// }
}, false);
}
@Override
public Stream mapToObj(final LongFunction mapper) {
return newStream(new ObjIteratorEx() {
@Override
public boolean hasNext() {
return elements.hasNext();
}
@Override
public U next() {
return mapper.apply(elements.nextLong());
}
// @Override
// public long count() {
// return elements.count();
// }
//
// @Override
// public void skip(long n) {
// checkArgNotNegative(n, "n");
//
// elements.skip(n);
// }
}, false, null);
}
@Override
public LongStream flatMap(final LongFunction mapper) {
final LongIteratorEx iter = new LongIteratorEx() {
private LongIterator cur = null;
private LongStream 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.nextLong());
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 long nextLong() {
if ((cur == null || cur.hasNext() == false) && hasNext() == false) {
throw new NoSuchElementException();
}
return cur.nextLong();
}
@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 IteratorLongStream(iter, newCloseHandlers);
}
@Override
public IntStream flatMapToInt(final LongFunction 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.nextLong());
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 FloatStream flatMapToFloat(final LongFunction mapper) {
final FloatIteratorEx iter = new FloatIteratorEx() {
private FloatIterator cur = null;
private FloatStream 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.nextLong());
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 float nextFloat() {
if ((cur == null || cur.hasNext() == false) && hasNext() == false) {
throw new NoSuchElementException();
}
return cur.nextFloat();
}
@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 IteratorFloatStream(iter, newCloseHandlers);
}
@Override
public DoubleStream flatMapToDouble(final LongFunction mapper) {
final DoubleIteratorEx iter = new DoubleIteratorEx() {
private DoubleIterator cur = null;
private DoubleStream 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.nextLong());
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 double nextDouble() {
if ((cur == null || cur.hasNext() == false) && hasNext() == false) {
throw new NoSuchElementException();
}
return cur.nextDouble();
}
@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 IteratorDoubleStream(iter, newCloseHandlers);
}
@Override
public Stream flatMapToObj(final LongFunction> 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.nextLong());
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 splitToList(final int chunkSize) {
checkArgPositive(chunkSize, "chunkSize");
return newStream(new ObjIteratorEx() {
@Override
public boolean hasNext() {
return elements.hasNext();
}
@Override
public LongList next() {
if (hasNext() == false) {
throw new NoSuchElementException();
}
final LongList result = new LongList(chunkSize);
while (result.size() < chunkSize && elements.hasNext()) {
result.add(elements.nextLong());
}
return result;
}
@Override
public long count() {
final long len = elements.count();
return len % chunkSize == 0 ? len / chunkSize : len / chunkSize + 1;
}
@Override
public void skip(long n) {
elements.skip(n > Long.MAX_VALUE / chunkSize ? Long.MAX_VALUE : n * chunkSize);
}
}, false, null);
}
@Override
public Stream splitToList(final LongPredicate predicate) {
return newStream(new ObjIteratorEx() {
private long next;
private boolean hasNext = false;
private boolean preCondition = false;
@Override
public boolean hasNext() {
return hasNext == true || elements.hasNext();
}
@Override
public LongList next() {
if (hasNext() == false) {
throw new NoSuchElementException();
}
final LongList result = new LongList();
if (hasNext == false) {
next = elements.nextLong();
hasNext = true;
}
while (hasNext) {
if (result.size() == 0) {
result.add(next);
preCondition = predicate.test(next);
next = (hasNext = elements.hasNext()) ? elements.nextLong() : 0;
} else if (predicate.test(next) == preCondition) {
result.add(next);
next = (hasNext = elements.hasNext()) ? elements.nextLong() : 0;
} else {
break;
}
}
return result;
}
}, false, null);
}
@Override
public Stream splitAt(final int where) {
checkArgNotNegative(where, "where");
return newStream(new ObjIteratorEx() {
private int cursor = 0;
@Override
public boolean hasNext() {
return cursor < 2;
}
@Override
public LongStream next() {
if (hasNext() == false) {
throw new NoSuchElementException();
}
LongStream result = null;
if (cursor == 0) {
final LongList list = new LongList();
int cnt = 0;
while (cnt++ < where && elements.hasNext()) {
list.add(elements.nextLong());
}
result = new ArrayLongStream(list.array(), 0, list.size(), sorted, null);
} else {
result = new IteratorLongStream(elements, sorted, null);
}
cursor++;
return result;
}
@Override
public long count() {
elements.count();
return 2 - cursor;
}
@Override
public void skip(long n) {
if (n == 0) {
return;
} else if (n == 1) {
if (cursor == 0) {
elements.skip(where);
} else {
elements.skip(Long.MAX_VALUE);
}
} else {
elements.skip(Long.MAX_VALUE);
}
cursor = n >= 2 ? 2 : cursor + (int) n;
}
}, 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 LongList prev = null;
private boolean toSkip = false;
@Override
public boolean hasNext() {
if (toSkip) {
int skipNum = increment - windowSize;
while (skipNum-- > 0 && elements.hasNext()) {
elements.nextLong();
}
toSkip = false;
}
return elements.hasNext();
}
@Override
public LongList next() {
if (hasNext() == false) {
throw new NoSuchElementException();
}
LongList result = null;
int cnt = 0;
if (prev != null && increment < windowSize) {
cnt = windowSize - increment;
if (cnt <= 8) {
result = new LongList(windowSize);
for (int i = windowSize - cnt; i < windowSize; i++) {
result.add(prev.get(i));
}
} else {
final long[] dest = new long[windowSize];
N.copy(prev.array(), windowSize - cnt, dest, 0, cnt);
result = LongList.of(dest, cnt);
}
}
if (result == null) {
result = new LongList(windowSize);
}
while (cnt++ < windowSize && elements.hasNext()) {
result.add(elements.nextLong());
}
toSkip = increment > windowSize;
return prev = result;
}
@Override
public long count() {
final int prevSize = increment >= windowSize ? 0 : (prev == null ? 0 : prev.size());
final long len = prevSize + elements.count();
if (len == prevSize) {
return 0;
} else if (len <= windowSize) {
return 1;
} else {
final long rlen = len - windowSize;
return 1 + (rlen % increment == 0 ? rlen / increment : rlen / increment + 1);
}
}
@Override
public void skip(long n) {
if (n == 0) {
return;
}
if (increment >= windowSize) {
elements.skip(n > Long.MAX_VALUE / increment ? Long.MAX_VALUE : n * increment);
} else {
final LongList tmp = new LongList(windowSize);
if (N.isNullOrEmpty(prev)) {
final long m = ((n - 1) > Long.MAX_VALUE / increment ? Long.MAX_VALUE : (n - 1) * increment);
elements.skip(m);
} else {
final long m = (n > Long.MAX_VALUE / increment ? Long.MAX_VALUE : n * increment);
final int prevSize = increment >= windowSize ? 0 : (prev == null ? 0 : prev.size());
if (m < prevSize) {
tmp.addAll(prev.copy((int) m, prevSize));
} else {
elements.skip(m - prevSize);
}
}
int cnt = tmp.size();
while (cnt++ < windowSize && elements.hasNext()) {
tmp.add(elements.nextLong());
}
prev = tmp;
}
}
}, false, null);
}
@Override
public LongStream top(int n) {
return top(n, LONG_COMPARATOR);
}
@Override
public LongStream top(final int n, final Comparator comparator) {
checkArgPositive(n, "n");
return newStream(new LongIteratorEx() {
private boolean initialized = false;
private long[] aar;
private int cursor = 0;
private int to;
@Override
public boolean hasNext() {
if (initialized == false) {
init();
}
return cursor < to;
}
@Override
public long nextLong() {
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 long[] toArray() {
if (initialized == false) {
init();
}
final long[] a = new long[to - cursor];
N.copy(aar, cursor, a, 0, to - cursor);
return a;
}
@Override
public LongList toList() {
return LongList.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.nextLong());
}
aar = Primitives.unbox(N.EMPTY_LONG_OBJ_ARRAY);
} else {
final Queue heap = new PriorityQueue<>(n, comparator);
Long next = null;
while (elements.hasNext()) {
next = elements.nextLong();
if (heap.size() >= n) {
if (comparator.compare(next, heap.peek()) > 0) {
heap.poll();
heap.offer(next);
}
} else {
heap.offer(next);
}
}
aar = Primitives.unbox(heap.toArray(N.EMPTY_LONG_OBJ_ARRAY));
}
to = aar.length;
}
}
}, false);
}
@Override
public LongStream peek(final LongConsumer action) {
return newStream(new LongIteratorEx() {
@Override
public boolean hasNext() {
return elements.hasNext();
}
@Override
public long nextLong() {
final long next = elements.nextLong();
action.accept(next);
return next;
}
}, sorted);
}
@Override
public LongStream limit(final long maxSize) {
checkArgNotNegative(maxSize, "maxSize");
return newStream(new LongIteratorEx() {
private long cnt = 0;
@Override
public boolean hasNext() {
return cnt < maxSize && elements.hasNext();
}
@Override
public long nextLong() {
if (cnt >= maxSize) {
throw new NoSuchElementException();
}
cnt++;
return elements.nextLong();
}
@Override
public void skip(long n) {
elements.skip(n);
}
}, sorted);
}
@Override
public LongStream skip(final long n) {
checkArgNotNegative(n, "n");
return newStream(new LongIteratorEx() {
private boolean skipped = false;
@Override
public boolean hasNext() {
if (skipped == false) {
skipped = true;
elements.skip(n);
}
return elements.hasNext();
}
@Override
public long nextLong() {
if (skipped == false) {
skipped = true;
elements.skip(n);
}
return elements.nextLong();
}
@Override
public long count() {
if (skipped == false) {
skipped = true;
elements.skip(n);
}
return elements.count();
}
@Override
public void skip(long n2) {
if (skipped == false) {
skipped = true;
elements.skip(n);
}
elements.skip(n2);
}
@Override
public long[] toArray() {
if (skipped == false) {
skipped = true;
elements.skip(n);
}
return elements.toArray();
}
}, sorted);
}
@Override
public void forEach(final Try.LongConsumer action) throws E {
assertNotClosed();
try {
while (elements.hasNext()) {
action.accept(elements.nextLong());
}
} finally {
close();
}
}
@Override
public long[] toArray() {
assertNotClosed();
try {
return elements.toArray();
} finally {
close();
}
}
@Override
public LongList toLongList() {
assertNotClosed();
try {
return elements.toList();
} finally {
close();
}
}
@Override
public List toList() {
return toCollection(Suppliers. ofList());
}
@Override
public Set toSet() {
return toCollection(Suppliers. ofSet());
}
@Override
public > C toCollection(Supplier supplier) {
assertNotClosed();
try {
final C result = supplier.get();
while (elements.hasNext()) {
result.add(elements.nextLong());
}
return result;
} finally {
close();
}
}
@Override
public Multiset toMultiset() {
return toMultiset(Suppliers. ofMultiset());
}
@Override
public Multiset toMultiset(Supplier> supplier) {
assertNotClosed();
try {
final Multiset result = supplier.get();
while (elements.hasNext()) {
result.add(elements.nextLong());
}
return result;
} finally {
close();
}
}
@Override
public LongMultiset toLongMultiset() {
return toLongMultiset(Suppliers. ofLongMultiset());
}
@Override
public LongMultiset toLongMultiset(Supplier> supplier) {
assertNotClosed();
try {
final LongMultiset result = supplier.get();
while (elements.hasNext()) {
result.add(elements.nextLong());
}
return result;
} finally {
close();
}
}
@Override
public > M toMap(LongFunction keyMapper, LongFunction valueMapper, BinaryOperator mergeFunction,
Supplier mapFactory) {
assertNotClosed();
try {
final M result = mapFactory.get();
long next = 0;
while (elements.hasNext()) {
next = elements.nextLong();
Collectors.merge(result, keyMapper.apply(next), valueMapper.apply(next), mergeFunction);
}
return result;
} finally {
close();
}
}
@Override
public > M toMap(final LongFunction 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;
long next = 0;
while (elements.hasNext()) {
next = elements.nextLong();
key = checkArgNotNull(keyMapper.apply(next), "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, next);
}
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 long reduce(long identity, LongBinaryOperator op) {
assertNotClosed();
try {
long result = identity;
while (elements.hasNext()) {
result = op.applyAsLong(result, elements.nextLong());
}
return result;
} finally {
close();
}
}
@Override
public OptionalLong reduce(LongBinaryOperator op) {
assertNotClosed();
try {
if (elements.hasNext() == false) {
return OptionalLong.empty();
}
long result = elements.nextLong();
while (elements.hasNext()) {
result = op.applyAsLong(result, elements.nextLong());
}
return OptionalLong.of(result);
} finally {
close();
}
}
@Override
public R collect(Supplier supplier, ObjLongConsumer accumulator, BiConsumer combiner) {
assertNotClosed();
try {
final R result = supplier.get();
while (elements.hasNext()) {
accumulator.accept(result, elements.nextLong());
}
return result;
} finally {
close();
}
}
@Override
public OptionalLong min() {
assertNotClosed();
try {
if (elements.hasNext() == false) {
return OptionalLong.empty();
} else if (sorted) {
return OptionalLong.of(elements.nextLong());
}
long candidate = elements.nextLong();
long next = 0;
while (elements.hasNext()) {
next = elements.nextLong();
if (next < candidate) {
candidate = next;
}
}
return OptionalLong.of(candidate);
} finally {
close();
}
}
@Override
public OptionalLong max() {
assertNotClosed();
try {
if (elements.hasNext() == false) {
return OptionalLong.empty();
} else if (sorted) {
long next = 0;
while (elements.hasNext()) {
next = elements.nextLong();
}
return OptionalLong.of(next);
}
long candidate = elements.nextLong();
long next = 0;
while (elements.hasNext()) {
next = elements.nextLong();
if (next > candidate) {
candidate = next;
}
}
return OptionalLong.of(candidate);
} finally {
close();
}
}
@Override
public OptionalLong kthLargest(int k) {
checkArgPositive(k, "k");
assertNotClosed();
try {
if (elements.hasNext() == false) {
return OptionalLong.empty();
}
final Optional optional = boxed().kthLargest(k, LONG_COMPARATOR);
return optional.isPresent() ? OptionalLong.of(optional.get()) : OptionalLong.empty();
} finally {
close();
}
}
@Override
public long sum() {
assertNotClosed();
try {
long result = 0;
while (elements.hasNext()) {
result += elements.nextLong();
}
return result;
} finally {
close();
}
}
@Override
public OptionalDouble average() {
assertNotClosed();
try {
if (elements.hasNext() == false) {
return OptionalDouble.empty();
}
long sum = 0;
long count = 0;
while (elements.hasNext()) {
sum += elements.nextLong();
count++;
}
return OptionalDouble.of(((double) sum) / count);
} finally {
close();
}
}
@Override
public long count() {
assertNotClosed();
try {
return elements.count();
} finally {
close();
}
}
@Override
public LongSummaryStatistics summarize() {
assertNotClosed();
try {
final LongSummaryStatistics result = new LongSummaryStatistics();
while (elements.hasNext()) {
result.accept(elements.nextLong());
}
return result;
} finally {
close();
}
}
@Override
public boolean anyMatch(final Try.LongPredicate predicate) throws E {
assertNotClosed();
try {
while (elements.hasNext()) {
if (predicate.test(elements.nextLong())) {
return true;
}
}
} finally {
close();
}
return false;
}
@Override
public boolean allMatch(final Try.LongPredicate predicate) throws E {
assertNotClosed();
try {
while (elements.hasNext()) {
if (predicate.test(elements.nextLong()) == false) {
return false;
}
}
} finally {
close();
}
return true;
}
@Override
public boolean noneMatch(final Try.LongPredicate predicate) throws E {
assertNotClosed();
try {
while (elements.hasNext()) {
if (predicate.test(elements.nextLong())) {
return false;
}
}
} finally {
close();
}
return true;
}
@Override
public OptionalLong findFirst(final Try.LongPredicate predicate) throws E {
assertNotClosed();
try {
while (elements.hasNext()) {
long e = elements.nextLong();
if (predicate.test(e)) {
return OptionalLong.of(e);
}
}
} finally {
close();
}
return OptionalLong.empty();
}
@Override
public OptionalLong findLast(final Try.LongPredicate predicate) throws E {
assertNotClosed();
try {
if (elements.hasNext() == false) {
return OptionalLong.empty();
}
boolean hasResult = false;
long e = 0;
long result = 0;
while (elements.hasNext()) {
e = elements.nextLong();
if (predicate.test(e)) {
result = e;
hasResult = true;
}
}
return hasResult ? OptionalLong.of(result) : OptionalLong.empty();
} finally {
close();
}
}
@Override
public FloatStream asFloatStream() {
return newStream(new FloatIteratorEx() {
@Override
public boolean hasNext() {
return elements.hasNext();
}
@Override
public float nextFloat() {
return elements.nextLong();
}
@Override
public long count() {
return elements.count();
}
@Override
public void skip(long n) {
elements.skip(n);
}
}, sorted);
}
@Override
public DoubleStream asDoubleStream() {
return newStream(new DoubleIteratorEx() {
@Override
public boolean hasNext() {
return elements.hasNext();
}
@Override
public double nextDouble() {
return elements.nextLong();
}
@Override
public long count() {
return elements.count();
}
@Override
public void skip(long n) {
elements.skip(n);
}
}, sorted);
}
@Override
public java.util.stream.LongStream toJdkStream() {
final PrimitiveIterator.OfLong spliterator = new PrimitiveIterator.OfLong() {
@Override
public boolean hasNext() {
return elements.hasNext();
}
@Override
public long nextLong() {
return elements.nextLong();
}
};
if (N.isNullOrEmpty(closeHandlers)) {
return StreamSupport.longStream(Spliterators.spliteratorUnknownSize(spliterator, Spliterator.ORDERED | Spliterator.IMMUTABLE | Spliterator.NONNULL),
isParallel());
} else {
return StreamSupport.longStream(Spliterators.spliteratorUnknownSize(spliterator, Spliterator.ORDERED | Spliterator.IMMUTABLE | Spliterator.NONNULL),
isParallel()).onClose(() -> close(closeHandlers));
}
}
@Override
public Stream boxed() {
return new IteratorStream<>(iterator(), sorted, sorted ? LONG_COMPARATOR : null, closeHandlers);
}
@Override
LongIteratorEx iteratorEx() {
return elements;
}
@Override
public LongStream appendIfEmpty(final Supplier supplier) {
if (elements.hasNext() == false) {
return append(supplier.get());
} else {
return this;
}
}
@Override
public LongStream parallel(int maxThreadNum, Splitor splitor) {
return new ParallelIteratorLongStream(elements, sorted, checkMaxThreadNum(maxThreadNum), checkSplitor(splitor), asyncExecutor(), closeHandlers);
}
@Override
public LongStream parallel(final int maxThreadNum, final Executor executor) {
return new ParallelIteratorLongStream(elements, sorted, checkMaxThreadNum(maxThreadNum), splitor(), createAsyncExecutor(executor), closeHandlers);
}
@Override
public LongStream 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 IteratorLongStream(elements, sorted, newCloseHandlers);
}
}