scala.collection.par.workstealing.HashTries

HashMapIndexedStealer

class HashMapIndexedStealer[K, V] extends Flat[(K, V)]

Linear Supertypes
Flat[(K, V)], PreciseStealer[(K, V)], IndexedStealer[(K, V)], Stealer[(K, V)], AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. HashMapIndexedStealer
  2. Flat
  3. PreciseStealer
  4. IndexedStealer
  5. Stealer
  6. AnyRef
  7. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new HashMapIndexedStealer(root: HashMap[K, V], start: Int, end: Int)

Type Members

  1. type StealerType = HashMapIndexedStealer[K, V]

    Definition Classes
    HashMapIndexedStealerFlatIndexedStealer

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_PROGRESS(ov: Int, nv: Int): Boolean

    Definition Classes
    IndexedStealer
  7. final def READ_PROGRESS: Int

    Definition Classes
    IndexedStealer
  8. final def WRITE_PROGRESS(nv: Int): Unit

    Definition Classes
    IndexedStealer
  9. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  10. def asPrecise: PreciseStealer[(K, V)]

    Attempts to cast this stealer into a precise stealer.

    Attempts to cast this stealer into a precise stealer.

    Definition Classes
    Stealer
  11. final def child(n: HashMap[K, V], idx: Int): immutable.Iterable[(K, V)] with AbstractIterable[(K, V)] with (Nothing) ⇒ Any with Serializable with CustomParallelizable[(K, V), ParIterable[(K, V)] with Serializable with Equals { def seq: scala.collection.immutable.Iterable[(K, V)] with scala.collection.AbstractIterable[(K, V)] with Nothing => Any with Serializable with scala.collection.CustomParallelizable[(K, V),scala.collection.parallel.immutable.ParIterable[(K, V)] with Serializable with Equals] }] { def seq: scala.collection.immutable.Iterable[(K, V)] with Nothing => Any{def seq: scala.collection.immutable.Iterable[(K, V)] with Nothing => Any} }

  12. val chunkIterator: TrieChunkIterator[(K, V), HashMap[K, V]]

  13. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  14. def decode(p: Int): Int

    Attributes
    protected
    Definition Classes
    IndexedStealer
  15. def duplicated: Stealer[(K, V)]

    Optional.

    Optional.

    Definition Classes
    Stealer
  16. def elementsCompleted: Int

    The number of elements already committed to by this stealer.

    The number of elements already committed to by this stealer.

    returns

    number of elements the stealer already committed to

    Definition Classes
    PreciseStealer
  17. def elementsRemaining: Int

    An exact number of remaining elements in this stealer that its owner has not yet committed to.

    An exact number of remaining elements in this stealer that its owner has not yet committed to.

    returns

    an exact number of remaining elements

    Definition Classes
    FlatPreciseStealer
  18. def elementsRemainingEstimate: Int

    Returns an estimate on the number of remaining elements.

    Returns an estimate on the number of remaining elements.

    Definition Classes
    PreciseStealerStealer
  19. val end: Int

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

    Definition Classes
    AnyRef
  21. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any
  22. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  23. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  24. def hasNext: Boolean

    Definition Classes
    FlatPreciseStealerStealer
  25. def hashCode(): Int

    Definition Classes
    AnyRef → Any
  26. def indicesRemaining: Int

    Definition Classes
    IndexedStealer
  27. 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
  28. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  29. val leafArray: Array[immutable.Iterable[(K, V)]]

  30. 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
    IndexedStealerStealer
    Annotations
    @tailrec()
  31. 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
    IndexedStealerStealer
    Annotations
    @tailrec()
  32. 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
  33. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  34. def newStealer(start: Int, until: Int): HashMapIndexedStealer[K, V]

    Definition Classes
    HashMapIndexedStealerFlatIndexedStealer
  35. def next(): (K, V)

    Definition Classes
    HashMapIndexedStealerPreciseStealerStealer
  36. 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
    IndexedStealerStealer
    Annotations
    @tailrec()
  37. def nextOffset: Int

    ordinal number of element returned by subsequent next call

    ordinal number of element returned by subsequent next call

    Definition Classes
    FlatPreciseStealer
  38. var nextProgress: Int

    Definition Classes
    IndexedStealer
  39. var nextUntil: Int

    Definition Classes
    IndexedStealer
  40. final def notify(): Unit

    Definition Classes
    AnyRef
  41. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  42. var progress: Int

    Definition Classes
    IndexedStealer
  43. def psplit(leftsize: Int): (StealerType, StealerType)

    Splits this stealer into a pair of stealers that traverse its remaining elements.

    Splits this stealer into a pair of stealers that traverse its remaining elements. The first stealer will have exactly leftSize elements.

    Note: stealer needs to be in the stolen state.

    Definition Classes
    FlatPreciseStealer
  44. final def resetIterator(n: HashMap[K, V]): Unit

  45. val root: HashMap[K, V]

  46. final def setPos(pos: Int): Unit

  47. def split: (StealerType, StealerType)

    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
    FlatPreciseStealerStealer
  48. def splitAtIndex(leftoffset: Int): (StealerType, StealerType)

    Definition Classes
    IndexedStealer
  49. val start: Int

  50. val startIndex: Int

    Definition Classes
    IndexedStealer
  51. final 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
    IndexedStealerStealer
  52. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  53. def toString(): String

    Definition Classes
    IndexedStealer → AnyRef → Any
  54. final def totalChildren(n: HashMap[K, V]): Int

  55. def totalElements: Int

    A total number of elements that this stealer could commit to at the time of its creation.

    A total number of elements that this stealer could commit to at the time of its creation.

    returns

    total number of elements in the stealer

    Definition Classes
    FlatPreciseStealer
  56. val untilIndex: Int

    Definition Classes
    IndexedStealer
  57. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  58. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  59. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Flat[(K, V)]

Inherited from PreciseStealer[(K, V)]

Inherited from IndexedStealer[(K, V)]

Inherited from Stealer[(K, V)]

Inherited from AnyRef

Inherited from Any

Ungrouped