SliceIndex

Provide fast access to a subslice based on one or more group key values.

The SliceIndex currently uses in-memory data structures, although this will have to change eventually. A "group key value" is defined as an (Int, RValue). The Int part corresponds to the key in the sequence of transforms used to build the index, and the RValue part corresponds to the value we want the key to have.

SliceIndex is able to create subslices without rescanning the underlying slice due to the fact that it already knows which rows are valid for particular key combinations. For best results valueSlice should already be materialized.

Self Type: ColumnarTableModule.SliceIndex

Linear Supertypes

AnyRef, Any

Instance Constructors

new SliceIndex(vals: Map[Int, Set[RValue]], dict: Map[(Int, RValue), ArrayIntList], keyset: Set[Seq[RValue]], valueSlice: Slice)

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( ... )
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] )
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def getSubTable(keyIds: Seq[Int], keyValues: Seq[RValue]): ColumnarTableModule.Table

Return the subtable where each group key in keyIds is set to the corresponding value in keyValues.
def getUniqueKeys(): Set[Seq[RValue]]

Return the set of value combinations we've seen.
def getUniqueKeys(keyId: Int): Set[RValue]

Return the set of values we've seen for this group key.
def hashCode(): Int

Definition Classes
AnyRef → Any
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
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 Docs: object SliceIndex | package IndicesModule

class SliceIndex extends AnyRef

Instance Constructors

new SliceIndex(vals: Map[Int, Set[RValue]], dict: Map[(Int, RValue), ArrayIntList], keyset: Set[Seq[RValue]], valueSlice: Slice)

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def getSubTable(keyIds: Seq[Int], keyValues: Seq[RValue]): ColumnarTableModule.Table

def getUniqueKeys(): Set[Seq[RValue]]

def getUniqueKeys(keyId: Int): Set[RValue]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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 AnyRef

Inherited from Any

Ungrouped