object
TestGraphs
Value Members
-
final
def
!=(arg0: AnyRef): Boolean
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: AnyRef): Boolean
-
final
def
==(arg0: Any): Boolean
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
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))]
-
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]
-
implicit
def
eitherOrd[T, U]: Ordering[Either[T, U]]
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
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))]
-
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]
-
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))]
-
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))]
-
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]
-
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))]
-
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])
-
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))]
-
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]
-
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])
-
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))]
-
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)]
-
def
lookupJobInScala[T, U](in: List[T], srv: (T) ⇒ Option[U]): List[(T, U)]
-
def
mapOnlyJob[P <: Platform[P], T, U](source: Producer[P, T], sink: TestGraphs.mapOnlyJob.P.Sink[U])(mapOp: (T) ⇒ TraversableOnce[U]): TailProducer[P, U]
-
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))]
-
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])
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
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))]
-
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]
-
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]
-
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))]
-
def
singleStepInScala[T, K, V](source: TraversableOnce[T])(fn: (T) ⇒ TraversableOnce[(K, V)])(implicit arg0: Monoid[V]): Map[K, V]
-
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))]
-
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]
-
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))]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
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))]
-
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]
-
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))]
-
def
twoSumByKeyInScala[K1, V, K2](in: List[(K1, V)], fn: (K1) ⇒ List[K2])(implicit arg0: Semigroup[V]): (Map[K1, V], Map[K2, V])
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
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
Helpful functions and test graphs designed to flex Summingbird planners.