OpenAddressHashArray

Instance Constructors

new OpenAddressHashArray(size: Int)(implicit manElem: ClassTag[V], zero: Zero[V])
new OpenAddressHashArray(size: Int, default: ConfigurableDefault[V])(implicit manElem: ClassTag[V], zero: Zero[V])
new OpenAddressHashArray(size: Int, default: ConfigurableDefault[V], initialSize: Int)(implicit manElem: ClassTag[V], zero: Zero[V])

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
var _data: Array[V]

Attributes
protected
var _index: Array[Int]

Attributes
protected
def activeIterator: Iterator[(Int, V)]
def activeKeysIterator: Iterator[Int]
def activeSize: Int

Mainly for marking the underlying data array extent in SparseVector/SparseArray
Mainly for marking the underlying data array extent in SparseVector/SparseArray

Definition Classes
OpenAddressHashArray → ArrayLike → Storage
def activeValuesIterator: Iterator[V]
def allVisitableIndicesActive: Boolean

Only gives true if isActive would return true for all i.
Only gives true if isActive would return true for all i. (May be false anyway)
returns

Definition Classes
OpenAddressHashArray → Storage
final def apply(i: Int): V

Definition Classes
OpenAddressHashArray → ArrayLike
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def contains(i: Int): Boolean
def copy: OpenAddressHashArray[V]
def data: Array[V]

Returns the actual flat array of elements used.
Returns the actual flat array of elements used.
returns

Definition Classes
OpenAddressHashArray → Storage
val default: ConfigurableDefault[V]
def defaultValue: V
final def eq(arg0: AnyRef): Boolean

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

Definition Classes
OpenAddressHashArray → AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
def foreach[U](f: (V) ⇒ U): Unit

Only iterates "active" elements.
Only iterates "active" elements. I'm not sure how I feel about this behavior, since it's inconsistent with the rest of Breeze. I will think on it.
U

f

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

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
OpenAddressHashArray → AnyRef → Any
def index: Array[Int]
def indexAt(i: Int): Int

Gives the logical index from the physical index.
Gives the logical index from the physical index.
i
returns

Definition Classes
OpenAddressHashArray → Storage
def isActive(i: Int): Boolean

Some storages (namely HashStorage) won't have active indices packed.
Some storages (namely HashStorage) won't have active indices packed. This lets you know if the bin is actively in use.
i
index into index/data arrays
returns

Definition Classes
OpenAddressHashArray → Storage
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def iterableSize: Int

How many elements must be iterated over using valueAt/indexAt.
How many elements must be iterated over using valueAt/indexAt.
returns

Definition Classes
OpenAddressHashArray → Storage
def iterator: Iterator[(Int, V)]

Only iterates "active" elements
Only iterates "active" elements

Definition Classes
ArrayLike
def keysIterator: Iterator[Int]

Only iterates "active" keys
Only iterates "active" keys

Definition Classes
OpenAddressHashArray → ArrayLike
def length: Int

Definition Classes
ArrayLike
var load: Int

Attributes
protected
implicit val manElem: ClassTag[V]

Attributes
protected
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 rehash(): Unit

Attributes
protected
val size: Int

How many elements are logically stored here.
How many elements are logically stored here. This may be <= activeSize.
returns

Definition Classes
OpenAddressHashArray → ArrayLike → Storage
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toArray[U >: V](implicit arg0: ClassTag[U]): Array[U]

Definition Classes
ArrayLike
def toIndexedSeq: List[V]

Definition Classes
ArrayLike
def toList: List[V]

Definition Classes
ArrayLike
def toMap: Map[Int, V]

Definition Classes
ArrayLike
def toString(): String

Definition Classes
OpenAddressHashArray → AnyRef → Any
final def update(i: Int, v: V): Unit

Definition Classes
OpenAddressHashArray → ArrayLike
def valueAt(i: Int): V

same as data(i).
same as data(i). Gives the value at the underlying offset.
i
index into the data array
returns

Definition Classes
OpenAddressHashArray → Storage
def valuesIterator: Iterator[V]

Only iterates "active" elements
Only iterates "active" elements

Definition Classes
OpenAddressHashArray → ArrayLike
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( ... )
implicit val zero: Zero[V]

final class OpenAddressHashArray[V] extends Storage[V] with ArrayLike[V] with Serializable

Instance Constructors

new OpenAddressHashArray(size: Int)(implicit manElem: ClassTag[V], zero: Zero[V])

new OpenAddressHashArray(size: Int, default: ConfigurableDefault[V])(implicit manElem: ClassTag[V], zero: Zero[V])

new OpenAddressHashArray(size: Int, default: ConfigurableDefault[V], initialSize: Int)(implicit manElem: ClassTag[V], zero: Zero[V])

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

var _data: Array[V]

var _index: Array[Int]

def activeIterator: Iterator[(Int, V)]

def activeKeysIterator: Iterator[Int]

def activeSize: Int

def activeValuesIterator: Iterator[V]

def allVisitableIndicesActive: Boolean

final def apply(i: Int): V

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def contains(i: Int): Boolean

def copy: OpenAddressHashArray[V]

def data: Array[V]

val default: ConfigurableDefault[V]

def defaultValue: V

final def eq(arg0: AnyRef): Boolean

def equals(that: Any): Boolean

def finalize(): Unit

def foreach[U](f: (V) ⇒ U): Unit

final def getClass(): Class[_]

def hashCode(): Int

def index: Array[Int]

def indexAt(i: Int): Int

def isActive(i: Int): Boolean

final def isInstanceOf[T0]: Boolean

def iterableSize: Int

def iterator: Iterator[(Int, V)]

def keysIterator: Iterator[Int]

def length: Int

var load: Int

implicit val manElem: ClassTag[V]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

final def rehash(): Unit

val size: Int

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

def toArray[U >: V](implicit arg0: ClassTag[U]): Array[U]

def toIndexedSeq: List[V]

def toList: List[V]

def toMap: Map[Int, V]

def toString(): String

final def update(i: Int, v: V): Unit

def valueAt(i: Int): V

def valuesIterator: Iterator[V]

final def wait(): Unit

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

final def wait(arg0: Long): Unit

implicit val zero: Zero[V]

Inherited from Serializable

Inherited from Serializable

Inherited from ArrayLike[V]

Inherited from Storage[V]

Inherited from AnyRef

Inherited from Any

Ungrouped