WritableSequenceFile

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def andThen[U](fn: ((K, V)) ⇒ U): typed.TypedSource[U]

Transform this TypedSource into another by mapping after.

final def asInstanceOf[T0]: T0

def checkFlowDefNotNull()(implicit flowDef: FlowDef, mode: Mode): Unit

def clone(): AnyRef

def contraMap[U](fn: (U) ⇒ (K, V)): typed.TypedSink[U]

Transform this sink into another type by applying a function first

def converter[U >: (K, V)]: TupleConverter[U]

Because TupleConverter cannot be covariant, we need to jump through this hoop.

def createHdfsReadTap(hdfsMode: Hdfs): Tap[JobConf, _, _]

def createHfsTap(scheme: Scheme[JobConf, RecordReader[_, _], OutputCollector[_, _], _, _], path: String, sinkMode: SinkMode): Hfs

def createLocalTap(sinkMode: SinkMode): Tap[JobConf, _, _]

Creates a local tap.

def createTap(readOrWrite: AccessMode)(implicit mode: Mode): Tap[_, _, _]

Subclasses of Source MUST override this method.

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

val f: Fields

val fields: Fields

There are three allowed cases: fields.size == 1 and keyType == null fields.size == 1 and valueType == null fields.size == 2 and keyType != null and valueType != null

def finalize(): Unit

final def flatMapTo[U](out: Fields)(mf: ((K, V)) ⇒ TraversableOnce[U])(implicit flowDef: FlowDef, mode: Mode, setter: TupleSetter[U]): Pipe

If you want to filter, you should use this and output a 0 or 1 length Iterable.

final def getClass(): Class[_]

def goodHdfsPaths(hdfsMode: Hdfs): Iterable[String]

def hashCode(): Int

def hdfsPaths: Iterable[String]

def hdfsReadPathsAreGood(conf: Configuration): Boolean

def hdfsScheme: Scheme[JobConf, RecordReader[_, _], OutputCollector[_, _], _, _]

The scheme to use if the source is on hdfs.

def hdfsWritePath: String

final def isInstanceOf[T0]: Boolean

val keyType: Class[_ <: Writable]

def localPaths: Iterable[String]

A path to use for the local tap.

def localScheme: Scheme[Properties, InputStream, OutputStream, _, _]

The scheme to use if the source is local.

def localWritePath: String

final def mapTo[U](out: Fields)(mf: ((K, V)) ⇒ U)(implicit flowDef: FlowDef, mode: Mode, setter: TupleSetter[U]): Pipe

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

val p: String

def pathIsGood(globPattern: String, conf: Configuration): Boolean

Determines if a path is 'valid' for this source.

def read(implicit flowDef: FlowDef, mode: Mode): Pipe

def setter[U <: (K, V)]: TupleSetter[U]

def sinkFields: Fields

val sinkMode: SinkMode

def sourceFields: Fields

def sourceId: String

This is a name the refers to this exact instance of the source (put another way, if s1.sourceId == s2.sourceId, the job should work the same if one is replaced with the other

def stripTrailing(path: String): String

Similar in behavior to TimePathedSource.writePathFor.

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

def toIterator(implicit config: Config, mode: Mode): Iterator[(K, V)]

Allows you to read a Tap on the submit node NOT FOR USE IN THE MAPPERS OR REDUCERS.

def toString(): String

def transformForRead(pipe: Pipe): Pipe

def transformForWrite(pipe: Pipe): Pipe

def transformInTest: Boolean

The mock passed in to scalding.JobTest may be considered as a mock of the Tap or the Source.

def validateTaps(mode: Mode): Unit

val valueType: Class[_ <: Writable]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def writeFrom(pipe: Pipe)(implicit flowDef: FlowDef, mode: Mode): Pipe

write the pipe but return the input so it can be chained into the next operation

def readAtSubmitter[T](implicit mode: Mode, conv: TupleConverter[T]): Stream[T]