Type Members

1.  trait ArrayLike [V] extends AnyRef

   An ArrayLike is something that can behave kind of like an Array, but isn't.

   An ArrayLike is something that can behave kind of like an Array, but isn't. They have a fixed size and reasonably fast access times. The main difference is that they're sparse in one way or another. This includes breeze.collection.mutable.OpenAddressHashArrays and breeze.collection.mutable.SparseArray. They support several reasonable operations

2.  class ArrayMap [V] extends Map[Int, V] with MapLike[Int, V, ArrayMap[V]] with Serializable

   Wraps an ArrayBuffer with a Map.

   Wraps an ArrayBuffer with a Map. Note the odd behavior for -=

   The key must be nonnegative

   Chances are you want to change defValue, which is used to fill in blanks if you don't add things consecutively. Otherwise you get an Exception.

   Annotations

   @SerialVersionUID()

3.  class AutoUpdater [M, K, V] extends Map[K, V]

   AutoUpdater wraps a Map such that any call to apply updates the map with an instance of the default value

4.  class Beam [T] extends Iterable[T] with IBeam[T] with IterableLike[T, Beam[T]] with Serializable

   Represents a beam, which is essentially a priority queue with a maximum size.

   Represents a beam, which is essentially a priority queue with a maximum size.

   Annotations

   @SerialVersionUID()

5.  trait IBeam [T] extends Iterable[T] with IterableLike[T, IBeam[T]] with Builder[T, IndexedSeq[T]] with Shrinkable[T] with Cloneable[IBeam[T]]
6.  final class OpenAddressHashArray [V] extends Storage[V] with ArrayLike[V] with Serializable

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

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

   Annotations

   @SerialVersionUID()

7.  class RingBuffer [A] extends Buffer[A] with GenericTraversableTemplate[A, RingBuffer] with BufferLike[A, RingBuffer[A]] with Builder[A, List[A]]
8.  final class SparseArray [V] extends ArrayLike[V] with Storage[V] with Serializable

   A SparseArray is a sparse representation of an array using a two-array binary-search approach.

   A SparseArray is a sparse representation of an array using a two-array binary-search approach. There are two arrays: index and data, which together are pairs (i, v) of indices into the array and the value at that position.

   The default value is assumed to be null for AnyRef, and 0 for AnyVal types.

   Annotations

   @SerialVersionUID()

9.  class SparseArrayMap [T] extends Map[Int, T] with MapLike[Int, T, SparseArrayMap[T]] with Serializable

10.  final class TriangularArray [T] extends Serializable

    A TriangularArray is a jagged 2-d array where for every row r, we have an array of size dim - r.

    A TriangularArray is a jagged 2-d array where for every row r, we have an array of size dim - r.

    These are useful for parse charts.

    Annotations

    @SerialVersionUID()