SparseRankScaner

Instance Constructors

new SparseRankScaner()

Type Members

type A = RankContext

Definition Classes
BaseRankScanner → CScanner
case class RankContext(curr: Long, next: Long, items: Iterable[(ColumnRef, CValue)]) extends Product with Serializable

Represents the state of the scanner at the end of a slice.
Represents the state of the scanner at the end of a slice.
The n is the last rank number used (-1 means we haven't started). The iterable items are the refs/cvalues defined by that row (which will only be empty when we haven't started).

Definition Classes
BaseRankScanner

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 buildRankArrayUnique(defined: BitSet, duplicateRows: BitSet, r: Range, ctxt: RankContext): (Array[Long], Long, Long)

Definition Classes
SparseRankScaner → UniqueRankScanner
def buildRankContext(m: Map[ColumnRef, Column], lastRow: Int, curr: Long, next: Long): RankContext

Definition Classes
BaseRankScanner
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def decimalize(m: Map[ColumnRef, Column], r: Range): Map[ColumnRef, Column]

Attributes
protected
Definition Classes
BaseRankScanner
final def eq(arg0: AnyRef): Boolean

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

Definition Classes
AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
def findDuplicates(defined: BitSet, definedCols: Array[BitSet], cols: Array[Column], r: Range, _row: Int): (BitSet, Int)

Definition Classes
UniqueRankScanner
def findFirstDefined(defined: BitSet, r: Range): Int

Definition Classes
BaseRankScanner
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
def init: RankContext

Definition Classes
BaseRankScanner → CScanner
def initDefined(definedCols: Array[BitSet]): BitSet

Builds a bitset with a boolean value for each row.
Builds a bitset with a boolean value for each row. This value for a row will be true if at least one column is defined for that row and false otherwise.

Definition Classes
BaseRankScanner
def initDefinedCols(cols: Array[Column], r: Range): Array[BitSet]

Builds a bitset for each column we were given.
Builds a bitset for each column we were given. Each bitset contains (end-start) boolean values.

Definition Classes
BaseRankScanner
final def isInstanceOf[T0]: Boolean

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

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def scan(ctxt: RankContext, _m: Map[ColumnRef, Column], range: Range): (RankContext, Map[ColumnRef, Column])

Definition Classes
UniqueRankScanner → CScanner
def shiftColumn(col: Column, start: Int): Column

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

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
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 StatsLib

class SparseRankScaner extends UniqueRankScanner

Instance Constructors

new SparseRankScaner()

Type Members

type A = RankContext

case class RankContext(curr: Long, next: Long, items: Iterable[(ColumnRef, CValue)]) extends Product with Serializable

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def buildRankArrayUnique(defined: BitSet, duplicateRows: BitSet, r: Range, ctxt: RankContext): (Array[Long], Long, Long)

def buildRankContext(m: Map[ColumnRef, Column], lastRow: Int, curr: Long, next: Long): RankContext

def clone(): AnyRef

def decimalize(m: Map[ColumnRef, Column], r: Range): Map[ColumnRef, Column]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def findDuplicates(defined: BitSet, definedCols: Array[BitSet], cols: Array[Column], r: Range, _row: Int): (BitSet, Int)

def findFirstDefined(defined: BitSet, r: Range): Int

final def getClass(): Class[_]

def hashCode(): Int

def init: RankContext

def initDefined(definedCols: Array[BitSet]): BitSet

def initDefinedCols(cols: Array[Column], r: Range): Array[BitSet]

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def scan(ctxt: RankContext, _m: Map[ColumnRef, Column], range: Range): (RankContext, Map[ColumnRef, Column])

def shiftColumn(col: Column, start: Int): Column

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

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from UniqueRankScanner

Inherited from BaseRankScanner

Inherited from CScanner

Inherited from AnyRef

Inherited from Any

Ungrouped