Relational

Value Members

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

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

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

   

   Definition Classes

   AnyRef → Any

4. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

5. def blockJoin[K, A, B](left: DList[(K, A)], right: DList[(K, B)], replicationFactor: Int = 5)(implicit arg0: WireFormat[K], arg1: Grouping[K], arg2: WireFormat[A], arg3: WireFormat[B]): DList[(K, (A, B))]

   

   Perform an equijoin using block-join (aka replicate fragment join).

   Perform an equijoin using block-join (aka replicate fragment join).

   Replicate the small (left) side n times including the id of the replica in the key. On the right side, add a random integer from 0...n-1 to the key. Join using the pseudo-key and strip out the extra fields.

   Useful for skewed join keys and large datasets.

6. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

7. def coGroup[K, A, B](d1: DList[(K, A)], d2: DList[(K, B)])(implicit arg0: WireFormat[K], arg1: Grouping[K], arg2: WireFormat[A], arg3: WireFormat[B]): DList[(K, (Iterable[A], Iterable[B]))]

   

   Perform a co-group of two (2) distributed lists

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

   

   Definition Classes

   AnyRef

9. def equals(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

10. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

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

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

    

    Definition Classes

    AnyRef → Any

12. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

13. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

14. def join[K, A, B](left: DList[(K, A)], right: DList[(K, B)])(implicit arg0: WireFormat[K], arg1: Grouping[K], arg2: WireFormat[A], arg3: WireFormat[B]): DList[(K, (A, B))]

    

    Perform an equijoin of two (2) distributed lists.

15. def joinFullOuter[K, A, B](l: DList[(K, A)], r: DList[(K, B)])(implicit arg0: WireFormat[K], arg1: Grouping[K], arg2: WireFormat[A], arg3: WireFormat[B]): DList[(K, (Option[A], Option[B]))]

    

    Perform a full outer-join of two distributed lists.

    Perform a full outer-join of two distributed lists. The default function specifies how to construct a A or B when there is none

16. def joinFullOuter[K, A, B, V](l: DList[(K, A)], r: DList[(K, B)], hasLeft: (K, A) ⇒ V, hasRight: (K, B) ⇒ V, hasBoth: (K, A, B) ⇒ V)(implicit arg0: WireFormat[K], arg1: Grouping[K], arg2: WireFormat[A], arg3: WireFormat[B], arg4: WireFormat[V]): DList[(K, V)]

    

    Perform a full outer-join of two distributed lists.

    Perform a full outer-join of two distributed lists. The default function specifies how to construct a A or B when there is none

17. def joinLeft[K, A, B](left: DList[(K, A)], right: DList[(K, B)])(implicit arg0: WireFormat[K], arg1: Grouping[K], arg2: WireFormat[A], arg3: WireFormat[B]): DList[(K, (A, Option[B]))]

    

    Perform a left outer-join of two (2) distributed lists.

    Perform a left outer-join of two (2) distributed lists. Note the return type of Option[B] for when there is no value in the right dlist (d1).

18. def joinRight[K, A, B](left: DList[(K, A)], right: DList[(K, B)])(implicit arg0: WireFormat[K], arg1: Grouping[K], arg2: WireFormat[A], arg3: WireFormat[B]): DList[(K, (Option[A], B))]

    

    Perform a right outer-join of two (2) distributed lists.

    Perform a right outer-join of two (2) distributed lists. Note the return type of Option[A] as when there is no value in the left dlist (d1) for a value on the right dlist (d2), it will return none.

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

    

    Definition Classes

    AnyRef

20. final def notify(): Unit

    

    Definition Classes

    AnyRef

21. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

22. def outerJoin[K, A, B](d1: DList[(K, A)], d2: DList[(K, B)])(implicit arg0: WireFormat[K], arg1: Grouping[K], arg2: WireFormat[A], arg3: WireFormat[B]): DList[(K, (A, Option[B]))]

    

    Perform a left outer-join of two (2) distributed lists.

    Perform a left outer-join of two (2) distributed lists. Note the return type of Option[B] for when there is no value in the right dlist (d1).

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

    

    Definition Classes

    AnyRef

24. def toString(): String

    

    Definition Classes

    AnyRef → Any

25. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )