package
par
Type Members
-
-
-
-
-
-
class
Par[+Repr] extends AnyRef
-
-
-
-
trait
ReducableOps[+T, +Repr, Ctx] extends Any
-
-
-
-
-
class
assume extends Annotation with StaticAnnotation
Value Members
-
-
-
-
-
-
-
-
-
implicit
def
arrayIsZippable[T](implicit ctx: Scheduler): IsZippable[Array[T], T]
-
implicit
def
arrayOps[T](a: Par[Array[T]]): Ops[T]
-
implicit
def
canMergeArray[T](implicit arg0: ClassTag[T], ctx: Scheduler): CanMergeFrom[Par[Array[_]], T, Par[Array[T]]]
-
-
implicit
def
canMergeHashMap[K, V](implicit arg0: ClassTag[K], arg1: ClassTag[V], ctx: Scheduler): CanMergeFrom[Par[HashMap[_, _]], (K, V), Par[HashMap[K, V]]] { ... /* 2 definitions in type refinement */ }
-
implicit
def
canMergeHashSet[T](implicit arg0: ClassTag[T], ctx: Scheduler): CanMergeFrom[Par[HashSet[_]], T, Par[HashSet[T]]] { ... /* 2 definitions in type refinement */ }
-
implicit
def
canMergeHashTrieMap[K, V](implicit arg0: ClassTag[K], arg1: ClassTag[V], ctx: Scheduler): CanMergeFrom[Par[HashMap[_, _]], (K, V), Par[HashMap[K, V]]] { ... /* 2 definitions in type refinement */ }
-
implicit
def
canMergeHashTrieSet[T](implicit arg0: ClassTag[T], ctx: Scheduler): CanMergeFrom[Par[HashSet[_]], T, Par[HashSet[T]]] { ... /* 2 definitions in type refinement */ }
-
implicit
def
canMergeIntHashSet(implicit ctx: Scheduler): CanMergeFrom[Par[HashSet[_]], Int, Par[HashSet[Int]]] { ... /* 2 definitions in type refinement */ }
-
implicit
def
canMergeParRange(implicit ctx: Scheduler): CanMergeFrom[Par[Range], Int, Par[Array[Int]]]
-
implicit
def
canMergeRange(implicit ctx: Scheduler): CanMergeFrom[Range, Int, Par[Array[Int]]]
-
implicit
def
canMergeReducable[T](implicit arg0: ClassTag[T], ctx: Scheduler): CanMergeFrom[Reducable[_], T, Par[Array[T]]]
-
implicit
def
canMergeReducableInt(implicit ctx: Scheduler): CanMergeFrom[Reducable[_], Int, Par[Array[Int]]]
-
-
implicit
def
concIsZippable[T]: IsZippable[Conc[T], T] { def apply(pr: scala.collection.par.Par[scala.collection.par.Conc[T]]): Nothing }
-
implicit
def
concOps[T](c: Par[Conc[T]]): Ops[T]
-
-
def
getUnsafe(): Unsafe
-
implicit
def
hashMapIsReducable[K, V]: IsReducable[HashMap[K, V], (K, V)]
-
implicit
def
hashMapOps[K, V](a: Par[HashMap[K, V]]): HashMapOps[K, V]
-
implicit
def
hashSetIsReducable[T]: IsReducable[HashSet[T], T]
-
implicit
def
hashSetOps[T](a: Par[HashSet[T]]): HashSetOps[T]
-
implicit
def
hashTrieMapIsReducable[K, V]: IsReducable[HashMap[K, V], (K, V)]
-
implicit
def
hashTrieMapOps[K, V](a: Par[HashMap[K, V]]): HashMapOps[K, V]
-
implicit
def
hashTrieSetIsReducable[T]: IsReducable[HashSet[T], T]
-
implicit
def
hashTrieSetOps[T](a: Par[HashSet[T]]): HashSetOps[T]
-
implicit
def
immutableTreeSetIsReducable[T]: IsReducable[TreeSet[T], T]
-
implicit
def
par2reducable[T, Repr](r: Par[Repr])(implicit isReducable: IsReducable[Repr, T]): Reducable[T]
-
implicit
def
par2zippable[T, Repr](r: Par[Repr])(implicit isZippable: IsZippable[Repr, T]): Zippable[T]
-
implicit
def
rangeIsZippable(implicit ctx: Scheduler): IsZippable[Range, Int] { def apply(pr: scala.collection.par.Par[Range]): scala.collection.par.Zippable[Int]{def stealer: scala.collection.par.workstealing.Ranges.RangeStealer} }
-
implicit
def
rangeOps(r: Par[Range]): Ops
-
implicit
def
reducableOps[T](r: Reducable[T]): Ops[T]
-
implicit
def
seq2ops[Repr](seq: Repr): ops[Repr]
-
implicit
def
treeSetOps[T](ts: Par[TreeSet[T]]): TreeSetOps[T]
-
val
unsafe: Unsafe
-
-
implicit
def
zippableOps[T](z: Zippable[T]): Ops[T]
