scala.collection.par.workstealing.HashTries

HashMapOps

final class HashMapOps[K, V] extends AnyVal with OpsLike[(K, V), Par[HashMap[K, V]]]

Linear Supertypes
OpsLike[(K, V), Par[HashMap[K, V]]], AnyVal, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. HashMapOps
  2. OpsLike
  3. AnyVal
  4. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new HashMapOps(hashmap: Par[HashMap[K, V]])

Value Members

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

    Definition Classes
    Any
  2. final def ##(): Int

    Definition Classes
    Any
  3. final def ==(arg0: Any): Boolean

    Definition Classes
    Any
  4. macro def aggregate[S](z: S)(combop: (S, S) ⇒ S)(seqop: (S, (K, V)) ⇒ S)(implicit ctx: Scheduler): S

    Definition Classes
    HashMapOpsOpsLike
  5. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  6. macro def count[U >: (K, V)](p: (U) ⇒ Boolean)(implicit ctx: Scheduler): Int

    Definition Classes
    HashMapOpsOpsLike
  7. macro def exists[U >: (K, V)](p: (U) ⇒ Boolean)(implicit ctx: Scheduler): Boolean

    Definition Classes
    HashMapOpsOpsLike
  8. macro def filter[That](pred: ((K, V)) ⇒ Boolean)(implicit cmf: CanMergeFrom[Par[HashMap[K, V]], (K, V), That], ctx: Scheduler): That

    Definition Classes
    HashMapOpsOpsLike
  9. macro def find[U >: (K, V)](pred: (U) ⇒ Boolean)(implicit ctx: Scheduler): Option[(K, V)]

    Definition Classes
    HashMapOpsOpsLike
  10. macro def flatMap[S, That](func: ((K, V)) ⇒ scala.TraversableOnce[S])(implicit cmf: CanMergeFrom[Par[HashMap[K, V]], S, That], ctx: Scheduler): That

    Definition Classes
    HashMapOpsOpsLike
  11. macro def fold[U >: (K, V)](z: ⇒ U)(op: (U, U) ⇒ U)(implicit ctx: Scheduler): U

    Definition Classes
    HashMapOpsOpsLike
  12. macro def forall[U >: (K, V)](p: (U) ⇒ Boolean)(implicit ctx: Scheduler): Boolean

    Definition Classes
    HashMapOpsOpsLike
  13. macro def foreach[U >: (K, V)](action: (U) ⇒ Unit)(implicit ctx: Scheduler): Unit

    Definition Classes
    HashMapOpsOpsLike
  14. def getClass(): Class[_ <: AnyVal]

    Definition Classes
    AnyVal → Any
  15. macro def groupBy[K, That <: AnyRef](gr: ((K, V)) ⇒ K)(implicit kClassTag: ClassTag[K], tClassTag: ClassTag[(K, V)], ctx: Scheduler, cmf: CanMergeFrom[Par[HashMap[K, V]], (K, V), That]): Par[HashMap[K, That]]

    Definition Classes
    OpsLike
  16. macro def groupMapAggregate[K, M](gr: ((K, V)) ⇒ K)(mp: ((K, V)) ⇒ M)(aggr: (M, M) ⇒ M)(implicit kClassTag: ClassTag[K], mClassTag: ClassTag[M], ctx: Scheduler): Par[HashMap[K, M]]

    Definition Classes
    OpsLike
  17. val hashmap: Par[HashMap[K, V]]

  18. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  19. macro def map[S, That](func: ((K, V)) ⇒ S)(implicit cmf: CanMergeFrom[Par[HashMap[K, V]], S, That], ctx: Scheduler): That

    Definition Classes
    HashMapOpsOpsLike
  20. macro def mapReduce[M](mp: ((K, V)) ⇒ M)(combop: (M, M) ⇒ M)(implicit ctx: Scheduler): M

    Definition Classes
    HashMapOpsOpsLike
  21. macro def max[U >: (K, V)](implicit ord: Ordering[U], ctx: Scheduler): U

    Definition Classes
    HashMapOpsOpsLike
  22. macro def min[U >: (K, V)](implicit ord: Ordering[U], ctx: Scheduler): U

    Definition Classes
    HashMapOpsOpsLike
  23. macro def product[U >: (K, V)](implicit num: Numeric[U], ctx: Scheduler): U

    Definition Classes
    HashMapOpsOpsLike
  24. macro def reduce[U >: (K, V)](operator: (U, U) ⇒ U)(implicit ctx: Scheduler): U

    Definition Classes
    HashMapOpsOpsLike
  25. def seq: Par[HashMap[K, V]]

    Definition Classes
    HashMapOpsOpsLike
  26. def stealer: Stealer[(K, V)]

    Definition Classes
    HashMapOpsOpsLike
  27. macro def sum[U >: (K, V)](implicit num: Numeric[U], ctx: Scheduler): U

    Definition Classes
    HashMapOpsOpsLike
  28. def toString(): String

    Definition Classes
    Any

Inherited from OpsLike[(K, V), Par[HashMap[K, V]]]

Inherited from AnyVal

Inherited from Any

Ungrouped