|
org.codehaus.gpars | |||||||
FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object LOCPap groovyx.gpars.extra166y.AbstractParallelAnyArray.LROCPap
static final class AbstractParallelAnyArray.LROCPap extends LOCPap
Field Summary | |
---|---|
IntAndLongPredicate |
selector
|
Constructor Summary | |
AbstractParallelAnyArray.LROCPap(ForkJoinPool ex, int origin, int fence, long[] array, IntAndLongPredicate selector, IntAndLongToObject op)
|
Method Summary | |
---|---|
boolean
|
hasFilter()
|
boolean
|
isSelected(int i)
|
void
|
leafApply(int lo, int hi, Procedure procedure)
|
java.lang.Object
|
leafReduce(int lo, int hi, Reducer reducer, java.lang.Object base)
|
ParallelLongArrayWithMapping
|
withIndexedMapping(IntAndObjectToObject mapper)
|
ParallelLongArrayWithDoubleMapping
|
withIndexedMapping(IntAndObjectToDouble mapper)
|
ParallelLongArrayWithLongMapping
|
withIndexedMapping(IntAndObjectToLong mapper)
|
ParallelLongArrayWithMapping
|
withMapping(Op op)
|
ParallelLongArrayWithDoubleMapping
|
withMapping(ObjectToDouble op)
|
ParallelLongArrayWithLongMapping
|
withMapping(ObjectToLong op)
|
Field Detail |
---|
final IntAndLongPredicate selector
Constructor Detail |
---|
AbstractParallelAnyArray.LROCPap(ForkJoinPool ex, int origin, int fence, long[] array, IntAndLongPredicate selector, IntAndLongToObject op)
Method Detail |
---|
boolean hasFilter()
boolean isSelected(int i)
void leafApply(int lo, int hi, Procedure procedure)
java.lang.Object leafReduce(int lo, int hi, Reducer reducer, java.lang.Object base)
public ParallelLongArrayWithMapping withIndexedMapping(IntAndObjectToObject mapper)
public ParallelLongArrayWithDoubleMapping withIndexedMapping(IntAndObjectToDouble mapper)
public ParallelLongArrayWithLongMapping withIndexedMapping(IntAndObjectToLong mapper)
public ParallelLongArrayWithMapping withMapping(Op op)
public ParallelLongArrayWithDoubleMapping withMapping(ObjectToDouble op)
public ParallelLongArrayWithLongMapping withMapping(ObjectToLong op)
Copyright © 2008–2012 Václav Pech. All Rights Reserved.