AlgebirdRDD

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. def aggregate[B, C](agg: Aggregator[T, B, C])(implicit arg0: ClassTag[B]): C

   

   This will throw if you use a non-MonoidAggregator with an empty RDD requires a commutative Semigroup.

   This will throw if you use a non-MonoidAggregator with an empty RDD requires a commutative Semigroup. To generalize to non-commutative, we need a sorted partition for T.

5. def aggregateByKey[K, V1, U, V2](part: Partitioner, agg: Aggregator[V1, U, V2])(implicit arg0: ClassTag[K], arg1: ClassTag[U], ev: <:<[T, (K, V1)], ordK: Priority[Ordering[K], DummyImplicit]): RDD[(K, V2)]

   

   Apply an Aggregator to the values for each key with a custom Partitioner.

   Apply an Aggregator to the values for each key with a custom Partitioner. requires a commutative Semigroup. To generalize to non-commutative, we need a sorted partition for T.

6. def aggregateByKey[K, V1, U, V2](agg: Aggregator[V1, U, V2])(implicit arg0: ClassTag[K], arg1: ClassTag[U], ev: <:<[T, (K, V1)], ordK: Priority[Ordering[K], DummyImplicit]): RDD[(K, V2)]

   

   Apply an Aggregator to the values for each key.

   Apply an Aggregator to the values for each key. requires a commutative Semigroup. To generalize to non-commutative, we need a sorted partition for T.

7. def aggregateOption[B, C](agg: Aggregator[T, B, C])(implicit arg0: ClassTag[B]): Option[C]

   

   Apply an Aggregator to return a single value for the whole RDD.

   Apply an Aggregator to return a single value for the whole RDD. If the RDD is empty, None is returned requires a commutative Semigroup. To generalize to non-commutative, we need a sorted partition for T.

8. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

9. def getClass(): Class[_ <: AnyVal]

   

   Definition Classes

   AnyVal → Any

10. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

11. val rdd: RDD[T]

    

12. def sum(implicit mon: Monoid[T], ct: ClassTag[T]): T

    

    Use the implicit Monoid to sum all items.

    Use the implicit Monoid to sum all items. If RDD is empty, Monoid.zero is returned requires a commutative Monoid. To generalize to non-commutative, we need a sorted partition for T.

13. def sumByKey[K, V](part: Partitioner)(implicit arg0: ClassTag[K], arg1: ClassTag[V], arg2: Semigroup[V], ev: <:<[T, (K, V)], ord: Priority[Ordering[K], DummyImplicit]): RDD[(K, V)]

    

    Use the implicit semigroup to sum by keys with a custom Partitioner.

    Use the implicit semigroup to sum by keys with a custom Partitioner. requires a commutative Semigroup. To generalize to non-commutative, we need a sorted partition for T. Unfortunately we need to use a different name than sumByKey in scala 2.11

14. def sumByKey[K, V](implicit arg0: ClassTag[K], arg1: ClassTag[V], arg2: Semigroup[V], ev: <:<[T, (K, V)], ord: Priority[Ordering[K], DummyImplicit]): RDD[(K, V)]

    

    Use the implicit semigroup to sum by keys requires a commutative Semigroup.

    Use the implicit semigroup to sum by keys requires a commutative Semigroup. To generalize to non-commutative, we need a sorted partition for T.

15. def sumOption(implicit sg: Semigroup[T], ct: ClassTag[T]): Option[T]

    

    Use the implicit Semigroup to sum all items.

    Use the implicit Semigroup to sum all items. If there are no items, None is returned. requires a commutative Monoid. To generalize to non-commutative, we need a sorted partition for T.

16. def toString(): String

    

    Definition Classes

    Any