breeze/breeze.collection.mutable

breeze.collection.mutable

package breeze.collection.mutable

Type members

Classlikes

class AutoUpdater[M, K, V](val theMap: M, default: => V)(implicit ev: M <:< Map[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

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

Companion
object
object AutoUpdater
Companion
class
@SerialVersionUID(1L)
class Beam[T](val maxSize: Int)(implicit val ordering: Ordering[T]) extends Iterable[T] with IBeam[T] with IterableOps[T, [A] =>> Iterable[A], 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.

Companion
object
object Beam
Companion
class
trait IBeam[T] extends Iterable[T] with Builder[T, IndexedSeq[T]] with Shrinkable[T] with Cloneable[IBeam[T]] with IterableOps[T, [A] =>> Iterable[A], IBeam[T]]
@SerialVersionUID(1L)
final class OpenAddressHashArray[@specialized(Int, Float, Long, Double) V] extends Storage[V] with SparseArrayLike[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.

Companion
object
object OpenAddressHashArray
Companion
class
class RingBuffer[A](val capacity: Int) extends AbstractBuffer[A] with IndexedBuffer[A] with IndexedSeqOps[A, [A] =>> RingBuffer[A], RingBuffer[A]] with StrictOptimizedSeqOps[A, [A] =>> RingBuffer[A], RingBuffer[A]] with DefaultSerializable with Builder[A, Seq[A]]
Companion
object
object RingBuffer
Companion
class
@SerialVersionUID(1L)
final class SparseArray[@specialized(Double, Int, Float, Long) V](var index: Array[Int], var data: Array[V], var used: Int, val size: Int, val default: V) extends SparseArrayLike[V] with Storage[V] with Serializable

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.

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.

Companion
object
object SparseArray
Companion
class
trait SparseArrayLike[V]

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

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

@SerialVersionUID(1L)
final class TriangularArray[T](val dimension: Int)(implicit evidence$1: ClassTag[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.

Value Params
dimension:

The size of the array

Companion
object
object TriangularArray
Companion
class