com.landawn.abacus.util.stream.ParallelIteratorShortStream Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of abacus-util-all-jdk7 Show documentation
Show all versions of abacus-util-all-jdk7 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.ArrayList;
import java.util.Collection;
import java.util.Comparator;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.NoSuchElementException;
import java.util.Set;
import java.util.concurrent.Callable;
import java.util.concurrent.ExecutionException;
import com.landawn.abacus.util.CompletableFuture;
import com.landawn.abacus.util.Holder;
import com.landawn.abacus.util.IndexedShort;
import com.landawn.abacus.util.LongMultiset;
import com.landawn.abacus.util.Multiset;
import com.landawn.abacus.util.MutableBoolean;
import com.landawn.abacus.util.MutableLong;
import com.landawn.abacus.util.N;
import com.landawn.abacus.util.Nth;
import com.landawn.abacus.util.Nullable;
import com.landawn.abacus.util.OptionalDouble;
import com.landawn.abacus.util.OptionalShort;
import com.landawn.abacus.util.Pair;
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.BiPredicate;
import com.landawn.abacus.util.function.BinaryOperator;
import com.landawn.abacus.util.function.Consumer;
import com.landawn.abacus.util.function.Function;
import com.landawn.abacus.util.function.ObjShortConsumer;
import com.landawn.abacus.util.function.Predicate;
import com.landawn.abacus.util.function.ShortBiFunction;
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.ShortTriFunction;
import com.landawn.abacus.util.function.ShortUnaryOperator;
import com.landawn.abacus.util.function.Supplier;
import com.landawn.abacus.util.function.ToIntFunction;
import com.landawn.abacus.util.function.ToShortFunction;
/**
* This class is a sequential, stateful and immutable stream implementation.
*
* @since 0.8
*
* @author Haiyang Li
*/
final class ParallelIteratorShortStream extends IteratorShortStream {
private final int maxThreadNum;
private final Splitor splitor;
private volatile IteratorShortStream sequential;
private volatile Stream boxed;
ParallelIteratorShortStream(final ShortIterator values, final boolean sorted, final int maxThreadNum, final Splitor splitor,
final Collection closeHandlers) {
super(values, sorted, closeHandlers);
this.maxThreadNum = checkMaxThreadNum(maxThreadNum);
this.splitor = splitor == null ? DEFAULT_SPLITOR : splitor;
}
ParallelIteratorShortStream(final ShortStream stream, final boolean sorted, final int maxThreadNum, final Splitor splitor,
final Set closeHandlers) {
this(stream.iteratorEx(), sorted, maxThreadNum, splitor, mergeCloseHandlers(stream, closeHandlers));
}
ParallelIteratorShortStream(final Stream stream, final boolean sorted, final int maxThreadNum, final Splitor splitor,
final Set closeHandlers) {
this(shortIterator(stream.iteratorEx()), sorted, maxThreadNum, splitor, mergeCloseHandlers(stream, closeHandlers));
}
@Override
public ShortStream filter(final ShortPredicate predicate) {
if (maxThreadNum <= 1) {
return new ParallelIteratorShortStream(sequential().filter(predicate).iteratorEx(), sorted, maxThreadNum, splitor, closeHandlers);
}
final Stream stream = boxed().filter(new Predicate() {
@Override
public boolean test(Short value) {
return predicate.test(value);
}
});
return new ParallelIteratorShortStream(stream, false, maxThreadNum, splitor, closeHandlers);
}
@Override
public ShortStream takeWhile(final ShortPredicate predicate) {
if (maxThreadNum <= 1) {
return new ParallelIteratorShortStream(sequential().takeWhile(predicate).iteratorEx(), sorted, maxThreadNum, splitor, closeHandlers);
}
final Stream stream = boxed().takeWhile(new Predicate() {
@Override
public boolean test(Short value) {
return predicate.test(value);
}
});
return new ParallelIteratorShortStream(stream, false, maxThreadNum, splitor, closeHandlers);
}
@Override
public ShortStream dropWhile(final ShortPredicate predicate) {
if (maxThreadNum <= 1) {
return new ParallelIteratorShortStream(sequential().dropWhile(predicate).iteratorEx(), sorted, maxThreadNum, splitor, closeHandlers);
}
final Stream stream = boxed().dropWhile(new Predicate() {
@Override
public boolean test(Short value) {
return predicate.test(value);
}
});
return new ParallelIteratorShortStream(stream, false, maxThreadNum, splitor, closeHandlers);
}
@Override
public ShortStream map(final ShortUnaryOperator mapper) {
if (maxThreadNum <= 1) {
return new ParallelIteratorShortStream(sequential().map(mapper).iteratorEx(), false, maxThreadNum, splitor, closeHandlers);
}
final ShortStream stream = boxed().mapToShort(new ToShortFunction() {
@Override
public short applyAsShort(Short value) {
return mapper.applyAsShort(value);
}
});
return new ParallelIteratorShortStream(stream, false, maxThreadNum, splitor, closeHandlers);
}
@Override
public IntStream mapToInt(final ShortToIntFunction mapper) {
if (maxThreadNum <= 1) {
return new ParallelIteratorIntStream(sequential().mapToInt(mapper).iteratorEx(), false, maxThreadNum, splitor, closeHandlers);
}
final IntStream stream = boxed().mapToInt(new ToIntFunction() {
@Override
public int applyAsInt(Short value) {
return mapper.applyAsInt(value);
}
});
return new ParallelIteratorIntStream(stream, false, maxThreadNum, splitor, closeHandlers);
}
@Override
public Stream mapToObj(final ShortFunction mapper) {
if (maxThreadNum <= 1) {
return new ParallelIteratorStream<>(sequential().mapToObj(mapper).iterator(), false, null, maxThreadNum, splitor, closeHandlers);
}
return boxed().map(new Function() {
@Override
public U apply(Short value) {
return mapper.apply(value);
}
});
}
@Override
public ShortStream flatMap(final ShortFunction mapper) {
if (maxThreadNum <= 1) {
return new ParallelIteratorShortStream(sequential().flatMap(mapper), false, maxThreadNum, splitor, null);
}
final ShortStream stream = boxed().flatMapToShort(new Function() {
@Override
public ShortStream apply(Short value) {
return mapper.apply(value);
}
});
return new ParallelIteratorShortStream(stream, false, maxThreadNum, splitor, null);
}
@Override
public IntStream flatMapToInt(final ShortFunction mapper) {
if (maxThreadNum <= 1) {
return new ParallelIteratorIntStream(sequential().flatMapToInt(mapper), false, maxThreadNum, splitor, null);
}
final IntStream stream = boxed().flatMapToInt(new Function() {
@Override
public IntStream apply(Short value) {
return mapper.apply(value);
}
});
return new ParallelIteratorIntStream(stream, false, maxThreadNum, splitor, null);
}
@Override
public Stream flatMapToObj(final ShortFunction> mapper) {
if (maxThreadNum <= 1) {
return new ParallelIteratorStream<>(sequential().flatMapToObj(mapper), false, null, maxThreadNum, splitor, null);
}
return boxed().flatMap(new Function>() {
@Override
public Stream apply(Short value) {
return mapper.apply(value);
}
});
}
@Override
public Stream split(final int size) {
return new ParallelIteratorStream<>(sequential().split(size).iterator(), false, null, maxThreadNum, splitor, closeHandlers);
}
@Override
public Stream splitToList(final int size) {
return new ParallelIteratorStream<>(sequential().splitToList(size).iterator(), false, null, maxThreadNum, splitor, closeHandlers);
}
@Override
public Stream split(final U seed, final BiPredicate predicate, final Consumer seedUpdate) {
return new ParallelIteratorStream<>(sequential().split(seed, predicate, seedUpdate).iterator(), false, null, maxThreadNum, splitor, closeHandlers);
}
@Override
public Stream splitToList(final U seed, final BiPredicate predicate, final Consumer seedUpdate) {
return new ParallelIteratorStream<>(sequential().splitToList(seed, predicate, seedUpdate).iterator(), false, null, maxThreadNum, splitor,
closeHandlers);
}
@Override
public Stream splitBy(final ShortPredicate where) {
N.requireNonNull(where);
final List testedElements = new ArrayList<>();
final Nullable first = indexed().findFirst(new Predicate() {
@Override
public boolean test(IndexedShort indexed) {
synchronized (testedElements) {
testedElements.add(indexed);
}
return !where.test(indexed.value());
}
});
N.sort(testedElements, INDEXED_SHORT_COMPARATOR);
final int n = first.isPresent() ? (int) first.get().index() : testedElements.size();
final ShortList list1 = new ShortList(n);
final ShortList list2 = new ShortList(testedElements.size() - n);
for (int i = 0; i < n; i++) {
list1.add(testedElements.get(i).value());
}
for (int i = n, size = testedElements.size(); i < size; i++) {
list2.add(testedElements.get(i).value());
}
final ShortStream[] a = new ShortStream[2];
a[0] = new ArrayShortStream(list1.array(), sorted, null);
a[1] = new IteratorShortStream(elements, sorted, null);
if (N.notNullOrEmpty(list2)) {
if (sorted) {
a[1] = new IteratorShortStream(a[1].prepend(list2.stream()).iteratorEx(), sorted, null);
} else {
a[1] = a[1].prepend(list2.stream());
}
}
return new ParallelArrayStream<>(a, 0, a.length, false, null, maxThreadNum, splitor, closeHandlers);
}
@Override
public Stream sliding(final int windowSize, final int increment) {
return new ParallelIteratorStream<>(sequential().sliding(windowSize, increment).iterator(), false, null, maxThreadNum, splitor, closeHandlers);
}
@Override
public Stream slidingToList(final int windowSize, final int increment) {
return new ParallelIteratorStream<>(sequential().slidingToList(windowSize, increment).iterator(), false, null, maxThreadNum, splitor, closeHandlers);
}
@Override
public ShortStream top(int n) {
return top(n, SHORT_COMPARATOR);
}
@Override
public ShortStream top(int n, Comparator comparator) {
return new ParallelIteratorShortStream(this.sequential().top(n, comparator).iteratorEx(), sorted, maxThreadNum, splitor, closeHandlers);
}
@Override
public ShortStream sorted() {
if (sorted) {
return this;
}
return new ParallelIteratorShortStream(new ShortIteratorEx() {
short[] a = null;
int toIndex = 0;
int cursor = 0;
@Override
public boolean hasNext() {
if (a == null) {
sort();
}
return cursor < toIndex;
}
@Override
public short nextShort() {
if (a == null) {
sort();
}
if (cursor >= toIndex) {
throw new NoSuchElementException();
}
return a[cursor++];
}
@Override
public long count() {
if (a == null) {
sort();
}
return toIndex - cursor;
}
@Override
public void skip(long n) {
if (a == null) {
sort();
}
cursor = n < toIndex - cursor ? cursor + (int) n : toIndex;
}
@Override
public short[] toArray() {
if (a == null) {
sort();
}
if (cursor == 0) {
return a;
} else {
return N.copyOfRange(a, cursor, toIndex);
}
}
private void sort() {
a = elements.toArray();
toIndex = a.length;
N.parallelSort(a);
}
}, true, maxThreadNum, splitor, closeHandlers);
}
@Override
public ShortStream peek(final ShortConsumer action) {
if (maxThreadNum <= 1) {
return new ParallelIteratorShortStream(sequential().peek(action).iteratorEx(), false, maxThreadNum, splitor, closeHandlers);
}
final ShortStream stream = boxed().peek(new Consumer() {
@Override
public void accept(Short t) {
action.accept(t);
}
}).sequential().mapToShort(ToShortFunction.UNBOX);
return new ParallelIteratorShortStream(stream, false, maxThreadNum, splitor, closeHandlers);
}
@Override
public ShortStream limit(final long maxSize) {
N.checkArgument(maxSize >= 0, "'maxSizse' can't be negative: %s", maxSize);
return new ParallelIteratorShortStream(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, maxThreadNum, splitor, closeHandlers);
}
@Override
public ShortStream skip(final long n) {
N.checkArgument(n >= 0, "'n' can't be negative: %s", n);
if (n == 0) {
return this;
}
return new ParallelIteratorShortStream(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, maxThreadNum, splitor, closeHandlers);
}
@Override
public void forEach(final Try.ShortConsumer action) throws E {
if (maxThreadNum <= 1) {
sequential().forEach(action);
return;
}
final List> futureList = new ArrayList<>(maxThreadNum);
final Holder eHolder = new Holder<>();
for (int i = 0; i < maxThreadNum; i++) {
futureList.add(asyncExecutor.execute(new Runnable() {
@Override
public void run() {
short next = 0;
try {
while (eHolder.value() == null) {
synchronized (elements) {
if (elements.hasNext()) {
next = elements.nextShort();
} else {
break;
}
}
action.accept(next);
}
} catch (Throwable e) {
setError(eHolder, e);
}
}
}));
}
complette(futureList, eHolder, (E) null);
}
@Override
public short[] toArray() {
return elements.toArray();
}
@Override
public ShortList toShortList() {
return ShortList.of(toArray());
}
@Override
public List toList() {
final List result = new ArrayList<>();
while (elements.hasNext()) {
result.add(elements.nextShort());
}
return result;
}
@Override
public > R toList(Supplier supplier) {
final R result = supplier.get();
while (elements.hasNext()) {
result.add(elements.nextShort());
}
return result;
}
@Override
public Set toSet() {
final Set result = new HashSet<>();
while (elements.hasNext()) {
result.add(elements.nextShort());
}
return result;
}
@Override
public > R toSet(Supplier supplier) {
final R result = supplier.get();
while (elements.hasNext()) {
result.add(elements.nextShort());
}
return result;
}
@Override
public Multiset toMultiset() {
final Multiset result = new Multiset<>();
while (elements.hasNext()) {
result.add(elements.nextShort());
}
return result;
}
@Override
public Multiset toMultiset(Supplier> supplier) {
final Multiset result = supplier.get();
while (elements.hasNext()) {
result.add(elements.nextShort());
}
return result;
}
@Override
public LongMultiset toLongMultiset() {
final LongMultiset result = new LongMultiset<>();
while (elements.hasNext()) {
result.add(elements.nextShort());
}
return result;
}
@Override
public LongMultiset toLongMultiset(Supplier> supplier) {
final LongMultiset result = supplier.get();
while (elements.hasNext()) {
result.add(elements.nextShort());
}
return result;
}
@Override
public > M toMap(final ShortFunction keyExtractor, final ShortFunction valueMapper,
final BinaryOperator mergeFunction, final Supplier mapFactory) {
if (maxThreadNum <= 1) {
return sequential().toMap(keyExtractor, valueMapper, mergeFunction, mapFactory);
}
final Function keyExtractor2 = new Function() {
@Override
public K apply(Short value) {
return keyExtractor.apply(value);
}
};
final Function valueMapper2 = new Function() {
@Override
public U apply(Short value) {
return valueMapper.apply(value);
}
};
return boxed().toMap(keyExtractor2, valueMapper2, mergeFunction, mapFactory);
}
@Override
public > M toMap(final ShortFunction classifier, final Collector downstream,
final Supplier mapFactory) {
if (maxThreadNum <= 1) {
return sequential().toMap(classifier, downstream, mapFactory);
}
final Function classifier2 = new Function() {
@Override
public K apply(Short value) {
return classifier.apply(value);
}
};
return boxed().toMap(classifier2, downstream, mapFactory);
}
@Override
public short reduce(final short identity, final ShortBinaryOperator op) {
if (maxThreadNum <= 1) {
return sequential().reduce(identity, op);
}
final List> futureList = new ArrayList<>(maxThreadNum);
final Holder eHolder = new Holder<>();
for (int i = 0; i < maxThreadNum; i++) {
futureList.add(asyncExecutor.execute(new Callable() {
@Override
public Short call() {
short result = identity;
short next = 0;
try {
while (eHolder.value() == null) {
synchronized (elements) {
if (elements.hasNext()) {
next = elements.nextShort();
} else {
break;
}
}
result = op.applyAsShort(result, next);
}
} catch (Throwable e) {
setError(eHolder, e);
}
return result;
}
}));
}
if (eHolder.value() != null) {
throw N.toRuntimeException(eHolder.value());
}
Short result = null;
try {
for (CompletableFuture future : futureList) {
if (result == null) {
result = future.get();
} else {
result = op.applyAsShort(result, future.get());
}
}
} catch (InterruptedException | ExecutionException e) {
throw N.toRuntimeException(e);
}
return result == null ? identity : result;
}
@Override
public OptionalShort reduce(final ShortBinaryOperator accumulator) {
if (maxThreadNum <= 1) {
return sequential().reduce(accumulator);
}
final List> futureList = new ArrayList<>(maxThreadNum);
final Holder eHolder = new Holder<>();
for (int i = 0; i < maxThreadNum; i++) {
futureList.add(asyncExecutor.execute(new Callable() {
@Override
public Short call() {
short result = 0;
synchronized (elements) {
if (elements.hasNext()) {
result = elements.nextShort();
} else {
return null;
}
}
short next = 0;
try {
while (eHolder.value() == null) {
synchronized (elements) {
if (elements.hasNext()) {
next = elements.nextShort();
} else {
break;
}
}
result = accumulator.applyAsShort(result, next);
}
} catch (Throwable e) {
setError(eHolder, e);
}
return result;
}
}));
}
if (eHolder.value() != null) {
throw N.toRuntimeException(eHolder.value());
}
Short result = null;
try {
for (CompletableFuture future : futureList) {
final Short tmp = future.get();
if (tmp == null) {
continue;
} else if (result == null) {
result = tmp;
} else {
result = accumulator.applyAsShort(result, tmp);
}
}
} catch (InterruptedException | ExecutionException e) {
throw N.toRuntimeException(e);
}
return result == null ? OptionalShort.empty() : OptionalShort.of(result);
}
@Override
public R collect(final Supplier supplier, final ObjShortConsumer accumulator, final BiConsumer combiner) {
if (maxThreadNum <= 1) {
return sequential().collect(supplier, accumulator, combiner);
}
final List> futureList = new ArrayList<>(maxThreadNum);
final Holder eHolder = new Holder<>();
for (int i = 0; i < maxThreadNum; i++) {
futureList.add(asyncExecutor.execute(new Callable() {
@Override
public R call() {
final R container = supplier.get();
short next = 0;
try {
while (eHolder.value() == null) {
synchronized (elements) {
if (elements.hasNext()) {
next = elements.nextShort();
} else {
break;
}
}
accumulator.accept(container, next);
}
} catch (Throwable e) {
setError(eHolder, e);
}
return container;
}
}));
}
if (eHolder.value() != null) {
throw N.toRuntimeException(eHolder.value());
}
R container = (R) NONE;
try {
for (CompletableFuture future : futureList) {
if (container == NONE) {
container = future.get();
} else {
combiner.accept(container, future.get());
}
}
} catch (InterruptedException | ExecutionException e) {
throw N.toRuntimeException(e);
}
return container == NONE ? supplier.get() : container;
}
@Override
public OptionalShort head() {
if (head == null) {
head = elements.hasNext() ? OptionalShort.of(elements.nextShort()) : OptionalShort.empty();
tail = new ParallelIteratorShortStream(elements, sorted, maxThreadNum, splitor, closeHandlers);
}
return head;
}
@Override
public ShortStream tail() {
if (tail == null) {
head = elements.hasNext() ? OptionalShort.of(elements.nextShort()) : OptionalShort.empty();
tail = new ParallelIteratorShortStream(elements, sorted, maxThreadNum, splitor, closeHandlers);
}
return tail;
}
@Override
public ShortStream headd() {
if (head2 == null) {
final short[] a = elements.toArray();
head2 = new ParallelArrayShortStream(a, 0, a.length == 0 ? 0 : a.length - 1, sorted, maxThreadNum, splitor, closeHandlers);
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 = new ParallelArrayShortStream(a, 0, a.length == 0 ? 0 : a.length - 1, sorted, maxThreadNum, splitor, closeHandlers);
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 (N.compare(next, candidate) < 0) {
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 (N.compare(next, candidate) > 0) {
candidate = next;
}
}
return OptionalShort.of(candidate);
}
@Override
public OptionalShort kthLargest(int k) {
N.checkArgument(k > 0, "'k' must be bigger than 0");
if (elements.hasNext() == false) {
return OptionalShort.empty();
}
final Nullable 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();
}
return sequential().average();
}
@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 {
if (maxThreadNum <= 1) {
return sequential().anyMatch(predicate);
}
final List> futureList = new ArrayList<>(maxThreadNum);
final Holder eHolder = new Holder<>();
final MutableBoolean result = MutableBoolean.of(false);
for (int i = 0; i < maxThreadNum; i++) {
futureList.add(asyncExecutor.execute(new Runnable() {
@Override
public void run() {
short next = 0;
try {
while (result.isFalse() && eHolder.value() == null) {
synchronized (elements) {
if (elements.hasNext()) {
next = elements.nextShort();
} else {
break;
}
}
if (predicate.test(next)) {
result.setTrue();
break;
}
}
} catch (Throwable e) {
setError(eHolder, e);
}
}
}));
}
complette(futureList, eHolder, (E) null);
return result.value();
}
@Override
public boolean allMatch(final Try.ShortPredicate predicate) throws E {
if (maxThreadNum <= 1) {
return sequential().allMatch(predicate);
}
final List> futureList = new ArrayList<>(maxThreadNum);
final Holder eHolder = new Holder<>();
final MutableBoolean result = MutableBoolean.of(true);
for (int i = 0; i < maxThreadNum; i++) {
futureList.add(asyncExecutor.execute(new Runnable() {
@Override
public void run() {
short next = 0;
try {
while (result.isTrue() && eHolder.value() == null) {
synchronized (elements) {
if (elements.hasNext()) {
next = elements.nextShort();
} else {
break;
}
}
if (predicate.test(next) == false) {
result.setFalse();
break;
}
}
} catch (Throwable e) {
setError(eHolder, e);
}
}
}));
}
complette(futureList, eHolder, (E) null);
return result.value();
}
@Override
public boolean noneMatch(final Try.ShortPredicate predicate) throws E {
if (maxThreadNum <= 1) {
return sequential().noneMatch(predicate);
}
final List> futureList = new ArrayList<>(maxThreadNum);
final Holder eHolder = new Holder<>();
final MutableBoolean result = MutableBoolean.of(true);
for (int i = 0; i < maxThreadNum; i++) {
futureList.add(asyncExecutor.execute(new Runnable() {
@Override
public void run() {
short next = 0;
try {
while (result.isTrue() && eHolder.value() == null) {
synchronized (elements) {
if (elements.hasNext()) {
next = elements.nextShort();
} else {
break;
}
}
if (predicate.test(next)) {
result.setFalse();
break;
}
}
} catch (Throwable e) {
setError(eHolder, e);
}
}
}));
}
complette(futureList, eHolder, (E) null);
return result.value();
}
@Override
public OptionalShort findFirst(final Try.ShortPredicate predicate) throws E {
if (maxThreadNum <= 1) {
return sequential().findFirst(predicate);
}
final List> futureList = new ArrayList<>(maxThreadNum);
final Holder eHolder = new Holder<>();
final Holder> resultHolder = new Holder<>();
final MutableLong index = MutableLong.of(0);
for (int i = 0; i < maxThreadNum; i++) {
futureList.add(asyncExecutor.execute(new Runnable() {
@Override
public void run() {
final Pair pair = new Pair<>();
try {
while (resultHolder.value() == null && eHolder.value() == null) {
synchronized (elements) {
if (elements.hasNext()) {
pair.left = index.getAndIncrement();
pair.right = elements.nextShort();
} else {
break;
}
}
if (predicate.test(pair.right)) {
synchronized (resultHolder) {
if (resultHolder.value() == null || pair.left < resultHolder.value().left) {
resultHolder.setValue(pair.copy());
}
}
break;
}
}
} catch (Throwable e) {
setError(eHolder, e);
}
}
}));
}
complette(futureList, eHolder, (E) null);
return resultHolder.value() == null ? OptionalShort.empty() : OptionalShort.of(resultHolder.value().right);
}
@Override
public OptionalShort findLast(final Try.ShortPredicate predicate) throws E {
if (maxThreadNum <= 1) {
return sequential().findLast(predicate);
}
final List> futureList = new ArrayList<>(maxThreadNum);
final Holder eHolder = new Holder<>();
final Holder> resultHolder = new Holder<>();
final MutableLong index = MutableLong.of(0);
for (int i = 0; i < maxThreadNum; i++) {
futureList.add(asyncExecutor.execute(new Runnable() {
@Override
public void run() {
final Pair pair = new Pair<>();
try {
while (eHolder.value() == null) {
synchronized (elements) {
if (elements.hasNext()) {
pair.left = index.getAndIncrement();
pair.right = elements.nextShort();
} else {
break;
}
}
if (predicate.test(pair.right)) {
synchronized (resultHolder) {
if (resultHolder.value() == null || pair.left > resultHolder.value().left) {
resultHolder.setValue(pair.copy());
}
}
}
}
} catch (Throwable e) {
setError(eHolder, e);
}
}
}));
}
complette(futureList, eHolder, (E) null);
return resultHolder.value() == null ? OptionalShort.empty() : OptionalShort.of(resultHolder.value().right);
}
@Override
public OptionalShort findAny(final Try.ShortPredicate predicate) throws E {
if (maxThreadNum <= 1) {
return sequential().findAny(predicate);
}
final List> futureList = new ArrayList<>(maxThreadNum);
final Holder eHolder = new Holder<>();
final Holder © 2015 - 2025 Weber Informatics LLC | Privacy Policy