AssignTop

Value Members

1. final def !=(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

2. final def !=(arg0: Any): Boolean

   Definition Classes

   Any

3. final def ##(): Int

   Definition Classes

   AnyRef → Any

4. final def ==(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

5. final def ==(arg0: Any): Boolean

   Definition Classes

   Any

6. final def asInstanceOf[T0]: T0

   Definition Classes

   Any

7. 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.

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

   Definition Classes

   AssignTop → Strategy

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

   Which node the stealer takes at this level.

   Which node the stealer takes at this level.

   Definition Classes

   AssignTop → Strategy

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

   Which node the victim takes at this level.

   Which node the victim takes at this level.

   Definition Classes

   AssignTop → Strategy

10. final def chooseInTreeTop(index: Int, level: Int): Boolean

    Returns true iff the worker should first go left at this level of the tree top.

11. def clone(): AnyRef

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

12. final def eq(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

13. def equals(arg0: Any): Boolean

    Definition Classes

    AnyRef → Any

14. def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

15. 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.

    Finds work in the tree for the given worker, which is one out of total workers. This search may include stealing work.

    Definition Classes

    FindFirstStrategy → Strategy

16. final def getClass(): Class[_]

    Definition Classes

    AnyRef → Any

17. def hashCode(): Int

    Definition Classes

    AnyRef → Any

18. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

19. final def isTreeTop(total: Int, level: Int): Boolean

    Returns true iff the level of the tree is such that: 2^level < total

20. final def ne(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

21. final def notify(): Unit

    Definition Classes

    AnyRef

22. final def notifyAll(): Unit

    Definition Classes

    AnyRef

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

    Definition Classes

    AnyRef

24. def toString(): String

    Definition Classes

    AnyRef → Any

25. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

27. final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )