com.twitter.scalding

TypedPipe

class TypedPipe[+T] extends Serializable

Represents a phase in a distributed computation on an input data source Wraps a cascading Pipe object, and holds the transformation done up until that point

Linear Supertypes
Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. TypedPipe
  2. Serializable
  3. AnyRef
  4. 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. def ++[U >: T](other: TypedPipe[U]): TypedPipe[U]

  5. final def ==(arg0: AnyRef): Boolean

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

    Definition Classes
    Any
  7. def aggregate[U >: T, B, C](agg: Aggregator[U, B, C]): TypedPipe[C]

    Same as groupAll.

    Same as groupAll.aggregate.values

  8. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  9. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()
  10. def cross[U](tiny: TypedPipe[U]): TypedPipe[(T, U)]

  11. def debug: TypedPipe[T]

  12. def distinct(implicit ord: Ordering[_ >: T]): TypedPipe[T]

    Returns the set of distinct elements in the TypedPipe

    Returns the set of distinct elements in the TypedPipe

    Annotations
    @implicitNotFound( ... )
  13. final def eq(arg0: AnyRef): Boolean

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

    Definition Classes
    AnyRef → Any
  15. def filter(f: (T) ⇒ Boolean): TypedPipe[T]

    Keep only items satisfying a predicate

  16. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws()
  17. def flatMap[U](f: (T) ⇒ Iterable[U]): TypedPipe[U]

  18. def flatten[U](implicit ev: <:<[T, Iterable[U]]): TypedPipe[U]

    flatten an Iterable

  19. lazy val forceToDisk: TypedPipe[T]

    Force a materialization of this pipe prior to the next operation.

    Force a materialization of this pipe prior to the next operation. This is useful if you filter almost everything before a hashJoin, for instance.

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

    Definition Classes
    AnyRef → Any
  21. def group[K, V](implicit ev: <:<[T, (K, V)], ord: Ordering[K]): Grouped[K, V]

  22. lazy val groupAll: Grouped[Unit, T]

  23. def groupBy[K](g: (T) ⇒ K)(implicit ord: Ordering[K]): Grouped[K, T]

  24. def hashCode(): Int

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

    Definition Classes
    Any
  26. def keys[K](implicit ev: <:<[T, Tuple2[K, _]]): TypedPipe[K]

  27. def limit(count: Int): TypedPipe[T]

    limit the output to at most count items.

    limit the output to at most count items. useful for debugging, but probably that's about it. The number may be less than count, and not sampled particular method

  28. def map[U](f: (T) ⇒ U): TypedPipe[U]

  29. def mapValues[K, V, U](f: (V) ⇒ U)(implicit ev: <:<[T, (K, V)]): TypedPipe[(K, U)]

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

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

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

    Definition Classes
    AnyRef
  33. lazy val pipe: Pipe

    This actually runs all the pure map functions in one Cascading Each This approach is more efficient than untyped scalding because we don't use TupleConverters/Setters after each map.

    This actually runs all the pure map functions in one Cascading Each This approach is more efficient than untyped scalding because we don't use TupleConverters/Setters after each map. The output pipe has a single item CTuple with an object of type T in position 0

    Attributes
    protected
  34. def sum[U >: T](implicit plus: Monoid[U]): TypedPipe[U]

    Reasonably common shortcut for cases of associative/commutative reduction returns a typed pipe with only one element.

  35. def swap[K, V](implicit ev: <:<[T, (K, V)]): TypedPipe[(V, K)]

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

    Definition Classes
    AnyRef
  37. def toPipe(fieldNames: Fields)(implicit setter: TupleSetter[T]): Pipe

  38. def toString(): String

    Definition Classes
    AnyRef → Any
  39. def unpackToPipe(fieldNames: Fields)(implicit up: TupleUnpacker[T]): Pipe

  40. def values[V](implicit ev: <:<[T, Tuple2[_, V]]): TypedPipe[V]

  41. final def wait(): Unit

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws()
  44. def write[U >: T](dest: Mappable[U])(implicit conv: TupleConverter[U], setter: TupleSetter[T], flowDef: FlowDef, mode: Mode): TypedPipe[U]

    Safely write to a Mappable[U].

    Safely write to a Mappable[U]. If you want to write to a Source (not mappable) you need to do something like: toPipe(fieldNames).write(dest)

    returns

    a pipe equivalent to the current pipe.

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped