BinaryTreeStealer

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 CAS_STACK(ov: Long, nv: Long): Boolean

7. final def READ_STACK: Long

8. final def WRITE_STACK(nv: Long): Unit

9. final def asInstanceOf[T0]: T0

   Definition Classes

   Any

10. def asPrecise: PreciseStealer[T]

    Attempts to cast this stealer into a precise stealer.

    Attempts to cast this stealer into a precise stealer.

    Definition Classes

    Stealer

11. val binary: Binary[T, Node]

12. def clone(): AnyRef

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

13. def duplicated: BinaryTreeStealer[T, Node]

    Optional.

    Optional.

    Definition Classes

    BinaryTreeStealer → Stealer

14. def elementsRemainingEstimate: Int

    Returns an estimate on the number of remaining elements.

    Returns an estimate on the number of remaining elements.

    Definition Classes

    BinaryTreeStealer → Stealer

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

    Definition Classes

    AnyRef

16. def equals(arg0: Any): Boolean

    Definition Classes

    AnyRef → Any

17. def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

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

    Definition Classes

    AnyRef → Any

19. def hasNext: Boolean

    Definition Classes

    BinaryTreeStealer → Stealer

20. def hashCode(): Int

    Definition Classes

    AnyRef → Any

21. def isAvailable: Boolean

    A shortcut method that checks if the stealer is in the available state.

    A shortcut method that checks if the stealer is in the available state.

    Definition Classes

    Stealer

22. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

23. var iterator: scala.Iterator[T]

24. var localDepth: Int

25. val localStack: Array[Node]

26. final def markCompleted(): Boolean

    Attempts to push the stealer to the Completed state.

    Attempts to push the stealer to the Completed state. Only changes the state if the stealer was in the AvailableOrOwned state, otherwise does nothing.

    Note: after having called this operation, the node will either be stolen or completed.

    returns

    true if node ends in the Completed state, false if it ends in the StolenOrExpanded state

    Definition Classes

    BinaryTreeStealer → Stealer

    Annotations

    @tailrec()

27. final def markStolen(): Boolean

    Attempts to push the stealer to the Stolen state.

    Attempts to push the stealer to the Stolen state. Only changes the state if the stealer was in the AvailableOrOwned state, otherwise does nothing.

    Note: after having called this operation, the node will either be stolen or completed.

    returns

    false if node ends in the Completed state, true if it ends in the StolenOrExpanded state

    Definition Classes

    BinaryTreeStealer → Stealer

    Annotations

    @tailrec()

28. def minimumStealThreshold: Int

    Minimum stealing threshold above which this stealer can be stolen and split.

    Minimum stealing threshold above which this stealer can be stolen and split.

    Note: splitting and stealing still work if there are less elements, but the scheduler will not split such stealers.

    Definition Classes

    Stealer

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

    Definition Classes

    AnyRef

30. def next(): T

    Definition Classes

    BinaryTreeStealer → Stealer

31. final def nextBatch(step: Int): Int

    Commits to processing a block of elements by using next and hasNext.

    Commits to processing a block of elements by using next and hasNext.

    Once hasNext has returned false, nextBatch can be called again.

    step

    approximate number of elements to commit to processing

    returns

    -1 if the stealer is not in the AvailableOrOwned state, otherwise an approximation on the number of elements that calls to next will return.

    Definition Classes

    BinaryTreeStealer → Stealer

32. final def notify(): Unit

    Definition Classes

    AnyRef

33. final def notifyAll(): Unit

    Definition Classes

    AnyRef

34. val onceIterator: OnceIterator[T]

35. final def popLocal(stack: Long): Long

36. final def pushLocal(stack: Long, v: Long, node: Node): Long

37. val root: Node

38. def split: (Stealer[T], Stealer[T])

    Can only be called on stealers that are in the stolen state.

    Can only be called on stealers that are in the stolen state.

    It will return a pair of stealers traversing the remaining elements of the current stealer.

    Definition Classes

    BinaryTreeStealer → Stealer

39. var stack: Long

40. val startingDepth: Int

41. def state: State

    Stealer state can be AvailableOrOwned, Completed or StolenOrExpanded.

    Stealer state can be AvailableOrOwned, Completed or StolenOrExpanded.

    Stealer state can change from available to either completed or stolen, but cannot change once it is completed or stolen.

    Definition Classes

    BinaryTreeStealer → Stealer

42. val subtreeIterator: SubtreeIterator[T, Node]

43. final def switchLocal(stack: Long, v: Long): Long

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

    Definition Classes

    AnyRef

45. def toString(): String

    Definition Classes

    BinaryTreeStealer → AnyRef → Any

46. def toString0: String

47. final def topLocal: Node

48. final def topMask(stack: Long): Long

49. val totalElems: Int

50. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )