com.twitter.summingbird

TestGraphs

object TestGraphs

Helpful functions and test graphs designed to flex Summingbird planners.

Source
TestGraphs.scala
Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. TestGraphs
  2. AnyRef
  3. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Value Members

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

    Definition Classes
    AnyRef
  2. final def !=(arg0: Any): Boolean

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

    Definition Classes
    AnyRef → Any
  4. final def ==(arg0: AnyRef): Boolean

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

    Definition Classes
    Any
  6. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  7. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  8. def diamondJob[P <: Platform[P], T, K, V](source: Producer[P, T], sink: TestGraphs.diamondJob.P.Sink[T], store: TestGraphs.diamondJob.P.Store[K, V])(fnA: (T) ⇒ TraversableOnce[(K, V)])(fnB: (T) ⇒ TraversableOnce[(K, V)])(implicit arg0: Monoid[V]): TailProducer[P, (K, (Option[V], V))]

  9. def diamondJobInScala[T, K, V](source: TraversableOnce[T])(fnA: (T) ⇒ TraversableOnce[(K, V)])(fnB: (T) ⇒ TraversableOnce[(K, V)])(implicit arg0: Monoid[V]): Map[K, V]

  10. implicit def eitherOrd[T, U]: Ordering[Either[T, U]]

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

    Definition Classes
    AnyRef
  12. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any
  13. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  14. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  15. def hashCode(): Int

    Definition Classes
    AnyRef → Any
  16. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  17. def jobWithStats[P <: Platform[P], T, K, V](id: JobId, source: Producer[P, T], store: TestGraphs.jobWithStats.P.Store[K, V])(fn: (T) ⇒ TraversableOnce[(K, V)])(implicit arg0: Monoid[V]): TailProducer[P, (K, (Option[V], V))]

  18. def leftJoinInScala[T, U, JoinedU, K, V](source: TraversableOnce[T])(service: (K) ⇒ Option[JoinedU])(preJoinFn: (T) ⇒ TraversableOnce[(K, U)])(postJoinFn: ((K, (U, Option[JoinedU]))) ⇒ TraversableOnce[(K, V)])(implicit arg0: Monoid[V]): Map[K, V]

  19. def leftJoinJob[P <: Platform[P], T, U, JoinedU, K, V](source: Producer[P, T], service: TestGraphs.leftJoinJob.P.Service[K, JoinedU], store: TestGraphs.leftJoinJob.P.Store[K, V])(preJoinFn: (T) ⇒ TraversableOnce[(K, U)])(postJoinFn: ((K, (U, Option[JoinedU]))) ⇒ TraversableOnce[(K, V)])(implicit arg0: Monoid[V]): TailProducer[P, (K, (Option[V], V))]

  20. def leftJoinJobWithFlatMapValues[P <: Platform[P], T, U, JoinedU, K, V](source: Producer[P, T], service: TestGraphs.leftJoinJobWithFlatMapValues.P.Service[K, JoinedU], store: TestGraphs.leftJoinJobWithFlatMapValues.P.Store[K, V])(preJoinFn: (T) ⇒ TraversableOnce[(K, U)])(postJoinFn: ((U, Option[JoinedU])) ⇒ TraversableOnce[V])(implicit arg0: Monoid[V]): TailProducer[P, (K, (Option[V], V))]

  21. def leftJoinWithDependentStoreInScala[T, U, K, V](source: TraversableOnce[T])(simpleFM: (T) ⇒ TraversableOnce[(Long, (K, U))])(flatMapValuesFn: ((Long, (U, Option[V]))) ⇒ TraversableOnce[(Long, V)])(implicit arg0: Ordering[K], arg1: Monoid[V]): Map[K, V]

  22. def leftJoinWithDependentStoreJob[P <: Platform[P], T, V1, U, K, V](source1: Producer[P, T], storeAndService: TestGraphs.leftJoinWithDependentStoreJob.P.Store[K, V] with TestGraphs.leftJoinWithDependentStoreJob.P.Service[K, V])(simpleFM1: (T) ⇒ TraversableOnce[(K, U)])(valuesFlatMap1: ((U, Option[V])) ⇒ TraversableOnce[V1])(valuesFlatMap2: (V1) ⇒ TraversableOnce[V])(implicit arg0: Monoid[V]): TailProducer[P, (K, (Option[V], V))]

  23. def leftJoinWithDependentStoreJoinFanoutInScala[T, U, K, V, V1](source: TraversableOnce[T])(simpleFM: (T) ⇒ TraversableOnce[(Long, (K, U))])(flatMapValuesFn: ((Long, (U, Option[V]))) ⇒ TraversableOnce[(Long, V)])(flatMapFn: ((Long, (K, (U, Option[V])))) ⇒ TraversableOnce[(Long, (K, V1))])(implicit arg0: Ordering[K], arg1: Monoid[V], arg2: Monoid[V1]): (Map[K, V], Map[K, V1])

  24. def leftJoinWithDependentStoreJoinFanoutJob[P <: Platform[P], T1, V1, U, K, V](source1: Producer[P, T1], storeAndService: TestGraphs.leftJoinWithDependentStoreJoinFanoutJob.P.Store[K, V] with TestGraphs.leftJoinWithDependentStoreJoinFanoutJob.P.Service[K, V], store: TestGraphs.leftJoinWithDependentStoreJoinFanoutJob.P.Store[K, V1])(simpleFM1: (T1) ⇒ TraversableOnce[(K, U)])(valuesFlatMap1: ((U, Option[V])) ⇒ TraversableOnce[V])(flatMapFn: ((K, (U, Option[V]))) ⇒ TraversableOnce[(K, V1)])(implicit arg0: Monoid[V1], arg1: Monoid[V]): TailProducer[P, (K, (Option[V], V))]

  25. def leftJoinWithFlatMapValuesInScala[T, U, JoinedU, K, V](source: TraversableOnce[T])(service: (K) ⇒ Option[JoinedU])(preJoinFn: (T) ⇒ TraversableOnce[(K, U)])(postJoinFn: ((U, Option[JoinedU])) ⇒ TraversableOnce[V])(implicit arg0: Monoid[V]): Map[K, V]

  26. def leftJoinWithStoreInScala[T1, T2, U, JoinedU, K, V](source1: TraversableOnce[T1], source2: TraversableOnce[T2])(simpleFM1: (T1) ⇒ TraversableOnce[(Long, (K, JoinedU))])(simpleFM2: (T2) ⇒ TraversableOnce[(Long, (K, U))])(postJoinFn: ((Long, (K, (U, Option[JoinedU])))) ⇒ TraversableOnce[(Long, (K, V))])(implicit arg0: Monoid[JoinedU], arg1: Ordering[K], arg2: Monoid[V]): (Map[K, JoinedU], Map[K, V])

  27. def leftJoinWithStoreJob[P <: Platform[P], T1, T2, U, K, JoinedU, V](source1: Producer[P, T1], source2: Producer[P, T2], storeAndService: TestGraphs.leftJoinWithStoreJob.P.Store[K, JoinedU] with TestGraphs.leftJoinWithStoreJob.P.Service[K, JoinedU], store: TestGraphs.leftJoinWithStoreJob.P.Store[K, V])(simpleFM1: (T1) ⇒ TraversableOnce[(K, JoinedU)])(simpleFM2: (T2) ⇒ TraversableOnce[(K, U)])(postJoinFn: ((K, (U, Option[JoinedU]))) ⇒ TraversableOnce[(K, V)])(implicit arg0: Monoid[JoinedU], arg1: Monoid[V]): TailProducer[P, (K, (Option[V], V))]

  28. def lookupJob[P <: Platform[P], T, U](source: Producer[P, T], srv: TestGraphs.lookupJob.P.Service[T, U], sink: TestGraphs.lookupJob.P.Sink[(T, U)]): TailProducer[P, (T, U)]

  29. def lookupJobInScala[T, U](in: List[T], srv: (T) ⇒ Option[U]): List[(T, U)]

  30. def mapOnlyJob[P <: Platform[P], T, U](source: Producer[P, T], sink: TestGraphs.mapOnlyJob.P.Sink[U])(mapOp: (T) ⇒ TraversableOnce[U]): TailProducer[P, U]

  31. def multipleSummerJob[P <: Platform[P], T1, T2, K1, V1, K2, V2](source: Producer[P, T1], store1: TestGraphs.multipleSummerJob.P.Store[K1, V1], store2: TestGraphs.multipleSummerJob.P.Store[K2, V2])(fnR: (T1) ⇒ TraversableOnce[T2], fnA: (T2) ⇒ TraversableOnce[(K1, V1)], fnB: (T2) ⇒ TraversableOnce[(K2, V2)])(implicit arg0: Monoid[V1], arg1: Monoid[V2]): TailProducer[P, (K2, (Option[V2], V2))]

  32. def multipleSummerJobInScala[T1, T2, K1, V1, K2, V2](source: List[T1])(fnR: (T1) ⇒ TraversableOnce[T2], fnA: (T2) ⇒ TraversableOnce[(K1, V1)], fnB: (T2) ⇒ TraversableOnce[(K2, V2)])(implicit arg0: Monoid[V1], arg1: Monoid[V2]): (Map[K1, V1], Map[K2, V2])

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

    Definition Classes
    AnyRef
  34. final def notify(): Unit

    Definition Classes
    AnyRef
  35. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  36. def realJoinTestJob[P <: Platform[P], T1, T2, T3, T4, K1, K2, U, JoinedU, V](source1: Producer[P, T1], source2: Producer[P, T2], source3: Producer[P, T3], source4: Producer[P, T4], service: TestGraphs.realJoinTestJob.P.Service[K1, JoinedU], store: TestGraphs.realJoinTestJob.P.Store[K2, V], simpleFM1: (T1) ⇒ TraversableOnce[(K2, V)], simpleFM2: (T2) ⇒ TraversableOnce[(K2, V)], simpleFM3: (T3) ⇒ TraversableOnce[(K2, V)], preJoin: (T4) ⇒ (K1, U), postJoin: ((K1, (U, Option[JoinedU]))) ⇒ TraversableOnce[(K2, V)])(implicit arg0: Monoid[V]): TailProducer[P, (K2, (Option[V], V))]

  37. def realJoinTestJobInScala[P <: Platform[P], T1, T2, T3, T4, K1, K2, U, JoinedU, V](source1: List[T1], source2: List[T2], source3: List[T3], source4: List[T4], service: (K1) ⇒ Option[JoinedU], simpleFM1: (T1) ⇒ TraversableOnce[(K2, V)], simpleFM2: (T2) ⇒ TraversableOnce[(K2, V)], simpleFM3: (T3) ⇒ TraversableOnce[(K2, V)], preJoin: (T4) ⇒ (K1, U), postJoin: ((K1, (U, Option[JoinedU]))) ⇒ TraversableOnce[(K2, V)])(implicit arg0: Monoid[V]): Map[K2, V]

  38. def repeatedTupleLeftJoinInScala[T, U, JoinedU, K, V](source: TraversableOnce[T])(service: (K) ⇒ Option[JoinedU])(preJoinFn: (T) ⇒ TraversableOnce[(K, U)])(postJoinFn: ((K, (U, Option[JoinedU]))) ⇒ TraversableOnce[(K, V)])(implicit arg0: Monoid[V]): Map[K, V]

  39. def repeatedTupleLeftJoinJob[P <: Platform[P], T, U, JoinedU, K, V](source: Producer[P, T], service: TestGraphs.repeatedTupleLeftJoinJob.P.Service[K, JoinedU], store: TestGraphs.repeatedTupleLeftJoinJob.P.Store[K, V])(preJoinFn: (T) ⇒ TraversableOnce[(K, U)])(postJoinFn: ((K, (U, Option[JoinedU]))) ⇒ TraversableOnce[(K, V)])(implicit arg0: Monoid[V]): TailProducer[P, (K, (Option[V], V))]

  40. def singleStepInScala[T, K, V](source: TraversableOnce[T])(fn: (T) ⇒ TraversableOnce[(K, V)])(implicit arg0: Monoid[V]): Map[K, V]

  41. def singleStepJob[P <: Platform[P], T, K, V](source: Producer[P, T], store: TestGraphs.singleStepJob.P.Store[K, V])(fn: (T) ⇒ TraversableOnce[(K, V)])(implicit arg0: Monoid[V]): TailProducer[P, (K, (Option[V], V))]

  42. def singleStepMapKeysInScala[T, K1, K2, V](source: TraversableOnce[T])(fnA: (T) ⇒ TraversableOnce[(K1, V)], fnB: (K1) ⇒ TraversableOnce[K2])(implicit arg0: Monoid[V]): Map[K2, V]

  43. def singleStepMapKeysJob[P <: Platform[P], T, K1, K2, V](source: Producer[P, T], store: TestGraphs.singleStepMapKeysJob.P.Store[K2, V])(fnA: (T) ⇒ TraversableOnce[(K1, V)], fnB: (K1) ⇒ TraversableOnce[K2])(implicit arg0: Monoid[V]): TailProducer[P, (K2, (Option[V], V))]

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

    Definition Classes
    AnyRef
  45. def toString(): String

    Definition Classes
    AnyRef → Any
  46. def twinStepOptionMapFlatMapJob[P <: Platform[P], T1, T2, K, V](source: Producer[P, T1], store: TestGraphs.twinStepOptionMapFlatMapJob.P.Store[K, V])(fnA: (T1) ⇒ Option[T2], fnB: (T2) ⇒ TraversableOnce[(K, V)])(implicit arg0: Monoid[V]): TailProducer[P, (K, (Option[V], V))]

  47. def twinStepOptionMapFlatMapScala[T1, T2, K, V](source: TraversableOnce[T1])(fnA: (T1) ⇒ Option[T2], fnB: (T2) ⇒ TraversableOnce[(K, V)])(implicit arg0: Monoid[V]): Map[K, V]

  48. def twoSumByKey[P <: Platform[P], K, V, K2](source: Producer[P, (K, V)], store: TestGraphs.twoSumByKey.P.Store[K, V], fn: (K) ⇒ List[K2], store2: TestGraphs.twoSumByKey.P.Store[K2, V])(implicit arg0: Monoid[V]): TailProducer[P, (K2, (Option[V], V))]

  49. def twoSumByKeyInScala[K1, V, K2](in: List[(K1, V)], fn: (K1) ⇒ List[K2])(implicit arg0: Semigroup[V]): (Map[K1, V], Map[K2, V])

  50. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  51. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  52. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  53. def writtenPostSum[P <: Platform[P], T, K, V](source: Producer[P, T], sink: TestGraphs.writtenPostSum.P.Sink[(K, (Option[V], V))], store: TestGraphs.writtenPostSum.P.Store[K, V])(fnA: (T) ⇒ TraversableOnce[(K, V)])(implicit arg0: Monoid[V]): TailProducer[P, (K, (Option[V], V))]

Inherited from AnyRef

Inherited from Any

Ungrouped