breeze.collection.mutable

OpenAddressHashArray

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

This is a Sparse Array implementation backed by a linear-probing open address hash table.

Annotations
@SerialVersionUID( 1L )
Linear Supertypes
Serializable, Serializable, ArrayLike[Elem], Storage[Elem], AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. OpenAddressHashArray
  2. Serializable
  3. Serializable
  4. ArrayLike
  5. Storage
  6. AnyRef
  7. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new OpenAddressHashArray(size: Int)(implicit manElem: ClassTag[Elem], defaultArrayValue: DefaultArrayValue[Elem])

  2. new OpenAddressHashArray(size: Int, default: ConfigurableDefault[Elem])(implicit manElem: ClassTag[Elem], defaultArrayValue: DefaultArrayValue[Elem])

  3. new OpenAddressHashArray(size: Int, default: ConfigurableDefault[Elem], initialSize: Int)(implicit manElem: ClassTag[Elem], defaultArrayValue: DefaultArrayValue[Elem])

Value Members

  1. final def !=(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any
  3. final def ##(): Int

    Definition Classes
    AnyRef → Any
  4. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  5. final def ==(arg0: Any): Boolean

    Definition Classes
    Any
  6. var _data: Array[Elem]

    Attributes
    protected
  7. var _index: Array[Int]

    Attributes
    protected
  8. def activeIterator: Iterator[(Int, Elem)]

  9. def activeKeysIterator: Iterator[Int]

  10. def activeSize: Int

    How many elements are stored in terms of space.

    How many elements are stored in terms of space.

    returns

    Definition Classes
    OpenAddressHashArrayArrayLikeStorage
  11. def activeValuesIterator: Iterator[Elem]

  12. 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
    OpenAddressHashArrayStorage
  13. final def apply(i: Int): Elem

    Definition Classes
    OpenAddressHashArrayArrayLike
  14. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  15. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  16. def contains(i: Int): Boolean

  17. def copy: OpenAddressHashArray[Elem]

  18. def data: Array[Elem]

    Returns the actual flat array of elements used.

    Returns the actual flat array of elements used.

    returns

    Definition Classes
    OpenAddressHashArrayStorage
  19. val default: ConfigurableDefault[Elem]

  20. implicit val defaultArrayValue: DefaultArrayValue[Elem]

  21. def defaultValue: Elem

  22. final def eq(arg0: AnyRef): Boolean

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

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

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  25. def foreach[U](f: (Elem) ⇒ 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
  26. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  27. def hashCode(): Int

    Definition Classes
    OpenAddressHashArray → AnyRef → Any
  28. def index: Array[Int]

  29. 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
    OpenAddressHashArrayStorage
  30. 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
    OpenAddressHashArrayStorage
  31. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  32. 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
    OpenAddressHashArrayStorage
  33. def iterator: Iterator[(Int, Elem)]

    Only iterates "active" elements

    Only iterates "active" elements

    Definition Classes
    ArrayLike
  34. def keysIterator: Iterator[Int]

    Only iterates "active" keys

    Only iterates "active" keys

    Definition Classes
    OpenAddressHashArrayArrayLike
  35. def length: Int

    Definition Classes
    ArrayLike
  36. var load: Int

    Attributes
    protected
  37. implicit val manElem: ClassTag[Elem]

    Attributes
    protected
  38. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  39. final def notify(): Unit

    Definition Classes
    AnyRef
  40. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  41. final def rehash(): Unit

    Attributes
    protected
  42. val size: Int

    How many elements are logically stored here.

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

    returns

    Definition Classes
    OpenAddressHashArrayArrayLikeStorage
  43. final def synchronized[T0](arg0: ⇒ T0): T0

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

    Definition Classes
    ArrayLike
  45. def toIndexedSeq: List[Elem]

    Definition Classes
    ArrayLike
  46. def toList: List[Elem]

    Definition Classes
    ArrayLike
  47. def toMap: Map[Int, Elem]

    Definition Classes
    ArrayLike
  48. def toString(): String

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

    Definition Classes
    OpenAddressHashArrayArrayLike
  50. def valueAt(i: Int): Elem

    same as data(i).

    same as data(i). Gives the value at the underlying offset.

    i

    index into the data array

    returns

    Definition Classes
    OpenAddressHashArrayStorage
  51. def valuesIterator: Iterator[Elem]

    Only iterates "active" elements

    Only iterates "active" elements

    Definition Classes
    OpenAddressHashArrayArrayLike
  52. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  53. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  54. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from Serializable

Inherited from Serializable

Inherited from ArrayLike[Elem]

Inherited from Storage[Elem]

Inherited from AnyRef

Inherited from Any

Ungrouped