|
org.codehaus.gpars | |||||||
FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object LDCPap groovyx.gpars.extra166y.AbstractParallelAnyArray.LRDCPap
static final class AbstractParallelAnyArray.LRDCPap extends LDCPap
Field Summary | |
---|---|
IntAndLongPredicate |
selector
|
Constructor Summary | |
AbstractParallelAnyArray.LRDCPap(ForkJoinPool ex, int origin, int fence, long[] array, IntAndLongPredicate selector, IntAndLongToDouble op)
|
Method Summary | |
---|---|
boolean
|
hasFilter()
|
boolean
|
isSelected(int i)
|
void
|
leafApply(int lo, int hi, DoubleProcedure procedure)
|
double
|
leafReduce(int lo, int hi, DoubleReducer reducer, double base)
|
ParallelLongArrayWithMapping
|
withIndexedMapping(IntAndDoubleToObject mapper)
|
ParallelLongArrayWithDoubleMapping
|
withIndexedMapping(IntAndDoubleToDouble mapper)
|
ParallelLongArrayWithLongMapping
|
withIndexedMapping(IntAndDoubleToLong mapper)
|
ParallelLongArrayWithDoubleMapping
|
withMapping(DoubleOp op)
|
ParallelLongArrayWithLongMapping
|
withMapping(DoubleToLong op)
|
ParallelLongArrayWithMapping
|
withMapping(DoubleToObject op)
|
Field Detail |
---|
final IntAndLongPredicate selector
Constructor Detail |
---|
AbstractParallelAnyArray.LRDCPap(ForkJoinPool ex, int origin, int fence, long[] array, IntAndLongPredicate selector, IntAndLongToDouble op)
Method Detail |
---|
boolean hasFilter()
boolean isSelected(int i)
void leafApply(int lo, int hi, DoubleProcedure procedure)
double leafReduce(int lo, int hi, DoubleReducer reducer, double base)
public ParallelLongArrayWithMapping withIndexedMapping(IntAndDoubleToObject mapper)
public ParallelLongArrayWithDoubleMapping withIndexedMapping(IntAndDoubleToDouble mapper)
public ParallelLongArrayWithLongMapping withIndexedMapping(IntAndDoubleToLong mapper)
public ParallelLongArrayWithDoubleMapping withMapping(DoubleOp op)
public ParallelLongArrayWithLongMapping withMapping(DoubleToLong op)
public ParallelLongArrayWithMapping withMapping(DoubleToObject op)
Copyright © 2008–2012 Václav Pech. All Rights Reserved.