An ArrayLike is something that can behave kind of like an Array, but isn't.
AutoUpdater wraps a Map such that any call to apply updates the map with an instance of the default value
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.
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.
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.
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.
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