|
org.codehaus.gpars | |||||||
FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object DLCPap groovyx.gpars.extra166y.AbstractParallelAnyArray.DRLCPap
static final class AbstractParallelAnyArray.DRLCPap extends DLCPap
Field Summary | |
---|---|
IntAndDoublePredicate |
selector
|
Constructor Summary | |
AbstractParallelAnyArray.DRLCPap(ForkJoinPool ex, int origin, int fence, double[] array, IntAndDoublePredicate selector, IntAndDoubleToLong op)
|
Method Summary | |
---|---|
boolean
|
hasFilter()
|
boolean
|
isSelected(int i)
|
void
|
leafApply(int lo, int hi, LongProcedure procedure)
|
long
|
leafReduce(int lo, int hi, LongReducer reducer, long base)
|
ParallelDoubleArrayWithMapping
|
withIndexedMapping(IntAndLongToObject mapper)
|
ParallelDoubleArrayWithDoubleMapping
|
withIndexedMapping(IntAndLongToDouble mapper)
|
ParallelDoubleArrayWithLongMapping
|
withIndexedMapping(IntAndLongToLong mapper)
|
ParallelDoubleArrayWithDoubleMapping
|
withMapping(LongToDouble op)
|
ParallelDoubleArrayWithLongMapping
|
withMapping(LongOp op)
|
ParallelDoubleArrayWithMapping
|
withMapping(LongToObject op)
|
Field Detail |
---|
final IntAndDoublePredicate selector
Constructor Detail |
---|
AbstractParallelAnyArray.DRLCPap(ForkJoinPool ex, int origin, int fence, double[] array, IntAndDoublePredicate selector, IntAndDoubleToLong op)
Method Detail |
---|
boolean hasFilter()
boolean isSelected(int i)
void leafApply(int lo, int hi, LongProcedure procedure)
long leafReduce(int lo, int hi, LongReducer reducer, long base)
public ParallelDoubleArrayWithMapping withIndexedMapping(IntAndLongToObject mapper)
public ParallelDoubleArrayWithDoubleMapping withIndexedMapping(IntAndLongToDouble mapper)
public ParallelDoubleArrayWithLongMapping withIndexedMapping(IntAndLongToLong mapper)
public ParallelDoubleArrayWithDoubleMapping withMapping(LongToDouble op)
public ParallelDoubleArrayWithLongMapping withMapping(LongOp op)
public ParallelDoubleArrayWithMapping withMapping(LongToObject op)
Copyright © 2008–2012 Václav Pech. All Rights Reserved.