com.landawn.abacus.util.stream.ParallelArrayCharStream 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.Deque;
import java.util.List;
import java.util.Map;
import java.util.concurrent.Callable;
import java.util.concurrent.ExecutionException;
import com.landawn.abacus.util.AsyncExecutor;
import com.landawn.abacus.util.CharSummaryStatistics;
import com.landawn.abacus.util.ContinuableFuture;
import com.landawn.abacus.util.MutableBoolean;
import com.landawn.abacus.util.MutableInt;
import com.landawn.abacus.util.N;
import com.landawn.abacus.util.Nth;
import com.landawn.abacus.util.Pair;
import com.landawn.abacus.util.Try;
import com.landawn.abacus.util.u.Holder;
import com.landawn.abacus.util.u.OptionalChar;
import com.landawn.abacus.util.function.BiConsumer;
import com.landawn.abacus.util.function.BinaryOperator;
import com.landawn.abacus.util.function.CharBiFunction;
import com.landawn.abacus.util.function.CharBinaryOperator;
import com.landawn.abacus.util.function.CharConsumer;
import com.landawn.abacus.util.function.CharFunction;
import com.landawn.abacus.util.function.CharPredicate;
import com.landawn.abacus.util.function.CharTernaryOperator;
import com.landawn.abacus.util.function.CharToIntFunction;
import com.landawn.abacus.util.function.CharUnaryOperator;
import com.landawn.abacus.util.function.Consumer;
import com.landawn.abacus.util.function.Function;
import com.landawn.abacus.util.function.ObjCharConsumer;
import com.landawn.abacus.util.function.Predicate;
import com.landawn.abacus.util.function.Supplier;
import com.landawn.abacus.util.function.ToCharFunction;
import com.landawn.abacus.util.function.ToIntFunction;
/**
*
*/
final class ParallelArrayCharStream extends ArrayCharStream {
private final int maxThreadNum;
private final Splitor splitor;
private final AsyncExecutor asyncExecutor;
private volatile ArrayCharStream sequential;
private volatile Stream boxed;
ParallelArrayCharStream(final char[] values, final int fromIndex, final int toIndex, final boolean sorted, final int maxThreadNum, final Splitor splitor,
final AsyncExecutor asyncExector, final Collection closeHandlers) {
super(values, sorted, closeHandlers);
this.maxThreadNum = checkMaxThreadNum(maxThreadNum);
this.splitor = splitor == null ? DEFAULT_SPLITOR : splitor;
this.asyncExecutor = asyncExector == null ? DEFAULT_ASYNC_EXECUTOR : asyncExector;
}
@Override
public CharStream filter(final CharPredicate predicate) {
assertNotClosed();
if (maxThreadNum <= 1 || toIndex - fromIndex <= 1) {
return super.filter(predicate);
}
final Stream stream = boxed().filter(new Predicate() {
@Override
public boolean test(Character value) {
return predicate.test(value);
}
});
return new ParallelIteratorCharStream(stream, false, maxThreadNum, splitor, asyncExecutor, closeHandlers);
}
@Override
public CharStream takeWhile(final CharPredicate predicate) {
assertNotClosed();
if (maxThreadNum <= 1 || toIndex - fromIndex <= 1) {
return super.takeWhile(predicate);
}
final Stream stream = boxed().takeWhile(new Predicate() {
@Override
public boolean test(Character value) {
return predicate.test(value);
}
});
return new ParallelIteratorCharStream(stream, false, maxThreadNum, splitor, asyncExecutor, closeHandlers);
}
@Override
public CharStream dropWhile(final CharPredicate predicate) {
assertNotClosed();
if (maxThreadNum <= 1 || toIndex - fromIndex <= 1) {
return super.dropWhile(predicate);
}
final Stream stream = boxed().dropWhile(new Predicate() {
@Override
public boolean test(Character value) {
return predicate.test(value);
}
});
return new ParallelIteratorCharStream(stream, false, maxThreadNum, splitor, asyncExecutor, closeHandlers);
}
@Override
public CharStream map(final CharUnaryOperator mapper) {
assertNotClosed();
if (maxThreadNum <= 1 || toIndex - fromIndex <= 1) {
return super.map(mapper);
}
final CharStream stream = boxed().mapToChar(new ToCharFunction() {
@Override
public char applyAsChar(Character value) {
return mapper.applyAsChar(value);
}
});
return new ParallelIteratorCharStream(stream, false, maxThreadNum, splitor, asyncExecutor, closeHandlers);
}
@Override
public IntStream mapToInt(final CharToIntFunction mapper) {
assertNotClosed();
if (maxThreadNum <= 1 || toIndex - fromIndex <= 1) {
return super.mapToInt(mapper);
}
final IntStream stream = boxed().mapToInt(new ToIntFunction() {
@Override
public int applyAsInt(Character value) {
return mapper.applyAsInt(value);
}
});
return new ParallelIteratorIntStream(stream, false, maxThreadNum, splitor, asyncExecutor, closeHandlers);
}
@Override
public Stream mapToObj(final CharFunction mapper) {
assertNotClosed();
if (maxThreadNum <= 1 || toIndex - fromIndex <= 1) {
return super.mapToObj(mapper);
}
return boxed().map(new Function() {
@Override
public U apply(Character value) {
return mapper.apply(value);
}
});
}
@Override
public CharStream flatMap(final CharFunction mapper) {
assertNotClosed();
if (maxThreadNum <= 1 || toIndex - fromIndex <= 1) {
return new ParallelIteratorCharStream(sequential().flatMap(mapper), false, maxThreadNum, splitor, asyncExecutor, null);
}
final CharStream stream = boxed().flatMapToChar(new Function() {
@Override
public CharStream apply(Character value) {
return mapper.apply(value);
}
});
return new ParallelIteratorCharStream(stream, false, maxThreadNum, splitor, asyncExecutor, null);
}
@Override
public IntStream flatMapToInt(final CharFunction mapper) {
assertNotClosed();
if (maxThreadNum <= 1 || toIndex - fromIndex <= 1) {
return new ParallelIteratorIntStream(sequential().flatMapToInt(mapper), false, maxThreadNum, splitor, asyncExecutor, null);
}
final IntStream stream = boxed().flatMapToInt(new Function() {
@Override
public IntStream apply(Character value) {
return mapper.apply(value);
}
});
return new ParallelIteratorIntStream(stream, false, maxThreadNum, splitor, asyncExecutor, null);
}
@Override
public Stream flatMapToObj(final CharFunction> mapper) {
assertNotClosed();
if (maxThreadNum <= 1 || toIndex - fromIndex <= 1) {
return new ParallelIteratorStream<>(sequential().flatMapToObj(mapper), false, null, maxThreadNum, splitor, asyncExecutor, null);
}
return boxed().flatMap(new Function>() {
@Override
public Stream apply(Character value) {
return mapper.apply(value);
}
});
}
@Override
public CharStream peek(final CharConsumer action) {
assertNotClosed();
if (maxThreadNum <= 1 || toIndex - fromIndex <= 1) {
return super.peek(action);
}
final CharStream stream = boxed().peek(new Consumer() {
@Override
public void accept(Character t) {
action.accept(t);
}
}).sequential().mapToChar(ToCharFunction.UNBOX);
return new ParallelIteratorCharStream(stream, false, maxThreadNum, splitor, asyncExecutor, closeHandlers);
}
@Override
public void forEach(final Try.CharConsumer action) throws E {
assertNotClosed();
if (maxThreadNum <= 1 || toIndex - fromIndex <= 1) {
super.forEach(action);
return;
}
final int threadNum = N.min(maxThreadNum, (toIndex - fromIndex));
final List> futureList = new ArrayList<>(threadNum);
final Holder eHolder = new Holder<>();
if (splitor == Splitor.ARRAY) {
final int sliceSize = (toIndex - fromIndex) / threadNum + ((toIndex - fromIndex) % threadNum == 0 ? 0 : 1);
for (int i = 0; i < threadNum; i++) {
final int sliceIndex = i;
futureList.add(asyncExecutor.execute(new Try.Runnable() {
@Override
public void run() {
int cursor = fromIndex + sliceIndex * sliceSize;
final int to = toIndex - cursor > sliceSize ? cursor + sliceSize : toIndex;
try {
while (cursor < to && eHolder.value() == null) {
action.accept(elements[cursor++]);
}
} catch (Exception e) {
setError(eHolder, e);
}
}
}));
}
} else {
final MutableInt cursor = MutableInt.of(fromIndex);
for (int i = 0; i < threadNum; i++) {
futureList.add(asyncExecutor.execute(new Try.Runnable() {
@Override
public void run() {
char next = 0;
try {
while (eHolder.value() == null) {
synchronized (elements) {
if (cursor.intValue() < toIndex) {
next = elements[cursor.getAndIncrement()];
} else {
break;
}
}
action.accept(next);
}
} catch (Exception e) {
setError(eHolder, e);
}
}
}));
}
}
try {
complette(futureList, eHolder, (E) null);
} finally {
close();
}
}
@Override
public > M toMap(final CharFunction keyMapper, final CharFunction valueMapper,
final BinaryOperator mergeFunction, final Supplier mapFactory) {
assertNotClosed();
if (maxThreadNum <= 1 || toIndex - fromIndex <= 1) {
return super.toMap(keyMapper, valueMapper, mergeFunction, mapFactory);
}
final Function keyMapper2 = new Function() {
@Override
public K apply(Character value) {
return keyMapper.apply(value);
}
};
final Function valueMapper2 = new Function() {
@Override
public V apply(Character value) {
return valueMapper.apply(value);
}
};
return boxed().toMap(keyMapper2, valueMapper2, mergeFunction, mapFactory);
}
@Override
public > M toMap(final CharFunction keyMapper, final Collector downstream,
final Supplier mapFactory) {
assertNotClosed();
if (maxThreadNum <= 1 || toIndex - fromIndex <= 1) {
return super.toMap(keyMapper, downstream, mapFactory);
}
final Function keyMapper2 = new Function() {
@Override
public K apply(Character value) {
return keyMapper.apply(value);
}
};
return boxed().toMap(keyMapper2, downstream, mapFactory);
}
@Override
public char reduce(final char identity, final CharBinaryOperator op) {
assertNotClosed();
if (maxThreadNum <= 1 || toIndex - fromIndex <= 1) {
return super.reduce(identity, op);
}
final int threadNum = N.min(maxThreadNum, (toIndex - fromIndex));
final List> futureList = new ArrayList<>(threadNum);
final Holder eHolder = new Holder<>();
if (splitor == Splitor.ARRAY) {
final int sliceSize = (toIndex - fromIndex) / threadNum + ((toIndex - fromIndex) % threadNum == 0 ? 0 : 1);
for (int i = 0; i < threadNum; i++) {
final int sliceIndex = i;
futureList.add(asyncExecutor.execute(new Callable() {
@Override
public Character call() {
int cursor = fromIndex + sliceIndex * sliceSize;
final int to = toIndex - cursor > sliceSize ? cursor + sliceSize : toIndex;
char result = identity;
try {
while (cursor < to && eHolder.value() == null) {
result = op.applyAsChar(result, elements[cursor++]);
}
} catch (Exception e) {
setError(eHolder, e);
}
return result;
}
}));
}
} else {
final MutableInt cursor = MutableInt.of(fromIndex);
for (int i = 0; i < threadNum; i++) {
futureList.add(asyncExecutor.execute(new Callable() {
@Override
public Character call() {
char result = identity;
char next = 0;
try {
while (eHolder.value() == null) {
synchronized (elements) {
if (cursor.intValue() < toIndex) {
next = elements[cursor.getAndIncrement()];
} else {
break;
}
}
result = op.applyAsChar(result, next);
}
} catch (Exception e) {
setError(eHolder, e);
}
return result;
}
}));
}
}
if (eHolder.value() != null) {
close();
throw N.toRuntimeException(eHolder.value());
}
Character result = null;
try {
for (ContinuableFuture future : futureList) {
if (result == null) {
result = future.get();
} else {
result = op.applyAsChar(result, future.get());
}
}
} catch (InterruptedException | ExecutionException e) {
throw N.toRuntimeException(e);
} finally {
close();
}
return result == null ? identity : result;
}
@Override
public OptionalChar reduce(final CharBinaryOperator accumulator) {
assertNotClosed();
if (maxThreadNum <= 1 || toIndex - fromIndex <= 1) {
return super.reduce(accumulator);
}
final int threadNum = N.min(maxThreadNum, (toIndex - fromIndex));
final List> futureList = new ArrayList<>(threadNum);
final Holder eHolder = new Holder<>();
if (splitor == Splitor.ARRAY) {
final int sliceSize = (toIndex - fromIndex) / threadNum + ((toIndex - fromIndex) % threadNum == 0 ? 0 : 1);
for (int i = 0; i < threadNum; i++) {
final int sliceIndex = i;
futureList.add(asyncExecutor.execute(new Callable() {
@Override
public Character call() {
int cursor = fromIndex + sliceIndex * sliceSize;
final int to = toIndex - cursor > sliceSize ? cursor + sliceSize : toIndex;
if (cursor >= to) {
return null;
}
char result = elements[cursor++];
try {
while (cursor < to && eHolder.value() == null) {
result = accumulator.applyAsChar(result, elements[cursor++]);
}
} catch (Exception e) {
setError(eHolder, e);
}
return result;
}
}));
}
} else {
final MutableInt cursor = MutableInt.of(fromIndex);
for (int i = 0; i < threadNum; i++) {
futureList.add(asyncExecutor.execute(new Callable() {
@Override
public Character call() {
char result = 0;
synchronized (elements) {
if (cursor.intValue() < toIndex) {
result = elements[cursor.getAndIncrement()];
} else {
return null;
}
}
char next = 0;
try {
while (eHolder.value() == null) {
synchronized (elements) {
if (cursor.intValue() < toIndex) {
next = elements[cursor.getAndIncrement()];
} else {
break;
}
}
result = accumulator.applyAsChar(result, next);
}
} catch (Exception e) {
setError(eHolder, e);
}
return result;
}
}));
}
}
if (eHolder.value() != null) {
close();
throw N.toRuntimeException(eHolder.value());
}
Character result = null;
try {
for (ContinuableFuture future : futureList) {
final Character tmp = future.get();
if (tmp == null) {
continue;
} else if (result == null) {
result = tmp;
} else {
result = accumulator.applyAsChar(result, tmp);
}
}
} catch (InterruptedException | ExecutionException e) {
throw N.toRuntimeException(e);
} finally {
close();
}
return result == null ? OptionalChar.empty() : OptionalChar.of(result);
}
@Override
public R collect(final Supplier supplier, final ObjCharConsumer accumulator, final BiConsumer combiner) {
assertNotClosed();
if (maxThreadNum <= 1 || toIndex - fromIndex <= 1) {
return super.collect(supplier, accumulator, combiner);
}
final int threadNum = N.min(maxThreadNum, (toIndex - fromIndex));
final List> futureList = new ArrayList<>(threadNum);
final Holder eHolder = new Holder<>();
if (splitor == Splitor.ARRAY) {
final int sliceSize = (toIndex - fromIndex) / threadNum + ((toIndex - fromIndex) % threadNum == 0 ? 0 : 1);
for (int i = 0; i < threadNum; i++) {
final int sliceIndex = i;
futureList.add(asyncExecutor.execute(new Callable() {
@Override
public R call() {
int cursor = fromIndex + sliceIndex * sliceSize;
final int to = toIndex - cursor > sliceSize ? cursor + sliceSize : toIndex;
final R container = supplier.get();
try {
while (cursor < to && eHolder.value() == null) {
accumulator.accept(container, elements[cursor++]);
}
} catch (Exception e) {
setError(eHolder, e);
}
return container;
}
}));
}
} else {
final MutableInt cursor = MutableInt.of(fromIndex);
for (int i = 0; i < threadNum; i++) {
futureList.add(asyncExecutor.execute(new Callable() {
@Override
public R call() {
final R container = supplier.get();
char next = 0;
try {
while (eHolder.value() == null) {
synchronized (elements) {
if (cursor.intValue() < toIndex) {
next = elements[cursor.getAndIncrement()];
} else {
break;
}
}
accumulator.accept(container, next);
}
} catch (Exception e) {
setError(eHolder, e);
}
return container;
}
}));
}
}
if (eHolder.value() != null) {
close();
throw N.toRuntimeException(eHolder.value());
}
R container = (R) NONE;
try {
for (ContinuableFuture future : futureList) {
if (container == NONE) {
container = future.get();
} else {
combiner.accept(container, future.get());
}
}
} catch (InterruptedException | ExecutionException e) {
throw N.toRuntimeException(e);
} finally {
close();
}
return container == NONE ? supplier.get() : container;
}
@Override
public OptionalChar min() {
boolean isDone = true;
try {
if (fromIndex == toIndex) {
return OptionalChar.empty();
} else if (sorted) {
return OptionalChar.of(elements[fromIndex]);
} else if (maxThreadNum <= 1 || toIndex - fromIndex <= 1) {
return OptionalChar.of(N.min(elements, fromIndex, toIndex));
} else {
isDone = false;
}
} finally {
if (isDone) {
close();
}
}
final int threadNum = N.min(maxThreadNum, (toIndex - fromIndex));
final List> futureList = new ArrayList<>(threadNum);
final int sliceSize = (toIndex - fromIndex) / threadNum + ((toIndex - fromIndex) % threadNum == 0 ? 0 : 1);
for (int i = 0; i < threadNum; i++) {
final int sliceIndex = i;
futureList.add(asyncExecutor.execute(new Callable() {
@Override
public Character call() {
int cursor = fromIndex + sliceIndex * sliceSize;
final int to = toIndex - cursor > sliceSize ? cursor + sliceSize : toIndex;
return cursor >= to ? null : N.min(elements, cursor, to);
}
}));
}
Character candidate = null;
try {
for (ContinuableFuture future : futureList) {
final Character tmp = future.get();
if (tmp == null) {
continue;
} else if (candidate == null || tmp.charValue() < candidate.charValue()) {
candidate = tmp;
}
}
} catch (InterruptedException | ExecutionException e) {
throw N.toRuntimeException(e);
} finally {
close();
}
return candidate == null ? OptionalChar.empty() : OptionalChar.of(candidate);
}
@Override
public OptionalChar max() {
boolean isDone = true;
try {
if (fromIndex == toIndex) {
return OptionalChar.empty();
} else if (sorted) {
return OptionalChar.of(elements[toIndex - 1]);
} else if (maxThreadNum <= 1 || toIndex - fromIndex <= 1) {
return OptionalChar.of(N.max(elements, fromIndex, toIndex));
} else {
isDone = false;
}
} finally {
if (isDone) {
close();
}
}
final int threadNum = N.min(maxThreadNum, (toIndex - fromIndex));
final List> futureList = new ArrayList<>(threadNum);
final int sliceSize = (toIndex - fromIndex) / threadNum + ((toIndex - fromIndex) % threadNum == 0 ? 0 : 1);
for (int i = 0; i < threadNum; i++) {
final int sliceIndex = i;
futureList.add(asyncExecutor.execute(new Callable() {
@Override
public Character call() {
int cursor = fromIndex + sliceIndex * sliceSize;
final int to = toIndex - cursor > sliceSize ? cursor + sliceSize : toIndex;
return cursor >= to ? null : N.max(elements, cursor, to);
}
}));
}
Character candidate = null;
try {
for (ContinuableFuture future : futureList) {
final Character tmp = future.get();
if (tmp == null) {
continue;
} else if (candidate == null || tmp.charValue() > candidate.charValue()) {
candidate = tmp;
}
}
} catch (InterruptedException | ExecutionException e) {
throw N.toRuntimeException(e);
} finally {
close();
}
return candidate == null ? OptionalChar.empty() : OptionalChar.of(candidate);
}
@Override
public int sum() {
boolean isDone = true;
try {
if (fromIndex == toIndex) {
return 0;
} else if (maxThreadNum <= 1 || toIndex - fromIndex <= 1) {
return sum(elements, fromIndex, toIndex);
} else {
isDone = false;
}
} finally {
if (isDone) {
close();
}
}
final int threadNum = N.min(maxThreadNum, (toIndex - fromIndex));
final List> futureList = new ArrayList<>(threadNum);
final int sliceSize = (toIndex - fromIndex) / threadNum + ((toIndex - fromIndex) % threadNum == 0 ? 0 : 1);
for (int i = 0; i < threadNum; i++) {
final int sliceIndex = i;
futureList.add(asyncExecutor.execute(new Callable() {
@Override
public Long call() {
int cursor = fromIndex + sliceIndex * sliceSize;
final int to = toIndex - cursor > sliceSize ? cursor + sliceSize : toIndex;
if (cursor >= to) {
return null;
} else {
long sum = 0;
for (int i = cursor; i < to; i++) {
sum += elements[i];
}
return sum;
}
}
}));
}
long result = 0;
try {
for (ContinuableFuture future : futureList) {
final Long tmp = future.get();
if (tmp == null) {
continue;
} else {
result += tmp.longValue();
}
}
} catch (InterruptedException | ExecutionException e) {
throw N.toRuntimeException(e);
} finally {
close();
}
return N.toIntExact(result);
}
@Override
public CharSummaryStatistics summarize() {
boolean isDone = true;
try {
if (fromIndex == toIndex) {
return new CharSummaryStatistics();
} else if (maxThreadNum <= 1 || toIndex - fromIndex <= 1) {
return super.summarize();
} else {
isDone = false;
}
} finally {
if (isDone) {
close();
}
}
final int threadNum = N.min(maxThreadNum, (toIndex - fromIndex));
final List> futureList = new ArrayList<>(threadNum);
final int sliceSize = (toIndex - fromIndex) / threadNum + ((toIndex - fromIndex) % threadNum == 0 ? 0 : 1);
for (int i = 0; i < threadNum; i++) {
final int sliceIndex = i;
futureList.add(asyncExecutor.execute(new Callable() {
@Override
public CharSummaryStatistics call() {
int cursor = fromIndex + sliceIndex * sliceSize;
final int to = toIndex - cursor > sliceSize ? cursor + sliceSize : toIndex;
final CharSummaryStatistics result = new CharSummaryStatistics();
for (int i = cursor; i < to; i++) {
result.accept(elements[i]);
}
return result;
}
}));
}
CharSummaryStatistics result = null;
try {
for (ContinuableFuture future : futureList) {
final CharSummaryStatistics tmp = future.get();
if (tmp == null) {
continue;
} else if (result == null) {
result = tmp;
} else {
result.combine(tmp);
}
}
} catch (InterruptedException | ExecutionException e) {
throw N.toRuntimeException(e);
} finally {
close();
}
return result;
}
@Override
public boolean anyMatch(final Try.CharPredicate predicate) throws E {
assertNotClosed();
if (maxThreadNum <= 1 || toIndex - fromIndex <= 1) {
return super.anyMatch(predicate);
}
final int threadNum = N.min(maxThreadNum, (toIndex - fromIndex));
final List> futureList = new ArrayList<>(threadNum);
final Holder eHolder = new Holder<>();
final MutableBoolean result = MutableBoolean.of(false);
if (splitor == Splitor.ARRAY) {
final int sliceSize = (toIndex - fromIndex) / threadNum + ((toIndex - fromIndex) % threadNum == 0 ? 0 : 1);
for (int i = 0; i < threadNum; i++) {
final int sliceIndex = i;
futureList.add(asyncExecutor.execute(new Try.Runnable() {
@Override
public void run() {
int cursor = fromIndex + sliceIndex * sliceSize;
final int to = toIndex - cursor > sliceSize ? cursor + sliceSize : toIndex;
try {
while (cursor < to && result.isFalse() && eHolder.value() == null) {
if (predicate.test(elements[cursor++])) {
result.setTrue();
break;
}
}
} catch (Exception e) {
setError(eHolder, e);
}
}
}));
}
} else {
final MutableInt cursor = MutableInt.of(fromIndex);
for (int i = 0; i < threadNum; i++) {
futureList.add(asyncExecutor.execute(new Try.Runnable() {
@Override
public void run() {
char next = 0;
try {
while (result.isFalse() && eHolder.value() == null) {
synchronized (elements) {
if (cursor.intValue() < toIndex) {
next = elements[cursor.getAndIncrement()];
} else {
break;
}
}
if (predicate.test(next)) {
result.setTrue();
break;
}
}
} catch (Exception e) {
setError(eHolder, e);
}
}
}));
}
}
try {
complette(futureList, eHolder, (E) null);
} finally {
close();
}
return result.value();
}
@Override
public boolean allMatch(final Try.CharPredicate predicate) throws E {
assertNotClosed();
if (maxThreadNum <= 1 || toIndex - fromIndex <= 1) {
return super.allMatch(predicate);
}
final int threadNum = N.min(maxThreadNum, (toIndex - fromIndex));
final List> futureList = new ArrayList<>(threadNum);
final Holder eHolder = new Holder<>();
final MutableBoolean result = MutableBoolean.of(true);
if (splitor == Splitor.ARRAY) {
final int sliceSize = (toIndex - fromIndex) / threadNum + ((toIndex - fromIndex) % threadNum == 0 ? 0 : 1);
for (int i = 0; i < threadNum; i++) {
final int sliceIndex = i;
futureList.add(asyncExecutor.execute(new Try.Runnable() {
@Override
public void run() {
int cursor = fromIndex + sliceIndex * sliceSize;
final int to = toIndex - cursor > sliceSize ? cursor + sliceSize : toIndex;
try {
while (cursor < to && result.isTrue() && eHolder.value() == null) {
if (predicate.test(elements[cursor++]) == false) {
result.setFalse();
break;
}
}
} catch (Exception e) {
setError(eHolder, e);
}
}
}));
}
} else {
final MutableInt cursor = MutableInt.of(fromIndex);
for (int i = 0; i < threadNum; i++) {
futureList.add(asyncExecutor.execute(new Try.Runnable() {
@Override
public void run() {
char next = 0;
try {
while (result.isTrue() && eHolder.value() == null) {
synchronized (elements) {
if (cursor.intValue() < toIndex) {
next = elements[cursor.getAndIncrement()];
} else {
break;
}
}
if (predicate.test(next) == false) {
result.setFalse();
break;
}
}
} catch (Exception e) {
setError(eHolder, e);
}
}
}));
}
}
try {
complette(futureList, eHolder, (E) null);
} finally {
close();
}
return result.value();
}
@Override
public boolean noneMatch(final Try.CharPredicate predicate) throws E {
assertNotClosed();
if (maxThreadNum <= 1 || toIndex - fromIndex <= 1) {
return super.noneMatch(predicate);
}
final int threadNum = N.min(maxThreadNum, (toIndex - fromIndex));
final List> futureList = new ArrayList<>(threadNum);
final Holder eHolder = new Holder<>();
final MutableBoolean result = MutableBoolean.of(true);
if (splitor == Splitor.ARRAY) {
final int sliceSize = (toIndex - fromIndex) / threadNum + ((toIndex - fromIndex) % threadNum == 0 ? 0 : 1);
for (int i = 0; i < threadNum; i++) {
final int sliceIndex = i;
futureList.add(asyncExecutor.execute(new Try.Runnable() {
@Override
public void run() {
int cursor = fromIndex + sliceIndex * sliceSize;
final int to = toIndex - cursor > sliceSize ? cursor + sliceSize : toIndex;
try {
while (cursor < to && result.isTrue() && eHolder.value() == null) {
if (predicate.test(elements[cursor++])) {
result.setFalse();
break;
}
}
} catch (Exception e) {
setError(eHolder, e);
}
}
}));
}
} else {
final MutableInt cursor = MutableInt.of(fromIndex);
for (int i = 0; i < threadNum; i++) {
futureList.add(asyncExecutor.execute(new Try.Runnable() {
@Override
public void run() {
char next = 0;
try {
while (result.isTrue() && eHolder.value() == null) {
synchronized (elements) {
if (cursor.intValue() < toIndex) {
next = elements[cursor.getAndIncrement()];
} else {
break;
}
}
if (predicate.test(next)) {
result.setFalse();
break;
}
}
} catch (Exception e) {
setError(eHolder, e);
}
}
}));
}
}
try {
complette(futureList, eHolder, (E) null);
} finally {
close();
}
return result.value();
}
@Override
public OptionalChar findFirst(final Try.CharPredicate predicate) throws E {
assertNotClosed();
if (maxThreadNum <= 1 || toIndex - fromIndex <= 1) {
return super.findFirst(predicate);
}
final int threadNum = N.min(maxThreadNum, (toIndex - fromIndex));
final List> futureList = new ArrayList<>(threadNum);
final Holder eHolder = new Holder<>();
final Holder> resultHolder = new Holder<>();
if (splitor == Splitor.ARRAY) {
final int sliceSize = (toIndex - fromIndex) / threadNum + ((toIndex - fromIndex) % threadNum == 0 ? 0 : 1);
for (int i = 0; i < threadNum; i++) {
final int sliceIndex = i;
futureList.add(asyncExecutor.execute(new Try.Runnable() {
@Override
public void run() {
int cursor = fromIndex + sliceIndex * sliceSize;
final int to = toIndex - cursor > sliceSize ? cursor + sliceSize : toIndex;
final Pair pair = new Pair<>();
try {
while (cursor < to && (resultHolder.value() == null || cursor < resultHolder.value().left) && eHolder.value() == null) {
pair.left = cursor;
pair.right = elements[cursor++];
if (predicate.test(pair.right)) {
synchronized (resultHolder) {
if (resultHolder.value() == null || pair.left < resultHolder.value().left) {
resultHolder.setValue(pair.copy());
}
}
break;
}
}
} catch (Exception e) {
setError(eHolder, e);
}
}
}));
}
} else {
final MutableInt cursor = MutableInt.of(fromIndex);
for (int i = 0; i < threadNum; i++) {
futureList.add(asyncExecutor.execute(new Try.Runnable() {
@Override
public void run() {
final Pair pair = new Pair<>();
try {
while (resultHolder.value() == null && eHolder.value() == null) {
synchronized (elements) {
if (cursor.intValue() < toIndex) {
pair.left = cursor.intValue();
pair.right = elements[cursor.getAndIncrement()];
} else {
break;
}
}
if (predicate.test(pair.right)) {
synchronized (resultHolder) {
if (resultHolder.value() == null || pair.left < resultHolder.value().left) {
resultHolder.setValue(pair.copy());
}
}
break;
}
}
} catch (Exception e) {
setError(eHolder, e);
}
}
}));
}
}
try {
complette(futureList, eHolder, (E) null);
} finally {
close();
}
return resultHolder.value() == null ? OptionalChar.empty() : OptionalChar.of(resultHolder.value().right);
}
@Override
public OptionalChar findLast(final Try.CharPredicate predicate) throws E {
assertNotClosed();
if (maxThreadNum <= 1 || toIndex - fromIndex <= 1) {
return super.findLast(predicate);
}
final int threadNum = N.min(maxThreadNum, (toIndex - fromIndex));
final List> futureList = new ArrayList<>(threadNum);
final Holder eHolder = new Holder<>();
final Holder> resultHolder = new Holder<>();
if (splitor == Splitor.ARRAY) {
final int sliceSize = (toIndex - fromIndex) / threadNum + ((toIndex - fromIndex) % threadNum == 0 ? 0 : 1);
for (int i = 0; i < threadNum; i++) {
final int sliceIndex = i;
futureList.add(asyncExecutor.execute(new Try.Runnable() {
@Override
public void run() {
final int from = fromIndex + sliceIndex * sliceSize;
int cursor = toIndex - from > sliceSize ? from + sliceSize : toIndex;
final Pair pair = new Pair<>();
try {
while (cursor > from && (resultHolder.value() == null || cursor > resultHolder.value().left) && eHolder.value() == null) {
pair.left = cursor;
pair.right = elements[--cursor];
if (predicate.test(pair.right)) {
synchronized (resultHolder) {
if (resultHolder.value() == null || pair.left > resultHolder.value().left) {
resultHolder.setValue(pair.copy());
}
}
break;
}
}
} catch (Exception e) {
setError(eHolder, e);
}
}
}));
}
} else {
final MutableInt cursor = MutableInt.of(toIndex);
for (int i = 0; i < threadNum; i++) {
futureList.add(asyncExecutor.execute(new Try.Runnable() {
@Override
public void run() {
final Pair pair = new Pair<>();
try {
while (resultHolder.value() == null && eHolder.value() == null) {
synchronized (elements) {
if (cursor.intValue() > fromIndex) {
pair.left = cursor.intValue();
pair.right = elements[cursor.decrementAndGet()];
} else {
break;
}
}
if (predicate.test(pair.right)) {
synchronized (resultHolder) {
if (resultHolder.value() == null || pair.left > resultHolder.value().left) {
resultHolder.setValue(pair.copy());
}
}
break;
}
}
} catch (Exception e) {
setError(eHolder, e);
}
}
}));
}
}
try {
complette(futureList, eHolder, (E) null);
} finally {
close();
}
return resultHolder.value() == null ? OptionalChar.empty() : OptionalChar.of(resultHolder.value().right);
}
@Override
public OptionalChar findAny(final Try.CharPredicate predicate) throws E {
assertNotClosed();
if (maxThreadNum <= 1 || toIndex - fromIndex <= 1) {
return super.findAny(predicate);
}
final int threadNum = N.min(maxThreadNum, (toIndex - fromIndex));
final List> futureList = new ArrayList<>(threadNum);
final Holder eHolder = new Holder<>();
final Holder