NIHDBSnapshot

Abstract Value Members

abstract def blockIds: Array[Long]
abstract def readers: Array[StorageReader]

Concrete 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 count(paths0: Option[Set[CPath]] = None): Long
def count(id: Option[Long], paths0: Option[Set[CPath]]): Option[Long]

Returns the total number of defined objects for a given CPath *mask*.
Returns the total number of defined objects for a given CPath *mask*. Since this punches holes in our rows, it is not simply the length of the block. Instead we count the number of rows that have at least one defined value at each path (and their children).
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 findReader(id0: Option[Long]): Option[StorageReader]

Attributes
protected[this]
def findReaderAfter(id0: Option[Long]): Option[StorageReader]

Attributes
protected[this]
def getBlock(id0: Option[Long], cols: Option[Set[CPath]]): Option[Block]
def getBlockAfter(id0: Option[Long], cols: Option[Set[ColumnRef]]): Option[Block]
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def getConstraints(columns: Iterable[ColumnRef], cpaths: Set[CPath]): Iterable[CPath]
def hashCode(): Int

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

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

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def reduce[A](reduction: Reduction[A], path: CPath): Map[CType, A]
def structure: Set[ColumnRef]
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 NIHDBSnapshot | package niflheim

trait NIHDBSnapshot extends AnyRef

Abstract Value Members

abstract def blockIds: Array[Long]

abstract def readers: Array[StorageReader]

Concrete Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def count(paths0: Option[Set[CPath]] = None): Long

def count(id: Option[Long], paths0: Option[Set[CPath]]): Option[Long]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def findReader(id0: Option[Long]): Option[StorageReader]

def findReaderAfter(id0: Option[Long]): Option[StorageReader]

def getBlock(id0: Option[Long], cols: Option[Set[CPath]]): Option[Block]

def getBlockAfter(id0: Option[Long], cols: Option[Set[ColumnRef]]): Option[Block]

final def getClass(): Class[_]

def getConstraints(columns: Iterable[ColumnRef], cpaths: Set[CPath]): Iterable[CPath]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

val logger: Logger

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def reduce[A](reduction: Reduction[A], path: CPath): Map[CType, A]

def structure: Set[ColumnRef]

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