TopKCMS

Instance Constructors

new TopKCMS(topKActual: Int, topKInternal: Int, depth: Int, width: Int, size: Long, hashA: Array[Long], table: Array[Array[Long]], confidence: Double, eps: Double)(implicit arg0: ClassTag[T])
new TopKCMS(topKActual: Int, topKInternal: Int, epsOfTotalCount: Double, confidence: Double, seed: Int)(implicit arg0: ClassTag[T])
new TopKCMS(topKActual: Int, topKInternal: Int, depth: Int, width: Int, hashA: Array[Long], confidence: Double, eps: Double)(implicit arg0: ClassTag[T])
new TopKCMS(topKActual: Int, topKInternal: Int, depth: Int, width: Int, seed: Int)(implicit arg0: ClassTag[T])
new TopKCMS(topKActual: Int, topKInternal: Int, depth: Int, width: Int, seed: Int, eps: Double, confidence: Double, size: Long, table: Array[Array[Long]], hashA: Array[Long], topkSet: BoundedSortedSet[T, Long])(implicit arg0: ClassTag[T])

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
def add(item: T, count: Long): Long

Returns the currrent total count for the key
Returns the currrent total count for the key

Definition Classes
TopKCMS → CountMinSketch
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): CountMinSketch[T]

Definition Classes
CountMinSketch → AnyRef
def compress: CountMinSketch[T]

TODO Should this compress in place? Returns a new CountMinSketch that has half the width of this CMS.
TODO Should this compress in place? Returns a new CountMinSketch that has half the width of this CMS. Each of the w/2 columns of the new CMS has the combined counts of the ith and ith+w/2 columns of this CMS. See the Hokusai paper for details.
returns
A new CountMinSketch that is the compressed version of this

Definition Classes
CountMinSketch
Annotations
@throws( ... )
Exceptions thrown
CMSCompressException if this CMS's width is not a power of two, or is too small.
val confidence: Double

Definition Classes
CountMinSketch
val depth: Int

Definition Classes
CountMinSketch
val eps: Double

Definition Classes
CountMinSketch
final def eq(arg0: AnyRef): Boolean

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

Definition Classes
AnyRef → Any
def estimateCount(item: T): Long

The estimate is correct within 'epsilon' * (total item count), with probability 'confidence'.
The estimate is correct within 'epsilon' * (total item count), with probability 'confidence'.

Definition Classes
CountMinSketch
def estimateCountAsApproximate(item: T): Approximate

Definition Classes
CountMinSketch
def finalize(): Unit

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

Definition Classes
AnyRef → Any
def getConfidence: Double

Definition Classes
CountMinSketch
def getFromTopKMap(key: T): Option[Approximate]
def getIHashesFor(item: T, applyWidth: Boolean): Array[Int]

Definition Classes
CountMinSketch
def getRelativeError: Double

Definition Classes
CountMinSketch
def getSize: Long

Definition Classes
CountMinSketch
def getTable: Array[Array[Long]]

Definition Classes
CountMinSketch
def getTopK: Array[(T, Approximate)]
def getTopKKeys: OpenHashSet[T]
def getTopKeys: Set[T]
val hashA: Array[Long]

Definition Classes
CountMinSketch
def hashCode(): Int

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

Definition Classes
Any
val isTuple: Boolean

Definition Classes
CountMinSketch
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
val seed: Int

Definition Classes
CountMinSketch
var size: Long

Definition Classes
CountMinSketch
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
val table: Array[Array[Long]]

Definition Classes
CountMinSketch
def toString(): String

Definition Classes
AnyRef → Any
val topKActual: Int
val topKInternal: Int
val topkSet: BoundedSortedSet[T, Long]
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( ... )
val width: Int

Definition Classes
CountMinSketch
def wrapAsApproximate(estimate: Long): Approximate

Definition Classes
CountMinSketch

Related Docs: object TopKCMS | package cms

final class TopKCMS[T] extends CountMinSketch[T]

Instance Constructors

new TopKCMS(topKActual: Int, topKInternal: Int, depth: Int, width: Int, size: Long, hashA: Array[Long], table: Array[Array[Long]], confidence: Double, eps: Double)(implicit arg0: ClassTag[T])

new TopKCMS(topKActual: Int, topKInternal: Int, epsOfTotalCount: Double, confidence: Double, seed: Int)(implicit arg0: ClassTag[T])

new TopKCMS(topKActual: Int, topKInternal: Int, depth: Int, width: Int, hashA: Array[Long], confidence: Double, eps: Double)(implicit arg0: ClassTag[T])

new TopKCMS(topKActual: Int, topKInternal: Int, depth: Int, width: Int, seed: Int)(implicit arg0: ClassTag[T])

new TopKCMS(topKActual: Int, topKInternal: Int, depth: Int, width: Int, seed: Int, eps: Double, confidence: Double, size: Long, table: Array[Array[Long]], hashA: Array[Long], topkSet: BoundedSortedSet[T, Long])(implicit arg0: ClassTag[T])

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def add(item: T, count: Long): Long

final def asInstanceOf[T0]: T0

def clone(): CountMinSketch[T]

def compress: CountMinSketch[T]

val confidence: Double

val depth: Int

val eps: Double

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def estimateCount(item: T): Long

def estimateCountAsApproximate(item: T): Approximate

def finalize(): Unit

final def getClass(): Class[_]

def getConfidence: Double

def getFromTopKMap(key: T): Option[Approximate]

def getIHashesFor(item: T, applyWidth: Boolean): Array[Int]

def getRelativeError: Double

def getSize: Long

def getTable: Array[Array[Long]]

def getTopK: Array[(T, Approximate)]

def getTopKKeys: OpenHashSet[T]

def getTopKeys: Set[T]

val hashA: Array[Long]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

val isTuple: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

val seed: Int

var size: Long

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

val table: Array[Array[Long]]

def toString(): String

val topKActual: Int

val topKInternal: Int

val topkSet: BoundedSortedSet[T, Long]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

val width: Int

def wrapAsApproximate(estimate: Long): Approximate

Inherited from CountMinSketch[T]

Inherited from AnyRef

Inherited from Any

Ungrouped