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[B](right: DList[(K, B)])(implicit arg0: WireFormat[B]): DList[(K, (A, B))]

   

   Perform an equijoin with another distributed list where this list is considerably smaller than the right (but too large to fit in memory), and where the keys of right may be particularly skewed.

6. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

7. def coGroup[B](right: DList[(K, B)])(implicit arg0: WireFormat[B]): DList[(K, (Iterable[A], Iterable[B]))]

   

   Perform a co-group with another distributed lists

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

   

   Definition Classes

   AnyRef

9. def finalize(): Unit

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

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

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

    

    Definition Classes

    AnyRef → Any

11. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

12. def join[B](right: DList[(K, B)])(implicit arg0: WireFormat[B]): DList[(K, (A, B))]

    

    Perform an equijoin with another distributed lists.

13. def joinFullOuter[B](right: DList[(K, B)])(implicit arg0: 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. Note how it returns an Option[A] and Option[B], but it shouldn't be possible for both to be None.

14. def joinFullOuter[B, V](right: DList[(K, B)], hasLeft: (K, A) ⇒ V, hasRight: (K, B) ⇒ V, hasBoth: (K, A, B) ⇒ V)(implicit arg0: WireFormat[B], arg1: 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. Note at least one of the A or B should exist

15. def joinLeft[B](right: DList[(K, B)])(implicit arg0: 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[A] as when there is no value in this dlist for a value on the right dlist, it will return none.

16. def joinRight[B](right: DList[(K, B)])(implicit arg0: 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 this dlist for a value on the right dlist, it will return none.

17. val left: DList[(K, A)]

    

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

    

    Definition Classes

    AnyRef

19. final def notify(): Unit

    

    Definition Classes

    AnyRef

20. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

21. def replicateBy(rep: Int): Relational[K, A]

    

    Specify a replication factor on the left DList of a block join.

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

    

    Definition Classes

    AnyRef

23. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )