Sketched

Instance Constructors

new Sketched(pipe: TypedPipe[(K, V)], numReducers: Int, delta: Double, eps: Double, seed: Int)(implicit serialization: (K) ⇒ Array[Byte], ordering: Ordering[K])

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

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

Definition Classes
AnyRef → Any
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def cogroup[V2, R](right: TypedPipe[(K, V2)])(joiner: (K, V, Iterable[V2]) ⇒ Iterator[R]): SketchJoined[K, V, V2, R]

Like a hashJoin, this joiner does not see all the values V at one time, only one at a time.
Like a hashJoin, this joiner does not see all the values V at one time, only one at a time. This is sufficient to implement join and leftJoin
val delta: Double
val eps: Double
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def finalize(): Unit

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

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

Definition Classes
Any
def join[V2](right: TypedPipe[(K, V2)]): SketchJoined[K, V, V2, (V, V2)]

Does a logical inner join but replicates the heavy keys of the left hand side across the reducers
def leftJoin[V2](right: TypedPipe[(K, V2)]): SketchJoined[K, V, V2, (V, Option[V2])]

Does a logical left join but replicates the heavy keys of the left hand side across the reducers
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
val numReducers: Int
val pipe: TypedPipe[(K, V)]
def reducers: Some[Int]

Definition Classes
Sketched → MustHaveReducers → HasReducers
val seed: Int
def serialize(k: K): Array[Byte]
lazy val sketch: TypedPipe[CMS[Bytes]]
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
final def wait(): Unit

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

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

Definition Classes
AnyRef
Annotations
@throws( ... )

Related Doc: package typed

case class Sketched[K, V](pipe: TypedPipe[(K, V)], numReducers: Int, delta: Double, eps: Double, seed: Int)(implicit serialization: (K) ⇒ Array[Byte], ordering: Ordering[K]) extends MustHaveReducers with Product with Serializable

Instance Constructors

new Sketched(pipe: TypedPipe[(K, V)], numReducers: Int, delta: Double, eps: Double, seed: Int)(implicit serialization: (K) ⇒ Array[Byte], ordering: Ordering[K])

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def cogroup[V2, R](right: TypedPipe[(K, V2)])(joiner: (K, V, Iterable[V2]) ⇒ Iterator[R]): SketchJoined[K, V, V2, R]

val delta: Double

val eps: Double

final def eq(arg0: AnyRef): Boolean

def finalize(): Unit

final def getClass(): Class[_]

final def isInstanceOf[T0]: Boolean

def join[V2](right: TypedPipe[(K, V2)]): SketchJoined[K, V, V2, (V, V2)]

def leftJoin[V2](right: TypedPipe[(K, V2)]): SketchJoined[K, V, V2, (V, Option[V2])]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

val numReducers: Int

val pipe: TypedPipe[(K, V)]

def reducers: Some[Int]

val seed: Int

def serialize(k: K): Array[Byte]

lazy val sketch: TypedPipe[CMS[Bytes]]

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

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from MustHaveReducers

Inherited from HasReducers

Inherited from AnyRef

Inherited from Any

Ungrouped