FindFirstStrategy

abstract def choose[T, R](index: Int, total: Int, tree: Ref[T, R]): Boolean

Returns true if the worker labeled with index with a total of total workers should go left at level level.

abstract def chooseAsStealer[T, R](index: Int, total: Int, tree: Ref[T, R]): Ref[T, R]

Which node the stealer takes at this level.

abstract def chooseAsVictim[T, R](index: Int, total: Int, tree: Ref[T, R]): Ref[T, R]

Which node the victim takes at this level.

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def findWork[T, R](worker: WorkerTask, tree: Ref[T, R], kernel: Kernel[T, R]): Ref[T, R]

Finds work in the tree for the given worker, which is one out of total workers.

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit